{"title":"ORRP: Optimal Reactive Routing Protocol for Mobile Ad-Hoc Networks","authors":"N. Chaki, R. Chaki","doi":"10.1109/CISIM.2007.55","DOIUrl":null,"url":null,"abstract":"An ad-hoc network is a self-supporting collection of mobile nodes that happen to exist within a close proximity in an interval of time. In this paper, a reactive routing protocol has been proposed that computes the shortest path in between any source-destination pair on demand. The approach, unlike other reactive protocols, finds a loop-free, optimal path between the end nodes. It does not use broadcasting like DSR or some other reactive protocols. In fact ORRP exchanges only (n-1) control packets, in the best case. A comparative performance evaluation establishes the advantages of ORRP. The paper is a substantial extension of our earlier work reported in [S. Dulta et al., 2006].","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIM.2007.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
An ad-hoc network is a self-supporting collection of mobile nodes that happen to exist within a close proximity in an interval of time. In this paper, a reactive routing protocol has been proposed that computes the shortest path in between any source-destination pair on demand. The approach, unlike other reactive protocols, finds a loop-free, optimal path between the end nodes. It does not use broadcasting like DSR or some other reactive protocols. In fact ORRP exchanges only (n-1) control packets, in the best case. A comparative performance evaluation establishes the advantages of ORRP. The paper is a substantial extension of our earlier work reported in [S. Dulta et al., 2006].
ad-hoc网络是一种自支持的移动节点集合，这些节点碰巧在一段时间内存在于距离很近的地方。本文提出了一种响应式路由协议，根据需要计算任意源-目的对之间的最短路径。与其他响应式协议不同，该方法在终端节点之间找到无环路的最优路径。它不像DSR或其他一些响应式协议那样使用广播。事实上，在最好的情况下，ORRP只交换(n-1)个控制数据包。一项比较绩效评估确立了ORRP的优势。该论文是我们在[S.]报告的早期工作的实质性扩展。Dulta et al.， 2006]。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
