Abstract-In this paper, we study the critical transmitting range (CTR) for connectivity in mobile ad hoc networks. We prove that r M ¼ c ffiffiffiffiffi ffi ln n n q for some constant c ! 1, where r M is the CTR in the presence of M-like node mobility and n is the number of network nodes. Our result holds for an arbitrary mobility model M such that: 1) 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 w p 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 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.
The connectivity achievable in the presence of nodes mobility was first addressed in REF .
The critical transmitting range for connectivity in mobile ad hoc networks
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
Computer Science