On k-connectivity for a geometric random graph
Random Structures & Algorithms
Smooth is better than sharp: a random mobility model for simulation of wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks
MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the second ACM international workshop on Principles of mobile computing
The Spatial Node Distribution of the Random Waypoint Mobility Model
Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the 9th annual international conference on Mobile computing and networking
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Combinatorics, Probability and Computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Delay of intrusion detection in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
The study and simulation of connectivity based routing protocols in ad hoc networks
Proceedings of the 1st international conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications
Mobility-aware topology control in mobile ad hoc networks
Computer Communications
A unified model for joint throughput-overhead analysis of mobile ad hoc networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Prediction Based Mobile Data Aggregation in Wireless Sensor Network
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Sensitivity of critical transmission ranges to node placement distributions
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
A unified model for joint throughput-overhead analysis of random access mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Sensor Networks
On the connectivity analysis over large-scale hybrid wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal transmission power of wireless sensors for real-time systems in ship area networks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
A performance model of neighbor discovery in proactive routing protocols
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
On the communication range in auction-based multi-agent target assignment
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Effect of multiple hops on network lifetime and energy consumption in a wireless sensor network
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Optimal transmission power with delay constraints in 2D and 3D MANETs
Journal of Parallel and Distributed Computing
Value of incomplete information in mobile target allocation
MATES'11 Proceedings of the 9th German conference on Multiagent system technologies
Coverage extension by means of non-conventional multi-hop communications
Computer Communications
An efficient relay sensors placing algorithm for connectivity in wireless sensor networks
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
On the lifetime of node-to-node communication in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Centrality-based power control for hot-spot mitigation in multi-hop wireless networks
Computer Communications
On connectivity of airborne networks with unpredictable flight path of aircrafts
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
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
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
In this paper, we study the critical transmitting range (CTR) for connectivity in mobile ad hoc networks. We prove that r_{\cal M}=c\sqrt{{\ln n\over \pi n}} for some constant c\ge 1, where r_{\cal M} is the CTR in the presence of {\cal M}{\hbox{-}}\rm like node mobility and n is the number of network nodes. Our result holds for an arbitrary mobility model {\cal M} such that: 1) {\cal M} is obstacle free and 2) nodes are allowed to move only within a certain bounded area. We also investigate in detail the case of random waypoint mobility, which is the most common mobility model used in the simulation of ad hoc networks. Denoting with r_p^w the CTR with random waypoint mobility when the pause time is set to p and node velocity is set to v, we prove that r_p^w= {p+ {0.521405\over v}\over p}\sqrt{{\ln n\over \pi n}} if p0 and that r_0^w \gg \sqrt{{\ln n\over n}}. The results of our simulations also suggest that if n is large enough (n\ge 50), r_0^w is well approximated by {r\over 4}\ln n, where r is the critical range in case of uniformly distributed nodes. The results presented in this paper provide a better understanding of the behavior of a fundamental network parameter in the presence of mobility and can be used to improve the accuracy of mobile ad hoc network simulations.