Optimize Storage Placement in Sensor Networks

Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introduced in this paper to store the data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all data to a central place for archiving and reduce the communication cost induced by the network query. The objective of this paper is to address the storage node placement problem aiming to minimize the total energy cost for gathering data to the storage nodes and replying queries. We examine deterministic placement of storage nodes and present optimal algorithms based on dynamic programming. Further, we give stochastic analysis for random deployment and conduct simulation evaluation for both deterministic and random placements of storage nodes.

[1]  Deborah Estrin,et al.  Multiresolution storage and search in sensor networks , 2005, TOS.

[2]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

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

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

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

[6]  Bo Sheng,et al.  Data storage placement in sensor networks , 2006, MobiHoc '06.

[7]  François Baccelli,et al.  Stochastic geometry and architecture of communication networks , 1997, Telecommun. Syst..

[8]  Scott Shenker,et al.  Practical Data-Centric Storage , 2006, NSDI.

[9]  Prashant J. Shenoy,et al.  PRESTO: Feedback-Driven Data Management in Sensor Networks , 2006, IEEE/ACM Transactions on Networking.

[10]  Peter Desnoyers,et al.  Capsule: an energy-optimized object storage system for memory-constrained sensor devices , 2006, SenSys '06.

[11]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[12]  François Baccelli,et al.  Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks , 1999, Oper. Res..

[13]  Mingyan Liu,et al.  Data-gathering wireless sensor networks: organization and capacity , 2003, Comput. Networks.

[14]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[15]  Gustavo de Veciana,et al.  Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation , 2004, IEEE Journal on Selected Areas in Communications.

[16]  Bhaskar Krishnamachari,et al.  Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks , 2006, MobiHoc '06.

[17]  Bo Sheng,et al.  An Approximation Algorithm for Data Storage Placement in Sensor Networks , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

[18]  Rajmohan Rajaraman,et al.  The Cougar Project: a work-in-progress report , 2003, SGMD.

[19]  Peter Desnoyers,et al.  Ultra-low power data storage for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[20]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[21]  Wendi Heinzelman,et al.  Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks , 2022 .

[22]  Dimitrios Gunopulos,et al.  Microhash: an efficient index structure for fash-based sensor devices , 2005, FAST'05.

[23]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[24]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..