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

Assuming a random uniform distribution of n sensor nodes over a virtual grid,this paper addresses the problem of finding the maximum number of connected setcovers each ensuring 100% coverage of the query region. The connected setsremain active one after another in a round robin fashion such that if there areP such set covers, it can enhance the network lifetime P-fold. Fromgraph-theoretic point of view, a centralized O(n3) heuristic is proposed hereto maximize P. Next, for large self-organized sensor networks, a distributedalgorithm is developed. The proposed algorithm is to be executed just once,during the initialization of the network. In case of failure, a distributedrecovery algorithm is executed to rearrange the partitions. Simulation studiesshow that the performance of the proposed distributed algorithm is comparablewith that of the centralized algorithm in terms of number of partitions. Also,comparison with earlier works shows significant improvement in terms of numberof partitions, message complexity and network lifetime.

Distributed Area Coverage by Connected Set Cover Partitioning in Wireless Sensor Networks