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

Authors:
Zhenguo Gao;Klara Nahrstedt;Weidong Xiang;Huiqiang Wang;Yibing Li
Affiliations:
College of Automation, Harbin Engineering University, Harbin, China and Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA 61801 and Department of Electrical a ...;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA 61801;Department of Electrical and Computer Engineering, University of Michigan, Dearborn, USA 48141;College of Computer Science and Technology, Harbin Engineering University, Harbin, China;College of Information and Communications Engineering, Harbin Engineering University, Harbin, China
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 8
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
XORs in the air: practical wireless network coding

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Index Coding with Side Information

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Practical network coding in wireless networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
On the index coding problem and its relation to network coding and matroid theory

IEEE Transactions on Information Theory
Network Coding Based Schemes for Imperfect Wireless Packet Retransmission Problems: A Divide and Conquer Approach

Wireless Personal Communications: An International Journal
Network information flow

IEEE Transactions on Information Theory
Spectrum Sharing for Multi-Hop Networking with Cognitive Radios

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solving WPRTPs (wireless packet retransmission problems) using NC (network coding) is increasingly attracting research efforts. However, no work on NC based schemes for WPRTPs in MCNs (multiple channel networks) has been found. In this paper, RNC (random network coding) based schemes for P-WPRTPs (perfect WPRTPs) in MCNs, denoted as MC-P-WPRTPs (multiple channel perfect WPRTPs), are studied by transforming MC-P-WPRTPs into ILP (integer linear programming) problems. The ILP problems corresponding to MC-P-WPRTPs with four typical configurations are derived. Then the corresponding packet retransmission schedule schemes for MC-P-WPRTPs are proposed based on the solutions to the ILP problems and random network coding. To solve the ILP problems efficiently, an algorithm named as progressively fixing algorithm is proposed which recursively reduce the size of the ILP problem by fixing some of the variables according to some criteria. The criteria are related to the solution to the LP problem obtained by relaxing the integral constraints on the variables in the original ILP problem. Simulation results show that the NC based schemes for MC-P-WPRTPs are effective in saving packet retransmissions. In some situations, NC based schemes can save about 50 % packet retransmissions.