Priority-Based Energy Aware and Coverage Preserving Routing for Wireless Sensor Network
Yunquan Dong, Qingyi Quan, Jian Zhang · 2008
To maximize the life time of the energy limited Wireless Sensor Network, energy efficient routing algorithms are needed. These algorithms organize nodes into hierarchy and ensure collaboration among nodes. The clustering-based LEACH is one of the most classic protocols among them. In this paper, we provide a modified version of LEACH, mainly focusing on the selection of cluster-head nodes in the network. In the proposed PBEACP, we take into consideration of the remaining energy as well as nodes' geographic distribution in the selection of cluster-head nodes, leading to a more even distribution of the energy consumption among nodes. It also improves in guaranteeing the sensing coverage of cluster-head nodes, even if the topology of the network changes when there are nodes running out of energy. As is shown in our simulation results, the mean of nodes' life time is increased while the deviation is decreased. Also, the number of cluster-head nodes in the network is more stable.