Network Coding for Severe Packet Reordering in Multihop Wireless Networks

Abstract

Network coding is known to be effective in overcoming packet losses and packet reordering in multihop wireless networks. Despite the benefits, network coding is hard to deploy without being compatible with TCP. To address this problem, a seminal paper proposed a network coding scheme that adopts an ACK-based sliding-widow network coding approach. In this paper we show that the previous scheme may not suffice to mitigate the effects of packets received out of order in multipath wireless networks where severe packet reordering persists. We propose a modified network coding layer where the receiver acknowledges every degree of freedom by using the sequence number of a newly seen packet instead of using that of the oldest unseen packet so that the network coding layer can be compatible with a TCP variant for severe packet reordering. To reduce the decoding matrix size and the coding buffer size, our scheme allows retransmission at the network coding layer. Simulation results show that our scheme outperforms the exiting scheme in multipath wireless networks particularly when severe packet reordering persists.

Data Gathering Techniques for Wireless Sensor Networks: A Comparison

“…As shown in [18][19][20][21], by combining data aggregation and routing mechanisms, efficient data gathering schemes can be obtained.…”

“…In particular in [18], the problem of jointly optimized routing and data aggregation is investigated; in [19], the authors combine data compression and multipath routing techniques to obtain a reliable and low-latency data aggregation scheme; in [20], an energy-balanced data gathering and aggregating scheme is proposed which integrates a clustering hierarchical structure with the compressive sensing to optimize and balance the amount of data transmitted; finally in [21] a data gathering technique based on the network coding paradigm is proposed.…”