{"title":"间歇连接Ad Hoc网络中的地理路由","authors":"Erik Kuiper, S. Nadjm-Tehrani","doi":"10.1109/WAINA.2008.132","DOIUrl":null,"url":null,"abstract":"In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Geographical Routing in Intermittently Connected Ad Hoc Networks\",\"authors\":\"Erik Kuiper, S. Nadjm-Tehrani\",\"doi\":\"10.1109/WAINA.2008.132\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.\",\"PeriodicalId\":170418,\"journal\":{\"name\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2008.132\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2008.132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Geographical Routing in Intermittently Connected Ad Hoc Networks
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destination. In this paper we present LAROD, a geographical routing protocol for intermittently connected networks. Combining beacon less geographical routing with store-carry-forward LAROD greedily searches for the shortest way to the destination and when no progress is possible packets are temporarily stored until node mobility has created a new path. In the paper we have shown by a comparative study that LAROD has almost as good delivery rate as an epidemic routing scheme, but at a substantially lower overhead.