Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks

Abstract

This work considers the problem of communication in dense and large scale wireless networks composed of resource-limited 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 in an arbitrary graph. The paper presents a distributed algorithm providing the processes with such a coloring. 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.
Fichier principal
Vignette du fichier
AINA-2017-LastVers.pdf (285.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01620356 , version 1 (20-10-2017)

Identifiers

Cite

Abdelmadjid Bouabdallah, Hicham Lakhlef, Michel Raynal, François Taïani. Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks. 31st IEEE International Conference on Advanced Information Networking and Applications (AINA 2017), Mar 2017, Taipei, Taiwan. pp.399-406, ⟨10.1109/AINA.2017.39⟩. ⟨hal-01620356⟩
458 View
186 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More