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!
|
_version_ | 1841530149207539712 |
---|---|
author | Zhengchao DING Zhenchun WEI Lin FENG |
author_facet | Zhengchao DING Zhenchun WEI Lin FENG |
author_sort | Zhengchao DING |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-908a13a90f6e4a68a8020651648ba624 |
institution | Kabale University |
issn | 1000-0801 |
language | zho |
publishDate | 2017-04-01 |
publisher | Beijing Xintong Media Co., Ltd |
record_format | Article |
series | Dianxin kexue |
spelling | doaj-art-908a13a90f6e4a68a8020651648ba6242025-01-15T03:13:06ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012017-04-0133879359602854Deployment scheme of RSU based on connection time in VANETZhengchao DINGZhenchun WEILin FENGFor 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.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017080/vehicular Ad Hoc networkroadside unit placementconnection timeBPSO algorithm |
spellingShingle | Zhengchao DING Zhenchun WEI Lin FENG Deployment scheme of RSU based on connection time in VANET Dianxin kexue vehicular Ad Hoc network roadside unit placement connection time BPSO algorithm |
title | Deployment scheme of RSU based on connection time in VANET |
title_full | Deployment scheme of RSU based on connection time in VANET |
title_fullStr | Deployment scheme of RSU based on connection time in VANET |
title_full_unstemmed | Deployment scheme of RSU based on connection time in VANET |
title_short | Deployment scheme of RSU based on connection time in VANET |
title_sort | deployment scheme of rsu based on connection time in vanet |
topic | vehicular Ad Hoc network roadside unit placement connection time BPSO algorithm |
url | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017080/ |
work_keys_str_mv | AT zhengchaoding deploymentschemeofrsubasedonconnectiontimeinvanet AT zhenchunwei deploymentschemeofrsubasedonconnectiontimeinvanet AT linfeng deploymentschemeofrsubasedonconnectiontimeinvanet |