Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks
The placement of roadside units (RSUs) is a difficult and yet important issue in vehicular networks. If too few RSUs are placed, the system performance would be very poor. However, with too many RSUs, it would incur high installation cost and maintenance cost of these RSUs. In this paper, we study t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-04-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/937673 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850177407556780032 |
|---|---|
| author | Peng Li Chuanhe Huang Qin Liu |
| author_facet | Peng Li Chuanhe Huang Qin Liu |
| author_sort | Peng Li |
| collection | DOAJ |
| description | The placement of roadside units (RSUs) is a difficult and yet important issue in vehicular networks. If too few RSUs are placed, the system performance would be very poor. However, with too many RSUs, it would incur high installation cost and maintenance cost of these RSUs. In this paper, we study the problem of delay bounded roadside unit placement (DRP) in vehicular networks. For a given delay bound, our objective is to place the minimal number of RSUs in the system such that a message from any of RSUs in the region can be disseminated to all vehicles within the given delay bound. We consider two cases of RSUs, the case that all RSUs are interconnected through wired lines (called DRP-L problem) and the case that RSUs connect to other RSUs through wireless link (called DRP-W problem). We first prove that both DRP-L and DRP-W problems are NP-hard. Then, we propose several heuristic algorithms to solve DRP-L and DRP-W problems, respectively. Extensive simulations have been conducted to show that the performance of our proposed methods is superior to the other methods. |
| format | Article |
| id | doaj-art-bf2fc941f8c2431183b58397d22eabaf |
| institution | OA Journals |
| issn | 1550-1477 |
| language | English |
| publishDate | 2015-04-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-bf2fc941f8c2431183b58397d22eabaf2025-08-20T02:18:58ZengWileyInternational Journal of Distributed Sensor Networks1550-14772015-04-011110.1155/2015/937673937673Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc NetworksPeng Li0Chuanhe Huang1Qin Liu2 College of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan 430081, China Computer School, Wuhan University, Wuhan 430072, China Computer School, Wuhan University, Wuhan 430072, ChinaThe placement of roadside units (RSUs) is a difficult and yet important issue in vehicular networks. If too few RSUs are placed, the system performance would be very poor. However, with too many RSUs, it would incur high installation cost and maintenance cost of these RSUs. In this paper, we study the problem of delay bounded roadside unit placement (DRP) in vehicular networks. For a given delay bound, our objective is to place the minimal number of RSUs in the system such that a message from any of RSUs in the region can be disseminated to all vehicles within the given delay bound. We consider two cases of RSUs, the case that all RSUs are interconnected through wired lines (called DRP-L problem) and the case that RSUs connect to other RSUs through wireless link (called DRP-W problem). We first prove that both DRP-L and DRP-W problems are NP-hard. Then, we propose several heuristic algorithms to solve DRP-L and DRP-W problems, respectively. Extensive simulations have been conducted to show that the performance of our proposed methods is superior to the other methods.https://doi.org/10.1155/2015/937673 |
| spellingShingle | Peng Li Chuanhe Huang Qin Liu Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks International Journal of Distributed Sensor Networks |
| title | Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks |
| title_full | Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks |
| title_fullStr | Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks |
| title_full_unstemmed | Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks |
| title_short | Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks |
| title_sort | delay bounded roadside unit placement in vehicular ad hoc networks |
| url | https://doi.org/10.1155/2015/937673 |
| work_keys_str_mv | AT pengli delayboundedroadsideunitplacementinvehicularadhocnetworks AT chuanhehuang delayboundedroadsideunitplacementinvehicularadhocnetworks AT qinliu delayboundedroadsideunitplacementinvehicularadhocnetworks |