论文信息 - On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks

On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks

In this letter, a probabilistic analysis is presented that captures the bounds on hop count from a given Euclidean distance between two nodes and vice versa in a greedy forwarding in wireless ad hoc networks. Accuracy of the analysis is verified via network simulations. The results could be useful in ad hoc and sensor network design and performance evaluation.

Swades De | S. De

[1] Martin Mauve,et al. A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[2] Brad Karp,et al. GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[3] Leonard Kleinrock,et al. Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[4] Ting-Chao Hou,et al. Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[5] Scott Shenker,et al. Geographic routing without location information , 2003, MobiCom '03.

[6] Radhika Nagpal,et al. Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network , 2003, IPSN.

[7] Piet Van Mieghem,et al. Degree distribution and hopcount in wireless ad-hoc networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[8] John A. Silvester,et al. Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .