HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

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 , Laboratoire I3S - 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00408502
Contributor : Cristiana Gomes Connect in order to contact the contributor
Submitted on : Thursday, July 30, 2009 - 6:07:37 PM
Last modification on : Friday, February 4, 2022 - 3:19:04 AM

Identifiers

  • 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⟩

Share

Metrics

Record views

138