English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

K-barrier coverage is an important coverage model for achie ving robust barrier coverage in wireless sensor networks. After initia l random sensor deployment, k-barrier coverage can be achieved by moving mobile se nsors to form k barriers consisting of k sensor chains crossing the region. In m obile sensor network, it is challenging to reduce the moving distances of mobile sens ors to prolong the network lifetime. Existing work mostly focused on forming line ar barriers, that is the final positions of sensors are on a straight line, which resul t d in large redundant movements. However, the moving cost of sensors can be furthe r reduced if nonlinear barriers are allowed, which means that sensors’ final positions need not be on a straight line. In this paper, we propose two algorithms of f orming non-linear k barriers energy-efficiently. The algorithms use a novel model, called horizontal virtual force model, which considers both the euclidean distance an d horizontal angle between two sensors. Then we propose two barrier forming algor ithms. To construct a barrier, one algorithm always chooses the mobile sensor ch ain with the largest horizontal virtual force and then flattens it, called sensor chain algorithm. The other chooses the mobile sensor with the largest horizontal virtu al force to construct the barrier, other than the mobile sensor chain, called single s ensor algorithm. Simulation results show that the algorithms significantly reduce t he movements of mobile sensors compared to a linear k-barrier coverage algorithm. Besides, the sensor chain algorithm outperforms the single sensor algorithm when the sensor density becomes higher.

Energy-efficient non-linear k-barrier coverage in mobile sensor network