Threshold distance-based cluster routing protocols for static and mobile wireless sensor networks

Abstract

In cluster-based wireless sensor network routing protocols, when the cluster head transfers data based on single hop transmission to the sink node, then the cluster heads that are farther away deplete more energy as compared to nearby cluster heads. This condenses load balancing in the network. If the cluster heads collaborate with each other and transfer data based on multihop transmission, then the cluster heads nearer to the sink node are burdened with significant relay traffic and deplete energy much faster, which causes a network coverage problem also known as a hot spot problem. To avoid both of the above problems, this paper proposes two protocols: LEACHDistance and LEACHDistance-M. LEACHDistance is proposed for static wireless sensor networks where cluster heads are chosen based on the upper threshold distance, lower threshold distance, and remaining energy. LEACHDistance-M is proposed for mobile wireless sensor networks where the selection of cluster heads is based on the upper threshold distance, lower threshold distance, remaining energy, and least mobility. The simulation results show that the proposed protocols increase network lifetime, increase the number of packets received by the base station, are more energy efficient, and are also more scalable when evaluated with other existing routing protocols.