A novel clustering algorithm for ad hoc network

In recent years, various types of ad hoc routing protocols have been studied in the mobile ad hoc networks. Specifically, the clustering hierarchical routing algorithms have been developed to increase the system performance. Hierarchical structure has inevitably brought some drawbacks, maintaining the hierarchical structure needs more complicated cluster heads selection algorithm, which may result in the cost of maintaining cluster structure. This paper explores a novel clustering algorithm for ad hoc network. This algorithm is based on the higher stability of the cluster structures and the lower cost of maintaining the route, and the concept of ldquoException Degreerdquo is introduced into the algorithm which can judge whenever to start to adjust cluster structures in terms of the exception degree. Analysis and experiments demonstrate the features that the frequency of changing cluster heads is lower and the stability is higher.