A Secure Clustering Algorithm in Mobile Ad Hoc Networks
Yao Yu, Lincong Zhang · 2012
Ad Hoc networks are much vulnerable to be attacked because of its characteristics. In this paper, we analyze the security problem in the hierarchical mobile Ad Hoc networks. And then we propose a secure clustering algorithm based on reputation in defense of threats in clustering. In the algorithm, the nodes' reputation is used to improve security, which is evaluated by combining the experience of the node in the routing process. In addition, we consider degree and relative mobility in the clustering to guarantee the stability of clusters. The weight of each node is computed through considering the above three factors simultaneously. It is used to elect the secure backbone nodes in the networks. Moreover, it is efficient in the cluster rebuilding and healing. The simulation results show that the proposed algorithm can effectively improve the security and stability of network.