Aug 2026· Peer-to-Peer Networking and Applications· Vol 19· 0 citations· 29 references
TL;DR
This research bridges the gap between theoretical queuing models and practical routing strategies, contributing to the development of more efficient routing protocols for MANETs and demonstrates significant improvements in delay, throughput, routing overhead and node lifetime under realistic traffic conditions.
Abstract
In this work, we present a model for multipath routing in Mobile Ad Hoc Networks (MANETs) that considers both bounded and unbounded buffer sizes at each Mobile Node (MN). Traditional multipath routing approaches primarily focus on traffic distribution and path optimization but often overlook the impact of queuing dynamics in practical network scenarios. Existing methods typically assume either infinite buffer capacity or use simplistic delay models that fail to capture the queuing effects caused by buffer constraints at intermediate nodes. As a result, they may not accurately estimate end-to-end latency, leading to suboptimal routing decisions. To address this gap, we analyze the delay characteristics of multipath routing using M/M/1/R, M/M/m, and M/M/m/R queuing networks, which allow for a more precise evaluation of network performance under varying buffer sizes and service capacities. Unlike previous studies, which predominantly rely on simplified queuing assumptions, our model explicitly incorporates both finite and infinite buffer constraints at each MN to assess their impact on delay. The analysis is based on Burke’s Theorem for traffic distribution and Little’s Theorem for latency estimation, enabling optimal path selection based on real-time queuing behavior. Simulation results validate the effectiveness of our approach, demonstrating significant improvements in selecting the best path based on realistic queuing effects. The model is also benchmarked against AOMDV and demonstrates significant improvements in delay, throughput, routing overhead and node lifetime under realistic traffic conditions. This research bridges the gap between theoretical queuing models and practical routing strategies, contributing to the development of more efficient routing protocols for MANETs.
This paper studies AQM deployment in a specific class of networks where routers/switches have a topological hierarchy, form acyclic paths, and adopt multipath routing and defines a Katz centrality-based metric to choose the most appropriate router for AQM deployment, and argues that doing so ensures the greatest stabilising effect.
Mahima Gupta, Acquin Biju, Rijul Jain et al.· 0 citations
A new Enhanced Intelligent-based Energy and Mobility, and Obstacle-aware Clustering (EIEMOC) protocol to control the network congestion while meeting End-to-End Delay (E2D) constraints in delay-constrained FANET applications.
J. Rajeswari, R. Kousalya· International Journal of Ele...· 0 citations
Overall, ICN-style receiver-driven forwarding can serve as a deployable overlay transport substrate for coordinated WAN multipath without requiring changes to IP routing.
This work develops a multi-agent reinforcement learning (MARL) algorithm, termed Multi-Agent Proximal Policy Optimization with Dirichlet Modeling (MAPPO-DM), which follows the centralized-training-and-decentralized-execution framework and models continuous traffic-splitting actions using a Dirichlet distribution.
Zhenyu Zhao, Tiankui Zhang, Xiaoxia Xu et al.· 0 citations
Wi-Fi 8 introduces Prioritized EDCA (P-EDCA) to support latency-critical traffic within which DS-RTS/CTS operates as a two-phase channel access procedure. In this mechanism, stations first compete in a Defer Signal (DS) contention, which determines the number of stations entering RTS/CTS contention, creating a stochastic coupling not captured by existing IEEE 802.11 models. We develop an analytical framework for the performance analysis of DS-RTS/CTS using a 2-D Markov chain to model the RTS backoff process of a tagged station under a variable number of contenders. Using this model, we obtain expressions for head-of-line delay and normalized throughput. We further formulate an optimization problem for adaptive selection of the DS contention window size. Results show that a moderately sized DS contention window achieves a favorable throughput-delay trade-off across network densities.
Mahith Chintada, Sreelakshmi Manjunath· International Conference on...· 0 citations