A New Routing Solution Based on Hierarchical Clustering to Increase Efficiency in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) consist of numerous nodes dispersed across an environment, with each sensor operating independently or collaboratively to achieve specific objectives. One critical issue in WSNs is establishing reliable and energy-efficient routes. When a node depletes its energy or goes to sleep, its associated links are disrupted, potentially causing network failures. Therefore, discovering routes with sufficient energy levels and reliable data transmission is of great importance. In this paper, we propose a novel approach to reducing energy consumption by leveraging the LEACH pattern, auxiliary nodes, and node coordinates to minimize overhead and enhance load balancing within the network. In the proposed method, when a route request packet is sent, the receiver waits briefly and selects the packet sent by the node closest to it, irrespective of the hop count. Additionally, to reduce redundancy, the method utilizes node coordinates, where parent nodes maintain the coverage area of their subtrees. This eliminates the need for broadcasting packets across the entire network when sending to a specific region. The proposed algorithm is implemented within the base AOMDV algorithm for WSNs, resulting in a new routing mechanism named "Coordinate-Aware Tree AOMDV" (CT_AOMDV). The performance of the proposed protocol mechanism is evaluated using the NS-۲ simulator, and the results are visualized through MATLAB-generated graphs. The obtained simulation results compare CT_AOMDV against ZD_AOMDV in various scenarios and metrics, demonstrating its effectiveness.

کلیدواژه ها:

Wireless Sensor Networks ، Clustering ، Network Lifetime ، Energy Consumption