基于无线MESH网络的P2P资源共享系统的研究
|
摘要
P2P (Peer-to-Peer)技术改变Client/Server (C/S)计算模式,在众多领域得到发展和应用,其中资源共享是最典型,也是最受欢迎的应用。在有线网络中,研究人员从P2P资源共享系统的拓扑架构,搜索算法等方面进行研究,已经取得一些显著成果。随着无线网络和移动终端技术的发展,研究人员在移动多跳自组织网络(Mobile Ad-hoc NETwork, MANET)中提出适应于无线通信环境和移动终端特性的无线P2P资源共享方案。
无线MESH网络作为一种新的无线网络技术,由于其所具有的高速率、易组网、成本低、性能稳定等优势,引起人们的日益关注,研究人员开始考虑在无线MESH网络中进行P2P的相关应用。本文在无线MESH网络中实现P2P资源共享,针对P2P资源共享的关键步骤进行分析,并紧密联系无线MESH网络特点,分别研究了系统的体系结构和节点功能,P2P覆盖网络的拓扑优化,有效的资源检索机制和资源节点选择策略等问题,本文的主要工作和创新点如下：
第2章根据无线MESH网络的特点,利用多级结构的网络构建混合式的P2P资源共享系统,依据系统的P2P覆盖网络拓扑形式,规定了系统中节点的不同功能和职责,共享资源的管理方式等。在系统中,客户端作为共享资源的提供者,其状态的改变会引起网络中共享资源的剧烈变化,对资源的查找,选择和下载产生影响。本章提出一种有效的移动客户端管理机制,能够确保资源搜索和资源下载始终能够定位到移动的资源提供者,解决了客户端的动态行为对共享产生的不利影响。客户端管理机制是资源成功共享的前提条件,一套完整、有效的客户端管理机制不仅包括客户端的管理方式,还涉及资源管理方式,资源查找,选择和下载方式等。仿真结果表明,客户端定位管理机制能够有效的解决分层式的无线P2P资源共享系统中客户端的移动性给共享带来的影响。
第3章在Chord协议基础上,提出了一种覆盖网络拓扑构建算法——SpiralChord。SpiralChord根据空间填充曲线的映射法则来为MESH路由器分配ID,利用位置知晓策略来解决网络拓扑匹配问题,利用跨层策略来实现基于一跳广播的查找。通过分析位置知晓和跨层对覆盖网络拓扑构建的需求,提出基于曲线特性和平均八邻差最大的选择规则,对常见的空间填充曲线进行分析,选择完全满足该规则的Spiral空间填充曲线作为覆盖网络拓扑构建的基础。根据Spiral空间填充曲线的结构,提出Spiral曲线生成算法,来为MESH路由器分配ID,使得形成的环形覆盖网络,紧密的结合位置知晓策略和跨层策略,在降低网络开销的同时也能够改善系统性能。
第4章提出了与上述覆盖网络拓扑相配合使用的多关键词检索机制。为了解决结构化P2P网络中,单个关键词不足以描述精确资源的问题,利用权重最大的多个关键词散列值的特定位提取和重组来计算资源的散列值,作为资源的唯一标识。利用散列值判断资源的相似性,散列值差异越小,则资源越相似。通过将资源按照其相似性进行分类,同类的资源按照Spiral曲线的走向分配键值KEY,同时符合SpiralChord中的路由器ID分配规则,在相应的KEY负责路由器中存储包含资源多个关键词的信息,使得同类的资源信息能够分散在物理位置相近的路由器中,达到相似资源的聚类。仿真结果表明,此方案可以显著地减少消息开销,提高查找效率和查准率,较好的支持资源的模糊查找。
第5章提出了基于物理规划的资源节点选择算法。好的资源下载节点能够有效的提高资源传输效率,减少系统的整体消耗。通过对无线网络中影响节点间通信和数据交换的因素进行分析和讨论,综合考虑,选择适合的MESH客户端评价指标,提出了基于物理规划的资源节点选择策略。算法根据资源节点的综合偏好函数值对资源节点进行评估,满足指标始终协调准则。为了体现资源节点选择的个性化,利用层次分析法来对指标引入偏好系数,根据不同的指标侧重策略来进行资源节点选择。仿真实验表明,算法能够提高资源传输的成功率,减少资源传输消耗的平均时间。
P2P (Peer-to-Peer) technology changes centralized and client-server (C/S) models by making peers share information and computing resources directly in a virtual overlay network without servers. Currently, resource sharing is the most typical and popular P2P application. In wired networks, researchers focused on the topology structure, search algorithms of P2P resource sharing systems, and have seen some gratifying accomplishments. With the development of the wireless network technology and the widespread use of mobile terminals, most researchers have proposed many approaches to realize wireless P2P resource sharing in Mobile Ad-hoc Networks (MANETs).
Wireless mesh network (WMN), a relatively static multi-hop wireless network which is extended from mobile ad-hoc network (MANET), is an emerging technology for addressing the provision of high bandwidth to users at low cost, anytime, anywhere, and enabling the creation of new types of applications and services for clients accessing the network. Some researchers began to think to apply P2P technology in WMNs. The article aims at a P2P resource sharing system in WMN. Analyzing the critical steps of realizing P2P resource sharing, we propose the structural model of the system, which is closely related to the features of WMN, then discuss the problems of enabling P2P file sharing in WMN. The main work and innovation points the paper as followed:
The second chapter proposes the structural model of the P2P resource sharing system in WMN. According to the features of the WMN, a two-tier architecture is put forward. The topology of overlay network, different functions and duties of mesh clients and mesh routers, and the management style of shared resources are prescribed. In the two-layer P2P resource sharing system, the mobility of mesh clients, which are the shared resources providers, causes the performance degradation of resources sharing. By borrowing from the management style of shard resources, a location management mechanism for mobile mesh clients is proposed. A manager router which assigned to each mobile client takes the responsibility of peer location. The simulation results show client location management mechanism is effective in decreasing message overhead and response delay in P2P resources sharing system with high churn rates.
The third chapter proposes a new algorithm to construct the topology of the overlay network based on Chord——SpiralChord. SpiralChord proposes an ID assignment technique based on spiral curve which uses location awareness to resolve the problem of topology mismatch and cross-layering to realize the search algorithm based on1-hop broadcast communication. According to studying the requirements of location awareness and cross-layering to the construction of overlay network topology, a curve selection rule based on features of space filling curves and minimum average of the sum of value differences is proposed. After analyzing the several space filling curves, the spiral curve which satisfies the curve selection rule is used to be the basis of constructing the overlay network. According to the structure of spiral curve, a generation algorithm of spiral curve is proposed to assign IDs to mesh routers, which construct a ring overlay network. Simulations show SpiralChord is more effective in reducing message overhead and increasing lookup performance than Chord.
The fourth chapter proposes a weight-based multi-keywords information retrieval mechanism in SpiralChord model. We use the method extracting and restructuring the hash values of N keywords with the highest weight to get a new hash value which represents the resource. By allocating IDs to each resource based on hash values, a P2P peer can store or search the information of resources related to multiple keywords. The information retrieval mechanism describes a resource by using N keywords with the highest weight. The similarity of resources can be judged by their hash values, the smaller the differential, the more similar they are. By dividing the resources into clusters on the basis of similarity, the resources in the same cluster are allocated IDs according to the spiral curve and the ID assignment of routers, which making the information of resources in the same cluster being stored in routers with close-by locations to realize the cluster of similar resources. Simulations show the algorithm is more effective in reducing message overhead and increasing lookup performance and precision ratio, supporting fuzzy retrieval.
The fifth chapter proposes a resource provider selecting method based on physical programming. In resource sharing system, the number of the copies of a resource is not only one. Good resource provider can assure better transmission efficiency, decreasing the system consumption. After analysing and discussing the factors with influence on the communication and data exchange between peers in wireless network, we choose appropriate evaluating indicators of mesh clients, propose a resource provider selecting strategy based on physical programming. The strategy assess the resources holders according to their values of aggregate preference functions, satisifing the one vs others criteria rule. In order to reflect the personalization of resource provider selection, the analytical hierarchy process is used to calculate the preference coefficients of evaluating indicators, the requesting peers can choose different resource providers according to different preference strategy. Simulations show the algorithm is more effective in increasing the successful ratio of resource transmissions, reducing the average download time.
无线MESH网络作为一种新的无线网络技术,由于其所具有的高速率、易组网、成本低、性能稳定等优势,引起人们的日益关注,研究人员开始考虑在无线MESH网络中进行P2P的相关应用。本文在无线MESH网络中实现P2P资源共享,针对P2P资源共享的关键步骤进行分析,并紧密联系无线MESH网络特点,分别研究了系统的体系结构和节点功能,P2P覆盖网络的拓扑优化,有效的资源检索机制和资源节点选择策略等问题,本文的主要工作和创新点如下：
第2章根据无线MESH网络的特点,利用多级结构的网络构建混合式的P2P资源共享系统,依据系统的P2P覆盖网络拓扑形式,规定了系统中节点的不同功能和职责,共享资源的管理方式等。在系统中,客户端作为共享资源的提供者,其状态的改变会引起网络中共享资源的剧烈变化,对资源的查找,选择和下载产生影响。本章提出一种有效的移动客户端管理机制,能够确保资源搜索和资源下载始终能够定位到移动的资源提供者,解决了客户端的动态行为对共享产生的不利影响。客户端管理机制是资源成功共享的前提条件,一套完整、有效的客户端管理机制不仅包括客户端的管理方式,还涉及资源管理方式,资源查找,选择和下载方式等。仿真结果表明,客户端定位管理机制能够有效的解决分层式的无线P2P资源共享系统中客户端的移动性给共享带来的影响。
第3章在Chord协议基础上,提出了一种覆盖网络拓扑构建算法——SpiralChord。SpiralChord根据空间填充曲线的映射法则来为MESH路由器分配ID,利用位置知晓策略来解决网络拓扑匹配问题,利用跨层策略来实现基于一跳广播的查找。通过分析位置知晓和跨层对覆盖网络拓扑构建的需求,提出基于曲线特性和平均八邻差最大的选择规则,对常见的空间填充曲线进行分析,选择完全满足该规则的Spiral空间填充曲线作为覆盖网络拓扑构建的基础。根据Spiral空间填充曲线的结构,提出Spiral曲线生成算法,来为MESH路由器分配ID,使得形成的环形覆盖网络,紧密的结合位置知晓策略和跨层策略,在降低网络开销的同时也能够改善系统性能。
第4章提出了与上述覆盖网络拓扑相配合使用的多关键词检索机制。为了解决结构化P2P网络中,单个关键词不足以描述精确资源的问题,利用权重最大的多个关键词散列值的特定位提取和重组来计算资源的散列值,作为资源的唯一标识。利用散列值判断资源的相似性,散列值差异越小,则资源越相似。通过将资源按照其相似性进行分类,同类的资源按照Spiral曲线的走向分配键值KEY,同时符合SpiralChord中的路由器ID分配规则,在相应的KEY负责路由器中存储包含资源多个关键词的信息,使得同类的资源信息能够分散在物理位置相近的路由器中,达到相似资源的聚类。仿真结果表明,此方案可以显著地减少消息开销,提高查找效率和查准率,较好的支持资源的模糊查找。
第5章提出了基于物理规划的资源节点选择算法。好的资源下载节点能够有效的提高资源传输效率,减少系统的整体消耗。通过对无线网络中影响节点间通信和数据交换的因素进行分析和讨论,综合考虑,选择适合的MESH客户端评价指标,提出了基于物理规划的资源节点选择策略。算法根据资源节点的综合偏好函数值对资源节点进行评估,满足指标始终协调准则。为了体现资源节点选择的个性化,利用层次分析法来对指标引入偏好系数,根据不同的指标侧重策略来进行资源节点选择。仿真实验表明,算法能够提高资源传输的成功率,减少资源传输消耗的平均时间。
P2P (Peer-to-Peer) technology changes centralized and client-server (C/S) models by making peers share information and computing resources directly in a virtual overlay network without servers. Currently, resource sharing is the most typical and popular P2P application. In wired networks, researchers focused on the topology structure, search algorithms of P2P resource sharing systems, and have seen some gratifying accomplishments. With the development of the wireless network technology and the widespread use of mobile terminals, most researchers have proposed many approaches to realize wireless P2P resource sharing in Mobile Ad-hoc Networks (MANETs).
Wireless mesh network (WMN), a relatively static multi-hop wireless network which is extended from mobile ad-hoc network (MANET), is an emerging technology for addressing the provision of high bandwidth to users at low cost, anytime, anywhere, and enabling the creation of new types of applications and services for clients accessing the network. Some researchers began to think to apply P2P technology in WMNs. The article aims at a P2P resource sharing system in WMN. Analyzing the critical steps of realizing P2P resource sharing, we propose the structural model of the system, which is closely related to the features of WMN, then discuss the problems of enabling P2P file sharing in WMN. The main work and innovation points the paper as followed:
The second chapter proposes the structural model of the P2P resource sharing system in WMN. According to the features of the WMN, a two-tier architecture is put forward. The topology of overlay network, different functions and duties of mesh clients and mesh routers, and the management style of shared resources are prescribed. In the two-layer P2P resource sharing system, the mobility of mesh clients, which are the shared resources providers, causes the performance degradation of resources sharing. By borrowing from the management style of shard resources, a location management mechanism for mobile mesh clients is proposed. A manager router which assigned to each mobile client takes the responsibility of peer location. The simulation results show client location management mechanism is effective in decreasing message overhead and response delay in P2P resources sharing system with high churn rates.
The third chapter proposes a new algorithm to construct the topology of the overlay network based on Chord——SpiralChord. SpiralChord proposes an ID assignment technique based on spiral curve which uses location awareness to resolve the problem of topology mismatch and cross-layering to realize the search algorithm based on1-hop broadcast communication. According to studying the requirements of location awareness and cross-layering to the construction of overlay network topology, a curve selection rule based on features of space filling curves and minimum average of the sum of value differences is proposed. After analyzing the several space filling curves, the spiral curve which satisfies the curve selection rule is used to be the basis of constructing the overlay network. According to the structure of spiral curve, a generation algorithm of spiral curve is proposed to assign IDs to mesh routers, which construct a ring overlay network. Simulations show SpiralChord is more effective in reducing message overhead and increasing lookup performance than Chord.
The fourth chapter proposes a weight-based multi-keywords information retrieval mechanism in SpiralChord model. We use the method extracting and restructuring the hash values of N keywords with the highest weight to get a new hash value which represents the resource. By allocating IDs to each resource based on hash values, a P2P peer can store or search the information of resources related to multiple keywords. The information retrieval mechanism describes a resource by using N keywords with the highest weight. The similarity of resources can be judged by their hash values, the smaller the differential, the more similar they are. By dividing the resources into clusters on the basis of similarity, the resources in the same cluster are allocated IDs according to the spiral curve and the ID assignment of routers, which making the information of resources in the same cluster being stored in routers with close-by locations to realize the cluster of similar resources. Simulations show the algorithm is more effective in reducing message overhead and increasing lookup performance and precision ratio, supporting fuzzy retrieval.
The fifth chapter proposes a resource provider selecting method based on physical programming. In resource sharing system, the number of the copies of a resource is not only one. Good resource provider can assure better transmission efficiency, decreasing the system consumption. After analysing and discussing the factors with influence on the communication and data exchange between peers in wireless network, we choose appropriate evaluating indicators of mesh clients, propose a resource provider selecting strategy based on physical programming. The strategy assess the resources holders according to their values of aggregate preference functions, satisifing the one vs others criteria rule. In order to reflect the personalization of resource provider selection, the analytical hierarchy process is used to calculate the preference coefficients of evaluating indicators, the requesting peers can choose different resource providers according to different preference strategy. Simulations show the algorithm is more effective in increasing the successful ratio of resource transmissions, reducing the average download time.
引文
[1]Milojicic D. S., Kalogeraki V., Lukose R. Peer-to-Peer computing, [EB/OL].[2011-05-01], http://scholar.google.com.hk/scholar_url?hl=zh-CN&q=https://www.hpl.hp.com/techreports/2 002/HPL-2002-57R1.pdf&sa=X&scisig=AAGBfm2vDK_tsVVLvra7tMEe7dvlfj3bZw&oi=sc holarr&ei=aBuLUZCⅡcLvkQXZ2IHABQ&ved=0CCoQgAMoADAA.
[2]Napster website:www.napster.com.
[3]Gnutella website:gnutella.wego.com.
[4]KaZaA website:www.kazaa.com.
[5]Dai T. N., Bach L. N., Duy L. V. Improving freenet's performance by adaptive clustering cache replacement[C]. Proceedings of International Conference on Computing and Communication Technologies, Da Nang, Viet Nam,2009. United States:IEEE Conference Publications,2009.
[6]FastTrack website:www.fasttrack.nu/index_int.html.
[7]Stoica I., Morris R., Karger D., et al. Chord:a scalable peer-to-peer lookup service for Internet applications [J]. IEEE/ACM Transactions on Networking,2003,11(1),17-32.
[8]Rowstron A, Druschel P. Pastry:scalable distributed object location and routing for large-scale peer-to-peer systems [J]. ACM International Conference on Distributed Systems Platforms (Middleware),2001:329-350.
[9]Taperstry website:http://current.cs.ucsb.edu/projects/chimera/.
[10]Ratnasamy, S., Francis, P., Handley, M., et al. A scalable content-addressable network [J]. Computer Communication Review,2001,31(4),161-172.
[11]Da Hora D. N., Macedo D. F., Oliveira L. B., et al. Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks [J]. Computer Communications,2009:32(13-14), 1445-1459.
[12]APRANET website:http://www.dei.isep.ipp.pt/docs.arpa.html.
[13]UUCPNET website:http://www.uucp.org/index.html.
[14]GIMPS website:http://www.mersenne.org.
[15]SETI@home website:setiathome.ssl.berkeley.edu.
[16]AmazingStore website:http://www.amazingstore.org/.
[17]Chan Y. W., Ho T. H., Shih P. C., et al. Malugo:A peer-to-peer storage system [J]. International Journal of Ad Hoc and Ubiquitous Computing,2010:5(4),209-218.
[18]Skadsem M. K., Borch N. T., Karlsen R. DeLight:A peer-to-peer storage and processing system [C]. Proceedings of International Conference on Internet and Web Applications and Services, Venice, Mestre, Italy,2009. United States:IEEE Computer Society,2009.
[19]Emule website:http://www.emule-project.net/home/perl/general.cgi?l=1.
[20]BitTorrent website:http://www.bittorrent.com/.
[21]PPS website:http://www.pps.tv/.
[22]PPTV website:http://www.pptv.com/.
[23]UUSSE website:http://www. uusee.com/.
[24]QQ website:http://www.qq.com/.
[25]MSN website:http://www.msn.com/.
[26]Skype website:http://skype.tom.com/.
[27]Free Game website:http://security.riit.tsinghua.edu.cn/Freegame/English%20Vesion/ index.html.
[28]Amnesia website:http://www.amnesiagarne.corn/#main.
[29]Microsoft, Microsoft Office Groove 2007[EB/OL].[2012-2-25]. http://www.microsoft.com/office/groove.
[30]Weibei N., Hofstetter H., Signer B., et al. PaperSketch:A paper-digital collaborative remote sketching tool [C]. Proceedings of International Conference on Intelligent User Interfaces, Palo Alto, CA, United states,2011. United States:Association for Computing Machinery, 2011.
[31]Walkerdine J., Hughes D., Rayson P., et al. Sommerville I. A framework for P2P application development [J]. Computer Communications.2008:31(2),38-40.
[32]李曦,无线P2P文件共享系统中若干关键技术研究[D],北京:北京邮电大学,2010.
[33]Kim M. S., Kim T., Shin Y. J., et al. A wavelet-based approach to detect shared congestion [J]. IEEE/ACM Transactions on Networking,2008:16(4),763-776.
[34]Malkhi D., Naor M., Ratajczak D. Viceroy:a scalable and dynamic emulation of the butterfly [C]. Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA, United states,2002. United States:Association for Computing Machinery, 2002.
[35]徐浩,基于重叠网拓扑特征的P2P系统研究[D].湖南：中南大学,2009.
[36]Ren Y., Sha C. F., Qian W. N., et al. Explore the "small world phenomena" in pure P2P information sharing systems [C]. Proceedings of 3rd International Symposium on Cluster Computing and the Grid (CCGrid). United States:IEEE Computer Society,2003,232-239.
[37]Condie T., Kamvar S., Garcia M. H. Adaptive peer-to-peer topologies[C]. Proceedings of 4th International Conference on Peer-to-Peer Computing, Zurich, Switzerland,2004. United States: IEEE Computer Society,53-62.
[38]Tian H. R., Zou S. H., Wang W. D., et al. Incentive compatible adaptive topologies for P2P networks [J]. Journal of Software,2006,17(04):845-853.
[39]Chawathe Y., Ratnasamy S., Breslau L. Making Gnutella-like P2P Systems Scalable [C]. Proceedings of ACM SIGCOMM 2003 Conference on Computer Communications, Karlsruhe, Germany,2003. United States:Association for Computing Machinery,2003.
[40]冯国富,张金城,姜玉泉,等.无结构P2P覆盖网络的拓扑优化[J].软件学报,2007,18：2819-2829.
[41]Yang C., Wu J. Dominating-set-based searching in peer-to-peer networks[EB/OL], [2011-10-12],http://www.cse.fau.edu/-jie/research/publications/Publication_files/li-wu-05-CD S.pdf.
[42]Padmanabhan V. N., Subramanian L. An Investigation of geographic mapping techniques for internet hosts [C]. Proceeding of Applications, Technologies, Architectures, and Protocols for Computers Communications, San Diego, CA, United states,2001. United states:Association for Computing Machinery,2001.
[43]Yunhao Liu. A two-hop solution to solving topology mismatch [J]. IEEE Transactions on Parallel and Distributed System,2008,19:1591-1600.
[44]Tongqing Qiu, Guihai Chen, Mao Ye, et al. Towards Location-aware Topology in both Unstructured and Structured P2P Systems [C]. Proceedings of International Conference on Parallel Processing, Xi'an, China,2007. United States:Institute of Electrical and Electronics Engineers Inc.,2007.
[45]Kalogerakika V, Gunopulos D. A local search mechanism for peer-to-peer networks[C]. Proceedings of the International Conference on Information and Knowledge Management, McLean, VA, United states,2002. United States:Association for Computing Machinery,2002.
[46]Yang B., Garcia M. H. Improving search in peer-to-peer networks[C]. Proceeding of the 22nd IEEE International Conference on Distributed Computing, Vienna, Austria 2002.5-14. United States:Institute of Electrical and Electronics Engineers Inc.,2002.
[47]Lv C, Cao, Cohen E., Li K., et al. Search and replication in unstructured peer-to-peer networks [C]. Proceeding of the 16th ACM International Conference on Supercomputing, New York, NY, United states,2002. United States:Association for Computing Machinery,2002.
[48]Zhijun Wang, Das Sajal K., Mohan K, et al. An efficient update propagation algorithm for P2P systems [J]. Computer Communications,2007:30(5),1106-1115.
[49]Tsoumakos D., Roussopoulos. Adaptive probabilistic search for peer-to-peer networks[DB/OL],[2011-3-20],http://www.cse.fau.edu/-jie/research/publications/Publication_files/li-wu-05-CDS.pdf
[50]Tang Dongming, Lu Xianliang, Yang Lei. Unstructured P2P search mechanism based on ant colony optimization [J]. Advances in Information Sciences and Service Sciences,2012:4(11), 257-263.
[51]Busnel Y., Kermarrec A. M. PROXSEM:Interest-based proximity measure to improve search efficiency in P2P systems [C]. Fourth European Conference on Universal Multiservice Networks, Toulouse, France,2007. United States:Institute of Electrical and Electronics Engineering Computer Society,2007.
[52]Liu Yuhua, Wu Shishun, Xiong Naixue, et al. Cache-based search algorithm in unstructured P2P networks [J]. Journal of Intelligent Manufacturing,2011,1-7.
[53]El Dick M., Pacitti E. Locaware:Index caching in unstructured P2P-file sharing systems [C]. Proceedings of International Conference on Extending Database Technology, Saint-Petersburg, Russia,2009. United States:Association for Computing Machinery,2009.
[54]Li Z., Su S., Yang F. WSrep:a novel reputation model for web services selection [J]. Lecture Notes in Computer Science,2007,4496:199-208, Springer Heidelberg,2008.
[55]Lee S. Y, Kwon O. H., Kim I., et al. A reputation management system in structured peer-to-peer networks [C]. Proceeding of 14th IEEE International Workshops on Enabling Technologies:Infrastructure for Collaborative Enterprise, Linkoeping, Sweden,2005. United States:Institute of Electrical and Electronics Engineering Computer Society,2005.
[56]Tian Huirong, Zou Shihong, Wang Wendong, et al. Incentive compatible adaptive topologies for P2P networks [J]. Journal of Software,2006,17(4):845-853.
[57]Tran H., Hitchens M., Yaradharajan Y., et al. A trust based access control framework for P2P file sharing systems [C]. Proceedings of the 38th Hawaii International Conference on System Sciences, Big Island, HI, United states 2005. United States:IEEE Computer Society,2005.
[58]Wu X., He J., Xu F. An enhanced trust model based on reputation for P2P Networks [C]. Proceeding of 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, Taichung, Taiwan,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[59]Chang J., Wang H. Yang Y. A Dynamic Trust Metric for P2P Systems [C]. Proceedings of the Fifth International Conference on Grid Cooperative Computing Workshops, Hunan, China, 2006. United States:Institute of Electrical and Electronics Engineering Computer Society, 2006.
[60]李路明.P2P网基于声望信任模型若干关键问题的实现研究[D].陕西：西北工业大学,2009.
[61]Minaxi Gupta, Paul Judge, Mostafa Ammar. A reputation system for peer-to-peer networks[C]. Proceeding of 13th International Workshop on Network and Operating Systems Support for Digital Audio and Video, CA, Monterey, United states,2003. Association for Computing Machinery,2003.
[62]Adar E., Bernardo A., Free riding on Gnutella [EB/OL].[2011-5-21],http://www.google.com.hk/url?sa==t&rct=j&q=Free+riding+on+Gnutella &source=web&cd=1&ved=0CCcQFjAA&url=http%3A%2F%2Fwww.hpl.hp.com%2Fresearc h%2Fidl%2Fpapers%2Fgnutella%2Fgnutella.pdf&ei=yfxqUObFGMrMmAXk0oDoBw&usg= AFOJCNGqIlxsSqAZ4uaLFT0gxXniTvZmgw&cad=rjt.
[63]Mol J.J.D., Pouwelse J.A., Epema D.H.J., et al. Free-riding, fairness, and firewalls in P2P file-sharing [C]. Proceedings of International Conference on Peer-to-Peer Computing, Aachen, Germany,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[64]Corker N. Historical paper:"The tragedy of the commons" [C]. Proceedings of the Institution of Civil Engineers:Engineering Sustainability Science,2011,105-117. United Kingdom:ICE Publishing,2011.
[65]陈宇.P2P激励机制与分布式存储的探索和研究[D].上海：上海大学,2008.
[66]Vishnumurthy V., Chandrakumar S., Sirer E. G. KARMA:a secure economic framework for P2P resource sharing [DB/OL],[2011-3-14]. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6462.
[67]Golle P., Leyton-Brown K., Mironov I. Incentives for sharing in P2P networks [DB/OL],[2011-3-14].http://www.google.com.hk/url?sa=t&rct=j&q=Incentives+for+sharing+i n+P2P+networks&source=web&cd=1&ved=0CCcQFjAA&url=http%3A%2F%2Fresearch.mi crosoft.com%2Fen-us%2Fpeople%2Fmironov%2Fwelcom01.pdf&ei=twVrUPL7Iq6hmQXgr 4GgCQ&usg=AFQjCNGjS0cU9gJUHvuAGRtIMpgmhbi9AQ&cad=rjt.
[68]Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Levine, et al. Adaptive Peer Selection, [EB/OL]. [2012-10-14], http://iptps.org/papers-2003/adaptiveselection.pdf.
[69]Pogkas I., Kriakov V., Chen Zhongqiang, et al. Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation [J]. Peer-to-Peer Networking and Applications,2009,2(1):37-59.
[70]Gkantsidis C, Rodriguez P.R. Network coding for large scale content distribution [C]. Proceedings of IEEE International Conference on Computer Communication, Miami, FL, United states,2005. Institute of Electrical and Electronics Engineers Inc.,2005.
[71]杨磊.基于网络编码的重传以及P2P共享技术的研究[D].浙江：浙江大学,2011.
[72]欧中洪,宋美娜,战晓苏,等.移动对等网络关键技术[J].软件学报,2008：19(2),404-418.
[73]Sumino H., Ishikawa N., Kato T. Design and implementation of P2P protocol for mobile phones [C]. Proceedings of IEEE International Conference on Pervasive Computing and Communications Workshops, Pisa, Italy,2006. United States:Institute of Electrical and Electronics Engineers Computer Society,2006.
[74]Sozer Hasan, Tekkalmaz Metin, Korpeoglu Ibrahim. A peer-to-peer file search and download protocol for wireless ad-hoc networks [J]. Computer Communications,2009:32,41-50.
[75]Cramer C, Fuhrmann T. ISPRP:A message-efficient protocol for initializing structured P2P networks[C]. Proceedings of 24th IEEE International Conference on Performance Computing and Communications, Phoenix, AZ, United states,2005. United States:Institute of Electrical and Electronics Engineers Inc.,2005.
[76]陈宏旦.移动P2P网络中的基于DHT的分层Chord算法研究[D].重庆：重庆大学,2010.
[77]Delmastro EFrom pastry to CrossROAD:CROSS-Layer ring overlay for ad hoc networks[C]. Proceeding of Third IEEE International Conference on Pervasive Computing and Communications Workshops, Kauai Island, HI, United states 2005. United States:IEEE Computer Society,2005.
[78]Raphael K, Peter K, Pascal F. Practical DHT lookup in mobile ad hoc networks[EB/OL], [2011-2-25],http://www.google.com.hk/url?sa=t&rct=j&q=Practical+DHT+lookup+in+mobile +ad+hoc+networks&source=web&cd=l&ved=0CDcQFjAA&url=%68%74%74%70%3a%2f %2f%75%6e%69%6e%65%30%38%2e%69%72%61%70%68%2e%6e%65%74%2f%49%4d %47%2f%70%64%66%2f%6d%64%68%74%2e%70%64%66&ei=KESLUc-xDMiekwX061 GgBQ&usg=AFQjCNGRqUj6oGCSS-lqVUHds-NO9sI_3w.
[79]Cheng Chang Hoh, RenHung Hwang. P2P file sharing system over MANET based on swarm intelligence:A cross-layer design [C]. Proceedings of IEEE Wireless Communications and Networking Conference, Kowloon, China,2007. United States:Institute of Electrical and Electronics Engineers Inc.,2007.
[80]Shah Nadir, Qian Depie. A new cross-layer unstructured P2P file sharing protocol over mobile ad-hoc network [J]. Lecture Notes in Computer Science,2010:(6059),250-263.
[81]Klemm A., Lindemann C, Waldhorst O.P. A special-purpose peer-to-peer file sharing system for mobile ad hoc networks [C]. Proceedings of IEEE Vehicular Technology Conference, Orlando, FL, United states,2003. United States:Institute of Electrical and Electronics Engineers Inc.,2003.
[82]Park Karam, park Joon Sang, Ro Won W. Efficient parallelized network encoding For P2P file sharing applications [J]. Lecture Notes in Computer Science on Advances in Grid and Pervasive Computing,2009:353-363.
[83]刘孝男.移动P2P网络中基于方向搜索算法的研究[D].吉林：吉林大学,2010.
[84]Liu Xiaonan, Fang Zhiyi, Si Haiyang, et al. Research of direction-based search algorithm in P2P network [C]. Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing, Dalian, China,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[85]Liu Cheliang, Wang Chihyu, Wei Hungyu. Mobile Chord:Enhancing P2P Application Performance over Vehicular Ad Hoc Network [C].2008 IEEE Globecom Workshops, New Orleans, LA, United states,2008. United States:Institute of Electrical and Electronics Engineers Computer Society,2008.
[86]Li Shenjie, Chan S.-H. Gary. Bopper:Wireless video broadcasting with peer-to-peer error recovery [C]. Proceedings of IEEE International Conference on Multimedia and ExoP, Beijing, China,2007. United States:Institute of Electrical and Electronics Engineers Computer Society, 2007.
[87]Woo S. S., Stoenescu T. M. Efficient file sharing by multicast-P2P protocol using network coding and rank based peer selection [C]. Proceedings of IEEE Vehicular Technology Conference, Barcelona, Spain,2009. United States:Institute of Electrical and Electronics Engineers Inc.,2009.
[88]王仕果.无线P2P网络的资源定位机制与中继协作策略研究[D].北京：北京邮电大学,2010.
[89]方旭明.下一代因特网技术：无线Mesh网络[M].北京：人民邮电出版社,2006,1-31.
[90]Akyildiz I. F., Wang X. D., Wang and W. L. Wireless mesh network:a survey [J]. Computer Networks,2005:47,445-487.
[91]Wen Jigang, Cao Jiannong, Xie Kun, et al. User density sensitive P2P streaming in wireless mesh networks [J]. Journal of Parallel and Distributed Computing,2011:71(4),573-583.
[92]Mastronarde Nicholas, Turaga Deepak S., Van Der Schaar M. Collaborative resource exchanges for peer-to-peer video streaming over wireless mesh networks [J]. IEEE Journal on Selected Areas in Communications,2007:25(1),108-118.
[93]Ayyadurai V, Moessner K., Tafazolli R.Multipath network coding in wireless mesh networks [C]. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, Bilbao, Spain,2011. Germany:Springer Verlag,2011.
[94]Galluccio L., Morabito G., Palazzo S., et al. Georoy:A location-aware enhancement to Viceroy peer-to-peer algorithm [J]. Computer Networks,2007:51(8),1998-2014.
[95]Jin Shudong, Wang Limin Content and Service Replication Strategies in Multihop Wireless Mesh Networks [C]. Proceedings of the Eighth ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Montreal, Que., Canada,2005. United States: Association for Computing Machinery,2005.
[96]Alasaad A., Gopalakrishnan S., Leung V. Content Caching and Replication Schemes for Peer-to-Peer File Sharing in Wireless Mesh Networks[C]. IEEE Globecom Workshops, Miami, FL, United states,2010,1707-1711. United States:IEEE Computer Society,2010.
[97]Burresi S., Canali C, Elena R. M., et al. MeshChord:A location-aware, cross-layer specialization of chord for wireless mesh networks [C]. Proceeding of 6th Annual IEEE International Conference on Pervasive Computing and Communications, Hong Kong,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[98]Marcel C. C., Durga M. P., Andreas K., et al. Peer-to-Peer Selection and Channel Assignment for Wireless Mesh Networks [C]. International Workshop on Network Modeling and Analysis (IWNMA), Bangalore, India, January 2011.
[99]Alasaad A., Gopalakrishnan S., Leung Victor C. M. Peer-to-peer file sharing over wireless mesh networks [C]. Proceedings of IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing, Victoria, BC, Canada,2009. United States:Institute of Electrical and Electronics Engineers Inc.,2009.
[100]Thomas Z., Jochen S. MADPastry:A DHT Substrate for Practicably Sized MANETs [EB/OL]. [2011-6-18]. http://www.google.com.hk/url?sa=t&rct=j&q=MADPastry&source=web&cd=1&ved=OCCIQ FjAA&url=http%3A%2F%2Farchive.cone.informatik.uni-freiburg.de%2F1ehre%2Fseminar% 2Fadhoc-w09%2Fpresentations%2FAH_Seminar_MADPastry_Presentation.pdf&ei=CpdvUN TuFeaTiQfJ9oCwDg&usg=AFQjCNGAfU1r-51odxcGXcSW5GugwLMzig&cad=rjt.
[101]Oliveira R, Bernardo L, Pinto P. Flooding techniques for resource discovery on high mobility MANETs [EB/OL]. [2011-4-12]. http://www.google.com.hk/url?sa=t&rct=j&q=Flooding+techniques+for+resource+discovery+ on+high+mobility+MANET&source=web&cd=1&ved=0CCcQFjAA&url=http%3A%2F%2F users.informatik.haw-hamburg.de%2F-schmidt%2Fp2p%2Fsup%2Fobp-ftrdh-05.pdf&ei=uhlr UMjOMMOOmQXLpYCQBg&usg=AFQjCNGCYBBkd75hOhA_tR9gWPYlVdhaOw&cad =rjt.
[102]Janine K., Orlando L. Location aware discovery service and selection protocol in cooperative mobile wireless ad hoc networks[C]. IEEE INFOCOM Workshops, Rio de Janeiro, Brazil, 2009. United States:Institute of Electrical and Electronics Engineers Inc.,2009.
[103]Conti M., Gregori E., Turi G. A cross-layer optimization of gnutella for mobile ad hoc networks [C]. ACM International Symposium on Mobile Ad Hoc Networking and Computing, Urbana-Champaign, IL, United states,2005. United States:Association for Computing Machinery,2005.
[104]Moro G., Monti G. W*-Grid:A robust decentralized cross-layer infrastructure for routing and multi-dimensional data management in wireless ad-hoc sensor networks [C]. IEEE Conference on Peer-to-Peer Computing, Galway, Ireland,2007. United States:Institute of Electrical and Electronics Engineers Computer Society,2007.
[105]Passarella, F. Delmastro, M. Conti. XScribe:a stateless, cross-layer approach to P2P multicast in multi-hop ad hoc networks[C]. International Workshop on Decentralized Resource Sharing in Mobile Computing and Networking, Los Angeles, CA, United states,2006. United States:Association for Computing Machinery,2006.
[106]Reynolds P., Vahdat A. Efficient peer-to-peer keyword searching [C]. ACM/IFIP/USENIX 2003 International Conference on Middleware. New York:ACM,2003:21-40.
[107]曾宇斌,刘贵全.P2P网络中基于多关键字的信息检索研究[J].计算机应用与软件,2007：24(8),119-121.
[108]Marcel Cavalcanti de Castro. Enhancing P2P systems over wireless mesh networks [D]. Sweden:Karlstad University,2011.
[109]翟羽佳,袁坚,毛新宇,等.基于DHT的移动性管理机制的性能分析[J].清华大学学报(自然科学版),2011：51(1),115-121.
[110]Lo S C. Mobility management using P2P techniques in wireless networks [J]. Journal of Information Science and Engineering,2007:23,421-439.
[111]吴永德.无线mesh网络移动管理问题的研究[D].江苏：江南大学,2008
[112]INETMANET website:https://github.com/inetmanet/inetmanet/wiki.
[113]Omnet++website:http://www.omnetpp.org/.
[114]Baumgart I, Heep B, Krause S. OverSim:A scalable and flexible overlay framework for simulation and real network applications [C]. Proceedings of International Conference on Peer-to-Peer Computing, Seattle, WA, United states,2009. United States:IEEE Computer Society,2009.
[115]Dongyao Zou,Yong Gan. The research of a structural P2P model based on mobile cellular networks [C]. Proceeding of 2009 International Conference on Networking and Digital Society, Guizhou, China,2009. United States:IEEE Computer Society,2009.
[116]Lai Wei Kuang, Weng Mu-Lung, Lo Shih-Hao, et al. Enhancing the lookup performance and power detection of kademlia by random landmarking cluster [J]. International Journal of Innovative Computing, Information and Control,2011:7(5),2141-2152.
[117]Canali C., Renda M. E., Santi P., et al. Enabling efficient peer-to-peer resource sharing in wireless mesh networks [J]. IEEE Transactions on Mobile Computing,2010:9(3),333-347.
[118]Hans Sagan. Space filling curves [M]. New York:Springer-Verlag,1994,1-49.
[119]丁玮,齐东旭.数字图像变换及信息隐藏与伪装技术[J].计算机学报,1998：21(9),838-843.
[120]Koga T., Suetake N. Structural-context-preserving image abstraction by using space-filling curve based on minimum spanning tree [C]. Proceedings of International Conference on Image Processing, Brussels, Belgium,2011. United States:IEEE Computer Society,2011.
[121]淡卜绸,张锋涛,雷改丽.基于网格曲面上空间填充曲线刀具路径生成算法研究[J].机械设计与制造,2011：(7),93-95.
[122]Andrzejak A., Z. Xu. Scalable, efficient range queries for grid information services [C]. IEEE International Conference on Peer to Peer Computing, [s.n.],2002.
[123]李佩芝,黄中伟,史天元Cantor空间填充曲线之演算法[J].台湾地理资讯学刊,2006：4,13-26.
[124]Mokbel Mohamed F., Aref Walid G., Kamel I. Analysis of multi-dimensional space-filling curves [J]. GeoInformatica,2009:7(3),179-209.
[125]Garces-Erice L., Felber P. A., Biersack E. W., et al. Data indexing in peer-to-peer DHT networks [C]. Proceedings of International Conference on Distributed Computing Systems, Hachioji, Tokyo, Japan,2004. United States:Institute of Electrical and Electronics Engineers Inc,2004.
[126]Chen Hanhua; Jin Hai, et al. Efficient Multi-keyword Search over P2P Web [C]. Proceeding of the 17th International Conference on World Wide Web, Beijing, China 2008,989-997. United States:Association for Computing Machinery,2008.
[127]Omprakash, D. Gnawali. A Keyword-set Search System for Peer-to-Peer Networks [D]. United States:Massachusetts Institute of Technology,2002.
[128]周健,洪佩琳,李津生.P2P网络中一种新型的基于DHT的多关键字信息检索模型[J].电路与系统学报,2008：13(3)
[129]Li Jingyuan, Jia Weijia, Huang Liusheng, et al. An Efficient Source Peer Selection Algorithm in Hybrid P2P File Sharing Systems[C]. Proceedings of Seventh International Conference on Algorithms and Architectures for Parallel Processing(ICA3PP2007), Hangzhou, China,2007. Germany:Springer Verlag,2007.
[130]Li Xi, Ji Hong, Rehard Y. F., et al. Peer Selecting Model Based on FCM for Wireless Distributed P2P Files Sharing Systems [J]. Journal of Harbin histitute of Technology (New series),2010:17(5),593-599.
[131]张棪,周旭,刘书浩,等.基于3G网络的P2P系统中基于模糊认知图的小区优先节点选择算法[J].电信科学,2012：28(1),63-69.
[132]Messac A., Ismail Y. A. Multi-objective robust design using Physical Programming [J]. Structural and Multidisciplinary Optimization,2002:23(5),357-371.
[133]王允良,李为吉.物理规划方法及其在飞机方案设计中的应用[J].航空学报,2005：26(5),562-566.
[134]雍恩米,陈磊,唐国金.基于物理规划的高超声速飞行器滑翔式再入轨迹优化[J].航空学报,2008：25(9),1091-1097.
[135]黄洪钟,刘鸿莉,古莹奎,等.基于物理规划的模糊稳健优化设计[J].清华大学学报,2005：45(8),1020-102.
[136]Messac A.,Van Dessel S., Mullur A.A., et al. Optimization of Large Scale Rigidified Inflatable Structures for Housing Using Physical Programming[J]. Structural and Multidisciplinary Optimization,2004, Vol.26, pp.139-151.
[137]Satty A L.The Analytic Hierarchy Process [M].New York:McGraw Hill.1980.
[138]骆正清,杨善林.层次分析法中几种标度的比较[J].系统工程理论与实践,2004,9：51-59.
[139]Haiying Shen, Lianyu Zhao. Refining Reputation to Truly Select High-QoS Servers in Peer-to-Peer Networks [C]. Proceedings of International Conference on Computer Communications and Networks, Maui, HI, United states,2011. United States:Institute of Electrical and Electronics Engineers Inc,2011.
[140]Del Prado Pavon Javier, Choi Sunghyun. Link Adaptation Strategy for IEEE 802.11 WLAN via Received Signal Strength Measurement [C]. Proceedings of IEEE International Conference on Communications, Anchorage, AK, United states. United States:Institute of Electrical and Electronics Engineers Inc,2003.
[2]Napster website:www.napster.com.
[3]Gnutella website:gnutella.wego.com.
[4]KaZaA website:www.kazaa.com.
[5]Dai T. N., Bach L. N., Duy L. V. Improving freenet's performance by adaptive clustering cache replacement[C]. Proceedings of International Conference on Computing and Communication Technologies, Da Nang, Viet Nam,2009. United States:IEEE Conference Publications,2009.
[6]FastTrack website:www.fasttrack.nu/index_int.html.
[7]Stoica I., Morris R., Karger D., et al. Chord:a scalable peer-to-peer lookup service for Internet applications [J]. IEEE/ACM Transactions on Networking,2003,11(1),17-32.
[8]Rowstron A, Druschel P. Pastry:scalable distributed object location and routing for large-scale peer-to-peer systems [J]. ACM International Conference on Distributed Systems Platforms (Middleware),2001:329-350.
[9]Taperstry website:http://current.cs.ucsb.edu/projects/chimera/.
[10]Ratnasamy, S., Francis, P., Handley, M., et al. A scalable content-addressable network [J]. Computer Communication Review,2001,31(4),161-172.
[11]Da Hora D. N., Macedo D. F., Oliveira L. B., et al. Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks [J]. Computer Communications,2009:32(13-14), 1445-1459.
[12]APRANET website:http://www.dei.isep.ipp.pt/docs.arpa.html.
[13]UUCPNET website:http://www.uucp.org/index.html.
[14]GIMPS website:http://www.mersenne.org.
[15]SETI@home website:setiathome.ssl.berkeley.edu.
[16]AmazingStore website:http://www.amazingstore.org/.
[17]Chan Y. W., Ho T. H., Shih P. C., et al. Malugo:A peer-to-peer storage system [J]. International Journal of Ad Hoc and Ubiquitous Computing,2010:5(4),209-218.
[18]Skadsem M. K., Borch N. T., Karlsen R. DeLight:A peer-to-peer storage and processing system [C]. Proceedings of International Conference on Internet and Web Applications and Services, Venice, Mestre, Italy,2009. United States:IEEE Computer Society,2009.
[19]Emule website:http://www.emule-project.net/home/perl/general.cgi?l=1.
[20]BitTorrent website:http://www.bittorrent.com/.
[21]PPS website:http://www.pps.tv/.
[22]PPTV website:http://www.pptv.com/.
[23]UUSSE website:http://www. uusee.com/.
[24]QQ website:http://www.qq.com/.
[25]MSN website:http://www.msn.com/.
[26]Skype website:http://skype.tom.com/.
[27]Free Game website:http://security.riit.tsinghua.edu.cn/Freegame/English%20Vesion/ index.html.
[28]Amnesia website:http://www.amnesiagarne.corn/#main.
[29]Microsoft, Microsoft Office Groove 2007[EB/OL].[2012-2-25]. http://www.microsoft.com/office/groove.
[30]Weibei N., Hofstetter H., Signer B., et al. PaperSketch:A paper-digital collaborative remote sketching tool [C]. Proceedings of International Conference on Intelligent User Interfaces, Palo Alto, CA, United states,2011. United States:Association for Computing Machinery, 2011.
[31]Walkerdine J., Hughes D., Rayson P., et al. Sommerville I. A framework for P2P application development [J]. Computer Communications.2008:31(2),38-40.
[32]李曦,无线P2P文件共享系统中若干关键技术研究[D],北京:北京邮电大学,2010.
[33]Kim M. S., Kim T., Shin Y. J., et al. A wavelet-based approach to detect shared congestion [J]. IEEE/ACM Transactions on Networking,2008:16(4),763-776.
[34]Malkhi D., Naor M., Ratajczak D. Viceroy:a scalable and dynamic emulation of the butterfly [C]. Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA, United states,2002. United States:Association for Computing Machinery, 2002.
[35]徐浩,基于重叠网拓扑特征的P2P系统研究[D].湖南：中南大学,2009.
[36]Ren Y., Sha C. F., Qian W. N., et al. Explore the "small world phenomena" in pure P2P information sharing systems [C]. Proceedings of 3rd International Symposium on Cluster Computing and the Grid (CCGrid). United States:IEEE Computer Society,2003,232-239.
[37]Condie T., Kamvar S., Garcia M. H. Adaptive peer-to-peer topologies[C]. Proceedings of 4th International Conference on Peer-to-Peer Computing, Zurich, Switzerland,2004. United States: IEEE Computer Society,53-62.
[38]Tian H. R., Zou S. H., Wang W. D., et al. Incentive compatible adaptive topologies for P2P networks [J]. Journal of Software,2006,17(04):845-853.
[39]Chawathe Y., Ratnasamy S., Breslau L. Making Gnutella-like P2P Systems Scalable [C]. Proceedings of ACM SIGCOMM 2003 Conference on Computer Communications, Karlsruhe, Germany,2003. United States:Association for Computing Machinery,2003.
[40]冯国富,张金城,姜玉泉,等.无结构P2P覆盖网络的拓扑优化[J].软件学报,2007,18：2819-2829.
[41]Yang C., Wu J. Dominating-set-based searching in peer-to-peer networks[EB/OL], [2011-10-12],http://www.cse.fau.edu/-jie/research/publications/Publication_files/li-wu-05-CD S.pdf.
[42]Padmanabhan V. N., Subramanian L. An Investigation of geographic mapping techniques for internet hosts [C]. Proceeding of Applications, Technologies, Architectures, and Protocols for Computers Communications, San Diego, CA, United states,2001. United states:Association for Computing Machinery,2001.
[43]Yunhao Liu. A two-hop solution to solving topology mismatch [J]. IEEE Transactions on Parallel and Distributed System,2008,19:1591-1600.
[44]Tongqing Qiu, Guihai Chen, Mao Ye, et al. Towards Location-aware Topology in both Unstructured and Structured P2P Systems [C]. Proceedings of International Conference on Parallel Processing, Xi'an, China,2007. United States:Institute of Electrical and Electronics Engineers Inc.,2007.
[45]Kalogerakika V, Gunopulos D. A local search mechanism for peer-to-peer networks[C]. Proceedings of the International Conference on Information and Knowledge Management, McLean, VA, United states,2002. United States:Association for Computing Machinery,2002.
[46]Yang B., Garcia M. H. Improving search in peer-to-peer networks[C]. Proceeding of the 22nd IEEE International Conference on Distributed Computing, Vienna, Austria 2002.5-14. United States:Institute of Electrical and Electronics Engineers Inc.,2002.
[47]Lv C, Cao, Cohen E., Li K., et al. Search and replication in unstructured peer-to-peer networks [C]. Proceeding of the 16th ACM International Conference on Supercomputing, New York, NY, United states,2002. United States:Association for Computing Machinery,2002.
[48]Zhijun Wang, Das Sajal K., Mohan K, et al. An efficient update propagation algorithm for P2P systems [J]. Computer Communications,2007:30(5),1106-1115.
[49]Tsoumakos D., Roussopoulos. Adaptive probabilistic search for peer-to-peer networks[DB/OL],[2011-3-20],http://www.cse.fau.edu/-jie/research/publications/Publication_files/li-wu-05-CDS.pdf
[50]Tang Dongming, Lu Xianliang, Yang Lei. Unstructured P2P search mechanism based on ant colony optimization [J]. Advances in Information Sciences and Service Sciences,2012:4(11), 257-263.
[51]Busnel Y., Kermarrec A. M. PROXSEM:Interest-based proximity measure to improve search efficiency in P2P systems [C]. Fourth European Conference on Universal Multiservice Networks, Toulouse, France,2007. United States:Institute of Electrical and Electronics Engineering Computer Society,2007.
[52]Liu Yuhua, Wu Shishun, Xiong Naixue, et al. Cache-based search algorithm in unstructured P2P networks [J]. Journal of Intelligent Manufacturing,2011,1-7.
[53]El Dick M., Pacitti E. Locaware:Index caching in unstructured P2P-file sharing systems [C]. Proceedings of International Conference on Extending Database Technology, Saint-Petersburg, Russia,2009. United States:Association for Computing Machinery,2009.
[54]Li Z., Su S., Yang F. WSrep:a novel reputation model for web services selection [J]. Lecture Notes in Computer Science,2007,4496:199-208, Springer Heidelberg,2008.
[55]Lee S. Y, Kwon O. H., Kim I., et al. A reputation management system in structured peer-to-peer networks [C]. Proceeding of 14th IEEE International Workshops on Enabling Technologies:Infrastructure for Collaborative Enterprise, Linkoeping, Sweden,2005. United States:Institute of Electrical and Electronics Engineering Computer Society,2005.
[56]Tian Huirong, Zou Shihong, Wang Wendong, et al. Incentive compatible adaptive topologies for P2P networks [J]. Journal of Software,2006,17(4):845-853.
[57]Tran H., Hitchens M., Yaradharajan Y., et al. A trust based access control framework for P2P file sharing systems [C]. Proceedings of the 38th Hawaii International Conference on System Sciences, Big Island, HI, United states 2005. United States:IEEE Computer Society,2005.
[58]Wu X., He J., Xu F. An enhanced trust model based on reputation for P2P Networks [C]. Proceeding of 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, Taichung, Taiwan,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[59]Chang J., Wang H. Yang Y. A Dynamic Trust Metric for P2P Systems [C]. Proceedings of the Fifth International Conference on Grid Cooperative Computing Workshops, Hunan, China, 2006. United States:Institute of Electrical and Electronics Engineering Computer Society, 2006.
[60]李路明.P2P网基于声望信任模型若干关键问题的实现研究[D].陕西：西北工业大学,2009.
[61]Minaxi Gupta, Paul Judge, Mostafa Ammar. A reputation system for peer-to-peer networks[C]. Proceeding of 13th International Workshop on Network and Operating Systems Support for Digital Audio and Video, CA, Monterey, United states,2003. Association for Computing Machinery,2003.
[62]Adar E., Bernardo A., Free riding on Gnutella [EB/OL].[2011-5-21],http://www.google.com.hk/url?sa==t&rct=j&q=Free+riding+on+Gnutella &source=web&cd=1&ved=0CCcQFjAA&url=http%3A%2F%2Fwww.hpl.hp.com%2Fresearc h%2Fidl%2Fpapers%2Fgnutella%2Fgnutella.pdf&ei=yfxqUObFGMrMmAXk0oDoBw&usg= AFOJCNGqIlxsSqAZ4uaLFT0gxXniTvZmgw&cad=rjt.
[63]Mol J.J.D., Pouwelse J.A., Epema D.H.J., et al. Free-riding, fairness, and firewalls in P2P file-sharing [C]. Proceedings of International Conference on Peer-to-Peer Computing, Aachen, Germany,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[64]Corker N. Historical paper:"The tragedy of the commons" [C]. Proceedings of the Institution of Civil Engineers:Engineering Sustainability Science,2011,105-117. United Kingdom:ICE Publishing,2011.
[65]陈宇.P2P激励机制与分布式存储的探索和研究[D].上海：上海大学,2008.
[66]Vishnumurthy V., Chandrakumar S., Sirer E. G. KARMA:a secure economic framework for P2P resource sharing [DB/OL],[2011-3-14]. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6462.
[67]Golle P., Leyton-Brown K., Mironov I. Incentives for sharing in P2P networks [DB/OL],[2011-3-14].http://www.google.com.hk/url?sa=t&rct=j&q=Incentives+for+sharing+i n+P2P+networks&source=web&cd=1&ved=0CCcQFjAA&url=http%3A%2F%2Fresearch.mi crosoft.com%2Fen-us%2Fpeople%2Fmironov%2Fwelcom01.pdf&ei=twVrUPL7Iq6hmQXgr 4GgCQ&usg=AFQjCNGjS0cU9gJUHvuAGRtIMpgmhbi9AQ&cad=rjt.
[68]Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Levine, et al. Adaptive Peer Selection, [EB/OL]. [2012-10-14], http://iptps.org/papers-2003/adaptiveselection.pdf.
[69]Pogkas I., Kriakov V., Chen Zhongqiang, et al. Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation [J]. Peer-to-Peer Networking and Applications,2009,2(1):37-59.
[70]Gkantsidis C, Rodriguez P.R. Network coding for large scale content distribution [C]. Proceedings of IEEE International Conference on Computer Communication, Miami, FL, United states,2005. Institute of Electrical and Electronics Engineers Inc.,2005.
[71]杨磊.基于网络编码的重传以及P2P共享技术的研究[D].浙江：浙江大学,2011.
[72]欧中洪,宋美娜,战晓苏,等.移动对等网络关键技术[J].软件学报,2008：19(2),404-418.
[73]Sumino H., Ishikawa N., Kato T. Design and implementation of P2P protocol for mobile phones [C]. Proceedings of IEEE International Conference on Pervasive Computing and Communications Workshops, Pisa, Italy,2006. United States:Institute of Electrical and Electronics Engineers Computer Society,2006.
[74]Sozer Hasan, Tekkalmaz Metin, Korpeoglu Ibrahim. A peer-to-peer file search and download protocol for wireless ad-hoc networks [J]. Computer Communications,2009:32,41-50.
[75]Cramer C, Fuhrmann T. ISPRP:A message-efficient protocol for initializing structured P2P networks[C]. Proceedings of 24th IEEE International Conference on Performance Computing and Communications, Phoenix, AZ, United states,2005. United States:Institute of Electrical and Electronics Engineers Inc.,2005.
[76]陈宏旦.移动P2P网络中的基于DHT的分层Chord算法研究[D].重庆：重庆大学,2010.
[77]Delmastro EFrom pastry to CrossROAD:CROSS-Layer ring overlay for ad hoc networks[C]. Proceeding of Third IEEE International Conference on Pervasive Computing and Communications Workshops, Kauai Island, HI, United states 2005. United States:IEEE Computer Society,2005.
[78]Raphael K, Peter K, Pascal F. Practical DHT lookup in mobile ad hoc networks[EB/OL], [2011-2-25],http://www.google.com.hk/url?sa=t&rct=j&q=Practical+DHT+lookup+in+mobile +ad+hoc+networks&source=web&cd=l&ved=0CDcQFjAA&url=%68%74%74%70%3a%2f %2f%75%6e%69%6e%65%30%38%2e%69%72%61%70%68%2e%6e%65%74%2f%49%4d %47%2f%70%64%66%2f%6d%64%68%74%2e%70%64%66&ei=KESLUc-xDMiekwX061 GgBQ&usg=AFQjCNGRqUj6oGCSS-lqVUHds-NO9sI_3w.
[79]Cheng Chang Hoh, RenHung Hwang. P2P file sharing system over MANET based on swarm intelligence:A cross-layer design [C]. Proceedings of IEEE Wireless Communications and Networking Conference, Kowloon, China,2007. United States:Institute of Electrical and Electronics Engineers Inc.,2007.
[80]Shah Nadir, Qian Depie. A new cross-layer unstructured P2P file sharing protocol over mobile ad-hoc network [J]. Lecture Notes in Computer Science,2010:(6059),250-263.
[81]Klemm A., Lindemann C, Waldhorst O.P. A special-purpose peer-to-peer file sharing system for mobile ad hoc networks [C]. Proceedings of IEEE Vehicular Technology Conference, Orlando, FL, United states,2003. United States:Institute of Electrical and Electronics Engineers Inc.,2003.
[82]Park Karam, park Joon Sang, Ro Won W. Efficient parallelized network encoding For P2P file sharing applications [J]. Lecture Notes in Computer Science on Advances in Grid and Pervasive Computing,2009:353-363.
[83]刘孝男.移动P2P网络中基于方向搜索算法的研究[D].吉林：吉林大学,2010.
[84]Liu Xiaonan, Fang Zhiyi, Si Haiyang, et al. Research of direction-based search algorithm in P2P network [C]. Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing, Dalian, China,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[85]Liu Cheliang, Wang Chihyu, Wei Hungyu. Mobile Chord:Enhancing P2P Application Performance over Vehicular Ad Hoc Network [C].2008 IEEE Globecom Workshops, New Orleans, LA, United states,2008. United States:Institute of Electrical and Electronics Engineers Computer Society,2008.
[86]Li Shenjie, Chan S.-H. Gary. Bopper:Wireless video broadcasting with peer-to-peer error recovery [C]. Proceedings of IEEE International Conference on Multimedia and ExoP, Beijing, China,2007. United States:Institute of Electrical and Electronics Engineers Computer Society, 2007.
[87]Woo S. S., Stoenescu T. M. Efficient file sharing by multicast-P2P protocol using network coding and rank based peer selection [C]. Proceedings of IEEE Vehicular Technology Conference, Barcelona, Spain,2009. United States:Institute of Electrical and Electronics Engineers Inc.,2009.
[88]王仕果.无线P2P网络的资源定位机制与中继协作策略研究[D].北京：北京邮电大学,2010.
[89]方旭明.下一代因特网技术：无线Mesh网络[M].北京：人民邮电出版社,2006,1-31.
[90]Akyildiz I. F., Wang X. D., Wang and W. L. Wireless mesh network:a survey [J]. Computer Networks,2005:47,445-487.
[91]Wen Jigang, Cao Jiannong, Xie Kun, et al. User density sensitive P2P streaming in wireless mesh networks [J]. Journal of Parallel and Distributed Computing,2011:71(4),573-583.
[92]Mastronarde Nicholas, Turaga Deepak S., Van Der Schaar M. Collaborative resource exchanges for peer-to-peer video streaming over wireless mesh networks [J]. IEEE Journal on Selected Areas in Communications,2007:25(1),108-118.
[93]Ayyadurai V, Moessner K., Tafazolli R.Multipath network coding in wireless mesh networks [C]. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, Bilbao, Spain,2011. Germany:Springer Verlag,2011.
[94]Galluccio L., Morabito G., Palazzo S., et al. Georoy:A location-aware enhancement to Viceroy peer-to-peer algorithm [J]. Computer Networks,2007:51(8),1998-2014.
[95]Jin Shudong, Wang Limin Content and Service Replication Strategies in Multihop Wireless Mesh Networks [C]. Proceedings of the Eighth ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Montreal, Que., Canada,2005. United States: Association for Computing Machinery,2005.
[96]Alasaad A., Gopalakrishnan S., Leung V. Content Caching and Replication Schemes for Peer-to-Peer File Sharing in Wireless Mesh Networks[C]. IEEE Globecom Workshops, Miami, FL, United states,2010,1707-1711. United States:IEEE Computer Society,2010.
[97]Burresi S., Canali C, Elena R. M., et al. MeshChord:A location-aware, cross-layer specialization of chord for wireless mesh networks [C]. Proceeding of 6th Annual IEEE International Conference on Pervasive Computing and Communications, Hong Kong,2008. United States:Institute of Electrical and Electronics Engineering Computer Society,2008.
[98]Marcel C. C., Durga M. P., Andreas K., et al. Peer-to-Peer Selection and Channel Assignment for Wireless Mesh Networks [C]. International Workshop on Network Modeling and Analysis (IWNMA), Bangalore, India, January 2011.
[99]Alasaad A., Gopalakrishnan S., Leung Victor C. M. Peer-to-peer file sharing over wireless mesh networks [C]. Proceedings of IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing, Victoria, BC, Canada,2009. United States:Institute of Electrical and Electronics Engineers Inc.,2009.
[100]Thomas Z., Jochen S. MADPastry:A DHT Substrate for Practicably Sized MANETs [EB/OL]. [2011-6-18]. http://www.google.com.hk/url?sa=t&rct=j&q=MADPastry&source=web&cd=1&ved=OCCIQ FjAA&url=http%3A%2F%2Farchive.cone.informatik.uni-freiburg.de%2F1ehre%2Fseminar% 2Fadhoc-w09%2Fpresentations%2FAH_Seminar_MADPastry_Presentation.pdf&ei=CpdvUN TuFeaTiQfJ9oCwDg&usg=AFQjCNGAfU1r-51odxcGXcSW5GugwLMzig&cad=rjt.
[101]Oliveira R, Bernardo L, Pinto P. Flooding techniques for resource discovery on high mobility MANETs [EB/OL]. [2011-4-12]. http://www.google.com.hk/url?sa=t&rct=j&q=Flooding+techniques+for+resource+discovery+ on+high+mobility+MANET&source=web&cd=1&ved=0CCcQFjAA&url=http%3A%2F%2F users.informatik.haw-hamburg.de%2F-schmidt%2Fp2p%2Fsup%2Fobp-ftrdh-05.pdf&ei=uhlr UMjOMMOOmQXLpYCQBg&usg=AFQjCNGCYBBkd75hOhA_tR9gWPYlVdhaOw&cad =rjt.
[102]Janine K., Orlando L. Location aware discovery service and selection protocol in cooperative mobile wireless ad hoc networks[C]. IEEE INFOCOM Workshops, Rio de Janeiro, Brazil, 2009. United States:Institute of Electrical and Electronics Engineers Inc.,2009.
[103]Conti M., Gregori E., Turi G. A cross-layer optimization of gnutella for mobile ad hoc networks [C]. ACM International Symposium on Mobile Ad Hoc Networking and Computing, Urbana-Champaign, IL, United states,2005. United States:Association for Computing Machinery,2005.
[104]Moro G., Monti G. W*-Grid:A robust decentralized cross-layer infrastructure for routing and multi-dimensional data management in wireless ad-hoc sensor networks [C]. IEEE Conference on Peer-to-Peer Computing, Galway, Ireland,2007. United States:Institute of Electrical and Electronics Engineers Computer Society,2007.
[105]Passarella, F. Delmastro, M. Conti. XScribe:a stateless, cross-layer approach to P2P multicast in multi-hop ad hoc networks[C]. International Workshop on Decentralized Resource Sharing in Mobile Computing and Networking, Los Angeles, CA, United states,2006. United States:Association for Computing Machinery,2006.
[106]Reynolds P., Vahdat A. Efficient peer-to-peer keyword searching [C]. ACM/IFIP/USENIX 2003 International Conference on Middleware. New York:ACM,2003:21-40.
[107]曾宇斌,刘贵全.P2P网络中基于多关键字的信息检索研究[J].计算机应用与软件,2007：24(8),119-121.
[108]Marcel Cavalcanti de Castro. Enhancing P2P systems over wireless mesh networks [D]. Sweden:Karlstad University,2011.
[109]翟羽佳,袁坚,毛新宇,等.基于DHT的移动性管理机制的性能分析[J].清华大学学报(自然科学版),2011：51(1),115-121.
[110]Lo S C. Mobility management using P2P techniques in wireless networks [J]. Journal of Information Science and Engineering,2007:23,421-439.
[111]吴永德.无线mesh网络移动管理问题的研究[D].江苏：江南大学,2008
[112]INETMANET website:https://github.com/inetmanet/inetmanet/wiki.
[113]Omnet++website:http://www.omnetpp.org/.
[114]Baumgart I, Heep B, Krause S. OverSim:A scalable and flexible overlay framework for simulation and real network applications [C]. Proceedings of International Conference on Peer-to-Peer Computing, Seattle, WA, United states,2009. United States:IEEE Computer Society,2009.
[115]Dongyao Zou,Yong Gan. The research of a structural P2P model based on mobile cellular networks [C]. Proceeding of 2009 International Conference on Networking and Digital Society, Guizhou, China,2009. United States:IEEE Computer Society,2009.
[116]Lai Wei Kuang, Weng Mu-Lung, Lo Shih-Hao, et al. Enhancing the lookup performance and power detection of kademlia by random landmarking cluster [J]. International Journal of Innovative Computing, Information and Control,2011:7(5),2141-2152.
[117]Canali C., Renda M. E., Santi P., et al. Enabling efficient peer-to-peer resource sharing in wireless mesh networks [J]. IEEE Transactions on Mobile Computing,2010:9(3),333-347.
[118]Hans Sagan. Space filling curves [M]. New York:Springer-Verlag,1994,1-49.
[119]丁玮,齐东旭.数字图像变换及信息隐藏与伪装技术[J].计算机学报,1998：21(9),838-843.
[120]Koga T., Suetake N. Structural-context-preserving image abstraction by using space-filling curve based on minimum spanning tree [C]. Proceedings of International Conference on Image Processing, Brussels, Belgium,2011. United States:IEEE Computer Society,2011.
[121]淡卜绸,张锋涛,雷改丽.基于网格曲面上空间填充曲线刀具路径生成算法研究[J].机械设计与制造,2011：(7),93-95.
[122]Andrzejak A., Z. Xu. Scalable, efficient range queries for grid information services [C]. IEEE International Conference on Peer to Peer Computing, [s.n.],2002.
[123]李佩芝,黄中伟,史天元Cantor空间填充曲线之演算法[J].台湾地理资讯学刊,2006：4,13-26.
[124]Mokbel Mohamed F., Aref Walid G., Kamel I. Analysis of multi-dimensional space-filling curves [J]. GeoInformatica,2009:7(3),179-209.
[125]Garces-Erice L., Felber P. A., Biersack E. W., et al. Data indexing in peer-to-peer DHT networks [C]. Proceedings of International Conference on Distributed Computing Systems, Hachioji, Tokyo, Japan,2004. United States:Institute of Electrical and Electronics Engineers Inc,2004.
[126]Chen Hanhua; Jin Hai, et al. Efficient Multi-keyword Search over P2P Web [C]. Proceeding of the 17th International Conference on World Wide Web, Beijing, China 2008,989-997. United States:Association for Computing Machinery,2008.
[127]Omprakash, D. Gnawali. A Keyword-set Search System for Peer-to-Peer Networks [D]. United States:Massachusetts Institute of Technology,2002.
[128]周健,洪佩琳,李津生.P2P网络中一种新型的基于DHT的多关键字信息检索模型[J].电路与系统学报,2008：13(3)
[129]Li Jingyuan, Jia Weijia, Huang Liusheng, et al. An Efficient Source Peer Selection Algorithm in Hybrid P2P File Sharing Systems[C]. Proceedings of Seventh International Conference on Algorithms and Architectures for Parallel Processing(ICA3PP2007), Hangzhou, China,2007. Germany:Springer Verlag,2007.
[130]Li Xi, Ji Hong, Rehard Y. F., et al. Peer Selecting Model Based on FCM for Wireless Distributed P2P Files Sharing Systems [J]. Journal of Harbin histitute of Technology (New series),2010:17(5),593-599.
[131]张棪,周旭,刘书浩,等.基于3G网络的P2P系统中基于模糊认知图的小区优先节点选择算法[J].电信科学,2012：28(1),63-69.
[132]Messac A., Ismail Y. A. Multi-objective robust design using Physical Programming [J]. Structural and Multidisciplinary Optimization,2002:23(5),357-371.
[133]王允良,李为吉.物理规划方法及其在飞机方案设计中的应用[J].航空学报,2005：26(5),562-566.
[134]雍恩米,陈磊,唐国金.基于物理规划的高超声速飞行器滑翔式再入轨迹优化[J].航空学报,2008：25(9),1091-1097.
[135]黄洪钟,刘鸿莉,古莹奎,等.基于物理规划的模糊稳健优化设计[J].清华大学学报,2005：45(8),1020-102.
[136]Messac A.,Van Dessel S., Mullur A.A., et al. Optimization of Large Scale Rigidified Inflatable Structures for Housing Using Physical Programming[J]. Structural and Multidisciplinary Optimization,2004, Vol.26, pp.139-151.
[137]Satty A L.The Analytic Hierarchy Process [M].New York:McGraw Hill.1980.
[138]骆正清,杨善林.层次分析法中几种标度的比较[J].系统工程理论与实践,2004,9：51-59.
[139]Haiying Shen, Lianyu Zhao. Refining Reputation to Truly Select High-QoS Servers in Peer-to-Peer Networks [C]. Proceedings of International Conference on Computer Communications and Networks, Maui, HI, United states,2011. United States:Institute of Electrical and Electronics Engineers Inc,2011.
[140]Del Prado Pavon Javier, Choi Sunghyun. Link Adaptation Strategy for IEEE 802.11 WLAN via Received Signal Strength Measurement [C]. Proceedings of IEEE International Conference on Communications, Anchorage, AK, United states. United States:Institute of Electrical and Electronics Engineers Inc,2003.