{"title":"基于AODV快速修复的改进路由维护策略的实现与性能比较","authors":"A. Shastri, G. Shrivastava","doi":"10.1109/CSNT.2013.70","DOIUrl":null,"url":null,"abstract":"There have been various routing protocols proposed for static and mobile ad-hoc networks. AODV is an efficient reactive protocol uses traditional routing tables having one entry per destination. An important feature of AODV is the maintenance of time based states in each node, a routing entry not recently used is expired. In case of original AODV, when a link between two nodes fail, AODV issues RREQ control packets for the same destination and tries to find out a new route for it. This regeneration of control packet not only delays the process of data sending but also decreases the throughput of the network. Thus to overcome this decrease in throughput, this proposed approach uses a data structure named 'backup-list' to hold all the active routes for that destination and finds the optimal route. This enhances the packet delivery ratio as well as overall throughput of the network.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"223 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Implementation and Performance Comparison of Improved Route Maintenance Strategy in AODV for Quick Route Healing\",\"authors\":\"A. Shastri, G. Shrivastava\",\"doi\":\"10.1109/CSNT.2013.70\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There have been various routing protocols proposed for static and mobile ad-hoc networks. AODV is an efficient reactive protocol uses traditional routing tables having one entry per destination. An important feature of AODV is the maintenance of time based states in each node, a routing entry not recently used is expired. In case of original AODV, when a link between two nodes fail, AODV issues RREQ control packets for the same destination and tries to find out a new route for it. This regeneration of control packet not only delays the process of data sending but also decreases the throughput of the network. Thus to overcome this decrease in throughput, this proposed approach uses a data structure named 'backup-list' to hold all the active routes for that destination and finds the optimal route. This enhances the packet delivery ratio as well as overall throughput of the network.\",\"PeriodicalId\":111865,\"journal\":{\"name\":\"2013 International Conference on Communication Systems and Network Technologies\",\"volume\":\"223 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Communication Systems and Network Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNT.2013.70\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2013.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation and Performance Comparison of Improved Route Maintenance Strategy in AODV for Quick Route Healing
There have been various routing protocols proposed for static and mobile ad-hoc networks. AODV is an efficient reactive protocol uses traditional routing tables having one entry per destination. An important feature of AODV is the maintenance of time based states in each node, a routing entry not recently used is expired. In case of original AODV, when a link between two nodes fail, AODV issues RREQ control packets for the same destination and tries to find out a new route for it. This regeneration of control packet not only delays the process of data sending but also decreases the throughput of the network. Thus to overcome this decrease in throughput, this proposed approach uses a data structure named 'backup-list' to hold all the active routes for that destination and finds the optimal route. This enhances the packet delivery ratio as well as overall throughput of the network.