Title :
On hop count and euclidean distance in greedy forwarding in wireless ad hoc networks
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Abstract :
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.
Keywords :
ad hoc networks; numerical analysis; probability; telecommunication network routing; wireless sensor networks; Euclidean distance; Greedy forwarding; hop count; network routing; network simulation; probabilistic analysis; sensor network design; wireless ad hoc network; Ad hoc networks; Analytical models; Euclidean distance; Intelligent networks; Mobile ad hoc networks; Peer to peer computing; Power control; Routing; Sensor phenomena and characterization; Spread spectrum communication;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2005.11019
