A heuristic protocol combined location service in geographic ad hoc routing

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI:10.1109/WCINS.2010.5543111

You-fu Jiang, G. Wang, Hai-yang Jin

{"title":"A heuristic protocol combined location service in geographic ad hoc routing","authors":"You-fu Jiang, G. Wang, Hai-yang Jin","doi":"10.1109/WCINS.2010.5543111","DOIUrl":null,"url":null,"abstract":"Wireless geographic Ad Hoc routing has been extensively studied in recent years. As geographic routing has topology-unrelated features, and it can independently selects the next hop with local location information, it is suitable for large-scale Ad Hoc networks. However, geographic forwarding suffers from a problem of how to do at the local minimum node where greedy forwarding fails. In this paper, we proposed the heuristic algorithm to solve this problem, and proposed an improved heuristic algorithm which constrains the forwarding on the basis of the adjacent connection-grid instead of jumping over the world like the static networks because of the limited power of wireless nodes. This scheme can not only overcome the complexity of the planar graph routing, but also provide the prediction of the void to cope with the complex terrain problem. Simulation results show that our solutions can significantly reduce the number of the extended nodes, improve the packet delivery success rate and decrease the routing overhead.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCINS.2010.5543111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

Abstract

Wireless geographic Ad Hoc routing has been extensively studied in recent years. As geographic routing has topology-unrelated features, and it can independently selects the next hop with local location information, it is suitable for large-scale Ad Hoc networks. However, geographic forwarding suffers from a problem of how to do at the local minimum node where greedy forwarding fails. In this paper, we proposed the heuristic algorithm to solve this problem, and proposed an improved heuristic algorithm which constrains the forwarding on the basis of the adjacent connection-grid instead of jumping over the world like the static networks because of the limited power of wireless nodes. This scheme can not only overcome the complexity of the planar graph routing, but also provide the prediction of the void to cope with the complex terrain problem. Simulation results show that our solutions can significantly reduce the number of the extended nodes, improve the packet delivery success rate and decrease the routing overhead.

查看原文本刊更多论文

结合地理自组织路由中位置服务的启发式协议

无线地理自组织路由近年来得到了广泛的研究。由于地理路由具有拓扑无关的特点，能够根据本地位置信息独立选择下一跳，因此适合于大规模的Ad Hoc网络。然而，地理转发存在着贪婪转发失败的局部最小节点怎么办的问题。本文提出了一种启发式算法来解决这一问题，并提出了一种改进的启发式算法，该算法不像静态网络那样由于无线节点的功率有限而跨越世界，而是基于相邻的连接网格来约束转发。该方案不仅克服了平面图布线的复杂性，而且为应对复杂地形问题提供了空洞的预测。仿真结果表明，该方案可以显著减少扩展节点的数量，提高数据包的投递成功率，降低路由开销。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2010 IEEE International Conference on Wireless Communications, Networking and Information Security

自引率

0.00%

发文量