A. Khosrozadeh, Abolfazl Akbari, Maryam Bagheri, Neda Beikmahdavi
{"title":"New AODV Routing Protocol with Break Avoidance","authors":"A. Khosrozadeh, Abolfazl Akbari, Maryam Bagheri, Neda Beikmahdavi","doi":"10.1109/ISCCS.2011.107","DOIUrl":null,"url":null,"abstract":"Many routing protocols in mobile ad-hoc networks have been developed by many researchers. One of ad-hoc routing protocol types is the on-demand routing that establishes a route to a destination node only when required. However, most of on-demand routing protocols reestablish a new route after a route break. In this paper, we propose a new route maintenance algorithm to avoid route breaks because each intermediate node on an active route detects a danger of a link break to an upstream node and reestablishes a new route before a route break. We propose this algorithm based on AODV) [2], [3].","PeriodicalId":326328,"journal":{"name":"2011 International Symposium on Computer Science and Society","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Symposium on Computer Science and Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCCS.2011.107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Many routing protocols in mobile ad-hoc networks have been developed by many researchers. One of ad-hoc routing protocol types is the on-demand routing that establishes a route to a destination node only when required. However, most of on-demand routing protocols reestablish a new route after a route break. In this paper, we propose a new route maintenance algorithm to avoid route breaks because each intermediate node on an active route detects a danger of a link break to an upstream node and reestablishes a new route before a route break. We propose this algorithm based on AODV) [2], [3].