A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
On k-connectivity for a geometric random graph
Random Structures & Algorithms
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Ad-hoc Networks: Fundamental Properties and Network Topologies
Ad-hoc Networks: Fundamental Properties and Network Topologies
Stochastic link-level dynamics in mobile ad-hoc networks: several interesting aspects
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
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
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Information propagation speed in mobile and delay tolerant networks
IEEE Transactions on Information Theory
Modelling mobility: a discrete revolution
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On the communication range in auction-based multi-agent target assignment
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Modelling mobility: A discrete revolution
Ad Hoc Networks
Value of incomplete information in mobile target allocation
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
Parsimonious flooding in geometric random-walks
DISC'11 Proceedings of the 25th international conference on Distributed computing
On mobile target allocation with incomplete information in defensive environments
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Opportunistic MANETs: mobility can make up for low transmission power
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.06 |
We provide the first analytical results for the connectivity of dynamic random geometric graphs --- a model of mobile wireless networks in which vertices move in random directions, and an edge exists between two vertices if their Euclidean distance is below a given value. We provide precise asymptotic results for the expected length of the connectivity and disconnectivity periods of the network. We believe the formal tools developed in this work could be of use in more concrete settings, in the same manner as the development of connectivity threshold for static random geometric graphs has affected a lot of research done on ad hoc networks. In the process of proving results for the dynamic case we also obtain new asymptotically precise bounds for the probability of the existence of a component of fixed size l, l ≥ 2, for the static case.