Abstract
The Vehicular Ad Hoc Network (simply referred to as VANET) attracts lots of attention. Numerous absorbing applications of vehicular networks have been researched ranging from safety warning, intelligent navigation to mobile infotainment. This paper proposes an information dissemination scheme for urban VANET with high vehicle density and multiple hotspots. Our purpose is to obtain valid routing as well as to save the network resources as far as possible by introducing the concept of the Steiner tree problem. Simulations are conducted with NS-2.35 and MOVE. The simulation results show that our scheme performs better than RTDF scheme in the performance of packet delivery delay.
Original language | English |
---|---|
Title of host publication | 2013 Joint Conference of International Conference on Computational Problem-Solving and International High Speed Intelligent Communication Forum, ICCP and HSIC 2013 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 113-117 |
Number of pages | 5 |
ISBN (Electronic) | 9781479921508 |
DOIs | |
State | Published - 2013 |
Event | 2013 Joint Conference of International Conference on Computational Problem-Solving and International High Speed Intelligent Communication Forum, ICCP and HSIC 2013 - Jiuzhai, China Duration: 26 10 2013 → 28 10 2013 |
Publication series
Name | 2013 Joint Conference of International Conference on Computational Problem-Solving and International High Speed Intelligent Communication Forum, ICCP and HSIC 2013 |
---|
Conference
Conference | 2013 Joint Conference of International Conference on Computational Problem-Solving and International High Speed Intelligent Communication Forum, ICCP and HSIC 2013 |
---|---|
Country/Territory | China |
City | Jiuzhai |
Period | 26/10/13 → 28/10/13 |
Bibliographical note
Publisher Copyright:© 2013 IEEE.
Keywords
- Hotspot
- Steiner tree problem
- VANET
- information dissemination
- shortest path tree