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.
Type de document :
Communication dans un congrès
AINA 2017 - 31st IEEE International Conference on Advanced Information Networking and Applications, Mar 2017, Taipei, Taiwan. pp.399-406, 2017, 〈10.1109/AINA.2017.39〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01620356
Contributeur : François Taïani <>
Soumis le : vendredi 20 octobre 2017 - 14:37:29
Dernière modification le : mercredi 4 juillet 2018 - 16:44:03
Document(s) archivé(s) le : dimanche 21 janvier 2018 - 13:35:43

Fichier

AINA-2017-LastVers.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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, 2017, 〈10.1109/AINA.2017.39〉. 〈hal-01620356〉

Partager

Métriques

Consultations de la notice

544

Téléchargements de fichiers

45