Doped fountain coding for minimum delay data collection in circular networks

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 5, 2009, Pages 673-684

  Kokalj Filipović, Silvija ^a   Spasojević, Predrag ^a   Soljanin, Emina ^b  

^a RUTGERS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Data collection; Decentralized Fountain codes; Distributed storage; Network coding; Wireless networks

Indexed keywords

CIRCULAR NETWORKS; CODED PACKET; DATA COLLECTION; DATA COLLECTORS; DATA DISSEMINATION; DATA STORAGE; DECENTRALIZED FOUNTAIN CODES; DEGREE DISTRIBUTIONS; DELAY ANALYSIS; DISTRIBUTED STORAGE; DOPING STRATEGIES; INTELLIGENT DATA; MESSAGE-PASSING DECODER; MINIMUM DELAY; NETWORK CODING; RANDOM GEOMETRIC GRAPHS; RANDOM POSITION; RELAY TRANSMISSION; SOURCE NODES; STORAGE NODES; TRANSMISSION RANGES;

DECODING; DOPING (ADDITIVES); FOUNTAINS; MESSAGE PASSING; SOLITONS; TRANSMISSIONS; WIRELESS SENSOR NETWORKS;

DATA ACQUISITION;

EID: 67650587788     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090609     Document Type: Article

References (19)

1. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran. Decentralized erasure codes for distributed networked storage. IEEE/ACM Trans. Networking, 14, 2006.
2. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran. Distributed fountain codes for networked storage. In ICASSP 2006, 2006.
3. E.Maneva and A.Shokrollahi. New model for rigorous analysis of lt-codes. In ISIT 2006, 2006.
4. J. Eriksson, L. Girod, B. Hull, R. Newton, S. Madden, and H. Balakrishnan. The pothole patrol: Using a mobile sensor network for road surface monitoring. In MobiSys 2008, June 2008.
5. B. Hajek. Connections between network coding and stochastic network theory. In Stochastic Networks Conference, 2006.
6. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In IEEE International Symposium on Info. Theory, Jun 2003.
7. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger. On randomized network coding. In 41st Annual Allerton Conference, Oct 2003.
8. J.Suh and M. Turon. Monitoring a mote security deployment with moteview. In IPSN 2005, April 2005.
9. R. Karp, M. Luby, and A.Shokrollahi. Finite length analysis of lt codes. In ISIT 2004, 2004.
10. S. Kokalj-Filipovic, P. Spasojevic, E. Soljanin, and R. Yates. Arq with doped fountain decoding. In ISSSTA 2008. IEEE, August 2008.
11. S. Kokalj-Filipovic, P. Spasojevic, R. Yates, and E. Soljanin. Decentralized fountain codes for minimum-delay data collection. In CISS 2008. IEEE, March 2008.
12. S. Kokalj-Filipovic, R. Yates, and P. Spasojevic. Infrastructures for data dissemination and in-network storage in location-unaware wireless sensor networks. Technical report, WINLAB, Rutgers University, 2007.
13. Z. Kong, S. Aly, and E. Soljanin. Decentralized coding algorithms for distributed storage in wireless sensor networks. invited for IEEE J. Sel. Areas Commun., Spec. Issue on Data Comm. Techniques for Storage Channels and Networks, Jan 2009.
14. Y. Lin, B. Liang, and B. Li. Data persistence in large-scale sensor networks with decentralized fountain codes. In IEEE Infocom, May 2007.
15. M. Luby. L t codes. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002.
16. R.Gallager. Discrete Stochastic Processes. Kluwer Academic Publishers, 1995.
17. J. Widmer, C. Fragouli, and J.-Y. Le Boudec. Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding. In 1st Network Coding Workshop (NetCod), April 2005.
18. J. Wieselthier, G. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In IEEE INFOCOM00, Mar 2000.
19. Y.Wu, P.A.Chou, and S.-Y.Kung. Information exchange in wireless networks with network coding and physical-layer broadcast. In CISS 2005, 2005.