Abstract. 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, we present an analytic approach to evaluate the average and bounds on hop count for a given source-to-destination Euclidean distance in greedy routing approach in wireless ad hoc networks. We also show that from the distribution characteristic of per-hop progress, the bounds on Euclidean distance from a given hop count can be obtained numerically. Our analytic and numerical results are verified by discrete event network simulations.
De the bounds on the hop distance in greedy routing REF .
Bounds on hop distance in greedy routing approach in wireless ad hoc networks
IJWMC
Computer Science