Bounds on hop distance in greedy routing approach in wireless ad hoc networks
De S., Caruso A., Chaira T., Chessa S.
C.2.2 Network Protocols Wireless sensor networks
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: International journal of wireless and mobile computing (Print) 14 (2006): 131–140.
Publisher: Inderscience Enterprises,, Olney , Regno Unito
Back to previous page
@article{oai:it.cnr:prodotti:68349,
title = {Bounds on hop distance in greedy routing approach in wireless ad hoc networks},
author = {De S. and Caruso A. and Chaira T. and Chessa S.},
publisher = {Inderscience Enterprises,, Olney , Regno Unito},
journal = {International journal of wireless and mobile computing (Print)},
volume = {14},
pages = {131–140},
year = {2006}
}
0000-0002-1248-9478