A Distributed Collision-free Distance-2 Coloring Algorithm for Ring Networks
Hicham Lakhlef, Youcef Imine, Abdelmadjid Bouabdallah · 2019
This work considers the problem of communication in resource limited wireless nodes. In this kind of networks, a massive amount of data is becoming increasingly available, and consequently implementing protocols achieving error-free communication channels constitutes an important challenge. Indeed, in this kind of networks, the prevention of message conflicts and message collisions is a crucial issue. In terms of graph theory, solving this issue amounts to solve the distance-2 coloring problem on the network. This paper presents a distributed algorithm for ring networks, providing the nodes with such a coloring. Contrary to existing works, this algorithm is itself collision-free and conflict-free. It is particularly suited to wireless networks composed of nodes with communication or local memory constraints. The proposed protocol is implemented and tested using Omnet++ simulator.