A Distributed Collision-free Distance-2 Coloring Algorithm for Ring Networks

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.

[1]  Pascale Minet,et al.  Node Coloring and Color Conflict Detection in Wireless Sensor Networks , 2010, Future Internet.

[2]  Hicham Lakhlef,et al.  Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks , 2017, 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA).

[3]  Fred B. Chambers,et al.  Distributed Computing , 2016, Lecture Notes in Computer Science.

[4]  Hicham Lakhlef,et al.  Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks , 2019, IEEE Transactions on Parallel and Distributed Systems.

[5]  Injong Rhee,et al.  DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.

[6]  Bilel Derbel,et al.  Collision aware coloring algorithm for wireless sensor networks , 2013, 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC).

[7]  Wayne Goddard,et al.  Distance-two information in self-stabilizing algorithms , 2004, Parallel Process. Lett..

[8]  Leonid Barenboim,et al.  Distributed (Delta+1)-Coloring in Linear (in Delta) Time , 2014, SIAM J. Comput..

[9]  Jean R. S. Blair,et al.  An Efficient Self-stabilizing Distance-2 Coloring Algorithm , 2009, SIROCCO.

[10]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[11]  Michel Raynal,et al.  Fault-Tolerant Message-Passing Distributed Systems , 2018, Springer International Publishing.

[12]  Sébastien Tixeuil,et al.  A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks , 2004, ALGOSENSORS.

[13]  Chenyang Lu,et al.  Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries , 2011, IEEE Transactions on Mobile Computing.

[14]  Hicham Lakhlef,et al.  Collision-Free Routing Protocol in Multi-hop Wireless Sensor Networks , 2015, 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing.