The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The random trip model: stability, stationary regime, and perfect simulation
IEEE/ACM Transactions on Networking (TON)
Understanding the simulation of mobility models with Palm calculus
Performance Evaluation
On the connectivity of dynamic random geometric graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Walkers on the Cycle and the Grid
SIAM Journal on Discrete Mathematics
MANETS: High Mobility Can Make Up for Low Transmission Power
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Information spreading in stationary Markovian evolving graphs
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Adaptive, direction-aware data dissemination for diverse sensor mobility
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Biased sink mobility with adaptive stop times for low latency data collection in sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Spatial node distribution of manhattan path based random waypoint mobility models with applications
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Information spreading in dynamic graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We introduce a new approach to model and analyze mobility. It is fully based on discrete mathematics and yields a class of mobility models, called the Markov Trace model. It can be viewed as the discrete version of the Random Trip model: including all variants of the Random Way-Point model [15]. We derive fundamental properties and explicit analytical formulas for the stationary probability distributions yielded by the Markov Trace model. Besides having a per-se interest, such results can be exploited to compute formulas and properties for concrete cases by just applying counting arguments. We apply the above general results to the discrete version of the Manhattan Random Way-Point. We get explicit formulas for the total stationary distribution and for two important conditional distributions: the agent spatial and the agent destination ones. Our method makes the analysis of complex mobile systems a feasible task. As a further evidence of this important fact, we model a complex vehicular-mobile system over a set of crossing streets. Several concrete issues are implemented such as parking zones, traffic lights, and variable vehicle speeds. By using a modular version of the Markov Trace model, we get explicit formulas for the stationary distributions yielded by this vehicular-mobile model as well.