东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (9): 1257-1261.DOI: -

• 论著 • 上一篇    下一篇

移动自组网中一种基于信誉的安全分簇算法

于尧;李喆;刘军;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-09-15 发布日期:2013-06-22
  • 通讯作者: Yu, Y.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2006AA1453)

Security clustering algorithm based on reputation in mobile ad hoc networks

Yu, Yao (1); Li, Zhe (1); Liu, Jun (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-09-15 Published:2013-06-22
  • Contact: Yu, Y.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

787

摘要： 针对分级结构移动自组网的安全问题,提出基于信誉的安全分簇算法.利用信誉提高簇结构安全性,信誉由邻居节点通过对网络行为的监测进行计算,通过节点间信誉的交换提高信誉评估的准确性,并通过相关度和相对移动性两个指标保障簇结构的稳定性.依据通信需求和网络运行状况综合考虑信誉、相关度和相对移动性三个因素进行节点权值计算,利用节点权值进行簇结构的建立、维护和更新,加强对簇首和网关节点的安全监管.仿真结果表明,该算法提高了系统的安全性和稳定性.

关键词: 移动自组网, 分簇, 安全, 信誉, 权值

Abstract: By analyzing the security problem of the hierarchical mobile Ad Hoc networks, a security clustering algorithm based on reputation (SCAR) is presented. In the algorithm, the nodes' reputation is acquired through monitoring the network behaviors by neighboring nodes so as to improve the security of the clustered architecture. The mechanism of reputation exchange between nodes increases the accuracy of reputation evaluation, and the stability of clusters is ensured by the two evaluation indices, i.e., correlation and relative mobility. The weight of each node is computed according to the demand for communication and running condition of networks, with the reputation correlation and relative mobility mentioned above considered comprehensively. Then, the clustered architectures are built, maintained and updated by modul weights to strengthen the security supervision of the cluster head and gateway. Simulation results showed that the proposed algorithm improves the system security and stability.

中图分类号: