移动P2P网络中基于方向搜索算法的研究
摘要
移动P2P是一种新型的资源共享和数据分发的手段与技术,移动应用环境的逐渐成熟,使其拥有越来越广阔的应用前景。移动P2P网络是由互相通信的移动设备组成的,与有限网络上的P2P系统比较而言,移动P2P有着更多的约束。由于电池能源、无线宽带的限制以及动态变化的网络拓扑结构,移动P2P对路由、资源发现、数据检索、安全和隐私管理等提出了新的挑战。
洪泛策略是分布式非结构化P2P网络中最流行的资源搜索机制,但该机制在处理每个节点的搜索消息时需花费昂贵的电池能源,带宽和计算资源;分布式哈希表DHT是用于结构化P2P网络中配置和搜索数据资源的,但该策略的使用需要事先建立搜索索引,限制了灵活性。上述的方法都无法很好的执行与移动P2P网络。因此,研究者们为了能使P2P技术在移动无线网络中得到充分的利用做了大量的研发工作。如果能将基于洪泛式搜索算法的改进与基于结构化分布式DHT搜索算法的改进有机地结合起来,通过超级节点和普通节点将基于DHT的搜索机制与洪泛机制相结合,使用较少的副本、缓存或控制信息,尽量减少洪泛的次数,充分利用上述两者的优点,将是资源搜索在今后的一个发展方向。
本文作者提出了基于方向的搜索算法-DBS算法,该算法秉承了Flooding算法及随机行走算法的优点,同时又解决了Flooding算法及随机行走算法自身存在的缺点,通过模拟实验得出的实验结果验证了DBS算法在搜索过程中的有效性及可操作性;设计了一种移动P2P覆盖网络,为后续设计的算法提供了一个合理的运行环境;基于DBS算法思想设计了适用于移动P2P网络的MDBS算法,MDBS算法包括基于代理的方向搜索算法-ADBS算法和动态调整转发方向搜索算法-DTDBS算法。选择MATLAB为本仿真工具,模拟了MDBS算法。通过仿真实验,首先验证了算法运行所在覆盖网络的有效性,其次通过度量标准对分别对ADBS算法和DTDBS算法的模拟结果进行了详尽的分析,最后通过性能分析更进一步验证了MDBS算法在移动P2P网络中的有效性及可行性。
P2P technology which is a high effective and directly information transmission mode, it breaks the traditional C/S pattern, makes the messages exchanging between peer-to-peer equipments and gets widely used in the internet. With the development of transferring data service and the popularization of load bearing data service terminal, mobile terminal and network integrate more and more closely, how to realize the peer-to-peer information shared has taken attention widely.
Mobile P2P network is comprised of many mini-type equipments. With the category and quantitative of mobile equipments increasing continuously, more and more users also continuously pursue new applications taken by mobile equipments. Due to the special nature of mobile devices lies in its limited bandwidth, low storage and processing power, connection stability and short battery life-cycle, as well as unpredictable connectivity and topological dynamics, etc. Therefore, effectively search and locate resources are very important in mobile P2P network. Traditional P2P network can be divided into centralized P2P network, distributed P2P network and hybrid P2P network, distributed P2P network is divided into distributed unstructured P2P network and distributed structured P2P network.
Centralized P2P network, there is a central directory server, which is for all nodes of P2P network to provide services of search and share files; distributed unstructured P2P network uses completely random flooding-style search and random transmitting mechanism, representative search technologies such as Flooding search algorithm, Modified-BFS search algorithm, Random Walk search algorithm, Gnutella2 search algorithm, and Mobile Agent-Based search algorithm, etc.; distributed hash table DHT is the resource position method taken by the most structured P2P networks, the classic DHT search algorithm includes Chord, CAN, Pastry, and Tapestry; application cases of typical search algorithm in Hybrid P2P network include Kazaa, eDonkey, and eMule.
P2P business models which are based on mobile terminals are mainly two ways: First, mobile terminals connect to a traditional P2P network system through the mobile network to provide P2P technical supports for mobile users. In this business model, you need to use P2P network architectures and algorithms of traditional networks in the key technologies such as network architecture, resource search location according to the characteristics of mobile terminals. Second, the mobile terminals are in close proximity may form Ad-Hoc Networks, achieve P2P overlay networks in Ad-Hoc networks, namely mobile P2P networks for sharing resources. According to the coverage networks whether have agents or not, mobile P2P system is divided into two categories: agent-based mobile P2P systems and mobile P2P systems without agents. For the limitation to mobile terminal resources, most of nodes are connected to networks with agents. A few systems adopt lightweight strategies that would enable mobile terminals directly access to the network without agents.
According to topology structures of overlay networks, mobile P2P network structures can be divided into centralized network architecture, semi-distributed network architecture, and full-distributed network architecture based on mobile Ad-Hoc network. In the centralized network architecture, researchers put forward some search algorithms such as the eDonkey protocol is used in mobile networks, and the idea is realized in GPRS networks and UMTS networks. In the semi-distributed network architecture, researchers put forward some search algorithms such as the search algorithm which is based on flooding-type messages supports the information sharing services of mobile terminals through raising mobile agents in the sharing system between Gnutella networks, and the search algorithm which is based on semi-distributed DHT takes the super-node as the basis of the improved algorithm to CAN. In the full-distributed network architecture based on mobile Ad-Hoc network, researchers put forward some improved search algorithms such as 7DS, RAON, Konark, MPP, and ORION which are based on flooding-type search, At the same time, some researchers put forward some improved search algorithms which are based on the structured distributed hash table, For example, routing strategy based on location, sharing P2P video streaming by using AP as a resource search in mobile Ad-Hoc network environment, using vehicles to be super nodes in a mobile P2P network, while serve as control nodes, composite the backbone network of mobile P2P systems and so on.
Search algorithms applied in mobile P2P networks and their corresponding improved algorithms although they are each with its own features, but there are still some limited defects such as increasing of network redundancy traffics, increasing of network load, and flexibility constrained. Therefore, researchers do a lot of researches and developments in order to enable P2P technology can be fully utilized in mobile wireless networks. How to make the network redundancy traffic decrease, reduce the network load, give full play to the search flexibility will be a research focus on resource search of mobile P2P network in the future. Based on the above thought, we research the search algorithm applied in mobile P2P network in this paper, specifically, the main contributions are summarized below:
First, propose the direction-based search algorithm-DBS algorithm according to the design conception of Flooding algorithm. Describe the basic idea and the detailed design process of DBS algorithm, and take simulation experiments for DBS algorithm, carry on data analysis to the experiment results obtained from simulation experiments. First of all, by setting a definition, a lemma and a theorem prove DBS algorithm has the connectivity in the operation space. Second, by the analysis to the two experimental results of digital datum and image datum fully reflect effectiveness and feasibility of the algorithm in the search process. DBS algorithm implements the search process through the program to simulate P2P networks in a two-dimensional space, done with the advantages of Flooding algorithm and its improved algorithm, such as low requirements and simple implementations to the network topology, support complex resource search and effectively avoid sending repetitive messages and reduce generating redundancy messages, while ensuring coverage of the whole search, all that establishes the foundation for the improvement to follow-up search algorithms.
Secondly, design one mobile P2P overlay network, the overlay network adopts the overlay abstract design method of integrated and structured for constructing abstract overlay to P2P system in mobile Ad-Hoc network, combines the relationship of mobile P2P network and mobile Ad-Hoc network to draw abstract overlay map of P2P network based on mobile Ad-Hoc network. In the overlay network we set up logical space domain and physical space domain, the mobile Ad-Hoc network layer which logical domain corresponding to is the mobile layer, the fixed P2P network layer which physical domain corresponding to is the fixed layer, nodes on the fixed layer has the determined position, thus the fixed nodes form a network information database on the fixed layer, the database is used to find and store the state of the node with the same interest. Nodes on the mobile layer can always change their position information in the network level, while mobile nodes can always send and receive position updates from each other. The fixed layer adopts structured P2P system based on distributed hash table, its main task is to deal with the mobility of mobile nodes and the resolution of the address, in order to achieve exchanging between mobile P2P network and fixed P2P network, the overlay network provides a reasonable operating environment for MDBS algorithm.
Thirdly, design MDBS algorithm applied for mobile P2P network, MDBS algorithm includes agent-based direction search algorithm-ADBS algorithm and dynamic transmission direction search algorithm-DTDBS algorithm. The algorithm combines the improved algorithms which are separately based on flooding search algorithm and structured distributed hash table search algorithm, combines the search mechanism based on DHT and flooding mechanism through super nodes and ordinary nodes. In ADBS algorithm, a super-node is set on the mobile layer, one agent node is set in each Ad-Hoc network, the super-node is responsible for the coordinates of each Ad-Hoc network, storing the information of node packets and the management to agent nodes on the mobile layer, the agent node is responsible for storing messages from neighbor Ad-Hoc networks and transferring messages within and between Ad-Hoc networks. If the position of the agent node on the mobile layer is under the case of unknown or invalid, the nodes within the P2P network on the fixed layer will resolve the address for the agent node, allows the search to proceed smoothly. DTDBS algorithm sets the connection network and the direct transiting network, compared with ADBS algorithm improves the search speed of the network overlay. DTDBS algorithm sets Dynamic Table, Collection Table, life-cycle of search information and interest-related degrees introduced, compared with ADBS algorithm shortens the response time, controls the time of messages transited, reduce the generation of redundant messages, DTDBS algorithm further optimizes ADBS algorithm.
Fourth, chose MATLAB as the simulation tool, through setting up a simulation environment and setting the simulation parameters to simulate MDBS algorithm. Through simulation experiments, we test scalability and routing efficiency of the overlay network, the results show the load of fixed nodes do not increase with the increasing of the mobile node quantity when the algorithm runs, so the scalability to the overlay network is ensured; as the mobile nodes in the proportion of the total nodes gradually increase, the average hops of routing do not change a lot, thus ensuring the efficiency of routing. We carry on simulation tests to ADBS algorithm and DTDBS algorithm separately through measure standards, the test results of ADBS algorithm show that the algorithm has the scalability because the traffic quantity of average messages increase with the increasing of node quantity; the average search path lengths correspond to the actual network operation with the changes of mobile node quantity, the search traffics of nodes are adapt to the changes in the search speed of mobile nodes. The test results of DTDBS algorithm show that the algorithm sets the life-cycle of search messages and the direct transiting network, introduces the interest-related degrees, compared with ADBS algorithm further shortens the search response time, gives the search feedback of users in a shorter period of time, improves the customer satisfaction effectively. Finally,through performance analysis we further verify the validity and feasibility of MDBS algorithm in mobile P2P network.
洪泛策略是分布式非结构化P2P网络中最流行的资源搜索机制,但该机制在处理每个节点的搜索消息时需花费昂贵的电池能源,带宽和计算资源;分布式哈希表DHT是用于结构化P2P网络中配置和搜索数据资源的,但该策略的使用需要事先建立搜索索引,限制了灵活性。上述的方法都无法很好的执行与移动P2P网络。因此,研究者们为了能使P2P技术在移动无线网络中得到充分的利用做了大量的研发工作。如果能将基于洪泛式搜索算法的改进与基于结构化分布式DHT搜索算法的改进有机地结合起来,通过超级节点和普通节点将基于DHT的搜索机制与洪泛机制相结合,使用较少的副本、缓存或控制信息,尽量减少洪泛的次数,充分利用上述两者的优点,将是资源搜索在今后的一个发展方向。
本文作者提出了基于方向的搜索算法-DBS算法,该算法秉承了Flooding算法及随机行走算法的优点,同时又解决了Flooding算法及随机行走算法自身存在的缺点,通过模拟实验得出的实验结果验证了DBS算法在搜索过程中的有效性及可操作性;设计了一种移动P2P覆盖网络,为后续设计的算法提供了一个合理的运行环境;基于DBS算法思想设计了适用于移动P2P网络的MDBS算法,MDBS算法包括基于代理的方向搜索算法-ADBS算法和动态调整转发方向搜索算法-DTDBS算法。选择MATLAB为本仿真工具,模拟了MDBS算法。通过仿真实验,首先验证了算法运行所在覆盖网络的有效性,其次通过度量标准对分别对ADBS算法和DTDBS算法的模拟结果进行了详尽的分析,最后通过性能分析更进一步验证了MDBS算法在移动P2P网络中的有效性及可行性。
P2P technology which is a high effective and directly information transmission mode, it breaks the traditional C/S pattern, makes the messages exchanging between peer-to-peer equipments and gets widely used in the internet. With the development of transferring data service and the popularization of load bearing data service terminal, mobile terminal and network integrate more and more closely, how to realize the peer-to-peer information shared has taken attention widely.
Mobile P2P network is comprised of many mini-type equipments. With the category and quantitative of mobile equipments increasing continuously, more and more users also continuously pursue new applications taken by mobile equipments. Due to the special nature of mobile devices lies in its limited bandwidth, low storage and processing power, connection stability and short battery life-cycle, as well as unpredictable connectivity and topological dynamics, etc. Therefore, effectively search and locate resources are very important in mobile P2P network. Traditional P2P network can be divided into centralized P2P network, distributed P2P network and hybrid P2P network, distributed P2P network is divided into distributed unstructured P2P network and distributed structured P2P network.
Centralized P2P network, there is a central directory server, which is for all nodes of P2P network to provide services of search and share files; distributed unstructured P2P network uses completely random flooding-style search and random transmitting mechanism, representative search technologies such as Flooding search algorithm, Modified-BFS search algorithm, Random Walk search algorithm, Gnutella2 search algorithm, and Mobile Agent-Based search algorithm, etc.; distributed hash table DHT is the resource position method taken by the most structured P2P networks, the classic DHT search algorithm includes Chord, CAN, Pastry, and Tapestry; application cases of typical search algorithm in Hybrid P2P network include Kazaa, eDonkey, and eMule.
P2P business models which are based on mobile terminals are mainly two ways: First, mobile terminals connect to a traditional P2P network system through the mobile network to provide P2P technical supports for mobile users. In this business model, you need to use P2P network architectures and algorithms of traditional networks in the key technologies such as network architecture, resource search location according to the characteristics of mobile terminals. Second, the mobile terminals are in close proximity may form Ad-Hoc Networks, achieve P2P overlay networks in Ad-Hoc networks, namely mobile P2P networks for sharing resources. According to the coverage networks whether have agents or not, mobile P2P system is divided into two categories: agent-based mobile P2P systems and mobile P2P systems without agents. For the limitation to mobile terminal resources, most of nodes are connected to networks with agents. A few systems adopt lightweight strategies that would enable mobile terminals directly access to the network without agents.
According to topology structures of overlay networks, mobile P2P network structures can be divided into centralized network architecture, semi-distributed network architecture, and full-distributed network architecture based on mobile Ad-Hoc network. In the centralized network architecture, researchers put forward some search algorithms such as the eDonkey protocol is used in mobile networks, and the idea is realized in GPRS networks and UMTS networks. In the semi-distributed network architecture, researchers put forward some search algorithms such as the search algorithm which is based on flooding-type messages supports the information sharing services of mobile terminals through raising mobile agents in the sharing system between Gnutella networks, and the search algorithm which is based on semi-distributed DHT takes the super-node as the basis of the improved algorithm to CAN. In the full-distributed network architecture based on mobile Ad-Hoc network, researchers put forward some improved search algorithms such as 7DS, RAON, Konark, MPP, and ORION which are based on flooding-type search, At the same time, some researchers put forward some improved search algorithms which are based on the structured distributed hash table, For example, routing strategy based on location, sharing P2P video streaming by using AP as a resource search in mobile Ad-Hoc network environment, using vehicles to be super nodes in a mobile P2P network, while serve as control nodes, composite the backbone network of mobile P2P systems and so on.
Search algorithms applied in mobile P2P networks and their corresponding improved algorithms although they are each with its own features, but there are still some limited defects such as increasing of network redundancy traffics, increasing of network load, and flexibility constrained. Therefore, researchers do a lot of researches and developments in order to enable P2P technology can be fully utilized in mobile wireless networks. How to make the network redundancy traffic decrease, reduce the network load, give full play to the search flexibility will be a research focus on resource search of mobile P2P network in the future. Based on the above thought, we research the search algorithm applied in mobile P2P network in this paper, specifically, the main contributions are summarized below:
First, propose the direction-based search algorithm-DBS algorithm according to the design conception of Flooding algorithm. Describe the basic idea and the detailed design process of DBS algorithm, and take simulation experiments for DBS algorithm, carry on data analysis to the experiment results obtained from simulation experiments. First of all, by setting a definition, a lemma and a theorem prove DBS algorithm has the connectivity in the operation space. Second, by the analysis to the two experimental results of digital datum and image datum fully reflect effectiveness and feasibility of the algorithm in the search process. DBS algorithm implements the search process through the program to simulate P2P networks in a two-dimensional space, done with the advantages of Flooding algorithm and its improved algorithm, such as low requirements and simple implementations to the network topology, support complex resource search and effectively avoid sending repetitive messages and reduce generating redundancy messages, while ensuring coverage of the whole search, all that establishes the foundation for the improvement to follow-up search algorithms.
Secondly, design one mobile P2P overlay network, the overlay network adopts the overlay abstract design method of integrated and structured for constructing abstract overlay to P2P system in mobile Ad-Hoc network, combines the relationship of mobile P2P network and mobile Ad-Hoc network to draw abstract overlay map of P2P network based on mobile Ad-Hoc network. In the overlay network we set up logical space domain and physical space domain, the mobile Ad-Hoc network layer which logical domain corresponding to is the mobile layer, the fixed P2P network layer which physical domain corresponding to is the fixed layer, nodes on the fixed layer has the determined position, thus the fixed nodes form a network information database on the fixed layer, the database is used to find and store the state of the node with the same interest. Nodes on the mobile layer can always change their position information in the network level, while mobile nodes can always send and receive position updates from each other. The fixed layer adopts structured P2P system based on distributed hash table, its main task is to deal with the mobility of mobile nodes and the resolution of the address, in order to achieve exchanging between mobile P2P network and fixed P2P network, the overlay network provides a reasonable operating environment for MDBS algorithm.
Thirdly, design MDBS algorithm applied for mobile P2P network, MDBS algorithm includes agent-based direction search algorithm-ADBS algorithm and dynamic transmission direction search algorithm-DTDBS algorithm. The algorithm combines the improved algorithms which are separately based on flooding search algorithm and structured distributed hash table search algorithm, combines the search mechanism based on DHT and flooding mechanism through super nodes and ordinary nodes. In ADBS algorithm, a super-node is set on the mobile layer, one agent node is set in each Ad-Hoc network, the super-node is responsible for the coordinates of each Ad-Hoc network, storing the information of node packets and the management to agent nodes on the mobile layer, the agent node is responsible for storing messages from neighbor Ad-Hoc networks and transferring messages within and between Ad-Hoc networks. If the position of the agent node on the mobile layer is under the case of unknown or invalid, the nodes within the P2P network on the fixed layer will resolve the address for the agent node, allows the search to proceed smoothly. DTDBS algorithm sets the connection network and the direct transiting network, compared with ADBS algorithm improves the search speed of the network overlay. DTDBS algorithm sets Dynamic Table, Collection Table, life-cycle of search information and interest-related degrees introduced, compared with ADBS algorithm shortens the response time, controls the time of messages transited, reduce the generation of redundant messages, DTDBS algorithm further optimizes ADBS algorithm.
Fourth, chose MATLAB as the simulation tool, through setting up a simulation environment and setting the simulation parameters to simulate MDBS algorithm. Through simulation experiments, we test scalability and routing efficiency of the overlay network, the results show the load of fixed nodes do not increase with the increasing of the mobile node quantity when the algorithm runs, so the scalability to the overlay network is ensured; as the mobile nodes in the proportion of the total nodes gradually increase, the average hops of routing do not change a lot, thus ensuring the efficiency of routing. We carry on simulation tests to ADBS algorithm and DTDBS algorithm separately through measure standards, the test results of ADBS algorithm show that the algorithm has the scalability because the traffic quantity of average messages increase with the increasing of node quantity; the average search path lengths correspond to the actual network operation with the changes of mobile node quantity, the search traffics of nodes are adapt to the changes in the search speed of mobile nodes. The test results of DTDBS algorithm show that the algorithm sets the life-cycle of search messages and the direct transiting network, introduces the interest-related degrees, compared with ADBS algorithm further shortens the search response time, gives the search feedback of users in a shorter period of time, improves the customer satisfaction effectively. Finally,through performance analysis we further verify the validity and feasibility of MDBS algorithm in mobile P2P network.
引文
[1]李祖鹏,黄建华,黄道颖,庄雷.P2P网络技术的发展与展望.电信科学.2003, 19(3):1-4.
[2]严晗,王典洪,张建辉.有关P2P的应用及其发展方向[J].现代计算机.2003(5):18-19.
[3]李振武,杨舰,白英彩.P2P网络研究及其挑战[J].计算机应用与软件.2004, 21(2):54-57.
[4]陈林星,曾曦,曹毅等.移动Ad Hoc网络-自组织分组无线网络技术.北京:电子工业工业出版社,2006:1-44.
[5]Ion Stocia, Robert Morris et al.Chord: A scalable peer-to-peer lookup service for internet application[C].In Proceedings of the 2001 ACM SIGCOMM Conference, 2001:149-160.
[6]Frank Dabek, Emma Brunskill et al.Building peer-to-peer systems with chord, a distributed lookup service.Proceedings of the workshop on Hot Topics in Operating Systems-HOTOS, 2001:81-86.
[7]Stoica I, Morris R et al. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 2003, 11(1): 1732.
[8]Ratnasamy S,Francis P et al.A scalable content addressable network.ACM SIGCOMM Computer Communication Review.2001,31(4):161-172.
[9]Ratnasamy Sylvia Paul. A scalable content-addressable network [D]: [Doctor Dissertation].Berkeley: University of California,2002.
[10]Boukhelef D, Kitagawa H. Multi-ring infrastructure for content addressable Networks.Proceeding of the 16th International Conference on Cooperative Information Systems.Lecture Notes in Computer Science, vol.5331.Springer Berlin, Heidelberg, 2008:193-211.
[11]Gnutella [OL].http://www.gnutella.com.
[12]Jovanovie MA. Modeling large-scale peer-to-peer networks and a casestudy of Gnutella [D]: [MS.Thesis].University of Cincinnati,2001.
[13]Ripeanu M.Peer-to-peer Architecture Case Study: Gnutella Network[C]. Proceeding of the First International Conference on Peer-to-Peer Computing, 2001.
[14]Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. The 18th IFIP/ACM International Conference on Distributed Systems Platforms. Heidelberg, 2001:320-350.
[15]Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing[R].Technical Report, UCB/CSD-01-1141, Computer Science Division, U.C.Berkeley, 2001.
[16]郑少仁,王海涛,赵志峰,米志超,黎宁.Ad Hoc网络技术.人民邮电出版社.2005:1-13.
[17]Basagni S,Conti M,Giorgano S, et al. Mobile Ad Hoc Network. Wiley-IEEE. 2004:69-300.
[18]ANDREW S.TANENBAUM著.计算机网络[M].潘爱民译.第4版.北京:清华大学出版社,2004:316-321.
[19]冯博琴,陈文革等.计算机网络[M].第2版.北京:高等教育出版社,1999:60-64.
[20]JAMES F,KUROSE,KETTH W.BOSS著.计算机网络-自顶向下的方法与INTERNET特色[M].第三版.北京:高等教育出版社,2005:139-145.
[21]Dana Moore,John Hebeler.对等网络.北京:清华大学出版社,2003.
[22]罗杰文.Peer to Peer综述.中科院计算技术研究所,2005.
[23]张联峰,刘乃安,钱秀槟,张玉清.综述:对等网(P2P)技术.计算机工程与应用,2003,39(12):142-145.
[24]周傲英,凌波. Peer-to-Peer系统及其应用[J].计算机科学.2002,29(8):200-203.
[25]陈梅等.P2P技术的研究与应用[J].计算机工程与应用.2002(130):20-23.
[26]吴功宜.计算机网络与互联网技术研究、应用和产业发展.北京:清华大学出版社,2008年8月:75-76.
[27]GONGL.Peer-to-Peer networks in action [J].IEEE Internet Computing, 2002, 6(1):37-39.
[28]李盛涛,吴丽辉,于满全等.主题Web信息采集的研究与设计.北京:清华大学出版社,2003.
[29]李晓明,李星主编.搜索引擎与Web挖掘进展[M].北京:高等教育出版社,2003:611-621.
[30]徐宝文,张卫峰.搜索引擎与信息获取技术[M].北京:清华大学出版社.2003:166-168.
[31]谭明佳.DNS技术的应用分析[J].计算机工程与设计,2004(4):596-598.
[32]Dave Roberts.Internet协议手册[M].希望图书创作室译.北京:海洋出版社,1998:238-248.
[33]蔡勇.FTP服务器技术研究及实现.电子科技大学出版社,2005:12-13.
[34]赵刚,林瑶,蒋慧等译.用TCP/IP进行网际互联(第1卷).北京:电子工业出版社,2001:145-173.
[35]Napster website.http://www.napster.com.
[36]BitTorrent[OL].http://www.bittorrent.com.
[37]Salman A.Baset, Henning G, Schulzrinne.An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol, NFOCOM 2006. The 25th IEEE International Conference on Computer Communications.Proceedings, 2006:1-11.
[38]J.Kubiatowicz, DBindel, Y.Chenet al.Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS. ACM, 2000.
[39]P.Druschel, A.Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility.In Proceeding of HOTOS, 2001:75-80.
[40]Kazaa[OL].http://www.kazaa.com.
[41]Handurukande s,Kermarrec A M,et al. Peer sharing behavior in the eDonkey network and implications for the design of serverless filesharing systems[C]//Pron of EuroSya’06.New York: ACM Press, 2006:359-371.
[42]SETI@Home.http://setiathome.berkeley.edu/index.html.
[43]刘晓华,张健,赵洁等.精通JBuilder 2006[M].北京:机械工业出版社,2006.
[44]柯晓华.基于Groove的智能商务协作模块的设计.科学管理研究,2008.28(8).
[45]顾颖彦.反射内存网实时通信技术的研究[J].系统仿真学报,2002,28(7).
[46]陈家翠,谷玉荣.Google学术搜索检索性能的分析及评价.情报理论与实践,2007,30(5):653-655.
[47]徐险峰,谷遇春.新一代雅虎搜索引擎的搜索功能和使用技巧.科技情报开发与经济,2007,17(8):219-210.
[48]吴建军.浅谈百度搜索引擎的功能与服务特点.科技情报开发与经济,2007,17(5):205-206.
[49]黄李建,王建新.P2P搜索技术研究.中国新通信,2008.
[50]周文莉,吴晓非.P2P技术综述.计算机工程与设计,2006,27(1).
[51]吴功宜.计算机网络与互联网技术研究、应用和产业发展.北京:清华大学出版社,2008年8月:78-82.
[52]Rüdiger Schollmeier. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications[C]. Proceedings of the First International Conference on Peer-to-Peer Computing,2001:101-102.
[53]Ripeanu M.Peer-to-Peer Architecture Case Study: Gnutella Network[C]. Proceedings of the First International Conference on Peer-to-Peer Computing, 2001.
[54]Kim H,Kim Y et al. Restricted path flooding scheme in distributed P2P overlay networks. ICISS 2008: International Conference on Information Science and Security Proceedings, 2008:58-61.
[55]Buccafurri F and Lax G. Enabling selective flooding to reduce P2P traffic. On the Move to Meaningful Internet Systems 2007: COOPLS, DOA,ODBASE, GADA, AND ISPT1, Proceedings, Vol.49803, 2007:188-205.
[56]Guan ZT, Cao YD, Hou XS et al. A novel efficient search algorithm in unstructured P2P networks.Sencond Workshop on Digital Media and ITS Application in Museum & Heritage Proceedings, 2007:275-280.
[57]Q Zhao,J Liu,J xu.Improving Search on Gnutella-Like P2P Systems. Computatational Science-ICCS2007-7th International Conference, LNCS. Springer-Verlag Berlin Heidelberg, 2007, 4490(4):887-890.
[58]B. Yang and H. Garcia-Molina.Improving Search in Peer-to-Peer Systems. In Proceedings of ICDCS,2002.
[59]Jennifer J et al.Fighting organized crimes: using shortest-path algorithm to identify associations in criminal networks. Desicion Support systems.Vol.38, 2004:473-487.
[60]Zhong M, Shen K, Seiferas J. The convergence-guaranteed random walk and its applications in peer-to-peer networks.IEEE Transactions on Computers, Vol.57, 2008:619-633.
[61]Bisnik N and Abouzeid AA.Optimizing random walk search algorithms in P2P networks.Computer networks,Vol.51,2007:499-1514.
[62]Gkantsidis C,Mihail M, Saberi A. Random walks in peer-to-peer networks: Algorithms and evaluation.Performance Evaluation, Vol.63, 2006:241-263.
[63]刘凡,陈兴蜀,王文贤.对Gnutella2网络节点分布特性的研究.计算机科学,2008,24(3B):342-344.
[64]凌波,陆志国,黄维雄.PeerIS:基于Peer-to-Peer的信息检索系统.软件学报,2004,15(9):1375-1384.
[65]张泽洲,朱清新.基于移动Agent和最优搜索理论的CBIR系统.计算机应用与软件.2005,12(10):93-95.
[66]Alexandru Suna etc. A Mobile Agents Platform:Architectrue,Mobility and Security[M].Springer-Verleg,2005:1134-1142.
[67]王杨,王汝传,徐小龙.应用移动代理的自组织P2P网络模型.通信学报,2008,29(5):34-42.
[68]李士宁,夏贻勇,杜艳丽.对等网络中DHT搜索算法综述.计算机应用研究,2008,25(6):1611-1615.
[69]STOICA I, MORRIS R, LIBEN-NOWELL D, et al.Chord: a scalable peer-to-peer lookup protocol for Internet application [J].IEEE/ACM Transaction on Networking, 2003, 11(1):17-32.
[70]宋建涛,沙超峰,杨智应,朱洪.语义对等网构造及搜索机制研究.计算机研究与发展,2004,41(4):645-651.
[71]石伟兴,林浒,雷为民.SIP PASTRY的设计与实现.小型微型计算机系统,2006,27(11):2012-2015.
[72]ZHAO B Y, LING Huang et al. Tapestry: a reailient global-scale overlay for service deployment [J].IEEE Journal on Selected Areas in Communications, 2004, 22(1):41-53.
[73]KaZaA[OL].http://www.KaZaA.com/.
[74]吴麒,刘毅,陈兴蜀,王文贤,郑炳伦.eDonkey的网络爬行技术及特性分析.计算机应用研究,2009,26(3):1047-1049.
[75]eMule[CP/DK].http://www.emule-project.net.
[76]孙震强.WiFi WiMAX WBMA与3G.中国无线电,2004(4):21-24.
[77]钟章队,蒋文怡,李红君.GPRS通用分组无线业务[M].北京:人民邮电出版社,2001.
[78]艾明,陈山枝.一种UMTS-WLAN网络互联互通的新模型及其认证机制.高技术通讯,2007,17(8).
[79]刘淇,李承恕.WLAN与B3G结合的结构框架和接入技术.铁道学报,2006, 28(4).
[80]周蔚文,俞东慧,孙美艳等.Wi-Fi全球商用发展及分析.电信科学,2008, 24(5).
[81]彭木根,李铭,路杨,王文博.IEEE802.16标准和WIMAX组网技术分析.电信工程技术与标准化,2005(6).
[82]Oppermann I, Stoica L et al.UWB wireless sensor networks: UWEN-Apractical example. IEEE Communications Magazine, 2004, 42(12):27-32.
[83]KALOGERAKIV. Mobile peer-to-peer computing challenges, metrics and applications proceedings of the 6th International Conference on Mobile Data Management[C].New York: ACM Press, 2005.
[84]Gerd Kortuern,Jay Schneider, Dustin Preuitt, et al. When Peer-to-Peer comes Face-to-Face: Collaborative Peer-to-Peer Computing in Mobile ad-hoc Network.In: Proceedings of the 1st International Conference on Peer-to-Peer Computing, 2001:75-91.
[85]Krco S,Cleary D,Parker D.P2P mobile sensor networks.The 38th Annual Hawaii International Conference on System Science.2005:1-9.
[86]Jens O. Oberender, Frank-Uwe Andersen. Enabling Mobile Peer-to-Peer Networking.In: Proceedings of the 1st International Workshop of the EURO-NGI Networking of Exellence-Wireless Systems and Mobility in Next Generation Internet,LNCS. Springer-Verlag Berlin Heidelberg, 2005, 3427(2):219-234.
[87]Liu J. Peer-Tree: A peer-to-peer message forwarding structure for relaying messages in mobile applications.The 2nd International Workshop on Hot Topics in Peer-to-Peer Systems. 2005:87-94.
[88]Meier R, Cahill V et al. Proximity-Based service discovery in mobile ad hoc networks.The 5th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable System. 2005:1-15.
[89]Zahn T, Winter R, Schiller J.Simple, efficient peer-to-peer overlay clustering in mobile ad hoc networks.The 12th IEEE International Conferece on Netorks,Vol.2. 2004:520-524.
[90]Cheng JJ et al.The architecture on the mobile P2P system and the study for the key technology. Journal of Beijing University of Posts and Telecommunications, 2006, 29(4):86-89.
[91]Sato K, Katsumoto M, Miki T. P2PMVOD: Peer-to-Peer mobile video on-demand.The 8th International Conference on Advanced CommunicationTechnology.2006:1866-1870.
[92]Balfe S,Lakhani AD,Paterson KG.Trusted computing: Providing security for peer-to-peer networks.The 5th IEEE International Conference on Peer-to-Peer Computing.2005:117-124.
[93]Sit E and Morris R. Security considerations for peer-to-peer distributed hash tables.The 1st International Workshop n Peer-to-Peer Systems. 2002:261-269.
[94]Fenkam P et al. Towards an access control system for mobile peer-to-peer collaborative environments.The 11th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise. 2002:95-100.
[95]Han JS et al.Provide privacy for mobile P2P systems.The 25th IEEE International Conference on Distributed Computing Systems Workshops. 2005:829-834.
[96]Liu XM and Xiao L.HIREP: Hierarchical reputation management for peer-to-peer systems.The 2006 International Conference on Parallel Processing. 2006:289-296.
[97]Andersen F, de Meer H, Dedinski I. An architecture concept for mobile P2P file sharing services.The Workshop at Information 2004 Algorithms and Protocols for Efficient Peer-to-Peer Applications. Bonner Kollen Verlag, 2004:229-233.
[98]HoBfeld T, Tutschku K, Andersen FU.Mapping of file-sharing onto mobile environments: Feasibility and performance of eDonkey with GPRS. The IEEE Conference Wireless Communications and Networking, Vol.4, 2005:2453-2458.
[99]Hofeld T, Tutschku K, Andersen FU.Mapping of file-sharing onto mobile environments: Enhancement by UMTS.The 3rd International Conference on Pervasive Computing and Communications Workshops, 2005:43-49.
[100]Bakos B et al.Peer-to-Peer protocol evaluation in topologiesresembling wireless networks. An experiment with Gnutella query engine.The 11th IEEE International Conference on Networks, 2003:673-680.
[101]Hu THT, Thai B, Seneviratne A. Supporting mobile devices in Gnutella file sharing network with mobile agents.The 8th IEEE International Symp. Computers and Communication (ISCC 2003), 2003:1035-1040.
[102]Castro M, Drushel P, Hu YC, Rowstron A. Exploiting network proximity in peer-to-pee rnetworks.TechnicalReport,MSR-TR-2002-82, Microsoft Research,2002.
[103]Cramer C and Fuhrmann T.ISPRP: A message-efficient protocol for initializing structured P2P networks.The 24th IEEE International Conference on Performance. Computing and Communications, 2005:365-370.
[104]Papadopouli M and Schulzrinne H. Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. The ACM Symp. Mobile Ad Hoc Networking & Computing.New York: ACM, 2001:117-127.
[105]Lindemann C and Waldhorst O P. A distributed search service for peer-to-peer file sharing in mobile applications.The 2nd International Conference on Peer-to-Peer Computing. Washington: IEEE Computer Society, 2002:73-80.
[106]Lindemann C ,Waldhorst O P.Consistency mechanisms for a distributed lookup service supporting mobile applications. The 3rd ACM International Workshop on Data Engineering for Wireless and Mobile Access.New York: ACM, 2003:61-68.
[107]Lindemann C and Waldhorst O P.Exploiting epidemic data dissemination for consistent lookup operations in mobile applications. Mobile Computing and Communications Review, 2004, 8(2):44.
[108]Lau G,Jaseemuddin M, Ravindran G. RAON: A P2P network for MANET.The2nd IFIP International Conference on Wireless and Optical Communications Networks,2005:316-322.
[109]Chawathe Y, Ratnasamy S,et al. Making Gnutella-like P2P systems scalable.The 2003 Conference Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2003:407-418.
[110]Lee C, Helal A,et al. Konark: A system and protocols for device independent, peer-to-peer discovery and delivery of mobile services. IEEE Transaction on Systems, Man and Cybernetics, 2003, 33(6):682-696.
[111]Schollmeier R, Gruber I, Niethammer F. Protocol for peer-to-peer networking in mobile environments.The 12th International Conference Computer Communications and Networks, 2003:121-127.
[112]Klemm A, Lindemann C, Waldhort O P. A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks Proceedings of the Workshop on Mobile Ad Hoc Network and Computing MADNET 2003. Sophia- Antipolis, France,2003.
[113]Joseph MS, Kumar M,et al. Energy efficient data retrieval and caching in mobile peer-to-peer networks.The 3rd IEEEInternational Confernce on Pervasive Computing and Communications Workshops, 2005:50-54.
[114]He YF, Lee I,et al. Centralized Peer-to-Peer Video Streaming Over Hybrid Wireless Network.The IEEE International Conference on Multimedia and Explore 2005, 2005:550-553.
[115]Seet BC, Lau CT,et al. A mobile system of super-peers using city buses.The 3rd IEEEInternational Conference on Pervasive Computing and Communications Workshops,2005:80-85.
[116]Castro M, Drushel P, Hu YC, Rowstron A. Exploiting network proximity in peer-to-peer networks.Technical Report.MSR-TR-2002-82.Microsoft Research, 2002.
[117]Delmastro F. From pastry to CrossROAD: CROSS-Layer ring overlay for ad hoc networks.The 3rd IEEE International Conference on Pervasive Computing and Communications Workshops. Washington: IEEE Computer Society, 2005:60-64.
[118]YAN Lu, SERE k, ZHOU Xinrong.Towards an integrated architecture for peer-to-peer and Ad hoc overlay network application proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems[C].[SI]:[sn]:2004.
[119]HOROZOV T, GRAMA A, VASUDEVAN V, et al. MOBY: a mobile peer-to-peer service and data network: The International Conference on Parallel[C]. Washington DC: IEEE Computer Society, 2002:437-444.
[120]KORTUERN G,SCHNEDER J,PREUITT D.When peer-to-peer comes face-to-face.Collaborative peer-to-peer computing in mobile Ad hoc networks proceedings of the 1st International Conference on Peer-to-Peer Computing[C].[SI]:[sn],2001:75-91.
[121]MASCOLO C, CAPRAL, ZACHARIADIS S, et al. XM IDDLE: a data-sharing middleware for mobile computing [J].International Journal on Wireless Personal Communication, 2002, 21(1):77-103.
[122]KOTLANEN N,WEBER M,VAPA M, et al. Mobile chedar: a peer-to-peer middleware for mobile devices: proceedings of the 3rd International Conference on Pervasive Computing and Communiactions Workshops[C]. [SI]: [Sn], 2005:86-90.
[123]MAMEIM,ZAMBONBLLF,LEONARDIL.Tuples on the air a middleware for context-aware computing in dynamic networks proceedings of the 23rd International Conference on Distributed Computing Systems Workshops[C]. [SI]: [Sn], 2003:342.
[124]HSIAOH C, KNGC T.Bristle: a mobile structured peer-to-peer architecture.International Parallel and Distributed Processing Symposium [C]. [SI]: [Sn], 2003.
[125]HU Y C, DAS S M, PUCHA H. Peer-to-Peer overlay abstractions in MANETs: proc.of the 1st International workshop on Decentralized Resource sharing in mobile computing Networking[C].New York: ACM Press,2004.
[126]HU Y C, DAS S M, PUCHA H.Exploiting the synergy between peer-to-peer and mobile Ad hoc networks. USENIX Association, the 9th Workshop on Hot Topics Operating Systems[C]. [SI]: [Sn], 2003.
[127]段炳玺,李伯年.WLAN中IEEE802.11n标准及关键技术研究[J].通信技术,2008,8.
[128]刘乃安.无线局域网(WLAN)-原理、技术与原理[M].西安:西安电子科技大学出版社,2004:45-46.
[129]Sripanidkulchai k, Maaggs B, Zhang Hui.Efficient content location using interest-based locality in peer-to-peer systems[J]//Proc.of the ACM SIGCOMM.New York: ACMPress, 2003:175-186.
[130]Guo Lei,Jiang Song,Xiao Li,et al.Fast and low-cost search schemes by exploiting localities in P2P networks[J].Journal of Parallel and Distributed Computing,2005,65(6):729-742.
[131]徐雷鸣,庞博等.NS与网络模拟.北京:人民邮电出版社,2003:46-133.
[132]王文博,张金文.OPNET Modeler与网络仿真[M].北京:人民邮电出版社,2003.
[133]宦若红,金向东.无线通信系统的Matlab仿真[J].电子技术应用,2006.
[134]翁剑枫,叶志前.MATLAB,LabVIEW,SystemView仿真分析基础[M].机械工业出版社.2005,1.
[135]Feeney L M.An energy consumption model for performance analysis of routing protocols for mobile Ad hoc nerworks[J].ACM Journal of Mobile Networks and Applications 6,2001,3(6):239-249.
[2]严晗,王典洪,张建辉.有关P2P的应用及其发展方向[J].现代计算机.2003(5):18-19.
[3]李振武,杨舰,白英彩.P2P网络研究及其挑战[J].计算机应用与软件.2004, 21(2):54-57.
[4]陈林星,曾曦,曹毅等.移动Ad Hoc网络-自组织分组无线网络技术.北京:电子工业工业出版社,2006:1-44.
[5]Ion Stocia, Robert Morris et al.Chord: A scalable peer-to-peer lookup service for internet application[C].In Proceedings of the 2001 ACM SIGCOMM Conference, 2001:149-160.
[6]Frank Dabek, Emma Brunskill et al.Building peer-to-peer systems with chord, a distributed lookup service.Proceedings of the workshop on Hot Topics in Operating Systems-HOTOS, 2001:81-86.
[7]Stoica I, Morris R et al. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 2003, 11(1): 1732.
[8]Ratnasamy S,Francis P et al.A scalable content addressable network.ACM SIGCOMM Computer Communication Review.2001,31(4):161-172.
[9]Ratnasamy Sylvia Paul. A scalable content-addressable network [D]: [Doctor Dissertation].Berkeley: University of California,2002.
[10]Boukhelef D, Kitagawa H. Multi-ring infrastructure for content addressable Networks.Proceeding of the 16th International Conference on Cooperative Information Systems.Lecture Notes in Computer Science, vol.5331.Springer Berlin, Heidelberg, 2008:193-211.
[11]Gnutella [OL].http://www.gnutella.com.
[12]Jovanovie MA. Modeling large-scale peer-to-peer networks and a casestudy of Gnutella [D]: [MS.Thesis].University of Cincinnati,2001.
[13]Ripeanu M.Peer-to-peer Architecture Case Study: Gnutella Network[C]. Proceeding of the First International Conference on Peer-to-Peer Computing, 2001.
[14]Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. The 18th IFIP/ACM International Conference on Distributed Systems Platforms. Heidelberg, 2001:320-350.
[15]Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing[R].Technical Report, UCB/CSD-01-1141, Computer Science Division, U.C.Berkeley, 2001.
[16]郑少仁,王海涛,赵志峰,米志超,黎宁.Ad Hoc网络技术.人民邮电出版社.2005:1-13.
[17]Basagni S,Conti M,Giorgano S, et al. Mobile Ad Hoc Network. Wiley-IEEE. 2004:69-300.
[18]ANDREW S.TANENBAUM著.计算机网络[M].潘爱民译.第4版.北京:清华大学出版社,2004:316-321.
[19]冯博琴,陈文革等.计算机网络[M].第2版.北京:高等教育出版社,1999:60-64.
[20]JAMES F,KUROSE,KETTH W.BOSS著.计算机网络-自顶向下的方法与INTERNET特色[M].第三版.北京:高等教育出版社,2005:139-145.
[21]Dana Moore,John Hebeler.对等网络.北京:清华大学出版社,2003.
[22]罗杰文.Peer to Peer综述.中科院计算技术研究所,2005.
[23]张联峰,刘乃安,钱秀槟,张玉清.综述:对等网(P2P)技术.计算机工程与应用,2003,39(12):142-145.
[24]周傲英,凌波. Peer-to-Peer系统及其应用[J].计算机科学.2002,29(8):200-203.
[25]陈梅等.P2P技术的研究与应用[J].计算机工程与应用.2002(130):20-23.
[26]吴功宜.计算机网络与互联网技术研究、应用和产业发展.北京:清华大学出版社,2008年8月:75-76.
[27]GONGL.Peer-to-Peer networks in action [J].IEEE Internet Computing, 2002, 6(1):37-39.
[28]李盛涛,吴丽辉,于满全等.主题Web信息采集的研究与设计.北京:清华大学出版社,2003.
[29]李晓明,李星主编.搜索引擎与Web挖掘进展[M].北京:高等教育出版社,2003:611-621.
[30]徐宝文,张卫峰.搜索引擎与信息获取技术[M].北京:清华大学出版社.2003:166-168.
[31]谭明佳.DNS技术的应用分析[J].计算机工程与设计,2004(4):596-598.
[32]Dave Roberts.Internet协议手册[M].希望图书创作室译.北京:海洋出版社,1998:238-248.
[33]蔡勇.FTP服务器技术研究及实现.电子科技大学出版社,2005:12-13.
[34]赵刚,林瑶,蒋慧等译.用TCP/IP进行网际互联(第1卷).北京:电子工业出版社,2001:145-173.
[35]Napster website.http://www.napster.com.
[36]BitTorrent[OL].http://www.bittorrent.com.
[37]Salman A.Baset, Henning G, Schulzrinne.An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol, NFOCOM 2006. The 25th IEEE International Conference on Computer Communications.Proceedings, 2006:1-11.
[38]J.Kubiatowicz, DBindel, Y.Chenet al.Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS. ACM, 2000.
[39]P.Druschel, A.Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility.In Proceeding of HOTOS, 2001:75-80.
[40]Kazaa[OL].http://www.kazaa.com.
[41]Handurukande s,Kermarrec A M,et al. Peer sharing behavior in the eDonkey network and implications for the design of serverless filesharing systems[C]//Pron of EuroSya’06.New York: ACM Press, 2006:359-371.
[42]SETI@Home.http://setiathome.berkeley.edu/index.html.
[43]刘晓华,张健,赵洁等.精通JBuilder 2006[M].北京:机械工业出版社,2006.
[44]柯晓华.基于Groove的智能商务协作模块的设计.科学管理研究,2008.28(8).
[45]顾颖彦.反射内存网实时通信技术的研究[J].系统仿真学报,2002,28(7).
[46]陈家翠,谷玉荣.Google学术搜索检索性能的分析及评价.情报理论与实践,2007,30(5):653-655.
[47]徐险峰,谷遇春.新一代雅虎搜索引擎的搜索功能和使用技巧.科技情报开发与经济,2007,17(8):219-210.
[48]吴建军.浅谈百度搜索引擎的功能与服务特点.科技情报开发与经济,2007,17(5):205-206.
[49]黄李建,王建新.P2P搜索技术研究.中国新通信,2008.
[50]周文莉,吴晓非.P2P技术综述.计算机工程与设计,2006,27(1).
[51]吴功宜.计算机网络与互联网技术研究、应用和产业发展.北京:清华大学出版社,2008年8月:78-82.
[52]Rüdiger Schollmeier. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications[C]. Proceedings of the First International Conference on Peer-to-Peer Computing,2001:101-102.
[53]Ripeanu M.Peer-to-Peer Architecture Case Study: Gnutella Network[C]. Proceedings of the First International Conference on Peer-to-Peer Computing, 2001.
[54]Kim H,Kim Y et al. Restricted path flooding scheme in distributed P2P overlay networks. ICISS 2008: International Conference on Information Science and Security Proceedings, 2008:58-61.
[55]Buccafurri F and Lax G. Enabling selective flooding to reduce P2P traffic. On the Move to Meaningful Internet Systems 2007: COOPLS, DOA,ODBASE, GADA, AND ISPT1, Proceedings, Vol.49803, 2007:188-205.
[56]Guan ZT, Cao YD, Hou XS et al. A novel efficient search algorithm in unstructured P2P networks.Sencond Workshop on Digital Media and ITS Application in Museum & Heritage Proceedings, 2007:275-280.
[57]Q Zhao,J Liu,J xu.Improving Search on Gnutella-Like P2P Systems. Computatational Science-ICCS2007-7th International Conference, LNCS. Springer-Verlag Berlin Heidelberg, 2007, 4490(4):887-890.
[58]B. Yang and H. Garcia-Molina.Improving Search in Peer-to-Peer Systems. In Proceedings of ICDCS,2002.
[59]Jennifer J et al.Fighting organized crimes: using shortest-path algorithm to identify associations in criminal networks. Desicion Support systems.Vol.38, 2004:473-487.
[60]Zhong M, Shen K, Seiferas J. The convergence-guaranteed random walk and its applications in peer-to-peer networks.IEEE Transactions on Computers, Vol.57, 2008:619-633.
[61]Bisnik N and Abouzeid AA.Optimizing random walk search algorithms in P2P networks.Computer networks,Vol.51,2007:499-1514.
[62]Gkantsidis C,Mihail M, Saberi A. Random walks in peer-to-peer networks: Algorithms and evaluation.Performance Evaluation, Vol.63, 2006:241-263.
[63]刘凡,陈兴蜀,王文贤.对Gnutella2网络节点分布特性的研究.计算机科学,2008,24(3B):342-344.
[64]凌波,陆志国,黄维雄.PeerIS:基于Peer-to-Peer的信息检索系统.软件学报,2004,15(9):1375-1384.
[65]张泽洲,朱清新.基于移动Agent和最优搜索理论的CBIR系统.计算机应用与软件.2005,12(10):93-95.
[66]Alexandru Suna etc. A Mobile Agents Platform:Architectrue,Mobility and Security[M].Springer-Verleg,2005:1134-1142.
[67]王杨,王汝传,徐小龙.应用移动代理的自组织P2P网络模型.通信学报,2008,29(5):34-42.
[68]李士宁,夏贻勇,杜艳丽.对等网络中DHT搜索算法综述.计算机应用研究,2008,25(6):1611-1615.
[69]STOICA I, MORRIS R, LIBEN-NOWELL D, et al.Chord: a scalable peer-to-peer lookup protocol for Internet application [J].IEEE/ACM Transaction on Networking, 2003, 11(1):17-32.
[70]宋建涛,沙超峰,杨智应,朱洪.语义对等网构造及搜索机制研究.计算机研究与发展,2004,41(4):645-651.
[71]石伟兴,林浒,雷为民.SIP PASTRY的设计与实现.小型微型计算机系统,2006,27(11):2012-2015.
[72]ZHAO B Y, LING Huang et al. Tapestry: a reailient global-scale overlay for service deployment [J].IEEE Journal on Selected Areas in Communications, 2004, 22(1):41-53.
[73]KaZaA[OL].http://www.KaZaA.com/.
[74]吴麒,刘毅,陈兴蜀,王文贤,郑炳伦.eDonkey的网络爬行技术及特性分析.计算机应用研究,2009,26(3):1047-1049.
[75]eMule[CP/DK].http://www.emule-project.net.
[76]孙震强.WiFi WiMAX WBMA与3G.中国无线电,2004(4):21-24.
[77]钟章队,蒋文怡,李红君.GPRS通用分组无线业务[M].北京:人民邮电出版社,2001.
[78]艾明,陈山枝.一种UMTS-WLAN网络互联互通的新模型及其认证机制.高技术通讯,2007,17(8).
[79]刘淇,李承恕.WLAN与B3G结合的结构框架和接入技术.铁道学报,2006, 28(4).
[80]周蔚文,俞东慧,孙美艳等.Wi-Fi全球商用发展及分析.电信科学,2008, 24(5).
[81]彭木根,李铭,路杨,王文博.IEEE802.16标准和WIMAX组网技术分析.电信工程技术与标准化,2005(6).
[82]Oppermann I, Stoica L et al.UWB wireless sensor networks: UWEN-Apractical example. IEEE Communications Magazine, 2004, 42(12):27-32.
[83]KALOGERAKIV. Mobile peer-to-peer computing challenges, metrics and applications proceedings of the 6th International Conference on Mobile Data Management[C].New York: ACM Press, 2005.
[84]Gerd Kortuern,Jay Schneider, Dustin Preuitt, et al. When Peer-to-Peer comes Face-to-Face: Collaborative Peer-to-Peer Computing in Mobile ad-hoc Network.In: Proceedings of the 1st International Conference on Peer-to-Peer Computing, 2001:75-91.
[85]Krco S,Cleary D,Parker D.P2P mobile sensor networks.The 38th Annual Hawaii International Conference on System Science.2005:1-9.
[86]Jens O. Oberender, Frank-Uwe Andersen. Enabling Mobile Peer-to-Peer Networking.In: Proceedings of the 1st International Workshop of the EURO-NGI Networking of Exellence-Wireless Systems and Mobility in Next Generation Internet,LNCS. Springer-Verlag Berlin Heidelberg, 2005, 3427(2):219-234.
[87]Liu J. Peer-Tree: A peer-to-peer message forwarding structure for relaying messages in mobile applications.The 2nd International Workshop on Hot Topics in Peer-to-Peer Systems. 2005:87-94.
[88]Meier R, Cahill V et al. Proximity-Based service discovery in mobile ad hoc networks.The 5th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable System. 2005:1-15.
[89]Zahn T, Winter R, Schiller J.Simple, efficient peer-to-peer overlay clustering in mobile ad hoc networks.The 12th IEEE International Conferece on Netorks,Vol.2. 2004:520-524.
[90]Cheng JJ et al.The architecture on the mobile P2P system and the study for the key technology. Journal of Beijing University of Posts and Telecommunications, 2006, 29(4):86-89.
[91]Sato K, Katsumoto M, Miki T. P2PMVOD: Peer-to-Peer mobile video on-demand.The 8th International Conference on Advanced CommunicationTechnology.2006:1866-1870.
[92]Balfe S,Lakhani AD,Paterson KG.Trusted computing: Providing security for peer-to-peer networks.The 5th IEEE International Conference on Peer-to-Peer Computing.2005:117-124.
[93]Sit E and Morris R. Security considerations for peer-to-peer distributed hash tables.The 1st International Workshop n Peer-to-Peer Systems. 2002:261-269.
[94]Fenkam P et al. Towards an access control system for mobile peer-to-peer collaborative environments.The 11th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise. 2002:95-100.
[95]Han JS et al.Provide privacy for mobile P2P systems.The 25th IEEE International Conference on Distributed Computing Systems Workshops. 2005:829-834.
[96]Liu XM and Xiao L.HIREP: Hierarchical reputation management for peer-to-peer systems.The 2006 International Conference on Parallel Processing. 2006:289-296.
[97]Andersen F, de Meer H, Dedinski I. An architecture concept for mobile P2P file sharing services.The Workshop at Information 2004 Algorithms and Protocols for Efficient Peer-to-Peer Applications. Bonner Kollen Verlag, 2004:229-233.
[98]HoBfeld T, Tutschku K, Andersen FU.Mapping of file-sharing onto mobile environments: Feasibility and performance of eDonkey with GPRS. The IEEE Conference Wireless Communications and Networking, Vol.4, 2005:2453-2458.
[99]Hofeld T, Tutschku K, Andersen FU.Mapping of file-sharing onto mobile environments: Enhancement by UMTS.The 3rd International Conference on Pervasive Computing and Communications Workshops, 2005:43-49.
[100]Bakos B et al.Peer-to-Peer protocol evaluation in topologiesresembling wireless networks. An experiment with Gnutella query engine.The 11th IEEE International Conference on Networks, 2003:673-680.
[101]Hu THT, Thai B, Seneviratne A. Supporting mobile devices in Gnutella file sharing network with mobile agents.The 8th IEEE International Symp. Computers and Communication (ISCC 2003), 2003:1035-1040.
[102]Castro M, Drushel P, Hu YC, Rowstron A. Exploiting network proximity in peer-to-pee rnetworks.TechnicalReport,MSR-TR-2002-82, Microsoft Research,2002.
[103]Cramer C and Fuhrmann T.ISPRP: A message-efficient protocol for initializing structured P2P networks.The 24th IEEE International Conference on Performance. Computing and Communications, 2005:365-370.
[104]Papadopouli M and Schulzrinne H. Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. The ACM Symp. Mobile Ad Hoc Networking & Computing.New York: ACM, 2001:117-127.
[105]Lindemann C and Waldhorst O P. A distributed search service for peer-to-peer file sharing in mobile applications.The 2nd International Conference on Peer-to-Peer Computing. Washington: IEEE Computer Society, 2002:73-80.
[106]Lindemann C ,Waldhorst O P.Consistency mechanisms for a distributed lookup service supporting mobile applications. The 3rd ACM International Workshop on Data Engineering for Wireless and Mobile Access.New York: ACM, 2003:61-68.
[107]Lindemann C and Waldhorst O P.Exploiting epidemic data dissemination for consistent lookup operations in mobile applications. Mobile Computing and Communications Review, 2004, 8(2):44.
[108]Lau G,Jaseemuddin M, Ravindran G. RAON: A P2P network for MANET.The2nd IFIP International Conference on Wireless and Optical Communications Networks,2005:316-322.
[109]Chawathe Y, Ratnasamy S,et al. Making Gnutella-like P2P systems scalable.The 2003 Conference Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2003:407-418.
[110]Lee C, Helal A,et al. Konark: A system and protocols for device independent, peer-to-peer discovery and delivery of mobile services. IEEE Transaction on Systems, Man and Cybernetics, 2003, 33(6):682-696.
[111]Schollmeier R, Gruber I, Niethammer F. Protocol for peer-to-peer networking in mobile environments.The 12th International Conference Computer Communications and Networks, 2003:121-127.
[112]Klemm A, Lindemann C, Waldhort O P. A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks Proceedings of the Workshop on Mobile Ad Hoc Network and Computing MADNET 2003. Sophia- Antipolis, France,2003.
[113]Joseph MS, Kumar M,et al. Energy efficient data retrieval and caching in mobile peer-to-peer networks.The 3rd IEEEInternational Confernce on Pervasive Computing and Communications Workshops, 2005:50-54.
[114]He YF, Lee I,et al. Centralized Peer-to-Peer Video Streaming Over Hybrid Wireless Network.The IEEE International Conference on Multimedia and Explore 2005, 2005:550-553.
[115]Seet BC, Lau CT,et al. A mobile system of super-peers using city buses.The 3rd IEEEInternational Conference on Pervasive Computing and Communications Workshops,2005:80-85.
[116]Castro M, Drushel P, Hu YC, Rowstron A. Exploiting network proximity in peer-to-peer networks.Technical Report.MSR-TR-2002-82.Microsoft Research, 2002.
[117]Delmastro F. From pastry to CrossROAD: CROSS-Layer ring overlay for ad hoc networks.The 3rd IEEE International Conference on Pervasive Computing and Communications Workshops. Washington: IEEE Computer Society, 2005:60-64.
[118]YAN Lu, SERE k, ZHOU Xinrong.Towards an integrated architecture for peer-to-peer and Ad hoc overlay network application proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems[C].[SI]:[sn]:2004.
[119]HOROZOV T, GRAMA A, VASUDEVAN V, et al. MOBY: a mobile peer-to-peer service and data network: The International Conference on Parallel[C]. Washington DC: IEEE Computer Society, 2002:437-444.
[120]KORTUERN G,SCHNEDER J,PREUITT D.When peer-to-peer comes face-to-face.Collaborative peer-to-peer computing in mobile Ad hoc networks proceedings of the 1st International Conference on Peer-to-Peer Computing[C].[SI]:[sn],2001:75-91.
[121]MASCOLO C, CAPRAL, ZACHARIADIS S, et al. XM IDDLE: a data-sharing middleware for mobile computing [J].International Journal on Wireless Personal Communication, 2002, 21(1):77-103.
[122]KOTLANEN N,WEBER M,VAPA M, et al. Mobile chedar: a peer-to-peer middleware for mobile devices: proceedings of the 3rd International Conference on Pervasive Computing and Communiactions Workshops[C]. [SI]: [Sn], 2005:86-90.
[123]MAMEIM,ZAMBONBLLF,LEONARDIL.Tuples on the air a middleware for context-aware computing in dynamic networks proceedings of the 23rd International Conference on Distributed Computing Systems Workshops[C]. [SI]: [Sn], 2003:342.
[124]HSIAOH C, KNGC T.Bristle: a mobile structured peer-to-peer architecture.International Parallel and Distributed Processing Symposium [C]. [SI]: [Sn], 2003.
[125]HU Y C, DAS S M, PUCHA H. Peer-to-Peer overlay abstractions in MANETs: proc.of the 1st International workshop on Decentralized Resource sharing in mobile computing Networking[C].New York: ACM Press,2004.
[126]HU Y C, DAS S M, PUCHA H.Exploiting the synergy between peer-to-peer and mobile Ad hoc networks. USENIX Association, the 9th Workshop on Hot Topics Operating Systems[C]. [SI]: [Sn], 2003.
[127]段炳玺,李伯年.WLAN中IEEE802.11n标准及关键技术研究[J].通信技术,2008,8.
[128]刘乃安.无线局域网(WLAN)-原理、技术与原理[M].西安:西安电子科技大学出版社,2004:45-46.
[129]Sripanidkulchai k, Maaggs B, Zhang Hui.Efficient content location using interest-based locality in peer-to-peer systems[J]//Proc.of the ACM SIGCOMM.New York: ACMPress, 2003:175-186.
[130]Guo Lei,Jiang Song,Xiao Li,et al.Fast and low-cost search schemes by exploiting localities in P2P networks[J].Journal of Parallel and Distributed Computing,2005,65(6):729-742.
[131]徐雷鸣,庞博等.NS与网络模拟.北京:人民邮电出版社,2003:46-133.
[132]王文博,张金文.OPNET Modeler与网络仿真[M].北京:人民邮电出版社,2003.
[133]宦若红,金向东.无线通信系统的Matlab仿真[J].电子技术应用,2006.
[134]翁剑枫,叶志前.MATLAB,LabVIEW,SystemView仿真分析基础[M].机械工业出版社.2005,1.
[135]Feeney L M.An energy consumption model for performance analysis of routing protocols for mobile Ad hoc nerworks[J].ACM Journal of Mobile Networks and Applications 6,2001,3(6):239-249.