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

2011/11/03 by Ichrak Amdouni, Amdouni, Ichrak, Minet Pascale +3
Computer Science · #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #cs.NI

paper · pdf · doi:10.48550/arxiv.1111.0855

No. RR-7785 (2011)

arxiv created 2011/11/03 · arxiv updated 2011/11/04

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.

Related

• Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless Networks
• Node coloring for dense wireless sensor networks
• Simple Distributed Delta + 1 Coloring in the SINR Model
• On the Coloring of Grid Wireless Sensor Networks: the Vector-Based Coloring Method
• Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs