KMHSO: k-Means and Harmony Search-Based Optimization Algorithm for Relay Node Selection in Smart Transportation System

Abstract

With the arrival of the internet of things and advancement in every front of technology, the field of the smart transportation system is becoming prevailing among the researchers. To avoid the problems in existing transportation systems and to provide better services and information to its users, smart transportation system can be used. This paper incorporates the wireless sensor network (WSN) technology with the smart transportation system. WSNs play a vital role in monitoring and gathering information from the environment. To provide better coverage and connectivity with least message overhead, this paper uses a combination of k-means and harmony search algorithm. The proposed approach is compared on the basis of parameters like message overhead, coverage, throughput and end-to-end delay. The simulation results show that the proposed work is efficient, provides good coverage and reduces message overhead.

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

Fig. 1
Fig. 2
Fig. 3

References

  1. 1.

    Deif DS, Gadallah Y (2014) Classification of wireless sensor networks deployment techniques. IEEE Commun Surv Tutor 16(2):834–855

    Article  Google Scholar 

  2. 2.

    Aziz NAA, Aziz KA, Ismail WZW (2009) Coverage strategies for wireless sensor networks. World Acad Sci 3(2):145–150

    Google Scholar 

  3. 3.

    Wang Y, Hu C, Tseng Y (2005) Efficient deployment algorithms for ensuring coverage and connectivity of wireless sensor networks. In: First international conference on wireless internet, pp 114–121

  4. 4.

    Aziz NABA, Mohemmed AW, Alias MY (2009) A wireless sensor network coverage optimization algorithm based on particle swarm optimization and Voronoi diagram. In: 2009 international conference on networking, sensing and control, pp 602–607

  5. 5.

    Sun G, Liu Y, Li H, Wang A, Liang S, Zhang Y (2007) A novel connectivity and coverage algorithm based on shortest path for wireless sensor networks. Comput Electr Eng 71:1025–1039

    ADS  Article  Google Scholar 

  6. 6.

    Alia OM, Al-Ajouri A (2017) Maximizing wireless sensor network coverage with minimum cost using harmony search algorithm. IEEE Sens J 17(3):882–896

    ADS  Article  Google Scholar 

  7. 7.

    Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68

    Article  Google Scholar 

  8. 8.

    Bettstetter C, Resta G, Santi P (2003) The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans Mob Comput 2(3):257–269

    Article  Google Scholar 

  9. 9.

    Yu H, Guo M (2010) A self-adapting data collection approach in wireless sensor networks for urban traffic information monitoring. In: IEEE international conference on intelligent computing and intelligent systems (ICIS), 2010, vol 1, pp 196–200

  10. 10.

    Konstantinidis A, Yang K, Zhang Q, Zeinalipour-Yazti D (2010) A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks. Comput Netw 54(6):960–976

    Article  Google Scholar 

  11. 11.

    Zou Y, Chakrabarty K (2003) Sensor deployment and target localization based on virtual forces. In: Twenty-second annual joint conference of the IEEE computer and communications, vol 2, no C, pp 1293–1303

  12. 12.

    Zou Y, Chakrabarty K (2004) Uncertainty-aware and coverage-oriented deployment for sensor networks. J Parallel Distrib Comput 64(7):788–798

    Article  Google Scholar 

  13. 13.

    Fei Z, Li B, Yang S, Xing C, Chen H, Hanzo L (2016) A survey of multi-objective optimization in wireless sensor networks: metrics, algorithms and open problems. IEEE Commun Surv Tutor 19:1–38

    Google Scholar 

  14. 14.

    Hu X, Yang L, Xiong W (2015) A novel wireless sensor network frame for urban transportation. IEEE Internet Things J 2(6):586–595

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Sudhakar Pandey.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Pandey, S., Jain, R., Tripathi, S. et al. KMHSO: k-Means and Harmony Search-Based Optimization Algorithm for Relay Node Selection in Smart Transportation System. Natl. Acad. Sci. Lett. 42, 503–507 (2019). https://doi.org/10.1007/s40009-019-00792-3

Download citation

Keywords

  • Smart transportation system (STS)
  • Wireless sensor networks (WSN)
  • k-Means
  • Harmony search algorithm