{"title":"具有接收信号强度的自组织网络长寿命路径路由","authors":"R. Chang, Shing-Jiuan Leu","doi":"10.1109/ISWPC.2006.1613588","DOIUrl":null,"url":null,"abstract":"Routing paths in mobile ad hoc networks are easily disrupted due to the mobility of nodes. Therefore, it is desirable to find a routing path such that all edges in the path are long-lived. Based on the ad hoc on-demand distance vector routing (AODV) protocol, we propose an AODV-RSS (AODV with received signal strength) routing protocol such that connectivities of links in the route found can sustain longer. The AODV-RSS algorithm uses the received signal strength, RSS9 and the received signal strength changing rate, ARSS, to predict the link available time, LAT. Using the LAT as a constraint, our method will find out a satisfying routing path. Simulation results show that our routing algorithm can greatly improve the quality of the routing path in route connection time, and route reestablishment frequency.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Long-lived path routing with received signal strength for ad hoc networks\",\"authors\":\"R. Chang, Shing-Jiuan Leu\",\"doi\":\"10.1109/ISWPC.2006.1613588\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing paths in mobile ad hoc networks are easily disrupted due to the mobility of nodes. Therefore, it is desirable to find a routing path such that all edges in the path are long-lived. Based on the ad hoc on-demand distance vector routing (AODV) protocol, we propose an AODV-RSS (AODV with received signal strength) routing protocol such that connectivities of links in the route found can sustain longer. The AODV-RSS algorithm uses the received signal strength, RSS9 and the received signal strength changing rate, ARSS, to predict the link available time, LAT. Using the LAT as a constraint, our method will find out a satisfying routing path. Simulation results show that our routing algorithm can greatly improve the quality of the routing path in route connection time, and route reestablishment frequency.\",\"PeriodicalId\":145728,\"journal\":{\"name\":\"2006 1st International Symposium on Wireless Pervasive Computing\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"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.1613588\",\"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.1613588","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Long-lived path routing with received signal strength for ad hoc networks
Routing paths in mobile ad hoc networks are easily disrupted due to the mobility of nodes. Therefore, it is desirable to find a routing path such that all edges in the path are long-lived. Based on the ad hoc on-demand distance vector routing (AODV) protocol, we propose an AODV-RSS (AODV with received signal strength) routing protocol such that connectivities of links in the route found can sustain longer. The AODV-RSS algorithm uses the received signal strength, RSS9 and the received signal strength changing rate, ARSS, to predict the link available time, LAT. Using the LAT as a constraint, our method will find out a satisfying routing path. Simulation results show that our routing algorithm can greatly improve the quality of the routing path in route connection time, and route reestablishment frequency.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
