Analysis of hop-distance relationship in spatially random sensor networks

Authors:
Serdar Vural;Eylem Ekici
Affiliations:
Ohio State University, Columbus, OH;Ohio State University, Columbus, OH
Venue:
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Year:
2005

Citing 3
Cited 11

Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Urban multi-hop broadcast protocol for inter-vehicle communication systems

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Organizing a global coordinate system from local information on an ad hoc sensor network

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks

Hop distances and flooding in wireless multihop networks with randomized beamforming

MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
MMSPEED: Multipath Multi-SPEED Protocol for QoS Guarantee of Reliability and Timeliness in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Underground structure monitoring with wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Secure probabilistic location verification in randomly deployed wireless sensor networks

Ad Hoc Networks
Underground coal mine monitoring with wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Performance evaluation of distance-hop proportionality on geometric graph models of dense sensor networks

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Error control in wireless sensor networks: a cross layer analysis

IEEE/ACM Transactions on Networking (TON)
Dynamic end-to-end capacity in IEEE 802.16 wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless sensor network-based fire detection, alarming, monitoring and prevention system for Bord-and-Pillar coal mines

Journal of Systems and Software
The distance-power consumption trade-off with the optimal number of relays for cooperative Wireless Sensor Networks

International Journal of Ad Hoc and Ubiquitous Computing
Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

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.