RSU deployment planning based on approximation algorithm in urban VANET
To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the optimal RSU deployment for area coverage.For c...
I tiakina i:
| Ngā kaituhi matua: | , , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Chinês |
| I whakaputaina: |
Editorial Department of Journal on Communications
2018-01-01
|
| Rangatū: | Tongxin xuebao |
| Ngā marau: | |
| Urunga tuihono: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2018008/ |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|