Advertisement

Wireless Personal Communications

, Volume 110, Issue 2, pp 545–562 | Cite as

Optimum K-coverage in Wireless Sensor Network with no Redundant Node by Cellular Learning Automata

  • Mahdi TorshiziEmail author
  • Mohammad Javad Sheikhzadeh
Article
  • 27 Downloads

Abstract

Wireless Sensor Networks have been widely considered as one of the most important technologies for the twenty-first century. Thus, the coverage and energy consumption are the key issues of wireless sensor network research. Some protocols such as SKS and CCA have been developed recently to achieve k-coverage in dense sensor networks along with maximizing network lifetime and removing redundant active nodes. In this paper, we propose a new distributed location unaware algorithm named CLARRKC in order to maintain full k-coverage as long as possible while deactivating all of redundant nodes by Cellular Learning Automata. CLARRKC has considerably low communication and computation complexity and is of degree O(1). It uses load balancing and does not need sensors location information. Simulations show that our work can maintain full k-coverage up to 60% of network lifetime and outperforms other state-of-the-art protocols i.e. SKS and CCA in terms of activated nodes and energy consumption.

Keywords

Cellular learning automata Wireless sensor networks K-coverage Redundant node Dense sensor networks 

Notes

References

  1. 1.
    More, A., & Raisinghani, V. (2017). A survey on energy efficient coverage protocols in wireless sensor networks. Journal of King Saud University-Computer and Information Sciences,29(4), 428–448.CrossRefGoogle Scholar
  2. 2.
    Kanta, P., Prasad, A. M., & Suma, V. (2015). Area coverage redundancy and node positioning in wireless sensor networks. International Journal of Computer Applications,111(5), 1–3.CrossRefGoogle Scholar
  3. 3.
    Katsuma, R., Murata, Y., Shibata, N., Yasumoto, K., & Ito, M. (2010). Extending k-coverage lifetime of wireless sensor networks with surplus nodes. In Proceedings of the 5th international conference on mobile computing and ubiquitous networking, Seattle (pp. 9–16).Google Scholar
  4. 4.
    Ghaderi, R., Esnaashari, M., & Meybodi, M. R. (2014). A cellular learning automata-based algorithm for solving the coverage and connectivity problem in wireless sensor networks. Ad Hoc and Sensor Wireless Networks,22(3–4), 171–203.Google Scholar
  5. 5.
    Yu, J., Wan, S., Cheng, X., & Yu, D. (2017). Coverage contribution area based k-coverage for wireless sensor networks. IEEE Transactions on Vehicular Technology,66(9), 8510–8523.CrossRefGoogle Scholar
  6. 6.
    Hefeeda, M., & Bagheri, M. (2006). Efficient k-coverage algorithms for wireless sensor networks. Technical Report TR 2006-22, School of Computing Science, Simon Fraser University.Google Scholar
  7. 7.
    Hefeeda, M., & Bagheri, M. (2009). Forest fire modeling and early detection using wireless sensor networks. Ad Hoc and Sensor Wireless Networks,7(3–4), 169–224.Google Scholar
  8. 8.
    Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., & Gill, C. (2005). Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Transactions on Sensor Networks (TOSN),1(1), 36–72.CrossRefGoogle Scholar
  9. 9.
    Le, N. T., & Jang, Y. M. (2015). Energy-efficient coverage guarantees scheduling and routing strategy for wireless sensor networks. International Journal of Distributed Sensor Networks,11(8), 612383.CrossRefGoogle Scholar
  10. 10.
    More, A., & Raisinghani, V. (2015). Discharge curve backoff sleep protocol for energy efficient coverage in wireless sensor networks. Procedia Computer Science,57, 1131–1139.CrossRefGoogle Scholar
  11. 11.
    Yu, J., Chen, Y., Ma, L., Huang, B., & Cheng, X. (2016). On connected target k-coverage in heterogeneous wireless sensor networks. Sensors,16(1), 104.CrossRefGoogle Scholar
  12. 12.
    Chen, B., Jamieson, K., Balakrishnan, H., & Morris, R. (2002). Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wireless Networks,8(5), 481–494.CrossRefGoogle Scholar
  13. 13.
    Tian, J., Gao, M., & Ge, G. (2016). Wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm. EURASIP Journal on Wireless Communications and Networking,2016(1), 104.CrossRefGoogle Scholar
  14. 14.
    Sahoo, P., Thakkar, H., & Hwang, I. (2017). Pre-scheduled and self organized sleep-scheduling algorithms for efficient K-coverage in wireless sensor networks. Sensors,17(12), 2945.CrossRefGoogle Scholar
  15. 15.
    Bagheri, M. (2009). K-coverage and its application to forest fire detection. Retrieved September 29, 2019 from https://nsl.cs.sfu.ca/wiki/K-Coverage_and_its_Application_to_Forest_Fire_Detection.

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of ComputerGonbad Kavous UniversityGonbad KavousIran

Personalised recommendations