## 4 MEMAC Algorithm Design
### Design and Implementation of Clustering Protocol
Secondly, the traffic weights of underwater nodes are proportionally adjusted via the MEMAC algorithm proposed in this paper and used as rewards for the node-selection PCH strategy, allowing for more rational participation in PCH competition. The channel state information of nodes is also introduced into the game model for PCH competition via the algorithm, thereby enhancing the environmental adaptability of the clustering algorithm. Lastly, the overall energy consumption level of the network is introduced to optimize the strategy for CH competition, and the setting of CH rotation thresholds via the algorithm ensures the overall stability of the network. Simulation experiments have demonstrated that the algorithm proposed in this paper is outperformed by none of the three classical algorithms, LEACH, CCCS, or GTC, in terms of the network lifespan, the average residual energy of nodes, and the total amount of data received via the central node. Thus, while network stability is ensured, the adaptability of node clustering is improved, and the overall performance of the network is optimized. In future work, the DC-MAC protocol based on game theory in the literature [25] will be further improved, and the scheduling strategy for the CH node in the MAC protocol will be optimized according to the communication distance between nodes so as to avoid the collision between underwater mobile nodes and CHs. In addition, the communication method adopted in this paper is mainly underwater acoustic communication. The articles \"Underwater Moving Object Detection Using Superficial Electromagnetic Flow Volometer Array-Based Artificial Lateral Line System [26]\" and \"An optical system for suppression of laser echo energy from the water surface on single-band bathymmetric \"LiDAR\"\", [27] other

Figure 6: Comparison of the total data received by the central node. communication media, like optical systems' relevant technologies and methods, and future work will also increase attention and improve research. Conceptualization, L.X. ; methodology, L.X. ; software, R.Z. and C.C. ; validation, R.Z. and C.C.C. ; formal analysis, L.X. ; investigation, L.X. and R.Z. ; data curation, L.X. ; writing--original draft preparation, L.X. and R.Z. ; writing--review and editing, L.X. and C.C. ; supervision, C.C. All authors have read and agreed to the published version of the manuscript. This work was supported in part by the National Natural Science Foundation of China under Grant 62163011, in part by the major science and technology plan of Hainan Province under Grant ZDRJ[2021052, in part by the Hainan Provincial Graduate Innovative Project under Grant Qhyb2023-30. Not applicable. Data Availability Statement: Data are contained within the article. Thanks to [PERSON] for the financial support provided by the National Natural Science Foundation of China (Grant no. 62163011). The authors declare no conflicts of interest. ## References

* [1] [PERSON]; [PERSON] [PERSON]; [PERSON] State-of-the-art underwater acoustic communication modems: Classifications, analyses and design challenges. _Wirel. Pers. Commun._**2021**, _116_, 1325-1360. [CrossRef]
* [2] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] A software-defined underwater acoustic modem for everyone: Design and evaluation. _IEEE Internet Things Mag._**2023**, \(6\), 102-107. [CrossRef]
* [3] [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] Energy Harvesting in Underwater Acoustic Wireless Sensor Networks: Design, Taxonomy, Applications, Challenges and Future Directions. _IEEE Access_**2022**, _10_, 134606-134622. [CrossRef]
* [4] [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] A survey on energy efficiency in underwater wireless communications. _J. Netw. Comput. Appl._**2022**, _198_, 103295. [CrossRef]
* [5] [PERSON]; [PERSON] On the Best Fitness Function for the WSN Lifetime Maximization: A Solution Based on a Modified Salp Swarm Algorithm for Centralized Clustering and Routing. _IEEE Trans. Netw. Serv. Manag._**2023**, _20_, 4244-4254.