An overhearing-based scheme for improving data persistence in wireless sensor networks

IEEE International Conference on Communications

Volumn , Issue , 2010, Pages

  Liang, Junbin ^a,b   Wang, Jianxin ^a   Chen, Jianer ^a,c  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b GUANGXI UNIVERSITY   (China)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Data persistence; LT codes; Overhearing; Wireless sensor networks

Indexed keywords

DATA PERSISTENCE; DISTRIBUTED SCHEMES; ERASURE CODES; ITS DATA; KEY PARAMETERS; LT CODES; MOTOR VEHICLE; PACKET TRANSMISSIONS; SOURCE DATA; SOURCE NODES;

ENERGY EFFICIENCY; SENSOR NETWORKS; WAVELET TRANSFORMS;

WIRELESS SENSOR NETWORKS;

EID: 77955348181     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2010.5502577     Document Type: Conference Paper

References (16)

1. Konstantinos Kalpakis, Koustuv Dasgupta, and Parag Namjoshi, Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks, Computer Networks, 2003, 42(6):697-716.
2. Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: Proc. of the Hawaii Int'l Conf. on System Sciences. San Francisco: IEEE Computer Society, 2000. 3005-3014.
3. Yan Wu, Sonia Fahmy, and Ness B.shroff, On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm. In: Proc. Of The IEEE 27th Conference on Computer Communications (INFOCOM2008), April,2008: 356-360.
4. Michael Luby, LT Codes, in Proc. of the 43th IEEE Symposium on Foundations of Computer Science (FOCS), 2002:271-283.
5. Yuuki Iima, Akimitsu Kanzaki, Takahiro Hara, and Shojiro Nishio, Overhearing-Based Data Transmission Reduction for Periodical Data Gathering in Wireless Sensor Networks, in Pro: 2009 IEEE International Conference on Complex, Intelligent and Software Intensive Systems, 2009:1048-1053.
6. Abhinav Kamra, Vishal Misra, Jon Feldman, and Dan Rubenstein, Growth Codes: Maximizing Sensor Network Data Persistence, in Proc. of ACM SIGCOMM, 2006:255-266.
7. Alexandros G. Dimakis, Vinod Prabhakaran, and Kannan Ramchandran, Decentralized Erasure Codes for Distributed Networked Storage, in: IEEE Transactions on Information Theory, Volume:52, Issue:6, June 2006:2809-2816.
8. Yuanchen Zhu, Steven Jacob Gortler, and Dylan Thurston, Sensor Network Localization Using Sensor Perturbation, In Proc. of the 28th IEEE INFOCOM09, Rio de Janeiro, Brazil, April 19-25, 2009: 2796-2800.
9. Yunfeng Lin, Baochun Li, and Ben Liang, Differentiated Data Persistence with Priority Random Linear Code. In Proc. of 27th International Conference on Distributed Computing Systems (ICDCS'07), Toronto, Canada, June, 2007:47-56.
10. Yunfeng Lin, Ben Liang, and Baochun Li, Geometric Random Linear Codes in Sensor Networks, IEEE International Conference on Communications (ICC 2008), 19-23 May 2008:2298-2303.
11. Yunfeng Lin, Ben Liang, and Baochun Li,Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes. In Proc. of the 26th IEEE INFOCOM07, Anchorage, Alaska, May 6-12, 2007: 1658-1666.
12. Salah A. Aly, Zhenning Kong, and Emina Soljanin, Fountain Codes Based Distributed Storage Algorithms for Wireless Sensor Networks, Proc. 2008 IEEE/ACM Information Processing of Sensor Networks (IPSN), St. Louis, Missouri, USA, April 22-24, 2008: 171-182.
13. Wei Ye, John Heidemann, and Deborah Estrin, An Energy-Efficient MAC protocol for Wireless Sensor Networks, In Proc. of the 21th IEEE INFOCOM02, New York, USA, June, 2002:1567-1576.
14. Siquan Hu and Mehul Motani, Early Overhearing Avoidance in Wireless Sensor Networks, Networking, 2008:26-35.
15. Shah, R.C., Roy, S., Jain, S., Brunette, W., Data MULEs: modeling a three-tier architecture for sparse sensor networks, in Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003:30-41.
16. Vivek Mhatre and Catherine Rosenberg, Design Guidelines for Wireless Sensor Networks: Communication, Clustering and Aggregation, Ad Hoc Networks, 2004, 2(1):45-63.