| dc.contributor | 資科系 | |
| dc.creator (作者) | Jang, Hung-chin;Huang, Hsiang-Te | |
| dc.creator (作者) | 張宏慶 | zh_TW |
| dc.date (日期) | 2010 | |
| dc.date.accessioned | 17-六月-2015 15:02:29 (UTC+8) | - |
| dc.date.available | 17-六月-2015 15:02:29 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-六月-2015 15:02:29 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75877 | - |
| dc.description.abstract (摘要) | Packets transmission over VANET is intermittent due to rapid change of network topology. This comes from both high mobility of mobile nodes and limitation of roads. Intermittent transmission causes inefficient packet delivery. Those routing protocols applicable to MANET might not be suitable for VANET. In this paper, we propose a Moving Direction Based Greedy (MDBG) routing algorithm for VANET that is used to enhance routing decision in packet delivery. MDBG algorithm is based on the geographical information collected by GPS. In MDBG, the source vehicle uses "hello message", Destination REQuest (DREQ) and Destination REPly (DREP) messages together with its own moving direction information to establish a stable routing path by selecting appropriate neighbor vehicles. AODV algorithm has been proved to have good performance when both the source vehicle and target vehicle have the same moving direction. MDBG algorithm is proposed to leverage the problem while source vehicle and target vehicle move far apart in opposite directions. Simulation results show that MDBG outperforms both AODV and DSR in packet arrival rate, throughput and average end-to-end delay. | |
| dc.format.extent | 130 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Computer Symposium (ICS), 2010 International pp535 - 540 | |
| dc.title (題名) | Moving Direction Based Greedy routing algorithm for VANET | |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1109/COMPSYM.2010.5685455 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/COMPSYM.2010.5685455 | |
