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

This paper uses a bipartite network model to calculate the coverage achievedby a delay-tolerant information dissemination algorithm in a specializedsetting. The specialized Delay Tolerant Network (DTN) system comprises staticmessage buffers or throwboxes kept in popular places besides the mobile agentshopping from one place to another. We identify that an informationdissemination technique that exploits the throwbox infrastructure can coveronly a fixed number of popular places irrespective of the time spent. We noticethat such DTN system has a natural bipartite network correspondence where twosets are the popular places and people visiting those places. This helpsleveraging the theories of evolving bipartite networks (BNW) to provide anappropriate explanation of the observed temporal invariance of informationcoverage over the DTN. In this work, we first show that information coveragecan be estimated by the size of the largest component in the thresholdedone-mode projection of BNW. Next, we also show that exploiting a specialproperty of BNW, the size of the largest component size can be calculated fromthe degree distribution. Combining these two, we derive a closed form simpleequation to accurately predict the amount of information coverage in DTN whichis almost impossible to achieve using the traditional techniques such asepidemic or Markov modeling. The equation shows that full coverage quicklybecomes extremely difficult to achieve if the number of places increases whilevariation in agent's activity helps in covering more places.

Coverage analysis of information dissemination in throwbox-augmented DTN