首页> 外文期刊>Indian Journal of Science and Technology >An Improved Routing Algorithm for Mobile Opportunistic Networks using a Genetic Approach
【24h】

An Improved Routing Algorithm for Mobile Opportunistic Networks using a Genetic Approach

机译:基于遗传算法的移动机会网络的改进路由算法

获取原文
           

摘要

Background/Objectives: Nowadays, Mobile Opportunistic Networks (MONs) are counted as one of the most interesting development of MANETs. In MONs, forwarding messages through mobile nodes is a big challenging research problem. Methods/Analysis: In this study, an optimization technique that based on a Genetic Algorithm (GA) is proposed. It is oriented towards solving most issues faced in Delay/Disruption Tolerant Network (DTN) routing such as there is no end to end connectivity between nodes, long delay for transmission message in path, congestion during sending the message and more. Findings: The proposed technique outperforms the other state-of-art methods regarding to delivery ratio, message transmission delay and message overhead ratio. Application/Improvements: Compared to the state-of art methods, the results show that our proposed algorithm has a better performance in terms of message delivery ratio and message transmission delay, and message overhead ratio.
机译:背景/目标:如今,移动机会网络(MON)被认为是MANET最有趣的发展之一。在MON中,通过移动节点转发消息是一个很大的挑战性研究问题。方法/分析:在这项研究中,提出了一种基于遗传算法(GA)的优化技术。它旨在解决延迟/中断容忍网络(DTN)路由中遇到的大多数问题,例如节点之间没有端到端的连接,路径中传输消息的长延迟,发送消息期间的拥塞等等。发现:所提出的技术在传送率,消息传输延迟和消息开销率方面优于其他最新方法。应用/改进:结果表明,与现有方法相比,我们提出的算法在消息传递率,消息传输延迟和消息开销率方面具有更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号