А method for reducing routing overhead in AD-Hoc networks based on SNR level analysis

Abstract

Increasing node density in wireless Ad-Hoc networks leads to excessive routing control overhead, reduced scalability, and higher energy consumption. This paper proposes a method for logical routing density reduction based on a combined analysis of Signal-to-Noise Ratio (SNR) and node degree. A mathematical model is developed to describe the relationship between node density, average degree, and routing overhead. To reduce effective routing participation without altering physical topology, a combined eligibility metric integrating normalized SNR and node degree is introduced. The proposed algorithm performs threshold-based link filtering to construct a sparsified routing graph. Simulation results for networks with 50–200 nodes demonstrate that the method reduces routing control overhead by up to 35% and decreases average logical node degree by 15–30%, while maintaining stable Packet Delivery Ratio. The increase in end-to-end delay remains within acceptable limits. The proposed approach improves routing scalability in dense Ad-Hoc networks while preserving connectivity and Quality of Service.