1 / 16

VANET SURVEY PAPER

VANET SURVEY PAPER. 指導教授：吳世琳 學生：周哲宇 學號： M9729023. 參考文獻. ZGRP Zone-based Greedy Perimeter Stateless Routing for VANET Shimin Sun; Jonghyun Kim; Yunho Jung; Keecheon Kim; Information Networking, 2009. ICOIN 2009. International Conference on 21-24 Jan. 2009 Page(s):1 - 3 GyTAR

francesca-key
Download Presentation

VANET SURVEY PAPER

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. VANETSURVEYPAPER 指導教授：吳世琳 學生：周哲宇 學號：M9729023

  2. 參考文獻 • ZGRP • Zone-based Greedy Perimeter Stateless Routing for VANET Shimin Sun; Jonghyun Kim; Yunho Jung; Keecheon Kim;Information Networking, 2009. ICOIN 2009. International Conference on21-24 Jan. 2009 Page(s):1 - 3 • GyTAR • GyTAR: improved greedy traffic aware routing protocol for vehicular ad hoc networks in city environments Moez Jerbi Rabah Meraihi Sidi-Mohammed Senouci ?Yacine Ghamri-Doudane 2006International Conference on Mobile Computing and Networking Proceedings of the 3rd international workshop on Vehicular ad hoc networks • LAR • Location-aided routing (LAR) in mobile ad hoc networks Young-Bae Ko and Nitin H. Vaidya Wireless Networks 6 (2000) 307–321

  3. 介紹 • 在 VANET中車輛之間快速移動，我們可以利用一些行動裝置(RoadSideUnit)來收集並且提供訊息 收集路況資訊，如車速、方向、座標、時間

  4. 問題 • 我們知道使用者座標也知道他要到達哪裡，可以透過一些技術得知路況 • 求得：想要從眾多的道路當中選擇省時且合適的道路

  5. ZGRP • 提出修改 Zone Routing Protocol 以Greedy Perimeter StatelessRouting (GPSR) 來提供更有效率的routing protocol 在一個有限的區域比較容易藉著週期性的更新鄰居訊息來維持routinginformation 以周圍節點做GATEWAY 避免訊息氾濫

  6. 方法 • 計算每一個邊界nodei 的角度，選擇最小的來當作下一個傳遞點 ，來找尋目的地 沒有針對做路況考慮

  7. GyTAR • 改良ASTAR的演算法，使用Greedy的方式

  8. B-GYTAR 為原始 GYTAR 代表找不到人傳的封包，會再次計算而非把封包丟棄

  9. LAR • 運用一些已知資訊來設定flooding尋找的區域 設定區域沒有足夠node

  10. Scheme 1

  11. Scheme 2 不能接收到I，但可接收到S

  12. α因素 0.8~1.2 比較好

  13. β因素 影響不太

  14. 結論 • ZGRP 依據角度來選擇，沒有考慮到真實路況 • GyTAR改良ASTAR的演算法，但使用Greedy的方式，當導航點離目的地很遠時，只使用距離的估算不能反映真實路況 • LAR當導航點離目的地很遠時，flooding 影響也會隨之擴大 • 使用A*應該要等待目的地所回傳的路徑，

More Related