Joint Scheduling and Instantaneously Decodable Network Coding

Abstract

Abstract-We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across different users, however with the restriction that packets have to be decoded after one hop. We compute the stability region of this scheme and propose an online algorithm that stabilizes every arrival rate vector within the stability region. The online algorithm requires computation of stable sets in an appropriately defined conflict graph. We show by means of simulations that this inherently hard problem is tractable for some instances and that network coding extends the stability region over routing and leads, on average, to a smaller backlog.

Collaborative Multi-Layer Network Coding in Hybrid Cellular Cognitive Radio Networks

“…It has shown that it can significantly improve transmission efficiency, throughput and delay over wireless erasure channels [22,[31][32][33][34][35][36][37][38][39][40][41][42]. It can provide several more spectrum holes for the CRN to use by speeding up the packet transmission and recovery in the PN.…”

Stable and capacity achieving XOR-based policies for the Broadcast Erasure Channel with feedback

“…Network stability has also been studied along with network coding schemes in [5] and [6], albeit in different contexts. In [5], the stability of single hop BEC with feedback is examined but the traffic considered is broadcast and linear network coding schemes are used, so there is no guarantee for instantaneous decodability.…”

NCAPQ: Network Coding-Aware Priority Queueing for UDP Flows over COPE

“…A linear optimization framework for packing butterflies is proposed in [6]. Scheduling over coded wireless networks is considered, and the computational complexity of scheduling and network coding is discussed in [20], [21], [22] This paper combines the NCAQM and NCAPP mechanisms proposed independently in [2] and [3], respectively. We first show that these mechanisms are complementary: NCAQM creates coding opportunities (which is necessary in high load regimes) while NCAPP drains coded faster than uncoded packets (which is important in low load regimes).…”