Bandwidth Allocation in Radio Grid Networks

Cristiana Gomes (1) , Stéphane Pérennes (1) , Patricio Reyes (1) , Hervé Rivano (1)

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications

In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is determined by the bottleneck around the base station. We deal with two cases: the base station located in the center and in the corner. We use dual lower bounds and describe a protocol which is optimal when the traffic is uniform., OPTx-editorial-board=yes, OPTx-proceedings=yes, OPTx-international-audience=no

Domaines: Réseaux et télécommunications [cs.NI]

Cristiana Gomes, Stéphane Pérennes, Patricio Reyes, Hervé Rivano. Bandwidth Allocation in Radio Grid Networks. 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08), May 2008, Saint Malo, France. ⟨hal-00371137⟩