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

We propose distributed link reversal algorithms to circumvent communicationvoids in geographic routing. We also solve the attendant problem of integeroverflow in these algorithms. These are achieved in two steps. First, we derivepartial and full link reversal algorithms that do not require one-hop neighborinformation, and convert a destination-disoriented directed acyclic graph (DAG)to a destination-oriented DAG. We embed these algorithms in the framework ofGafni and Bertsekas ("Distributed algorithms for generating loop-free routes innetworks with frequently changing topology", 1981) in order to establish theirtermination properties. We also analyze certain key properties exhibited by ourneighbor oblivious link reversal algorithms, e.g., for any two neighbors, theirt-states are always consecutive integers, and for any node, its t-state size isupper bounded by log(N). In the second step, we resolve the integer overflowproblem by analytically deriving one-bit full link reversal and two-bit partiallink reversal versions of our neighbor oblivious link reversal algorithms.

Neighbor Oblivious and Finite-State Algorithms for Circumventing Local Minima in Geographic Forwarding