Dealing with Nonuniformity in Data Centric Storage for Wireless Sensor Networks

In-network storage of data in Wireless Sensor Networks (WSNs) is considered a promising alternative to external storage since it contributes to reduce the communication overhead inside the network. Recent approaches to data storage rely on Geographic Hash Tables (GHT) for efficient data storage and retrieval. These approaches, however, assume that sensors are uniformly distributed in the sensor field, which is seldom true in real applications. Also they do not allow tuning the redundancy level in the storage according to the importance of the data to be stored. To deal with these issues, we propose an approach based on two mechanisms. The first is aimed at estimating the real network distribution. The second exploits data dispersal method based on the estimated network distribution. Experiments through simulation show that our approach approximates quite closely the real distribution of sensors and that our dispersal protocol sensibly reduces data losses due to unbalanced data load.

[1]  Stefano Chessa,et al.  Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards , 2007, Comput. Commun..

[2]  Ivan Stojmenovic,et al.  On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.

[3]  Andrea Vitaletti,et al.  Localized Techniques for Broadcasting in Wireless Sensor Networks , 2007, Algorithmica.

[4]  Stefano Chessa,et al.  Distributed Erasure Coding in Data Centric Storage for wireless sensor networks , 2009, 2009 IEEE Symposium on Computers and Communications.

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

[6]  Ramesh Govindan,et al.  Using hierarchical location names for scalable routing and rendezvous in wireless sensor networks , 2004, SenSys '04.

[7]  Ahmed Helmy,et al.  Rendezvous regions: a scalable architecture for service location and data-centric storage in large-scale wireless networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[8]  Stefano Chessa,et al.  Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks , 2007, 2007 International Conference on Mobile Data Management.

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

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

[11]  Jörg Kaiser,et al.  CHR: a distributed hash table for wireless ad hoc networks , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[12]  Ahmed Helmy,et al.  Efficient and robust geocasting protocols for sensor networks , 2005, Comput. Commun..

[13]  Christian Bettstetter The cluster density of a distributed clustering algorithm in ad hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[14]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[15]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[16]  Stefano Chessa,et al.  Data Centric Storage in Non-Uniform Sensor Networks , 2009 .

[17]  Ying Zhang,et al.  Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks , 2004, SenSys '04.

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

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