...
首页> 外文期刊>Computers, IEEE Transactions on >ProgressFace: An Algorithm to Improve Routing Efficiency of GPSR-Like Routing Protocols in Wireless Ad Hoc Networks
【24h】

ProgressFace: An Algorithm to Improve Routing Efficiency of GPSR-Like Routing Protocols in Wireless Ad Hoc Networks

机译:ProgressFace:一种提高无线自组织网络中类似于GPSR的路由协议的路由效率的算法

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

摘要

In GPSR-like routing, such as GPSR, GFG, GOAFR+, and GPVFR, perimeter forwarding is used to recover from a greedy forwarding failure by routing the packet to a progress node along the face boundary. The problem of perimeter forwarding is that many hops may be taken if the packet is forwarded in the wrong direction. We propose an algorithm, termed ProgressFace, that uses an additional traversal step to decide the direction of perimeter forwarding. A concave node sends a short packet to traverse the face boundary to identify the progress set, which consists of at most four nodes, such that, for any destination, at least one progress node is in the progress set or the neighbor set. Additionally, the hop distances of the nodes in the progress set along both directions are evaluated so that the shorter one is identified. The following packets encountering the concave node each are then sent along the corresponding direction toward the progress node in the progress set or the neighbor set. Simulations show that GPSR, GFG, GOAFR+, and GPVFR each conduct a shorter routing path, if augmented with the ProgressFace algorithm.
机译:在像GPSR,GFG,GOAFR +和GPVFR之类的类似GPSR的路由中,周界转发用于通过将数据包沿面部边界路由到进度节点来从贪婪的转发失败中恢复。周边转发的问题是,如果数据包以错误的方向转发,则可能会跳很多跳。我们提出了一种称为ProgressFace的算法,该算法使用附加的遍历步骤来确定周边转发的方向。凹形节点发送短数据包以遍历人脸边界以标识进度集,该进度集最多由四个节点组成,这样,对于任何目的地,进度集或邻居集中至少有一个进度节点。另外,评估沿两个方向的进度集中的节点的跳跃距离,以便识别较短的节点。然后,每个遇到凹节点的数据包都沿着相应的方向朝着进度集或邻居集中的进度节点发送。仿真表明,如果使用ProgressFace算法增强功能,GPSR,GFG,GOAFR +和GPVFR各自都具有较短的路由路径。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号