Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks
In vehicular ad hoc networks, maximizing the satisfaction level of multimedia services is a significant issue of concern to users. Relying on the vehicle-to-infrastructure communications, how to schedule the disseminations of multiple vehicles for ensuring high efficiency and guarantee users’ qualit...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2018-10-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147718806717 |
| _version_ | 1797764409884409856 |
|---|---|
| author | Bin Pan Hao Wu |
| author_facet | Bin Pan Hao Wu |
| author_sort | Bin Pan |
| collection | DOAJ |
| description | In vehicular ad hoc networks, maximizing the satisfaction level of multimedia services is a significant issue of concern to users. Relying on the vehicle-to-infrastructure communications, how to schedule the disseminations of multiple vehicles for ensuring high efficiency and guarantee users’ quality of service is difficult and challenging, due to the limited channel resource and vehicle sojourn time. In this article, the scheduling problem of multi-vehicle multimedia dissemination in vehicular ad hoc networks is investigated. A utility model is developed to map the throughput (i.e. the amount of received data) to the user satisfaction level. The scheduling problem is formulated as a utility maximization problem of all the users, which is NP-hard. Then it is transformed into a finite-state decision problem and we obtained an optimal solution by the searching algorithm, which is impractical and can serve as the upper bound. To solve the problem in practice, an online admission control and scheduling algorithm is devised, which guarantees the inflexible data requirements of those admitted vehicles and maximize the total utility. Finally, we implement and conduct extensive simulations on the basis of real video trace to evaluate the performance. Simulation results show that our proposed algorithm has better performance than the state-of-the-art and the conventional algorithms. Thus, it can effectively make scheduling decisions to obtain higher total utility and admission probability. |
| first_indexed | 2024-03-12T19:55:22Z |
| format | Article |
| id | doaj.art-bb906c8b19a643d6bbcad37022e338a9 |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T19:55:22Z |
| publishDate | 2018-10-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-bb906c8b19a643d6bbcad37022e338a92023-08-02T02:50:19ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772018-10-011410.1177/1550147718806717Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networksBin Pan0Hao Wu1Beijing Engineering Research Center of High-Speed Railway Broadband Mobile Communications, Beijing Jiaotong University, Beijing, P.R. ChinaBeijing Key Laboratory of Intelligent Traffic Data Safety and Privacy Protection Technology, Beijing Jiaotong University, Beijing, P.R. ChinaIn vehicular ad hoc networks, maximizing the satisfaction level of multimedia services is a significant issue of concern to users. Relying on the vehicle-to-infrastructure communications, how to schedule the disseminations of multiple vehicles for ensuring high efficiency and guarantee users’ quality of service is difficult and challenging, due to the limited channel resource and vehicle sojourn time. In this article, the scheduling problem of multi-vehicle multimedia dissemination in vehicular ad hoc networks is investigated. A utility model is developed to map the throughput (i.e. the amount of received data) to the user satisfaction level. The scheduling problem is formulated as a utility maximization problem of all the users, which is NP-hard. Then it is transformed into a finite-state decision problem and we obtained an optimal solution by the searching algorithm, which is impractical and can serve as the upper bound. To solve the problem in practice, an online admission control and scheduling algorithm is devised, which guarantees the inflexible data requirements of those admitted vehicles and maximize the total utility. Finally, we implement and conduct extensive simulations on the basis of real video trace to evaluate the performance. Simulation results show that our proposed algorithm has better performance than the state-of-the-art and the conventional algorithms. Thus, it can effectively make scheduling decisions to obtain higher total utility and admission probability.https://doi.org/10.1177/1550147718806717 |
| spellingShingle | Bin Pan Hao Wu Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks International Journal of Distributed Sensor Networks |
| title | Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks |
| title_full | Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks |
| title_fullStr | Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks |
| title_full_unstemmed | Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks |
| title_short | Utility maximization for multi-vehicle multimedia dissemination in vehicular ad hoc networks |
| title_sort | utility maximization for multi vehicle multimedia dissemination in vehicular ad hoc networks |
| url | https://doi.org/10.1177/1550147718806717 |
| work_keys_str_mv | AT binpan utilitymaximizationformultivehiclemultimediadisseminationinvehicularadhocnetworks AT haowu utilitymaximizationformultivehiclemultimediadisseminationinvehicularadhocnetworks |