Responsive image
博碩士論文 etd-0625113-034122 詳細資訊
Title page for etd-0625113-034122
論文名稱
Title
適用於車載環境之機器學習動態路段分群
Using Machine Learning for dynamic sections of clustering in VANET environment
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
67
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2013-06-26
繳交日期
Date of Submission
2013-07-25
關鍵字
Keywords
機器學習、螞蟻演算法、路側單元、傳輸延遲時間、車載網路
Delay Time, Ant Colony Optimization, Machine Learning, Road-side Unit, VANET
統計
Statistics
本論文已被瀏覽 5684 次,被下載 2
The thesis/dissertation has been browsed 5684 times, has been downloaded 2 times.
中文摘要
在車載網路(VANET)環境,無線技術傳輸會受干擾與碰撞之因素,而影響整體的網路服務品質,另外,由於車輛的高移動性使得網路拓樸變動性高,並且傳輸資料時會受限於周遭建築物的阻礙,使得車輛之間的傳輸穩定性受到相當的挑戰,若套用行動隨意網路(MANET)的路由協定並不適用,故我們需設計一套適用車載網路之路由協定來進行資料傳輸。
本論文的情境為車輛與路側單元間之路由協定進行資料傳輸,提出的機制是藉由路側單元(Road-side Unit, RSU)收集道路訊息並維護即時道路資訊。依路側單元的負載(Load)能力、路側單元周遭交通流量和需求車輛至路側單元的傳輸延遲時間(Delay)等透過「機器學習」將道路分群,需求車輛可迅速得知最佳的傳輸路側單元。再加入「螞蟻演算法」(Ant Colony Optimization,ACO)的概念,將需求車輛傳送封包到路側單元的延遲時間,利用費洛蒙機制回饋給機器學習系統,使道路分群符合即時交通狀況。
本實驗由NS-2網路模擬器來分析效能,此方法預測出最佳傳輸路側單元和最佳傳送路徑,能讓整體網路效能更好。模擬結果亦證明此方法在車載網路中具有可行性。
Abstract
Wireless technology will be affected by interference and collision in VANET environment, which will affect network quality of service. Because of the high mobility vehicle makes network topology change quickly, and data transmission will be limited by the surrounding buildings. It is challenge to make transfer data between the vehicle stability. It does not apply to mobile ad hoc networks (MANET) routing protocol, so we need to design a suitable vehicle networks routing protocols for data transfer.
This thesis is between vehicle and the road side unit routing protocols for data transmission. The proposed mechanism uses road side unit (Road-side Unit, RSU) collect road information and maintain real-time road information. The proposed considers road side unit load capabilities, road side units surrounding traffic and propagation delay time, etc. Through the machine learning for the road grouping, vehicle can be quickly known that the best side of the unit. Then add concept of Ant Colony Optimization, the vehicle will need to send packets to the roadside unit delay time, the use of pheromones mechanisms for feedback to machine learning system that allows real-time traffic conditions.
The experiment was conducted by NS-2 network simulator to analyze the performance of this method to predict the optimal transmission roadside units and best transmission path, allowing better overall network performance. The simulation results also show that this method is feasible in VANET.
目次 Table of Contents
第一章 導論 1
1.1簡介 1
1.2研究動機 4
1.3論文架構 5
第二章 相關背景與研究 6
2.1 行動隨意網路與車載網路 6
2.2 專用短距通訊 11
2.3 路由協定介紹 14
2.4 機器學習於無線網路之應用 19
2.5 螞蟻優化演算法於行動隨意網路之應用 21
2.6 車載網路之分群應用 24
第三章 車載網路資料傳輸路由協定 25
3.1條件假設 26
3.2 路由流程 28
3.3經Machine Learning將路段動態分群 31
3.3.1 K-means路段動態分群 33
3.3.2 傳輸延遲預估 36
3.3.3 RSU責任區塊換手(Handover)流程 41
3.4路由協定流程圖 42
第四章 模擬與效能分析 43
4.1 模擬環境與參數設定 43
4.2 評測項目 46
4.3模擬結果與分析 47
第五章 結論 55
參考文獻 56
參考文獻 References
[1] M. Conti and S. Giordano, “Multihop Ad Hoc Networking: The Reality,” IEEE Communications Magazine, Volume 45, Issue 4, Pages 88-95, April 2007.
[2] B. Gallagher,H. Akatsuka, and H. Suzuki, “Wireless communications for vehicle safety: Radio link performance and wireless connectivity method,” Vehicular Technology Magazine, IEEE, Volume 1, Issue 4, Pages 4-24, Dec. 2006.
[3] 曾煜棋、潘孟鉉、林致宇、林政寬,無線網路---通訊協定、感測網路射頻技術與應用服務,初版二刷,碁峰學院,2012年。
[4] IEEE 802.11-04/0121r0, “WAVE Background Information: Wireless Access in Vehicular Environments for the 5.9GHz band,” IEEE 802.11 WAVE Study Group, January 2004.
[5] Fan Li and Yu Wang, “Routing in Vehicular Ad Hoc Networks:A Survey,” Vehicular Technology Magazine, IEEE, Volume 2, Issue 2, Pages 12-22, June 2007.
[6] Y.W. Lin, Y.S. Chen, S.L. Lee, “Routing Protocols in Vehicular Ad Hoc Networks: A Survey and Future Perspectives,” Journal of Information Science and Engineering, 2010.
[7] C. Suthaputchakun and Z. Sun,“Routing Protocol in Intervehicle Communication Systems: A Survey,” IEEE Communications Magazine, 2011.
[8] Yan-Bo Wang, Tin-Yu Wu, Wei-Tsong Lee, and Chih-Heng Ke, “A Novel Geographic Routing Strategy over VANET,” 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops, Perth, WA, 20-23 April 2010.
[9] C.E. Perkins and E.M. Royer, “Ad-hoc on demand distance vector routing,” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, Pages 90–100, Feb. 1999.
[10] D.B. Johnson and D.A. Maltz, “Dynamic source routing in ad hoc wireless networks,” Mobile Computing, Volume 353.
[11] Y-B Wang, T-Y Wu, W-T Lee and C-H Ke,”A Novel Geographic Routing Strategy over VANET,” IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA), 2010.
[12] B. Karp and H.T. Kung, “GPSR: Greedy perimeter stateless routing for wireless networks,” Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 2000.
[13] Kuong-Ho Chen, Chyi-Ren Dow, and Yi-Shiou Lee, “HarpiaGrid: A Reliable Grid-based Routing Protocol for Vehicular Ad Hoc Networks,” Intelligent Transportation Systems, ITSC 2008. 11th International IEEE Conference, Pages 383-388, Oct. 2008.
[14] J. Blum, A. Eskandarian, and L. Hoffman, “Mobility management in IVC networks,” IEEE Intelligent Vehicles Symposium, 2003.
[15] J. B. MacQueen, “Some Methods for classification and Analysis of Multivariate Observations,” Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, No. 3, Pages 281-297, 1967.
[16] J. A. Hartigan and M. A. Wong (1979), “A K-Means Clustering Algorithm,” Applied Statistics, Volume 28, No. 1, Pages 100-108.
[17] M. Sooriyabandara, P. Kulkarni, Lu Li, T. Lewis, T. Farnham and R.J. Haines, “Experiences with Discriminating TCP Loss using K-Means Clustering,” Information and Communication Technology Convergence (ICTC), Pages 352 - 357, Nov. 2010.
[18] L. Matias, J. Gama, J. Mendes-Moreira and J. Freire se Sousa, “Validation of both number and coverage of bus schedules using AVL data,” 13th International IEEE Conference on Intelligent Transportation Systems(ITSC), Pages 131 - 136, Sept. 2010.
[19] Chen Haixia, Du Ronghua, Li Ping and Li Xiaying,“Clustering Application of SVM in Mobile Ad-hoc Network”, International Conference on Intelligent Computation Technology and Automation, 2008.
[20] L.N. Ferreira, A.R. Pinto and Liang Zhao, “QK-Means: A Clustering Technique Based on Community Detection and K-Means for Deployment of Cluster Head Nodes,” Neural Networks (IJCNN), Pages 1 – 7, June 2012.
[21] 螞蟻演算法,http://sls.weco.net/blog/balance9235/15-jun-2007/2075.
[22] Sim, Kwang Mong, Sun and Weng Hong, “Ant colony optimization for routing and load-balancing: Survey and new directions,” IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans, Volume 33, No.5, Pages 560-572,
[23] G. Di Caro, F. Ducatelle, and L. M. Gambardella, ” AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in Mobile Ad Hoc Networks,”September 2004.
[24] S. Misra Sanjay K. Dhurandher, Mohammad S. Obaidat, Pushkar Gupta, Karan Verma and Prayag Narula,“An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks, ” The Journal of Systems and Software 83, Pages 2188–2199 , 2010.
[25] G.S. Abkenar, A. Dana and M. Shokouhifar, “WEIGHTED PROBABILITY ANT-BASED ROUTING (WPAR) IN MOBILE AD HOC NETWORKS,” Electrical and Computer Engineering (CCECE), Pages 826 – 831, 2011.
[26] Tinnirello, I., Bianchi, G.and Yang Xiao, “ Refinements on IEEE 802.11 Distributed Coordination Function Modeling Approaches,” IEEE Transactions on Vehicular Technology, Volume 59, Issue 3, Pages 1055-1067, March 2010.
[27] Byung-Jae Kwak, Nah-Oak Song, L.E. Miller, “Performance analysis of exponential backoff,” IEEE/ACM Transactions on Networking, Volume 13, Issue 2, Pages 343-355, April 2005.
[28] G. Bianchi, “Performance Analysis of the IEEE 802.11 Distributed Coordination Function,” IEEE Journal on Selected Areas in Communications, Volume 18, Issue 3, Pages 535-547, March 2000.
[29] The Network Simulator - ns-2, http://www.isi.edu/nsnam/ns/.
[30] Rapid Generation of Realistic Simulation for VANET, http://lens1.csie.ncku.edu.tw/MOVE/index.htm.
[31] SUMO - Simulation of Urban Mobility, http://sumo.sourceforge.net/.
[32] Wen-Hsing Kuo, Yen-Shien Tung and Shih-Hau Fang, ” A node management scheme for R2V connections inRSU-supported Vehicular Adhoc Networks,” Computing, Networking and Communications (ICNC), San Diego, CA, Pages 768 – 772, 28-31 Jan. 2013.
[33] P. Patil and A. Gokhale, ” Improving the Reliability and Availability of Vehicular Communications Using Voronoi Diagram-Based Placement of Road Side Units,” Reliable Distributed Systems (SRDS), Irvine, CA, Pages 400 – 401, 8-11 Oct. 2012.
[34] M. Prabhakar , J.N. Singh and G. Mahadevan, ” Defensive mechanism for VANET security in game theoretic approach using heuristic based ant colony optimization,” Computer Communication and Informatics (ICCCI), Coimbatore, Pages 1-7, 4-6 Jan. 2013.
[35] Yuwei Xu, Ying Wu, Gongyi Wu, Jingdong Xu, Boxing Liu and Lin Sun, “Data Collection for the Detection of Urban Traffic Congestion By VANETs,” Services Computing Conference (APSCC), Hangzhou, Pages 405 – 410, 6-10 Dec. 2010.
[36] Lin Sun, Ying Wu, Jingdong Xu , Yuwei Xu, “An RSU-assisted Cluster Head Selection and Backup Protocol,” International Conference on Advanced Information Networking and Applications Workshops (WAINA), Pages 581-587, March 2012.
[37] Jie Luo, Xinxing Gu , Tong Zhao, Wei Yan, “MI-VANET: A New Mobile Infrastructure Based VANET Architecture for Urban Environment”, IEEE Vehicular Technology Conference Fall, Pages 1-5, Sept. 2010.
[38] M.S. Almalag and M.C. Weigle, “Using traffic flow for cluster formation in vehicular ad-hoc networks,” IEEE 35th Conference on Local Computer Networks (LCN), Pages 631-636, Oct. 2010.
[39] Y. Ohta, T. Ohta and Y. Kakuda, “An autonomous clustering-based data transfer scheme using positions and moving direction of vehicles for VANETs,” IEEE Wireless Communications and Networking Conference (WCNC), Pages 2900-2904, April 2012.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 3.145.115.195
論文開放下載的時間是 校外不公開

Your IP address is 3.145.115.195
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code