Research on the Improvement of Relay Selection Algorithm for Cooperative Communication in Cluster Network

Abstract

Cooperative communication is a key technology of cluster networks, the selection of communication relay nodes has been an important direction of cooperative communication research. Cooperative communication has the characteristics of large data transmission traffic and low network energy consumption. The method of cluster communication is often used to construct the network topology. The choice of cluster head algorithm directly affects the quality of network communication. Based on the classic LEACH algorithm, this paper redesigns the value of the threshold T(n) from the three factors of node energy consumption, node neighbor number and node density. By controlling the energy consumption of all nodes in the communication process, it is avoided that the cluster head node consumes too much energy and interrupts the communication connection, thereby prolonging the overall energy consumption time of the network. Experiments show that compared with the current popular relay comparison algorithm, the improved algorithm has excellent performance in terms of network node survival rate, total data transmission, overall network energy consumption and network load balancing. Facts have proved that network constructed by the LEACH-ED algorithm has the characteristics of large transmission data volume and low energy consumption, which increases the survival rate of network nodes and the network life cycle. Experiments prove that the improved algorithm has good practicability and universality.