Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata
Contributor : Bilel Derbel Connect in order to contact the contributor
Submitted on : Wednesday, December 30, 2015 - 11:22:00 AM
Last modification on : Thursday, January 20, 2022 - 4:17:10 PM



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, Springer, 2015, 6 (1), pp.69-82. ⟨10.1007/s12652-014-0242-y⟩. ⟨hal-01249123⟩



Les métriques sont temporairement indisponibles