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

Wireless network applications, such as, searching, routing, selfstabilization and query processing can be modeled as random walks on graphs.Stateless Opportunistic routing technique is a robust distributed routingtechnique based on random walk approach, where nodes transfer the packets toone of their direct neighbors uniformly, until the packets reach theirdestinations. Simplicity in execution, fault tolerance, low overhead androbustness to topology changes made it more suitable to wireless sensornetworks scenarios. But the main disadvantage of stateless opportunisticrouting is estimating and studying the effect of network parameters on thepacket latency. In this work, we derived the analytical expressions for meanlatency or average packet travel time for r-nearest neighbor cycle, r-nearestneighbor torus networks. Further, we derived the generalized expression formean latency for m-dimensional r- nearest neighbor torus networks and studiedthe effect of number of nodes, nearest neighbors and network dimension onaverage packet travel time.

Analysis of Average Travel Time for Stateless Opportunistic Routing Techniques