Coloring based Hierarchical Routing Approach

Abstract : Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, we propose to jointly use coloring for routing purposes. We introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to sink. We provide an analytical and experimental study assessing the performance of CHRA in terms of end-to-end delay and energy consumption. In particular, we find that CHRA performs better than LEACH, a well established hierarchical routing protocol.
Type de document :
Communication dans un congrès
The 4th International Conference on Ambient Systems, Networks and Technologies, Jun 2013, Halifax, Canada. Elsevier, 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00782013
Contributeur : Bilel Derbel <>
Soumis le : mardi 29 janvier 2013 - 12:19:14
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : lundi 17 juin 2013 - 17:03:13

Fichiers

coloring.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00782013, version 1

Citation

Dhoha Ghrab, Bilel Derbel, Imen Jemili, Amine Dhraief, Abdelfettah Belghith, et al.. Coloring based Hierarchical Routing Approach. The 4th International Conference on Ambient Systems, Networks and Technologies, Jun 2013, Halifax, Canada. Elsevier, 2013. 〈hal-00782013〉

Partager

Métriques

Consultations de la notice

696

Téléchargements de fichiers

703