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

TL;DR

OSERENA is a distributed coloring algorithm designed for dense wireless networks, reducing message exchange impact and improving bandwidth efficiency without increasing the number of colors used.

Contribution

The paper introduces OSERENA, an optimized distributed coloring algorithm that maintains performance in dense networks with reduced message complexity and proven correctness.

Findings

Significant bandwidth gains demonstrated in simulations

Message exchange impact is minimized in dense networks

Number of colors remains unaffected by optimization

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.