CHRA: a coloring based hierarchical routing algorithm

  • Imen Jemili
  • Dhouha Ghrab
  • Amine Dhraief
  • Abdelfettah Belghith
  • Bilel Derbel
  • Ahmed Al-Mogren
  • Hassan Mathkour
Original Research
First Online:
Received:
Accepted:
  • 123 Downloads

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 

Notes

Acknowledgments

This work was supported by the Research Center of the College of Computer and Information Sciences, King Saud University RC130311.

References

  1. Abid MA, Belghith A (2011) Stability routing with constrained path length for improved routability in dynamic MANETs. In: The international journal of personnal and ubiquitous computing, Springer, Published online: April 12, 2011Google Scholar
  2. Al-karaki Jamal N, Kamal Ahmed E (2004) Routing techniques in wireless sensor networks: a survey. IEEE Wirel Commun 11:6–28CrossRefGoogle Scholar
  3. Ben Ali N, Molnar M, Belghith A (2008) Multi-constrained QoS multicast routing optimization. In: INRIA Research Report, No. 6500, April 2008Google Scholar
  4. Bryan KL, Ren T, Henry T, Fay-wolfe V (2007) Towards optimal tdma frame size in wireless sensor networksGoogle Scholar
  5. Chipara O, Lu C, Stankovic J (2006) Dynamic conflict-free query scheduling for wireless sensor networks. In: IEEE international conference on network protocols, pp 321–331Google Scholar
  6. Ding P, Holliday J, Celik A (2005) Distributed energy-efficient hierarchical clustering for wireless sensor networks. In: Proceedings of the first IEEE international conference on distributed computing in sensor systems, DCOSS’05, Springer, Berlin, Heidelberg, pp 322–339Google Scholar
  7. Ezzine R, Braham R, Al-Fuqaha A, Belghith A (2008) A new generic model for signal propagation in Wi-Fi and WiMAX environments. In: IFIP wireless days conference 2008, Dubai, United Arab Emirates, November 24–27, 2008Google Scholar
  8. Haas ZJ, Halpern JY, Li L (2002) Gossip-based ad hoc routing. In: 21st IEEE conference on computer communications (IEEE INFOCOM 2002), pp 1707–1716Google Scholar
  9. Heinzelman WR, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wirel Commun 1(4):660–670Google Scholar
  10. Heinzelman WR, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii international conference on system sciences-volume 8—volume 8, HICSS ’00, Washington, DC, USA. IEEE Computer Society, p 8020Google Scholar
  11. Ho T-S, Chen K-C (1996) Performance analysis of IEEE 802.11 CSMA/CA medium access control protocol. In: Personal, indoor and mobile radio communications. PIMRC’96., Seventh IEEE International Symposium on, vol 2, pp 407–411Google Scholar
  12. Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: 6th ACM international conference on mobile computing and networking (ACM MobiCom 2000), Boston, MA, USA, pp 56–67Google Scholar
  13. Jemili I, Belghith A, Mosbah M (2007) Algorithme distribu de clusterisation sans connaissance du voisinage: principe et valuation. In: The 7th international conference on new technologies of distributed systems (NOTERE’07), Marrakech, Marocco, June 4–8Google Scholar
  14. Jemili I, Belghith A, Mosbah M (2008) A synchronous tiered based clustering algorithm for large-scale Ad hoc networks. In: IFIP international federation for information processing, Vol 284; wireless and mobile networking; Zoubir Mammeri. Springer, Boston, p 4155Google Scholar
  15. Jemili I, Belghith A, Mosbah M (2008) Evaluating the efficiency of clustering on routing and network performance. In: The 2008 international conference on wireless networks, ICWN08, Las Vegas, Nevada, USA, July 14–17, 2008Google Scholar
  16. Jemili I, Belghith A, Mosbah M (2010) A Layered cluster based routing for an ad hoc environment. In: The 8th ACS/IEEE international conference ACS/IEEE AICCSA’10, Hammamet, May 2010, Tunisia, pp 1–8Google Scholar
  17. Kawano R, Miyazaki T (2007) Distributed coloring algorithm for wireless sensor networks and its applications. In: 7th IEEE international conference on computer and information technology, pp 997–1002Google Scholar
  18. Liu X (2012) A survey on clustering routing protocols in wireless sensor networks. Sensors 12(8):11113–11153CrossRefGoogle Scholar
  19. Priya L, Ankita Joshi M (2011) A survey of hierarchical routing protocols in wireless sensor network. MES J Technol Manag 67–71Google Scholar
  20. Puccinelli D, Haenggi M (2005) Wireless sensor networks: applications and challenges of ubiquitous sensing. Circ Syst Mag IEEE 5(3):19–31CrossRefGoogle Scholar
  21. Ramanathan S (1999) A unified framework and algorithm for channel assignment in wireless networks. Wirel Netw 5(2):81–94CrossRefGoogle Scholar
  22. Rhee I, Warrier A, Min J, Xu L (2006) Drand: distributed randomized TDMA scheduling for wireless ad-hoc networks. In: 7th ACM Inter symp on mobile ad hoc networking and computing, pp 190–201Google Scholar
  23. Varga A (2010) OMNeT++ user manual, version 4.1Google Scholar
  24. Xu N (2002) A survey of sensor network applications. IEEE Commun Mag 40Google Scholar
  25. Younis Ossama, Fahmy Sonia (2004) HEED: a hybrid, energy-efficient, distributed clustering approach for ad-hoc sensor networks. IEEE Trans Mobile Comput 3(4):366–379CrossRefGoogle Scholar

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