Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. Uma
{"title":"具有成本效益的移动和静态道路侧单元部署车辆自组网","authors":"Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. Uma","doi":"10.1109/ICCNC.2016.7440590","DOIUrl":null,"url":null,"abstract":"This paper investigates a new strategy to best deploy road side units so that their spatio-temporal coverage is maximized under a limited budget. For the first time in the literature, we consider three different RSU deployment strategies in a single framework, on static locations, public mobile transportation, and fully controllable vehicles. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem and propose a new polynomial running time approximation algorithm and show its performance ratio is at least the half of the best possible ratio.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Cost effective mobile and static road side unit deployment for vehicular adhoc networks\",\"authors\":\"Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. Uma\",\"doi\":\"10.1109/ICCNC.2016.7440590\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates a new strategy to best deploy road side units so that their spatio-temporal coverage is maximized under a limited budget. For the first time in the literature, we consider three different RSU deployment strategies in a single framework, on static locations, public mobile transportation, and fully controllable vehicles. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem and propose a new polynomial running time approximation algorithm and show its performance ratio is at least the half of the best possible ratio.\",\"PeriodicalId\":308458,\"journal\":{\"name\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2016.7440590\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2016.7440590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cost effective mobile and static road side unit deployment for vehicular adhoc networks
This paper investigates a new strategy to best deploy road side units so that their spatio-temporal coverage is maximized under a limited budget. For the first time in the literature, we consider three different RSU deployment strategies in a single framework, on static locations, public mobile transportation, and fully controllable vehicles. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem and propose a new polynomial running time approximation algorithm and show its performance ratio is at least the half of the best possible ratio.