Rateless packet approach for data gathering in wireless sensor networks

IEEE Journal on Selected Areas in Communications

Volumn 28, Issue 7, 2010, Pages 1169-1179

  Vukobratović, Dejan ^a   Stefanović, Çedomir ^a   Crnojević, Vladimir ^a   Chiti, Francesco ^b   Fantacci, Romano ^b  

^a UNIVERSITY OF NOVI SAD   (Serbia)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Data Gathering; Distributed Rateless Codes; Mobile Collector; Wireless Sensor Networks

Indexed keywords

DATA GATHERING; DATA TRANSMISSION; DEGREE DISTRIBUTIONS; DISTRIBUTED NETWORKS; DISTRIBUTED RATELESS CODES; ENCODED PACKETS; LOW-COMPLEXITY; MOBILE COLLECTORS; NETWORK NODE; PACKET-CENTRIC; RATE-LESS CODES; RATELESS CODING; SENSOR DATA; SIMULATION RESULT; UNIFORM DISPERSIONS; WIRELESS SENSOR;

DUST COLLECTORS; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

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

References (28)

1. W-P. Chen and J. C. Hou, "Data Gathering and Fusion in Sensor Networks," in Handbook of Sensor Networks: Ivan Stojmenovic, ed., Wiley & Sons, 2005.
2. R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, "Network Information Flow," IEEE Trans. Inf.Theory, vol.46, no. 4, pp.1204-1216, July 2000.
3. A. Dimakis, V. Prabhakaran, K. Ramchandran, "Ubiquitous Access to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes," Proc. IEEE/ACM IPSN 2005, Los Angeles, USA, 2005.
4. J. Widmer, C. Fragouli and J.-Y. Le Boudec, "Low-Complexity Energy- Efficient Broadcasting in Wireless Ad-Hoc Networks Using Network Coding," Proc. NETCOD 2005, Riva del Garda, Italy, 2005.
5. D. Wang, Q. Zhang and J. Liu, "Partial Network Coding: Theory and Application for Continuous Sensor Data Collection," Proc. IEEE IWQoS 2006, 2006.
6. A. Dimakis, V. Prabhakaran, K. Ramchandran, "Distributed Fountain Codes for Networked Storage," Proc. IEEE ICASSP 2006, 2006.
7. A. Kamra, J. Feldman, V. Misra and D. Rubenstein, "Growth Codes: Maximizing Sensor Network Data Persistence," Proc. ACM SIGCOMM 2006, Pisa, Italy, 2006.
8. Y. Lin, B. Liang and B. Li, "Data Persistance in Large-Scale Sensor Networks with Decentralized Fountain Codes," Proc. IEEE INFOCOM 2007, Anchorage, AL, USA, 2007.
9. S. Aly, Z. Kong, and E. Soljanin, "Fountain codes based distributed storage algorithms for large-scale wireless sensor networks," Proc. IEEE/ACM IPSN, S. Louis, MO, USA, 2008.
10. D. Munaretto, J. Widmer, M. Rossi and M. Zorzi, "Resilient Coding Algorithms for Sensor Network Data Persistance," Proc. EWSN 2008, Bologna, Italy, 2008.
11. L. Lovasz, Random walks on graphs: A survey, in: Combinatorics, Paul Erdos is Eighty, Vol. 2, Keszthely, 1993
12. in: Bolyai Soc. Math. Stud., vol. 2, Janos Bolyai Math. Soc., Budapest, 1993, pp. 1-46.
13. D. Aldous, J. Fill, "Reversible Markov chains and random walks on graphs," unpublished, http://stat-www.berkeley.edu/users/aldous/RWG/ book.html.
14. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," ACM SIGCOMM 98, pp. 56-67, Vancouver, Canada, September 1998.
15. M. Luby, "LT Codes," Proc. of the 43rd Annual IEEE Symp. Foundations of Computer Science (FOCS), Vancouver, Canada, November 2002.
16. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equations of state calculations by fast computing machines," J. Chem. Phys., vol. 21, pp. 1087-1092, 1953.
17. S. Boyd, P. Diaconis, and L. Xiao, "Fastest Mixing Markov Chain on a Graph," SIAM Review, problems and techniques section, vol. 46(4), pp. 667-689, December 2004.
18. A. Sinclair, and M. Jerrum, "Approximate counting, uniform generation and rapidly mixing Markov chains," Information and Computation, vol. 82, pp. 93-133, 1989.
19. C. Avin and G. Ercal, "On the cover time and mixing time of random geometric graphs," Theor. Comp. Science, vol. 380, pp. 2-22, 2007.
20. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Mixing Times for Random Walk on Geometric Random Graphs," Proc. SIAM ANALCO Workshop, 2005.
21. P. Gupta and P. R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Info. Theory, vol. 46, No. 2, pp. 388-404, March 2000.
22. A. Awan, R. Ferreira and S. Jagannathan, "Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks," Proc. 39th Int'l Conf. on System Sciences, Kauai, Hawaii, USA, 2006.
23. S. Sanghavi, "Intermediate Performance of Rateless Codes," Proc. ITA Workshop, San Diego, CA, USA, 2007.
24. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," Proc. 41st Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, October 2003.
25. M. Luby, M. Mitzenmacher and A. Shokrollahi, "Analysis of random processes via and-or tree evaluation" Proc. of the 9th Annual SIAM Symp. on Discrete Algorithms, pp. 364-373, 1998.
26. N. Rahnavard, B. N. Vellambi and F. Fekri, "Rateless Codes With Unequal Error Protection Property" IEEE Trans. on Information Theory, vol. 53, No. 4, pp. 1521-1532, April 2007.
27. W. R. Heinzelman, A. Sinha, A. Wang, and A. P. Chandrakasan, "Energy-Scalable Algorithms and Protocols For Wireless Microsensor Networks," Proc. IEEE ICASSP 2000, 2000.
28. FP7 REGPOT-3 "Agrosense", http://www.agrosense.org/agrosense/.