基于MP2P的内容分发机制研究
|
摘要
随着移动终端设备性能的逐渐提高，移动网络得到快速的发展，MP2P作为对等网络与移动计算的产物，摆脱固定基站的束缚，为移动网络市场开辟了新的发展方向。MP2P网络继承了传统P2P网络的资源负载均衡、无中心化、节点对等、网络框架高分布性和易扩展性等优点，且无需基站支持，为在随时、随地实现信息的交互提供了便利条件。但其多跳、无线、节点频繁加入离开、不断移动的扰动性，给MP2P网络实现高效的内容分发带来了一系列的挑战。
本文主要针对无固定基站、自组织的无线网络进行研究，从支撑内容分发技术的网络框架，数据处理，缓存策略，及路由策略入手，以提高MP2P网络内容分发机制为目的进行研究工作。
首先，本文对无线移动自组网络拓扑的抗扰动性进行研究。由于移动设备的游走性，使得自组网络普遍存在不易管理和维护的问题，而网络框架是为网内数据处理及传输构建稳定环境的前提条件。因此，本文针对MP2P网络中动态节点特征，提出基于球形簇域的网络结构，将网络划分为多个子网进行分区管理，每个子网域由一个超级节点进行路由信息和分发策略的管理，簇域之间通过交叉区域中的机会节点进行信息传递，以此保障整个网络交互信息的连通性。可以有效提高命中率，减少信息传输延迟，降低动点对下载成功率的影响。
其次，基于上述MP2P网络拓扑基础，针对网络中数据下载成功率过分依赖种子节点的在线时间、数据重复传送及易引起网络拥塞等问题，本文提出一种基于网络编码的数据处理策略，对传输数据进行编、解码操作。同时，通过线性判断减少重复数据出现概率，减少通信数据占据空间，缩短数据在传输中的排队时间，降低了信道拥塞情况的发生。因此，可有效提高资源的下载成功率和吞吐量，降低传输时延，提高有限带宽内数据的传输效率。
同时，由于节点的动态特性，导致其所携带的资源不稳定，因此需要部分节点协助缓存资源。但移动终端的存储能力有限，在数据存储与数据替换策略上会直接影响网络的内容分发效率。本文提出一种基于部分网络编码的缓存策略，对节点处存储的数据进行编码处理，增大有限存储空间里所存储的信息数量，并及时更替存储空间已满的信息，使得可用性较高的信息得到存储，同时也避免缓存出现溢出而导致节点崩溃的问题。因此，在MP2P网络中，对数据进行部分网络编码的缓存操作可减少查询节点与存储节点的平均连接次数，加快下载进度，提高命中率，减少数据下载延迟。
最后，针对减少有限带宽和动点扰动性对数据传输的影响进行路由规划。由于数据发送路径的搭建及选择直接影响着网内资源定位及传输效率，因此，本文基于球形簇域的网络拓扑环境，在数据进行编码的前提下，提出采用语义相似度选择策略加强路由节点间互联关系，在多条可用路径中以向“潜在客户”推送相关数据、减少数据重传为原则进行路由规划。当节点在一定运动速度范围内时，此路由策略可有效提高查全率与查询效率，减少传输延迟，加强节点间协作能力，改善数据分发机制。
论文根据MP2P网络内容分发机制研究项目，对网络架构，传输及存储数据处理策略，路由策略等方面开展研究工作，并对关键技术及模块给予详细的研究方案。
With the gradual improvement in the performance of mobile terminal equipment, mobilenetwork has been undergoing a rapid development. MP2P as the product of peer-to-peernetwork and mobile computing, is free from fixed base station and provides a newdevelopment direction for the mobile network. MP2P, in line with its predecessor, thetraditional P2P, has the advantage of resource load balancing, no centralization, peer-to-peerequivalence, high distribution of network framework and scalability. Furthermore, MP2Pmakes it convenient to send messages at any time in any place without the base station.However, its other characters such as multi-hop, wirelessness, frequent joining and leaving,and constant leaving perturbation, all pose a series of challenges to achieving the efficiencyMP2P.
The paper, concerning on no fix base station, self-organizing wireless networks, is aimedat analyzing the network framework, data processing, caching strategies, routing strategies,with the ultimate objective to enhance the distribution of MP2P network content. The specificcontributions are as follows:
Firstly, the study is concerned with the anti-perturbation of wireless mobileself-organized network topology. The rumor of mobile equipment induces such genericproblems as difficulty in manageability and maintenance to self-organized networks. However,network framework is one of the key factors and the first step for the design of MP2P networkcontent distribution mechanism. The paper, considering the dynamic nodes of MP2P, proposesa network architecture based on sphere cluster, which divides the network into multiplesubnets managed by partition. Each subnet is managed by super node for information routingand distribution. The information is then transmitted by the transition node in crossing area toguarantee the connection of the information exchange. The strategy proposed herein canefficiently reduce the transmission delay and the influence of download success rate, andhence the hit rate can be improved.
Secondly, based on the aforementioned wireless ad hoc network topology, in terms of theproblems of the over-reliance of data download success rate on the seed online, repeated datatransmission and liability of network congestion, this paper proposes a network strategy to improve the content distribution efficiency of MP2P network. This strategy, in addition tostoring and forwarding information, can encode and decode information in the node. In themeantime, it reduces the rate of repeated data, space occupied by traffic data, shortenstransmission time, and eases channel congestions. Thus the download success rate isimproved, the transmission delay reduced the robustness of the MP2P content distributionenhanced as well.
Thirdly, the dynamic feature of nodes would result in the instability of carried resources,and thus a proportion of nodes are required to assist caching. However the limited capacity ofmobile terminals is limited would influence the content distribution efficiency. This paperhereby proposes a new cache strategy to optimize the node storage, make full use of thelimited storage space, update the storage the information in time and prevent the cacheoverflowing. Therefore, caching data by means of encoding a proportion of network canreduce the average connection of inquiring nodes and storage nodes, accelerate downloadspeed, increase hit rate, and reduce data download delay.
Last but not least, the present study devises a routing plan to solve to problem ofreducing the influence of limited bandwidth and perturbation on data transmission. Therefore,based on network topology of sphere cluster, this paper proposes a routing plan that enhancesthe connection of routing nodes on basis of semantic similarity, as well as pushing relevantdata and reducing repeated data transmission. When the node moves within a certain speedrange, this routing strategy can effectively improve the recall rate and query efficiency, reducetransmission delay, enhance inter-node collaboration capability, and improve data distributionmechanism.
This dissertation, based on the study of MP2P network distribution mechanism, exploresnetworking framework, data transmission and storage strategy, as well as routing strategy, andfurther proposes relevant detailed plans for key technologies and modules.
本文主要针对无固定基站、自组织的无线网络进行研究，从支撑内容分发技术的网络框架，数据处理，缓存策略，及路由策略入手，以提高MP2P网络内容分发机制为目的进行研究工作。
首先，本文对无线移动自组网络拓扑的抗扰动性进行研究。由于移动设备的游走性，使得自组网络普遍存在不易管理和维护的问题，而网络框架是为网内数据处理及传输构建稳定环境的前提条件。因此，本文针对MP2P网络中动态节点特征，提出基于球形簇域的网络结构，将网络划分为多个子网进行分区管理，每个子网域由一个超级节点进行路由信息和分发策略的管理，簇域之间通过交叉区域中的机会节点进行信息传递，以此保障整个网络交互信息的连通性。可以有效提高命中率，减少信息传输延迟，降低动点对下载成功率的影响。
其次，基于上述MP2P网络拓扑基础，针对网络中数据下载成功率过分依赖种子节点的在线时间、数据重复传送及易引起网络拥塞等问题，本文提出一种基于网络编码的数据处理策略，对传输数据进行编、解码操作。同时，通过线性判断减少重复数据出现概率，减少通信数据占据空间，缩短数据在传输中的排队时间，降低了信道拥塞情况的发生。因此，可有效提高资源的下载成功率和吞吐量，降低传输时延，提高有限带宽内数据的传输效率。
同时，由于节点的动态特性，导致其所携带的资源不稳定，因此需要部分节点协助缓存资源。但移动终端的存储能力有限，在数据存储与数据替换策略上会直接影响网络的内容分发效率。本文提出一种基于部分网络编码的缓存策略，对节点处存储的数据进行编码处理，增大有限存储空间里所存储的信息数量，并及时更替存储空间已满的信息，使得可用性较高的信息得到存储，同时也避免缓存出现溢出而导致节点崩溃的问题。因此，在MP2P网络中，对数据进行部分网络编码的缓存操作可减少查询节点与存储节点的平均连接次数，加快下载进度，提高命中率，减少数据下载延迟。
最后，针对减少有限带宽和动点扰动性对数据传输的影响进行路由规划。由于数据发送路径的搭建及选择直接影响着网内资源定位及传输效率，因此，本文基于球形簇域的网络拓扑环境，在数据进行编码的前提下，提出采用语义相似度选择策略加强路由节点间互联关系，在多条可用路径中以向“潜在客户”推送相关数据、减少数据重传为原则进行路由规划。当节点在一定运动速度范围内时，此路由策略可有效提高查全率与查询效率，减少传输延迟，加强节点间协作能力，改善数据分发机制。
论文根据MP2P网络内容分发机制研究项目，对网络架构，传输及存储数据处理策略，路由策略等方面开展研究工作，并对关键技术及模块给予详细的研究方案。
With the gradual improvement in the performance of mobile terminal equipment, mobilenetwork has been undergoing a rapid development. MP2P as the product of peer-to-peernetwork and mobile computing, is free from fixed base station and provides a newdevelopment direction for the mobile network. MP2P, in line with its predecessor, thetraditional P2P, has the advantage of resource load balancing, no centralization, peer-to-peerequivalence, high distribution of network framework and scalability. Furthermore, MP2Pmakes it convenient to send messages at any time in any place without the base station.However, its other characters such as multi-hop, wirelessness, frequent joining and leaving,and constant leaving perturbation, all pose a series of challenges to achieving the efficiencyMP2P.
The paper, concerning on no fix base station, self-organizing wireless networks, is aimedat analyzing the network framework, data processing, caching strategies, routing strategies,with the ultimate objective to enhance the distribution of MP2P network content. The specificcontributions are as follows:
Firstly, the study is concerned with the anti-perturbation of wireless mobileself-organized network topology. The rumor of mobile equipment induces such genericproblems as difficulty in manageability and maintenance to self-organized networks. However,network framework is one of the key factors and the first step for the design of MP2P networkcontent distribution mechanism. The paper, considering the dynamic nodes of MP2P, proposesa network architecture based on sphere cluster, which divides the network into multiplesubnets managed by partition. Each subnet is managed by super node for information routingand distribution. The information is then transmitted by the transition node in crossing area toguarantee the connection of the information exchange. The strategy proposed herein canefficiently reduce the transmission delay and the influence of download success rate, andhence the hit rate can be improved.
Secondly, based on the aforementioned wireless ad hoc network topology, in terms of theproblems of the over-reliance of data download success rate on the seed online, repeated datatransmission and liability of network congestion, this paper proposes a network strategy to improve the content distribution efficiency of MP2P network. This strategy, in addition tostoring and forwarding information, can encode and decode information in the node. In themeantime, it reduces the rate of repeated data, space occupied by traffic data, shortenstransmission time, and eases channel congestions. Thus the download success rate isimproved, the transmission delay reduced the robustness of the MP2P content distributionenhanced as well.
Thirdly, the dynamic feature of nodes would result in the instability of carried resources,and thus a proportion of nodes are required to assist caching. However the limited capacity ofmobile terminals is limited would influence the content distribution efficiency. This paperhereby proposes a new cache strategy to optimize the node storage, make full use of thelimited storage space, update the storage the information in time and prevent the cacheoverflowing. Therefore, caching data by means of encoding a proportion of network canreduce the average connection of inquiring nodes and storage nodes, accelerate downloadspeed, increase hit rate, and reduce data download delay.
Last but not least, the present study devises a routing plan to solve to problem ofreducing the influence of limited bandwidth and perturbation on data transmission. Therefore,based on network topology of sphere cluster, this paper proposes a routing plan that enhancesthe connection of routing nodes on basis of semantic similarity, as well as pushing relevantdata and reducing repeated data transmission. When the node moves within a certain speedrange, this routing strategy can effectively improve the recall rate and query efficiency, reducetransmission delay, enhance inter-node collaboration capability, and improve data distributionmechanism.
This dissertation, based on the study of MP2P network distribution mechanism, exploresnetworking framework, data transmission and storage strategy, as well as routing strategy, andfurther proposes relevant detailed plans for key technologies and modules.
引文
[1]刘琼,徐鹏,杨海涛,彭芸. Peer-to-Peer文件共享系统的测量研究.软件学报,2006,17(10):2131-2140
[2]王若曈,张辉,杨家海,黄桂奋. P2P网络管理系统信息模型的设计与实现.通信学报,2010,31(1):85-91
[3]李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法.计算机研究与发展,2006,43(9):1579-1585
[4]田敬,代亚非. P2P持久存储研究.软件学报,2007,18(6):1379-1399
[5]雷迎春,阳立堂,姜琦,龚奕利,张军.度量和分析BitTorrent.计算机研究与发展,2008,45(9):1589-1600
[6]李泽平,卢显良,聂晓文,李林. P2P流媒体中的数据分配算法.计算机研究与发展,2009,46(11):1803-1813
[7]王学龙,张璟. P2P关键技术研究综述.计算机应用研究,2010,27(3):801-805
[8] Wu C, Li B, Zhao S. Multi-channel live P2P streaming: Re-focusing on servers.Proceedings of the27th Conference on Computer Communications,2008:1355-1363
[9] Chen C, Tsai KC. The server reassignment problemfor load balancing in structured P2Psystems. IEEE Transactions Parallel and Distributed Systems,2008:338-350
[10] Huang C, Wang A, Li J, et al. Understanding hybrid CDN-P2P: why limelight needs itsown Red Swoosh. Proceedings of the18th International Workshop on Network andOperating Systems Support for Digital Audio and Video. ACM,2008:75-80.
[11]田春岐,江建慧,胡治国,李峰.一种基于聚集超级节点的P2P网络信任模型.计算机学报,2010,33(2):345-355
[12] Cichon, J, Cichon, K. Node Evaluation in the Chord P2P Systems.Dependability of Computer Systems,2009:168-175
[13] He Qi. Congestion control and message loss in Gnutella networks. Proceedings of SPIE-The International Society for Optical Engineering,2004:16-27
[14] Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerantwide-area location and routing. Technical Report, Computer Science Division, U.C.Berkeley,2001
[15] Guo Yutang, Lv-Wanli. Improved Resource Discovery Algorithm on Gnutella Based onP2P Networks. Control Conference,2007:599-602
[16] Hung-Chang Hsiao,Chung-Ta king. Bristle: A Mobile Struetured Peer-to-PeerAhitecture.In:Proceedings of the2003Intemational Parallel and DistributedProcessing Symposium,2003:33-41
[17] Mehrotra U, Wai Yie Leong. NSEEAR: A energy adaptive routing protocol forheterogeneous wireless sensor networks.35th Annual Conference of IEEE IndustrialElectronics(IECON),2009:2647-2652
[18] H. Fariborzi, M. Moghavvemi. AMTR: energy aware multi-tree routing for wirelesssensor networks. Institution of Engineering and Technology (IET) Communications,2008:733-739
[19] CHRISTENSEN B G. Light peers: A lightweight mobile P2P platform. Proceedings ofthe Fifth Annual IEEEInternational Conference Pervasive Computing andCommu-nications Workshop,2007:132-136
[20] Niko Kotilainen, Matthien Weber, Mikko Vapa, et al. Mobile Chedar-A Peer-to-PeerMiddleware for Mobile Devices. In: Proceedings of the3rd International Conference onPervasive Computing and Communications Workshops,2005:86-90
[21] Marco Mamei, Franco Zambonelli. Letizia Leonardi. Tuples On The Air: A Middlewarefor Context-Aware Computing in Dynamic Networks. In: Proceedings of the23rdInternational Conference on Distributed Computing Systems Workshops,2003:342-347
[22] Herrera O, Znati T. Modeling churn in P2P networks. Proc.of the40th AnnualSimulation Symp,2007:33-40
[23] Wang F, Liu J, Xiong Y.Stable peers: Existence,i mpor-tance,and application inpeer-to-peer live video streaming. Proceedings of the27th Conference on ComputerCommuni-cations,2008:2038-2046
[24] Christian Bettstetter. On the Connectivity of Ad Hoc Networks. Journal of Computer,2004,47(4):432-447
[25]冯劲潇,陈贵海,谢俊元.基于分层象限空间的P2P超级节点拓扑构造.计算机学报,2010,(006):988-1003
[26] Zahn T, Winter R, Schiller J. Simple, efficient peer-to-peer overlay clustering in mobile,ad hoc networks. In: Proc. of the12th IEEE Int’l Conf. on Networks,2004:520524
[27] MEHYAR M,SPANOS D,PONGSAJAPAN J,LOW S. H,MURRAY R.M.Asynchronous distributed averaging on communication networks. IEEE ACMTransactions on Networking,2007:512-520
[28] Balfe S, Lakhani AD, Paterson KG. Trusted computing: Providing security forpeer-to-peer networks. In: Proc. of the5th IEEE Int’l Conf. on Peer-to-Peer Computing(P2P2005),2005:117124
[29] The Napster Homepage. http://www.napster.com/
[30] Panti M, Penserini L. A P2P Approach to Land Warriors Coordination, InternationalSymp.On Collaborative Technologies and Systems in conjunction with the2003WestenMulti Conferences, Orlando, Florida, Kluwer Academic Press,2003,35(1):45-54
[31] HARJULA E, YLIANTTILA M, ALA-KURIKKA J, et al. Plug-and-play applicationplatform: towards mobile peer-to-peer. Proceedings of the ACM3rd Int’l ConfonMobile and Ubiquitous Multimedia,2004:63-69
[32]张春红,裘晓峰,弭伟,纪阳等. P2P技术全面解析.北京：人民邮电出版社出版,2010-05-01
[33] Wu Yunnan, Das S M, Chandra R.Routing with aMarkovian metric to promote localmixing. IEEE In-ternational Conference on Computer Communications,2007:2381-2385
[34] Sun Qiang, Li La-Yuan, Chen Nian-Sheng, Aziz Sadia.I m-pact of power control onwireless Ad hoc network capacity. Proceedings of the3rdIEEEInternational Conferenceon Dis-tributed Computing in Sensor Systems (DCOSS07),2007:848-857
[35]夏卓群,陈志刚,叶晖,赵明.无线Mesh网多路径混合包的传输方法.小型微型计算机系统,2010(003):466-469
[36] Cavalcanti D, Kumar A, Agrawal D P. wireless AD Hoc Networking New York.Auerbach Publications,2007:483-503
[37] MurthyC, Siva Ram, Manoj B.S. Ad Hoc Wireless Networks: Architectures andProtocols. New Jersey, PRENTICE HALL,2004:11-18
[38] Ian F. Akyildiz, Xudong Wang, Weilin Wang. Wireless mesh networks: a survey.Computer networks, Elsevier,2005(4):445-487
[39] Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang. GRAdient Broadcast: A Robust DataDelivery Protocol for Large Scale Sensor Networks,2005:285-298
[40] Jing Zhao, Guohong Cao.VADD: vehicle-assisted data deliveryin vehicular ad hocnetworks. IEEE Transactions on Vehicu-lar Technology,2008:1910-1922
[41]李元振,廖建新,李彤红,朱晓民,张磊.城市场景车载Ad Hoc网络竞争转发关键参数分析.电子学报,2011(05):1154-1158
[42]黄世能,奚建清.分布数据缓存体系.软件学报,2001,12(07):1095-1100
[43]凌波,王晓宇,周傲英, Ng Wee-Siong.一种基于Peer-to-Peer技术的Web缓存共享系统研究.计算机学报,2005(02):170-178
[44] J-sang A, Ismail R, Boyd C.A survey of trust and reputation systems for online serviceprovision. Decision Support,2007:618-644
[45] Calcagno, C. Local reasoning about data update. Electronic Notes in TheoreticalComputer Science,2007:126-168
[46] Sumino H, Ishikawa N, Kato T. Design and implementation of P2P protocol for mobilephones. In Proc. of the4th Annual IEEE Int’1Conf. on Pervasive Computing andCommunications Workshops (PERCOMW2006). Washington: IEEE Computer Society,2006:157-162
[47] M. Castro, M. Jones, Anne-Marie Kermarrec, A. Rowstron, M. Theimer, H. Wang, andA. Wolman. An Evaluation of Scalable Application-Level MulticastBuilt UsingPeer-To-Peer Overlays. In Proceedings ofthe INFOCOM2003, San Francisco,2003:568-577
[48] Yang Guo, Kyoungwon Suh, Jim Kurose, Don Towsley. P2Cast: peer-to-peer patchingfor video on demand service. Multimedia Tools and Applications,2007:109-129
[49] 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
[50] Nishihara Y, Yokota Y, and Okubo E. A technique for construction of overlay networksfor MANETs with consideration of physical network topologies. First InternationalConference on Advances in P2P Systems,2009:66-71
[51] 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
[52] Shiguo W, Hong J. Realization of topology awareness in peer-to-peer wireless network.5th International Conference on Wireless Communications, Networking and MobileComputing,2009:1-4
[53] 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
[54] 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(3):333-347
[55]Lidan S, Xiaolong Z, Ping W, Gang C, and Jinxiang D. Supporting multi-dimensionalqueries in mobile P2P network. Information Sciences,2011,181(13):2841-2857
[56] Chun B G, Wu P, Weatherspoon H, et al.ChunkCast: An anycast service for large scalecontent distribution.http://iptps06.cs.ucsb.edu/papers/Chun-chunkcast06.pdf.2006,880-885
[57] Disruption tolerant networking (DTN).http://www.darpa.mil/sto/solicitations/DTN/index.htm.2008
[58] Zhao B Y, Huang L, Stribling J, et al. Tapestry: A resilient global-scale overlay forservice deployment. Selected Areas in Communications, IEEE Journal on,2004,22(1):41-53
[59] Zhengqiang Liang, Weisong Shi. Enforcing Cooperative Resource Sharing in UntrustedP2P Computing Environments. Department of Computer Science, Wayne StateUniversity,2005:971-983
[60] Qin Qiu, Zhi Tang, Yinyan Yu.A Decentralized Authorization Scheme for DRM in P2PFile-sharing Systems. ConsumerCommunications and Networking Conference (CCNC),2011:136-140
[61] The Gnutella Homepage. http//gnutella.wego.com/
[62] Gnutella.http://gnutella.wego.com/,2004-05
[63] Mihajlo A. Jovanovic B S. Modeling Large-scale Peer-to-PeerNetworks and a CaseStudy of Gnutella. University of Cincinnati.2000-06
[64] Li X and Ji H. Scalable peer-to-peer resource discovering scheme for wirelessself-organized networks. Journal of China Universities of Posts andTelecommunications,2009,16(2):47-52,57
[65] Nayeem Golam Moktader, Habib Md Ahsan, and Daiyan Golam Moktader. A newefficient approach for peer-to-peer file searching in mobile ad-hoc network.International Journal of Computer Science Issues,2012,9(2):321-327
[66] Raivio Y. A peer-to-peer overlay architecture for mobile networks. In HUT T-110.7190Research Seminar on Data Communications Software,2005:1-10
[67] Harjula E, Ylianttila M, Ala-Kurikka J, Riekki J, Sauvola J. Plug-and-Play applicationPlatform: Towards mobile peer-to-peer. In Proc. of the ACM3rd Int’l Conf. on Mobileand Ubiquitous Multimedia,2004.63-69
[68]方艺霖,李方敏,吴鹏,刘新华,马小林.无线Mesh网络组播路由协议.软件学报,2010:40-52
[69] Nadia N Qadri, Antonio Liotta. Peer-to-Peer over Mobile Ad Hoc Networks. Handbookof Research on NGN and Ubiquitous Computing,2008:20-51
[70]江国星,梅锐.基于泛洪约束的MANET按需组播路由协议.电子与信息学报,2010,32(2):37-53
[71] GKANTSIDIS C. RODIGUEZ P. Network coding for large scale content distribution.Proc of IEEE INFOCOM,2005:2235-2245
[72] YEUNG R W. Information theory and networkcoding. New York, NY, USA: Springer,2008:5-15
[73]黄佳庆,陶少国,熊志强等.网络编码关键理论问题研究.计算机应用研究,2008,25(8):2260-2264
[74] ACEDANSKIS, DEB S, MEDARD M, et a1. How good israndom linear coding baseddistributed networked storage. NetCod2005, Italy,2005:1-6
[75] Wang M, Li B. How practical is network coding. Proceedings of14th IEEEInternationalWorkshop on Quality of Service,2006:274-278
[76] HALLOUSHM, RADHA H. Network codingwith multi-generation mixing.Proceedingsof,42nd Annual Conference on InformationScience and System(CISS’08),2008:515-520
[77] CHOU P A, WU Y, JAIN K.Practical networkcoding. Proceedings of41st AnnualAllertonConference on Communication, Control, and Computing,2003:5-15
[78] HOT, MEDARD M, KOETTER R,et al. Arandom linear network coding approachtomulticast. IEEE Transactions on Information Theory,2006,52(10):4413-4430
[79]李文中,顾铁成,李春洪,陆桑璐,陈道蓄. G.Caching--一种网格协同缓存系统.计算机研究与发展,2004,41(12):2211-2217
[80] Jingjing Si. Unified frameworks for the constructions of variable-rate linearnetworkcodes and variable-rate static linear network codes. Proceedings2011InternationalSymposium on Network Coding (NetCod2011),2011:1-6
[81] Jianliang Meng. The optimization study of network coding for coding-aware wirelessMESH networks. Proceedings of the20102nd International Conference on FutureComputer and Communication (ICFCC2010),2010:537-40
[82] Aguilera M K, Janakiraman R, Xu L.On the Erasure Recoverability of MDS Codesunder Concurrent Updates. ISIT Proceedings,2005:1358-1362
[83] Y. Wu, P.A. Chou, S. Y. Kung. Information exchange in wirelessnetworks with networkcoding and physical-layer broadcast. in: Proceedings of the39th Annual Conference onInformation Sciencesand Systems (CISS), Baltimore,2005:233-239
[84] M. Luby, M. Watson, T. Gasiba, T. Stockhammer, W. Xu. Raptor codes for reliabledownload delivery in wireless broadcast systems. in: Proceedings of the IEEEConsumer Communications and NetworkingConference (CCNC),2006:92-103
[85] C. Gkantsidis and P. Rodriguez. Network Coding for Large ScaleContent Distribution.in Proc. of IEEE INFOCOM2005,2005:328-339
[86] Qureshi M K, Patt Y N. Utility-based Cache partitioning: Alow-overhead,high-performance, runtime mechanism to par-tition shared caches. Proceedings of the39th Annual IEEE/ACM International Symposium on Micro architecture,2006:173-198
[87] Hara. Data Replication for Improving Data Accessibility in Ad Hoc Networks.MobileComputing, IEEE Transactions,2006,5(11):1515-1532
[88]杨成,徐家品.稀疏车辆Ad Hoc网络移动模型研究.通信技术,2011,44(05):88-91
[89] W. Li, E. Chan, D.Chen, Energy-effective Cache Replacement Policies for CooperativeCaching in Mobile Ad Hoc network. Wireless Communications and NetworkingConference (WCNC'07),2007:3347-3352
[90] Amy Fu and Parastoo Sadeghi. r-Regular P2P Broadcast Networks: Optimal Delay andThroughput Using Network Coding.Communications (ICC),2011IEEE InternationalConference on,2011,1-5
[91] Luo Jiaqing, Zhou Shijie. Adaptive Flooding Routing Algorithm in UnstructuredP2P.Communications. Circuits and Systems Proceedings, International Conference,2006:1557-1561
[92] C.Gkantsidis, M.Mihail, and A.Saberi, Random walks in peer-to-peer networks. ProcIEEE INFOCOM’06,2006,63(3):241-263
[93] Jun Luo, Patrick Th Eugster, Jean Pierre Hubaux．Route driven gossip：probabilisticreliable multicast in ad hoc networks. INFOCOM2003. Twenty-Second AnnualJointConference of the IEEE Computer and Communications Societies,2003(3):2229-2239
[94] Cichon, J., Cichon, K.etc. Node Evaluation in the Chord P2P Systems. Dependability ofComputer Systems,2009:168-175
[95] Goldberg D, Nichols D, Oki B M, et al. Using collaborative filtering to weave aninformation Tapestry. Communications of the ACM,1992,35(12):61-70
[96] Guo Yutang, Lv-Wanli. Improved Resource Discovery Algorithm on Gnutella Based onP2P Networks. Control Conference,2007:599-602
[97] Stutzbach, D. Capturing accurate snapshots of the Gnutella network.25th IEEEINFOCOM Conference,2006:3057-3062
[98] Rowstron1A, Druschel P. Pastry: Scalable, Decentralized Object Location and Routingfor Large-scale Peer-to-Peer Systems. In Proc. of the18th IFIP/ACM Int’l Conferenceon Distributed Systems Platforms,2001:1012-1033
[99] Xu Wanjin. An Algorithm of Cache Preloading in Cooperative Caching Based on AdHoc Network. Proceedings of the2010International Conference on Internet Technologyand Applications (iTAP2010),2010:1-4
[100] Hu THT, Thai B, Seneviratne A. Supporting Mobile Devices in Gnutella File SharingNetwork with Mobile Agents. In Proc. of the8th IEEE Int’l Symp On Computers andCommunication,2003:1035-1040
[101]欧中洪,宋美娜,战晓苏,宋俊德.移动对等网络关键技术研究.软件学报,2008(1):126-140
[102] Bakos B, Farkas GC, Nurminen JK. Peer-to-Peer Protocol Evaluation in TopologiesResembling Wireless Networks. In Proc. of the11th IEEE Int’l Conference onNetworks,2003:673-680
[103] Hofeld T, Tutschku K, Andersen FU. Mapping of File-sharing onto MobileEnvironments: Enhancement by UMTS. In Proc. of the3rd Int’l Conference onPervasive Computing and Communications Workshops,2005:43-49
[104] Hofeld T, Tutschku K, Andersen FU. Mapping of File-sharing onto MobileEnvironments: Feasibility and Performance of eDonkey with GPRS. IEEE Conferenceon Wireless Communications and Networking,2005:2453-2458
[105] HOT, LEONG B, KOETTER R, et a1. Byzantinemodification detection in multicastnetworks usingrandomized network coding.2004IEEE InternationalSymposium onInformation Theory (ISIT),2004:143-147
[106]侯昉,赵跃龙,王禹.海量存储系统的层次化体系结构.小型微型计算机系统,2010(6):1158-1161
[107] Chia-Cheng Hu, Yu-Liang Kuo, Chun-Yuan Chiu and Yueh-Min Huang. MaximumBandwidth Routing and Maximum Flow Routing in Wireless Mesh Networks. SpringerLink Telecommunication Systems.2004,(44):125-134
[108]李伟,徐正全,杨铸.应用于移动互联网的Peer-to-Peer关键技术.软件学报,2009(8):199-213
[109]邱志欢,肖明忠,代亚非.一种P2P环境下基于用户行为的语义检索方案.软件学报,2007(09):216-225
[110] Zheng Q B, Peng W, Wang Y W, Lu X C. An efficient broadcast algorithm based onconnecteddominating set in unstructured peer-to-peer network. WISE2004, LNCS3306,BerlinHeidelberg,2004:724-729
[111] Y.Charlie Hu, Saumitra M. Das, Himabindu Pucha. Peer-to-Peer Overlay Abstractionsin MANETs. Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, andPeer-to-Peer Networks, CRC Press,2005:17-50
[112] Dongsheng Li, Xicheng Lu, Chuanfu Xu. Topology Construction and ResourceDiscovery in Peer-to-Peer Networks. Handbook of Theoretical and Algorithmic Aspectsof Ad Hoc, Sensor, and Peer-to-Peer Networks, Auerbach Publications,2005:733-765
[113] Frank H. P. Fitzek, Hassan Charaf. Mobile Peer-to-Peer (P2P): A Tutorial Guide. WileyPress,2009
[114] Boon-chong Seet. Mobile Peer-to-Peer Computing for Next Generation DistributedEnvironments. Information Science Publishing,2009
[115] Dong-Won Kum. Performance evaluation of AODV and DYMO routing protocols inMANET.20107th IEEE Consumer Communications and Networking Conference(CCNC),2010:1-2
[116] Zupeng Li. Implementation of P2P computing in design of MANET routing protocol.First International on Computer and Computational Sciences,2006:1-9
[117] C Gui, P Mohapatra. Overlay Multicast for MANETs Using Dynamic Virtual Mesh.Wireless Networks,2007(1):77-91
[118] R. Hekmat, P. Van Mieghem. Study of Connectivity in Wireless Ad-hoc Networks withan Improved Radio Model. Mobile Networks and Applications,2006,(3):351-360.
[119] Baumgar Ingrnar, Hiip Bernhard, Krause Stephan. A P2P Demonstrator PoweredbyOverSim. Peer-to-Peer Computing,2007. Seventh IEEE International Conference,2007:243-244
[120] Bessa, S. Storage and retrieval on P2P networks: a DHT based protocol.2007IEEESymposium on Computers and Communications,2007:623-630
[121] A. Klemm C. Lindemann, O.Waldhorst. A Special-purpose Peer-to-Peer File SharingSystem for Mobile Ad Hoc Networks.2003IEEE58th Vehicular TechnologyConference,2003:2758-2763
[122] Salim Y. El Rouayheb, Alex Sprintson, Costas N. Georghiades. On the Index CodingProblem and Its Relation to Network Coding and Matroid Theory,2010:3187-3195
[123] Jaggi S,Sanders P, Chou P A, Effros M, Egner S, Jain K, Tolhuizen L. Polynomialtimealgorithms for multicast network codeconstruction. IEEE TransactionsonInformation Theory,2003(49):831-836
[124] Koetter R, Medard M. An algebraic approach to network coding.IEEE/ACMTransactions on Networking,2003(10):1031-1042
[125]卢开澄,卢华明.图论及其应用.北京：清华大学出版社,2005:5-15
[126] West, D.B.图论导引（第二版）.北京：机械工业出版社,2006:117-133
[127] Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flowalgorithms for energy minimization in vision. Pattern Analysis and Machine Intelligence,IEEE Transactions on,2004,26(9):1124-1137
[128] GKANTSIDIS C, RODRIGUEZ P R. Networkcoding for large scale contentdistribution. Proceedings of24th Annual Joint Conference ofthe IEEE Computer andCommunications Societies (INFOCOM’05),2005,4(12):2235-2245
[129] Tao Luo, Jianjun Hao, Xiangming Li, Guangxin Le. A theoretical Method ofPerformance Estimate for Reed-Solomon Codes Concatenated Space-Time Block Codes.Journal of China Universities of Posts and Telecommunications,2002,9(1):30-34
[130] L. Li, R. Ramjee, M. Buddhikot, S. Miller. Network coding-based broadcast in mobilead hoc networks. in: IEEE INFOCOM,2007:335-346
[131] Andersen FU, de Meer H, Dedinski I. An Architecture Concept for Mobile P2P FileSharing Services. In Proc. of the2004Informatik Verbindet, Lecture Notes onInformatics, Bonner,2004:229-233
[132] I.Baumgart, B.Heep, and S. Krause. OverSirn: A flexible overlay network simulationframework. Proceedings of10th IEEE Global Internet Symposium (GI’07)inconjunctionwith IEEE INFOCOM,2007:5-15
[133] Liu J. Peer-Tree: A Peer-to-Peer Message Forwarding Structure for Relaying Messagesin Mobile Applications. In Proc. of the2nd Int’l Workshop on Hot Topics inPeer-to-Peer Systems,2005:87-94
[134] Peng G, Li SP, Jin HR, Ma TC. Dynamic Indices for Mobile Peer-to-Peer Networks. InProc. of the4th Int’l Conference on Computer and Information Technology,2004:410-415
[135] Schollmeier R, Gruber I, Niethammer F. Protocol for Peer-to-Peer Networking inMobile Environments. In Proc. Of the12th Int’l Conference on ComputerCommunications and Networks,2003:121-127
[136] Joseph MS, Kumar M, Shen HB, Das S. Energy Efficient Data Retrieval and Caching inMobile Peer-to-Peer Networks. In Proc. Of the3rd IEEE Int’l Conference onPervasive Computing and Communications Workshops,2005:50-54
[137] S.Y. R. Li and R. W. Yeung. Network multicast flow via linearcoding. in Proc. Int.Symp. Operational Research and Its Applications (ISORA’98),1998:197–211
[138] Li B C, ND. Random network coding in peer-to-peer networks: From theory to practice.Proceedings of the IEEE,2011,99(3):513-523
[139]肖潇,王伟平,杨路明.基于网络编码的无线网络广播重传方法.通信学报,2009,30(9):69-75
[140]雷迎春,程实,吴产乐.应用网络编码的P2P内容分发.计算机研究与发展,2009,46(1):108-119
[141] Ahlswede R, Cai N, Li S Y R, et al. Network information flow. Information Theory,IEEE Transactions on,2000,46(4):1204-1216
[142] R. Koetter, M. Medard. An Algebraic Approach to Network Coding. IEEETransactions on Networking,2003,5(11):782-795
[143] S.Y. R. Li, R. W. Yeung, N. Cai. Linear Network Coding. IEEE Trans. Info,2003,2(49):371-381
[144] T. Ho, R. Koetter, M. Medard, D. Karger, M. Effros. The Benefits of Coding overRouting in a Randomized Setting. in Proc. of InternationalSymposium on InformationTheory (ISIT2003),2003:442
[145] P. Sanders, S. Egner, L. Tolhuizen. Polynomialtime algorithms for the construction ofmulticast network codes.41st Annual Allerton Conference onCommunication Controland Computing,2003:210-121
[146] Kun Hao, Multi-objective Network Coding Optimization Based on NSGA-II Algorithm.2012International Conference on Control Engineering and Communication Technology(ICCECT),2012:843-849
[147]张小燕,吴辰文,葛立明.基于OMNeT++的IPv6协议仿真模型.微计算机信息,2007,23(3):61
[148] Lin, H Q, LiZ T, HuangQ F. Multifactor hierarchical fuzzy trust evaluation onpeer-to-peer networks. PEER-TO-PEER NETWORKING AND APPLICATIONS,2011,4(4):376-390
[149]李致远,王汝传.移动P2P网络安全拓扑构造协议.通信学报,2010:146-157
[150] Derr, Kurt, Manic, Milos. Extended Virtual Spring Mesh (EVSM): The DistributedSelf-Organizing Mobile Ad Hoc Network for Area Exploration. IEEETRANSACTIONS ONINDUSTRIAL ELECTRONICS,2011,58(12):424-5437
[151] He Li, Kyoung Soo Bok, Jae Soo Yoo.An efficient clustering method for unstructuredmobile peer-to-peer networks. RACS '11: Proceedings of the2011ACM Symposium onResearch in Applied Computation,2011:124-129
[152] TsaiFlora S,Han W C,Xu J W. Design and development of a mobile peer-to-peer socialnetworking application. EXPERT SYSTEMS WITH APPLICATIONS,2009,36(8):11077-11087
[153] ZouD Y.GanY, QuH T. Research of Structure Consistency between Overlay andNetwork Layer Based on Mobile P2P.20092ND IEEE INTERNATIONALCONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY,2009,2:254-258
[154] Mavromoustakis, Constandinos X.Collaborative optimistic replication for efficientdelay-sensitive MP2P streaming using community oriented neighboring feedback.20108th IEEE International Conference on Pervasive Computing and CommunicationsWorkshops, PERCOM Workshops2010,2010:105-110
[155] Biswas S, Morris R. ExOR: Opportunistic Multi-Hop Routing for Wireless Networks.In Proceedings of SIGCOMM2005. Philadelphia: PA,2005,35(4):133-144
[156] Biswas S, Morris R. Opportunistic routing in Multi-Hop Wireless Networks. in:Procesdings of ACM SIGCOMM Computer Communication Review,2004,34(1):69-74
[157] Rozner E, Seshadri J, Metha Y A, et al. SOAR: simple Opportunistic Adaptive RoutingProtocol for Wireless Mesh Networks. IEEE Transactions on Mobile Computing,2009,8(12):1622-1635
[158] Zheng Z, Nelakuditi S. On the efficacy of opportunistic routing. SECON2007. Pisa:Italy,2007:441-450
[159] Laufer R, Ferriere H D, Kleinrock L. Multirate Anypath Routing in Wireless MeshNetworks. In proceedings of INFOCOM2009. Rio de Janeiro: Brazil,2009:37-45
[160] Cao Q, Abdelzaher T, He T, Kravets R. Cluster-Based forwarding for reliableend-to-end delivery in wireless sensor networks. in Proceedings of the IEEE INFOCOM2007, Washington: IEEE Computer Society Press,2007:1928-1936
[161] A.Varga. OMNeT++Object-orientedDiscrete Event Simulation System UserManual.http://www.omnetpp.org/external/doc/hmal/usman.php.2004
[162] A.Varga. OMNeT++discrete event simulation system.In Proceedings of theEuropeanSimulation Multiconference (ESM’2001),2004:7-19
[163] Jared Winick, Sugill Jamin. Inet-3.0: Interact topology generator. TechnicalReport.CSE-TR-456-02, Ann Arbor, University of Michigan,2002:2-10
[2]王若曈,张辉,杨家海,黄桂奋. P2P网络管理系统信息模型的设计与实现.通信学报,2010,31(1):85-91
[3]李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法.计算机研究与发展,2006,43(9):1579-1585
[4]田敬,代亚非. P2P持久存储研究.软件学报,2007,18(6):1379-1399
[5]雷迎春,阳立堂,姜琦,龚奕利,张军.度量和分析BitTorrent.计算机研究与发展,2008,45(9):1589-1600
[6]李泽平,卢显良,聂晓文,李林. P2P流媒体中的数据分配算法.计算机研究与发展,2009,46(11):1803-1813
[7]王学龙,张璟. P2P关键技术研究综述.计算机应用研究,2010,27(3):801-805
[8] Wu C, Li B, Zhao S. Multi-channel live P2P streaming: Re-focusing on servers.Proceedings of the27th Conference on Computer Communications,2008:1355-1363
[9] Chen C, Tsai KC. The server reassignment problemfor load balancing in structured P2Psystems. IEEE Transactions Parallel and Distributed Systems,2008:338-350
[10] Huang C, Wang A, Li J, et al. Understanding hybrid CDN-P2P: why limelight needs itsown Red Swoosh. Proceedings of the18th International Workshop on Network andOperating Systems Support for Digital Audio and Video. ACM,2008:75-80.
[11]田春岐,江建慧,胡治国,李峰.一种基于聚集超级节点的P2P网络信任模型.计算机学报,2010,33(2):345-355
[12] Cichon, J, Cichon, K. Node Evaluation in the Chord P2P Systems.Dependability of Computer Systems,2009:168-175
[13] He Qi. Congestion control and message loss in Gnutella networks. Proceedings of SPIE-The International Society for Optical Engineering,2004:16-27
[14] Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerantwide-area location and routing. Technical Report, Computer Science Division, U.C.Berkeley,2001
[15] Guo Yutang, Lv-Wanli. Improved Resource Discovery Algorithm on Gnutella Based onP2P Networks. Control Conference,2007:599-602
[16] Hung-Chang Hsiao,Chung-Ta king. Bristle: A Mobile Struetured Peer-to-PeerAhitecture.In:Proceedings of the2003Intemational Parallel and DistributedProcessing Symposium,2003:33-41
[17] Mehrotra U, Wai Yie Leong. NSEEAR: A energy adaptive routing protocol forheterogeneous wireless sensor networks.35th Annual Conference of IEEE IndustrialElectronics(IECON),2009:2647-2652
[18] H. Fariborzi, M. Moghavvemi. AMTR: energy aware multi-tree routing for wirelesssensor networks. Institution of Engineering and Technology (IET) Communications,2008:733-739
[19] CHRISTENSEN B G. Light peers: A lightweight mobile P2P platform. Proceedings ofthe Fifth Annual IEEEInternational Conference Pervasive Computing andCommu-nications Workshop,2007:132-136
[20] Niko Kotilainen, Matthien Weber, Mikko Vapa, et al. Mobile Chedar-A Peer-to-PeerMiddleware for Mobile Devices. In: Proceedings of the3rd International Conference onPervasive Computing and Communications Workshops,2005:86-90
[21] Marco Mamei, Franco Zambonelli. Letizia Leonardi. Tuples On The Air: A Middlewarefor Context-Aware Computing in Dynamic Networks. In: Proceedings of the23rdInternational Conference on Distributed Computing Systems Workshops,2003:342-347
[22] Herrera O, Znati T. Modeling churn in P2P networks. Proc.of the40th AnnualSimulation Symp,2007:33-40
[23] Wang F, Liu J, Xiong Y.Stable peers: Existence,i mpor-tance,and application inpeer-to-peer live video streaming. Proceedings of the27th Conference on ComputerCommuni-cations,2008:2038-2046
[24] Christian Bettstetter. On the Connectivity of Ad Hoc Networks. Journal of Computer,2004,47(4):432-447
[25]冯劲潇,陈贵海,谢俊元.基于分层象限空间的P2P超级节点拓扑构造.计算机学报,2010,(006):988-1003
[26] Zahn T, Winter R, Schiller J. Simple, efficient peer-to-peer overlay clustering in mobile,ad hoc networks. In: Proc. of the12th IEEE Int’l Conf. on Networks,2004:520524
[27] MEHYAR M,SPANOS D,PONGSAJAPAN J,LOW S. H,MURRAY R.M.Asynchronous distributed averaging on communication networks. IEEE ACMTransactions on Networking,2007:512-520
[28] Balfe S, Lakhani AD, Paterson KG. Trusted computing: Providing security forpeer-to-peer networks. In: Proc. of the5th IEEE Int’l Conf. on Peer-to-Peer Computing(P2P2005),2005:117124
[29] The Napster Homepage. http://www.napster.com/
[30] Panti M, Penserini L. A P2P Approach to Land Warriors Coordination, InternationalSymp.On Collaborative Technologies and Systems in conjunction with the2003WestenMulti Conferences, Orlando, Florida, Kluwer Academic Press,2003,35(1):45-54
[31] HARJULA E, YLIANTTILA M, ALA-KURIKKA J, et al. Plug-and-play applicationplatform: towards mobile peer-to-peer. Proceedings of the ACM3rd Int’l ConfonMobile and Ubiquitous Multimedia,2004:63-69
[32]张春红,裘晓峰,弭伟,纪阳等. P2P技术全面解析.北京：人民邮电出版社出版,2010-05-01
[33] Wu Yunnan, Das S M, Chandra R.Routing with aMarkovian metric to promote localmixing. IEEE In-ternational Conference on Computer Communications,2007:2381-2385
[34] Sun Qiang, Li La-Yuan, Chen Nian-Sheng, Aziz Sadia.I m-pact of power control onwireless Ad hoc network capacity. Proceedings of the3rdIEEEInternational Conferenceon Dis-tributed Computing in Sensor Systems (DCOSS07),2007:848-857
[35]夏卓群,陈志刚,叶晖,赵明.无线Mesh网多路径混合包的传输方法.小型微型计算机系统,2010(003):466-469
[36] Cavalcanti D, Kumar A, Agrawal D P. wireless AD Hoc Networking New York.Auerbach Publications,2007:483-503
[37] MurthyC, Siva Ram, Manoj B.S. Ad Hoc Wireless Networks: Architectures andProtocols. New Jersey, PRENTICE HALL,2004:11-18
[38] Ian F. Akyildiz, Xudong Wang, Weilin Wang. Wireless mesh networks: a survey.Computer networks, Elsevier,2005(4):445-487
[39] Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang. GRAdient Broadcast: A Robust DataDelivery Protocol for Large Scale Sensor Networks,2005:285-298
[40] Jing Zhao, Guohong Cao.VADD: vehicle-assisted data deliveryin vehicular ad hocnetworks. IEEE Transactions on Vehicu-lar Technology,2008:1910-1922
[41]李元振,廖建新,李彤红,朱晓民,张磊.城市场景车载Ad Hoc网络竞争转发关键参数分析.电子学报,2011(05):1154-1158
[42]黄世能,奚建清.分布数据缓存体系.软件学报,2001,12(07):1095-1100
[43]凌波,王晓宇,周傲英, Ng Wee-Siong.一种基于Peer-to-Peer技术的Web缓存共享系统研究.计算机学报,2005(02):170-178
[44] J-sang A, Ismail R, Boyd C.A survey of trust and reputation systems for online serviceprovision. Decision Support,2007:618-644
[45] Calcagno, C. Local reasoning about data update. Electronic Notes in TheoreticalComputer Science,2007:126-168
[46] Sumino H, Ishikawa N, Kato T. Design and implementation of P2P protocol for mobilephones. In Proc. of the4th Annual IEEE Int’1Conf. on Pervasive Computing andCommunications Workshops (PERCOMW2006). Washington: IEEE Computer Society,2006:157-162
[47] M. Castro, M. Jones, Anne-Marie Kermarrec, A. Rowstron, M. Theimer, H. Wang, andA. Wolman. An Evaluation of Scalable Application-Level MulticastBuilt UsingPeer-To-Peer Overlays. In Proceedings ofthe INFOCOM2003, San Francisco,2003:568-577
[48] Yang Guo, Kyoungwon Suh, Jim Kurose, Don Towsley. P2Cast: peer-to-peer patchingfor video on demand service. Multimedia Tools and Applications,2007:109-129
[49] 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
[50] Nishihara Y, Yokota Y, and Okubo E. A technique for construction of overlay networksfor MANETs with consideration of physical network topologies. First InternationalConference on Advances in P2P Systems,2009:66-71
[51] 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
[52] Shiguo W, Hong J. Realization of topology awareness in peer-to-peer wireless network.5th International Conference on Wireless Communications, Networking and MobileComputing,2009:1-4
[53] 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
[54] 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(3):333-347
[55]Lidan S, Xiaolong Z, Ping W, Gang C, and Jinxiang D. Supporting multi-dimensionalqueries in mobile P2P network. Information Sciences,2011,181(13):2841-2857
[56] Chun B G, Wu P, Weatherspoon H, et al.ChunkCast: An anycast service for large scalecontent distribution.http://iptps06.cs.ucsb.edu/papers/Chun-chunkcast06.pdf.2006,880-885
[57] Disruption tolerant networking (DTN).http://www.darpa.mil/sto/solicitations/DTN/index.htm.2008
[58] Zhao B Y, Huang L, Stribling J, et al. Tapestry: A resilient global-scale overlay forservice deployment. Selected Areas in Communications, IEEE Journal on,2004,22(1):41-53
[59] Zhengqiang Liang, Weisong Shi. Enforcing Cooperative Resource Sharing in UntrustedP2P Computing Environments. Department of Computer Science, Wayne StateUniversity,2005:971-983
[60] Qin Qiu, Zhi Tang, Yinyan Yu.A Decentralized Authorization Scheme for DRM in P2PFile-sharing Systems. ConsumerCommunications and Networking Conference (CCNC),2011:136-140
[61] The Gnutella Homepage. http//gnutella.wego.com/
[62] Gnutella.http://gnutella.wego.com/,2004-05
[63] Mihajlo A. Jovanovic B S. Modeling Large-scale Peer-to-PeerNetworks and a CaseStudy of Gnutella. University of Cincinnati.2000-06
[64] Li X and Ji H. Scalable peer-to-peer resource discovering scheme for wirelessself-organized networks. Journal of China Universities of Posts andTelecommunications,2009,16(2):47-52,57
[65] Nayeem Golam Moktader, Habib Md Ahsan, and Daiyan Golam Moktader. A newefficient approach for peer-to-peer file searching in mobile ad-hoc network.International Journal of Computer Science Issues,2012,9(2):321-327
[66] Raivio Y. A peer-to-peer overlay architecture for mobile networks. In HUT T-110.7190Research Seminar on Data Communications Software,2005:1-10
[67] Harjula E, Ylianttila M, Ala-Kurikka J, Riekki J, Sauvola J. Plug-and-Play applicationPlatform: Towards mobile peer-to-peer. In Proc. of the ACM3rd Int’l Conf. on Mobileand Ubiquitous Multimedia,2004.63-69
[68]方艺霖,李方敏,吴鹏,刘新华,马小林.无线Mesh网络组播路由协议.软件学报,2010:40-52
[69] Nadia N Qadri, Antonio Liotta. Peer-to-Peer over Mobile Ad Hoc Networks. Handbookof Research on NGN and Ubiquitous Computing,2008:20-51
[70]江国星,梅锐.基于泛洪约束的MANET按需组播路由协议.电子与信息学报,2010,32(2):37-53
[71] GKANTSIDIS C. RODIGUEZ P. Network coding for large scale content distribution.Proc of IEEE INFOCOM,2005:2235-2245
[72] YEUNG R W. Information theory and networkcoding. New York, NY, USA: Springer,2008:5-15
[73]黄佳庆,陶少国,熊志强等.网络编码关键理论问题研究.计算机应用研究,2008,25(8):2260-2264
[74] ACEDANSKIS, DEB S, MEDARD M, et a1. How good israndom linear coding baseddistributed networked storage. NetCod2005, Italy,2005:1-6
[75] Wang M, Li B. How practical is network coding. Proceedings of14th IEEEInternationalWorkshop on Quality of Service,2006:274-278
[76] HALLOUSHM, RADHA H. Network codingwith multi-generation mixing.Proceedingsof,42nd Annual Conference on InformationScience and System(CISS’08),2008:515-520
[77] CHOU P A, WU Y, JAIN K.Practical networkcoding. Proceedings of41st AnnualAllertonConference on Communication, Control, and Computing,2003:5-15
[78] HOT, MEDARD M, KOETTER R,et al. Arandom linear network coding approachtomulticast. IEEE Transactions on Information Theory,2006,52(10):4413-4430
[79]李文中,顾铁成,李春洪,陆桑璐,陈道蓄. G.Caching--一种网格协同缓存系统.计算机研究与发展,2004,41(12):2211-2217
[80] Jingjing Si. Unified frameworks for the constructions of variable-rate linearnetworkcodes and variable-rate static linear network codes. Proceedings2011InternationalSymposium on Network Coding (NetCod2011),2011:1-6
[81] Jianliang Meng. The optimization study of network coding for coding-aware wirelessMESH networks. Proceedings of the20102nd International Conference on FutureComputer and Communication (ICFCC2010),2010:537-40
[82] Aguilera M K, Janakiraman R, Xu L.On the Erasure Recoverability of MDS Codesunder Concurrent Updates. ISIT Proceedings,2005:1358-1362
[83] Y. Wu, P.A. Chou, S. Y. Kung. Information exchange in wirelessnetworks with networkcoding and physical-layer broadcast. in: Proceedings of the39th Annual Conference onInformation Sciencesand Systems (CISS), Baltimore,2005:233-239
[84] M. Luby, M. Watson, T. Gasiba, T. Stockhammer, W. Xu. Raptor codes for reliabledownload delivery in wireless broadcast systems. in: Proceedings of the IEEEConsumer Communications and NetworkingConference (CCNC),2006:92-103
[85] C. Gkantsidis and P. Rodriguez. Network Coding for Large ScaleContent Distribution.in Proc. of IEEE INFOCOM2005,2005:328-339
[86] Qureshi M K, Patt Y N. Utility-based Cache partitioning: Alow-overhead,high-performance, runtime mechanism to par-tition shared caches. Proceedings of the39th Annual IEEE/ACM International Symposium on Micro architecture,2006:173-198
[87] Hara. Data Replication for Improving Data Accessibility in Ad Hoc Networks.MobileComputing, IEEE Transactions,2006,5(11):1515-1532
[88]杨成,徐家品.稀疏车辆Ad Hoc网络移动模型研究.通信技术,2011,44(05):88-91
[89] W. Li, E. Chan, D.Chen, Energy-effective Cache Replacement Policies for CooperativeCaching in Mobile Ad Hoc network. Wireless Communications and NetworkingConference (WCNC'07),2007:3347-3352
[90] Amy Fu and Parastoo Sadeghi. r-Regular P2P Broadcast Networks: Optimal Delay andThroughput Using Network Coding.Communications (ICC),2011IEEE InternationalConference on,2011,1-5
[91] Luo Jiaqing, Zhou Shijie. Adaptive Flooding Routing Algorithm in UnstructuredP2P.Communications. Circuits and Systems Proceedings, International Conference,2006:1557-1561
[92] C.Gkantsidis, M.Mihail, and A.Saberi, Random walks in peer-to-peer networks. ProcIEEE INFOCOM’06,2006,63(3):241-263
[93] Jun Luo, Patrick Th Eugster, Jean Pierre Hubaux．Route driven gossip：probabilisticreliable multicast in ad hoc networks. INFOCOM2003. Twenty-Second AnnualJointConference of the IEEE Computer and Communications Societies,2003(3):2229-2239
[94] Cichon, J., Cichon, K.etc. Node Evaluation in the Chord P2P Systems. Dependability ofComputer Systems,2009:168-175
[95] Goldberg D, Nichols D, Oki B M, et al. Using collaborative filtering to weave aninformation Tapestry. Communications of the ACM,1992,35(12):61-70
[96] Guo Yutang, Lv-Wanli. Improved Resource Discovery Algorithm on Gnutella Based onP2P Networks. Control Conference,2007:599-602
[97] Stutzbach, D. Capturing accurate snapshots of the Gnutella network.25th IEEEINFOCOM Conference,2006:3057-3062
[98] Rowstron1A, Druschel P. Pastry: Scalable, Decentralized Object Location and Routingfor Large-scale Peer-to-Peer Systems. In Proc. of the18th IFIP/ACM Int’l Conferenceon Distributed Systems Platforms,2001:1012-1033
[99] Xu Wanjin. An Algorithm of Cache Preloading in Cooperative Caching Based on AdHoc Network. Proceedings of the2010International Conference on Internet Technologyand Applications (iTAP2010),2010:1-4
[100] Hu THT, Thai B, Seneviratne A. Supporting Mobile Devices in Gnutella File SharingNetwork with Mobile Agents. In Proc. of the8th IEEE Int’l Symp On Computers andCommunication,2003:1035-1040
[101]欧中洪,宋美娜,战晓苏,宋俊德.移动对等网络关键技术研究.软件学报,2008(1):126-140
[102] Bakos B, Farkas GC, Nurminen JK. Peer-to-Peer Protocol Evaluation in TopologiesResembling Wireless Networks. In Proc. of the11th IEEE Int’l Conference onNetworks,2003:673-680
[103] Hofeld T, Tutschku K, Andersen FU. Mapping of File-sharing onto MobileEnvironments: Enhancement by UMTS. In Proc. of the3rd Int’l Conference onPervasive Computing and Communications Workshops,2005:43-49
[104] Hofeld T, Tutschku K, Andersen FU. Mapping of File-sharing onto MobileEnvironments: Feasibility and Performance of eDonkey with GPRS. IEEE Conferenceon Wireless Communications and Networking,2005:2453-2458
[105] HOT, LEONG B, KOETTER R, et a1. Byzantinemodification detection in multicastnetworks usingrandomized network coding.2004IEEE InternationalSymposium onInformation Theory (ISIT),2004:143-147
[106]侯昉,赵跃龙,王禹.海量存储系统的层次化体系结构.小型微型计算机系统,2010(6):1158-1161
[107] Chia-Cheng Hu, Yu-Liang Kuo, Chun-Yuan Chiu and Yueh-Min Huang. MaximumBandwidth Routing and Maximum Flow Routing in Wireless Mesh Networks. SpringerLink Telecommunication Systems.2004,(44):125-134
[108]李伟,徐正全,杨铸.应用于移动互联网的Peer-to-Peer关键技术.软件学报,2009(8):199-213
[109]邱志欢,肖明忠,代亚非.一种P2P环境下基于用户行为的语义检索方案.软件学报,2007(09):216-225
[110] Zheng Q B, Peng W, Wang Y W, Lu X C. An efficient broadcast algorithm based onconnecteddominating set in unstructured peer-to-peer network. WISE2004, LNCS3306,BerlinHeidelberg,2004:724-729
[111] Y.Charlie Hu, Saumitra M. Das, Himabindu Pucha. Peer-to-Peer Overlay Abstractionsin MANETs. Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, andPeer-to-Peer Networks, CRC Press,2005:17-50
[112] Dongsheng Li, Xicheng Lu, Chuanfu Xu. Topology Construction and ResourceDiscovery in Peer-to-Peer Networks. Handbook of Theoretical and Algorithmic Aspectsof Ad Hoc, Sensor, and Peer-to-Peer Networks, Auerbach Publications,2005:733-765
[113] Frank H. P. Fitzek, Hassan Charaf. Mobile Peer-to-Peer (P2P): A Tutorial Guide. WileyPress,2009
[114] Boon-chong Seet. Mobile Peer-to-Peer Computing for Next Generation DistributedEnvironments. Information Science Publishing,2009
[115] Dong-Won Kum. Performance evaluation of AODV and DYMO routing protocols inMANET.20107th IEEE Consumer Communications and Networking Conference(CCNC),2010:1-2
[116] Zupeng Li. Implementation of P2P computing in design of MANET routing protocol.First International on Computer and Computational Sciences,2006:1-9
[117] C Gui, P Mohapatra. Overlay Multicast for MANETs Using Dynamic Virtual Mesh.Wireless Networks,2007(1):77-91
[118] R. Hekmat, P. Van Mieghem. Study of Connectivity in Wireless Ad-hoc Networks withan Improved Radio Model. Mobile Networks and Applications,2006,(3):351-360.
[119] Baumgar Ingrnar, Hiip Bernhard, Krause Stephan. A P2P Demonstrator PoweredbyOverSim. Peer-to-Peer Computing,2007. Seventh IEEE International Conference,2007:243-244
[120] Bessa, S. Storage and retrieval on P2P networks: a DHT based protocol.2007IEEESymposium on Computers and Communications,2007:623-630
[121] A. Klemm C. Lindemann, O.Waldhorst. A Special-purpose Peer-to-Peer File SharingSystem for Mobile Ad Hoc Networks.2003IEEE58th Vehicular TechnologyConference,2003:2758-2763
[122] Salim Y. El Rouayheb, Alex Sprintson, Costas N. Georghiades. On the Index CodingProblem and Its Relation to Network Coding and Matroid Theory,2010:3187-3195
[123] Jaggi S,Sanders P, Chou P A, Effros M, Egner S, Jain K, Tolhuizen L. Polynomialtimealgorithms for multicast network codeconstruction. IEEE TransactionsonInformation Theory,2003(49):831-836
[124] Koetter R, Medard M. An algebraic approach to network coding.IEEE/ACMTransactions on Networking,2003(10):1031-1042
[125]卢开澄,卢华明.图论及其应用.北京：清华大学出版社,2005:5-15
[126] West, D.B.图论导引（第二版）.北京：机械工业出版社,2006:117-133
[127] Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flowalgorithms for energy minimization in vision. Pattern Analysis and Machine Intelligence,IEEE Transactions on,2004,26(9):1124-1137
[128] GKANTSIDIS C, RODRIGUEZ P R. Networkcoding for large scale contentdistribution. Proceedings of24th Annual Joint Conference ofthe IEEE Computer andCommunications Societies (INFOCOM’05),2005,4(12):2235-2245
[129] Tao Luo, Jianjun Hao, Xiangming Li, Guangxin Le. A theoretical Method ofPerformance Estimate for Reed-Solomon Codes Concatenated Space-Time Block Codes.Journal of China Universities of Posts and Telecommunications,2002,9(1):30-34
[130] L. Li, R. Ramjee, M. Buddhikot, S. Miller. Network coding-based broadcast in mobilead hoc networks. in: IEEE INFOCOM,2007:335-346
[131] Andersen FU, de Meer H, Dedinski I. An Architecture Concept for Mobile P2P FileSharing Services. In Proc. of the2004Informatik Verbindet, Lecture Notes onInformatics, Bonner,2004:229-233
[132] I.Baumgart, B.Heep, and S. Krause. OverSirn: A flexible overlay network simulationframework. Proceedings of10th IEEE Global Internet Symposium (GI’07)inconjunctionwith IEEE INFOCOM,2007:5-15
[133] Liu J. Peer-Tree: A Peer-to-Peer Message Forwarding Structure for Relaying Messagesin Mobile Applications. In Proc. of the2nd Int’l Workshop on Hot Topics inPeer-to-Peer Systems,2005:87-94
[134] Peng G, Li SP, Jin HR, Ma TC. Dynamic Indices for Mobile Peer-to-Peer Networks. InProc. of the4th Int’l Conference on Computer and Information Technology,2004:410-415
[135] Schollmeier R, Gruber I, Niethammer F. Protocol for Peer-to-Peer Networking inMobile Environments. In Proc. Of the12th Int’l Conference on ComputerCommunications and Networks,2003:121-127
[136] Joseph MS, Kumar M, Shen HB, Das S. Energy Efficient Data Retrieval and Caching inMobile Peer-to-Peer Networks. In Proc. Of the3rd IEEE Int’l Conference onPervasive Computing and Communications Workshops,2005:50-54
[137] S.Y. R. Li and R. W. Yeung. Network multicast flow via linearcoding. in Proc. Int.Symp. Operational Research and Its Applications (ISORA’98),1998:197–211
[138] Li B C, ND. Random network coding in peer-to-peer networks: From theory to practice.Proceedings of the IEEE,2011,99(3):513-523
[139]肖潇,王伟平,杨路明.基于网络编码的无线网络广播重传方法.通信学报,2009,30(9):69-75
[140]雷迎春,程实,吴产乐.应用网络编码的P2P内容分发.计算机研究与发展,2009,46(1):108-119
[141] Ahlswede R, Cai N, Li S Y R, et al. Network information flow. Information Theory,IEEE Transactions on,2000,46(4):1204-1216
[142] R. Koetter, M. Medard. An Algebraic Approach to Network Coding. IEEETransactions on Networking,2003,5(11):782-795
[143] S.Y. R. Li, R. W. Yeung, N. Cai. Linear Network Coding. IEEE Trans. Info,2003,2(49):371-381
[144] T. Ho, R. Koetter, M. Medard, D. Karger, M. Effros. The Benefits of Coding overRouting in a Randomized Setting. in Proc. of InternationalSymposium on InformationTheory (ISIT2003),2003:442
[145] P. Sanders, S. Egner, L. Tolhuizen. Polynomialtime algorithms for the construction ofmulticast network codes.41st Annual Allerton Conference onCommunication Controland Computing,2003:210-121
[146] Kun Hao, Multi-objective Network Coding Optimization Based on NSGA-II Algorithm.2012International Conference on Control Engineering and Communication Technology(ICCECT),2012:843-849
[147]张小燕,吴辰文,葛立明.基于OMNeT++的IPv6协议仿真模型.微计算机信息,2007,23(3):61
[148] Lin, H Q, LiZ T, HuangQ F. Multifactor hierarchical fuzzy trust evaluation onpeer-to-peer networks. PEER-TO-PEER NETWORKING AND APPLICATIONS,2011,4(4):376-390
[149]李致远,王汝传.移动P2P网络安全拓扑构造协议.通信学报,2010:146-157
[150] Derr, Kurt, Manic, Milos. Extended Virtual Spring Mesh (EVSM): The DistributedSelf-Organizing Mobile Ad Hoc Network for Area Exploration. IEEETRANSACTIONS ONINDUSTRIAL ELECTRONICS,2011,58(12):424-5437
[151] He Li, Kyoung Soo Bok, Jae Soo Yoo.An efficient clustering method for unstructuredmobile peer-to-peer networks. RACS '11: Proceedings of the2011ACM Symposium onResearch in Applied Computation,2011:124-129
[152] TsaiFlora S,Han W C,Xu J W. Design and development of a mobile peer-to-peer socialnetworking application. EXPERT SYSTEMS WITH APPLICATIONS,2009,36(8):11077-11087
[153] ZouD Y.GanY, QuH T. Research of Structure Consistency between Overlay andNetwork Layer Based on Mobile P2P.20092ND IEEE INTERNATIONALCONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY,2009,2:254-258
[154] Mavromoustakis, Constandinos X.Collaborative optimistic replication for efficientdelay-sensitive MP2P streaming using community oriented neighboring feedback.20108th IEEE International Conference on Pervasive Computing and CommunicationsWorkshops, PERCOM Workshops2010,2010:105-110
[155] Biswas S, Morris R. ExOR: Opportunistic Multi-Hop Routing for Wireless Networks.In Proceedings of SIGCOMM2005. Philadelphia: PA,2005,35(4):133-144
[156] Biswas S, Morris R. Opportunistic routing in Multi-Hop Wireless Networks. in:Procesdings of ACM SIGCOMM Computer Communication Review,2004,34(1):69-74
[157] Rozner E, Seshadri J, Metha Y A, et al. SOAR: simple Opportunistic Adaptive RoutingProtocol for Wireless Mesh Networks. IEEE Transactions on Mobile Computing,2009,8(12):1622-1635
[158] Zheng Z, Nelakuditi S. On the efficacy of opportunistic routing. SECON2007. Pisa:Italy,2007:441-450
[159] Laufer R, Ferriere H D, Kleinrock L. Multirate Anypath Routing in Wireless MeshNetworks. In proceedings of INFOCOM2009. Rio de Janeiro: Brazil,2009:37-45
[160] Cao Q, Abdelzaher T, He T, Kravets R. Cluster-Based forwarding for reliableend-to-end delivery in wireless sensor networks. in Proceedings of the IEEE INFOCOM2007, Washington: IEEE Computer Society Press,2007:1928-1936
[161] A.Varga. OMNeT++Object-orientedDiscrete Event Simulation System UserManual.http://www.omnetpp.org/external/doc/hmal/usman.php.2004
[162] A.Varga. OMNeT++discrete event simulation system.In Proceedings of theEuropeanSimulation Multiconference (ESM’2001),2004:7-19
[163] Jared Winick, Sugill Jamin. Inet-3.0: Interact topology generator. TechnicalReport.CSE-TR-456-02, Ann Arbor, University of Michigan,2002:2-10
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |