Duc D. Nguyen, Myungchul Kim, Le Quy Loc, P. T. Tu
{"title":"一种基于跳数的manet路由方案","authors":"Duc D. Nguyen, Myungchul Kim, Le Quy Loc, P. T. Tu","doi":"10.1109/CCNC08.2007.89","DOIUrl":null,"url":null,"abstract":"We propose a new scheme to reduce route discovery latency for reactive routing protocols, named HOp-based adaptive reduction (HOBAR). In the route discovery phase of reactive routing protocols, source nodes spend extra waiting time to get optimal routes after receiving the first route reply. Our scheme appropriately sets this waiting time period depending on the number of hops in the first route reply. Our simulation results show that HOBAR offers fewer hop routes, significantly reduces route discovery latency, and is more scalable in highly loaded and large networks.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hop-Based Routing Scheme for MANETs\",\"authors\":\"Duc D. Nguyen, Myungchul Kim, Le Quy Loc, P. T. Tu\",\"doi\":\"10.1109/CCNC08.2007.89\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new scheme to reduce route discovery latency for reactive routing protocols, named HOp-based adaptive reduction (HOBAR). In the route discovery phase of reactive routing protocols, source nodes spend extra waiting time to get optimal routes after receiving the first route reply. Our scheme appropriately sets this waiting time period depending on the number of hops in the first route reply. Our simulation results show that HOBAR offers fewer hop routes, significantly reduces route discovery latency, and is more scalable in highly loaded and large networks.\",\"PeriodicalId\":183858,\"journal\":{\"name\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC08.2007.89\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC08.2007.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a new scheme to reduce route discovery latency for reactive routing protocols, named HOp-based adaptive reduction (HOBAR). In the route discovery phase of reactive routing protocols, source nodes spend extra waiting time to get optimal routes after receiving the first route reply. Our scheme appropriately sets this waiting time period depending on the number of hops in the first route reply. Our simulation results show that HOBAR offers fewer hop routes, significantly reduces route discovery latency, and is more scalable in highly loaded and large networks.