Round Weighting Problem and gathering in wireless networks with symmetrical interference

Cristiana Gomes 1 Patricio Reyes 1 Jean-Claude Bermond 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We address the Round Weighting Problem in which one has to find a minimum-length schedule of selected links. As we deal with multi-hop networks, these selected links represent a routing solution providing enough capacity to achieve the routers requirements of bandwidth. We give a \textit{lower bound} for this problem derived from a bottleneck region and exact formulas for grid graphs.
Type de document :
Rapport
[Research Report] 2009, pp.50
Liste complète des métadonnées

https://hal.inria.fr/inria-00408502
Contributeur : Cristiana Gomes <>
Soumis le : jeudi 30 juillet 2009 - 18:07:37
Dernière modification le : mercredi 31 janvier 2018 - 10:24:04

Identifiants

  • HAL Id : inria-00408502, version 1

Collections

Citation

Cristiana Gomes, Patricio Reyes, Jean-Claude Bermond. Round Weighting Problem and gathering in wireless networks with symmetrical interference. [Research Report] 2009, pp.50. 〈inria-00408502〉

Partager

Métriques

Consultations de la notice

260