{"title":"城市车辆环境下基于道路连通性的动态路由","authors":"N. Brahmi, M. Boussedjra, J. Mouzna, M. Bayart","doi":"10.1109/VNC.2009.5416373","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a new geographic routing scheme for urban vehicular environments called “Dynamic Road Connectivity-based Routing” (D-RCBR). The proposed approach exploits distributed information about road connectivity and vehicles distribution to optimize routing decisions. To ensure the packet delivery, D-RCBR defines a new concept of Road Connectivity that provides local topology knowledge and checks if two adjacent intersections delimiting a road segment are actually connected through multi-hop vehicular communication. Then, based on local dissemination strategy, a dynamic routing is performed through the road intersections according to greedy principle. However, since local maximum problems are likely to happen considering only a greedy selection of vertex, D-RCBR defines a recovery procedure inspired from the right hand rule. The simulation results show encouraging performance in comparison to other existing approaches in the literature.","PeriodicalId":228148,"journal":{"name":"2009 IEEE Vehicular Networking Conference (VNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Dynamic routing based on road connectivity for urban vehicular environments\",\"authors\":\"N. Brahmi, M. Boussedjra, J. Mouzna, M. Bayart\",\"doi\":\"10.1109/VNC.2009.5416373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a new geographic routing scheme for urban vehicular environments called “Dynamic Road Connectivity-based Routing” (D-RCBR). The proposed approach exploits distributed information about road connectivity and vehicles distribution to optimize routing decisions. To ensure the packet delivery, D-RCBR defines a new concept of Road Connectivity that provides local topology knowledge and checks if two adjacent intersections delimiting a road segment are actually connected through multi-hop vehicular communication. Then, based on local dissemination strategy, a dynamic routing is performed through the road intersections according to greedy principle. However, since local maximum problems are likely to happen considering only a greedy selection of vertex, D-RCBR defines a recovery procedure inspired from the right hand rule. The simulation results show encouraging performance in comparison to other existing approaches in the literature.\",\"PeriodicalId\":228148,\"journal\":{\"name\":\"2009 IEEE Vehicular Networking Conference (VNC)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Vehicular Networking Conference (VNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VNC.2009.5416373\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Vehicular Networking Conference (VNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNC.2009.5416373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic routing based on road connectivity for urban vehicular environments
In this paper, we introduce a new geographic routing scheme for urban vehicular environments called “Dynamic Road Connectivity-based Routing” (D-RCBR). The proposed approach exploits distributed information about road connectivity and vehicles distribution to optimize routing decisions. To ensure the packet delivery, D-RCBR defines a new concept of Road Connectivity that provides local topology knowledge and checks if two adjacent intersections delimiting a road segment are actually connected through multi-hop vehicular communication. Then, based on local dissemination strategy, a dynamic routing is performed through the road intersections according to greedy principle. However, since local maximum problems are likely to happen considering only a greedy selection of vertex, D-RCBR defines a recovery procedure inspired from the right hand rule. The simulation results show encouraging performance in comparison to other existing approaches in the literature.