On hop count and Euclidean distance in greedy forwarding in wireless ad hoc networks

Document Type

Article

Publication Date

11-1-2005

Abstract

In this letter, a probabilistic analysis is presented that captures the bounds on hop count from a given Euclidean distance between two nodes and vice versa in a greedy forwarding in wireless ad hoc networks. Accuracy of the analysis is verified via network simulations. The results could be useful in ad hoc and sensor network design and performance evaluation. © 2005 IEEE.

Identifier

28244449780 (Scopus)

Publication Title

IEEE Communications Letters

External Full Text Location

https://doi.org/10.1109/LCOMM.2005.11019

ISSN

10897798

First Page

1000

Last Page

1002

Issue

11

Volume

9

Grant

0435250

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS