CHRA: a coloring based hierarchical routing algorithm

Abstract : Graph coloring was exploited in wireless sensor networks to solve many optimization problems, mainly related to channel assignment. In this paper, we propose to use coloring to jointly manage channel access and routing to the sink. We introduce CHRA, a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to the sink. We provide an analytical study assessing the performance of CHRA and present an investigation of various coloring heuristics to study their impact on CHRA performances on maintaining the network connectivity and coverage, while reducing the energy consumption.
Type de document :
Article dans une revue
Journal of Ambient Intelligence and Humanized Computing, Vincenzo Loia, 2015, 6 (1), pp.69-82. 〈10.1007/s12652-014-0242-y〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01249123
Contributeur : Bilel Derbel <>
Soumis le : mercredi 30 décembre 2015 - 11:22:00
Dernière modification le : jeudi 11 janvier 2018 - 06:27:32

Identifiants

Citation

Imen Jemili, Dhouha Ghrab, Amine Dhraief, Belghith Abdelfettah, Ahmed Al-Morgen, et al.. CHRA: a coloring based hierarchical routing algorithm. Journal of Ambient Intelligence and Humanized Computing, Vincenzo Loia, 2015, 6 (1), pp.69-82. 〈10.1007/s12652-014-0242-y〉. 〈hal-01249123〉

Partager

Métriques

Consultations de la notice

224