Skip to main content
SpringerLink
Log in
Book cover

Advanced Computing and Communication Technologies pp 257–264Cite as

Genetic Algorithm-Based Heuristic for Solving Target Coverage Problem in Wireless Sensor Networks

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 562))

Abstract

Target coverage problem in the wireless sensor networks schedule sensors into subsets such that all the targets are monitored by each subset. Existing heuristics to solve this problem aims to maximize the total network lifetime. In last few decades, genetic algorithm-based methods have been proved more suitable to solve such optimization problems. In this paper, we propose a solution heuristic for target coverage problem which is based on genetic algorithm approach. The simulation results show that the proposed heuristic outperforms the existing methods.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Commun. Mag. 40(8), 102–114 (2002)

    Article  Google Scholar 

  2. Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: Proceedings of the IEEE International Conference on Communications, 472–476 (2001)

    Google Scholar 

  3. Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: Proceedings of the 24th Conference of the IEEE Communications Society, vol. 3, 1976–1984 (2005)

    Google Scholar 

  4. Manju, N., Chand, S., Kumar, B.: Maximizing network lifetime for target coverage problem in wireless sensor networks, IET Wirel. Sens. Syst. doi:10.1049/iet-wss0094 (2015)

  5. Pujari, A.K., Mini, S., Padhi, T., Sahoo, P.: Polyhedral approach for lifetime maximization of target coverage problem. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking, pp. 1–8 (2015)

    Google Scholar 

  6. Dimple, M.: Maximum Coverage Heuristics (MCH) for target coverage problem in wireless sensor networks. In: 4th IEEE International Advance Computing Conference (IACC2014), pp. 300–305 (2014)

    Google Scholar 

  7. Chaudhary, M., Pujari, A.K.: Q-coverage problem in wireless sensor networks. In: Proceedings of the 2009 International Conference on Distributed Computing and Networking, pp. 325–330 (2009)

    Google Scholar 

  8. Gupta, S.K., Kuilab, P., Jana, P.K.: Genetic algorithm approach for k-coverage and m-connected node placement in target based wireless sensor networks. Comput. Electr. Eng. 1–13 (2015)

    Google Scholar 

  9. Cerulli, F.C.R., D’Ambrosio, C., Raiconi, A.: A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints. J. Netw. Comput. Appl. 58, 12–22 (2015)

    Article  Google Scholar 

  10. Rebai, M., Leberre, M., Snoussi, H., Hnaien, F., Khoukhi, L.: Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks. Comput. Oper. Res. 59, 11–21 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  11. Raiconi, A., Gentili, M.: Exact and metaheuristic approaches to extend lifetime and maintain connectivity in wireless sensors networks. Lecture Notes in Computer Science, vol. 6701, 607–619. Springer, Berlin/Heidelberg (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Netaji Subhash Institute of Technology, Sector-3, Dwarka, New Delhi, 110078, India

    Manju, Deepti Singh & Bijendra Kumar

  2. School of Computer and System Sciences, Jawaharlal Nehru University, New Delhi, 110067, India

    Satish Chand

Authors
  1. Manju
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepti Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Satish Chand
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bijendra Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manju .

Editor information

Editors and Affiliations

  1. Asia Pacific Institute of Information Technology, Panipat, Haryana, India

    Ramesh K. Choudhary

  2. Department of Computer Science and Engineering, Faculty of Engineering, Technology and Management, Kalyani University, Kalyani, West Bengal, India

    Jyotsna Kumar Mandal

  3. Computational Science Division, Saha Institute of Nuclear Physics, Kolkata, West Bengal, India

    Dhananjay Bhattacharyya

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Manju, Singh, D., Chand, S., Kumar, B. (2018). Genetic Algorithm-Based Heuristic for Solving Target Coverage Problem in Wireless Sensor Networks. In: Choudhary, R., Mandal, J., Bhattacharyya, D. (eds) Advanced Computing and Communication Technologies. Advances in Intelligent Systems and Computing, vol 562. Springer, Singapore. https://doi.org/10.1007/978-981-10-4603-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4603-2_24

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4602-5

  • Online ISBN: 978-981-10-4603-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation