.png){kind=icon}
.png){kind=icon}
Return
An evolutionary algorithm for roadside unit deployment with betweenness centrality preprocessing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2018.03.051.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a genetic algorithm strategy to improve the deployment of roadside units in VANETs. We model the problem as a Maximum Coverage with Time Threshold Problem and the network as a graph, and perform a preprocessing based on the betweenness centrality measure. Moreover, we show that by using a simple genetic algorithm with few interactions, we achieve better results when compared with other strategies. We consider five realistic datasets to evaluate our approach and the experiments show that it finds better results in all scenarios, mainly when compared with the greedy-based approach, which increased up to 20% of the vehicle coverage in specific scenarios. Additionally, the betweenness centrality preprocessing helps the solution convergence by selecting candidate intersections, which suggests that this preprocessing is a good measure to explore in these scenarios. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Vehicular networks
Roadside unit deployment
Betweenness centrality
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
