Bounds on hop distance in greedy routing approach in wireless ad hoc networks
Swades K. De, Antonio Mario Caruso, Tamalika Chaira, Stefano Chessa · International Journal of Wireless and Mobile Computing · 2006
Wireless ad hoc networks are characterized by random location of nodes, and the routes are generally multihop. A quantitative understanding of the relation between source-to-destination Euclidean distance and the hop count could provide us the knowledge about important network parameters such as granularity of localization, traffic load, end-to-end delay, delay jitter, and transmit power consumption. In this paper,...