Scheduling algorithms for K-barrier coverage to improve transmission efficiency in WSNs

Zhu, Yao; Meng, Ming; Zheng, Zetian

doi:10.1007/s11042-019-7316-y

Cited by 6 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are some solutions for barrier coverage problem based on the classical theories: based on the divide and conquer theory, Wen et al [15] proposed an efficient algorithm to construct k-barrier; based on the Dijkstra algorithm, Liu et al [16] realized the minimum full-view coverage for mobile CSNs. And there are some algorithms for meeting special requirements in barrier coverage problem: the sensor interference issue was solved in the algorithm for k-barrier coverage in [17]; the one-way k -barrier algorithm was proposed in [18] to avoid one-way 2…”

Section: Related Workmentioning

confidence: 99%

Lifetime-Maximized Strong Barrier Coverage of 3D Camera Sensor Networks

Hong

Luo

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Camera sensor networks (CSNs) have advantages on providing the precise and multimedia information for plenty of applications. The high coverage quality of CSNs especially satisfies the monitoring requirements of barrier coverage. In three-dimensional (3D) application scenarios, the tracking of the potential intruder in the monitored irregular spaces brings more difficulties and challenges on strong barrier coverage for CSNs. In this paper, we consider the strong barrier coverage problem in 3D CSNs and focus on the objective of monitoring the intruder with high resolution and maximizing the network lifetime. We firstly introduce the definition and hardness proof for the problem based on the irregular space model and the network model, which adopts the Region of Interest (ROI) sensing model with high effective resolution. Secondly, we design two sleep-and-awake scheduling algorithms for the problem in homogeneous and heterogeneous networks, respectively, which are based on the auxiliary graph transformation and the disjoint flows construction. To evaluate these algorithms’ performance on the lifetime maximization, we conduct extensive simulation experiments and analyze their results on their advantages and applicable scenarios.

show abstract

Section: Related Workmentioning

confidence: 99%

Lifetime-Maximized Strong Barrier Coverage of 3D Camera Sensor Networks

Hong

Luo

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…This limitation is addressed using the benefit function with an adjustable sensing range to improve the overall energy conservation significantly. The non-critical redundant nodes are identified using 3D Voronoi diagram in [151] and using 2D Voronoi diagram in [152]. The sensor nodes that lie in small Voronoi cells are considered noncritical for guaranteeing coverage and hence are put to "sleep" state in both the approaches above.…”

Section: Figure 18 State Diagram Of Obsp Protocolmentioning

confidence: 99%

“…The computational complexity of this approach increases as the size of the network increases. In [187], [190], the network is converted to an undirected graph, and then a This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/ This article has been accepted for publication in a future issue of this journal, but has not been fully edited.…”

Section: ) the Graph-based Approachesmentioning

confidence: 99%