通信学报2018，Vol.39Issue(1)：78-89,12.DOI:10.11959/j.issn.1000-436x.2018008
城市环境车联网中基于近似算法的RSU部署方案
RSU deployment planning based on approximation algorithm in urban VANET
摘要
Abstract
To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the optimal RSU deployment for area coverage.For complex urban environments,a Cue model (complex urban environments model) was proposed.In this model,the target area was divided into different partitions.Then,based on shifting strategy,a polynomial time approximation scheme was designed.Theoretical analysis that include the approximation ratio and time complexity of the proposed algorithm were also presented.Simulation results show that GBP can efficiently solve the coverage problem in urban VANET.关键词
车联网/RSU部署/区域覆盖/近似算法Key words
VANET/RSU deployment/covering problem/approximation algorithm分类
信息技术与安全科学引用本文复制引用
朱钧宇,黄传河,范茜莹,覃匡宇,付斌..城市环境车联网中基于近似算法的RSU部署方案[J].通信学报,2018,39(1):78-89,12.基金项目
国家自然科学基金资助项目(No.61772385,No.61373040,No.61572370) （No.61772385,No.61373040,No.61572370）
美国国家科学基金会基金资助项目(No.0845376)The National Natural Science Foundation of China (No.61772385,No.61373040,No.61572370),The National Science Foundation Early Career Award of USA (No.0845376) （No.0845376）
