{"title":"最优响应路由协议(ORRP):一种新的Ad Hoc网络最短路径响应路由协议","authors":"Sagnik Dutta, Ritupama Chaki, N. Chaki","doi":"10.1109/INDCON.2006.302850","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new reactive routing protocol that we call optimal reactive routing protocol (ORRP). The proposed protocol does not require global periodic advertisement of routing messages like the proactive approaches. At the same time, ORRP guarantees optimal path solution. The protocol uses the Dijkstra's shortest path routing algorithm. The demand on the overall bandwidth available is substantially less for the proposed protocol. It has been established that ORRP combines the advantages of both proactive and reactive routing protocols while reducing the limitations of the two approaches","PeriodicalId":122715,"journal":{"name":"2006 Annual IEEE India Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Optimal Reactive Routing Protocol (ORRP): A New Reactive Routing Protocol for the Shortest Path in Ad Hoc Networks\",\"authors\":\"Sagnik Dutta, Ritupama Chaki, N. Chaki\",\"doi\":\"10.1109/INDCON.2006.302850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new reactive routing protocol that we call optimal reactive routing protocol (ORRP). The proposed protocol does not require global periodic advertisement of routing messages like the proactive approaches. At the same time, ORRP guarantees optimal path solution. The protocol uses the Dijkstra's shortest path routing algorithm. The demand on the overall bandwidth available is substantially less for the proposed protocol. It has been established that ORRP combines the advantages of both proactive and reactive routing protocols while reducing the limitations of the two approaches\",\"PeriodicalId\":122715,\"journal\":{\"name\":\"2006 Annual IEEE India Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Annual IEEE India Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDCON.2006.302850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Annual IEEE India Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDCON.2006.302850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal Reactive Routing Protocol (ORRP): A New Reactive Routing Protocol for the Shortest Path in Ad Hoc Networks
In this paper, we present a new reactive routing protocol that we call optimal reactive routing protocol (ORRP). The proposed protocol does not require global periodic advertisement of routing messages like the proactive approaches. At the same time, ORRP guarantees optimal path solution. The protocol uses the Dijkstra's shortest path routing algorithm. The demand on the overall bandwidth available is substantially less for the proposed protocol. It has been established that ORRP combines the advantages of both proactive and reactive routing protocols while reducing the limitations of the two approaches
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
