An Event-driven Clustering Routing Algorithm in mobile CRSNs

In Mobile Cognitive Radio Sensor Networks (CRSNs), nodes have mobility which leads to the problem of changing the topology of the network as well as uneven energy consumption of the nodes. In this paper, an event-driven clustering routing algorithm is proposed to solve the above problems. The clustering algorithm fully considers the mobile and cognitive characteristics of the nodes, which is divided into three phases, the first phase is to determine the qualified nodes, the second phase is to determine the nodes that can become the cluster head, and the third phase is that the cluster head determines the cluster members based on the affinity and similarity between the nodes ultimately constructing a finite number of clusters. This algorithm can balance the energy consumption of nodes and increase the stability of clusters. In addition, this paper also proposes a routing scheme that guarantees the minimum number of route hops. Comparing the simulation experiments with the existing algorithms, the proposed algorithm in this paper has better connectivity, lower energy consumption and a better delivery rate.