CHRA: a coloring based hierarchical routing algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Ambient Intelligence and Humanized Computing Year : 2015

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.
Not file

Dates and versions

hal-01249123 , version 1 (30-12-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More