首页> 外文会议>2011 International Conference on Networking, Sensing and Control >Link availability modeling for routing algorithms to reduce the link break time in MANETs
【24h】

Link availability modeling for routing algorithms to reduce the link break time in MANETs

机译:路由算法的链路可用性建模,以减少MANET中的链路断开时间

获取原文

摘要

In the design of mobile ad hoc networks, a challenging problem is how to route information reliably and efficiently from one node to another in moderate to high level of mobility. In this paper, we propose a new routing protocol, called link effective available time (LEAT) routing. First, we propose a method to find the link available time during an epoch by measuring the distances between the two nodes of a mobile link, instead of using complete localization information. Second, in order to reduce the link breakage, we propose a new link cost for routing, i.e., the product of the available time and availability of a link. Based on the new cost, the routing is formulated as an optimal routing problem, for which a heuristic algorithm is developed. Simulation results have demonstrated that LEAT significantly reduces link breakages while maintains network performance in delay, hopcounts and throughput, as compared to the existing routing algorithms.
机译:在移动自组织网络的设计中,一个具有挑战性的问题是如何以中等到高度的移动性将信息可靠而有效地从一个节点路由到另一个节点。在本文中,我们提出了一种新的路由协议,称为链路有效可用时间(LEAT)路由。首先,我们提出一种方法,该方法通过测量移动链接的两个节点之间的距离而不是使用完整的本地化信息来查找某个时期内的链接可用时间。其次,为了减少链路中断,我们提出了用于路由的新链路成本,即,可用时间和链路可用性的乘积。基于新成本,将路由公式化为最优路由问题,为此,开发了一种启发式算法。仿真结果表明,与现有的路由算法相比,LEAT可以显着减少链路中断,同时在延迟,跳数和吞吐量方面保持网络性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号