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...
Sparad:
| Huvudupphov: | , , , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Chinês |
| Utgiven: |
Editorial Department of Journal on Communications
2018-01-01
|
| Serie: | Tongxin xuebao |
| Ämnen: | |
| Länkar: | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2018008 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|