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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Recent advances in wireless sensor networks (WSNs) have led to many newpromissing applications. However data communication between nodes consumes alarge portion of the total energy of WSNs. Consequently efficient dataaggregation technique can help greatly to reduce power consumption. Dataaggregation has emerged as a basic approach in WSNs in order to reduce thenumber of transmissions of sensor nodes over {\it aggregation tree} and henceminimizing the overall power consumption in the network. If a sensor node failsduring data aggregation then the aggregation tree is disconnected. Hence theWSNs rely on in-network aggregation for efficiency but a single faulty node canseverely influence the outcome by contributing an arbitrary partial aggregatevalue.  In this paper we have presented a distributed algorithm that reconstruct theaggregation tree from the initial aggregation tree excluding the faulty sensornode. This is a synchronous model that is completed in several rounds. Ourproposed scheme can handle multiple number of faulty nodes as well.

Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless Sensor Networks