博碩士論文 100523053 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:6 、訪客IP:18.206.187.81
姓名 王秀萍(Hsiu-Ping Wang)  查詢紙本館藏   畢業系所 通訊工程學系
論文名稱 適用於交叉路口環境之車輛叢集方法
(An Efficient Clustering Scheme at Crossroads in Vehicular Network Environments)
相關論文
★ 非結構同儕網路上以特徵相似度為基準之搜尋方法★ 以階層式叢集聲譽為基礎之行動同儕網路拓撲架構
★ 線上RSS新聞資料流中主題性事件監測機制之設計與實作★ 耐延遲網路下具密度感知的路由方法
★ 整合P2P與UPnP內容分享服務之家用多媒體閘道器:設計與實作★ 家庭網路下簡易無縫式串流影音播放服務之設計與實作
★ 耐延遲網路下訊息傳遞時間分析與高效能路由演算法設計★ BitTorrent P2P 檔案系統下載端網路資源之可調式配置方法與效能實測
★ 耐延遲網路中利用訊息編碼重組條件之資料傳播機制★ 耐延遲網路中基於人類移動模式之路由機制
★ 車載網路中以資料匯集技術改善傳輸效能之封包傳送機制★ 車載網路下結合路側單元輔助之訊息廣播機制
★ 耐延遲網路下以靜態中繼節點(暫存盒)最佳化訊息傳遞效能之研究★ 耐延遲網路下以動態叢集感知建構之訊息傳遞機制
★ 跨裝置影音匯流平台之設計與實作★ 耐延遲網路下基於封包複製模式的路由機制之模擬及效能比較
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 節點叢集化是一套古典的網路節點管理方式,藉由將節點叢集的方式可以幫助凌亂複雜的網路結構形成一套階層化的管理架構。在叢集架構中傳輸訊息時,可藉由位於階層頂端的叢集管理節點快速的將欲傳輸訊息散播出去,達到有效的網路訊息傳輸,本研究內容即是提出一套適合用於車載網路(VANET)交叉路口環境的叢集化方法。由於車載網路中的節點移動速率較一般無線網路存在的節點(例如:手持裝置、筆電)快速,且於真實道路環境通常具有交叉路口拓樸,並且存在利用紅綠燈去控制整體環境中車輛流動的特性,而以往在車載網路上的節點叢集方法其環境大部分位於高速公路長直道路之上,故本研究的主要考量在於需引入哪一些額外的環境已知訊息去代替原先固有的節點叢集方法,促使其符合交叉路口所具有的節點移動特性,並讓形成的叢集架構在經過移動之後不致於太快遠離其所屬叢集管理節點或是控管成員節點的傳輸範圍之外,加強叢集內節點之間的連線穩定性。研究最後將透過模擬驗證其穩定性指標,進一步證明此節點叢集方法之效能以及不同參數對於此方法之影響。
摘要(英) Using clustering technologies to manage nodes in a network is a classical and conventional approach. Node clustering is capable of arranging a network into a hierarchical structure that is tractable upon the requirements of management and maintenance of nodes in dynamic networks, where messages can be broadcast rapidly and efficiently by cluster-head nodes at the top of the hierarchy. The research in this thesis proposed an efficient clustering scheme at crossroads in vehicular ad-hoc network environments. Since nodes in vehicular networks have higher motion speed than those in traditional mobile ad-hoc networks. In addition, node movements in vehicular networks are affected by crossroads as well as traffic lights in real road environments. Thus, the main goal of this clustering scheme is to understand which well-known information of vehicular environments can help vehicular nodes to do clustering in a cost-effective manner corresponding to the surrounding of a crossroads. So that, vehicular nodes can form in a number of stable clusters that are not volatile and dismissed without frequently changes of cluster nodes. Finally, the simulation is employed to inspect the stability and robustness of the proposed scheme. Simulation results show that this scheme is able to avoid futile clustering around a crossroad with traffic lights, thereby reduce the cost of cluster organization in vehicular network environments.
關鍵字(中) ★ 車載網路
★ 節點叢集化
★ 真實道路環境
★ 都普勒
關鍵字(英)
論文目次 第一章 簡介 p.1
第二章 相關文獻與探討 p.4
2.1 選擇叢集管理節點的方法 p.4
2.1.1 Utility Metric with Self-Knowledge of Node p.4
2.1.2 Utility Metric with Self-Knowledge of Node and Well-Known Theorem p.7
2.1.3 Node Clustering with Street-Based Topology p.8
2.2維持叢集的方法 p.10
2.3結論 p.12
第三章 環境特性分析 p.13
3.1分析車輛行駛方向與叢集重組之關係 p.13
3.2分析交叉路口紅燈群聚與綠燈分群現象 p.14
第四章 適應交叉路口之車輛叢集方法 p.16
4.1方法設計摘要 p.16
4.2前提與假設 p.17
4.3環境適應對策 p.18
4.3.1訊息偵測 p.18
4.3.2紅綠燈 p.19
4.3.3車輛節點 p.20
4.4叢集管理節點選擇機制 p.21
第五章 模擬與數據分析 p.24
5.1環境描述 p.24
5.2單一交叉路口之重組次數比較 p.24
5.3被阻擋訊息通知範圍對於叢集方法的影響 p.25
5.4權重值計算時間對於叢集方法的影響 p.26
第六章 結論及未來研究工作 p.30
參考文獻 p.31
參考文獻 [1] Peng Fan, James Haran, John Dillenburg, and Peter Nelson, “Cluster-Based Framework in Vehicular Ad-Hoc Networks,” Lecture Notes in Computer Science, vol. 3738, pp. 32-42, 2005.
[2] Evandro Souza, Ioanis Nikolaidis, and Pawel Gburzynski, “A New Aggregate Local Mobility Clustering Algorithm for VANETs,” Proc. IEEE International Conference on Communications (ICC), pp. 1-5, 2010.
[3] Prithwish Basu, Naved Khan, and Thomas D. C. Little, “A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks,” Proc. International Conference Distributed Computing Systems Workshops, pp. 413-418, 2001.
[4] Slawomir Kuklinski, and Grzegorz, “Density Based Clustering Algorithm for VANETs, “ Testbeds and Research Infrastructures for the Development of Networks and Communities Workshops, vol. 19, pp. 1-6, 2009.
[5] Leandros A. Maglaras, Dimitrios Katsaros, “Distributed Clustering in Vehicular Networks,” Proc. Second International Workshop on Vehicular Communications and Networking in conjunction with IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp. 593-599, 2012.
[6] Stefano Basagni, “Distributed Clustering for Ad Hoc Networks,” Proc. International Symposium Parallel Architectures, Algorithms, and Networks (I-SPAN), PP. 310-315, 1999.
[7] Zhigang Wang, Lichuan Liu, MengChu Zhou, and Nirwan Ansari, “A Position-Based Clustering Technique for Ad Hoc Intervehicle Communication,” IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews, vol. 38, pp. 201-208, 2008.
[8] Yu-Xuan Wang, and Forrest Sheng Bao, “An Entropy-Based Weighted Clustering Algorithm and Its Optimization for Ad Hoc Networks,” Proc. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp. 56, 2007.
[9] Michel Daoud Yacoub, Fundamentals of Mobile Radio Engineering, CRC-Press, 1993.
[10] Nitin Maslekar, Mounir Boussedjra, Joseph Mouzna, and Houda Labiod, “C-DRIVE: Clustering Based on Direction in Vehicular Environment,” Proc. New Technologies, Mobility and Security (NTMS), pp. 1-5, 2011.
[11] Nitin Maslekar, Joseph Mouzna, Mounir Boussedjra, and Houda Labiod, “CATS: An Adaptive Traffic Signal System Based on Car-to-Car Communication,” Journal of Network and Computer Applications, vol.36, pp. 1-8, 2012.
[12] Yvonne Gunter, Bernhard Wiegel, and Hans Peter Grossmann, “Cluster-Based Medium Access Scheme for VANETs,” Proc. IEEE Intelligent Transportation Systems Conference, pp. 343-348, 2007.
[13] Christine Shea, Behnam Hassanabadi, and Shahrokh Valaee, “Mobility-Based Clustering in VANETs Using Affinity Propagation,” Proc. IEEE Global Telecommunications Conference (GLOBECOM), pp. 1-6, 2009.
[14] Nitin Maslekar, Joseph Mouzna, Houda Labiod, Manoj Devisetty, and Manohara Pai, “Modified C-DRIVE: Clustering Based on Direction in Vehicular Environment,” Proc. IEEE Intelligent Vehicles Symposium (IV), pp. 845-850, 2011.
[15] Grzegorz Wolny, “Modified DMAC Clustering Algorithm for VANETs,” Proc. International Conference on ystems and Networks Communications (ICSNC), pp. 268-273, 2008.
[16] Peng Fan, Prasad Sistla, and Peter Nelson, “Theoretical Analysis of a Directional Stability-Based Clustering Algorithm for VANETs,” Proc. ACM International Workshop on VehiculAr Inter-NETworking, pp. 80-81, 2008.
[17] Mohammad S. Almalag, and Michele C. Weigle, “Using Traffic Flow for Cluster Formation in Vehicular Ad-hoc Networks,” Proc. IEEE Local Computer Networks (LCN), pp. 631-636, 2010.
[18] Ameneh Daeinabi, Akbar Ghaffar Pour Rahbar, and Ahmad Khademzadeh, “VWCA: An Efficient Clustering Algorithm in Vehicular Ad Hoc Networks,” Journal of Network and Computer Applications, vol. 34, pp. 207-222, 2011.
[19] Mainak Chatterjee, Sajal K. Das, and Damla Turgut, “WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks,” Cluster Computing, vol. 5, pp. 193-204, 2002.
[20] Ehssan Sakhaee, and Abbas Jamalipour, “A New Stable Clustering Scheme for Pseudo-Linear Highly Mobile Ad Hoc Networks,” Proc. IEEE Global Telecommunications Conference (GLOBECOM), pp. 1169-1173, 2007.
[21] Khalid Abdel Hafeez, Lian Zhao, Zaiyi Liao, and Bobby Ngok-Wah Ma, “A Fuzzy-Logic-Based Cluster Head Selection Algorithm in VANETs,” Proc. IEEE International Conference on Communications (ICC), pp. 203-207, 2012.
[22] Fan Li, and Yu Wang, “ Routing in Vehicular Ad Hoc Networks: A Survey,” IEEE Vehicular Technology Magazine, vol. 2, pp. 12-22, 2007.
[23] Yun-Wei Lin, Yun-Shyan Chen, and Sing-Ling Lee, “ Routing Protocols in Vehicular Ad Hoc Networks: A Survey and Future Perspectives,” Journal of Information Science and Engineering, vol. 26, pp. 913-932, 2010.
[24] Brendan J. Frey, and Delbert Dueck, “ Clustering by Passing Messages Between Data Points,” Science, vol. 315, pp. 972-976, 2007.
[25] Wai Chen, Ratul K. Guha, Taek Jin Kwon, John Lee, and Yuan-Ying Hsu, “A Survey and Challenges in Routing and Data Dissemination in Vehicular Ad Hoc Networks,” Wireless Communications and Mobile Computing, vol. 11, pp. 787-795, 2011.
[26] Tomoyuki Ohta, Shinji Inoue, and Yoshiaki Kakuda, “An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks,” Proc. International Symposium on Autonomous Decentralized Systems (ISADS), pp. 293-300, 2003.
[27] Mario Gerla, and Leonard Kleinrock, “Vehicular Networks and The Future of The Mobile Internet,” Computer Networks, vol. 55, pp. 457-469, 2011.
[28] Mario Gerla, and Jack Tzu-Chieh Tsai, “Multicluster, mobile, multimedia radio network,” Wireless Networks, vol. 1, pp. 255–265, 1995.
[29] Dennis John Baker and Anthony Ephremides, “ A distributed algorithm for organizing mobile radio telecommunication networks,” Proc. International Conference on Distributed Computer Systems, pp. 476–483, 1981.
[30] Nitin Maslekar, Mounir Boussedjra, Houda Labiod, and Joseph Mouzna, “A Stable Clustering Algorithm for Efficiency Applications in VANETs,” Proc. IEEE Wireless Communications and Mobile Computing Conference (IWCMC), pp. 1188-1193, 2011.
[31] Ossama Younis, Marwan Krunz, and Srinivasan Ramasubramanian, “Node Clustering in Wireless Sensor Networks: Recent Developments and Deployment Challenges,” IEEE Network, vol. 20, pp. 20-25, 2006.
[32] Abhay K. Parekh, “Selecting routers in ad-hoc wireless networks,” Proc. SBT/IEEE International Telecommunications Symposium, 1994.
[33] Dennis John Baker and Anthony Ephremides, “The architectural organization of a mobile radio network via a distributed algorithm,” IEEE Transactions on Communications, vol. 29, pp. 1694-1701, 1981.
[34] Anthony Ephremides, Jeffery E. Wieselthier and Dennis John Baker, “A design concept for reliable mobile radio networks with frequency hopping signaling,” Proceedings of the IEEE, vol. 75, pp. 56-73, 1987.
指導教授 胡誌麟 審核日期 2013-8-27
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明