OSERENA, an Optimized Coloring Algorithm for Dense or Large Scale Wireless Networks

Ichrak Amdouni 1 Minet Pascale 1 Cédric Adjih 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : The goal of this research report is to present OSERENA "Optimized SchEduling RoutEr Node Activity", a distributed coloring algorithm optimized for dense wireless networks. Network density has an extremely reduced impact on the size of the messages exchanged to color the network. Furthermore, the number of colors used to color the network is not impacted by this optimization. We describe in this research report the properties of the algorithm and prove its correctness and termination. Simulation results point out the considerable gains in bandwidth.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00637875
Contributor : Ichrak Amdouni <>
Submitted on : Thursday, November 3, 2011 - 11:08:21 AM
Last modification on : Thursday, February 7, 2019 - 2:48:49 PM
Long-term archiving on : Thursday, November 15, 2012 - 11:01:25 AM

Files

RR-7785.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00637875, version 1
  • ARXIV : 1111.0855

Collections

Citation

Ichrak Amdouni, Minet Pascale, Cédric Adjih. OSERENA, an Optimized Coloring Algorithm for Dense or Large Scale Wireless Networks. [Research Report] RR-7785, INRIA. 2011, pp.29. ⟨inria-00637875⟩

Share

Metrics

Record views

505

Files downloads

276