RSUs placement using overlap based greedy method for urban and rural roads

Ramy Rizk, R. Daher, Ahmed Makkawi
{"title":"RSUs placement using overlap based greedy method for urban and rural roads","authors":"Ramy Rizk, R. Daher, Ahmed Makkawi","doi":"10.1109/NETS4CARSFALL.2014.7000905","DOIUrl":null,"url":null,"abstract":"The deployment of efficient roadside networks is a necessity for ITS deployment. The main challenge for the roadside deployment is to find a satisfying or best distribution of RSUs on the roads network according to the given conditions in order to meet the requested requirements of the roads operator. Additionally, various factors affect this process such as traffic, infrastructure and topological characteristics of the roads. This paper introduces an Overlap based Greedy Method (OGM) as a basis for RSUs placement and can be applied on urban and rural roads. This method in its current development mainly considers the RSU coverage radius and the overlap rate into the RSUs distribution process. Moreover, a wide range of influencing factors is considered through the prioritization of Sites of Interest (SoIs). The OGM method is developed within the recently started PRONET project and is integrated into its software platform. The tests conducted on selected roads environment in the city of Rostock (Germany) ensure: (1) decrease in number of chosen SoIs for placement compared to the original scanned number of SoIs, and (2) full (continuous) coverage cannot be guaranteed for a roads network using only the available junctions.","PeriodicalId":436235,"journal":{"name":"2014 7th International Workshop on Communication Technologies for Vehicles (Nets4Cars-Fall)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 7th International Workshop on Communication Technologies for Vehicles (Nets4Cars-Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETS4CARSFALL.2014.7000905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

The deployment of efficient roadside networks is a necessity for ITS deployment. The main challenge for the roadside deployment is to find a satisfying or best distribution of RSUs on the roads network according to the given conditions in order to meet the requested requirements of the roads operator. Additionally, various factors affect this process such as traffic, infrastructure and topological characteristics of the roads. This paper introduces an Overlap based Greedy Method (OGM) as a basis for RSUs placement and can be applied on urban and rural roads. This method in its current development mainly considers the RSU coverage radius and the overlap rate into the RSUs distribution process. Moreover, a wide range of influencing factors is considered through the prioritization of Sites of Interest (SoIs). The OGM method is developed within the recently started PRONET project and is integrated into its software platform. The tests conducted on selected roads environment in the city of Rostock (Germany) ensure: (1) decrease in number of chosen SoIs for placement compared to the original scanned number of SoIs, and (2) full (continuous) coverage cannot be guaranteed for a roads network using only the available junctions.
基于重叠贪心法的城乡道路rsu定位
部署高效的路边网络是部署智能交通系统的必要条件。路边部署的主要挑战是根据给定的条件在道路网络上找到令人满意的或最佳的rsu分布,以满足道路运营商的要求。此外,影响这一过程的因素还有交通、基础设施和道路的拓扑特征等。本文提出了一种基于重叠的贪心方法(OGM),作为rsu定位的基础,可应用于城乡道路。该方法在目前的发展中主要将RSU的覆盖半径和重叠率考虑到RSU的分布过程中。此外,通过对感兴趣的地点(SoIs)进行优先排序,考虑了广泛的影响因素。OGM方法是在最近开始的PRONET项目中开发的,并集成到其软件平台中。在罗斯托克市(德国)选定的道路环境中进行的测试确保:(1)与原始扫描的soi数量相比,选择的soi数量减少了,(2)仅使用可用的路口无法保证道路网络的完全(连续)覆盖。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信