Sensor deployment for probabilistic target k-coverage using artificial bee colony algorithm

  • Authors:
  • S. Mini;Siba K. Udgata;Samrat L. Sabat

  • Affiliations:
  • Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India;School of Physics, University of Hyderabad, Hyderabad, India

  • Venue:
  • SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A higher level of coverage is required for many sensitive applications. Though initial work on target coverage problems in wireless sensor networks used binary sensing model, a more realistic sensing model, the probabilistic sensing model has been used later. This work considers probabilistic k-coverage; where the required level of coverage has to be satisfied with k sensors and each target should also be monitored with a specific probability. We compute the optimal deployment location of sensor nodes, such that the probabilistic coverage as well as the k-coverage requirement is satisfied with the required sensing range being optimal. Preliminary results of using artificial bee colony algorithm to solve deployment problem for probabilistic target k-coverage is reported in this paper.