Deployment scheme of RSU based on connection time in VANET
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 maximizing the number of vehicles while ensuring a certain level of connection time under the limited...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2017-04-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017080/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 maximizing 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. |
|---|---|
| ISSN: | 1000-0801 |