Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A queuing-theoretic framework for delay optimization in multipath routing for MANETs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年8月4日

查看全文
  • Rashmi Kushwah

摘要

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.