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

dc.contributor.author Mini, S.
dc.contributor.author Udgata, Siba K.
dc.contributor.author Sabat, Samrat L.
dc.date.accessioned 2022-03-27T05:50:40Z
dc.date.available 2022-03-27T05:50:40Z
dc.date.issued 2011-12-01
dc.description.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. © 2011 Springer-Verlag.
dc.identifier.citation Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.7076 LNCS(PART 1)
dc.identifier.issn 03029743
dc.identifier.uri 10.1007/978-3-642-27172-4_77
dc.identifier.uri http://link.springer.com/10.1007/978-3-642-27172-4_77
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/8201
dc.subject ABC Algorithm
dc.subject k-coverage
dc.subject Probabilistic Coverage
dc.subject Sensor Deployment
dc.subject Target Coverage
dc.title Sensor deployment for probabilistic target k-coverage using artificial bee colony algorithm
dc.type Book Series. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: