Analysis of Wired Short Cuts in Wireless Sensor Networks

Authors:
Rohan Chitradurga;Ahmed Helmy
Affiliations:
University of Southern California, Los Angeles;University of Southern California, Los Angeles
Venue:
ICPS '04 Proceedings of the The IEEE/ACS International Conference on Pervasive Services
Year:
2004

Citing 0
Cited 8

Hybrid sensor networks: a small world

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the design of heterogeneous sensor networks based on small world concepts

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
A case for hybrid sensor networks

IEEE/ACM Transactions on Networking (TON)
Improving an over-the-air programming protocol for wireless sensor networks based on small world concepts

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
On the design of resilient heterogeneous wireless sensor networks based on small world concepts

Computer Networks: The International Journal of Computer and Telecommunications Networking
Detection of reactive jamming in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Distributed estimation over complex networks

Information Sciences: an International Journal
Scale-free topology evolution for wireless sensor networks with reconstruction mechanism

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the use of wired short cuts in sensor networks. This new paradigm augments a sensor network with a very limited wired infrastructure to improve its overall energy-efficiency. Energy-efficiency is obtained by reduction in average path length. We have developed an analytical model to analyze the gain in path length reduction by using short cuts. We have also conducted extensive simulations to validate our analysis. Our results show that there is an optimal wire length for which the path length reduction is at its maximum, beyond which it decreases. The optimal length is only a small fraction (37.8-50%) of the network diameter. In a network with 1000 nodes uniformly distributed on a disk the path length reduction saturates at 60-70% with 5-24 wires, depending on the location of the sink. Also, we find that restricting the knowledge about the wires to 2 hops does not degrade the performance from the case when we have global knowledge of all wires. These results show promise of the new paradigm.