{"title":"Local Maximum Avoidance with Correlated Street Blocking for Map-based Geographic Routing in VANETs","authors":"Trung-Tuan Luong, Boon-Chong Seet, Bu-Sung Lee","doi":"10.1109/ISWPC.2007.342626","DOIUrl":null,"url":null,"abstract":"Inter-vehicular communication has a large potential to enhance road traffic safety and introduce many new services. Geographic routing is known to be a scalable and robust routing strategy for vehicular ad hoc networks (VANETs). However, VANETs with constrained mobility and frequently encountered radio obstacles often result in geographic routing to enter local maximum, which in turn degrades its performance. In this paper, we investigate different recovery schemes for geographic routing to recover from local maximum in a city environment. In addition, we also introduce a new procedure for nodes to avoid entering local maximum. The proposed avoidance scheme is found to show significant performance improvement in a comparative study of three geographic routing protocols","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2007.342626","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Inter-vehicular communication has a large potential to enhance road traffic safety and introduce many new services. Geographic routing is known to be a scalable and robust routing strategy for vehicular ad hoc networks (VANETs). However, VANETs with constrained mobility and frequently encountered radio obstacles often result in geographic routing to enter local maximum, which in turn degrades its performance. In this paper, we investigate different recovery schemes for geographic routing to recover from local maximum in a city environment. In addition, we also introduce a new procedure for nodes to avoid entering local maximum. The proposed avoidance scheme is found to show significant performance improvement in a comparative study of three geographic routing protocols