Issue No. 10 - October (2010 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2010.98
Bo Sheng , Northeastern University, Boston, MA
Qun Li , College of William and Mary, Williamsburg, VA
Weizhen Mao , College of William and Mary, Williamsburg, VA
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.
Wireless sensor networks, data storage, data query.
W. Mao, Q. Li and B. Sheng, "Optimize Storage Placement in Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 9, no. , pp. 1437-1450, 2010.