CHRA: a coloring based hierarchical routing algorithm

  • Imen Jemili
  • Dhouha Ghrab
  • Amine Dhraief
  • Abdelfettah Belghith
  • Bilel Derbel
  • Ahmed Al-Mogren
  • Hassan Mathkour
Original Research

DOI: 10.1007/s12652-014-0242-y

Cite this article as:
Jemili, I., Ghrab, D., Dhraief, A. et al. J Ambient Intell Human Comput (2015) 6: 69. doi:10.1007/s12652-014-0242-y

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.

Keywords

Wireless sensor network Graph coloring TDMA scheduling Routing Optimization Coverage 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Imen Jemili
    • 1
  • Dhouha Ghrab
    • 1
  • Amine Dhraief
    • 1
  • Abdelfettah Belghith
    • 2
  • Bilel Derbel
    • 3
  • Ahmed Al-Mogren
    • 2
  • Hassan Mathkour
    • 2
  1. 1.HANAlab, University of ManoubaManoubaTunisia
  2. 2.College of Computer and Information SciencesKing Saud UniversityRiyadhSaudi Arabia
  3. 3.Laboratoire d’Informatique Fondamentale de LilleLilleFrance

Personalised recommendations