移动P2P网络中基于超级节点信息熵的资源发现算法  

Resource Discovery Algorithm Based on Rnformation Entropy of Super-peer in Mobile Peer-to-Peer Network

作　　者：彭海华[1,2] 王伟平[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083 [2]湖南城市学院通信与电子工程学院,湖南益阳413000

出　　处：《湖南城市学院学报（自然科学版）》2014年第2期71-74,共4页Journal of Hunan City University:Natural Science

基　　金：湖南省科技厅科研基金资助项目(2012GK3065);益阳市科技局科研基金资助项目(2012JZ45)

摘　　要：移动P2P网络节点的移动性特征使得网络搜索性能的变化大,也造成了资源搜索的成功率低下和系统不稳定性增加.通过选择信誉高、动态弱的节点作为超级节点,再选择一个与超级节点相对信息熵最小的节点作为此超级节点的候选超级节点的基于超级节点信息熵的选择算法.理论分析和仿真结果表明,该算法使得系统稳定性增加,可有效地提高系统的资源搜索的成功率.Peers are of a strong moving ability in mobile peer-to-peer network, which makes the searching performance of the network becoming worsen, resulting in lower success rate of system instability and resource discovery. The proposed algorithm of the resource discovery algorithm based on information entropy of super-peer can select a super-peer with weak dynamic and high credibility, and select a candidate super-peer with small information entropy compared of super-peer. The experimental results and theoretical analysis show that the algorithm could improve the performance of resource discovery and system stability in mobile peer-to-peer network.

关 键 词：移动P2P超级节点 资源发现 索引信息 

分 类 号：TU398.7[建筑科学—结构工程]