A virtual infrastructure for large-scale wireless sensor networks

The primary goal of a wireless sensor network is to collect useful information from the network. Most wireless sensor networks are assumed that the number of nodes are very large and they should operate with confined resources. Consequently it is important to take a scalable and energy-efficient architecture. In this paper, we present Railroad, a data collection and topology management architecture for large-scale wireless sensor networks. It proactively exploits a virtual infrastructure called Rail, which acts as a rendezvous area of the event data and queries. By using Rail, Railroad achieves scalability and energy efficiency under dynamic conditions with multiple mobile observers and targets. We evaluate the communication cost and the hot area message complexity of Railroad and compare them with previous approaches. We evaluate communication cost of Railroad by both an analytic model and simulations.

[1]  Chien-Chung Shen,et al.  Sensor information networking architecture and applications , 2001, IEEE Wirel. Commun..

[2]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[4]  Matt Welsh,et al.  Simulating the power consumption of large-scale sensor network applications , 2004, SenSys '04.

[5]  Loren Schwiebert,et al.  Distributed Perimeter Detection in Wireless Sensor Networks , 2004 .

[6]  Koen Langendoen,et al.  An adaptive energy-efficient MAC protocol for wireless sensor networks , 2003, SenSys '03.

[7]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[8]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[9]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[10]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

[11]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[12]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[13]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[14]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[15]  Byung-Jae Kwak,et al.  On the scalability of ad hoc networks: a traffic analysis at the center of a network , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[16]  Thomas F. La Porta,et al.  Data Dissemination with Ring-Based Index for Wireless Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[17]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[18]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[19]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[20]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.