An efficient multi-hops clustering and data routing for WSNs based on Khalimsky shortest paths

  • Mahmoud MezghaniEmail author
Original Research


In this paper, we propose a novel energy-efficient data routing algorithm for clustered WSNs, based on Khalimsky topology. The aim of this algorithm is to compute Khalimsky paths for optimized data routing and to provide distributed clustering algorithm reducing the energy consumption and extending the network lifetime. The clustering algorithm divides WSNs into k-hop (\(k\geq 2\)) large dynamic clusters. In each cluster, nodes are arranged in concentric layers around an elected cluster-head according to well-defined criteria. Depending on its distance to the cluster-head, some nodes are selected by the triangulation theory as Khalimsky anchors to ensure optimal intra-cluster data routing. The Khalimsky anchors, located in border layers of adjacent clusters, are used for inter-cluster data routing. We prove that large clusters reduce the isolated nodes number. By this structure of multi-hops large clusters, we prove that the data routing across Khalimsky anchors alleviates the cluster heads tasks and minimizes the energy consumption. Simulation results show that our approach outperforms other protocols by achieving longer lifetime considering the energy consumption and the died nodes number.


Wireless sensor networks (WS) Distributed clustering Data routing Khalimsky topology Energy consumption minimization Communication optimization 



  1. Akyildiz IF, Vuran MC (2010) Wireless sensor networks. Akyildiz IF series in communications and networking. Wiley, HobokenCrossRefGoogle Scholar
  2. Amis AD, Prakash R, Vuong TH, Huynh DT (2000) Max-min D-cluster formation. In: Proceedings of the 19th annual joint conference of the IEEE computer and communications societies, conference on computer communications (IEEE INFOCOM’2000), vol 3, pp 32–41Google Scholar
  3. Anastasi G, Conti M, Di Francesco M, Passarella A (2009) Energy conservation in wireless sensor networks: a survey. Ad Hoc Netw 7:537–568CrossRefGoogle Scholar
  4. Arioua M, El Assari Y, Ez-zazi I, El Oualkadi A (2016) Multi-hop cluster based routing approach for wireless sensor networks. In: Proceedings of the 7th international conference on ambient systems, networks and technologies (ANT’16), Procedia Computer Science, vol 83, pp 584–591Google Scholar
  5. Babu NV, Puttamadappa C, Bore Gowda SB (2013) Energy efficient two hop clustering for wireless sensor networks. Int J Comput Sci Netw Secur 13(9):23–28Google Scholar
  6. Bouacida E (2008) The Jordan curve theorem in the Khalimsky plane. Appl Gen Topol 9(252):253–262MathSciNetCrossRefGoogle Scholar
  7. Chen Q, Ma J, Zhu Y, Zhang D, Ni LM (2007) An energy-efficient K-hop clustering framework for wireless sensor networks. In: Langendoen K, Voigt T (eds) European wireless sensor networks (EWSN), vol 4373. Lecture notes in computer science. Springer, Berlin, pp 17–33. CrossRefGoogle Scholar
  8. Gupta SK, Jain N, Sinha P (2013) Clustering protocols in wireless sensor networks: a survey. Int J Appl Inf Syst Found Comput Sci 5(2):41–50Google Scholar
  9. Khalimsky ED (1999) On topologies of generalized segments. Soviet Math Dokl 10:1508–1511Google Scholar
  10. Manjeshwar E, Agrawal DP (2001) TEEN: a routing protocol for enhanced efficiency in wireless sensor networks. In: Proceedings of the 15th international parallel and distributed processing symposium, San Francisco, CA, USA, pp 2009–2015Google Scholar
  11. Manjeshwar E, Agrawal DP (2002) APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks. In: Proceedings of the 2nd international workshop on parallel and distributed computing, issues in wireless networks and mobile computing, Lauderdale, FL, USA, pp 195–202Google Scholar
  12. MATLOG C (2017) Modules XBee series 1 2.4 GHz (802.15.4). Accessed Apr 2018
  13. Meulenaer G, Gosset F, Standaert FX, Pereira O (2008) On the energy cost of communication and cryptography in wireless sensor networks. In: Proceedings of the IEEE international conference on wireless and mobile computing, networking and communications WIMOB’08, pp 580–585Google Scholar
  14. Mezghani M, Abdellaoui M (2011) Multitasks-generic platform via WSN. Int J Distrib Parallel Syst 2(4):54–67Google Scholar
  15. Mezghani M, Abdellaoui M (2015) WSN intelligent communication based on Khalimsky theory using multi-agent systems. In: Proceedings of IEEE SAI intelligent systems conference, London, UK, pp 871–876.
  16. Mezghani M, Abdellaoui M (2016) WSN efficient data management and intelligent communication for load balancing based on Khalimsky topology and mobile agents. In: Bi Y, Kapoor S, Bhatia R (eds) Intelligent systems and applications, studies in computational intelligence. Springer, Berlin, pp 385–404. (chapter 19)CrossRefGoogle Scholar
  17. Mezghani M, Gargouri R, Abdellaoui M (2014) Optimization of WSNs flooding rates by Khalimsky topology. Trans Netw Commun 2(6):27–41Google Scholar
  18. OpenSim Ltd (2017) OMNeT++ simulation manual. Accessed Apr 2018
  19. Qin M, Zimmermann R (2007) VCA: an energy-efficient voting-based clustering algorithm for sensor networks. J Univers Comput Sci 12(1):87–109Google Scholar
  20. Quin L, Kunz T (2003) On-demand routing in MANETs: the impact of a realistic physical layer model. In: Proceedings of the international conference on ad hoc, mobile, and wireless networks, Montreal, Canada, pp 37–48Google Scholar
  21. Sirsikar S, Wankhede K (2015) Comparison of clustering algorithms to design new clustering approach. In: ICAC3’15, Procedia Computer Science, vol 49, pp 147–154Google Scholar
  22. Sobelec C (2017) Catalog of sensors. Accessed Apr 2018
  23. Taruna S, Kumawat R, Purohit GN (2012) Multi-hop clustering protocol using gateway nodes in wireless sensor network. Int J Wirel Mob Netw 4(4):169–180CrossRefGoogle Scholar
  24. Woo A, Tong T, Culler D (2003) Taming the underlying challenges of reliable multihop routing in sensor networks. In: Proceedings of the 1st international conference on embedded networked sensor systems (SenSys’03), pp 14–27Google Scholar
  25. Younis O, Fahmy S (2004) HEED: a hybrid, energy-efficient, distributed clustering approach for ad-hoc sensor networks. IEEE Trans Mob Comput 3(4):366–379CrossRefGoogle Scholar
  26. Zeb A, MuzahidulIslam AKM, Zareei M, Almamoon I, Mansoor N, Baharun S, Katayama Y, Komaki S (2016) Clustering analysis in wireless sensor networks: the ambit of performance metrics and schemes taxonomy. Int J Distrib Sens Netw 12(7):4979142. CrossRefGoogle Scholar
  27. Zimmerling M, Waltenegus D, Reason JM (2007) Energy-efficient routing in linear wireless sensor networks. In: IEEE international conference on mobile adhoc and sensor systems, Pisa, Italy.

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.National Engineering School of Sfax (ENIS)Sfax-UniversitySfaxTunisia

Personalised recommendations