English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94586/125118 (76%)
Visitors : 30503866      Online Users : 361
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/69576
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/69576

    Title: Infrastructure Based Chord Structure for P2P File Sharing over Vehicular Network
    Authors: 張宏慶
    Contributors: 資科系
    Keywords: vehicular network;vehicle to road side unit (V2R);peer-to-peer (P2P);multi-layer chord
    Date: 2013-03
    Issue Date: 2014-09-02 17:18:43 (UTC+8)
    Abstract: Vehicular network is different from wired network due to its network environment changes rapidly. The connection lifetime between vehicles is usually short because vehicles move in high speeds. Hence, deploy peer-to-peer (p2p) applications over vehicular network is a challenging research issue. There are many problems confronted in p2p file sharing over vehicular network. Therefore, how to search files effectively, how to share files with distant vehicles, how to fully utilize the limited bandwidth, etc. have became important issues. In this paper, we propose an infrastructure-based Urban Multi-Layered Chord (UML-Chord) architecture for p2p file sharing over an urban vehicular network. In this architecture, vehicles are grouped into clusters. A multi-layer chord is employed to manage both files information and clustered vehicles locations. Connection lifetime between vehicles is estimated on a traffic aware basis. Target vehicle selection considers connection lifetime, bandwidth, and vehicle transmission status. Simulations results show that UML-Chord outperforms Chord, clustered organization and overlay based approaches in terms of number of hops (per query), control message overhead, query delay time, average download time, and file complete ratio.
    Relation: Journal of Networks,8(3),588-597
    Data Type: article
    DOI 連結: http://dx.doi.org/10.4304/jnw.8.3.588-597
    DOI: 10.4304/jnw.8.3.588-597
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback