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 networked systems, monitoring devices such as sensors are typicallydeployed to monitor various target locations. Targets are the points in thephysical space at which events of some interest, such as random faults orattacks, can occur. Most often, these devices have limited energy supplies, andthey can operate for a limited duration. As a result, energy-efficientmonitoring of various target locations through a set of monitoring devices withlimited energy supplies is a crucial problem in networked systems. In thispaper, we study optimal scheduling of monitoring devices to maximize networkcoverage for detecting and isolating events on targets for a given networklifetime. The monitoring devices considered could remain active only for afraction of the overall network lifetime. We formulate the problem ofscheduling of monitoring devices as a graph labeling problem, which unlikeother existing solutions, allows us to directly utilize the underlying networkstructure to explore the trade-off between coverage and network lifetime. Inthis direction, first we propose a greedy heuristic to solve the graph labelingproblem, and then provide a game-theoretic solution to achieve near optimalgraph labeling. Moreover, the proposed setup can be used to simultaneouslysolve the scheduling and placement of monitoring devices, which yields improvedperformance as compared to separately solving the placement and schedulingproblems. Finally, we illustrate our results on various networks, includingreal-world water distribution networks.

Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks