Design of Routing Algorithm for Wireless Sensor Networks based on Clustering Structure

Zhenghua Zhang, Zheng Gong, Jie Xu, Jiafeng Zhang2019 · DOI

Abstract

Based on deep research into wireless sensor network routing algorithms, this paper proposes MEEMLC-LEACH (More Energy-Efficient Multi-Levels Clustering LEACH). The algorithm adopts a three-level clustering method and incorporates an energy factor into the cluster head election formula, shortening data transmission distances between nodes. Simulation results using MATLAB show that the network lifetime of the MEEMLC-LEACH algorithm is approximately 1.4 times that of the standard LEACH algorithm, effectively balancing energy consumption and prolonging network utility.

The Energy Bottleneck in Smart Agriculture

Wireless Sensor Networks (WSNs) are the backbone of "Smart Agriculture," but they face a critical bottleneck: energy. Most sensor nodes are battery-powered and deployed in remote fields where manual recharging is impossible.

The classic solution is the LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm, which groups nodes into clusters to aggregate data. However, LEACH relies on a randomized "lottery" to pick cluster heads, often ignoring a node's remaining battery or its distance from the base station. If a low-battery node is picked as a cluster head, it dies quickly, creating "hot spots" and causing the entire network to fail prematurely.

Methods: The MEEMLC-LEACH Approach

The authors introduce MEEMLC-LEACH to address these inefficiencies through three main components:

  1. Energy-Aware Election: Instead of random selection, this algorithm incorporates an "energy factor." It prioritizes nodes with higher Remaining Energy (RE) and better proximity to the base station ($D_{toBS}$) for cluster head roles.
  2. Multi-Level Layering: The network is organized into layers where the transmission radius scales with the hierarchy. This structured approach shortens the distance data must travel between member nodes and their heads.
  3. Multi-Hop Transmission: Rather than every cluster head attempting a power-hungry direct transmission to the base station, data is passed upwards through the layers in a "parent-child" relationship.
Figure 1: Diagram of the multi-level clustering structure and hierarchical data transmission path.

Simulation and Key Results

The study utilized a MATLAB simulation environment with 200 nodes distributed over a 200m x 200m monitoring area. The performance of Direct Routing, LEACH, and MEEMLC-LEACH was compared across several metrics.

Network Lifetime and Node Survival

The simulation demonstrated that while MEEMLC-LEACH has a slightly higher initial setup cost due to nodes establishing their hierarchy, the long-term payoff is substantial. By equalizing energy consumption, the algorithm ensures that nodes die at roughly the same time, maintaining network functionality for much longer than its predecessors.

Figure 2: Comparison of node survival rates over time, showing MEEMLC-LEACH (c) significantly outperforming LEACH (b) and Direct Routing (a).
  • Extended Lifetime: MEEMLC-LEACH demonstrated a lifetime approximately 1.45 times longer than LEACH.
  • Enhanced Operational Duration: In simulations, Direct Routing nodes failed after ~600 frames and LEACH nodes after ~1500 frames. MEEMLC-LEACH kept the network operational for nearly 3500 to 4000 frames.
  • Energy Balance: The algorithm effectively synchronized the energy consumption speed of each node, preventing the "hot spot" problem where central nodes burn out too early.

Conclusion and Future Directions

MEEMLC-LEACH offers a significant improvement in balancing energy consumption and extending the operational life of agricultural WSNs. While the model assumes nodes can detect their own energy levels and locations, future work will involve moving from MATLAB simulations to real-world agricultural detection systems to verify performance in unpredictable outdoor environments and non-uniform node distributions.

Summary updated

Abstract

Based on the deep research of wireless sensor network routing algorithm, proposed a MEEMLC-LEACH (More Energy-Efficient Multi-Levels Clustering LEACH) optimized routing algorithm. The main contents include: Adopting the three-level clustering method and incorporating the energy factor into the calculation formula of the electoral cluster head node, shortening the distance of data transmission between the member node and the cluster head, the cluster head node and the BS;When the initial state is completely the same, concluded the network lifetime of the MEEMLC-LEACH algorithm is about 1.4 times that of the LEACH algorithm by calculating the total energy consumption of each frame; Finally, using MATLAB to simulate the optimization algorithm by using direct routing (Direct), LEACH and MEEMLC-LEACH three routing methods, Visually shows the superiority of the optimization algorithm in balancing energy consumption and prolonging network lifetime.
BibTeX
@misc{zhang2019design,
  author = {Zhenghua Zhang and Zheng Gong and Jie Xu and Jiafeng Zhang},
  title = {{Design of Routing Algorithm for Wireless Sensor Networks based on Clustering Structure}},
  year = {2019},
  doi = {10.12792/iciae2019.024},
}
Figure