RSU deployment planning based on approximation algorithm in urban VANET

RSU deployment planning based on approximation algorithm in urban VANET

Show other versions (1)

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 c...

Full description

Bibliographic Details
Main Authors: Junyu ZHU, Chuanhe HUANG, Xiying FAN, Kuangyu QIN, Bin FU
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2018-01-01
Series:Tongxin xuebao
Subjects:
VANET
RSU deployment
covering problem
approximation algorithm
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018008/

Internet

http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018008/

Similar Items