Optimal road side units placement model based on binary integer programming for efficient traffic information advertisement and discovery in vehicular environment

Road side units (RSUs) are considered to be one of the most important components in vehicular networks to send and receive data from other components inside the networks. Regarding the fact that vehicular network performance and vehicular environment coverage are highly related, the maximum coverage...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET intelligent transport systems Ročník 9; číslo 9; s. 851 - 861
Hlavní autoři: Balouchzahi, Nik Mohammad, Fathy, Mahmood, Akbari, Ahmad
Médium: Journal Article
Jazyk:angličtina
Vydáno: The Institution of Engineering and Technology 01.11.2015
Témata:
binary integer programming
Computational efficiency
Computing time
Costs
Integer programming
Networks
objective function
optimal road side unit placement model
optimal RSU placement
optimisation constraints
Optimization
Placement
Roads
traffic information advertisement
traffic information systems
vehicular ad hoc networks
vehicular environment coverage
vehicular networks
vehicular ad hoc networks
optimal RSU placement
traffic information systems
integer programming
optimal road side unit placement model
binary integer programming
optimisation constraints
vehicular networks
traffic information advertisement
objective function
vehicular environment coverage
ISSN:1751-956X, 1751-9578
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Road side units (RSUs) are considered to be one of the most important components in vehicular networks to send and receive data from other components inside the networks. Regarding the fact that vehicular network performance and vehicular environment coverage are highly related, the maximum coverage via RSUs improves the efficiency of vehicular networks. However, because of high costs of RSU placement, it would be impossible to have full coverage through RSUs. Hence, it would be necessary to optimally install a limited number of RSUs in the most appropriate locations. In this article, the problem of RSU placement is formulated to binary integer programming. The objective of the present study is to find locations which have higher impacts on efficiency of vehicular networks. The objective function is minimising the costs of RSU placement. Moreover, coverage of the most important locations by RSUs has been applied in the form of optimization constraints. The performance of the given mechanism has been assessed by real traces. Simulation results indicate that the method is able to find optimal locations of RSUs in highway and urban environments. Furthermore, the results show that by optimal RSU placement inside the environment, the performance of vehicular network is improved.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-956X
1751-9578
DOI:10.1049/iet-its.2014.0051