A Routing Algorithm Based on Partition Sensor Network Scope

Wireless sensor network has the advantages of low cost, low energy consumption, high flexibility and convenient deployment. It has a wide application market in environment, military, medical and other fields. In the wireless sensor network, LEACH algorithm could cause the waste of node energy due to the cluster nodes are far away from the cluster head and close to the base station. To solve this problem, a partition sensor network scope K-LEACH algorithm was proposed based on the LEACH algorithm. It introduced the distance parameter K. Nodes within the scope of base station as the center and k as the range of radius did not participate in cluster head election rotation, and communicate with the base station directly. The optimal value of k was selected from the experimental results. Through simulation, the analysis compares of the performance between LEACH and K-LEACH algorithm were provided mainly focus on the network stabilization and life cycle.