抗扰动的移动对等覆盖网研究
|
摘要
随着移动网络的迅速发展和移动设备的快速普及，对等网络技术在移动网络中的需求越来越强烈。移动对等覆盖网能够屏蔽网络路由协议和物理网络设备标识、编址之间的差异，提供相对稳定的拓扑结构和路由、负载均衡、资源查询等服务。移动对等覆盖网的结构直接决定了移动P2P系统的可扩展性、鲁棒性、安全性和抗扰动性。因此，对于移动对等覆盖网的研究具有十分重要的意义和应用价值。虽然已有一些移动对等覆盖网被提出，但其性能和抗扰动性较差，难以得到实际应用。本文在现有研究的基础上，针对移动对等覆盖网研究中存在的一些问题，对移动对等覆盖网的构建、评估、优化等关键技术进行了深入的研究。
本文通过分析多种经典对等覆盖网的基本原理和拓扑结构，深入剖析了传统对等覆盖网不能完全适应移动网络的原因，对移动对等覆盖网的概念进行了明确的阐述，并对现有的移动对等覆盖网进行了详细的比较和分析，为实现移动对等覆盖网的方法验证和性能评价，对多种网络模拟器进行了比较和选择。
在上述研究基础上，本文首先提出一种抗扰动的移动对等覆盖网，根据节点加入网络的先后顺序构造多个不同k值的k-派系社区结构，并通过外联节点来链接不同的k-派系，针对节点的加入及k-派系的形成、节点退出、节点失效等情况设计相应的算法。同时，通过网络拓扑控制过程和外联过程来不断调整覆盖网拓扑结构,实现对移动物理网络拓扑变化的自适应，并结合数据冗余和失效节点主动检测来提高移动对等覆盖网的抗扰动能力。
其次，为实现拓扑控制信息的有效传播和保持节点资源列表的副本一致性，本文对移动对等覆盖网中的数据分发机制进行了研究，根据移动网络节点资源受限和网络链接不稳定的特点选择合适的数据分发方法，并基于移动对等覆盖网的拓扑结构进行改进。通过采取对不同状态节点动态调节分发概率的策略，增加不稳定节点的分发概率，保证数据能够在较短时间内分发到所有目标节点，提高系统在扰动情况下的数据分发效率，有效降低网络负载。
再次，本文对移动对等覆盖网在扰动情况下的性能评价体系进行构建，并遵循这一评价体系，在指数扰动模型和KAD扰动模型下对多种覆盖网进行性能评估。本文进一步对基于频度度量的扰动评估模型进行研究，通过加入影响网络扰动的间接因素使扰动评估模型能够更加真实的反映实际的网络扰动情况。结合模拟器的实验结果和多项式曲线拟合方法，本文提出一个适合任何移动对等覆盖网使用的估算扰动评估公式参数权值的方法。
最后，本文基于改进的遗传算法对移动对等覆盖网络参数进行自动模拟优化，以提高移动对等覆盖网络的性能。为了克服经典遗传算法的全局优化效率差和易发生“早熟”现象的缺点，通过计算个体之间的相似度来减少不必要的交叉操作，并提高相似度低的个体之间进行交叉操作的概率。利用自动模拟优化算法来实现对模拟器的配置文件修改、源代码修改和编译、运行等过程的全自动运行，从而提高优化的效率和可靠性。
本文的研究工作围绕移动对等覆盖网的关键技术展开，其中涉及到的网络构建、数据分发、性能评估以及性能优化为今后的研究工作奠定了良好的理论基础和实验数据基础。
The demand for mobile peer-to-peer technology becomes much stronger because mobilenetworks are developed quickly, and mobile equipment and applications are more widely used.Mobile P2P overlays can shield the difference among the network routing protocols and themarks and addresses of physical equipment, and provide services for stable topology, loadbalance, and resources search etc. The structure of mobile P2P overlays directly determinesthe scalability, robust, security, and churn-resistance of the mobile P2P systems. Therefore theresearch of mobile P2P overlays is of great significance and application value. Although therehave been some mobile peer-to-peer overlays proposed, they get poor performance andchurn-resistance, which make them difficult to get practical application. Based on the existingresearch results, construction, evaluation, and optimization are intensively studied to solvesome problems in the research of mobile P2P overlays.
By analyzing a variety of traditional peer-to-peer overlays with the basic principle andtopology structure, this thesis further expounds why the traditional P2P overlays can notcompletely adapt to the mobile networks. The concept of mobile P2P overlays is illustrated,and the existing mobile peer-to-peer overlays are analyzed and compared in detail. Thenetwork simulators are compared and chosen for the method validation and performanceevaluation of mobile P2P overlays.
Firstly, the thesis proposes a mobile P2P overlay under the basis of the above mentionedresearch. The overlay constructs k-clique communities with different k value according to theorder of each node joining the overlay, uses contact nodes to link distinct k-cliquecommunities, and designs corresponding algorithms for joining, leaving and crashing of thenodes and construction of k-cliques. Meanwhile, it keeps adjusting the topology of the overlayby using topology control process and inter-clique connection processes to improveself-adaption for change of physical network topology and to increase the churn-resistanceability by combining data redundancy and proactive detection of failure nodes.
Secondly, in order to realize the effective transmission of topology control informationand to maintain replica consistency of the node resource lists, the thesis researches on the datadissemination mechanism based on mobile P2P overlays. The appropriate data dissemination method is chosen according to the characteristics as resource-constrained nodes and linkinstability in mobile networks, and is improved based on the mobile P2P overlay topologystructure. By taking on the strategy as dynamic adjusting the dissemination probability ofnodes with different state, the dissemination probability of unstable nodes are added, whichmakes sure that the data can be disseminated to all the target nodes in a relatively short periodof time, the efficiency of data dissemination under churn is enhanced, and the network load iseffectively reduced.
Thirdly, the performance evaluation model of mobile P2P overlays under churn isconstructed. Follow the model, performance of several overlays are evaluated under bothexponential churn model and KAD churn model. Furthermore, how to improve the existingchurn evaluation model based on frequency measurement is studied; by adding the indirectfactors influencing network churn, the improved churn evaluation model can more reallyreflect the actual network churn situation. By combination of simulation results andpolynomial fitting method, this thesis studies the parameter weights estimation method whichcan be used in any mobile P2P overlays.
Lastly, parameters of mobile P2P overlays are optimized based on improved geneticalgorithm and automatic simulation to improve the performance of mobile peer-to-peeroverlays. In order to overcome the poor efficiency of the global optimization and classical"premature" phenomenon occurred in genetic algorithm, unnecessary crossover operations arereduced by computing the degree of similarity between individuals, and individuals with lowersimilarity degree get the greater probability of crossover operation between them. Automaticsimulation optimization is used to modify the simulator configuration file and the source codeand to compile and run automatically so as to improve the efficiency and reliability of theoptimization.
Research of this thesis addresses the key technologies of mobile peer-to-peer network,which involves the network construction, data dissemination, performance evaluation andoptimization of network parameters, these researches lays a good theoretical basis andexperimental data base for future studies.
本文通过分析多种经典对等覆盖网的基本原理和拓扑结构，深入剖析了传统对等覆盖网不能完全适应移动网络的原因，对移动对等覆盖网的概念进行了明确的阐述，并对现有的移动对等覆盖网进行了详细的比较和分析，为实现移动对等覆盖网的方法验证和性能评价，对多种网络模拟器进行了比较和选择。
在上述研究基础上，本文首先提出一种抗扰动的移动对等覆盖网，根据节点加入网络的先后顺序构造多个不同k值的k-派系社区结构，并通过外联节点来链接不同的k-派系，针对节点的加入及k-派系的形成、节点退出、节点失效等情况设计相应的算法。同时，通过网络拓扑控制过程和外联过程来不断调整覆盖网拓扑结构,实现对移动物理网络拓扑变化的自适应，并结合数据冗余和失效节点主动检测来提高移动对等覆盖网的抗扰动能力。
其次，为实现拓扑控制信息的有效传播和保持节点资源列表的副本一致性，本文对移动对等覆盖网中的数据分发机制进行了研究，根据移动网络节点资源受限和网络链接不稳定的特点选择合适的数据分发方法，并基于移动对等覆盖网的拓扑结构进行改进。通过采取对不同状态节点动态调节分发概率的策略，增加不稳定节点的分发概率，保证数据能够在较短时间内分发到所有目标节点，提高系统在扰动情况下的数据分发效率，有效降低网络负载。
再次，本文对移动对等覆盖网在扰动情况下的性能评价体系进行构建，并遵循这一评价体系，在指数扰动模型和KAD扰动模型下对多种覆盖网进行性能评估。本文进一步对基于频度度量的扰动评估模型进行研究，通过加入影响网络扰动的间接因素使扰动评估模型能够更加真实的反映实际的网络扰动情况。结合模拟器的实验结果和多项式曲线拟合方法，本文提出一个适合任何移动对等覆盖网使用的估算扰动评估公式参数权值的方法。
最后，本文基于改进的遗传算法对移动对等覆盖网络参数进行自动模拟优化，以提高移动对等覆盖网络的性能。为了克服经典遗传算法的全局优化效率差和易发生“早熟”现象的缺点，通过计算个体之间的相似度来减少不必要的交叉操作，并提高相似度低的个体之间进行交叉操作的概率。利用自动模拟优化算法来实现对模拟器的配置文件修改、源代码修改和编译、运行等过程的全自动运行，从而提高优化的效率和可靠性。
本文的研究工作围绕移动对等覆盖网的关键技术展开，其中涉及到的网络构建、数据分发、性能评估以及性能优化为今后的研究工作奠定了良好的理论基础和实验数据基础。
The demand for mobile peer-to-peer technology becomes much stronger because mobilenetworks are developed quickly, and mobile equipment and applications are more widely used.Mobile P2P overlays can shield the difference among the network routing protocols and themarks and addresses of physical equipment, and provide services for stable topology, loadbalance, and resources search etc. The structure of mobile P2P overlays directly determinesthe scalability, robust, security, and churn-resistance of the mobile P2P systems. Therefore theresearch of mobile P2P overlays is of great significance and application value. Although therehave been some mobile peer-to-peer overlays proposed, they get poor performance andchurn-resistance, which make them difficult to get practical application. Based on the existingresearch results, construction, evaluation, and optimization are intensively studied to solvesome problems in the research of mobile P2P overlays.
By analyzing a variety of traditional peer-to-peer overlays with the basic principle andtopology structure, this thesis further expounds why the traditional P2P overlays can notcompletely adapt to the mobile networks. The concept of mobile P2P overlays is illustrated,and the existing mobile peer-to-peer overlays are analyzed and compared in detail. Thenetwork simulators are compared and chosen for the method validation and performanceevaluation of mobile P2P overlays.
Firstly, the thesis proposes a mobile P2P overlay under the basis of the above mentionedresearch. The overlay constructs k-clique communities with different k value according to theorder of each node joining the overlay, uses contact nodes to link distinct k-cliquecommunities, and designs corresponding algorithms for joining, leaving and crashing of thenodes and construction of k-cliques. Meanwhile, it keeps adjusting the topology of the overlayby using topology control process and inter-clique connection processes to improveself-adaption for change of physical network topology and to increase the churn-resistanceability by combining data redundancy and proactive detection of failure nodes.
Secondly, in order to realize the effective transmission of topology control informationand to maintain replica consistency of the node resource lists, the thesis researches on the datadissemination mechanism based on mobile P2P overlays. The appropriate data dissemination method is chosen according to the characteristics as resource-constrained nodes and linkinstability in mobile networks, and is improved based on the mobile P2P overlay topologystructure. By taking on the strategy as dynamic adjusting the dissemination probability ofnodes with different state, the dissemination probability of unstable nodes are added, whichmakes sure that the data can be disseminated to all the target nodes in a relatively short periodof time, the efficiency of data dissemination under churn is enhanced, and the network load iseffectively reduced.
Thirdly, the performance evaluation model of mobile P2P overlays under churn isconstructed. Follow the model, performance of several overlays are evaluated under bothexponential churn model and KAD churn model. Furthermore, how to improve the existingchurn evaluation model based on frequency measurement is studied; by adding the indirectfactors influencing network churn, the improved churn evaluation model can more reallyreflect the actual network churn situation. By combination of simulation results andpolynomial fitting method, this thesis studies the parameter weights estimation method whichcan be used in any mobile P2P overlays.
Lastly, parameters of mobile P2P overlays are optimized based on improved geneticalgorithm and automatic simulation to improve the performance of mobile peer-to-peeroverlays. In order to overcome the poor efficiency of the global optimization and classical"premature" phenomenon occurred in genetic algorithm, unnecessary crossover operations arereduced by computing the degree of similarity between individuals, and individuals with lowersimilarity degree get the greater probability of crossover operation between them. Automaticsimulation optimization is used to modify the simulator configuration file and the source codeand to compile and run automatically so as to improve the efficiency and reliability of theoptimization.
Research of this thesis addresses the key technologies of mobile peer-to-peer network,which involves the network construction, data dissemination, performance evaluation andoptimization of network parameters, these researches lays a good theoretical basis andexperimental data base for future studies.
引文
[1] Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, andBalakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications.IEEE/ACM Transactions on Networking.2003,11(1):17-32
[2] Rowstron A and Druschel P. Pastry: Scalable, distributed object location and routing forlarge-scale peer-to-peer systems. The18th IFIP/ACM Int’l Conf. on Distributed SystemsPlatforms (Middleware2001), Berlin, Germany,2001.329-350
[3] Ratnasamy S, Francis P, Handley M, Karp R, and Shenker S. A scalablecontent-addressable network. The ACM SIGCOMM, New York, USA,2001.161-172
[4] Petar Maymounkov and David Mazieres. Kademlia: a peer to peer information systemsbased on the XOR metric. Lecture Notes in Computer Science.2002,2429:53-65
[5] Dahlia M, Moni N, amd David R. Viceroy: a scalable and dynamic emulation of thebutterfly. The Twenty-First Annual Symposium on Principles of Distributed Computing,2002.183-192
[6] F Kaashoek and DR Karger. Koorde: a simple degree-optimal Hash table. Internationalworkshop on Peer-To-Peer Systems (IPTPS), Berkeley, CA, USA,2003.98-107
[7] H Shen, C Xu, and G Chen. Cycloid: a scalable constant-degree P2P overlay network.Performance Evaluation.2006,63(3):195-216
[8] J rg E, Rüdiger S, Stefan Z, and Gerald K. Structured P2P networks in mobile and fixedenvironments. International Working Conference on Performance Modeling andEvaluation of Heterogeneous Networks (HET-NETs’04),2004.T4:1-25
[9]牛新征,周明天,余垄.一种应用于移动P2P网络的资源协作共享策略.电子学报.2010,38(1):18-24
[10]Han DD and Zhang J. An optimized Gnutella-like P2P protocol in mobile networks.Journal of Networks.2012,7(9):1464-1471
[11]Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker.Making Gnutella-like P2P systems scalable. Conference on Applications, Technologies,Architectures, and Protocols for Computer Communications,2003.407-418
[12]Li T, Ji H, Mei J, Li Y, and Hu C. Topology mismatch avoidable cross-layer protocol forP2P file discovery in MANETs. IEEE Wireless Communications and NetworkingConference (WCNC2009), Piscataway, NJ, USA,2009.2943-2947
[13]Shah N and Depei Q. A new cross-layer unstructured P2P file sharing protocol overmobile ad hoc network. International Conference on Advances in Computer Science andInformation Technology, Miyazaki, Japan,2010.250-263
[14]Shah N, Depei Q, and Rui W. An efficient unstructured P2P overlay for file sharing overMANET using underlying reactive routing. Ksii Transactions on Internet and InformationSystems.2010,4(5):799-818
[15]Mawji A and Hassanein H. P2P overlay topology control in MANETs. IEEE InternationalSymposium on "A World of Wireless, Mobile and Multimedia Networks"(WoWMoM).Montreal, Canada,2010.1-9
[16]Fabrikant A, Luthra A, Maneva E, Papadimitriou CH, and Shenker S. On a networkcreation game. The Twenty-Second Annual Symposium on Principles of DistributedComputing, Boston, USA,2003.347-351
[17]Afzal M, Hossam H, and Xiangyang Z. Peer-to-peer overlay topology control for mobilead hoc networks. Pervasive and Mobile Computing.2011,7(4):467-478
[18]Gabriele M, Gianluca M, Marco R, and Giacomo T. Self-organizing mobile meshnetworks with peer-to-peer routing and information search services.3rd InternationalConference on Advances in Mesh Networks, Italy,2010.17-22
[19]Giang NH, Hung NC, Khang NV, Thu LTX, Thang NM, and Vinh VT. Performanceimprovement of Chord Distributed Hash Table under high churn rate. InternationalConference on Advanced Technologies for Communications,2009.191-196
[20]Shiguo W and Hong J. Realization of topology awareness in peer-to-peer wirelessnetwork.5th International Conference on Wireless Communications, Networking andMobile Computing, Beijing, China,2009.1-4
[21]Sonia GF and Habib Y. Locality-aware Chord over mobile Ad Hoc networks. GlobalInformation Infrastructure Symposium,2009.1-6
[22]Perkin CE and Royer EM. Ad-hoc on-demand distance vector routing. Second IEEEWorkshop on Mobile Computing Systems and Applications,1999.90-100
[23]TS Eugene N and Hui Z. Predicting Internet network distance with coordinates-basedapproaches. Twenty-First Annual Joint Conference of the IEEE Computer andCommunications Societies,2002.170-179
[24]TSE Ng and H Zhang.Towards global network positioning. The1st ACM SIGCOMMWorkshop on Internet Measurement, New York, USA,2001.25-29
[25]Nishihara Y, Yokota Y, and Okubo E. A technique for construction of overlay networks forMANETs with consideration of physical network topologies. First InternationalConference on Advances in P2P Systems,2009.66-71
[26]Gouvas P, Zafeiropoulos A, Liakopoulos A, Mentzas G, and Mitrou, N. Integrating overlayprotocols for providing autonomic services in mobile Ad-hoc networks. IEICETransactions on Communications.2010, E93B (8):2022-2034
[27]Jelasity M and Babaoglu O. T-Man: gossip-based overlay topology management. LectureNotes in Computer Science.2006,3910:1-15
[28]Johnson DB and Maltz DA. Dynamic source routing in ad hoc wireless networks. MobileComputing.1996,153-181
[29]Gouvas P, Bouras T, Zafeiropoulos, and Liakopoulos. Ubi-chord: services provision indynamic networks based on p2p protocols.18th International Conference onTelecommunications,2011.375-380
[30]Thaalbi Mariem, Tabbane Nahil, Bejaoui Tarek, and Meddahi Ahmed. Enhancedbacktracking Chord protocol for mobile Ad hoc networks. International Conference onCommunications and Information Technology (ICCIT),2012.191-195
[31]Chang Jian-Ming, Lin Yi-Hsuan, Woungang Isaac, and Chao Han-Chieh. MR-Chord: ascheme for enhancing Chord lookup accuracy and performance in mobile P2P network.IEEE International Conference on Communications (ICC),2012.5408-5412
[32]Liu CL, Wang CY, and Wei HY. Cross-layer mobile chord P2P protocol design forVANET. International Journal of Ad Hoc and Ubiquitous Computing.2010,6(3):150-163
[33]Canali C, Renda ME, Santi P, and Burresi S. Enabling efficient peer-to-peer resourcesharing in wireless mesh networks. IEEE Transactions on Mobile Computing.2010,9:333-347
[34]Lidan S, Xiaolong Z, Ping W, Gang C, and Jinxiang D. Supporting multi-dimensionalqueries in mobile P2P network. Information Sciences.2011,181:2841-2857
[35]Mohammad Zulhasnine, Changcheng Huang, and Anand Srinivasan. Topology-awareintegration of cellular users into the P2P system. IEEE Vehicular Technology Conference(VTC Fall),2011.1-5
[36]Mohammad Zulhasnine, Changcheng Huang, and Anand Srinivasan. Towards an effectiveintegration of cellular users to the structured Peer-to-Peer network. Peer-to-PeerNetworking and Applications.2012,5(2):178-192
[37]Marcello C and Luigi P. P2P over MANET: indirect tree-based routing. IEEEInternational Conference on Pervasive Computing and Communications,2009.1-5
[38]Caleffi M, Ferraiuolo G, and Paura L. Augmented tree-based routing protocol for scalablead hoc networks. IEEE International Conference on Mobile Adhoc and Sensor Systems,2007.1-6
[39]Nadir S and Depei Q. An efficient structured P2P overlay over MANET. The Ninth ACMInternational Workshop Data Engineering for Wireless and Mobile Access,2010.57-64
[40]彭利民，肖文俊．一种具有常数度的无线P2P覆盖网.四川大学学报（工程科学版）.2011,43(4):124-130
[41]Jing-qing Mei, Hong Ji, and Yi Li. Query routing mismatch alleviation architecture forP2P file lookup in MANETs. The Journal of China Universities of Posts andTelecommunications.2011,18(4):111–117
[42]Hui Zhou and Jie Yang. Spiralchord: a space-filling curve based location awareness,cross-layering P2P file sharing system in WMNs. The Journal of China Universities ofPosts and Telecommunications.2012,19(3):44–53
[43]Ying Z, Guiran C, and Jie J. Topology optimization of mobile P2P Ad Hoc networks. FirstInternational Conference on Pervasive Computing, Signal Processing and Applications,2010.323-327
[44]Li X and Ji H. Scalable peer-to-peer resource discovering scheme for wirelessself-organized networks. Journal of China Universities of Posts and Telecommunications.2009,16(2):47-52,57
[45]唐朝伟，陈宏旦，邵艳清，唐晖.移动P2P环境下考虑物理位置的分层Chord算法.华中科技大学学报（自然科学版）.2010,38(8):21-24
[46]李致远，王汝传.移动P2P网络安全拓扑构造协议.通信学报.2010,31(10):146-157
[47]王仕果，纪红.具有动态拓扑感知的无线自组对等网.控制与决策.2010,25(4):619-622
[48]He Li, KyoungSoo Bok, and JaeSoo Yoo. A cluster based mobile Peer to Peer Architecturein Wireless Ad Hoc Networks. The20th ACM international conference on Informationand knowledge management,2011.2393-2396
[49]Christian Gottron, Andre Konig, and Ralf Steinmetz. A Cluster-Based Locality-AwareMobile Peer-to-Peer Architecture. The8th International Workshop on Mobile Peer-to-PeerComputing,2012.643-648
[50]Nayeem Golam Moktader, Habib Md Ahsan, and Daiyan Golam Moktader. A newefficient approach for peer-to-peer file searching in mobile ad-hoc network. InternationalJournal of Computer Science Issues.2012,9(2-3):321-327
[51]Tsao SL and Cheng CM. Design and evaluation of a two-tier peer-to-peer trafficinformation system. IEEE Communications Magazine.2011,49:165-172
[52]Sichitiu MC and Kihl M. Inter-vehicle communication systems: a survey. IEEE Commun.Surveys&Tutorials.2008,10(2):88-105
[53]Amis AD, Prakash R, Vuong THP, and Huynh DT. Max-min d-cluster formation inwireless ad hoc networks.19th Annual Joint Conference of the IEEE Computer andCommunications Societies,2000.1:32-41
[54]Galluccio L,Morabito G,Palazzo S,Pellegrini M,Renda ME, and Santi P. Georoy: Alocation-aware enhancement to Viceroy peer-to-peer algorithm. Computer Networks.2007,51:1998-2014
[55]Dahlia M, Moni N, and David R. Viceroy: a scalable and dynamic emulation of thebutterfly. The twenty-first annual symposium on Principles of distributed computing,2002.183-192
[56]Galluccio L, Palazzo S, and Rametta C. On the efficiency and trustworthiness ofDHT-based P2P search algorithms in mobile wireless networks. International Conferenceon Ultra Modern Telecommunications Workshops,2009.1-8
[57]文吉刚,谢鲲,谢高岗,张广兴,李仁发.基于分簇P2P的多跳无线mesh网络资源检索与分发算法.通信学报.2012,11:128-135
[58]欧中洪,宋美娜,战晓苏,宋俊德.移动对等网络关键技术.软件学报.2008,19(2):404-418
[59]Brent Chun, David Culler, Timothy Roscoe, Andy Bavier, Larry Peterson, MikeWawrzoniak, and Mic Bowman. PlanetLab: an overlay testbed for broad-coverageservices. ACM SIGCOMM Computer Communication Review.2003,33(3):3-12
[60]NS-2. http://nsnam.isi.edu/nsnam/index.php/Main_Page,2011.
[61]OMNeT++. http://www.omnetpp.org/,2010.
[62]GF Riley. Large-scale network simulations with gtnets. Winter Simulation Conference,2003.676-684
[63]OPNET. http://www.opnet.com,2013.
[64]J-Sim.http://www.j-sim.zcu.cz/,2006.
[65]GloMoSim. http://pcl.cs.ucla.edu/projects/glomosim/,1999.
[66]NS-3. http://www.nsnam.org/,2011.
[67]SSFNet. http://www.ssfnet.org/homePage.html,2004.
[68]Thomer M Gil, et al.http://pdos.csail.mit.edu/p2psim/,2005.
[69]PeerSim. http://peersim.sourceforge.net/,2005.
[70]Qi He, et al.http://www.cc.gatech.edu/computing/compass/gnutella/,2003.
[71]Ingmar Baumgart, Bernhard Heep, and Stephan Krause. OverSim: a flexible overlaynetwork simulation framework.10th IEEE Global Internet Symposium (GI '07) inconjunction with IEEE INFOCOM,2007.79-84
[72]Nyik San Ting and Ralph Deters.3LS: a peer-to-peer network simulator. The thirdinternational conference on peer-to-peer computing,2003.212-213
[73]Joseph S. NeuroGrid: semantically routing queries in peer-to-peer networks. Internationalworkshop on peet-to-peer computing,2002.202-214
[74]He Q, Ammar M, and Riley G. Mapping peer behavior to packet-level details: apramework for packet-level simulation of peer-to-peer systems.11th IEEE/ACMInternational Symposium on Modeling, Analysis and Simulation of ComputerTelecommunications Systems,2003.71-78
[75]Schlosser MT, Condie TE, and Kamvar SD. Simulating a P2P pile2sharing network.1stWorkshop on Semantics in Peer-to-Peer and Grid Computing12th International WorldWide Web Conference, USA,2002.69-80
[76]Pedro Garcial, Carles Pairo, and Rubén Mondéjar. PlanetSim: a new overlay networksimulation framewok. Software Engineering and Middleware.2005,123-136
[77]Yang W and Abu-Ghazaleh N. GPS: a general peer-to-peer simulator and its use formodeling bittorrent.13th IEEE International Symposium on Modeling, Analysis, andSimulation of Computer and Telecommunication Systems,2005.425-434
[78]Giuli TJ and Baker M Narses: a scalable plow-pased network simulator.http://arxiv.org/abs/cs/0211024,2002.
[79]Kant K and Iyer R. Modeling and simulation of adhoc/P2P resource sharing networks.The13th international conference on modelling techniques and tools for computerperformance evaluation, USA,2003.1-27
[80]Overlay Weaver.http://overlayweaver.sourceforge.net,2003.
[81]Merugu S, Sridhar Srinivasan ZE. P-sim: a simulator for peer-to-peer networks. The11thIEEE/ACM International Symposium on Modeling, Analysis and Simulation of ComputerTelecommunication Systems (MASCOTS),2003.213-218
[82]Shi G Y, Long YS, Gong H, et al. HiFiP2P: the simulator capable of massive nodes andmeasured underlay. IEEE International conference on Performance, Computing andCommunications, Austin, USA,2008.311-318
[83]TTA Dinh, M Lees, G Theodoropoulos, and R Minson. Large scale distributed simulationof P2P networks.2nd International Workshop on Modeling, Simulation, and Optimizationof Peer-to-peer Environments (MSOP2P),2008.499-507
[84]George K Papaloukopoulos and Evangelos Sakkopoulos. D-P2P-SIM. http://code.Google.com/p/d-P2P-sim,2009.
[85]Stingl D, Gro C, Rückert J, et al. Peerfactsim.kom: A large scale simulation frameworkfor peer-to-peer systems. International Conference on High Performance Computing&Simulation,2011.577-584
[86]R. Duncan Luce and Albert D. Perry. A method of matrix analysis of group structure.Psychometrika.1949,14(2):95-116
[87]Luce R D. Connectivity and generalized cliques in sociometric group structure.Psychometrika,1950,15(2):169-190
[88]Richard D. Alba. A graph-theoretic definition of a sociometric clique. Journal ofMathematical Sociology.1973,3:113-126
[89]X. Liu and T. Murata. Advanced modularity-specialized label propagation algorithm fordetecting communities in networks. Physica A: Statistical Mechanics and its Applications.2010,389(7):1493-1500
[90]Marek Ciglan and Kjetil N rv g.Fast detection of size-constrained communities in largenetworks. Lecture Notes in Computer Science.2010,6488:91-104
[91]Ian XY Leung, Pan Hui, Pietro Liò, and Jon Crowcroft.Towards real-time communitydetection in large networks. Physical Review E.2009,79(6):66-107
[92]Demers A, Greene D, Hauser C, et al. Epidemic algorithms for replicated databasemaintenance. The6thACM Symposiums on Principles of DistributedComputing,1987.1-12
[93]Kermarrec A-M and van Steen M. Gossiping in distributed systems. ACM SIGOPSOperating Systems Review.2007,41(5):2-7
[94]Gavidia D, Voulgaris S, and van Steen M. A gossip-based distributed news service forwireless mesh networks. Third International Conference on Wireless On-demand NetworkSystems&Services (WONS),2006.59-67
[95]Gabriele G, Ernesto D, Guido LC, and Paulius D. Gossiping solutions for distributedconsensus on unstructured overlays. The4thIEEE International Conference on DigitalEcosystems and Technologies,2010.246-251
[96]Da Hora, Diego N, Macedo, Daniel F, Oliveira, Leonardo B, et al. Enhancing peer-to-peercontent discovery techniques over mobile ad hoc networks. ComputerCommunications.2009,32(13-14):1445-1459
[97]Jin Yang, Simon T, Mueller C, Klan D, and Sattler KU. Comparing and refining gossipprotocols for fault tolerance in wireless P2P systems. The19th Euromicro InternationalConference on Parallel, Distributed and Network-Based Processing (PDP),2011,595-599
[98]Drabkin V, Friedman R, Kliot G, and Segal M. RAPID: reliable probabilisticdissemination in wireless ad-hoc networks.The26th IEEE International Symposium onReliable Distributed Systems,2007.13-22
[99]刘德辉，尹刚，王怀民，邹鹏. Chord网络环境下的Gossip算法.计算机工程与科学.2011,33(9):48-51
[100]汪洋,陈京文,黑晓军,程文青.混合内容分发网中社群感知的Gossip协议.北京邮电大学学报.2010,33(5):18-21,46
[101]Chen Nao, Hu Ruimin, and Zhu Yongqiong. Gossip-based topology managementprotocol for self-organizing overlays. China Communications.2011,9:38-46
[102]Andras K and Vilmos S. Adaptive multihop broadcast protocols for ad hoc networks. The8th IEEE, IET International Symposium on Communication Systems, Networks andDigital Signal Processing,2012.1-6
[103]Bailey NT J．The mathematical theory of infectious diseases and its applications (secondedition)．Hafner Press，1975.
[104]Johnson Db and Maltz DA. Dynamic source routing in ad hoc wireless networks. MobileComputing.1996,153-181
[105]Yao Z, Leonard D, Wang X, and Loguinov D. Modeling heterogeneous user churn andlocal resilience of unstructured P2P networks. IEEE International Conference on NetworkProtocols (ICNP),2006.32-41
[106]Li C and Chen C. On Gnutella topology dynamics by studying leaf and ultra connectionjointly in phase space. Computer Networks.2008,52(3):695-719
[107]Liu Z, Yuan R, Li Z, Li H, and Chen G Survive under high churn in structured P2Psystems: evaluation and strategy. Lecture Notes of Computer Science.2006,3994:404-411
[108]Zhao B, Kubiatowicz J, and Joseph AD.Tapestry: a fault-tolerant wide-area applicationinfrastructure. Computer Communication Review.2002,32(1):81
[109]Gupta I, Birman KP, Linga P, Demers AJ, and Renesse R. Kelips: building an efficientand stable P2P DHT through increased memory and background overhead. Lecture Notesin Computer Science.2003,2735:160-169
[110]Kaashoek MF and Karger R (2003) Koorde: A simple degree-optimal distributed hashtable. Lecture Notes in Computer Science.2003,2735:98-107
[111]Huang Q, Li Z, Lu C, and Wang W. Analyzing the cost of DHT handling churn.Journal ofComputer Research and Development.2008,45(suppl.):409-414
[112]Krishnamurthy S, El-Ansary S, Aurell E, and Haridi S. An analytical study of astructured overlay in the presence of dynamic membership. IEEE/ACM Transacitons onNetworking.2008,16(4):814-825
[113]Van Kampen NG. Stochastic processes in physics and chemistry.1981.
[114]Herrera O and Znati T. Modeling churn in P2P networks. The40th Annual SimulationSymposium(ANSS),2007.33-40
[115]Anceaume E, Ludinard R, and Sericola B. Analytic study of the impact of churn incluster-based structured P2P overlays. IEEE International Conference onCommunications(ICC),2010.1-5
[116]Kassinen O, Harjula E, Korhonen J, and Ylianttila M. Battery life of mobile peers withUMTS and WLAN in a kademlia-based P2P overlay. IEEE20th InternationalSymposium on Personal, Indoor and Mobile Radio Communications,2009.662-665
[117]Ou Z, Harjula E, Kassinen O, and Ylianttila M. Performance evaluation of aKademlia-based communication-oriented P2P system under churn. Computer Networks.2010,54(5):689-705
[118]Ou Z, Harjula E, Kassinen O, and Ylianttila M. Feasibility evaluation of acommunication-oriented P2P system in mobile environments. The6th InternationalConference on Mobile Technology, Application&Systems,2009.1-8
[119]Kassinen O, Harjula E, and Ylianttila M. Analysis of messaging load in a P2PP overlaynetwork under churn. Global Telecommunications Conference,2010.1-5
[120]Baset S, Schulzrinne H, and Matuszewski M. Peer-to-Peer Protocol (P2PP).http://tools.ietf.org/id/draft-baset-p2psipp2pp-01.txt.
[121]Wu D, Tian Y, Ng KW, and Datta A. Stochastic analysis of the interplay between objectmaintenance and churn. Computer Communications.2008,31(2):220-239
[122]Yang D, Zhang Y, Zhang H, Wu TY, and Chao HC. Multi-factors oriented study of P2PChurn. International Journal of Communication Systems.2009,22(9):1089-1103
[123]Brighten P, Shenker S, and Stoica I. Minimizing churn in distributed Systems. ACMSIGCOMM,2006.147-158.
[124]Kennedyj and Eberhart R C. Particle swarm optimization. IEEE International Conferenceon Neural Networks, Piscataway, NJ, USA,1995.1942-1948
[125]梁艳春，吴春国，时小虎，葛宏伟.群智能优化算法理论与应用.科学出版社，2009.
[126]梁旭，黄明.现代智能优化混合算法及其应用.电子工业出版社，2011.
[127]Dorigo M. Optimization,learning and natural algorithms(in Italian). PhD thesis.1992:140
[128]Mahmood Fathya, Kaamran Rahemifarb, Hamideh Babaeic, Morteza romoozic, andReza Berangy. Impact of mobility on performance of P2P content discovery protocols overMANET. Procedia Computer Science.2012,10:642-649
[129]JA Fernandez-Prieto, J Canada-Bago, MA Gadeo-Martos, and Juan R Velasco.Optimisation of control parameters for genetic algorithms to test computer networks underrealistic traffic loads. Applied Soft Computing.2012,12:1875-1883
[130] Javid Taheri, Shaghayegh Sharif, Xing Penju, and Albert Y. Zomaya. Paralleled geneticalgorithm for solving the knapsack problem in the cloud. Seventh International Conference onP2P, Parallel, Grid, Cloud and Internet Computing,2012.303-308
[131]邱国庆，解文彬，徐勋利，廖伟，王多点.运输任务分配与路径选择的组合优化模型.计算机工程.2011,177-179,182
[132] Claudio Risso, Sergio Nesmachnow, and Franco Robledo. A parallel evolutionaryalgorithm for multilayered robust network design. Seventh International Conference on P2P,Parallel, Grid, Cloud and Internet Computing,2012.291-296
[133] Fatos Xhafa，Joanna Ko odziej，and Leonard Barolli. Evaluation of hybridization of GAand TS Algorithms for independent batch scheduling in computational grids. InternationalConference on P2P, Parallel, Grid, Cloud and Internet Computing,2011.148-155
[134]Rifat Sonmez and Onder Halis Bettemir. A hybrid genetic algorithm for the discretetime-cost trade-off problem. Expert Systems with Applications.2012,39:11428–11434
[135]K Ronasi, MH Firooz, MR Pakravan, and AN Avanaki. A fast algorithm for constructionof minimum delay multicast trees in P2P networks. International Symposium onCommunications and Information Technologies,2006.137-142
[136]Tiejun Wu, Maozhen Li, Mahesh Ponraj, and Man Qi. A genetic algorithm based peerselection strategy for BitTorrent networks. World Congress on Nature&Biologically InspiredComputing (NaBIC),2009.336-341
[137]Jin Qi, Shunyi Zhang, Ling Tan, Yanfei Sun, and Lu Cao. A novel support vectormachine awareness model based on genetic algorithm optimization for peer-to-peer networktraffic. International Journal of Digital Content Technology and its Applications(JDCTA).2012,6(2):128-136
[138]Mehdi Mohammadi, Bijan Raahemi, Ahmad Akbari, Hossein Moeinzadeh, BabakNasersharif. Genetic-based minimum classification error mapping for accurate identifyingpeer-to-peer applications in the internet traffic. Expert Systems with Applications.2011,38:6417-6423
[139] Chithra Selvaraj and Sheila Anand. Peer profile based trust model for P2P systems usinggenetic algorithm. Peer-to-Peer Networking and Applications.2012,5:92-103
[140] Jaymin Kessler, Khaled Rasheed, and I. Budak Arpinar. Using genetic algorithms toreorganize superpeer structure in peer to peer networks. Applied Intelligence.2007,26:35-52
[141] Hengheng Xie, Azzedine Boukerche, and Ming Zhang. A formalized approach fordesigning a P2P-based dynamic load balancing scheme. Concurrency and Computation:Practice and Experience.2010,22:1223-1239
[142] Guimin Huang, Changliang Li, Ya Zhou, and Chenzhong Bin. Data scheduling strategyin P2P VoD system based on genetic algorithm. Third International Conference on MultimediaInformation Networking and Security,2011.128-131
[143]Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo Liu, and Millie Pant.Multi-objective peer-to-peer neighbor-selection strategy using genetic algorithm. LectureNotes in Computer Science.2007,4873:443-451
[144]Fu Xiao-ling and Xu Ying. A load balance algorithm for hybrid P2P network model.International Colloquium on Computing, Communication, Control, and Management,2008.236-239
[145]Oh Chan Kwon, Hwangjun Song, and Tai-Won Um. A robust P2P video multicaststreaming system under high peer-churn rate. IEEE13th International Conference onCommunication Technology,2011.843-848
[146]Jun Tan, Xingshu Chen, and Min Du. A novel P2P identification algorithm based ongenetic algorithm and particle swarm optimization.3rd International Symposium on ParallelArchitectures, Algorithms and Programming,2010.22-29
[147]Mohammad Zulhasnine, Changcheng Huang, and Anand Srinivasan. Penalty functionmethod for peer selection over wireless mesh network. IEEE Vehicular TechnologyConference,2010.1-5
[148]刘晶晶，黄明，梁旭.改进的病毒进化遗传算法应用研究.大连交通大学学报.2009,30(2):82-85
[149]黄明，宫旭德，梁旭.改进的DNA免疫遗传算法在车间调度中的应用.化工自动化及仪表.2009,36(2):14-18
[150]蔡良伟，李霞.遗传算法交叉操作的改进.系统工程与电子技术.2006,28(6):925-928
[2] Rowstron A and Druschel P. Pastry: Scalable, distributed object location and routing forlarge-scale peer-to-peer systems. The18th IFIP/ACM Int’l Conf. on Distributed SystemsPlatforms (Middleware2001), Berlin, Germany,2001.329-350
[3] Ratnasamy S, Francis P, Handley M, Karp R, and Shenker S. A scalablecontent-addressable network. The ACM SIGCOMM, New York, USA,2001.161-172
[4] Petar Maymounkov and David Mazieres. Kademlia: a peer to peer information systemsbased on the XOR metric. Lecture Notes in Computer Science.2002,2429:53-65
[5] Dahlia M, Moni N, amd David R. Viceroy: a scalable and dynamic emulation of thebutterfly. The Twenty-First Annual Symposium on Principles of Distributed Computing,2002.183-192
[6] F Kaashoek and DR Karger. Koorde: a simple degree-optimal Hash table. Internationalworkshop on Peer-To-Peer Systems (IPTPS), Berkeley, CA, USA,2003.98-107
[7] H Shen, C Xu, and G Chen. Cycloid: a scalable constant-degree P2P overlay network.Performance Evaluation.2006,63(3):195-216
[8] J rg E, Rüdiger S, Stefan Z, and Gerald K. Structured P2P networks in mobile and fixedenvironments. International Working Conference on Performance Modeling andEvaluation of Heterogeneous Networks (HET-NETs’04),2004.T4:1-25
[9]牛新征,周明天,余垄.一种应用于移动P2P网络的资源协作共享策略.电子学报.2010,38(1):18-24
[10]Han DD and Zhang J. An optimized Gnutella-like P2P protocol in mobile networks.Journal of Networks.2012,7(9):1464-1471
[11]Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker.Making Gnutella-like P2P systems scalable. Conference on Applications, Technologies,Architectures, and Protocols for Computer Communications,2003.407-418
[12]Li T, Ji H, Mei J, Li Y, and Hu C. Topology mismatch avoidable cross-layer protocol forP2P file discovery in MANETs. IEEE Wireless Communications and NetworkingConference (WCNC2009), Piscataway, NJ, USA,2009.2943-2947
[13]Shah N and Depei Q. A new cross-layer unstructured P2P file sharing protocol overmobile ad hoc network. International Conference on Advances in Computer Science andInformation Technology, Miyazaki, Japan,2010.250-263
[14]Shah N, Depei Q, and Rui W. An efficient unstructured P2P overlay for file sharing overMANET using underlying reactive routing. Ksii Transactions on Internet and InformationSystems.2010,4(5):799-818
[15]Mawji A and Hassanein H. P2P overlay topology control in MANETs. IEEE InternationalSymposium on "A World of Wireless, Mobile and Multimedia Networks"(WoWMoM).Montreal, Canada,2010.1-9
[16]Fabrikant A, Luthra A, Maneva E, Papadimitriou CH, and Shenker S. On a networkcreation game. The Twenty-Second Annual Symposium on Principles of DistributedComputing, Boston, USA,2003.347-351
[17]Afzal M, Hossam H, and Xiangyang Z. Peer-to-peer overlay topology control for mobilead hoc networks. Pervasive and Mobile Computing.2011,7(4):467-478
[18]Gabriele M, Gianluca M, Marco R, and Giacomo T. Self-organizing mobile meshnetworks with peer-to-peer routing and information search services.3rd InternationalConference on Advances in Mesh Networks, Italy,2010.17-22
[19]Giang NH, Hung NC, Khang NV, Thu LTX, Thang NM, and Vinh VT. Performanceimprovement of Chord Distributed Hash Table under high churn rate. InternationalConference on Advanced Technologies for Communications,2009.191-196
[20]Shiguo W and Hong J. Realization of topology awareness in peer-to-peer wirelessnetwork.5th International Conference on Wireless Communications, Networking andMobile Computing, Beijing, China,2009.1-4
[21]Sonia GF and Habib Y. Locality-aware Chord over mobile Ad Hoc networks. GlobalInformation Infrastructure Symposium,2009.1-6
[22]Perkin CE and Royer EM. Ad-hoc on-demand distance vector routing. Second IEEEWorkshop on Mobile Computing Systems and Applications,1999.90-100
[23]TS Eugene N and Hui Z. Predicting Internet network distance with coordinates-basedapproaches. Twenty-First Annual Joint Conference of the IEEE Computer andCommunications Societies,2002.170-179
[24]TSE Ng and H Zhang.Towards global network positioning. The1st ACM SIGCOMMWorkshop on Internet Measurement, New York, USA,2001.25-29
[25]Nishihara Y, Yokota Y, and Okubo E. A technique for construction of overlay networks forMANETs with consideration of physical network topologies. First InternationalConference on Advances in P2P Systems,2009.66-71
[26]Gouvas P, Zafeiropoulos A, Liakopoulos A, Mentzas G, and Mitrou, N. Integrating overlayprotocols for providing autonomic services in mobile Ad-hoc networks. IEICETransactions on Communications.2010, E93B (8):2022-2034
[27]Jelasity M and Babaoglu O. T-Man: gossip-based overlay topology management. LectureNotes in Computer Science.2006,3910:1-15
[28]Johnson DB and Maltz DA. Dynamic source routing in ad hoc wireless networks. MobileComputing.1996,153-181
[29]Gouvas P, Bouras T, Zafeiropoulos, and Liakopoulos. Ubi-chord: services provision indynamic networks based on p2p protocols.18th International Conference onTelecommunications,2011.375-380
[30]Thaalbi Mariem, Tabbane Nahil, Bejaoui Tarek, and Meddahi Ahmed. Enhancedbacktracking Chord protocol for mobile Ad hoc networks. International Conference onCommunications and Information Technology (ICCIT),2012.191-195
[31]Chang Jian-Ming, Lin Yi-Hsuan, Woungang Isaac, and Chao Han-Chieh. MR-Chord: ascheme for enhancing Chord lookup accuracy and performance in mobile P2P network.IEEE International Conference on Communications (ICC),2012.5408-5412
[32]Liu CL, Wang CY, and Wei HY. Cross-layer mobile chord P2P protocol design forVANET. International Journal of Ad Hoc and Ubiquitous Computing.2010,6(3):150-163
[33]Canali C, Renda ME, Santi P, and Burresi S. Enabling efficient peer-to-peer resourcesharing in wireless mesh networks. IEEE Transactions on Mobile Computing.2010,9:333-347
[34]Lidan S, Xiaolong Z, Ping W, Gang C, and Jinxiang D. Supporting multi-dimensionalqueries in mobile P2P network. Information Sciences.2011,181:2841-2857
[35]Mohammad Zulhasnine, Changcheng Huang, and Anand Srinivasan. Topology-awareintegration of cellular users into the P2P system. IEEE Vehicular Technology Conference(VTC Fall),2011.1-5
[36]Mohammad Zulhasnine, Changcheng Huang, and Anand Srinivasan. Towards an effectiveintegration of cellular users to the structured Peer-to-Peer network. Peer-to-PeerNetworking and Applications.2012,5(2):178-192
[37]Marcello C and Luigi P. P2P over MANET: indirect tree-based routing. IEEEInternational Conference on Pervasive Computing and Communications,2009.1-5
[38]Caleffi M, Ferraiuolo G, and Paura L. Augmented tree-based routing protocol for scalablead hoc networks. IEEE International Conference on Mobile Adhoc and Sensor Systems,2007.1-6
[39]Nadir S and Depei Q. An efficient structured P2P overlay over MANET. The Ninth ACMInternational Workshop Data Engineering for Wireless and Mobile Access,2010.57-64
[40]彭利民，肖文俊．一种具有常数度的无线P2P覆盖网.四川大学学报（工程科学版）.2011,43(4):124-130
[41]Jing-qing Mei, Hong Ji, and Yi Li. Query routing mismatch alleviation architecture forP2P file lookup in MANETs. The Journal of China Universities of Posts andTelecommunications.2011,18(4):111–117
[42]Hui Zhou and Jie Yang. Spiralchord: a space-filling curve based location awareness,cross-layering P2P file sharing system in WMNs. The Journal of China Universities ofPosts and Telecommunications.2012,19(3):44–53
[43]Ying Z, Guiran C, and Jie J. Topology optimization of mobile P2P Ad Hoc networks. FirstInternational Conference on Pervasive Computing, Signal Processing and Applications,2010.323-327
[44]Li X and Ji H. Scalable peer-to-peer resource discovering scheme for wirelessself-organized networks. Journal of China Universities of Posts and Telecommunications.2009,16(2):47-52,57
[45]唐朝伟，陈宏旦，邵艳清，唐晖.移动P2P环境下考虑物理位置的分层Chord算法.华中科技大学学报（自然科学版）.2010,38(8):21-24
[46]李致远，王汝传.移动P2P网络安全拓扑构造协议.通信学报.2010,31(10):146-157
[47]王仕果，纪红.具有动态拓扑感知的无线自组对等网.控制与决策.2010,25(4):619-622
[48]He Li, KyoungSoo Bok, and JaeSoo Yoo. A cluster based mobile Peer to Peer Architecturein Wireless Ad Hoc Networks. The20th ACM international conference on Informationand knowledge management,2011.2393-2396
[49]Christian Gottron, Andre Konig, and Ralf Steinmetz. A Cluster-Based Locality-AwareMobile Peer-to-Peer Architecture. The8th International Workshop on Mobile Peer-to-PeerComputing,2012.643-648
[50]Nayeem Golam Moktader, Habib Md Ahsan, and Daiyan Golam Moktader. A newefficient approach for peer-to-peer file searching in mobile ad-hoc network. InternationalJournal of Computer Science Issues.2012,9(2-3):321-327
[51]Tsao SL and Cheng CM. Design and evaluation of a two-tier peer-to-peer trafficinformation system. IEEE Communications Magazine.2011,49:165-172
[52]Sichitiu MC and Kihl M. Inter-vehicle communication systems: a survey. IEEE Commun.Surveys&Tutorials.2008,10(2):88-105
[53]Amis AD, Prakash R, Vuong THP, and Huynh DT. Max-min d-cluster formation inwireless ad hoc networks.19th Annual Joint Conference of the IEEE Computer andCommunications Societies,2000.1:32-41
[54]Galluccio L,Morabito G,Palazzo S,Pellegrini M,Renda ME, and Santi P. Georoy: Alocation-aware enhancement to Viceroy peer-to-peer algorithm. Computer Networks.2007,51:1998-2014
[55]Dahlia M, Moni N, and David R. Viceroy: a scalable and dynamic emulation of thebutterfly. The twenty-first annual symposium on Principles of distributed computing,2002.183-192
[56]Galluccio L, Palazzo S, and Rametta C. On the efficiency and trustworthiness ofDHT-based P2P search algorithms in mobile wireless networks. International Conferenceon Ultra Modern Telecommunications Workshops,2009.1-8
[57]文吉刚,谢鲲,谢高岗,张广兴,李仁发.基于分簇P2P的多跳无线mesh网络资源检索与分发算法.通信学报.2012,11:128-135
[58]欧中洪,宋美娜,战晓苏,宋俊德.移动对等网络关键技术.软件学报.2008,19(2):404-418
[59]Brent Chun, David Culler, Timothy Roscoe, Andy Bavier, Larry Peterson, MikeWawrzoniak, and Mic Bowman. PlanetLab: an overlay testbed for broad-coverageservices. ACM SIGCOMM Computer Communication Review.2003,33(3):3-12
[60]NS-2. http://nsnam.isi.edu/nsnam/index.php/Main_Page,2011.
[61]OMNeT++. http://www.omnetpp.org/,2010.
[62]GF Riley. Large-scale network simulations with gtnets. Winter Simulation Conference,2003.676-684
[63]OPNET. http://www.opnet.com,2013.
[64]J-Sim.http://www.j-sim.zcu.cz/,2006.
[65]GloMoSim. http://pcl.cs.ucla.edu/projects/glomosim/,1999.
[66]NS-3. http://www.nsnam.org/,2011.
[67]SSFNet. http://www.ssfnet.org/homePage.html,2004.
[68]Thomer M Gil, et al.http://pdos.csail.mit.edu/p2psim/,2005.
[69]PeerSim. http://peersim.sourceforge.net/,2005.
[70]Qi He, et al.http://www.cc.gatech.edu/computing/compass/gnutella/,2003.
[71]Ingmar Baumgart, Bernhard Heep, and Stephan Krause. OverSim: a flexible overlaynetwork simulation framework.10th IEEE Global Internet Symposium (GI '07) inconjunction with IEEE INFOCOM,2007.79-84
[72]Nyik San Ting and Ralph Deters.3LS: a peer-to-peer network simulator. The thirdinternational conference on peer-to-peer computing,2003.212-213
[73]Joseph S. NeuroGrid: semantically routing queries in peer-to-peer networks. Internationalworkshop on peet-to-peer computing,2002.202-214
[74]He Q, Ammar M, and Riley G. Mapping peer behavior to packet-level details: apramework for packet-level simulation of peer-to-peer systems.11th IEEE/ACMInternational Symposium on Modeling, Analysis and Simulation of ComputerTelecommunications Systems,2003.71-78
[75]Schlosser MT, Condie TE, and Kamvar SD. Simulating a P2P pile2sharing network.1stWorkshop on Semantics in Peer-to-Peer and Grid Computing12th International WorldWide Web Conference, USA,2002.69-80
[76]Pedro Garcial, Carles Pairo, and Rubén Mondéjar. PlanetSim: a new overlay networksimulation framewok. Software Engineering and Middleware.2005,123-136
[77]Yang W and Abu-Ghazaleh N. GPS: a general peer-to-peer simulator and its use formodeling bittorrent.13th IEEE International Symposium on Modeling, Analysis, andSimulation of Computer and Telecommunication Systems,2005.425-434
[78]Giuli TJ and Baker M Narses: a scalable plow-pased network simulator.http://arxiv.org/abs/cs/0211024,2002.
[79]Kant K and Iyer R. Modeling and simulation of adhoc/P2P resource sharing networks.The13th international conference on modelling techniques and tools for computerperformance evaluation, USA,2003.1-27
[80]Overlay Weaver.http://overlayweaver.sourceforge.net,2003.
[81]Merugu S, Sridhar Srinivasan ZE. P-sim: a simulator for peer-to-peer networks. The11thIEEE/ACM International Symposium on Modeling, Analysis and Simulation of ComputerTelecommunication Systems (MASCOTS),2003.213-218
[82]Shi G Y, Long YS, Gong H, et al. HiFiP2P: the simulator capable of massive nodes andmeasured underlay. IEEE International conference on Performance, Computing andCommunications, Austin, USA,2008.311-318
[83]TTA Dinh, M Lees, G Theodoropoulos, and R Minson. Large scale distributed simulationof P2P networks.2nd International Workshop on Modeling, Simulation, and Optimizationof Peer-to-peer Environments (MSOP2P),2008.499-507
[84]George K Papaloukopoulos and Evangelos Sakkopoulos. D-P2P-SIM. http://code.Google.com/p/d-P2P-sim,2009.
[85]Stingl D, Gro C, Rückert J, et al. Peerfactsim.kom: A large scale simulation frameworkfor peer-to-peer systems. International Conference on High Performance Computing&Simulation,2011.577-584
[86]R. Duncan Luce and Albert D. Perry. A method of matrix analysis of group structure.Psychometrika.1949,14(2):95-116
[87]Luce R D. Connectivity and generalized cliques in sociometric group structure.Psychometrika,1950,15(2):169-190
[88]Richard D. Alba. A graph-theoretic definition of a sociometric clique. Journal ofMathematical Sociology.1973,3:113-126
[89]X. Liu and T. Murata. Advanced modularity-specialized label propagation algorithm fordetecting communities in networks. Physica A: Statistical Mechanics and its Applications.2010,389(7):1493-1500
[90]Marek Ciglan and Kjetil N rv g.Fast detection of size-constrained communities in largenetworks. Lecture Notes in Computer Science.2010,6488:91-104
[91]Ian XY Leung, Pan Hui, Pietro Liò, and Jon Crowcroft.Towards real-time communitydetection in large networks. Physical Review E.2009,79(6):66-107
[92]Demers A, Greene D, Hauser C, et al. Epidemic algorithms for replicated databasemaintenance. The6thACM Symposiums on Principles of DistributedComputing,1987.1-12
[93]Kermarrec A-M and van Steen M. Gossiping in distributed systems. ACM SIGOPSOperating Systems Review.2007,41(5):2-7
[94]Gavidia D, Voulgaris S, and van Steen M. A gossip-based distributed news service forwireless mesh networks. Third International Conference on Wireless On-demand NetworkSystems&Services (WONS),2006.59-67
[95]Gabriele G, Ernesto D, Guido LC, and Paulius D. Gossiping solutions for distributedconsensus on unstructured overlays. The4thIEEE International Conference on DigitalEcosystems and Technologies,2010.246-251
[96]Da Hora, Diego N, Macedo, Daniel F, Oliveira, Leonardo B, et al. Enhancing peer-to-peercontent discovery techniques over mobile ad hoc networks. ComputerCommunications.2009,32(13-14):1445-1459
[97]Jin Yang, Simon T, Mueller C, Klan D, and Sattler KU. Comparing and refining gossipprotocols for fault tolerance in wireless P2P systems. The19th Euromicro InternationalConference on Parallel, Distributed and Network-Based Processing (PDP),2011,595-599
[98]Drabkin V, Friedman R, Kliot G, and Segal M. RAPID: reliable probabilisticdissemination in wireless ad-hoc networks.The26th IEEE International Symposium onReliable Distributed Systems,2007.13-22
[99]刘德辉，尹刚，王怀民，邹鹏. Chord网络环境下的Gossip算法.计算机工程与科学.2011,33(9):48-51
[100]汪洋,陈京文,黑晓军,程文青.混合内容分发网中社群感知的Gossip协议.北京邮电大学学报.2010,33(5):18-21,46
[101]Chen Nao, Hu Ruimin, and Zhu Yongqiong. Gossip-based topology managementprotocol for self-organizing overlays. China Communications.2011,9:38-46
[102]Andras K and Vilmos S. Adaptive multihop broadcast protocols for ad hoc networks. The8th IEEE, IET International Symposium on Communication Systems, Networks andDigital Signal Processing,2012.1-6
[103]Bailey NT J．The mathematical theory of infectious diseases and its applications (secondedition)．Hafner Press，1975.
[104]Johnson Db and Maltz DA. Dynamic source routing in ad hoc wireless networks. MobileComputing.1996,153-181
[105]Yao Z, Leonard D, Wang X, and Loguinov D. Modeling heterogeneous user churn andlocal resilience of unstructured P2P networks. IEEE International Conference on NetworkProtocols (ICNP),2006.32-41
[106]Li C and Chen C. On Gnutella topology dynamics by studying leaf and ultra connectionjointly in phase space. Computer Networks.2008,52(3):695-719
[107]Liu Z, Yuan R, Li Z, Li H, and Chen G Survive under high churn in structured P2Psystems: evaluation and strategy. Lecture Notes of Computer Science.2006,3994:404-411
[108]Zhao B, Kubiatowicz J, and Joseph AD.Tapestry: a fault-tolerant wide-area applicationinfrastructure. Computer Communication Review.2002,32(1):81
[109]Gupta I, Birman KP, Linga P, Demers AJ, and Renesse R. Kelips: building an efficientand stable P2P DHT through increased memory and background overhead. Lecture Notesin Computer Science.2003,2735:160-169
[110]Kaashoek MF and Karger R (2003) Koorde: A simple degree-optimal distributed hashtable. Lecture Notes in Computer Science.2003,2735:98-107
[111]Huang Q, Li Z, Lu C, and Wang W. Analyzing the cost of DHT handling churn.Journal ofComputer Research and Development.2008,45(suppl.):409-414
[112]Krishnamurthy S, El-Ansary S, Aurell E, and Haridi S. An analytical study of astructured overlay in the presence of dynamic membership. IEEE/ACM Transacitons onNetworking.2008,16(4):814-825
[113]Van Kampen NG. Stochastic processes in physics and chemistry.1981.
[114]Herrera O and Znati T. Modeling churn in P2P networks. The40th Annual SimulationSymposium(ANSS),2007.33-40
[115]Anceaume E, Ludinard R, and Sericola B. Analytic study of the impact of churn incluster-based structured P2P overlays. IEEE International Conference onCommunications(ICC),2010.1-5
[116]Kassinen O, Harjula E, Korhonen J, and Ylianttila M. Battery life of mobile peers withUMTS and WLAN in a kademlia-based P2P overlay. IEEE20th InternationalSymposium on Personal, Indoor and Mobile Radio Communications,2009.662-665
[117]Ou Z, Harjula E, Kassinen O, and Ylianttila M. Performance evaluation of aKademlia-based communication-oriented P2P system under churn. Computer Networks.2010,54(5):689-705
[118]Ou Z, Harjula E, Kassinen O, and Ylianttila M. Feasibility evaluation of acommunication-oriented P2P system in mobile environments. The6th InternationalConference on Mobile Technology, Application&Systems,2009.1-8
[119]Kassinen O, Harjula E, and Ylianttila M. Analysis of messaging load in a P2PP overlaynetwork under churn. Global Telecommunications Conference,2010.1-5
[120]Baset S, Schulzrinne H, and Matuszewski M. Peer-to-Peer Protocol (P2PP).http://tools.ietf.org/id/draft-baset-p2psipp2pp-01.txt.
[121]Wu D, Tian Y, Ng KW, and Datta A. Stochastic analysis of the interplay between objectmaintenance and churn. Computer Communications.2008,31(2):220-239
[122]Yang D, Zhang Y, Zhang H, Wu TY, and Chao HC. Multi-factors oriented study of P2PChurn. International Journal of Communication Systems.2009,22(9):1089-1103
[123]Brighten P, Shenker S, and Stoica I. Minimizing churn in distributed Systems. ACMSIGCOMM,2006.147-158.
[124]Kennedyj and Eberhart R C. Particle swarm optimization. IEEE International Conferenceon Neural Networks, Piscataway, NJ, USA,1995.1942-1948
[125]梁艳春，吴春国，时小虎，葛宏伟.群智能优化算法理论与应用.科学出版社，2009.
[126]梁旭，黄明.现代智能优化混合算法及其应用.电子工业出版社，2011.
[127]Dorigo M. Optimization,learning and natural algorithms(in Italian). PhD thesis.1992:140
[128]Mahmood Fathya, Kaamran Rahemifarb, Hamideh Babaeic, Morteza romoozic, andReza Berangy. Impact of mobility on performance of P2P content discovery protocols overMANET. Procedia Computer Science.2012,10:642-649
[129]JA Fernandez-Prieto, J Canada-Bago, MA Gadeo-Martos, and Juan R Velasco.Optimisation of control parameters for genetic algorithms to test computer networks underrealistic traffic loads. Applied Soft Computing.2012,12:1875-1883
[130] Javid Taheri, Shaghayegh Sharif, Xing Penju, and Albert Y. Zomaya. Paralleled geneticalgorithm for solving the knapsack problem in the cloud. Seventh International Conference onP2P, Parallel, Grid, Cloud and Internet Computing,2012.303-308
[131]邱国庆，解文彬，徐勋利，廖伟，王多点.运输任务分配与路径选择的组合优化模型.计算机工程.2011,177-179,182
[132] Claudio Risso, Sergio Nesmachnow, and Franco Robledo. A parallel evolutionaryalgorithm for multilayered robust network design. Seventh International Conference on P2P,Parallel, Grid, Cloud and Internet Computing,2012.291-296
[133] Fatos Xhafa，Joanna Ko odziej，and Leonard Barolli. Evaluation of hybridization of GAand TS Algorithms for independent batch scheduling in computational grids. InternationalConference on P2P, Parallel, Grid, Cloud and Internet Computing,2011.148-155
[134]Rifat Sonmez and Onder Halis Bettemir. A hybrid genetic algorithm for the discretetime-cost trade-off problem. Expert Systems with Applications.2012,39:11428–11434
[135]K Ronasi, MH Firooz, MR Pakravan, and AN Avanaki. A fast algorithm for constructionof minimum delay multicast trees in P2P networks. International Symposium onCommunications and Information Technologies,2006.137-142
[136]Tiejun Wu, Maozhen Li, Mahesh Ponraj, and Man Qi. A genetic algorithm based peerselection strategy for BitTorrent networks. World Congress on Nature&Biologically InspiredComputing (NaBIC),2009.336-341
[137]Jin Qi, Shunyi Zhang, Ling Tan, Yanfei Sun, and Lu Cao. A novel support vectormachine awareness model based on genetic algorithm optimization for peer-to-peer networktraffic. International Journal of Digital Content Technology and its Applications(JDCTA).2012,6(2):128-136
[138]Mehdi Mohammadi, Bijan Raahemi, Ahmad Akbari, Hossein Moeinzadeh, BabakNasersharif. Genetic-based minimum classification error mapping for accurate identifyingpeer-to-peer applications in the internet traffic. Expert Systems with Applications.2011,38:6417-6423
[139] Chithra Selvaraj and Sheila Anand. Peer profile based trust model for P2P systems usinggenetic algorithm. Peer-to-Peer Networking and Applications.2012,5:92-103
[140] Jaymin Kessler, Khaled Rasheed, and I. Budak Arpinar. Using genetic algorithms toreorganize superpeer structure in peer to peer networks. Applied Intelligence.2007,26:35-52
[141] Hengheng Xie, Azzedine Boukerche, and Ming Zhang. A formalized approach fordesigning a P2P-based dynamic load balancing scheme. Concurrency and Computation:Practice and Experience.2010,22:1223-1239
[142] Guimin Huang, Changliang Li, Ya Zhou, and Chenzhong Bin. Data scheduling strategyin P2P VoD system based on genetic algorithm. Third International Conference on MultimediaInformation Networking and Security,2011.128-131
[143]Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo Liu, and Millie Pant.Multi-objective peer-to-peer neighbor-selection strategy using genetic algorithm. LectureNotes in Computer Science.2007,4873:443-451
[144]Fu Xiao-ling and Xu Ying. A load balance algorithm for hybrid P2P network model.International Colloquium on Computing, Communication, Control, and Management,2008.236-239
[145]Oh Chan Kwon, Hwangjun Song, and Tai-Won Um. A robust P2P video multicaststreaming system under high peer-churn rate. IEEE13th International Conference onCommunication Technology,2011.843-848
[146]Jun Tan, Xingshu Chen, and Min Du. A novel P2P identification algorithm based ongenetic algorithm and particle swarm optimization.3rd International Symposium on ParallelArchitectures, Algorithms and Programming,2010.22-29
[147]Mohammad Zulhasnine, Changcheng Huang, and Anand Srinivasan. Penalty functionmethod for peer selection over wireless mesh network. IEEE Vehicular TechnologyConference,2010.1-5
[148]刘晶晶，黄明，梁旭.改进的病毒进化遗传算法应用研究.大连交通大学学报.2009,30(2):82-85
[149]黄明，宫旭德，梁旭.改进的DNA免疫遗传算法在车间调度中的应用.化工自动化及仪表.2009,36(2):14-18
[150]蔡良伟，李霞.遗传算法交叉操作的改进.系统工程与电子技术.2006,28(6):925-928