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.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01620356
Contributor : François Taïani <>
Submitted on : Friday, October 20, 2017 - 2:37:29 PM
Last modification on : Thursday, February 7, 2019 - 4:45:17 PM
Document(s) archivé(s) le : Sunday, January 21, 2018 - 1:35:43 PM

File

AINA-2017-LastVers.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

909

Files downloads

81