In recent years, road navigational devices equipped with GPS technologies are becoming more and more popular. These devices can facilitate drivers to guide the way to reach their destinations. In this Thesis, we propose a dynamic route navigational algorithm (DNA) that can be combined with GPS, electronic map system, and wireless technologies (such as DSRC, VANET, 802.11p, WLAN, WiMAX ..., etc.). By calculating metric from road type, road length, average distance, and average speed of each available candidate road, DNA generates road score table and choose the route with the highest score among candidate routes to reach destination. Additionally, in DNA, a Dynamic Block re-Broadcasting (DBB) scheme is designed to carry out Road-Request message (R-REQ) rebroadcast function. The R-REQ rebroadcast function provides two advantages: (i) It can broadcast R-REQ to a specific coverage area with least hop counts; (ii) It can reduce the number of R-REQ broadcast packets significantly. Although DNA takes more processing time than other navigational algorithms, it can greatly reduce the traveling time by determining the best route to destination.
For the purpose of performance evaluation, we develop a simulator by using C++ programming language to compare the performance of DNA with other navigational algorithms. Simulation results have shown that DNA performs much better than other navigational algorithms in reaching destination with shorter travel distance and shorter traveling time.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0911109-011831 |
| Date | 11 September 2009 |
| Creators | Sung, Wei-Cheng |
| Contributors | Tsang-Ling Sheu, Cheng-Shong Wu, Sheau-Ru Tong, Wen-Shyang Hwang, Ce-Kuen Shieh |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911109-011831 |
| Rights | restricted, Copyright information available at source archive |
Page generated in 0.002 seconds