WLCp1-15: Optimal Transmission Range with Delay Constraints for Mobile Wireless Networks

Assuming that all mobile nodes (MNs) have the same transmission range, the actual hop count between any two MNs is proportional to the distance between them. Based on the found relation between distance and hop count, the required hop count between two MNs can be accurately estimated, given the distance between them. Using the distribution of distance between MNs, this paper also suggests the optimal transmission range of MNs, which can guarantee delay constraints of a requested ratio of connections in an entire network.

[1]  Paolo Santi.  The critical transmitting range for connectivity in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[2]  Jie Wu,et al.  SMART: a scan-based movement-assisted sensor deployment method in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[4]  Sarvar Patel,et al.  Efficient authentication and key distribution in wireless IP networks , 2003, IEEE Wireless Communications.

[5]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[6]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[7]  Dharma P. Agrawal,et al.  Introduction to Wireless and Mobile Systems , 2002 .

[8]  Dario Pompili,et al.  On the interdependence of distributed topology control and geographical routing in ad hoc and sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[9]  Paramvir Bahl,et al.  A cone-based distributed topology-control algorithm for wireless multi-hop networks , 2005, IEEE/ACM Transactions on Networking.

[10]  Anxiao Jiang,et al.  Monotone percolation and the topology control of wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Gustavo de Veciana,et al.  Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation , 2004, IEEE Journal on Selected Areas in Communications.

[12]  Sayandev Mukherjee,et al.  On the Probability Distribution of the Minimal Number of Hops Between any Pair of Nodes in a Bounded Wireless Ad-Hoc Network Subject to Fading , 2005 .

[13]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[14]  John P. Mullen.  Robust approximations to the distribution of link distances in a wireless network occupying a rectangular region , 2003, MOCO.

[15]  J. Eberspacher,et al.  Hop distances in homogeneous ad hoc networks , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

[16]  W. C. Jakes,et al.  Mobile Radio Propagation , 1974 .

[17]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[18]  S. Sitharama Iyengar,et al.  Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[19]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[20]  Leonard E. Miller,et al.  Distribution of Link Distances in a Wireless Network , 2001, Journal of research of the National Institute of Standards and Technology.

[21]  Jennifer C. Hou,et al.  On the critical total power for asymptotic k-connectivity in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..