De S., Caruso A., Chiara T., Chessa S.
Ad hoc networks Sensor networks Greedy routing
Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.
Source: ISTI Technical reports, pp.131–140, 2004
@techreport{oai:it.cnr:prodotti:160664, title = {Bounds on Hop Distance in Greedy Routing Approach in Wireless Ad Hoc Networks}, author = {De S. and Caruso A. and Chiara T. and Chessa S.}, institution = {ISTI Technical reports, pp.131–140, 2004}, year = {2004} }