| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [15 references]
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, January 7, 2021 - 4:35:54 PM
Long-term archiving on: : Sunday, January 21, 2018 - 1:35:43 PM
Contributor : François Taïani <>
Submitted on : Friday, October 20, 2017 - 2:37:29 PM
Last modification on : Thursday, January 7, 2021 - 4:35:54 PM
Long-term archiving on: : Sunday, January 21, 2018 - 1:35:43 PM
File
AINA-2017-LastVers.pdf
Files produced by the author(s)