TRABPT:一种移动P2P网络可信路由选择算法  

TRABPT: new trusted mobile P2P network routing algorithm

作　　者：严远亭[1] 王杨[1,2] 赵鹏程[1] 南敏[1] 许勇[1] 

机构地区：[1]安徽师范大学计算机系,安徽芜湖241000 [2]南京邮电大学计算机学院,南京210003

出　　处：《计算机应用研究》2010年第9期3458-3461,共4页Application Research of Computers

基　　金：安徽省高校自然科学研究重点资助项目(KJ2010A148);安徽师范大学博士科研启动资金资助项目(2010AH032);安徽师范大学科研创新团队计划资助项目(2009JSJ001);芜湖市科技局2010年科技基金资助项目

摘　　要：针对移动P2P网络中源节点与目标节点之间如何从多条可选路径中选择可信路由的问题,基于前景理论（PT）提出了一种新的移动P2P网络可信路由选择算法TRABPT（trusted mobile P2P network routing algorithmbased on prospect theory）。利用PT中的权重函数对路由过程中下一跳节点进行选择,提高了路由选择的灵活度和可信度。理论分析和仿真实验表明,本算法与DSR和Flooding算法相比在任务完成效率、平均查找时间及抵制恶意节点等方面有一定程度的改进。In order to solve the trusted routing problem in many paths between source node and destination node in mobile P2P network,this paper proposed a new algorithm named TRABPT. It used weighting function in PT to choose next peer in routing process,which improved flexibility and reliability in routing. Theory analysis and experiments indicate that the algorithm has a certain improvement compared with DSR and Flooding algorithms in following aspects including task accomplish efficiency, average search time and the reject of hostile node.

关 键 词：前景理论 移动P2P网络 可信路由 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]