A Survivability Clustering Algorithm for Ad Hoc Network Based on a Small-World Model

Abstract

In Ad hoc network, nodes have the characteristics of limited energy, self-organizing and multi-hop. For the purpose of improving the survivability of Ad hoc network effectively, this paper proposes a new algorithm named EMDWCA (Based on Energy, Mobility and Degrees of the nodes on-demand Weighted Clustering Algorithm). The LEACH algorithm is used to cluster the Ad hoc network in the first election, but the EMDWCA is used in the second election. By considering the appearances, disappearances, and communication link failures of the mobile nodes, this algorithm constructs the topology of Ad hoc network based on a small-world network model. To make sure that nodes can still communicate in the following election cycles, it improves the stability of the network topology and overall network invulnerability. The network is analyzed and simulation experiments are performed in order to compare the performance of this new clustering algorithm with the weighted clustering algorithm (WCA) in terms of the correctness, effectiveness, and invulnerability of the networks. The final result proves that the proposed algorithm provides better performance than the original WCA algorithm.