Research On Energy Hole In Routing Protocol For Wireless Sensor Networks

Routing protocol is a key fundamental technology of Wireless sensor networks. Sensors are energy constrained and their batteries cannot be recharged. Therefore, the primary objective of routing protocol is energy conservation.In the large-scale network for data gathering, the sensor node transmits data to the sink via multi-hop communication. The nodes closer to the sink are burdened with heavy traffic and tend to die earlier, causing energy hole in network. Due to energy hole, the network can not work any more, and left a large number of unused energy. This paper mainly studies and solves the energy hole in the wireless sensor networks for data gathering from the following two aspects:i.In the hierarchical routing protocol, cluster heads transmit their data to the sink via multi-hop communication. The cluster heads closer to the sink are burdened with heavy relay traffic and tend to die earlier, causing network partitions. To address the problem, an improved routing algorithms based on uneven clustering (RAUC) is proposed. Cluster heads are elected based on the average residual energy of neighbor nodes and the intra-cluster communication cost. The inter-cluster communication is based on the forwarding capacity of nodes. Finally, I simulate the RAUC protocol with OMNeT++ platform. The result shows that, compared with LEACH and EEUC, the routing algorithm performs better at load balancing, reduces the energy consumption of nodes, and effectively improves the lifetime of network.ii.The non-uniform node distribution is a solution to energy hole. However, there are a lot of problems in existing distribution methods, such as no considering the data redundancy. To resolve this problem, I theoretically analyzed the energy consumption of various regions in network, and proposed a new scheme of node distribution. We can get the number of node required in the specific area. Based on the new scheme, a kernel-based routing protocol is proposed. The kernel is constructed in form of complete graph. The nodes in the same kernel work in turn to avoid too much redundant data. Simulation results show that this node deployment scheme and routing protocol is feasible and the energy of network has been utilized fully and effectively.