## 4 Cluster Sleep-Wake Scheduling Algorithm
### Cluster Sleep-Wake Scheduling Algorithm
#### 4.3.4 Description of the Algorithm
The simulated environmental parameters are shown in Table 3.

Wherein, the node sensing radius of the cluster sleep-wake scheduling algorithm is related to the node level \(R_{ank}\). While \(R_{ank}=1\), the sensing radius is set to \(r_{s}=14.43\) m; while \(R_{ank}=2\), the sensing radius is set to \(r_{s}=17.97\) m; while \(R_{ank}=3\), the sensing radius is set to \(r_{s}=20.41\) m. The sensing radius of the random deployment algorithm and the redundant node sleep algorithm is set to \(r_{s}=20\) m.

In Figure 15, the relationship between the number of working nodes and the coverage rate is shown under the same node communication radius and sensing radius. It can be clearly seen that the three algorithms are gradually increasing in network coverage as the number of working nodes increases. Although the network coverage of the redundant node dormancy algorithm will be higher when the number of working nodes is small, the network coverage of the cluster sleep-wake scheduling algorithm will be higher as the number of working nodes increases, and this trend will be keep going. This is because the cluster sleep-wake scheduling algorithm selects only one working node in each partition unit, which ensures that the nodes can be evenly distributed in the target waters, reducing node redundancy. The redundant node sleep algorithm selects the node with high perceived contribution as the working node, but there may be too many local nodes, which will increase the node redundancy. Therefore, the network coverage of the cluster sleep-wake scheduling algorithm is higher when the number of working nodes is the same. As shown in Figure 16, it is the relationship between network coverage and time. At the beginning of the algorithm, 300 nodes are put into the network at the same time, all three algorithms can achieve high coverage. When entering the 30 th round, the coverage of the random deployment algorithm is greatly reduced. Although the coverage change of the cluster sleep-wake scheduling algorithm and the redundant node sleep algorithm is small, it can be seen that the coverage of the cluster sleep-wake scheduling algorithm is higher. This is because the cluster sleep-wake scheduling algorithm adopts a node rotation strategy, and when the threshold is reached, the working node is replaced, so that the energy consumption can be balanced, and the working node exists in each partition unit as much as possible. The redundant node sleep algorithm selects to wake up the redundant node after the node energy is exhausted, and the sensing contribution of the redundant node is smaller than the perceived \begin{table}
\begin{tabular}{c c} \hline \hline
**Attribute Parameter** & **Value** \\ \hline examination range & 100 m \(\times\) 100 m \(\times\)100 m \\ Number of nodes & 300 \\ Sensing radius & 14.43 m, 17.97 m, 20.41 m, 20 m \\ Partition unit side length & 16.67 m \\ Cluster border length & 50 m \\ Number of partition unit & 216 \\ Number of cluster & 8 \\ Initial energy of the node & 100 J \\ \(P_{min}\) & \(2\times 10^{-4}\) W \\ \(E_{dec}\) & \(2\times 10^{-4}\) J \\ \(E_{m}\) & \(2\times 10^{-3}\) J \\ \hline \hline \end{tabular}
\end{table} 
Table 3: Environmental parameters. contribution of the working node, so the node perceptual contribution in the network increases with time. The degree is reduced and the node redundancy is increased. Therefore, the network sleep coverage of the cluster sleep-wake scheduling algorithm is higher when the runtime is the same. As shown in Figure 17, the change in the number of working nodes in the network is shown over time. In the case of deploying 300 nodes as well, the random deployment algorithm is that all nodes work at the same time, so that there will be a large drop in the number of working nodes over time. At the same time, the existence of a large number of redundant nodes will consume a large amount of energy, making the lifetime cycle of the network very short, and the entire wireless network will die in the 60 th round.