@INPROCEEDINGS {qun_mobihoc06,
	author = {Bo Sheng and Qun Li and Weizhen Mao},
	booktitle = {{ACM} International Symposium on Mobile Ad Hoc Networking and Computing ({Mobihoc})},
	PAGES = {344--355},
	TITLE = {Data Storage Placement in Sensor Networks},
	Address ={Florence, Italy},
	Month={May},
	YEAR = {2006}
	}

Abstract 


Data storage has become an important issue in sensor networks as a
large amount of collected data needs to be archived for future
information retrieval. This paper proposes to introduce storage
nodes that can store data collected from the sensors in their
proximities. The storage nodes alleviate the heavy load of
transmitting all the data to a central place for archiving and
reduce the communication cost induced by the network query. This
paper considers the storage node placement problem to minimize the
total power consumption for data funnelling to the storage nodes
and data query. We examine deterministic placement of storage
nodes and present several optimal algorithms based on dynamic
programming. Further, we give stochastic analysis and conduct
simulation evaluation for two models of storage node placement.