Bounds on hop distance in greedy routing approach in wireless ad hoc networks

Document Type

Article

Publication Date

1-1-2006

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. Copyright © 2006 Inderscience Enterprises Ltd.

Identifier

37849044397 (Scopus)

Publication Title

International Journal of Wireless and Mobile Computing

External Full Text Location

https://doi.org/10.1504/IJWMC.2006.012472

e-ISSN

17411092

ISSN

17411084

First Page

131

Last Page

140

Issue

2

Volume

1

This document is currently not available here.

Share

COinS