Name
Abstract | ||
|---|---|---|
In order to transfer an alert message from the accident site to the control center as soon as possible, the Roadside Units (RSUs) act as the most important roles in vehicular ad hoc networks (VANETs). However, we always hope to deploy minimum number of RSUs because of the low market penetration of VANET-enabled vehicles and the deployment cost of RSUs. In this paper, the optimal RSUs deployment problem is formulated as a set cover problem. We propose a heuristic greedy algorithm such that the number of RSUs is minimum. Meantime, alert messages would be propagated to RSUs within a time constraint, whenever an accident happens in anywhere of a road. Simulation results show that the scheme is efficient and the time complexity is better than those existing algorithms. © Springer International Publishing Switzerland |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-11538-2_22 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
Delay,RSUs deployment,VANETS | Data mining,Set cover problem,Heuristic,Software deployment,Computer science,Computer network,Greedy algorithm,Wireless ad hoc network,Time complexity,Time constraint,Vehicular ad hoc network | Conference |
Volume | ISSN | ISBN |
8597 | 03029743 | 9783319115375 |
Citations | PageRank | References |
2 | 0.38 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liu Chunyan | 1 | 17 | 4.16 |
| Huang Hejiao | 2 | 66 | 15.07 |
| Du Hongwei | 3 | 8 | 1.52 |
| Xiaohua Jia | 4 | 4609 | 303.30 |