Data-rate maximization in wireless communication networks

Abstract

Despite great effort from the research community, wireless networks still operate below full capacity. To increase the network throughput it is important to study algorithms that select communication requests that can decode their signals despite mutual interference. In this paper, we study the joint problem of data rate assignment and link scheduling in the physical interference model. The objective of the problem is to maximize the total number of bits transmitted in one time slot. By constructing an intermediate network representation through a disk graph, we prove that a constant approximation solution can be computed in polynomial time. Finally, we propose a parallel implementation of a polynomial-time approximation scheme and show through simulations that the one-slot throughput of a wireless network can be significantly improved by using variable data rates.

Alocação dinâmica de largura de banda para redes sem fio infraestruturadas

“…[Goussevskaia et al 2012] forneceram um algoritmo aproximado para escalonar offline os enlaces. Em [Goussevskaia et al 2013], os autores propõem um algoritmo que também atribui a taxa de dados de um conjunto de enlaces, porém eles não consideraram que a largura de banda fosse variável.…”

Wireless scheduling with multiple data rates: From physical interference to disk graphs

“…In both problems, the objective is to select a subset of links that transmit successfully at the same time, while maximizing the total sum of their datarates. 2 In the first problem, each link i ∈ L is assigned a fixed data rate t ( i ) and then used as input to the maximization program. In the second problem, a set of links and a set of possible data rates are used as input, and the objective is to select a subset of links and assign each link the "best" data rate to transmit with.…”

“…Apart from constants, the analytical results of this paper hold for both extensions. 2 Note that maximizing the sum of data rates is equivalent to maximizing the total data transmitted, since we assume all transmissions occur for exactly one time slot. variable x i , such that:…”