A centrality-based RSU deployment approach for vehicular ad hoc networks

This paper studies the RSU deployment problem in a 2-D urban or suburban road scenario of a vehicular ad hoc network (VANET). To optimize RSU deployment, we introduce the notion of centrality in a social network to RSU deployment, and use it to measure the importance of an RSU position candidate in RSU deployment. Based on the notion of centrality, we propose a centrality-based RSU deployment approach and formulate the RSU deployment problem as a linear programming problem with the objective to maximize the total centrality of all position candidates selected for RSU deployment under the constraint of a given deployment budget. To solve the formulated problem, we analogize the problem to a 0-1 Knapsack problem and thus employ a 0-1 Knapsack algorithm to solve the problem. In the analogy, the budget in the RSU deployment problem is analogous to the bag's capacity in the Knapsack problem, the cost of deploying an RSU is analogous to an item's weight, and the centrality of a position candidate is analogous to an item's value. Simulation results show that the proposed centrality-based deployment approach can effectively improve the efficiency of the RSU deployment in terms of the coverage time ratio as compared to a random deployment approach.