{"title":"Position-based unicast routing for city scenarios","authors":"S. Schnaufer, W. Effelsberg","doi":"10.1109/WOWMOM.2008.4594851","DOIUrl":null,"url":null,"abstract":"In vehicular ad-hoc networks unicast packet forwarding can be separated into the one-dimensional highway case and the two-dimensional city case; in this paper, we deal with the latter. We survey existing position-based routing protocols and present GRANT, our own approach of greedy routing with an abstract neighbor table. We simulate each protocol in our city scenario of Karlsruhe, consisting of streets with a length of 66 km, 390 junctions, and radio obstacles derived from high-definition satellite images. We also simulate the protocols with a FACE-2- and a distance vector-based recovery strategy. As a result we propose GRANT as a routing protocol for unicast city scenarios.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"66","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOWMOM.2008.4594851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 66
Abstract
In vehicular ad-hoc networks unicast packet forwarding can be separated into the one-dimensional highway case and the two-dimensional city case; in this paper, we deal with the latter. We survey existing position-based routing protocols and present GRANT, our own approach of greedy routing with an abstract neighbor table. We simulate each protocol in our city scenario of Karlsruhe, consisting of streets with a length of 66 km, 390 junctions, and radio obstacles derived from high-definition satellite images. We also simulate the protocols with a FACE-2- and a distance vector-based recovery strategy. As a result we propose GRANT as a routing protocol for unicast city scenarios.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
