无线P2P网络的资源定位机制与中继协作策略研究
|
摘要
随着无线通信技术的不断发展,人们对通信业务的要求越来越高,传统客户端／服务器通信模式的单点瓶颈问题日益暴露,移动用户之间以分布式结构进行资源共享成为未来无线通信发展的必然趋势。因此,在无线环境下如何有效地建立P2P分布式网络成为无线通信领域的研究热点,而目标资源的有效定位与快速传输是无线P2P网络的关键问题。于是,本文对无线P2P网络的资源定位机制与中继协作策略展开研究,并提出相应的解决方案。主要工作包括以下几个方面：
(1)为了减小资源定位过程中的带宽消耗,研究结构化P2P网络模型的资源定位机制,提出一种动态拓扑感知性无线P2P网络的构建策略。入网节点通过分析其局部拓扑结构,从最优邻居节点获得与其物理位置有关的节点标号,从而实现无线P2P网络的瞬时拓扑相关；由中心节点收集拓扑结构的变化信息,将逻辑网络的拓扑相关转化为旅行商问题,并用模拟退火算法完成其优化求解,实现网络的动态拓扑相关；同时,针对中心节点的随时离开或死亡,提出一种成员节点与中心节点之间的信息交互方案,使网络能够分布式地选出处理功能强、业务量少的成员作为新的中心节点。
(2)基于布鲁姆滤波器,提出一种使无线P2P网络支持语义的资源定位方法。节点通过对本地资源属性的统计,获得自身的兴趣特性,节点之间根据兴趣相似度形成小世界模型,从而形成一种支持语义的双层资源定位模型。在对目标资源进行定位时,根据目标资源与本地节点兴趣之间的相似关系,合理选择非结构化或结构化P2P语义层进行定位,既提高资源的定位效率,也更广泛地支持资源的语义定位。
(3)针对无线单中继协作方式,分别对两跳放大转发和协作分集系统的中继选择与功率分配进行研究,提出一种最佳中继选择和最优功率分配方法。将中继的最优功率分配与最佳选择相结合,在发射总功率一定的条件下,得出源节点最优功率分配比例的闭合表达式；同时,以最优功率分配下的信噪比为准则,基于机会中继的产生原理,实现最佳中继的分布式选择。
(4)在中继能够实现完全同步的情况下,对多中继单信道放大转发系统进行研究,提出一种功率分配策略,使系统的信噪比随着中继节点的增多而单调增大。仿效正交多信道协作分集系统的信号最大比合并策略,将每个中继单独进行放大转发时可获得的最大信噪比作为对应中继的功率放大系数,从而使系统的信噪比随中继数的增加单调递增。
With the continuous development of wireless communication, demand on communication service is becoming higher and higher. The problem of single-point bottleneck in traditional client/service communication model is exposed increasingly, and sharing resource among mobile users through P2P mode becomes the inevitable trend of development in wireless communication system. Consequently, in wireless scenario, how to construct distributed P2P networks effectively is the research focus in wireless communication field, and objective resource location and rapid transmission are the key technologies in it. In this paper, resource location mechanisms and relay cooperative methods are considered, and some correspond solutions are proposed. The main works are as follows:
(1)In order to reduce bandwith comsuption during resource location, the mechnisms of resource location in structured P2P model are considered, and a dynamic topology-aware wireless P2P protocol is proposed. The node, wanting to enter the existing system, gets node identify which is connected with its physical position from the best node after analyzing its local topology, and instatanous topology-aware wireless P2P network is realized. A central node collects the topology changing information, and topology awareness is transformed to Traveling Salesman Problem. The optimization solution is got through Simulated Annealing method, and the dynamic topology awareness is realized finally. For the random left or death of the central node, a protocol on how to exchange information between member node and central node is presented, based on which the member with most powerful ability and least service is chosen as the new central node in distributed mode.
(2) Based on Bloom Filter, a method supporting semantic location in wireless P2P network is proposed. According to the statistical properties of local resources, member nodes extract their interests respectively, and a small-world model is constructed based on their common interests, and a double-layer semantic search model is constructed. When some objective resource is being located, its similarity to local resource interest is used to determine that it should be located in unstructured P2P semantic layer or structured semantic layer adaptively, which not only improves search efficiency, but also supports semantic location more widely.
(3) For relay cooperative in wireless networks, relay selection and power allocation in two-hop amplify-and-forward system and cooperative dirversity system are considered repectively, and a scheme of optimal power allocation and best relay selection is presented. Optimal power allocation and best relay selection are combined, when total power is constant, the closed form of optimal power proportion at the source node is got. Meanwhile, the signal-to-noise under optimal power allocation is taken as criterion to determine which relay is the best one, and it is chosen out in pure distributed mode based on opportunistic relay theory.
(4) Under the condition that all relays can work synchronously, for multiple-relay single-channel amplify-and-forward system, a power allocation scheme is proposed to make signal-to-noise increases with the number of relay monotonously. Mimicking the theory of Maximal Ratio Combination in orthogonal multi-channel diversity collaboration system, the maximal achievable signal-to-noise can be got in independent relay channel acts as power amplification factor for the corresponding relay when it transmits signal, and it is realized that signal-to-noise is increasing with the amount of relay monotonously.
(1)为了减小资源定位过程中的带宽消耗,研究结构化P2P网络模型的资源定位机制,提出一种动态拓扑感知性无线P2P网络的构建策略。入网节点通过分析其局部拓扑结构,从最优邻居节点获得与其物理位置有关的节点标号,从而实现无线P2P网络的瞬时拓扑相关；由中心节点收集拓扑结构的变化信息,将逻辑网络的拓扑相关转化为旅行商问题,并用模拟退火算法完成其优化求解,实现网络的动态拓扑相关；同时,针对中心节点的随时离开或死亡,提出一种成员节点与中心节点之间的信息交互方案,使网络能够分布式地选出处理功能强、业务量少的成员作为新的中心节点。
(2)基于布鲁姆滤波器,提出一种使无线P2P网络支持语义的资源定位方法。节点通过对本地资源属性的统计,获得自身的兴趣特性,节点之间根据兴趣相似度形成小世界模型,从而形成一种支持语义的双层资源定位模型。在对目标资源进行定位时,根据目标资源与本地节点兴趣之间的相似关系,合理选择非结构化或结构化P2P语义层进行定位,既提高资源的定位效率,也更广泛地支持资源的语义定位。
(3)针对无线单中继协作方式,分别对两跳放大转发和协作分集系统的中继选择与功率分配进行研究,提出一种最佳中继选择和最优功率分配方法。将中继的最优功率分配与最佳选择相结合,在发射总功率一定的条件下,得出源节点最优功率分配比例的闭合表达式；同时,以最优功率分配下的信噪比为准则,基于机会中继的产生原理,实现最佳中继的分布式选择。
(4)在中继能够实现完全同步的情况下,对多中继单信道放大转发系统进行研究,提出一种功率分配策略,使系统的信噪比随着中继节点的增多而单调增大。仿效正交多信道协作分集系统的信号最大比合并策略,将每个中继单独进行放大转发时可获得的最大信噪比作为对应中继的功率放大系数,从而使系统的信噪比随中继数的增加单调递增。
With the continuous development of wireless communication, demand on communication service is becoming higher and higher. The problem of single-point bottleneck in traditional client/service communication model is exposed increasingly, and sharing resource among mobile users through P2P mode becomes the inevitable trend of development in wireless communication system. Consequently, in wireless scenario, how to construct distributed P2P networks effectively is the research focus in wireless communication field, and objective resource location and rapid transmission are the key technologies in it. In this paper, resource location mechanisms and relay cooperative methods are considered, and some correspond solutions are proposed. The main works are as follows:
(1)In order to reduce bandwith comsuption during resource location, the mechnisms of resource location in structured P2P model are considered, and a dynamic topology-aware wireless P2P protocol is proposed. The node, wanting to enter the existing system, gets node identify which is connected with its physical position from the best node after analyzing its local topology, and instatanous topology-aware wireless P2P network is realized. A central node collects the topology changing information, and topology awareness is transformed to Traveling Salesman Problem. The optimization solution is got through Simulated Annealing method, and the dynamic topology awareness is realized finally. For the random left or death of the central node, a protocol on how to exchange information between member node and central node is presented, based on which the member with most powerful ability and least service is chosen as the new central node in distributed mode.
(2) Based on Bloom Filter, a method supporting semantic location in wireless P2P network is proposed. According to the statistical properties of local resources, member nodes extract their interests respectively, and a small-world model is constructed based on their common interests, and a double-layer semantic search model is constructed. When some objective resource is being located, its similarity to local resource interest is used to determine that it should be located in unstructured P2P semantic layer or structured semantic layer adaptively, which not only improves search efficiency, but also supports semantic location more widely.
(3) For relay cooperative in wireless networks, relay selection and power allocation in two-hop amplify-and-forward system and cooperative dirversity system are considered repectively, and a scheme of optimal power allocation and best relay selection is presented. Optimal power allocation and best relay selection are combined, when total power is constant, the closed form of optimal power proportion at the source node is got. Meanwhile, the signal-to-noise under optimal power allocation is taken as criterion to determine which relay is the best one, and it is chosen out in pure distributed mode based on opportunistic relay theory.
(4) Under the condition that all relays can work synchronously, for multiple-relay single-channel amplify-and-forward system, a power allocation scheme is proposed to make signal-to-noise increases with the number of relay monotonously. Mimicking the theory of Maximal Ratio Combination in orthogonal multi-channel diversity collaboration system, the maximal achievable signal-to-noise can be got in independent relay channel acts as power amplification factor for the corresponding relay when it transmits signal, and it is realized that signal-to-noise is increasing with the amount of relay monotonously.
引文
[1]Pengbo Si, F. Rechard Yu, Hong Ji. Distributed sender scheduling for multimedia transmission in wireless mobile peer-to-peer networks, IEEE Transactions on Wireless Communications,2009,8(9):4594-4560
[2]Pengbo Si, F. Rechard Yu, Hong Ji. Distributed multisource transmission in wireless mobile peer-to-peer networks:a restless-bandit approach, IEEE Transactions on Vehicular Technology,2010,59(1):420-430
[3]D. Li, Y. Xu, J. Liu. Distributed cooperative diversity methods for wireless ad hoc peer-to-peer file sharing, IET Communications,2010,4(3):343-345
[4]Jing Zhao, Ping Zhang, Guohong Cao. Cooperative caching in wireless P2P networks: design, implementation, and evaluation, IEEE Transactions on Parallel and Distributed System,2010,21(2):229-241
[5]Damla Turgut, Orlando. Balancing loads in mobile ad hoc networks,10th International Conference on Telecommunications, Papeete, French Polynesia:IEEE,2003:490-495
[6]Yuqi Mu, Cui Yu, Tao Ma. Dynamic Load Balancing with Multiple Hash Functions in Structured P2P Systems, Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing, Beijing, China:IEEE,2009: 5364-5367
[7]Claudia Canali, M. Elena Renda, Paolo Santi. Evaluating load balancing in peer-to-peer resource sharing algorithms for wireless mesh networks, Proc. IEEE Workshop Enabling Technologies and Standards for Wireless Mesh Networks,2008,603-609
[8]Jiyuan Sun, Chi Zhang, Yuguang Fang. A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks, INFOCOM, Phoenix, ZA, USA:IEEE,2008: 2360-2368
[9]Issam Al-dalati, Ashraf Matrawy. Designing Secure Peer-to-Peer Voice Applications in Ad Hoc Wireless Networks,18th International Workshop on Database and Expert Systems Applications, Regensburg, Germany:IEEE,2007:496-499
[10]Esther Palomr, Juan M. E. Dealing with Sporadic Strangers, or the (Un) Suitability of Trust for Mobile P2P Security, Tapiador.18th International Workshop on Database and Expert Systems Applications, Regensburg, Germany:IEEE,2007:779-784
[11]Hui Ding, Jinming Pei. The Research of Resource Auction Incentive Mechanism in Mobile P2P, Proceedings of the 5th International Conference on Wireless communications,2009, Beijing, China, IEEE,5520-5522
[12]Andrew Ka-Ho Leung, Yu-Kwong Kwok. On topology control of wireless peer-to-peer file sharing networks:energy efficiency, fairness and incentive, Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM'05), Taormina, Giardini Naxos:IEEE,2005
[13]Zhe Xiang, Qian Zhang. Peer-to-Peer Based Multimedia Distribution Service. IEEE Transactions on Multimedia.2004,6(2):343-355.
[14]Jia Zhao, Jiande Lu. Solving Overlay Mismatching of Unstructured P2P Networks using Physical Locality Information. Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing. Beijing, China, IEEE.2006:75-76.
[15]Gisik K, Kyung D R. BYPASS:Topology-aware Lookup Overlay for DHT-based P2P File Locating Services [A]. Proceedings of the Tenth International Conference on Parallel and Distributed Systems [c], California, USA:IEEE.2004:297-304
[16]Yun-Shuai Y, Yu-Ben M, Ce-Kuen S. Improving the Lookup Performance of Chord Network by Hashing Landmark Clusters [A],14th IEEE International Conference on Networks[c], Santa Barbara, California:IEEE.2006:1-4
[17]Feng H, Minglu L, Jiadi Y. PChord:Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity [A]. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops [c]. Ohio, USA:IEEE,2006: 806-811
[18]Liu Y Yang P, Chu Z, Wu J. TCS-Chord:An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode [A]. Proceedings of the First international Conference on Semantics, Knowledge, and Grid[c]. SKG:IEEE.2005:25-25.
[19]LeHai D, JongWon K. AChord:Topology-Aware Chord in Anycast-Enabled Networks [A]. 2006 International Conference on Hybrid Information Technology[c].Korea:IEEE.2006: 334-341.
[20]Jianqun C, Yanxiang H, Libing W. More efficient mechanism of topology-aware overlay construction in application-layer multicast [A]. International Conference on Networking, Architecture, and Storage[c]. NAS:IEEE,2007,7:31-36
[21]Rolf W, Thomas Z, Jochen S. Random Landmarking in Mobile [A], topology-aware peer-to-peer networks Distributed Computing Systems[c]. Proceedings 10th IEEE International Workshop on Future Trends in Distributed Computing Systems[c]. Suzhou China:IEEE,2004:319-324
[22]邱彤庆,陈贵海。一种令P2P覆盖网络拓扑相关的通用方法[J]。软件学报,2007,18(2)：381-390
[23]Cohen, E, Fiat, A.; Kaplan, H.Volume 2, Associative search in peer to peer networks: harnessing latent semantics. INFOCOM 2003, California, USA, IEEE,2003::1861-1881
[24]Christos Doulkeridis, Kjetil Norvag.et al. DESENT:decentralized and distributed semantic overlay generation in P2P networks. IEEE Journal on Selected Areas in Communications, 2007,25(1):25-34
[25]Yingwu Zhu, Yiming Hu. Enhancing search performance on Gnuterlla-like P2P systems. IEEE Transactions on Parallel and Distributed Systems,2006,17(12):1482-1495.
[26]Sripanidkulchai, K.; Maggs,B. Efficient content location using interest-based locality in peer-to-peer systems, INFOCOM 2003, California, USA, IEEE,2003:2166-2176
[27]Alexander Loser, Steffen Staab.et al. Semantic social overlay networks. IEEE Journal on Selected Areas in Communications,2007,25(1):5-14
[28]Heng Tao Shen, Yanfeng Shu. Efficient semantic-based content search in P2P network. IEEE Transcations on Knowledge and Data Engineering,2004,16(7):813-826.
[29]Mei Li, Wang-Chen Lee. Et al. SSW:A small-world-based overlay for peer-to-peer search. IEEE Transactions on Parallel and Distributed Systems,2008,19(6):735-749
[30]Rongmei Zhang, Charlie Hu. Assisted Peer-to-Peer search with partial indexing. IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-1158.
[31]Hai Zhuge, Liang Feng. Distributed suffix tree overlay for Peer-to-Peer search, IEEE Transcations on Knowledge and Data Engineering,2008,20(2):276-285.
[32]W.C.Jakes, Microswave Mobile Communications, IEEE Press, Piscataway,1993
[33]D.J.Gibson. The Mobile Communications Handbook, IEEE Press, Jan,1999
[34]W.Lee, Mobile Communications Engineering, New York:McGraw-Hill,1982
[35]Ioannis Krikidi, Steve McLaughli, Norbet Goertz. Amplify-and-Forward with partial relay selection, IEEE Communications Letters,2008,12(4):235-237
[36]Ramy Tannious, Aria Nosratinia. Spectrally-efficient relay selection with limited feedback, IEEE Journal on Selected Areas in Communications,2008,26(8):1419-1428
[37]Hailong Yang, Xinhua Yang, Tracy Camp. A novel location relay selection scheme for ALLINCES, IEEE Transactions on Vehicular Technology,2008,57(2):1272-1284
[38]Behrouz Maham, Are Hjorungnes. Performance analysis of amplify-and-forward opportunistic relaying in Rician fading, IEEE Signal Processing Letters,2009,16(8): 643-646
[39]Yindi Jing, Hamid Jafarkhani. Single and multiple relay selection and their achievable diversity orders, IEEE Transactions on Wireless Communications,2009,8(3):1414-1423
[40]Diomidis S. Michalopoulos, George K.Karagiannidis. Performance analysis of single relay selection in Rayleigh fading, IEEE Transactions on Wireless Communications,2008,7(10): 3718-3724
[41]Cale K.Lo, Robert W.Heath, Sriram Vishwanath. The impact of channel feedback on opportunistic relay selection for hybrid-ARQ in wireless networks, IEEE Transactions on Vehicular Technology,2009,58(3):1255-1268
[42]Aggelos Bletsas, Ashish Khisti, Andrew Lippman. A simple cooperative diversity method based on network path selection, IEEE Journal on Selected Areas in Communications,2006, 24(3):659-672
[43]Liang S, Dimitrios H. Broadcasting energy efficiency limits in wireless networks. IEEE Trans on Wireless Communications,2008,7(7):2502-2611
[44]Ritesh M, Neelesh B, Jin Z. Energy-efficient cooperative relaying over fading channels with simple relay selection, IEEE Trans on Wireless Communications,2008,7(8):3013-3025
[45]Harish V, Sayandev M. Performance of cellular networks with relays and centralized scheduling. IEEE IEEE Trans on Wireless Communications,2005,4(5):2318-2328
[46]Walid H, Pascal B, Philippe C. Outage probability-based power and time optimization for relay networks. IEEE Trans on Signal Processing,2009,57(2):764-782
[47]李国兵,朱国华等。最佳中继协作通信系统的功率分配算法,电子学报,2008,6(10)：1944-1948
[48]Muhammad M F, Murat U. BER-optimized power allocation for fading relay channels. IEEE Trans on Wireless Communications,2008,7(6):3150-3159
[49]Laneman J, Tse D, Wornell G. Cooperative diversity in wireless networks:Efficient protocols and outage behavior. IEEE Transactions on Information Theory,2004,50(12): 3062-3080
[50]Sreng V, Yanikomeroglu H, Falconer D D. Relayer selection strategies in cellular networks with peer-to-peer relaying. In:Proceedings of IEEE 58th Vehicular Technology Conference, Florida, USA,2003.1949-1953
[51]Yindi Jing, Hanid Jafarkhani. Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications,2009, 8(3):1414-1422
[52]Tae Won Ban, Wan Choi, Bang Chul Jung. A cooperative phase steering scheme in multi-relay node environments, IEEE Transactions on Wireless Communications,2009, 8(1):72-77
[53]Youhua Fu, Luxi Yang, Wei-Ping Zhu. A nearly optimal amplify-and-forward relaying scheme for two-hop MTMO multi-relay networks, IEEE Communications Letters,2010, 14(3):229-231
[54]Aitor del Coso, Christian Ibars. Achievable rates for the AWGN channel with multiple parallel relays, IEEE Transactions on Wireless Communications,2009,8(5):2524-2534
[1]Nicholas M, Deepak S. T, Mihaela Van Schaar. Collaborative resource exchanges for peer-to-peer video streaming over wireless mesh networks. IEEE Journal on Selected Areas in Communications,2007,25(1):108-118
[2]Tetsuya Oh-ishi, Koji Sakai, Kazuhiro Kikuma, et al. Study of the relationship between peer-to-peer systems and IP multicasting. IEEE Communications Magazine,2003:80-84
[3]Huicheng C, Qian Z, Juncheng J, et al. Efficient search and scheduling in P2P-based media-on-demand streaming service. IEEE Journal on selected areas in communications, 2007,25(1):119-130
[4]Reaz Ahmed, Raouf Bcutaba. Distributed pattern matching:a key to flexible and efficient P2P search. IEEE Journal on selected areas in communications,2007,25(1):73-83
[5]Andrew Ka-Ho Leung, Yu-Kwong Kwok. On localized application-driven topology control for energy-efficient wireless peer-to-peer file sharing. IEEE Trans on mobile computing, 2008,7(1):66-80
[6]Stefan Kaiser. OFDM code-division multiplexing in fading channels. IEEE Trans on Communications,2002,50(8):1266-1273
[7]Yi Sun. Bandwidth-efficient wireless OFDM. IEEE Journal on selected areas in communications,2001,19(11):2267-2279
[8]Taewon Hwang, Chenyang Yang, Gang Wu. OFDM and its wireless applications:a survey. IEEE Trans on Vehicular Technology,2009,58(4):1673-1694
[9]Fuqin X. M-ary amplitude shift keying OFDM system. IEEE Trans on Communications, 2003,51(10):1638-1642
[10]Bojan V, P.P. Vaidyanathan. MIMO biorthogonal partners and applications, IEEE Trans on Signal Processing,2002,50(3):528-542
[11]Ming Jiang, Lajos Hanzo. Multiuser MIMO-OFDM for next-generation wireless systems, Proceedings of the IEEE,2007,95(7):1430-1469
[12]Krishna P. K, Ping-Heng K, Peter J, et al. Block-based performance measures for MIMO OFDM beamforming systems. IEEE Trans on Vehicular Technology,2009,58(5):2236-2248
[13]M. Jing, J. Akhtman, L. Hanzo. Iterative joint channel estimation and multi-user detection for multiple-antenna aided OFDM systems. IEEE Trans on Wireless Communications, 2007,6(8):2904-2914
[14]D.Clark. Face-to-Face with Peer-to-Peer Networking. IEEE Computer,34(1):18-21,2001.
[15]Geoffrey F. Peer to Peer networks.Computing in science & engineering, pp:75-77,2001.
[16]Rudiger S. A definition of Peer to Peer networking for the classification of Peer to Peer architectures and applications. IEEE editor 1st international conference on Peer to Peer computing. Sweden, pp:101-102,2002.
[17]Tang Chunqiang. Peer Search:Efficient Information Retrieval in Peer-to-Peer Networks. HPL,2002.
[18]程伟,P2P存储系统中资源搜索机制的研究,中国科学技术大学硕士学位论文,2009年3月
[19]吴艾,P2P流媒体共享系统若干问题的研究,电子科技大学博士学位论文,2009年6月
[20]陈宏亮,P2P网络资源定位模型及其关键技术研究,中南大学硕士论文,2009年5月
[21]The Directory:Overview of Concepts, Models and Service. CCITT Recommendation X.500. 1988.
[22]柏海寰,对等网络中分散式查找的研究及其应用,上海交通大学博士学位论文.2004年6月.
[23]Napster. http://www.napster.com.
[24]Ion Stoica, Robert Morris, David Liben-Nowell, et al. Chord:a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking,2003,11(1): 17-32
[25]Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Proceedings of ACM SIGCOMM. Aug27-31,2001, San Diego, CA, USA,2001:161-172
[26]Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry:a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications.2004,22 (1): 42-53
[27]Rowstron A, Druschel P. Pastry:Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:Proc. of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms. Nov 12-16,2001, Berlin:Springer-Verlag,2001:329-350
[28]彭木根,王文博等,协同无线通信原理与应用,机械工业出版社,2009年
[29]YongHui L, Branka Vucetic, Zhendong Z. Distributed adaptive power allocation for wireless relay networks,2007,6(3):948-957
[30]Harish V, Sayandev M. Performance of cellular Networks with relays and centralized scheduling. IEEE IEEE Trans on Wireless Communications,2005,4(5):2318-2328.
[31]Liang S, Dimitrios H. Broadcasting energy efficiency limits in wireless networks. IEEE Trans on Wireless Communications,2008,7(7):2502-2611
[32]Ritesh M, Neelesh B, Jin Z. Energy-efficient cooperative relaying over fading channels with simple relay selection, IEEE Trans on Wireless Communications,2008,7(8):3013-3025
[33]Muhammad M F, Murat U. BER-optimized power allocation for fading relay channels. IEEE Trans on Wireless Communications,2008,7(6):3150-3159
[34]Walid H, Pascal B, Philippe C. Outage probability-based power and time optimization for relay networks. IEEE Trans on Signal Processing,2009,57(2):764-782
[35]Li Y, Wang W. Sub-carrier pairing for amplify-and-forward and decode-and-forward OFDM relay links. IEEE Communications Letters,2009,13(4):209-211
[36]J. Mark and Zhang W. Wireless communications and networking. Prentice Hall,2003
[37]J. Nicholas Laneman, David N. C. Tse, Gregory W. Wornell. Cooperative diversity in wireless networks:efficient protocls and outage behavior,2004,50(12):3062-3080
[38]Yindi Jing, Hanid Jafarkhani. Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications,2009, 8(3):1414-1422
[39]Tae Won Ban, Wan Choi, Bang Chul Jung. A cooperative phase steering scheme in multi-relay node environments, IEEE Transactions on Wireless Communications,2009, 8(1):72-77
[40]Youhua Fu, Luxi Yang, Wei-Ping Zhu. A nearly optimal amplify-and-forward relaying scheme for two-hop MIMO multi-relay networks, IEEE Communications Letters,2010, 14(3):229-231
[1]http://www.intsci.ac.cn/users/luojw/P2P/chO1.html
[2]http://www.acejoy.com/space/html/72/n-72.html
[3]http://www.stcsm.gov.cn/learning/lesson/course/detail.asp?id=133&lessonnum=5&coursenu m=38
[4]邢小良。P2P技术及其应用。人民邮电出版社,2008年
[5]陈贵海,李振华等。对等网络=Peer-to-peer network:结构、应用与设计。清华大学出版社,2007
[6]李江涛,对等网络性能测试与改善[博士学位论文],北京邮电大学,2006年
[7]陈宏亮。P2P网络资源定位模型及其关键技术[硕士学位论文],中南大学,2009年
[8]程伟,P2P存储系统中资源搜索机制的研究[硕士学位论文],中国科学技术大学,2009年
[9]Zhe Xiang, Qian Zhang. Peer-to-Peer Based Multimedia Distribution Service. IEEE Transactions on Multimedia.2004,6(2):343-355.
[10]Jia Zhao, Jiande Lu. Solving Overlay Mismatching of Unstructured P2P Networks using Physical Locality Information. Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing. Beijing, China, IEEE.2006:75-76.
[11]Gisik K, Kyung D R. BYPASS:Topology-aware Lookup Overlay for DHT-based P2P File Locating Services [A]. Proceedings of the Tenth International Conference on Parallel and Distributed Systems [c], California, USA:IEEE.2004:297-304
[12]Yun-Shuai Y, Yu-Ben M, Ce-Kuen S. Improving the Lookup Performance of Chord Network by Hashing Landmark Clusters [A],14th IEEE International Conference on Networks[c], Santa Barbara, California:IEEE.2006:1-4
[13]Feng H, Minglu L, Jiadi Y. PChord:Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity [A]. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops [c]. Ohio, USA:IEEE,2006: 806-811
[14]Liu Y Yang P, Chu Z, Wu J. TCS-Chord:An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode [A]. Proceedings of the First international Conference on Semantics, Knowledge, and Grid[c]. SKG:IEEE.,2005:25-25.
[15]LeHai D, JongWon K. AChord:Topology-Aware Chord in Anycast-Enabled Networks [A]. 2006 International Conference on Hybrid Information Technology[c].Korea:IEEE.2006: 334-341.
[16]Jianqun C, Yanxiang H, Libing W. More efficient mechanism of topology-aware overlay construction in application-layer multicast [A]. International Conference on Networking, Architecture, and Storage[c]. NAS:IEEE,2007,7:31-36
[17]Rolf W, Thomas Z, Jochen S. Random Landmarking in Mobile [A], topology-aware peer-to-peer networks Distributed Computing Systems[c]. Proceedings 10th IEEE International Workshop on Future Trends in Distributed Computing Systems[c]. Suzhou China:IEEE,2004:319-324
[18]邱彤庆,陈贵海。一种令P2P覆盖网络拓扑相关的通用方法[J]。软件学报,2007,18(2)：381-390
[19]Ion Stoica, Robert Morris, David Liben-Nowell, et al. Chord:a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking,2003,11(1): 17-32
[20]Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Proceedings of ACM SIGCOMM. Aug27-31,2001, San Diego, CA, USA,2001:161-172
[21]Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry:a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications.2004,22 (1): 42-53
[22]Rowstron A, Druschel P. Pastry:Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:Proc. of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms. Nov 12-16,2001, Berlin:Springer-Verlag,2001:329-350
[23]王凌,郑大钟。TSP问题次优化求解方法的比较。控制与决策,1998,13(1)：79-82
[24]Jun Gu, Xiaofei Huang, Efficient Local Search With Search Space Smoothing:A Case Study of the Traveling Salesman Problem (TSP), IEEE Transactions on Systems, Man, and Cybernetics,1994,24(5):728-735
[25]Mahdi S T, Morteza K, MohammadR. A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem, IEEE Transactions on Systems, Man, and Cybernetics-part B:Cybernetics,2007,37(4):754-770
[1]"Global IP traffic forecast and methodology,2006-2011", Cisco Systems White Paper, Jan. 2008
[2]Rongmei Zhang, Charlie Hu. Assisted Peer-to-Peer search with partial indexing, IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-1158.
[3]Hai Zhuge, Liang Feng. Distributed suffix tree overlay for Peer-to-Peer search. IEEE Transactions on Knowledge and Data Engineering,2008,20(2):276-285.
[4]Reaz Ahmed, Raouf Boutaba, Distributed Pattern Matching:a Key to Flexible and Efficient P2P Search. IEEE Journal on Selected Areas in Communications,2007,25(1):73-83
[5]Cohen, E, Fiat, A.; Kaplan, H.Volume 2, Associative search in peer to peer networks: harnessing latent semantics. vol.2,30 March-3 April 2003:1261-1271
[6]Christos Doulkeridis, Kjetil Norvag.et al. DESENT:decentralized and distributed semantic overlay generation in P2P networks. IEEE Journal on Selected Areas in Communications 2007,25(1):25-34
[7]Heng Tao Shen, Yanfeng Shu. Efficient semantic-based content search in P2P network. IEEE Transactions on Knowledge and Data Engineering,2004,16(7):813-826.
[8]Yingwu Zhu, Yiming Hu. Enhancing search performance on Gnuterlla-like P2P systems. IEEE Transactions on Parallel and Distributed System,2006,17(12):1482-1495.
[9]Sripanidkulchai, K.; Maggs, B. Efficient content location using interest-based locality in peer-to-peer systems. Processing of IEEE INFOCOM 2003, Francisco Caloforia, USA: 2166-2176
[10]Hai Zhuge, Xiang Li. Peer-to-Peer in metric space and semantic space. IEEE Transactions on Knowledge and Data Engineering,2007,19(6):759-771
[11]Yi F Z, Hong J, Jun W, et al. HBA:Distributed Metadata Management for Large Cluster-Based Storage Systems. IEEE Transactions on Parallel and Distributed Systems, 2008,19(6):750-763
[12]Alexander Loser, Steffen Staab.et al. Semantic social overlay networks. IEEE Journal on Selected Areas in Communications,2007,25(1):5-14
[13]Yifeng Zhu, Hong Jiang. Et al. HBA:Distributed metadata management for large cluster-based storage systems. IEEE Transactions on Parallel and Distributed Systems,2008, 19(6):750-763
[14]http://blog.csdn.net/jiaomeng/archive/2007/01/27/1495500.aspx
[15]http://www.cnblogs.com/Files/asashina/Bloom%20Filter.pdf
[16]http://net.pku.edu.cn/-cnds/ppt/09BloomFilter.pdf
[17]http://blog.csdn.net.sixxs.org/jiaomeng/archive/2007/03/16/1531423.aspx
[18]http://blog.csdn.net.sixxs.org/jiaomeng/archive/2007/01/27/1495500.aspx
[19]Leonardo M, Romano F. Mesh network firewalling with Bloom Filters. ICC, 2007:1546-1551
[20]Kun X, Ying H M, Da F Z, et al. A Scalable Bloom Filter for Membership Queries. GLOBECOM,2007:543-547
[21]Taskin Kocak, Ilhan Kaya. Low-Power Bloom Filter Architecture for Deep Packet Inspection. IEEE Communications Letters,2006,10(3):210-212
[22]Sarang D, Praveen K, David E. Taylor. Longest Prefix Matching Using Bloom Filters. IEEE/ACM Transactions on Networking,2006,14(2):397-409
[23]Michael Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking,2002,10(5):604-612
[24]Zhen C, Chuang L, Jia N, et al. AntiWorm NPU-based parallel Bloom Filters in Gipga-Ethernet LAN. ICC,2006:2118-2123
[25]Paul H, Marcel W. Bloom Filters:One Size Fits All? 32nd IEEE Conference on Local Computer Networks.2007:183-190
[26]Abhishek K, Jun J X, Jia W. Space-Code Bloom Filter for Efficient Per-Flow Trafic Measurement. IEEE Journal on Selected Areas in Communications,2006,24(12):2327-2339
[27]Sarang D, John W L. Fast and Scalable Pattern Matching for Network Intrusion Detection Systems. IEEE Journal on Selected Areas in Communications,2006,24(10):1781-1792
[28]Yong W, Xiao C Y, Yi F L. Analyzing the characteristics of Gnutella Overlays. International Conference on information Technology, Orissa, India, IEEE,2007
[29]Daniel Stutzbach, Reza Rejaie, Subhabrata Sen. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems. IEEE/ACM Transactions on Networking, 2008,16(2):267-280
[30]Matel Ripeanu, Ian Foster. Mapping the Gnutella Network. IEEE Internet Computing, 2002:50-57
[31]Marius Portmann, Pipat Sookavatana. The Cost of Peer Discovery and Searching in the Gnutella Peer-to-peer File Sharing Protocol. Washington, USA, IEEE,2001:263-268
[1]Sendonaris A, Erkip E, Aazhang B. User cooperation diversity-Part Ⅰ:System description. IEEE Transactions on Communications,2003,51(11):1927-1938
[2]Laneman J, Tse D, Wornell G. Cooperative diversity in wireless networks:Efficient protocols and outage behavior. IEEE Transactions on Information Theory,2004,50(12): 3062-3080
[3]Hong C Y, Pang A C.3-Approximation algorithm for joint routing and link scheduling in wireless relay networks, IEEE Trans on Wireless Communications,2009,8(2):856-861.
[4]Caleb K L, Sriram V, Robert W H. Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission. IEEE TRANS on Vehicular Technology,2009, 58(2):692-704.
[5]Liang S, Dimitrios H. Broadcasting energy efficiency limits in wireless networks. IEEE Trans on Wireless Communications,2008,7(7):2502-2611.
[6]Harish V, Sayandev M. Performance of cellular networks with relays and centralized scheduling. IEEE IEEE Trans on Wireless Communications,2005,4(5):2318-2328.
[7]Ritesh M, Neelesh B, Jin Z. Energy-efficient cooperative relaying over fading channels with simple relay selection, IEEE Trans on Wireless Communications,2008,7(8):3013-3025.
[8]Muhammad M F, Murat U. BER-optimized power allocation for fading relay channels. IEEE Trans on Wireless Communications,2008,7(6):3150-3159.
[9]Walid H, Pascal B, Philippe C. Outage probability-based power and time optimization for relay networks. IEEE Trans on Signal Processing,2009,57(2):764-782.
[10]BLETASAS A, KHISTI A, REED D P. A simple cooperative diversity method based on network path selection [J]. IEEE Journal on Selected Areas in Communications,2006, 24(3):659-672.
[11]BLETASAS A, KHISTI A, REED D P. A simple distributed method for relay selection in cooperative diversity wireless networks cased on reciprocity and channel measurements [A]. Proceeding of 61st IEEE Semiannu Vech Technol Conf[C]. Stockholm, Sweden,2005, 1484-1488.
[12]Hunter T, Nosratinia A. Diversity through coded cooperation. IEEE Transactions on Wireless Communications,2006,5(2):283-289
[13]Sreng V, Yanikomeroglu H, Falconer D D. Relayer selection strategies in cellular networks with peer-to-peer relaying. In:Proceedings of IEEE 58th Vehicular Technology Conference, Florida, USA,2003.1949-1953
[14]Kusuma A A N A, Andrew L L H. Minimum power routing for multihop cellular networks. In:Proceedings of Global Telecommunications Conference, Taiwan, China,2002.37-41
[15]Yindi Jing, Hanid Jafarkhani. Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications,2009, 8(3):1414-1422
[16]Rouse T, McLaughlin S, Band I. Congestion-based routing strategies in multihop TDD-CDMA networks. IEEE Journal on Selected Areas in Communications,2005,23(3): 668-681
[17]Larsson E G, Cao Y. Collaborative transmit diversity with adaptive radio resource and power allocation. IEEE Communications Letters,2005,9(6):511-513
[18]李国兵,朱国华等。最佳中继协作通信系统的功率分配算法,电子学报,2008,6(10)：1944-1948.
[19]Li Y, Wang W. Sub-carrier pairing for amplify-and-forward and decode-and-forward OFDM relay links. IEEE Communications Letters,2009,13(4):209-211
[20]邹玉龙,郑宝玉,崔景伍等。基于跨层机制的最佳协作中继选择及其系统实现.通信学报,2008,29(8)：1-10
[21]Wang W, Yang S, Gao L. Comparison of schemes for joint subcarrier matching and power allocation in OFDM decode-and-forward relay system. In:Proceedings of IEEE International Conference on Communications, Beijing, China,2008.4983-4987
[22]Chiu T, Ng Y, Yu W. Joint optimization of relay strategies and resource allocations in cooperative cellular networks. IEEE Journal on Selected Areas in Communications,2007, 25(2):328-339
[23]Mesbah W, Davidson T. Joint power and channel resource allocation for two-user orthogonal amplify-and-forward cooperation. IEEE Transactions on Wireless Communications,2008, 7(11):4681-4691
[24]Guo J, Luo H, Li H X. Opportunistic Relaying in Cooperative OFDM Networks for Throughput and Fairness Improvement. In:Proceedings of Global Telecommunications Conference, Louisiana, USA,2008.1-5
[25]Award M, Shen X. OFDMA Based Two-Hop Cooperative Relay Network Resources Allocation. In:Proceedings of IEEE International Conference on Communications, Beijing, China,2008.4414-4418
[26]Yue Rong, Xiaojun Tang, Yingbo Hua. A unified framework for optimizing linear nonregenerative multicarrier MIMO relay communication systems, IEEE Transactions on Signal Processing,2009,57(12):4837-4851
[27]Chunguo Li, Xiang Wang, Luxi Yang. A joint source and relay power allocation scheme for a class of MIMO relay system, IEEE Transactions on Signal Processing,2009,57(12): 4852-4860
[28]Yanwu Ding, Murat Uysal. Amplify-and-forward cooperative OFDM with multiple-relays:performance analysis and relay selection methods, IEEE Transactions on Wireless Communications,2009,8(10):4963-4968
[29]Shashibhushan Borade, Lizhong Zheng, Robert Gallager. Amplify-and-forward in wireless relay networks:rate, diversity, and network size, IEEE Transactions on Information Theory, 2007,53(10):3302-3318
[30]Jesus Gomez-Vilardebo, Ana I. Perez-Neira. Bounds on maximum rate-per-energy for orthogonal AWGN multiple-relay channels, IEEE Transactions on Wireless Communications,2008,7(11):4238-4247
[1]Topology-aware peer-to-peer overlay network for Ad-hoc. The Journal of China universities of posts and telecommunications,2008,16(1):111-115.
[2]具有动态拓扑感知的无线自组对等网,控制与决策,2010,4月
[3]A Topology-aware Peer-To-Peer Protocl Applicable to Wireless Network, Proceeding of IC-NIDC2009, BeiJing, China, IEEE.1004-1009
[4]BF-Chord:An Improved Lookup Protocol to Chord Based on Bloom Filter for Wireless P2P, Wireless Communication Confercence, July,2009
[2]Pengbo Si, F. Rechard Yu, Hong Ji. Distributed multisource transmission in wireless mobile peer-to-peer networks:a restless-bandit approach, IEEE Transactions on Vehicular Technology,2010,59(1):420-430
[3]D. Li, Y. Xu, J. Liu. Distributed cooperative diversity methods for wireless ad hoc peer-to-peer file sharing, IET Communications,2010,4(3):343-345
[4]Jing Zhao, Ping Zhang, Guohong Cao. Cooperative caching in wireless P2P networks: design, implementation, and evaluation, IEEE Transactions on Parallel and Distributed System,2010,21(2):229-241
[5]Damla Turgut, Orlando. Balancing loads in mobile ad hoc networks,10th International Conference on Telecommunications, Papeete, French Polynesia:IEEE,2003:490-495
[6]Yuqi Mu, Cui Yu, Tao Ma. Dynamic Load Balancing with Multiple Hash Functions in Structured P2P Systems, Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing, Beijing, China:IEEE,2009: 5364-5367
[7]Claudia Canali, M. Elena Renda, Paolo Santi. Evaluating load balancing in peer-to-peer resource sharing algorithms for wireless mesh networks, Proc. IEEE Workshop Enabling Technologies and Standards for Wireless Mesh Networks,2008,603-609
[8]Jiyuan Sun, Chi Zhang, Yuguang Fang. A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks, INFOCOM, Phoenix, ZA, USA:IEEE,2008: 2360-2368
[9]Issam Al-dalati, Ashraf Matrawy. Designing Secure Peer-to-Peer Voice Applications in Ad Hoc Wireless Networks,18th International Workshop on Database and Expert Systems Applications, Regensburg, Germany:IEEE,2007:496-499
[10]Esther Palomr, Juan M. E. Dealing with Sporadic Strangers, or the (Un) Suitability of Trust for Mobile P2P Security, Tapiador.18th International Workshop on Database and Expert Systems Applications, Regensburg, Germany:IEEE,2007:779-784
[11]Hui Ding, Jinming Pei. The Research of Resource Auction Incentive Mechanism in Mobile P2P, Proceedings of the 5th International Conference on Wireless communications,2009, Beijing, China, IEEE,5520-5522
[12]Andrew Ka-Ho Leung, Yu-Kwong Kwok. On topology control of wireless peer-to-peer file sharing networks:energy efficiency, fairness and incentive, Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM'05), Taormina, Giardini Naxos:IEEE,2005
[13]Zhe Xiang, Qian Zhang. Peer-to-Peer Based Multimedia Distribution Service. IEEE Transactions on Multimedia.2004,6(2):343-355.
[14]Jia Zhao, Jiande Lu. Solving Overlay Mismatching of Unstructured P2P Networks using Physical Locality Information. Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing. Beijing, China, IEEE.2006:75-76.
[15]Gisik K, Kyung D R. BYPASS:Topology-aware Lookup Overlay for DHT-based P2P File Locating Services [A]. Proceedings of the Tenth International Conference on Parallel and Distributed Systems [c], California, USA:IEEE.2004:297-304
[16]Yun-Shuai Y, Yu-Ben M, Ce-Kuen S. Improving the Lookup Performance of Chord Network by Hashing Landmark Clusters [A],14th IEEE International Conference on Networks[c], Santa Barbara, California:IEEE.2006:1-4
[17]Feng H, Minglu L, Jiadi Y. PChord:Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity [A]. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops [c]. Ohio, USA:IEEE,2006: 806-811
[18]Liu Y Yang P, Chu Z, Wu J. TCS-Chord:An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode [A]. Proceedings of the First international Conference on Semantics, Knowledge, and Grid[c]. SKG:IEEE.2005:25-25.
[19]LeHai D, JongWon K. AChord:Topology-Aware Chord in Anycast-Enabled Networks [A]. 2006 International Conference on Hybrid Information Technology[c].Korea:IEEE.2006: 334-341.
[20]Jianqun C, Yanxiang H, Libing W. More efficient mechanism of topology-aware overlay construction in application-layer multicast [A]. International Conference on Networking, Architecture, and Storage[c]. NAS:IEEE,2007,7:31-36
[21]Rolf W, Thomas Z, Jochen S. Random Landmarking in Mobile [A], topology-aware peer-to-peer networks Distributed Computing Systems[c]. Proceedings 10th IEEE International Workshop on Future Trends in Distributed Computing Systems[c]. Suzhou China:IEEE,2004:319-324
[22]邱彤庆,陈贵海。一种令P2P覆盖网络拓扑相关的通用方法[J]。软件学报,2007,18(2)：381-390
[23]Cohen, E, Fiat, A.; Kaplan, H.Volume 2, Associative search in peer to peer networks: harnessing latent semantics. INFOCOM 2003, California, USA, IEEE,2003::1861-1881
[24]Christos Doulkeridis, Kjetil Norvag.et al. DESENT:decentralized and distributed semantic overlay generation in P2P networks. IEEE Journal on Selected Areas in Communications, 2007,25(1):25-34
[25]Yingwu Zhu, Yiming Hu. Enhancing search performance on Gnuterlla-like P2P systems. IEEE Transactions on Parallel and Distributed Systems,2006,17(12):1482-1495.
[26]Sripanidkulchai, K.; Maggs,B. Efficient content location using interest-based locality in peer-to-peer systems, INFOCOM 2003, California, USA, IEEE,2003:2166-2176
[27]Alexander Loser, Steffen Staab.et al. Semantic social overlay networks. IEEE Journal on Selected Areas in Communications,2007,25(1):5-14
[28]Heng Tao Shen, Yanfeng Shu. Efficient semantic-based content search in P2P network. IEEE Transcations on Knowledge and Data Engineering,2004,16(7):813-826.
[29]Mei Li, Wang-Chen Lee. Et al. SSW:A small-world-based overlay for peer-to-peer search. IEEE Transactions on Parallel and Distributed Systems,2008,19(6):735-749
[30]Rongmei Zhang, Charlie Hu. Assisted Peer-to-Peer search with partial indexing. IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-1158.
[31]Hai Zhuge, Liang Feng. Distributed suffix tree overlay for Peer-to-Peer search, IEEE Transcations on Knowledge and Data Engineering,2008,20(2):276-285.
[32]W.C.Jakes, Microswave Mobile Communications, IEEE Press, Piscataway,1993
[33]D.J.Gibson. The Mobile Communications Handbook, IEEE Press, Jan,1999
[34]W.Lee, Mobile Communications Engineering, New York:McGraw-Hill,1982
[35]Ioannis Krikidi, Steve McLaughli, Norbet Goertz. Amplify-and-Forward with partial relay selection, IEEE Communications Letters,2008,12(4):235-237
[36]Ramy Tannious, Aria Nosratinia. Spectrally-efficient relay selection with limited feedback, IEEE Journal on Selected Areas in Communications,2008,26(8):1419-1428
[37]Hailong Yang, Xinhua Yang, Tracy Camp. A novel location relay selection scheme for ALLINCES, IEEE Transactions on Vehicular Technology,2008,57(2):1272-1284
[38]Behrouz Maham, Are Hjorungnes. Performance analysis of amplify-and-forward opportunistic relaying in Rician fading, IEEE Signal Processing Letters,2009,16(8): 643-646
[39]Yindi Jing, Hamid Jafarkhani. Single and multiple relay selection and their achievable diversity orders, IEEE Transactions on Wireless Communications,2009,8(3):1414-1423
[40]Diomidis S. Michalopoulos, George K.Karagiannidis. Performance analysis of single relay selection in Rayleigh fading, IEEE Transactions on Wireless Communications,2008,7(10): 3718-3724
[41]Cale K.Lo, Robert W.Heath, Sriram Vishwanath. The impact of channel feedback on opportunistic relay selection for hybrid-ARQ in wireless networks, IEEE Transactions on Vehicular Technology,2009,58(3):1255-1268
[42]Aggelos Bletsas, Ashish Khisti, Andrew Lippman. A simple cooperative diversity method based on network path selection, IEEE Journal on Selected Areas in Communications,2006, 24(3):659-672
[43]Liang S, Dimitrios H. Broadcasting energy efficiency limits in wireless networks. IEEE Trans on Wireless Communications,2008,7(7):2502-2611
[44]Ritesh M, Neelesh B, Jin Z. Energy-efficient cooperative relaying over fading channels with simple relay selection, IEEE Trans on Wireless Communications,2008,7(8):3013-3025
[45]Harish V, Sayandev M. Performance of cellular networks with relays and centralized scheduling. IEEE IEEE Trans on Wireless Communications,2005,4(5):2318-2328
[46]Walid H, Pascal B, Philippe C. Outage probability-based power and time optimization for relay networks. IEEE Trans on Signal Processing,2009,57(2):764-782
[47]李国兵,朱国华等。最佳中继协作通信系统的功率分配算法,电子学报,2008,6(10)：1944-1948
[48]Muhammad M F, Murat U. BER-optimized power allocation for fading relay channels. IEEE Trans on Wireless Communications,2008,7(6):3150-3159
[49]Laneman J, Tse D, Wornell G. Cooperative diversity in wireless networks:Efficient protocols and outage behavior. IEEE Transactions on Information Theory,2004,50(12): 3062-3080
[50]Sreng V, Yanikomeroglu H, Falconer D D. Relayer selection strategies in cellular networks with peer-to-peer relaying. In:Proceedings of IEEE 58th Vehicular Technology Conference, Florida, USA,2003.1949-1953
[51]Yindi Jing, Hanid Jafarkhani. Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications,2009, 8(3):1414-1422
[52]Tae Won Ban, Wan Choi, Bang Chul Jung. A cooperative phase steering scheme in multi-relay node environments, IEEE Transactions on Wireless Communications,2009, 8(1):72-77
[53]Youhua Fu, Luxi Yang, Wei-Ping Zhu. A nearly optimal amplify-and-forward relaying scheme for two-hop MTMO multi-relay networks, IEEE Communications Letters,2010, 14(3):229-231
[54]Aitor del Coso, Christian Ibars. Achievable rates for the AWGN channel with multiple parallel relays, IEEE Transactions on Wireless Communications,2009,8(5):2524-2534
[1]Nicholas M, Deepak S. T, Mihaela Van Schaar. Collaborative resource exchanges for peer-to-peer video streaming over wireless mesh networks. IEEE Journal on Selected Areas in Communications,2007,25(1):108-118
[2]Tetsuya Oh-ishi, Koji Sakai, Kazuhiro Kikuma, et al. Study of the relationship between peer-to-peer systems and IP multicasting. IEEE Communications Magazine,2003:80-84
[3]Huicheng C, Qian Z, Juncheng J, et al. Efficient search and scheduling in P2P-based media-on-demand streaming service. IEEE Journal on selected areas in communications, 2007,25(1):119-130
[4]Reaz Ahmed, Raouf Bcutaba. Distributed pattern matching:a key to flexible and efficient P2P search. IEEE Journal on selected areas in communications,2007,25(1):73-83
[5]Andrew Ka-Ho Leung, Yu-Kwong Kwok. On localized application-driven topology control for energy-efficient wireless peer-to-peer file sharing. IEEE Trans on mobile computing, 2008,7(1):66-80
[6]Stefan Kaiser. OFDM code-division multiplexing in fading channels. IEEE Trans on Communications,2002,50(8):1266-1273
[7]Yi Sun. Bandwidth-efficient wireless OFDM. IEEE Journal on selected areas in communications,2001,19(11):2267-2279
[8]Taewon Hwang, Chenyang Yang, Gang Wu. OFDM and its wireless applications:a survey. IEEE Trans on Vehicular Technology,2009,58(4):1673-1694
[9]Fuqin X. M-ary amplitude shift keying OFDM system. IEEE Trans on Communications, 2003,51(10):1638-1642
[10]Bojan V, P.P. Vaidyanathan. MIMO biorthogonal partners and applications, IEEE Trans on Signal Processing,2002,50(3):528-542
[11]Ming Jiang, Lajos Hanzo. Multiuser MIMO-OFDM for next-generation wireless systems, Proceedings of the IEEE,2007,95(7):1430-1469
[12]Krishna P. K, Ping-Heng K, Peter J, et al. Block-based performance measures for MIMO OFDM beamforming systems. IEEE Trans on Vehicular Technology,2009,58(5):2236-2248
[13]M. Jing, J. Akhtman, L. Hanzo. Iterative joint channel estimation and multi-user detection for multiple-antenna aided OFDM systems. IEEE Trans on Wireless Communications, 2007,6(8):2904-2914
[14]D.Clark. Face-to-Face with Peer-to-Peer Networking. IEEE Computer,34(1):18-21,2001.
[15]Geoffrey F. Peer to Peer networks.Computing in science & engineering, pp:75-77,2001.
[16]Rudiger S. A definition of Peer to Peer networking for the classification of Peer to Peer architectures and applications. IEEE editor 1st international conference on Peer to Peer computing. Sweden, pp:101-102,2002.
[17]Tang Chunqiang. Peer Search:Efficient Information Retrieval in Peer-to-Peer Networks. HPL,2002.
[18]程伟,P2P存储系统中资源搜索机制的研究,中国科学技术大学硕士学位论文,2009年3月
[19]吴艾,P2P流媒体共享系统若干问题的研究,电子科技大学博士学位论文,2009年6月
[20]陈宏亮,P2P网络资源定位模型及其关键技术研究,中南大学硕士论文,2009年5月
[21]The Directory:Overview of Concepts, Models and Service. CCITT Recommendation X.500. 1988.
[22]柏海寰,对等网络中分散式查找的研究及其应用,上海交通大学博士学位论文.2004年6月.
[23]Napster. http://www.napster.com.
[24]Ion Stoica, Robert Morris, David Liben-Nowell, et al. Chord:a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking,2003,11(1): 17-32
[25]Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Proceedings of ACM SIGCOMM. Aug27-31,2001, San Diego, CA, USA,2001:161-172
[26]Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry:a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications.2004,22 (1): 42-53
[27]Rowstron A, Druschel P. Pastry:Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:Proc. of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms. Nov 12-16,2001, Berlin:Springer-Verlag,2001:329-350
[28]彭木根,王文博等,协同无线通信原理与应用,机械工业出版社,2009年
[29]YongHui L, Branka Vucetic, Zhendong Z. Distributed adaptive power allocation for wireless relay networks,2007,6(3):948-957
[30]Harish V, Sayandev M. Performance of cellular Networks with relays and centralized scheduling. IEEE IEEE Trans on Wireless Communications,2005,4(5):2318-2328.
[31]Liang S, Dimitrios H. Broadcasting energy efficiency limits in wireless networks. IEEE Trans on Wireless Communications,2008,7(7):2502-2611
[32]Ritesh M, Neelesh B, Jin Z. Energy-efficient cooperative relaying over fading channels with simple relay selection, IEEE Trans on Wireless Communications,2008,7(8):3013-3025
[33]Muhammad M F, Murat U. BER-optimized power allocation for fading relay channels. IEEE Trans on Wireless Communications,2008,7(6):3150-3159
[34]Walid H, Pascal B, Philippe C. Outage probability-based power and time optimization for relay networks. IEEE Trans on Signal Processing,2009,57(2):764-782
[35]Li Y, Wang W. Sub-carrier pairing for amplify-and-forward and decode-and-forward OFDM relay links. IEEE Communications Letters,2009,13(4):209-211
[36]J. Mark and Zhang W. Wireless communications and networking. Prentice Hall,2003
[37]J. Nicholas Laneman, David N. C. Tse, Gregory W. Wornell. Cooperative diversity in wireless networks:efficient protocls and outage behavior,2004,50(12):3062-3080
[38]Yindi Jing, Hanid Jafarkhani. Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications,2009, 8(3):1414-1422
[39]Tae Won Ban, Wan Choi, Bang Chul Jung. A cooperative phase steering scheme in multi-relay node environments, IEEE Transactions on Wireless Communications,2009, 8(1):72-77
[40]Youhua Fu, Luxi Yang, Wei-Ping Zhu. A nearly optimal amplify-and-forward relaying scheme for two-hop MIMO multi-relay networks, IEEE Communications Letters,2010, 14(3):229-231
[1]http://www.intsci.ac.cn/users/luojw/P2P/chO1.html
[2]http://www.acejoy.com/space/html/72/n-72.html
[3]http://www.stcsm.gov.cn/learning/lesson/course/detail.asp?id=133&lessonnum=5&coursenu m=38
[4]邢小良。P2P技术及其应用。人民邮电出版社,2008年
[5]陈贵海,李振华等。对等网络=Peer-to-peer network:结构、应用与设计。清华大学出版社,2007
[6]李江涛,对等网络性能测试与改善[博士学位论文],北京邮电大学,2006年
[7]陈宏亮。P2P网络资源定位模型及其关键技术[硕士学位论文],中南大学,2009年
[8]程伟,P2P存储系统中资源搜索机制的研究[硕士学位论文],中国科学技术大学,2009年
[9]Zhe Xiang, Qian Zhang. Peer-to-Peer Based Multimedia Distribution Service. IEEE Transactions on Multimedia.2004,6(2):343-355.
[10]Jia Zhao, Jiande Lu. Solving Overlay Mismatching of Unstructured P2P Networks using Physical Locality Information. Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing. Beijing, China, IEEE.2006:75-76.
[11]Gisik K, Kyung D R. BYPASS:Topology-aware Lookup Overlay for DHT-based P2P File Locating Services [A]. Proceedings of the Tenth International Conference on Parallel and Distributed Systems [c], California, USA:IEEE.2004:297-304
[12]Yun-Shuai Y, Yu-Ben M, Ce-Kuen S. Improving the Lookup Performance of Chord Network by Hashing Landmark Clusters [A],14th IEEE International Conference on Networks[c], Santa Barbara, California:IEEE.2006:1-4
[13]Feng H, Minglu L, Jiadi Y. PChord:Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity [A]. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops [c]. Ohio, USA:IEEE,2006: 806-811
[14]Liu Y Yang P, Chu Z, Wu J. TCS-Chord:An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode [A]. Proceedings of the First international Conference on Semantics, Knowledge, and Grid[c]. SKG:IEEE.,2005:25-25.
[15]LeHai D, JongWon K. AChord:Topology-Aware Chord in Anycast-Enabled Networks [A]. 2006 International Conference on Hybrid Information Technology[c].Korea:IEEE.2006: 334-341.
[16]Jianqun C, Yanxiang H, Libing W. More efficient mechanism of topology-aware overlay construction in application-layer multicast [A]. International Conference on Networking, Architecture, and Storage[c]. NAS:IEEE,2007,7:31-36
[17]Rolf W, Thomas Z, Jochen S. Random Landmarking in Mobile [A], topology-aware peer-to-peer networks Distributed Computing Systems[c]. Proceedings 10th IEEE International Workshop on Future Trends in Distributed Computing Systems[c]. Suzhou China:IEEE,2004:319-324
[18]邱彤庆,陈贵海。一种令P2P覆盖网络拓扑相关的通用方法[J]。软件学报,2007,18(2)：381-390
[19]Ion Stoica, Robert Morris, David Liben-Nowell, et al. Chord:a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking,2003,11(1): 17-32
[20]Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Proceedings of ACM SIGCOMM. Aug27-31,2001, San Diego, CA, USA,2001:161-172
[21]Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry:a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications.2004,22 (1): 42-53
[22]Rowstron A, Druschel P. Pastry:Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In:Proc. of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms. Nov 12-16,2001, Berlin:Springer-Verlag,2001:329-350
[23]王凌,郑大钟。TSP问题次优化求解方法的比较。控制与决策,1998,13(1)：79-82
[24]Jun Gu, Xiaofei Huang, Efficient Local Search With Search Space Smoothing:A Case Study of the Traveling Salesman Problem (TSP), IEEE Transactions on Systems, Man, and Cybernetics,1994,24(5):728-735
[25]Mahdi S T, Morteza K, MohammadR. A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem, IEEE Transactions on Systems, Man, and Cybernetics-part B:Cybernetics,2007,37(4):754-770
[1]"Global IP traffic forecast and methodology,2006-2011", Cisco Systems White Paper, Jan. 2008
[2]Rongmei Zhang, Charlie Hu. Assisted Peer-to-Peer search with partial indexing, IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-1158.
[3]Hai Zhuge, Liang Feng. Distributed suffix tree overlay for Peer-to-Peer search. IEEE Transactions on Knowledge and Data Engineering,2008,20(2):276-285.
[4]Reaz Ahmed, Raouf Boutaba, Distributed Pattern Matching:a Key to Flexible and Efficient P2P Search. IEEE Journal on Selected Areas in Communications,2007,25(1):73-83
[5]Cohen, E, Fiat, A.; Kaplan, H.Volume 2, Associative search in peer to peer networks: harnessing latent semantics. vol.2,30 March-3 April 2003:1261-1271
[6]Christos Doulkeridis, Kjetil Norvag.et al. DESENT:decentralized and distributed semantic overlay generation in P2P networks. IEEE Journal on Selected Areas in Communications 2007,25(1):25-34
[7]Heng Tao Shen, Yanfeng Shu. Efficient semantic-based content search in P2P network. IEEE Transactions on Knowledge and Data Engineering,2004,16(7):813-826.
[8]Yingwu Zhu, Yiming Hu. Enhancing search performance on Gnuterlla-like P2P systems. IEEE Transactions on Parallel and Distributed System,2006,17(12):1482-1495.
[9]Sripanidkulchai, K.; Maggs, B. Efficient content location using interest-based locality in peer-to-peer systems. Processing of IEEE INFOCOM 2003, Francisco Caloforia, USA: 2166-2176
[10]Hai Zhuge, Xiang Li. Peer-to-Peer in metric space and semantic space. IEEE Transactions on Knowledge and Data Engineering,2007,19(6):759-771
[11]Yi F Z, Hong J, Jun W, et al. HBA:Distributed Metadata Management for Large Cluster-Based Storage Systems. IEEE Transactions on Parallel and Distributed Systems, 2008,19(6):750-763
[12]Alexander Loser, Steffen Staab.et al. Semantic social overlay networks. IEEE Journal on Selected Areas in Communications,2007,25(1):5-14
[13]Yifeng Zhu, Hong Jiang. Et al. HBA:Distributed metadata management for large cluster-based storage systems. IEEE Transactions on Parallel and Distributed Systems,2008, 19(6):750-763
[14]http://blog.csdn.net/jiaomeng/archive/2007/01/27/1495500.aspx
[15]http://www.cnblogs.com/Files/asashina/Bloom%20Filter.pdf
[16]http://net.pku.edu.cn/-cnds/ppt/09BloomFilter.pdf
[17]http://blog.csdn.net.sixxs.org/jiaomeng/archive/2007/03/16/1531423.aspx
[18]http://blog.csdn.net.sixxs.org/jiaomeng/archive/2007/01/27/1495500.aspx
[19]Leonardo M, Romano F. Mesh network firewalling with Bloom Filters. ICC, 2007:1546-1551
[20]Kun X, Ying H M, Da F Z, et al. A Scalable Bloom Filter for Membership Queries. GLOBECOM,2007:543-547
[21]Taskin Kocak, Ilhan Kaya. Low-Power Bloom Filter Architecture for Deep Packet Inspection. IEEE Communications Letters,2006,10(3):210-212
[22]Sarang D, Praveen K, David E. Taylor. Longest Prefix Matching Using Bloom Filters. IEEE/ACM Transactions on Networking,2006,14(2):397-409
[23]Michael Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking,2002,10(5):604-612
[24]Zhen C, Chuang L, Jia N, et al. AntiWorm NPU-based parallel Bloom Filters in Gipga-Ethernet LAN. ICC,2006:2118-2123
[25]Paul H, Marcel W. Bloom Filters:One Size Fits All? 32nd IEEE Conference on Local Computer Networks.2007:183-190
[26]Abhishek K, Jun J X, Jia W. Space-Code Bloom Filter for Efficient Per-Flow Trafic Measurement. IEEE Journal on Selected Areas in Communications,2006,24(12):2327-2339
[27]Sarang D, John W L. Fast and Scalable Pattern Matching for Network Intrusion Detection Systems. IEEE Journal on Selected Areas in Communications,2006,24(10):1781-1792
[28]Yong W, Xiao C Y, Yi F L. Analyzing the characteristics of Gnutella Overlays. International Conference on information Technology, Orissa, India, IEEE,2007
[29]Daniel Stutzbach, Reza Rejaie, Subhabrata Sen. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems. IEEE/ACM Transactions on Networking, 2008,16(2):267-280
[30]Matel Ripeanu, Ian Foster. Mapping the Gnutella Network. IEEE Internet Computing, 2002:50-57
[31]Marius Portmann, Pipat Sookavatana. The Cost of Peer Discovery and Searching in the Gnutella Peer-to-peer File Sharing Protocol. Washington, USA, IEEE,2001:263-268
[1]Sendonaris A, Erkip E, Aazhang B. User cooperation diversity-Part Ⅰ:System description. IEEE Transactions on Communications,2003,51(11):1927-1938
[2]Laneman J, Tse D, Wornell G. Cooperative diversity in wireless networks:Efficient protocols and outage behavior. IEEE Transactions on Information Theory,2004,50(12): 3062-3080
[3]Hong C Y, Pang A C.3-Approximation algorithm for joint routing and link scheduling in wireless relay networks, IEEE Trans on Wireless Communications,2009,8(2):856-861.
[4]Caleb K L, Sriram V, Robert W H. Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission. IEEE TRANS on Vehicular Technology,2009, 58(2):692-704.
[5]Liang S, Dimitrios H. Broadcasting energy efficiency limits in wireless networks. IEEE Trans on Wireless Communications,2008,7(7):2502-2611.
[6]Harish V, Sayandev M. Performance of cellular networks with relays and centralized scheduling. IEEE IEEE Trans on Wireless Communications,2005,4(5):2318-2328.
[7]Ritesh M, Neelesh B, Jin Z. Energy-efficient cooperative relaying over fading channels with simple relay selection, IEEE Trans on Wireless Communications,2008,7(8):3013-3025.
[8]Muhammad M F, Murat U. BER-optimized power allocation for fading relay channels. IEEE Trans on Wireless Communications,2008,7(6):3150-3159.
[9]Walid H, Pascal B, Philippe C. Outage probability-based power and time optimization for relay networks. IEEE Trans on Signal Processing,2009,57(2):764-782.
[10]BLETASAS A, KHISTI A, REED D P. A simple cooperative diversity method based on network path selection [J]. IEEE Journal on Selected Areas in Communications,2006, 24(3):659-672.
[11]BLETASAS A, KHISTI A, REED D P. A simple distributed method for relay selection in cooperative diversity wireless networks cased on reciprocity and channel measurements [A]. Proceeding of 61st IEEE Semiannu Vech Technol Conf[C]. Stockholm, Sweden,2005, 1484-1488.
[12]Hunter T, Nosratinia A. Diversity through coded cooperation. IEEE Transactions on Wireless Communications,2006,5(2):283-289
[13]Sreng V, Yanikomeroglu H, Falconer D D. Relayer selection strategies in cellular networks with peer-to-peer relaying. In:Proceedings of IEEE 58th Vehicular Technology Conference, Florida, USA,2003.1949-1953
[14]Kusuma A A N A, Andrew L L H. Minimum power routing for multihop cellular networks. In:Proceedings of Global Telecommunications Conference, Taiwan, China,2002.37-41
[15]Yindi Jing, Hanid Jafarkhani. Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications,2009, 8(3):1414-1422
[16]Rouse T, McLaughlin S, Band I. Congestion-based routing strategies in multihop TDD-CDMA networks. IEEE Journal on Selected Areas in Communications,2005,23(3): 668-681
[17]Larsson E G, Cao Y. Collaborative transmit diversity with adaptive radio resource and power allocation. IEEE Communications Letters,2005,9(6):511-513
[18]李国兵,朱国华等。最佳中继协作通信系统的功率分配算法,电子学报,2008,6(10)：1944-1948.
[19]Li Y, Wang W. Sub-carrier pairing for amplify-and-forward and decode-and-forward OFDM relay links. IEEE Communications Letters,2009,13(4):209-211
[20]邹玉龙,郑宝玉,崔景伍等。基于跨层机制的最佳协作中继选择及其系统实现.通信学报,2008,29(8)：1-10
[21]Wang W, Yang S, Gao L. Comparison of schemes for joint subcarrier matching and power allocation in OFDM decode-and-forward relay system. In:Proceedings of IEEE International Conference on Communications, Beijing, China,2008.4983-4987
[22]Chiu T, Ng Y, Yu W. Joint optimization of relay strategies and resource allocations in cooperative cellular networks. IEEE Journal on Selected Areas in Communications,2007, 25(2):328-339
[23]Mesbah W, Davidson T. Joint power and channel resource allocation for two-user orthogonal amplify-and-forward cooperation. IEEE Transactions on Wireless Communications,2008, 7(11):4681-4691
[24]Guo J, Luo H, Li H X. Opportunistic Relaying in Cooperative OFDM Networks for Throughput and Fairness Improvement. In:Proceedings of Global Telecommunications Conference, Louisiana, USA,2008.1-5
[25]Award M, Shen X. OFDMA Based Two-Hop Cooperative Relay Network Resources Allocation. In:Proceedings of IEEE International Conference on Communications, Beijing, China,2008.4414-4418
[26]Yue Rong, Xiaojun Tang, Yingbo Hua. A unified framework for optimizing linear nonregenerative multicarrier MIMO relay communication systems, IEEE Transactions on Signal Processing,2009,57(12):4837-4851
[27]Chunguo Li, Xiang Wang, Luxi Yang. A joint source and relay power allocation scheme for a class of MIMO relay system, IEEE Transactions on Signal Processing,2009,57(12): 4852-4860
[28]Yanwu Ding, Murat Uysal. Amplify-and-forward cooperative OFDM with multiple-relays:performance analysis and relay selection methods, IEEE Transactions on Wireless Communications,2009,8(10):4963-4968
[29]Shashibhushan Borade, Lizhong Zheng, Robert Gallager. Amplify-and-forward in wireless relay networks:rate, diversity, and network size, IEEE Transactions on Information Theory, 2007,53(10):3302-3318
[30]Jesus Gomez-Vilardebo, Ana I. Perez-Neira. Bounds on maximum rate-per-energy for orthogonal AWGN multiple-relay channels, IEEE Transactions on Wireless Communications,2008,7(11):4238-4247
[1]Topology-aware peer-to-peer overlay network for Ad-hoc. The Journal of China universities of posts and telecommunications,2008,16(1):111-115.
[2]具有动态拓扑感知的无线自组对等网,控制与决策,2010,4月
[3]A Topology-aware Peer-To-Peer Protocl Applicable to Wireless Network, Proceeding of IC-NIDC2009, BeiJing, China, IEEE.1004-1009
[4]BF-Chord:An Improved Lookup Protocol to Chord Based on Bloom Filter for Wireless P2P, Wireless Communication Confercence, July,2009