The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2010 vol.9)
pp: 1437-1450
Bo Sheng , Northeastern University, Boston, MA
Qun Li , College of William and Mary, Williamsburg, VA
Weizhen Mao , College of William and Mary, Williamsburg, VA
ABSTRACT
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.
INDEX TERMS
Wireless sensor networks, data storage, data query.
CITATION
Bo Sheng, Qun Li, Weizhen Mao, "Optimize Storage Placement in Sensor Networks", IEEE Transactions on Mobile Computing, vol.9, no. 10, pp. 1437-1450, October 2010, doi:10.1109/TMC.2010.98
REFERENCES
[1] P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[2] E.J. Duarte-Melo and M. Liu, "Data-Gathering Wireless Sensor Networks: Organization and Capacity," Computer Networks (COMNET), vol. 43, no. 4, pp. 519-537, Nov. 2003.
[3] R.C. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks," Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SPNA), May 2003.
[4] B. Sheng, Q. Li, and W. Mao, "Data Storage Placement in Sensor Networks," Proc. ACM MobiHoc, pp. 344-355, 2006.
[5] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks," SIGOPS Opererating Systems Rev., vol. 36, no. SI pp. 131-146, 2002.
[6] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "The Design of an Acquisitional Query Processor for Sensor Networks," Proc. ACM SIGMOD, pp. 491-502, 2003.
[7] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-Efficient Communication Protocols for Wireless Microsensor Networks," Proc. Int'l Conf. System Sciences, Jan. 2000.
[8] S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin, "Data-Centric Storage in Sensornets," SIGCOMM Computer Comm. Rev., vol. 33, no. 1, pp. 137-142, 2003.
[9] S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin, and F. Yu, "Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table," Mobile Networks and Applications, vol. 8, no. 4, pp. 427-442, 2003.
[10] J. Newsome and D. Song, "GEM: Graph Embedding for Routing and Data-Centric Storage in Sensor Networks without Geographic Information," Proc. First Int'l Conf. Embedded Networked Sensor Systems, pp. 76-88, 2003.
[11] Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic Routing Made Practical," Proc. Second USENIX Symp. Networked Systems Design and Implementation (NSDI '05), May 2005.
[12] C.T. Ee, S. Ratnasamy, and S. Shenker, "Practical Data-Centric Storage," Proc. Third USENIX Symp. Networked Systems Design and Implementation (NSDI '06), May 2006.
[13] J. Ahn and B. Krishnamachari, "Fundamental Scaling Laws for Energy-Efficient Storage and Querying in Wireless Sensor Networks," Proc. Seventh ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 334-343, 2006.
[14] D. Ganesan, B. Greenstein, D. Estrin, J. Heidemann, and R. Govindan, "Multiresolution Storage and Search in Sensor Networks," ACM Trans. Storage, vol. 1, no. 3, pp. 277-315, 2005.
[15] M. Li, D. Ganesan, and P. Shenoy, "PRESTO: Feedback-Driven Data Management in Sensor Networks," Proc. Third USENIX Symp. Networked Systems Design and Implementation (NSDI '06), May 2006.
[16] A. Demers, J. Gehrke, R. Rajaraman, N. Trigoni, and Y. Yao, "The Cougar Project: A Work-in-Progress Report," SIGMOD Record, vol. 32, no. 4, pp. 53-59, 2003.
[17] J. Gehrke and S. Madden, "Query Processing in Sensor Networks," IEEE Pervasive Computing, vol. 3, no. 1, pp. 46-55, Jan. 2004.
[18] G. Mathur, P. Desnoyers, D. Ganesan, and P. Shenoy, "Ultra-Low Power Data Storage for Sensor Networks," Proc. Fifth Int'l Conf. Information Processing in Sensor Networks, pp. 374-381, 2006.
[19] D. Zeinalipour-Yazti, S. Lin, V. Kalogeraki, D. Gunopulos, and W.A. Najjar, "MicroHash: An Efficient Index Structure for Flash-Based Sensor Devices," Proc. Fourth USENIX Conf. File and Storage Technologies, 2005.
[20] G. Mathur, P. Desnoyers, D. Ganesan, and P. Shenoy, "CAPSULE: An Energy-Optimized Object Storage System for Memory-Constrained Sensor Devices," Proc. Fourth Int'l Conf. Embedded Networked Sensor Systems, 2006.
[21] F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, "Stochastic Geometry and Architecture of Communication Networks," J. Telecomm. Systems, vol. 7, pp. 209-227, 1997.
[22] F. Baccelli and S. Zuyev, "Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks," Operations Research, vol. 47, no. 4, pp. 619-631, 1999.
[23] S.J. Baek, G. de Veciana, and X. Su, "Minimizing Energy Consumption in Large-Scale Sensor Networks through Distributed Data Compression and Hierarchical Aggregation," IEEE J. Selected Areas Comm., special issue on fundamental performance limits of wireless sensor networks, vol. 22, no. 6, pp. 1130-1140, Aug. 2004.
[24] B. Sheng, C.C. Tan, Q. Li, and W. Mao, "An Approximation Algorithm for Data Storage Placement in Sensor Networks," Proc. Second Int'l Conf. Wireless Algorithms, Systems and Applications (WASA '07), Aug. 2007.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool