{"title":"无线Ad Hoc网络中具有自动路由缩短的主动响应路由恢复","authors":"Zilu Liang, Yuzo Taenaka, T. Ogawa, Y. Wakahara","doi":"10.1109/ISADS.2011.14","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a relay recovery route maintenance protocol for ad hoc networks to combine the benefits of both proactive and reactive route recovery strategies and to minimize their drawbacks. In our proposal, one or more substitute routes usually become ready for the recovery of every link in a route before its break, while the route recovery process actually starts only when the upstream node of a link confirms the link break. Since this scheme does not broadcast any control packet, it can effectively recover a broken link without heavy control overhead traffic. Also, it helps reduce the time delay due to the recovery, since substitute routes are already available when the upstream node initiates the route recovery process. We further propose two automatic route shortening schemes to optimize the route during successful packet forwarding without causing extra control overhead. We have implemented our proposed schemes based on AODV and compared their performance with competitive schemes including original AODV. Simulation results demonstrate that our proposal definitely reduces the time delay and control overhead traffic in route repairing process, and that the route shortening schemes further leads to shorter time delay and average route length.","PeriodicalId":221833,"journal":{"name":"2011 Tenth International Symposium on Autonomous Decentralized Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks\",\"authors\":\"Zilu Liang, Yuzo Taenaka, T. Ogawa, Y. Wakahara\",\"doi\":\"10.1109/ISADS.2011.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a relay recovery route maintenance protocol for ad hoc networks to combine the benefits of both proactive and reactive route recovery strategies and to minimize their drawbacks. In our proposal, one or more substitute routes usually become ready for the recovery of every link in a route before its break, while the route recovery process actually starts only when the upstream node of a link confirms the link break. Since this scheme does not broadcast any control packet, it can effectively recover a broken link without heavy control overhead traffic. Also, it helps reduce the time delay due to the recovery, since substitute routes are already available when the upstream node initiates the route recovery process. We further propose two automatic route shortening schemes to optimize the route during successful packet forwarding without causing extra control overhead. We have implemented our proposed schemes based on AODV and compared their performance with competitive schemes including original AODV. Simulation results demonstrate that our proposal definitely reduces the time delay and control overhead traffic in route repairing process, and that the route shortening schemes further leads to shorter time delay and average route length.\",\"PeriodicalId\":221833,\"journal\":{\"name\":\"2011 Tenth International Symposium on Autonomous Decentralized Systems\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Tenth International Symposium on Autonomous Decentralized Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISADS.2011.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Tenth International Symposium on Autonomous Decentralized Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2011.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks
In this paper, we propose a relay recovery route maintenance protocol for ad hoc networks to combine the benefits of both proactive and reactive route recovery strategies and to minimize their drawbacks. In our proposal, one or more substitute routes usually become ready for the recovery of every link in a route before its break, while the route recovery process actually starts only when the upstream node of a link confirms the link break. Since this scheme does not broadcast any control packet, it can effectively recover a broken link without heavy control overhead traffic. Also, it helps reduce the time delay due to the recovery, since substitute routes are already available when the upstream node initiates the route recovery process. We further propose two automatic route shortening schemes to optimize the route during successful packet forwarding without causing extra control overhead. We have implemented our proposed schemes based on AODV and compared their performance with competitive schemes including original AODV. Simulation results demonstrate that our proposal definitely reduces the time delay and control overhead traffic in route repairing process, and that the route shortening schemes further leads to shorter time delay and average route length.