Bounds on hop distance in greedy routing approach in wireless ad hoc networks. (19th February 2007)

• Record Type: Journal Article
• Authors: De, Swades; Caruso, Antonio; Chaira, Tamalika; Chessa, Stefano
• Is Part Of: International journal of wireless and mobile computing. Volume 1:Number 2(2006)
• Page Start: 131
• Page End: 140
• Publication Date: 2007-02-19
• Subjects: ad hoc networks -- greedy routing -- probabilistic bounds -- wireless networks -- hop count -- Euclidean distance -- power consumption -- node localisation; Mobile computing -- Periodicals; Wireless communication systems -- Periodicals; 004.6
• Languages: English
• ISSNs: 1741-1084

Abstract

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.