Range-based Distributed Recruit Scheduling in WSNs

Node scheduling is one approach used to balance the problems of energy constraints in wireless sensor networks. By analyzing the range-based sleep scheduling algorithm (RBSS), we find that the recruitnode energy consumption of the RBSS is too large. This condition results in the node having premature deaths, which in turn, affect the network life cycle. To solve this problem, we propose a range-based distributed recruit scheduling (RBDRS) method based on the regular hexagon node coverage model, combined with energy-balanced concept. The RBDRS algorithm adopts the method of distributed recruitment, which transfers the recruited task of cooperating nodes to new-recruitment cooperative nodes in order to balance network energy consumption. Recruitment nodes recruit the farthest neighbor nodes as collaborative nodes based on their distance; then, the collaborative nodes recruit new collaborative nodes for recruitment nodes until they are unable to recruit new ones. Simulation results show that, compared with the RBSS algorithm, in case the overhead does not increase, the RBDRS algorithm can effectively reduce the number of worker nodes, thus improving network coverage, achieving balanced network energy consumption, and prolonging the network's lifetime.