Analysis of hop-distance relationship in spatially random sensor networks
- 25 May 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 320-331
- https://doi.org/10.1145/1062689.1062730
Abstract
In spatially random sensor networks, estimating the Euclidean distance covered by a packet in a given number of hops carries a high importance for various other methods such as localization and distance estimations. The inaccuracies in such estimations motivate this study on the distribution of the Euclidean distance covered by a packet in spatially random sensor networks in a given number of hops. Although a closed-form expression of distance distribution cannot be obtained, highly accurate approximations are derived for this distribution in one dimensional spatially random sensor networks. Using statistical measures and numerical examples, it is also shown that the presented distribution approximation yields very high accuracy even for small number of hops. A discussion on how these principles can be extended to the analysis of the same problem in two dimensional networks is also provided.Keywords
This publication has 5 references indexed in Scilit:
- Urban multi-hop broadcast protocol for inter-vehicle communication systemsPublished by Association for Computing Machinery (ACM) ,2004
- DV Based Positioning in Ad Hoc NetworksTelecommunication Systems, 2003
- Ad hoc positioning system (APS)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Independent Component AnalysisPublished by Wiley ,2001
- Critical connectivity phenomena in multihop radio modelsIEEE Transactions on Communications, 1989