2017
DOI: 10.1109/jiot.2017.2688366
|View full text |Cite
|
Sign up to set email alerts
|

Queuing Algorithm for Effective Target Coverage in Mobile Crowd Sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…The effective target coverage measures the capability to provide sensing coverage with a certain quality to monitor a set of targets in an area [199]. The problem is tackled with queuing model-based algorithm where the sensors arrive and leave the coverage region following a birth process and death process.…”
Section: Theoretical Work Operational Research and Optimizationmentioning
confidence: 99%
“…The effective target coverage measures the capability to provide sensing coverage with a certain quality to monitor a set of targets in an area [199]. The problem is tackled with queuing model-based algorithm where the sensors arrive and leave the coverage region following a birth process and death process.…”
Section: Theoretical Work Operational Research and Optimizationmentioning
confidence: 99%
“…On the other hand, Obinikpo et al [27] proposed queue theory to model target coverage in MCS. The model is based on birth-and-death mechanism which represents the arrival and exit of sensors in an MCS environment.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In a related research work, Howard et al in [26] presented a greedy method of sensor deployment in a maximum coverage region, but the drawbacks still remain their use of GPS network, while the target or interest points was inconclusive and remained undefined. A queuing algorithm based on birthand-death models for effective target coverage proposed by Obinikpo et al in [27] was introduced for mobile crowd sensing in order to determine the waiting time of target, the mean busy period and idle period of the deployed sensors. While an NP-hard problem was evidently resolved in [28], in other to guarantee a defined lifetime for the sensor nodes for unspecified networks.…”
Section: Preliminaries and Related Workmentioning
confidence: 99%