Towards energy-efficient storage placement in large scale sensor networks

Abstract

Data storage has become an important issue for energy efficient data management in sensor networks. In this paper, we investigate the optimized storage placement problem in large scale sensor networks, aiming to achieve minimized energy cost. In order to efficiently deal with large scale deployment areas with irregular shape, we propose to utilize the hop as the computation unit instead of the node, such that computation complexity can be greatly reduced. We propose methodologies to solve the optimization problem both in situations for limited and unlimited numbers of storage units. The ultimate goal of this paper is to give fundamental guidance for optimized storage placement in large scale sensor networks. Simulation results show that our methodologies can greatly reduce the overall energy consumption compared to other strategies.

Keywords

data storage / optimization / storage placement / sensor network / large scale

References

[1] MaddenS, FranklinM J, HellersteinJ M, HongW. Tag: a tiny aggregation service for ad-hoc sensor networks. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation. 2002, 131-146

[2] ScottS, SylviaR, BradK, RameshG, DeborahE. Data-centric storage in sensornets. ACM SIGCOMM Computer Communication Review, 2003, 33(1): 137-142

[3] MaddenS, FranklinM J, HellersteinJ M, HongW. Tag: a tiny aggregation service for ad-hoc sensor networks. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation. 2002, 36(S1): 131-146

[4] KapadiaS, KrishnamachariB. Comparative analysis of push-pull query strategies for wireless sensor networks. In: Proceedings of the 2nd IEEE International Conference on Distributed Computing in Senior Systems. 2006, 4026: 185-201

[5] ShengB, LiQ, MaoW. Data storage placement in sensor networks. In: Proceedings of the ACM MobiHoc. 2006, 344-355

[6] SylviaR, BradK, ScottS, DeborahE, RameshG, LiY, FangY. Datacentric storage in sensornets with GHT, a geographic hash table. Mobile Net-works and Applications, 2003, 8(4): 427-442

[7] DeepakG, DeborahE, JohnH. Dimensions: why do we need a new data handling architecture for sensor networks. ACM SIGCOMM Computer Communication Review, 2003, 33(1): 143-148

[8] LiX, KimY J, GovindanR, HongW. Multi-dimensional range queries in sensor networks. In: Proceedings of the ACM Sensys. 2003, 63-75

[9] SarkarR, ZhuX J, GaoJ. Double rulings for information brokerage in sensor networks. In: Proceedings of the ACM MOBICOM. 2006, 286-297

[10] LiuX, HuangQ, ZhangY. Combs, needles,haystacks: balancing push and pull for discovery in large-scale sensor networks. In: Proceedings of the ACM Sensys. 2004, 122-133

[11] FangQ, GaoJ, GuibasL J. Landmark-based information storage and retrieval in sensor networks. In: Proceedings of the IEEE INFOCOM. 2006, 1-12

[12] TrigoniN, YaoY, DemersA, GehrkeJ, RajaramanR. Hybrid push-pull query processing for sensor networks. GI Jahrestagung, 2004, 1(2): 370-374

[13] AhnJ, KrishnamachariB. Fundamental scaling laws for energyefficient storage and querying in wireless sensor networks. In: Proceedings of the ACM MobiHoc. 2006, 334-343

[14] BhatnagarN, GreenanK M, WachaR, MillerE L, LongD D E. Energy-reliability tradeoffs in sensor network storage. In: Proceedings of the ACM Hot EmNets. 2008

[15] XingK, ChengX, LiJ, SongM. Location-centric storage and query in wireless sensor networks. Wireless Networks, 2010, 16(4): 955-967

[16] ZhaoM, YangY. Bounded relay hop mobile data gathering in wireless sensor networks. IEEE Transactions on Computers, 2012, 61(2): 265-277

[17] Sariel-TalayS, ErgenE, AvdanG, ErogluC. Sensor-based data storage for search and rescue. In: Proceedings of the Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP). 2008, 7-12

[18] ZhangW, CaoG, LaPortaT F. Data dissemination with ring-based index for wireless sensor networks. In: Proceedings of the IEEE ICNP. 2003, 305-314

[19] AlyM, PruhsK, ChrysanthisP K. KDDCS: a load-balanced innetwork data-centric storage scheme for sensor networks. In: Proceedings of the ACM International Conference on Information and Knowledge Management. 2006, 317-326

[20] YuZ, XiaoB, ZhouS. Achieving optimal data storage position in wireless sensor networks. Computer Communications, 2010, 33(1): 92-102

[21] ChiuG M, YenL H, ChinT L. Optimal storage placement for treestructured networks with heterogeneous channel costs. IEEE Transactions on Computers, 2011, 60(10): 1431-1444

[22] YangG, QiaoD. Multi-round sensor deployment for guaranteed barrier coverage. In: Proceedings of the IEEE INFOCOM. 2010

[23] ZhangY, YinL, ZhaoJ, CaoG. Balancing the trade-offs between query delay and data availability in manets. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(4): 643-650

[24] ShengB, LiQ, MaoW. Optimize storage placement in sensor networks. IEEE Transactions on Mobile Computing, 2010, 9(10): 1437-1450

[25] ShengB, LiQ, MaoW. An approximation algorithm for data storage placement in sensor networks. In: Proceedings of the International Conference on Wineless Algorithms, Systems and Applications. 2007, 1-9

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg