首页> 外文期刊>Journal of Intelligent Systems >FL-TOHIP (Fractional Lion Algorithm to Topology-Hiding Multipath Routing Protocol) in Mobile ad hoc Network
【24h】

FL-TOHIP (Fractional Lion Algorithm to Topology-Hiding Multipath Routing Protocol) in Mobile ad hoc Network

机译:移动临时网络中的FL-TAIH(分数狮子算法到拓扑隐藏多路径路由协议)

获取原文
获取原文并翻译 | 示例
           

摘要

Due to the dynamic nature of the mobile ad hoc network (MANET), all the nodes are mobile and generously connected to other nodes without the use of any fixed communications. Because of the random movement of nodes, the network topology is not predicted easily. Therefore, routing is one of the major challenging tasks in MANET. Significantly, the topology-hiding multipath routing protocol (TOHIP) is used to eliminate the topological exposure problem by transmitting the information through disjoint paths from the source to the destination. To select the optimal routing path, we have proposed the fractional lion algorithm to TOHIP (FL-TOHIP). Initially, the routing path is designed in MANET based on the existing TOHIP, which generates the number of disjoint routing paths. Then, the optimal path selection is done by the proposed fractional lion algorithm. To improve the solution searching, the fractional lion algorithm is adapted to the mathematical theory called fractional calculus. Finally, the performance of the proposed protocol is compared to the existing protocol using the delay, energy, and cost.
机译:由于移动临时网络(MANET)的动态性质,所有节点都是移动的,并且在不使用任何固定通信的情况下慷慨地连接到其他节点。由于节点的随机移动,因此不容易预测网络拓扑。因此,路由是MANET中的主要具有挑战性的任务之一。值得注意的是,拓扑隐藏多路径路由协议(TOHIP)用于通过通过从源到目的地的不相交路径发送信息来消除拓扑曝光问题。要选择最佳路径路径,我们提出了小型狮子算法(Fl-Tohip)。最初,路由路径基于现有的TOHITE在MANET中设计,它生成不相交的路径路径的数量。然后,通过所提出的分数狮子算法来完成最佳路径选择。为了改善解决方案搜索,分数狮子算法适用于分数微积分的数学理论。最后,使用延迟,能量和成本将所提出的协议的性能与现有协议进行比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号