Coloring based Hierarchical Routing Approach - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Coloring based Hierarchical Routing Approach

(1) , (2, 3) , (1) , (1) , (1) , (2)


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.
Fichier principal
Vignette du fichier
coloring.pdf (139.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00782013 , version 1 (29-01-2013)


  • HAL Id : hal-00782013 , version 1


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. ⟨hal-00782013⟩
390 View
511 Download


Gmail Facebook Twitter LinkedIn More