Skip to content

PASTOR-Adaptive: a Bounded Feedback-Control Framework for Joint Utility and Token-Governed Forwarding-Rate Adaptation in Delay Tolerant Networks

· i-manager's Journal on Computer Science · Vol 14, pp. 1 · 0 citations · 15 references

TL;DR

PASTOR-Adaptive is presented, a bounded feedback-control framework that extends PASTOR-DTN through joint online adaptation of utility weights and forwarding rate and demonstrates that bounded deterministic adaptation can maintain stable delivery–overhead trade-offs across heterogeneous DTN conditions.

Abstract

Delay Tolerant Networks (DTNs) operate under intermittent connectivity, dynamic topology, and resource-constrained nodes, making efficient routing a persistent challenge. Many existing DTN routing protocols—including probabilistic, social-aware, and utility-based approaches—rely on static or semi-static control parameters that do not adjust to changing network conditions. In our earlier work, PASTOR-DTN introduced a five-signal utility framework integrating encounter predictability, social trust, centrality, buffer headroom, and TTL urgency with token-bucket–based forwarding control. However, the utility weights and token refill rate in PASTOR-DTN remain fixed, limiting responsiveness to time-varying network dynamics. This paper presents PASTOR-Adaptive, a bounded feedback-control framework that extends PASTOR-DTN through joint online adaptation of utility weights and forwarding rate. Rather than employing learning-based optimization with large state spaces and convergence delays, the proposed framework applies a lightweight deterministic control law that adjusts parameters according to locally observable network phase (sparse, normal, or dense) and congestion state. Stability properties are maintained through bounded update increments, normalized weight projection, and negative feedback regulation. An ablation study on five different network settings (sparse, normal, dense, high mobility, heavy traffic) reveals that token rate adaptation is the main adaptive component, reducing the overhead by 29% for dense settings and increasing forwarding activity by 42% for sparse settings. Sensitivity analysis demonstrates robustness, with delivery probability varying by less than 0.5% across a tenfold parameter range. Comparative evaluation against Epidemic, PRoPHET, Spray-and-Wait, MaxProp, and PASTOR-DTN over 18 scenarios indicates that PASTOR-Adaptive achieves 84–98% delivery with overhead ratios between 1.3 and 4.1. These results demonstrate that bounded deterministic adaptation can maintain stable delivery–overhead trade-offs across heterogeneous DTN conditions.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

From Prior-Guided Heuristics to Deployable Agents: Accelerating Demonstration-Driven Reinforcement Learning for Deadline-Constrained Network Control

This paper introduces Effective Congestion (EC), a deadline-aware metric family that quantifies interface congestion by packet urgency and proactively filters non-viable traffic, coupled with a Uniform Path Grouping (UPG) distribution heuristic promoting robust load-balancing; the resulting policies are embedded into M...

Vincenzo Norman Vitale, Mohammad Solki, A. Tulino et al. · 0 citations
Open access 2026

Monotonic Logical Time for Cooperative Tracking in Decentralized Multi-Agent Networks

Cooperative target tracking in decentralized networks depends on a shared notion of time. We advocate monotonic logical time—a network-computed time function that all agents agree on and that never regresses—as a coordination primitive for distributed estimation in lossy, asymmetric wireless networks at the edge, where...

I. Arkhipov, Evgenii Krokhalev, Elizaveta Tarasova et al. · 0 citations
Open access Sep 2026

Packet-Level Adaptive Forwarding with Multi-Cyclic Queues for Time-Sensitive Networks Using Delay Slack

Time-sensitive networking (TSN) aims to provide bounded latency and reliable delivery for critical applications. Existing cyclic queuing and forwarding (CQF)-based mechanisms commonly rely on centralized flow-level scheduling, path computation, and resource reservation, requiring prior knowledge of traffic demands and...

Zheng-Bo Dong, Rui Han · 0 citations
Preprint Aug 2026

A Control-Theoretic Approach for Resource-Aware Consensus in Multi-Agent AI

A novel way is presented to characterize collective belief dynamics as a discrete-time switched system in which communication topologies have distinct consensus-contraction rates and token costs, and defines a consensus safe set that jointly captures agreement and resource feasibility.

James A. Flagg, E. Hernández-Vargas · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.