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 this paper we propose distributed flooding-based storage algorithms forlarge-scale wireless sensor networks. Assume a wireless sensor network with $n$nodes that have limited power, memory, and bandwidth. Each node is capable ofboth sensing and storing data. Such sensor nodes might disappear from thenetwork due to failures or battery depletion. Hence it is desired to designefficient schemes to collect data from these $n$ nodes. We propose twodistributed storage algorithms (DSA's) that utilize network flooding to solvethis problem. In the first algorithm, DSA-I, we assume that every node utilizesnetwork flooding to disseminate its data throughout the network using a mixingtime of approximately O(n). We show that this algorithm is efficient in termsof the encoding and decoding operations. In the second algorithm, DSA-II, weassume that the total number of nodes is not known to every sensor; hencedissemination of the data does not depend on $n$. The encoding operations inthis case take $O(C\mu^2)$, where $\mu$ is the mean degree of the network graphand $C$ is a system parameter. We evaluate the performance of the proposedalgorithms through analysis and simulation, and show that their performancematches the derived theoretical results.

Distributed Flooding-based Storage Algorithms for Large-scale Sensor Networks