政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69576

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 109951/140892 (78%)
Visitors : 46207756 Online Users : 919

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大典藏 > College of Informatics > Department of Computer Science > Periodical Articles > Item 140.119/69576

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

Title:	Infrastructure Based Chord Structure for P2P File Sharing over Vehicular Network
Authors:	張宏慶 Jang,Hung-Chin Hsu,Tzu-Yao
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 link:	http://dx.doi.org/10.4304/jnw.8.3.588-597
DOI:	10.4304/jnw.8.3.588-597
Appears in Collections:	[Department of Computer Science ] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML2	864	View/Open

社群 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.

Loading...