Achieving Throughput via Fine-Grained Path Planning in Small World DTNs

02/18/2019
by   Dhrubojyoti Roy, et al.
0

We explore the benefits of using fine-grained statistics in small world DTNs to achieve high throughput without the aid of external infrastructure. We first design an empirical node-pair inter-contacts model that predicts meetings within a time frame of suitable length, typically of the order of days, with a probability above some threshold, and can be readily computed with low overhead. This temporal knowledge enables effective time-dependent path planning that can be respond to even per-packet deadline variabilities. We describe one such routing framework, REAPER (for Reliable, Efficient and Predictive Routing), that is fully distributed and self-stabilizing. Its key objective is to provide probabilistic bounds on path length (cost) and delay in a temporally fine-grained way, while exploiting the small world structure to entail only polylogarithmic storage and control overhead. A simulation-based evaluation confirms that REAPER achieves high throughput and energy efficiency across the spectrum of ultra-light to heavy network traffic, and substantially outperforms state-of-the-art single copy protocols as well as sociability-based protocols that rely on essentially coarse-grained metrics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2017

Path planning for Robotic Mobile Fulfillment Systems

This paper presents a collection of path planning algorithms for real-ti...
research
09/27/2016

An Evaluation of Coarse-Grained Locking for Multicore Microkernels

The trade-off between coarse- and fine-grained locking is a well underst...
research
10/21/2021

FlexTOE: Flexible TCP Offload with Fine-Grained Parallelism

FlexTOE is a flexible, yet high-performance TCP offload engine (TOE) to ...
research
11/26/2021

Fabric-SCF: A Blockchain-based Secure Storage and Access Control Scheme for Supply Chain Finance

Supply chain finance(SCF) is committed to providing credit for small and...
research
02/01/2018

Study of Uniform Jitter Mechanism for Metric-based Wireless Routing

Many wireless protocols wait a small and random amount of time which is ...
research
05/09/2023

QF-Geo: Capacity Aware Geographic Routing using Bounded Regions of Wireless Meshes

Routing in wireless meshes must detour around holes. Extant routing prot...
research
01/06/2021

Fine-Grained Complexity of Regular Path Queries

A regular path query (RPQ) is a regular expression q that returns all no...

Please sign up or login with your details

Forgot password? Click here to reset