Scholarlink

<p>Delay Tolerant Networks (DTNs) are engineered to facilitate communication in environments where traditional networking methods struggle due to intermittent connectivity. Such scenarios include surveillance operations, wildlife tracking, and rugged terrains, where sustained connections are often unachievable. This paper delves into the limitations of conventional routing protocols in DTNs, which typically rely on end-to-end connectivity, and explores several established strategies, including spray and wait, First Contact, probabilistic routing protocol based on history of encounters and transitivity (PROPHET), probabilistic routing protocol based on history of encounters and transitivity version 2 (PROPHETV2), and epidemic routing. A primary challenge identified with the PROPHET protocol is its reliance on transitive increments, which can distort the delivery predictability (DP) vector. This distortion leads to the propagation of outdated or stale information throughout the network, resulting in suboptimal decisions for packet forwarding. To address this critical issue, we propose a modified version of the PROPHET routing protocol that enhances the representation of both direct and transitive links between nodes. Our approach emphasizes a more precise calculation of DP values, ensuring that the routing decisions are based on the most current and relevant information available. We conducted extensive simulations to evaluate the performance of our modified protocol against several benchmarks, including epidemic routing, First Contact, PROPHET, and PROPHETV2. The results demonstrate that our proposed model significantly improves both average hop count and packet delivery rates. Specifically, our modified protocol achieves the highest delivery ratio while maintaining the lowest average hop count among the evaluated models. These findings indicate that our approach not only enhances the efficiency of data transmission in DTNs but also optimizes resource utilization in challenging communication environments. This study contributes to the ongoing development of robust routing solutions for DTNs, offering a promising alternative to traditional methods and paving the way for more effective data delivery in scenarios where connectivity is unpredictable.</p>

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

An Optimized Load Balancing Probabilistic Protocol for Delay Tolerant Networks

  • 期刊论文

  • 发表日期：

    2025年2月5日

查看全文
  • Idris Afzal Shah,
  • Mushtaq Ahmed

摘要

Delay Tolerant Networks (DTNs) are engineered to facilitate communication in environments where traditional networking methods struggle due to intermittent connectivity. Such scenarios include surveillance operations, wildlife tracking, and rugged terrains, where sustained connections are often unachievable. This paper delves into the limitations of conventional routing protocols in DTNs, which typically rely on end-to-end connectivity, and explores several established strategies, including spray and wait, First Contact, probabilistic routing protocol based on history of encounters and transitivity (PROPHET), probabilistic routing protocol based on history of encounters and transitivity version 2 (PROPHETV2), and epidemic routing. A primary challenge identified with the PROPHET protocol is its reliance on transitive increments, which can distort the delivery predictability (DP) vector. This distortion leads to the propagation of outdated or stale information throughout the network, resulting in suboptimal decisions for packet forwarding. To address this critical issue, we propose a modified version of the PROPHET routing protocol that enhances the representation of both direct and transitive links between nodes. Our approach emphasizes a more precise calculation of DP values, ensuring that the routing decisions are based on the most current and relevant information available. We conducted extensive simulations to evaluate the performance of our modified protocol against several benchmarks, including epidemic routing, First Contact, PROPHET, and PROPHETV2. The results demonstrate that our proposed model significantly improves both average hop count and packet delivery rates. Specifically, our modified protocol achieves the highest delivery ratio while maintaining the lowest average hop count among the evaluated models. These findings indicate that our approach not only enhances the efficiency of data transmission in DTNs but also optimizes resource utilization in challenging communication environments. This study contributes to the ongoing development of robust routing solutions for DTNs, offering a promising alternative to traditional methods and paving the way for more effective data delivery in scenarios where connectivity is unpredictable.