Using geographical coordinates to attain efficient route signaling in ad hoc networks

Yali Wang, C. Westphal, J. Garcia-Luna-Aceves
{"title":"Using geographical coordinates to attain efficient route signaling in ad hoc networks","authors":"Yali Wang, C. Westphal, J. Garcia-Luna-Aceves","doi":"10.1109/WoWMoM.2013.6583403","DOIUrl":null,"url":null,"abstract":"Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WoWMoM.2013.6583403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.
利用地理坐标在自组织网络中实现有效的路由信令
在移动自组织网络(MANET)的许多路由协议中,路由请求或链路状态的泛洪是必要的,并且已经设计了几种机制来提高泛洪的效率;然而,到目前为止,所有泛洪方法都是这样的,每个节点必须使用的邻居数量随着节点密度的增加而增加。提出了一种新的基于坐标感知的按需路由(ORCA)方法,用于manet中路由请求的分发。ORCA中每个节点中继节点的选择是通过计算节点的所有邻居到该节点传输范围内的四个极点的最短欧氏距离来完成的。我们证明了ORCA保证了连接的MANET中所有节点的覆盖,并且每个节点的中继数最多为6个。将ORCA与具有代表性的路由协议AODV、OLSR、LAR、THP进行比较。在200和250节点网络中的仿真结果表明,ORCA在获得与其他四种路由协议相当或更好的平均延迟和数据包投递率时,产生的路由负载最小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信