Enhancing data persistence for energy constrained networks by network modulation

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 214-221

  Zhang, Wei ^a   Ma, Xiaoli ^a   Choi, Giwan ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC NUMBER THEORY; DATA PERSISTENCE; ENERGY-CONSTRAINED NETWORKS; FINITE ENERGY; INTERMEDIATE NETWORKS; LARGE-SCALE DISTRIBUTED SYSTEM;

NUMBER THEORY;

COMPUTER SIMULATION;

EID: 77949631653     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394803     Document Type: Conference Paper

References (30)

1. S. Acedanski, S. Deb, M. Médard, and R. Koetter. How good is random linear coding based distributed networked storage? In Proc. 1st Workshop on Network Coding, Theory, and Applications, Apr. 2005.
2. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. Information Theory, 46(4):1204-1216, July 2000.
3. C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proc. IEEE ICC, volume 2, pages 1064-1070, Geneva, Switzerland, May 1993.
4. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In Proc. ACM SIGCOMM, pages 56-67, Vancouver, Canada, Sept. 1998.
5. A. G. Dimakis, P. B. Godfrey, M. J. Wainwright, and K. Ramchandran. Network coding for distributed storage systems. In Proc. IEEE INFOCOM, pages 2000-2008, Anchorage, AK, US, May 2007.
6. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes. In Proc. IPSN, page 15, Apr. 2005.
7. A. G. Dimakis, J. Wang, and K. Ramchandran. Unequal growth codes: intermediate performance and unequal error protection for video streaming. In Proc. IEEE Workshop on Multimedia Signal Processing, pages 107-110, Chania, Greece, Oct. 2007.
8. R. G. Gallager. Low-density parity-check codes. IEEE Trans. Information Theory, 8(1):21-28, Jan. 1962.
9. A. Goldsmith and S. Wicker. Design challenges for energy-constrained ad hoc wireless networks. IEEE Trans. Wireless Communications, 9(4):8-27, Aug. 2002.
10. B. Hassibi and H. Vikalo. On the sphere-decoding algorithm I. expected complexity. IEEE Trans. Signal Process., 53(8):2806-2818, Aug. 2005.
11. T. Ho, R. Koetter, M. Médard, D. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proc. IEEE ISIT, pages 227-234, Pacifico Yokohama, Japan, July 2003.
12. A. Jiang. Network coding for joint storage and transmission with minimum cost. In Proc. IEEE ISIT, pages 1359-1363, Seattle, WA, US, July 2006.
13. D. Johnson and D. Maltz. Dynamic source routing in ad-hoc wireless networks. In Proc. ACM SIGCOMM, pages 153-181, Stanford, CA, US, Aug. 1996.
14. A. Kamra, V. Misra, J. Feldman, and D. Rubenstein. Growth codes: maximizing sensor network data persistence. In Proc. ACM SIG-COMM, pages 255-266, Pisa, Italy, Sept. 2006.
15. S. Karande, K. Misra, and H. Radha. Natural growth codes: partial recovery under random network coding. In Proc. 42nd Annual Conf. on Information Sciences and Systems, pages 540-544, Mar. 2008.
16. B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proc. ACM MobiCom, pages 243-254, Aug. 2000.
17. S. Katti, D. Katabi, W. Hu, H. Rahul, and M. Médard. The importance of being opportunistic: practical network coding for wireless environments. In Proc. Annual Allerton Conf. on Communication, Control, and Computing, Allerton, IL, US, Sept. 2005.
18. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft. XORs in the air: practical wireless network coding. In Proc. ACM SIGCOMM, pages 243-254, Pisa, Italy, Sept. 2006.
19. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Trans. Information Theory, 49(2):371-381, Feb. 2003.
20. Y. Lin, B. Li, and B. Liang. Differentiated data persistence with priority random linear codes. In Proc. ICDCS, pages 47-47, June 2007.
21. J. Liu, Z. Liu, D. Towsley, and C. H. Xia. Maximizing the data utility of a data archiving & querying system through joint coding and scheduling. In Proc. IPSN, pages 244-253, Cambridge, MA, US, Apr. 2007.
22. M. Luby. LT codes. In Proc. FOCS, page 271, Vancouver, Canada, Nov. 2002.
23. R. Mangharam, S. Pollin, B. Bougard, R. Rajkumar, F. Catthoor, L. V. Perre, and I. Moerman. Optimal fixed and scalable energy management for wireless networks. In Proc. IEEE INFOCOM, pages 114-125, Mar. 2005.
24. D. Munaretto, J. Widmer, M. Rossi, and M. Zorzi. Network coding strategies for data persistence in static and mobile sensor networks. In Proc. Int'l Workshop on Wireless Networks: Communication, Cooperation and Competition, pages 1-8, Apr. 2007.
25. C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proc. ACM SIGCOMM, pages 234-244, London, UK, Oct. 1994.
26. V. Raghunathan, C. Schurgers, S. Park, and M. B. Srivastava. Energyaware wireless microsensor networks. IEEE Signal Processing Magazine, 19(2):40-50, Mar. 2002.
27. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379-423, 623-656, 1948.
28. D. Wang, Q. Zhang, and J. Liu. Partial network coding: theory and application for continuous sensor data collection. In Proc. IEEE Int'l Workshop on Quality of Service, pages 93-101, June 2006.
29. S. B. Wicker. Reed-Solomon codes and their applications. IEEE Press, Piscataway, NJ, US, 1994.
30. Y. Xin, Z. Wang, and G. B. Giannakis. Space-time diversity systems based on linear constellation precoding. IEEE Trans. Wireless Com-munications, 2(2):294-309, Mar. 2003.