Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks  

作　　者：李曦 Ji Hong Zheng Ruiming Li Ting 

机构地区：[1]Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 10087, P.R. China [2]School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China

出　　处：《High Technology Letters》2009年第3期281-287,共7页高技术通讯（英文版）

基　　金：supported by the National Nature Science Foundation of China(No.60672124);the National High Technology Research and Development Programme the of China(No.2007AA01Z221)

摘　　要：In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.In order to improve the performance of peer-to-peer files sharing system under mobile distributed en-vironments,a novel always-optimally-coordinated(AOC)criterion and corresponding candidate selectionalgorithm are proposed in this paper.Compared with the traditional min-hops criterion,the new approachintroduces a fuzzy knowledge combination theory to investigate several important factors that influence filestransfer success rate and efficiency .Whereas the min-hops based protocols only ask the nearest candidatepeer for desired files,the selection algorithm based on AOC comprehensively considers users' preferencesand network requirements with flexible balancing rules.Furthermore,its advantage also expresses in theindependence of specified resource discovering protocols,allowing for scalability.The simulation resultsshow that when using the AOC based peer selection algorithm,system performance is much better thanthe min-hops scheme,with files successful transfer rate improved more than 50% and transfer time re-duced at least 20%.

关 键 词：peer-to-peer files sharing system mobile self-organized network candidate selection fuzzy knowledge combination always-optimally-coordinated （AOC） 

分 类 号：TN929.5[电子电信—通信与信息系统]