Round Weighting Problem and gathering in wireless networks with symmetrical interference - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Round Weighting Problem and gathering in wireless networks with symmetrical interference

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.
No file

Dates and versions

inria-00408502 , version 1 (30-07-2009)

Identifiers

  • HAL Id : inria-00408502 , version 1

Cite

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⟩
144 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More