车载自组织网络中基于连接时长的RSU部署方案

发布时间：2018-06-24 01:42

本文选题：车载自组织网络 + 路边基础设施部署　；参考：《电信科学》2017年04期

【摘要】：针对目前城市场景下车载自组织网络中的RSU部署问题,提出了一种基于连接时长的RSU部署方案。该方案在RSU数量受限的情况下,以保证通信连接时长为前提,以最大化服务车辆数目为目的,将部署问题建模成最大覆盖问题,设计了二进制粒子群算法进行求解,并结合真实的北京市路网地图和出租车GPS数据进行仿真实验。仿真结果表明,该算法是收敛、稳定及可行的,相比贪心算法,该算法求得的部署方案能为更多的车辆提供持续性的网络服务。
[Abstract]:Aiming at the problem of RSU deployment in vehicle-borne ad hoc networks in urban scenarios, a scheme of RSU deployment based on the length of connection time is proposed. In the case of limited RSU number, with the premise of ensuring the length of communication connection and maximizing the number of vehicles served, the deployment problem is modeled as a maximum coverage problem, and a binary particle swarm optimization algorithm is designed to solve the problem. Combined with real map of Beijing road network and GPS data of taxi, the simulation experiment is carried out. Simulation results show that the proposed algorithm is convergent, stable and feasible. Compared with greedy algorithm, the proposed deployment scheme can provide continuous network services for more vehicles.
【作者单位】：合肥工业大学计算机与信息学院;安全关键工业测控技术教育部工程研究中心;
【基金】：国家自然科学基金资助项目(No.61502142) 国家国际科技合作专项基金资助项目(No.2014DFB10060)~~
【分类号】：TN929.5;U495

【相似文献】