Opportunistic Scheduling for Network Coded Data in Wireless Multicast Networks

TL;DR

This paper presents a low-complexity, queue-stability-focused network coding scheduling algorithm for wireless multicast networks, optimized for both general and time-critical data, with verified simulation results.

Contribution

Introduces a novel, less complex network coding-based scheduling algorithm for wireless multicast, ensuring queue stability and suitability for time-sensitive data.

Findings

Algorithm reduces queue size and complexity compared to existing solutions.

Simulation confirms effectiveness of the proposed scheduling method.

Algorithm adapts to time-critical data requirements.

Abstract

In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov optimization model and define decision variables to derive a network coding based packet scheduling algorithm, which has significantly less complexity and shorter queue size compared with the existing solutions. Further, the proposed algorithm is modified to meet the requirements of time-critical data. Finally, the simulation results verify the effectiveness of our proposed algorithm.