A clustering algorithm based on nonuniform partition for WSNs

Abstract

Wireless sensor networks (WSNs) have great application potential in partition parameter observation, such as forest fire detection. Due to the limited battery capacity of sensor nodes, how to reduce energy consumption is an important technical challenge. In this paper, we propose an energy efficient routing algorithm of adaptive double cluster head (CH) based on nonuniform partition for WSN. Firstly, according to the distance information from the base station (BS) to every sensor node, the network is divided into several uneven partitions. Secondly, CH is selected for each partition as the primary cluster head (PCH). Because of the cluster-level routing, the CHs close to the BS need to forward more data than the CHs in other areas, which consumes more energy. Therefore, an adaptive double CH method can be used to generate a secondary cluster head (SCH) in the cluster near the BS according to the parameters. Finally, the PCH is responsible for data collection, data integration, and data transmission. while the SCH is in charge of data routing. Simulation results show that the proposed algorithm can reduce the energy consumption and extend the life of the WSNs, compared with LEACH protocol and the HEED protocol.

Keywords

• wsn
• double cluster head
• leach
• nonuniform grid