车载自组织网络中基于连接时长的RSU部署方案
针对目前城市场景下车载自组织网络中的RSU部署问题,提出了一种基于连接时长的RSU部署方案。该方案在RSU数量受限的情况下,以保证通信连接时长为前提,以最大化服务车辆数目为目的,将部署问题建模成最大覆盖问题,设计了二进制粒子群算法进行求解,并结合真实的北京市路网地图和出租车GPS数据进行仿真实验。仿真结果表明,该算法是收敛、稳定及可行的,相比贪心算法,该算法求得的部署方案能为更多的车辆提供持续性的网络服务。...
Saved in:
| Published in | 电信科学 Vol. 33; no. 4; pp. 87 - 93 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
中国通信学会
01.04.2017
人民邮电出版社有限公司 安全关键工业测控技术教育部工程研究中心,安徽合肥230009 合肥工业大学计算机与信息学院,安徽合肥,230009%合肥工业大学计算机与信息学院,安徽合肥230009 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1000-0801 |
| DOI | 10.11959/j.issn.1000-0801.2017080 |
Cover
| Summary: | 针对目前城市场景下车载自组织网络中的RSU部署问题,提出了一种基于连接时长的RSU部署方案。该方案在RSU数量受限的情况下,以保证通信连接时长为前提,以最大化服务车辆数目为目的,将部署问题建模成最大覆盖问题,设计了二进制粒子群算法进行求解,并结合真实的北京市路网地图和出租车GPS数据进行仿真实验。仿真结果表明,该算法是收敛、稳定及可行的,相比贪心算法,该算法求得的部署方案能为更多的车辆提供持续性的网络服务。 |
|---|---|
| Bibliography: | For the roadside unit （RSU） placement problem in vehicular Ad Hoc network （VANET）, the deployment scheme of RSU based on connection time was proposed. The scheme find the optimal positions of RSU for maxi- mizing the number of vehicles while ensuring a certain level of connection time under the limited number of RSU. The problem was modeled as a maximum coverage problem, and a binary particle swarm algorithm was designed to solve it. The simulation experiment was carried out with the real Beijing road network map and taxi GPS data. The simulation results show that the algorithm is convergent, stable and feasible. Compared with the greedy algorithm, the proposed scheme can provide continuous network service for more vehicles. vehicular Ad Hoc network, roadside unit placement, connection time, BPSO algorithm 11-2103/TN DING Zhengchao1, WEI Zhenchun1,2, FENG Lin1（ 1. School of Computer and Information, Hefei University of Technology, Hefei 230009, China 2. Engineering Research Center of Safety Critical Industry Mea |
| ISSN: | 1000-0801 |
| DOI: | 10.11959/j.issn.1000-0801.2017080 |