Network Coding Based Schemes for Imperfect Wireless Packet Retransmission Problems: A Divide and Conquer Approach

Authors:
Zhenguo Gao;Mei Yang;Jianping Wang;Klara Nahrstedt;Shaobin Cai;Xiang Li;Huiqiang Wang
Affiliations:
College of Automation, Harbin Engineering University, Harbin, China 150001 and College of Computer Science and Technology, Harbin Engineering University, Harbin, China 150001 and Department of Com ...;Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, USA 89119;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, People's Republic of China;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA 61801;College of Computer Science and Technology, Harbin Engineering University, Harbin, China 150001;College of Computer Science and Technology, Harbin Engineering University, Harbin, China 150001;College of Computer Science and Technology, Harbin Engineering University, Harbin, China 150001
Venue:
Wireless Personal Communications: An International Journal
Year:
2012

Citing 4
Cited 1

Multicasting in mobile ad-hoc networks: achieving high packet delivery ratios

CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
Robustness vs. efficiency in sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
XORs in the air: practical wireless network coding

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Network information flow

IEEE Transactions on Information Theory

Random Network Coding Based Schemes for Perfect Wireless Packet Retransmission Problems in Multiple Channel Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

NC (Network Coding) provides a new approach to packet retransmission problems in wireless networks, which are named as WPRTPs (Wireless Packet Retransmission Problems) in this paper. Some research has been conducted on P-WPRTPs (Perfect WPRTPs) where, for one receiver, a packet is either being requested by or already known to it. However, very few efforts are focused on IP-WPRTPs (Imperfect WPRTPs) where, for one receiver, a packet can be neither requested by nor already known to it. In this paper, we focus on IP-WPRTPs. Firstly, a WPRTP reduction theorem for simplifying WPRTPs is proposed and proved. Then, the upper and lower bounds of the number of necessary packet transmissions in optimal NC-based solutions to IP-WPRTPs are analyzed. Next, a scheme named as IP-WPRTP-DC (Divide and Conquer based scheme for IP-WPRTPs) is proposed based on the WPRTP reduction theorem using a divide and conquer approach. Extensive simulations show that the IP-WPRTP-DC scheme is effective in saving the number of packet transmissions for solving IP-WPRTPs.