The DOI matches its Crossref record.
Mobility and Intruder Prior Information Improving the Barrier Coverage of Sparse Sensor Networks
Abstract
The barrier coverage problem in emerging mobile sensor networks has been an interesting research issue due to many related real-life applications. Existing solutions are mainly concerned with deciding one-time movement for individual sensors to construct as many barriers as possible, which may not be suitable when there are no sufficient sensors to form a single barrier. In this paper, we aim to achieve barrier coverage in the sensor scarcity scenario by dynamic sensor patrolling. Specifically, we design a periodic monitoring scheduling (PMS) algorithm in which each point along the barrier line is monitored periodically by mobile sensors. Based on the insight from PMS, we then propose a coordinated sensor patrolling (CSP) algorithm to further improve the barrier coverage, where each sensor's current movement strategy is derived from the information of intruder arrivals in the past. By jointly exploiting sensor mobility and intruder arrival information, CSP is able to significantly enhance barrier coverage. We prove that the total distance that sensors move during each time slot in CSP is the minimum. Considering the decentralized nature of mobile sensor networks, we further introduce two distributed versions of CSP: S-DCSP and G-DCSP. We study the scenario where sensors are moving on two barriers and propose two heuristic algorithms to guide the movement of sensors. Finally, we generalize our results to work for different intruder arrival models. Through extensive simulations, we demonstrate that the proposed algorithms have desired barrier coverage performances.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Optimal Workload Allocation in Fog-Cloud Computing Towards Balanced Delay and Power Consumption
Deng, R., Lu, R., Lai, C., Luan, T. H., & Liang, H. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2565516 · Cited by 676
An IoT-cloud Based Wearable ECG Monitoring System for Smart Healthcare
Yang, Z., Zhou, Q., Lei, L., Zheng, K., & Xiang, W. (2016) · Journal of Medical Systems · doi:10.1007/s10916-016-0644-9 · Cited by 490
ActiveTrust: Secure and Trustable Routing in Wireless Sensor Networks
Liu, Y., Dong, M., Ota, K., & Liu, A. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2570740 · Cited by 351
Metadata
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2014-06
- Volume
- 13
- Issue
- 6
- Pages
- 1268-1282
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2099737489
- Cited by
- 181
- References
- 0
- FWCI
- 32.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.