On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks

This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures

Load-Similar Node Distribution for Prolonging Network Lifetime in PMRC-Based Wireless Sensor Networks

In this paper, the energy hole problem in Progressive Multi-hop Rotational Clustered (PMRC)-based wireless sensor networks (WSNs) is studied. We first analyze the traffic load distribution in PMRC-based WSNs. Based on the analysis, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to solve the energy hole problem in PMRC-based WSNs. Simulation results demonstrate that the load-similar node distribution strategy significantly prolongs network lifetime than uniform node distribution and an existing nonuniform node distribution strategies. The analysis model and the proposed load-similar node distribution strategy have the potential to be applied to other multi-hop WSN structures

A Kind of Energy-Efficient Clustering Algorithm for Wireless Sensor Networks

To solve the limited energy problem of nodes in the wireless sensor networks (WSN), a rapid Energy-efficient Clustering Algorithm (EECA) has been proposed. In the initialization stage of the system, the deployment region is rapidly divided into multiple clusters, then the node self energy consumption ratio and degree are chosen as the weigh criterion for cluster head selection, consequently the re-election of a cluster head becomes a locally triggered action. Due to the re-election of cluster head node is only proceeded within the cluster, its complexity and computation load has been greatly reduced. The theoretical analysis indicates that the information and time complexity of EECA cluster formation algorithm are O(1), which means the algorithm has nothing to do with the network size n and has a small cost. Simulation results indicate that EECA can provide better load-balancing performance and less protocol overhead of cluster head nodes. Comparing with LEACH protocol, EECA can reduce the energy consumption and prolong the network lifetime