Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00782013
Contributor : Bilel Derbel <>
Submitted on : Tuesday, January 29, 2013 - 12:19:14 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM
Document(s) archivé(s) le : Monday, June 17, 2013 - 5:03:13 PM

Files

coloring.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨hal-00782013⟩

Share

Metrics

Record views

885

Files downloads

1138