Robust Data Dissemination for Wireless Sensor Networks in Hostile Environments

An important research issue in large scale wireless sensor networks is to efficiently deliver data per user requests, which is referred to as data dissemination. This chapter studies data dissemination in wireless sensor networks deployed in hostile environments. In such type of networks, external catastrophic events can damage sensors at a large scale, which may cause data loss or disconnect data transmission paths. This chapter presents a novel data dissemination protocol, RObust dAta Dissemination (ROAD), which can sustain data dissemination when large scale sensor failures occur. In ROAD, events are differentiated based on types. For each type of event, data are replicated to a set of sensors forming a specific geographical trajectory. When facing catastrophic events, since sensors forming a trajectory are unlikely to be damaged simultaneously, surviving sensors can restore the trajectory and resume data dissemination. Simulation results show that ROAD is robust against large scale sensor failures while presenting low communication overhead, high reliability and short response time.

[1]  Peter Desnoyers,et al.  TSAR: a two tier sensor storage architecture using interval skip graphs , 2005, SenSys '05.

[2]  K. Glasgow,et al.  Los Angeles, California , 2003 .

[3]  Young-Jin Kim,et al.  Multi-dimensional range queries in sensor networks , 2003, SenSys '03.

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

[5]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[6]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM 2004.

[7]  Leonidas J. Guibas,et al.  Landmark-Based Information Storage and Retrieval in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  B. R. Badrinath,et al.  Trajectory based forwarding and its applications , 2003, MobiCom '03.

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

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

[11]  Jens Grossklags,et al.  Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks , 2003, Mobile Data Management.

[12]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

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

[15]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[16]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[17]  Lixia Zhang,et al.  Recursive position estimation in sensor networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

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

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

[20]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[21]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..