Advertisement

Local Search Approaches with Different Problem-Specific Steps for Sensor Network Coverage Optimization

  • Krzysztof Trojanowski
  • Artur MikitiukEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

In this paper, we study relative performance of local search methods used for the Maximum Lifetime Coverage Problem (MLCP) solving. We consider nine algorithms obtained by swapping problem-specific major steps between three local search algorithms we proposed earlier: LS\(_{\mathrm {HMA}}\), LS\(_{\mathrm {CAIA}}\), and LS\(_{\mathrm {RFTA}}\). A large set of tests carried out with the benchmark data set SCP1 showed that the algorithm based on the hypergraph model approach (HMA) is the most effective. The remaining results of other algorithms divide them into two groups: effective ones, and weak ones. The findings expose the strengths and weaknesses of the problem-specific steps applied in the local search methods.

Keywords

Maximum lifetime coverage problem Local search Perturbation operators 

References

  1. 1.
    Gil, J.M., Han, Y.H.: A target coverage scheduling scheme based on genetic algorithms in directional sensor networks. Sensors (Basel, Switzerland) 11(2), 1888–1906 (2011).  https://doi.org/10.3390/s110201888CrossRefGoogle Scholar
  2. 2.
    Keskin, M.E., Altinel, I.K., Aras, N., Ersoy, C.: Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility. Ad Hoc Netw. 17, 18–36 (2014).  https://doi.org/10.1016/j.adhoc.2014.01.003CrossRefGoogle Scholar
  3. 3.
    Roselin, J., Latha, P., Benitta, S.: Maximizing the wireless sensor networks lifetime through energy efficient connected coverage. Ad Hoc Netw. 62, 1–10 (2017).  https://doi.org/10.1016/j.adhoc.2017.04.001CrossRefGoogle Scholar
  4. 4.
    Tretyakova, A., Seredynski, F.: Application of evolutionary algorithms to maximum lifetime coverage problem in wireless sensor networks. In: IPDPS Workshops, pp. 445–453. IEEE (2013).  https://doi.org/10.1109/IPDPSW.2013.96
  5. 5.
    Tretyakova, A., Seredynski, F.: Simulated annealing application to maximum lifetime coverage problem in wireless sensor networks. In: Global Conference on Artificial Intelligence, GCAI, vol. 36, pp. 296–311. EasyChair (2015)Google Scholar
  6. 6.
    Tretyakova, A., Seredynski, F., Bouvry, P.: Graph cellular automata approach to the maximum lifetime coverage problem in wireless sensor networks. Simulation 92(2), 153–164 (2016).  https://doi.org/10.1177/0037549715612579CrossRefGoogle Scholar
  7. 7.
    Tretyakova, A., Seredynski, F., Guinand, F.: Heuristic and meta-heuristic approaches for energy-efficient coverage-preserving protocols in wireless sensor networks. In: Proceedings of the 13th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet’17, pp. 51–58. ACM (2017).  https://doi.org/10.1145/3132114.3132119
  8. 8.
    Trojanowski, K., Mikitiuk, A., Guinand, F., Wypych, M.: Heuristic optimization of a sensor network lifetime under coverage constraint. In: Computational Collective Intelligence: 9th International Conference, ICCCI 2017, Nicosia, Cyprus, 27–29 Sept 2017, Proceedings, Part I, LNCS, vol. 10448, pp. 422–432. Springer International Publishing (2017).  https://doi.org/10.1007/978-3-319-67074-4_41CrossRefGoogle Scholar
  9. 9.
    Trojanowski, K., Mikitiuk, A., Kowalczyk, M.: Sensor network coverage problem: a hypergraph model approach. In: Computational Collective Intelligence: 9th International Conference, ICCCI 2017, Nicosia, Cyprus, 27–29 Sept 2017, Proceedings, Part I, LNCS, vol. 10448, pp. 411–421. Springer International Publishing (2017).  https://doi.org/10.1007/978-3-319-67074-4_40CrossRefGoogle Scholar
  10. 10.
    Trojanowski, K., Mikitiuk, A., Napiorkowski, K.J.M.: Application of local search with perturbation inspired by cellular automata for heuristic optimization of sensor network coverage problem. In: Parallel Processing and Applied Mathematics, LNCS, vol. 10778, pp. 425–435. Springer International Publishing (2018).  https://doi.org/10.1007/978-3-319-78054-2_40CrossRefGoogle Scholar
  11. 11.
    Wang, B.: Coverage Control in Sensor Networks. Computer Communications and Networks. Springer (2010).  https://doi.org/10.1007/978-1-84800-328-6Google Scholar
  12. 12.
    Wang, L., Wu, W., Qi, J., Jia, Z.: Wireless sensor network coverage optimization based on whale group algorithm. Comput. Sci. Inf. Syst. 15(3), 569–583 (2018).  https://doi.org/10.2298/CSIS180103023WCrossRefGoogle Scholar
  13. 13.
    Yile, W.U., Qing, H.E., Tongwei, X.U.: Application of improved adaptive particle swarm optimization algorithm in WSN coverage optimization. Chin. J. Sens. Actuators (2016)Google Scholar
  14. 14.
    Zorbas, D., Glynos, D., Kotzanikolaou, P., Douligeris, C.: BGOP: an adaptive coverage algorithm for wireless sensor networks. In: Proceedings of the 13th European Wireless Conference, EW07 (2007)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Cardinal Stefan Wyszyński UniversityWarsawPoland

Personalised recommendations