Mobility

Algebraic Network Coding Approach to Deterministic Wireless Relay Networks

Free registration required

Executive Summary

The deterministic wireless relay network model, introduced by Avestimehr et al., has been proposed for approximating Gaussian relay networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference. Avestimehr et al. showed that the Min-cut Max-flow theorem holds in the ADT network. In this paper, the authors show that the ADT network model can be described within the algebraic network coding framework introduced by Koetter and M?edard. They prove that the ADT network problem can be captured by a single matrix, called the system matrix.

  • Format: PDF
  • Size: 227.8 KB