Data-centric cooperative storage in wireless sensor network

Although commonly used sensor nodes are resource-limited devices, enabling cooperation among these devices can help building very powerful systems. Besides other characteristics, storage capabilities of individual sensor nodes have to be considered as this might be very small compared to the collected sensor data. The temporal availability of sink nodes or the importance of collected data are not equal for all nodes and, therefore, demand storage of the generated data locally for later retrieval. Furthermore, data items (detected events) may be collected at different rates, which can lead to hotspot-like storage requirements. In this paper, we introduce a data-centric cooperative storage mechanism for wireless senor networks. Our approach is based on Virtual Cord Protocol (VCP), a virtual relative position based efficient routing protocol that also provides means for data management, e.g. insert, get, delete, and replicate, as known from typical Distributed Hash Table (DHT) services. Data items are distributed deterministically over several nodes in the same vicinity. Thus, storing and retrieving data items typically require communication with local nodes. To maintain information about stored information, we use a bloom filter to track the nodes that are storing particular items.

[1]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[2]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[3]  Abdalkarim Awad,et al.  P2P-based routing and data management using the virtual cord protocol (VCP) , 2008, MobiHoc '08.

[4]  T. Herring THE GLOBAL POSITIONING SYSTEM , 1996 .

[5]  A. Varga,et al.  THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM , 2003 .

[6]  Abdalkarim Awad,et al.  Virtual Cord Protocol (VCP): A flexible DHT-like routing service for sensor networks , 2008, 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[7]  Deborah Estrin,et al.  Data-centric storage in sensornets , 2003, CCRV.

[8]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[9]  Tarek F. Abdelzaher,et al.  EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[10]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[11]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[12]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[13]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

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

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

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

[17]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[18]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[19]  Lei Shi,et al.  Advantages of virtual addressing for efficient and failure tolerant routing in sensor networks , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

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