Enhancing data persistence for energy constrained networks by network modulation

Maintaining data persistence in a scalable fashion for large-scale distributed systems has become critical and essential. It becomes more challenging when nodes have finite energy. In this work, we propose a novel approach called network modulation (NeMo) to significantly improve the data persistence. Built on algebraic number theory, NeMo operates at the level of modulated symbols. Its core notion is to mix data at intermediate network nodes and meanwhile guarantee the symbol recovery at the sink(s) without pre-storing or waiting for other symbols. The persistence performance of NeMo has been evaluated by simulations to show that the proposed approach is efficient to enhance the data persistence for energy-constrained networks.

[1]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[2]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[3]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[4]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[5]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[6]  Zhen Liu,et al.  Maximizing the Data Utility of a Data Archiving & Querying System through Joint Coding and Scheduling , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[7]  Baochun Li,et al.  Differentiated Data Persistence with Priority Random Linear Codes , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[8]  Babak Hassibi,et al.  On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.

[9]  Qian Zhang,et al.  Partial Network Coding: Theory and Application for Continuous Sensor Data Collection , 2006, 200614th IEEE International Workshop on Quality of Service.

[10]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  Hayder Radha,et al.  Natural growth codes: Partial recovery under random network coding , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[12]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[13]  Jörg Widmer,et al.  Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[14]  Vinod M. Prabhakaran,et al.  Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[15]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[16]  Alexandros G. Dimakis,et al.  Unequal Growth Codes: Intermediate Performance and Unequal Error Protection for Video Streaming , 2007, 2007 IEEE 9th Workshop on Multimedia Signal Processing.

[17]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[19]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[20]  Jon Feldman,et al.  Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM 2006.

[21]  Georgios B. Giannakis,et al.  Space-time diversity systems based on linear constellation precoding , 2003, IEEE Trans. Wirel. Commun..

[22]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[23]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[24]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[25]  Andrea J. Goldsmith,et al.  Design challenges for energy-constrained ad hoc wireless networks , 2002, IEEE Wirel. Commun..

[26]  Liesbet Van der Perre,et al.  Optimal fixed and scalable energy management for wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

[28]  Muriel Medard,et al.  How good is random linear coding based distributed networked storage , 2005 .

[29]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[30]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[31]  Anxiao Jiang Network Coding for Joint Storage and Transmission with Minimum Cost , 2006, 2006 IEEE International Symposium on Information Theory.