• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Conference on Artificial Intelligence and Robotics;Asia-Pacific International Symposium >Neighbor-based dynamic multi-factors routing algorithm in MANETs
【24h】

Neighbor-based dynamic multi-factors routing algorithm in MANETs

机译：MANET中基于邻居的动态多因素路由算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Mobile ad-hoc networks (MANETs) have observed exponential progress due to the diversity, simplicity and low-cost devices in the past decades. The reliable network can be provided whenever there is no access to any infrastructure. Mobility is the most significant attributes of MANETs which lead nodes to move freely without the presence of the centralized control. This intriguing attribute made routing a challenging issue among researchers. Broadcasting is one of the common strategies which is used by many routing protocols just to find a route by sending route request (RREQ) packets through the nodes which are deployed in the network and also it is immensely used in several existing routing protocols. Although it ensures better accessibility, it leads to inappropriate overhead all over the network and degrades the performance remarkably. In our proposed method, by considering the characteristics which are compatible with the MANETs, RREQ packets are broadcasted. RREQ packets are broadcasted based on a probability function which considers congestion, overlap, connectivity, and survivability factors. The node which has more remaining energy and connectivity with less congestion and overlapped area is more probable for broadcasting the RREQ packets in the discovery phase. In comparison with modified route maintenance (MRM) scheme and neighbor-based dynamic connectivity factor routing protocol (DCFP), it has been proved that our proposed method performs better in case of normalized routing overhead and energy consumption.
机译：在过去的几十年中，移动自组织网络（MANET）由于其多样性，简单性和低成本设备而获得了指数级的进步。每当无法访问任何基础架构时，都可以提供可靠的网络。移动性是MANET的最重要属性，它导致节点在没有集中控制的情况下自由移动。这种引人入胜的属性使得路由研究人员之间成为一个具有挑战性的问题。广播是许多路由协议使用的常见策略之一，它只是通过通过网络中部署的节点发送路由请求（RREQ）数据包来查找路由，并且它已广泛用于几种现有的路由协议中。尽管它确保了更好的可访问性，但是它会导致整个网络的不适当开销，并显着降低性能。在我们提出的方法中，通过考虑与MANET兼容的特性，可以广播RREQ数据包。基于概率函数广播RREQ数据包，该函数考虑了拥塞，重叠，连接性和可生存性因素。具有更多剩余能量和较少拥塞和重叠区域连接性的节点更有可能在发现阶段广播RREQ数据包。与改进的路由维护（MRM）方案和基于邻居的动态连接因子路由协议（DCFP）相比，已证明我们的方法在标准化的路由开销和能耗的情况下性能更好。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号