Energy-efficient data redistribution in sensor networks

We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how to redistribute the data efficiently under limited storage and energy constraints at the sensor nodes. The goal of the redistribution scheme is to minimize the energy consumption during the process, while guaranteeing full utilization of the distributed storage capacity in the DISNs. We formulate this problem as a minimum cost flow problem, which can be solved optimally. However, the optimal solution's centralized nature makes it unsuitable for large-scale distributed sensor networks. We thus design a distributed algorithm for the data redistribution problem which performs very close to the optimal, and compare its performance with various intuitive heuristics. Our proposed algorithm relies on potential function based computations, incurs limited message and computational overhead at both the sensor nodes and data generator nodes, and is easily implementable in a distributed manner. We analytically show the convergence of our algorithm, and demonstrate its near-optimal performance and scalability under various network scenarios considered. Finally, we implement our distributed algorithm in TinyOS and evaluate it using TOSSIM simulator, and show that it outperforms EnviroStore, the only existing scheme for data redistribution in sensor networks, in both solution quality and overhead messages.

[1]  Guohong Cao,et al.  Distributed Monitoring and Aggregation in Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[2]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[3]  Wendi B. Heinzelman,et al.  A Survey of Visual Sensor Networks , 2009, Adv. Multim..

[4]  Ian F. Akyildiz,et al.  A survey on wireless multimedia sensor networks , 2007, Comput. Networks.

[5]  Kirk Martinez,et al.  Glacsweb: a sensor network for hostile environments , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[6]  Stavros Toumpis,et al.  Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics , 2008, Comput. Networks.

[7]  Yunhao Liu,et al.  Capacity of large scale wireless networks under Gaussian channel model , 2008, MobiCom '08.

[8]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[9]  Leonidas J. Guibas,et al.  Distributed resource management and matching in sensor networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[10]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[11]  Tarek F. Abdelzaher,et al.  EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  James B. Orlin A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[13]  Peter I. Corke,et al.  Data collection, storage, and retrieval with an underwater sensor network , 2005, SenSys '05.

[14]  Lili Wang,et al.  Design, implementation, and evaluation of EnviroMic: A storage-centric audio sensor network , 2009, TOSN.

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

[16]  Samir Khuller,et al.  Algorithms for data migration with cloning , 2003, SIAM J. Comput..

[17]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[18]  Andrew R. Siegel,et al.  MADRE: The Memory-Aware Data Redistribution Engine , 2008, PVM/MPI.

[19]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[20]  Geoffrey H. Kuenning,et al.  Electric-field-based routing: a reliable framework for routing in MANETs , 2004, MOCO.

[21]  Bruce Hendrickson,et al.  Interprocessor communication with limited memory , 2004, IEEE Transactions on Parallel and Distributed Systems.

[22]  John S. Heidemann,et al.  T-Lohi: A New Class of MAC Protocols for Underwater Acoustic Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[23]  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..

[24]  M. Erwig The graph Voronoi diagram with applications , 2000 .

[25]  Bernhard Plattner,et al.  Density-based anycast: a robust routing strategy for wireless ad hoc networks , 2008, TNET.

[26]  Matt Welsh,et al.  Fidelity and yield in a volcano monitoring sensor network , 2006, OSDI '06.

[27]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.