## 1 Introduction
To reduce the time delay of communication, [PERSON] proposed the CARQ method with K-mean estimation [12]. Nodes are classified by data preprocessing and nodes with high channel quality are selected to participate in the competition process of retransmitting the signal. The algorithm reduces the energy consumption in the retransmission process. Because data preprocessing requires grouping and arranging nodes, the algorithm requires a large storage space hardware. The hardware is too expensive and is gradually abandoned for use. In the last few years of research, the focus of scholars shifted to distributed networks. The classical results of CARQ with multiple relays were proposed for optimizing the control accuracy. [PERSON] proposed a packet multiple relay retransmission strategy [13]. The method pre-packets the data, and the communication between the packets relies on relay forwarding signals. Within the packets, packets are forwarded simultaneously according to different links, the channel with better transmission capability defines the best communication link, and the best forwarding node is responsible for forwarding the data of the link. The communication process consumes a lot of energy because the data needs to be pre-processed, while the probability of successful data forwarding is low. Although some scholars have modified the algorithm, the distribution of communication nodes is not regular, the relay forwarding time is too long, the secondary retransmission link is not changed, and the probability of successful signal retransmission is not improved. Automatic retransmission request strategies for multiple relay nodes are the focus of contemporary research. The research history of the ARQ technique and relay selection technique in cooperative communication is shown in Table 1. Currently, in order to reduce the power consumption, scholars focus more on algorithms such as \"relay selection, channel quality and power allocation\" [14; 15; 16]. [PERSON] [17] proposed a multi-relay automatic retransmission selection strategy. First, multiple relays are classified by means of subcluster screening, and the node with the lowest probability of final signal interruption within the group is defined as the best node. In the second stage of cooperative communication work, the best relay is used as a forwarding node for retransmitting the signal, and the signal is retransmitted four times before stopping transmission. Due to the increase in the number of relay nodes, each relay node needs to compete before transmitting the signal, so the computation time of the algorithm is long and the algorithm is not suitable for clustered networks. Based on this, a novel competing retransmission request strategy based on listening nodes is proposed. In the second stage of communication, the listening node participates in the signaling retransmission competition process of the best relay node. Since the source node broadcasts the signal and the surrounding nodes receive the signal with increased probability of successful decoding, the listening node has the ability to compete. When the relay node forwards the source signal to the destination node, the surrounding non-decoding nodes gain the same diversity gain at this time. If the relay forwarding fails, the non-decoding nodes will participate in the second stage of the retransmission competition. Since the channel of the listening node is better than that of the relay node, the probability of the signal being successfully decoded is greatly increased by the good quality of the signal forwarded by the listening node. Since the communication process no longer initiates the first stage signal repetition command, the source node is not involved in the retransmission process and the goal of low-power communication of the system is satisfied. The experiments show that the improved method has good practicality and is suitable for multi-node cooperative communication.