On the hop count statistics for randomly deployed wireless sensor networks

Authors:
Stefan Dulman;Michele Rossi;Paul Havinga;Michele Zorzi
Affiliations:
EWI Faculty, University of Twente, The Netherlands.;Department of Information Engineering, University of Padova, Italy.;EWI Faculty, University of Twente, The Netherlands.;Department of Information Engineering, University of Padova, Italy
Venue:
International Journal of Sensor Networks
Year:
2006

Citing 6
Cited 12

Unit disk graphs

Discrete Mathematics - Topics on domination
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
The Spatial Node Distribution of the Random Waypoint Mobility Model

Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002
Robust approximations to the distribution of link distances in a wireless network occupying a rectangular region

ACM SIGMOBILE Mobile Computing and Communications Review
Error characteristics of ad hoc positioning systems (aps)

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance

IEEE Transactions on Mobile Computing

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
Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Placing and maintaining a core node in wireless ad hoc sensor networks

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Tunable locally-optimal geographical forwarding in wireless sensor networks with sleep-wake cycling nodes

INFOCOM'10 Proceedings of the 29th conference on Information communications
Diffusion-based approach to deploying wireless sensor networks

International Journal of Sensor Networks
Probability of k-hop connection under random connection model

IEEE Communications Letters
Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints

Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of communication/networking in Smart Grids

Future Generation Computer Systems
Coverage extension by means of non-conventional multi-hop communications

Computer Communications
Theory and algorithms for hop-count-based localization with random geometric graph models of dense sensor networks

ACM Transactions on Sensor Networks (TOSN)
Dimensioning self-sufficient networks of energy harvesting embedded devices

WiFlex'13 Proceedings of the First international conference on Wireless Access Flexibility
A stochastic process model of the hop count distribution in wireless sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless sensor network) to design improved networking protocols. Specifically, we derive the relationship between the number of hops separating two nodes and the physical distance between them (one- and two- dimensional topologies). In this way, distance estimates between nodes are made available without the use of any distance measuring hardware. We conclude the paper showing how the obtained statistical results can be applied to improve the performance of distributed localisation protocols while simplifying their implementation.