Trade-off between Redundancy and Feedback in Wireless Network Communication

Feedback is an important control mechanism that provides reliability in most wireless network protocols. However, feedback incurs some overhead, especially in lossy network environments. Many previous works on reliable communication neglect the cost of the feedback messages. In this paper, we study the problem of minimum-cost reliable transmission over error-prone wireless networks by considering the cost of feedback. We address two cases: the case where we have a finite number of packets to send and the case where we have infinite packets. In both cases, we provide a solution to the problem with one-hop broadcast transmission. After that, we study the case where network coding is used in our proposed methods. In addition to that, we extend our approaches to address the problem of minimum-cost reliable broadcasting in multi-hop wireless networks. Our simulation results show that the cost of our proposed method is about 40% less than that of the traditional Automatic Repeat reQuest (ARQ) method. Also, the cost of our proposed method with network coding is about 40% less than that of the traditional ARQ

[1]  Dong Nguyen,et al.  Wireless Broadcast Using Network Coding , 2009, IEEE Transactions on Vehicular Technology.

[2]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[4]  H. Djandji.  An efficient hybrid ARQ protocol for point-to-multipoint communication and its throughput performance , 1999 .

[5]  A. Khreishah,et al.  Flow-based XOR Network Coding for Lossy Wireless Networks , 2012, IEEE Trans. Wirel. Commun..

[6]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[7]  Pouya Ostovari,et al.  Network Coding Techniques for Wireless and Sensor Networks , 2014 .

[8]  Parastoo Sadeghi,et al.  Adaptive network coding for broadcast channels , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[9]  Baruch Awerbuch,et al.  Distributed BFS algorithms , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[11]  Luigi Rizzo,et al.  Effective erasure codes for reliable computer communication protocols , 1997, CCRV.

[12]  Ming Xiao,et al.  Relay-Aided Broadcasting with Instantaneously Decodable Binary Network Codes , 2011, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN).

[13]  Giuseppe Caire,et al.  The throughput of hybrid-ARQ protocols for the Gaussian collision channel , 2001, IEEE Trans. Inf. Theory.

[14]  Weiwei Fang,et al.  Reliable broadcast transmission in wireless networks based on network coding , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[15]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[16]  Ness B. Shroff,et al.  Cross-layer optimizations for Intersession Network Coding on practical 2-hop relay networks , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[17]  Yogen K. Dalal,et al.  A Distributed Algorithm for Constructing Minimal Spanning Trees , 1987, IEEE Transactions on Software Engineering.

[18]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[19]  Ming Xiao,et al.  Efficient Network Coding for Wireless Broadcasting , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[20]  Luigi Rizzo,et al.  Environments , 2019, Privacy, Regulations, and Cybersecurity.

[21]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.