Critical Location Spatial-Temporal Coverage Optimization in Visual Sensor Network.

Clicks: 224
ID: 53964
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #1,230 of 1,694 articles by views in sensors

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,694 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Coverage and network lifetime are two fundamental research issues in visual sensor networks. In some surveillance scenarios, there are some critical locations that demand to be monitored within a designated period. However, with limited sensor nodes resources, it may not be possible to meet both coverage and network lifetime requirements. Therefore, in order to satisfy the network lifetime constraint, sometimes the coverage needs to be traded for network lifetime. In this paper, we study how to schedule sensor nodes to maximize the spatial-temporal coverage of the critical locations under the constraint of network lifetime. First, we analyze the sensor node scheduling problem for the spatial-temporal coverage of the critical locations and establish a mathematical model of the node scheduling. Next, by analyzing the characteristics of the model, we propose a Two-phase Spatial-temporal Coverage-enhancing Method (TSCM). In phase one, a Particle Swarm Optimization (PSO) algorithm is employed to organize the directions of sensor nodes to maximize the number of covered critical locations. In the second phase, we apply a Genetic Algorithm (GA) to get the optimal working time sequence of each sensor node. New coding and decoding strategies are devised to make GA suitable for this scheduling problem. Finally, simulations are conducted and the results show that TSCM has better performance than other approaches.
Reference Key
xiong2019criticalsensors Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Xiong, Yonghua;Li, Jing;Lu, Manjie;
Journal sensors
Year 2019
DOI
E4106
URL
Keywords
sensor node scheduling spatial-temporal coverage two-phase coverage-enhancing method visual sensor network

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.