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

Zhenguo Gao, Mei Yang, Jianping Wang, Klara Nahrstedt, Shaobin Cai, Xiang Li, Huiqiang Wang

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.
BibTeX
@inproceedings{gao2012network,
  author = {Zhenguo Gao and Mei Yang and Jianping Wang and Klara Nahrstedt and Shaobin Cai and Xiang Li and Huiqiang Wang},
  title = {{Network Coding Based Schemes for Imperfect Wireless Packet Retransmission Problems: A Divide and Conquer Approach}},
  booktitle = {Wirel. Pers. Commun},
  year = {2012},
  url = {https://openreview.net/forum?id=kaYhnZ44nW},
}

Loading related content...

Figure