Embedding a Cluster-Based Overlay Mesh in Mobile Ad Hoc Networks without Cluster Heads

The stability of clusters is a serious issue in mobile ad hoc networks. Low stability of clusters may lead to rapid failure of clusters, high energy consumption for reclustering, and decrease in the overall network stability in mobile ad hoc network. In order to improve the stability of clusters, weight-based clustering algorithms are utilized. However, these algorithms only use limited features of the nodes. Thus, they decrease the weight accuracy in determining node’s competency and lead to incorrect selection of cluster heads. A new weight-based algorithm presented in this paper not only determines node’s weight using its own features, but also considers the direct effect of feature of adjacent nodes. It determines the weight of virtual links between nodes and the effect of the weights on determining node’s final weight. By using this strategy, the highest weight is assigned to the best choices for being the cluster heads and the accuracy of nodes selection increases. The performance of new algorithm is analyzed by using computer simulation. The results show that produced clusters have longer lifetime and higher stability. Mathematical simulation shows that this algorithm has high availability in case of failure.

Download Full-text

Research on the subtractive clustering algorithm for mobile ad hoc network based on the Akaike information criterion

International Journal of Distributed Sensor Networks ◽

10.1177/1550147719877612 ◽

2019 ◽

Vol 15 (9) ◽

pp. 155014771987761 ◽

Cited By ~ 1

Author(s):

Liu Banteng ◽

Haibo Yang ◽

Qiuxia Chen ◽

Zhangquan Wang

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Akaike Information Criterion ◽

Clustering Algorithm ◽

Ad Hoc ◽

Information Criterion ◽

Subtractive Clustering ◽

Cluster Heads ◽

Mobile Ad Hoc ◽

Hoc Networks

Large and dense mobile ad hoc networks often meet scalability problems, the hierarchical structures are needed to achieve performance of network such as cluster control structure. Clustering in mobile ad hoc networks is an organization method dividing the nodes in groups, which are managed by the nodes called cluster-heads. As far as we know, the difficulty of clustering algorithm lies in determining the number and positions of cluster-heads. In this article, the subtractive clustering algorithm based on the Akaike information criterion is proposed. First, Akaike information criterion is introduced to formulate the optimal number of the cluster-heads. Then, subtractive clustering algorithm is used in mobile ad hoc networks to get several feasible clustering schemes. Finally, the candidate schemes are evaluated by the index of minimum of the largest within-cluster distance variance to determine the optimal scheme. The results of simulation show that the performance of the proposed algorithm is superior to widely referenced clustering approach in terms of average cluster-head lifetime.

Download Full-text