政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/60245
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113822/144841 (79%)
Visitors : 51837408      Online Users : 303
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/60245


    Title: 在車載網路中以親和傳播機制建構檔案相關叢集之研究
    File-based clustering for VANET using affinity propagation
    Authors: 曾立吉
    Tzeng, Li Ji
    Contributors: 張宏慶
    Jang, Hung Chin
    曾立吉
    Tzeng, Li Ji
    Keywords: 車載網路
    親和傳播
    叢集
    VANET
    Affinity Propagation
    cluster
    Date: 2010
    Issue Date: 2013-09-04 17:07:05 (UTC+8)
    Abstract: 車載網路受到各方廣泛討論，激發出許多新的議題，由於車載網路的通訊品質不穩定，速度快、節點多，封包傳送不易，因此許多人都採用分群式架構增進效能，以集中式管理群組，避免封包被重複傳送，降低封包碰撞的機會。然而，現有的分群機制只能用在即時方面的應用，在檔案傳輸方面效能不足。本篇論文擬改善C. Shea等人[1]所提出的分群機制File-based Affinity Propagation Cluster, FAPC，建立兼具動態性和檔案相關性的叢集架構，並且提出改善失去叢集管理員的重建機制，以提升分群的穩定性及吞吐量（throughput）。最後，我們以模擬證明所提出的方法優於C. Shea [1]的方法，以query hit ratio、retrieve file ratio、average number of clusters及average cluster head duration為效能指標，觀察在不同時間、車輛數目及車輛速度時效能表現。
    Vehicular Ad-hoc Network (VANET) has been widely discussed and many issues have been proposed. Due to VANET’s unstable quality, varying speed, lots of mobility nodes, it’s not easy to deliver packets. Thus many researchers suggested using cluster architecture to enhance performance. Because of the central management, we can avoid duplication of packets in the same cluster and decrease the probability of packet collision. However, we find most of the cluster architectures are suitable for real-time applications, but not for file transfer. In this research, we improve C. Shea’s [1] method by adding file-similarity by classifying into groups and reselecting cluster head, when the group of nodes have not cluster head. This cluster architecture can enhance stability and throughput. Finally, we use simulation to prove that our method outperforms Chen’s [1] cluster method in terms of query hit ratio, retrieve file ratio, average number of clusters and average cluster head duration.
    Reference: [1] C. Shea, B. Hassanabadi, and S. Valaee, “Mobility-Based Clustering in VANETs Using Affinity Propagation,” in GLOBECOM`09 Proceedings of the 28th IEEE Conference on Global Telecommunications, IEEE Press Piscataway, NJ, USA, Nov, 2009, pp. 1-6.
    [2] Frey B. J and Dueck D, “Clustering by Passing Messages between Data Points,” Science 315, 2007, pp. 972-976.
    [3] "Affinity Propagation" Retrieved: http://www.psi.toronto.edu/index.php?q=affinity%20propagation, June 2011.
    [4] T. Taleb, E. Sakhaee, A. Jamalipour, K. Hashimoto, N. Kato, and Y. Nemoto, “A Stable Routing Protocol to Support ITS Services in VANET Networks,” Vehicular Technology, IEEE Transactions on, vol. 56, no. 6 Part 1, 2007, pp. 3337-3347.
    [5] Y. Chu and N. Huang, “Delivering of Live Video Streaming for Vehicular Communication Using Peer-to-Peer Approach,” In Proceedings of 2007 Mobile Networking for Vehicular Environments, Anchorage, AK, USA, May 2007, pp. 1-6.
    [6] Sung-Han Lin, Junn-Yen Hu, Cheng-Fu Chou, Ing-Chau Chang, and Chien-Chun Hung, “A Novel Social Cluster-based P2P Framework for Integrating VANETs with the Internet,’’ in WCNC`09 Proceedings of the 2009 IEEE Conference on Wireless Communications & Networking Conference(WCNC), IEEE Press Piscataway, NJ, USA, Apr, 2009, pp. 1-6.
    [7] B. Ramakrishnan, R. S. Rajesh, and R. S. Shaji, “CBVANET: A Cluster Based Vehicular Ad hoc Network Model for Simple Highway Communication,” Int.J.Advanced Networking and Application, Dec, 2010, accepted for publication, pp. 755-761.
    [8] Slawomir Kuklinski and Grzegorz Wolny, “ Density Based Clustering algorithm for Vehicular Ad-Hoc Networks,” International Journal of Internet Protocol Technology, Volume 4 Issue 3, September, 2009, pp. 1-6.
    [9] Maen Artimy, “Local Density Estimation and Dynamic Transmission-Range Assignment in Vehicular Ad Hoc Networks,” IEEE Transactions on Intelligent Transportation Systems, September, 2007, pp. 400-412.
    [10] M. M Artimy , W Robertson, and W. J Phillips,“Assignment of Dynamic Transmission Range Based on Estimation of Vehicle Density,” in Proceedings of the 2nd ACM International Workshop on Vehicular Ad Hoc Networks, New York, NY, USA, Sep, 2005.
    [11] “SUMO Simulation of Urban Mobility” Retrieved:
    http://sumo.sourceforge.net/, June, 2011.
    [12] “The Network Simulator ns 2.35” Retrieved:
    http://www.isi.edu/nsnam/ns/index.html, June, 2011.
    [13] M. Abuelela and S. Olariu, “ZIPPER: a Zero-Infrastructure Peer-to-Peer System for VANET,” in Proceedings of the ACM Workshop on Wireless Multimedia Networking and Performance Modeling, New York, NY, USA, 2007.
    [14] E. Souza, I. Nikolaidis, and P. Gburzynski, “A New Aggregate Local Mobility (ALM) Clustering Algorithm for VANETs,” 2010 IEEE International Conference, 2010, pp. 1–5.
    [15] Karim R, “VANET: Superior System for Content Distribution in Vehicular Network Applications,” Berkeley, CA, USA, 2009.
    Description: 碩士
    國立政治大學
    資訊科學學系
    97753035
    99
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0097753035
    Data Type: thesis
    Appears in Collections:[Department of Computer Science ] Theses

    Files in This Item:

    File Description SizeFormat
    303501.pdf1390KbAdobe PDF2406View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback