{"title":"链路质量感知自组织按需距离矢量路由协议","authors":"Hsin-Mu Tsai, N. Wisitpongphan, O. Tonguz","doi":"10.1109/ISWPC.2006.1613587","DOIUrl":null,"url":null,"abstract":"Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the \"hand-off\" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":"{\"title\":\"Link-quality aware ad hoc on-demand distance vector routing protocol\",\"authors\":\"Hsin-Mu Tsai, N. Wisitpongphan, O. Tonguz\",\"doi\":\"10.1109/ISWPC.2006.1613587\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the \\\"hand-off\\\" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.\",\"PeriodicalId\":145728,\"journal\":{\"name\":\"2006 1st International Symposium on Wireless Pervasive Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 1st International Symposium on Wireless Pervasive Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWPC.2006.1613587\",\"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 1st International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2006.1613587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Link-quality aware ad hoc on-demand distance vector routing protocol
Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the "hand-off" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.