Research On Sleep Scheduling Algorithm For Low Energy Consumption In WSNs

In recent years,because of the advantage of small size and low price and so on,wireless sensor has been widely used in national military defense,medical health,environmental monitoring and other aspects.However,wireless sensor is powered by battery,the small size of which limits the electricity it can carry,and in many cases,the difficulty of replacing batteries causes energy consumption problem of the wireless sensor networks(WSNs),which has been of concern by people,and get more and more scholars devoted into the study of improving the energy efficiency of network.By analyzing the characteristics of Omnidirectional sensor network,An iterative optimal sleep scheduling algorithm is proposed to solve the target coverage problem in directed sensor networks.The algorithm use two-dimensional arrays to represent candidate solutions,a random number of candidate solutions are initialized and added to the candidate solution set.The recombination function generates new candidate solutions according to the current candidate solution set which helps to enrich the diversity of candidate solution.The algorithm calls the adjustment function and the sleep function to act on the candidate solution set,the adjustment function tries to adjust the sensing direction of sensor nodes in the candidate solution to reduce the number of sensors used to save energy;The sleep function tries to remove the redundant solution in the candidate solution after the adjustment function ends to reduce the energy waste.The algorithm obtains the optimal problem solution after applying multiple rounds of operations of calculation,reorganization,adjustment and scheduling to the initial candidate solution set.Through experimental verification,Comparing with the other two algorithms in the field,the proposed algorithm can achieve a longer network lifetime.A multi-stage greedy coverage algorithm is proposed for the target coverage problem of omnidirectional sensor networks.The algorithm is divided into three stages,first,using the fitness function to select reasonable sensor nodes to build the cover set,the fitness function takes into account the coverage contribution rate of the sensor nodes,the coverage influence on other target points,the standard deviation of energy and other factors;On the premise of completing the coverage task,radius optimization is used to reduce the useless coverage in the network;In the redundant coverage optimization stage,reduce energy by adjusting the perceived radius of the node or adjusting the working state of the node.Experimental results show that the proposed multi-stage greedy coverage algorithm can obtain a longer network lifetime compared with other similar algorithm.In addition,the design and implementation of the overlay optimization system based on iterative optimization sleep scheduling algorithm and multi-stage greedy coverage algorithm.After the system needs analysis and functional design,the system is roughly divided into interactive modules,data processing modules and system control modules.The data processing module is responsible for checking and converting the input data which facilitates the use of other modules,the system control module as the core of the system performs complex calculations according to the input network information.The system can calculate efficient coverage schemes for different scenarios fast.