Network Coded Rate Scheduling for Two-way Relay Networks

TL;DR

This paper proposes a network coding-based scheduling scheme for two-way relay networks that adapts to various channel models, aiming to minimize total transmission time through optimized scheduling and power allocation.

Contribution

It introduces a novel scheduling approach incorporating network coding and channel state information, with closed-form solutions for certain channel models and heuristic algorithms for Rayleigh fading channels.

Findings

Minimized average transmission time with network coding in fluctuating channels

Closed-form scheduler solutions for time invariant and finite state channels

Heuristic power allocation improves performance in Rayleigh fading channels

Abstract

We investigate a scheduling scheme incorporating network coding and channel varying information for the two-way relay networks. Our scheduler aims at minimizing the time span needed to send all the data of each source of the network. We consider three channel models, time invariant channels, time varying channels with finite states and time varying Rayleigh fading channels. We formulate the problem into a manageable optimization problem, and get a closed form scheduler under time invariant channels and time varying channel with finite channel states. For Rayleigh fading channels, we focus on the relay node operation and propose heuristic power allocation algorithm resemblant to water filling algorithm. By simulations, we find that even if the channel fluctuates randomly, the average time span is minimized when the relay node transmits/schedules network coded data as much as possible.