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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In mobile wireless sensor networks (MWSNs), each sensor has the ability notonly to sense and transmit data but also to move to some specific location.Because the movement of sensors consumes much more power than that in sensingand communication, the problem of scheduling mobile sensors to cover alltargets and maintain network connectivity such that the total movement distanceof mobile sensors is minimized has received a great deal of attention. However,in reality, due to a limited budget or numerous targets, mobile sensors may benot enough to cover all targets or form a connected network. Therefore, targetsmust be weighted by their importance. The more important a target, the higherthe weight of the target. A more general problem for target coverage andnetwork connectivity, termed the Maximum Weighted Target Coverage and SensorConnectivity with Limited Mobile Sensors (MWTCSCLMS) problem, is studied. Inthis paper, an approximation algorithm, termed theweighted-maximum-coverage-based algorithm (WMCBA), is proposed for thesubproblem of the MWTCSCLMS problem. Based on the WMCBA, the Steiner-tree-basedalgorithm (STBA) is proposed for the MWTCSCLMS problem. Simulation resultsdemonstrate that the STBA provides better performance than the other methods.

On New Approaches of Maximum Weighted Target Coverage and Sensor Connectivity: Hardness and Approximation