Skip to main content
Log in

CHRA: a coloring based hierarchical routing algorithm

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. MAC: Medium Access Control.

  2. CSMA/CA: Carrier Sense Multiple Access/Collision Avoidance.

  3. TDMA: Time Division Multiple Access.

  4. QoS: Quality of Service.

References

  • 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, 2011

  • Al-karaki Jamal N, Kamal Ahmed E (2004) Routing techniques in wireless sensor networks: a survey. IEEE Wirel Commun 11:6–28

    Article  Google Scholar 

  • Ben Ali N, Molnar M, Belghith A (2008) Multi-constrained QoS multicast routing optimization. In: INRIA Research Report, No. 6500, April 2008

  • Bryan KL, Ren T, Henry T, Fay-wolfe V (2007) Towards optimal tdma frame size in wireless sensor networks

  • 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–331

  • 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–339

  • 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, 2008

  • Haas ZJ, Halpern JY, Li L (2002) Gossip-based ad hoc routing. In: 21st IEEE conference on computer communications (IEEE INFOCOM 2002), pp 1707–1716

  • Heinzelman WR, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wirel Commun 1(4):660–670

  • 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 8020

  • 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–411

  • 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–67

  • 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–8

  • 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 4155

  • 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, 2008

  • 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–8

  • 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–1002

  • Liu X (2012) A survey on clustering routing protocols in wireless sensor networks. Sensors 12(8):11113–11153

    Article  Google Scholar 

  • Priya L, Ankita Joshi M (2011) A survey of hierarchical routing protocols in wireless sensor network. MES J Technol Manag 67–71

  • Puccinelli D, Haenggi M (2005) Wireless sensor networks: applications and challenges of ubiquitous sensing. Circ Syst Mag IEEE 5(3):19–31

    Article  Google Scholar 

  • Ramanathan S (1999) A unified framework and algorithm for channel assignment in wireless networks. Wirel Netw 5(2):81–94

    Article  Google Scholar 

  • 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–201

  • Varga A (2010) OMNeT++ user manual, version 4.1

  • Xu N (2002) A survey of sensor network applications. IEEE Commun Mag 40

  • 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–379

    Article  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abdelfettah Belghith.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jemili, I., Ghrab, D., Dhraief, A. et al. CHRA: a coloring based hierarchical routing algorithm. J Ambient Intell Human Comput 6, 69–82 (2015). https://doi.org/10.1007/s12652-014-0242-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-014-0242-y

Keywords

Navigation