无线网状网络中一种高效的ORR协议

C. Reddy, H. K. Pati
{"title":"无线网状网络中一种高效的ORR协议","authors":"C. Reddy, H. K. Pati","doi":"10.1109/PDGC.2012.6449806","DOIUrl":null,"url":null,"abstract":"Routing protocols of Wireless Mesh Networks (WMNs) are mainly classified into two types proactive and reactive, which flood the packets during route discovery or dissemination and thus have limited scalability. The other routing protocols like geographic and hierarchical protocols handle the scalability at the cost of more state information maintained at each node. Orthogonal Rendezvous Routing Protocol (ORRP) is a lightweight, scalable routing protocol which maintains even distribution of state information and thus avoids from a single point of failure. The problem associated with the ORRP is the deviation of the beam of directional antenna when we cannot find path along the orthogonal directions. In this paper we propose an efficient Orthogonal Rendezvous Routing Protocol to determine when the mandatory deviation is required, and also how to avoid the unnecessary deviation at the intermediate nodes along the orthogonal path. We have carried out extensive simulation experiments. The simulation results indicate that the performance of our proposed Modified ORRP is substantially improved when compared with the basic ORRP.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient ORR protocol for Wireless Mesh Networks\",\"authors\":\"C. Reddy, H. K. Pati\",\"doi\":\"10.1109/PDGC.2012.6449806\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing protocols of Wireless Mesh Networks (WMNs) are mainly classified into two types proactive and reactive, which flood the packets during route discovery or dissemination and thus have limited scalability. The other routing protocols like geographic and hierarchical protocols handle the scalability at the cost of more state information maintained at each node. Orthogonal Rendezvous Routing Protocol (ORRP) is a lightweight, scalable routing protocol which maintains even distribution of state information and thus avoids from a single point of failure. The problem associated with the ORRP is the deviation of the beam of directional antenna when we cannot find path along the orthogonal directions. In this paper we propose an efficient Orthogonal Rendezvous Routing Protocol to determine when the mandatory deviation is required, and also how to avoid the unnecessary deviation at the intermediate nodes along the orthogonal path. We have carried out extensive simulation experiments. The simulation results indicate that the performance of our proposed Modified ORRP is substantially improved when compared with the basic ORRP.\",\"PeriodicalId\":166718,\"journal\":{\"name\":\"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDGC.2012.6449806\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDGC.2012.6449806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

无线网状网络(Wireless Mesh Networks, wmn)的路由协议主要分为主动路由协议和被动路由协议两种,这种协议在路由发现或传播过程中会导致数据包泛滥,因此可扩展性有限。其他路由协议(如地理和层次协议)处理可伸缩性的代价是在每个节点上维护更多的状态信息。正交交会路由协议(ORRP)是一种轻量级的、可扩展的路由协议,它保持状态信息的均匀分布,从而避免了单点故障。ORRP的主要问题是定向天线在正交方向上找不到路径时波束的偏移。本文提出了一种有效的正交交会路由协议,以确定何时需要强制偏差,以及如何避免正交路径上中间节点的不必要偏差。我们进行了大量的模拟实验。仿真结果表明,与基本ORRP相比,改进ORRP的性能有了很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient ORR protocol for Wireless Mesh Networks
Routing protocols of Wireless Mesh Networks (WMNs) are mainly classified into two types proactive and reactive, which flood the packets during route discovery or dissemination and thus have limited scalability. The other routing protocols like geographic and hierarchical protocols handle the scalability at the cost of more state information maintained at each node. Orthogonal Rendezvous Routing Protocol (ORRP) is a lightweight, scalable routing protocol which maintains even distribution of state information and thus avoids from a single point of failure. The problem associated with the ORRP is the deviation of the beam of directional antenna when we cannot find path along the orthogonal directions. In this paper we propose an efficient Orthogonal Rendezvous Routing Protocol to determine when the mandatory deviation is required, and also how to avoid the unnecessary deviation at the intermediate nodes along the orthogonal path. We have carried out extensive simulation experiments. The simulation results indicate that the performance of our proposed Modified ORRP is substantially improved when compared with the basic ORRP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信