Distributed Time Slots Assignment Protocol in Dynamic Networks

Hicham Lakhlef (1, 2) , Ghada Jaber (1) , Abdelmadjid Bouabdallah (1) , Fabio D’andreagiovanni (3, 1) , Ahmed Lounis (1)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 Labex MS2T - Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"
3 CNRS - Centre National de la Recherche Scientifique

This paper addresses the problem of communication in resource-limited broadcast/receive wireless networks. In large scale and resource-limited wireless networks, as the Internet of Things (IoT), a massive amount of data is becoming increasingly available, and consequently implementing protocols achieving error-free communication channels presents an important challenge. Indeed, in this new kind of network, 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 first study on dynamic management in distance-2 coloring in resource-limited wireless networks. We propose a distributed distance-2 coloring in a dynamic network where a new node can join the network. Thanks to the proposed protocol, we assign a time slot to the new node without re-running the whole algorithm of time slot assigning. Our protocol is time-efficient and uses only local information with a high probability.

Mots clés: Wireless network; Broadcast/receive; Collision; Conflict; Distance-2 graph coloring; Dynamic Networks; Synchronous system; Time slot assignment

Domaines: Optimisation et contrôle [math.OC]; Recherche opérationnelle [math.OC]; Réseaux et télécommunications [cs.NI]

Hicham Lakhlef, Ghada Jaber, Abdelmadjid Bouabdallah, Fabio D’andreagiovanni, Ahmed Lounis. Distributed Time Slots Assignment Protocol in Dynamic Networks. IEEE Symposium on Computers and Communications (ISCC 2020), Jul 2020, Rennes, France. pp.1-6, ⟨10.1109/ISCC50000.2020.9219697⟩. ⟨hal-03094834⟩