Research On Node Scheduling In Wireless Sensor Networks Based On MiniSAT

Wireless Sensor network(Wireless Sensor Networks,WSN)application in various fields,WSN research as early as the U.S.military was concerned,it is mainly used for collecting the information needed to observer,in the harsh environment,human beings cannot personally to collect information,so use sensors to collect and sense within the scope of all kinds of information in a particular area,such as wind speed,volume,precipitation and other information.Each sensor has a different perception range and carries a limited amount of energy.In order to ensure the integrity of data,we generally randomly place high-density sensor nodes in the monitoring environment,but this is usually at the cost of huge consumption of network energy,and the application cost of WSN is not considered.In the study of the current node scheduling algorithm,can't satisfy completely covers the target area and the purpose of WSN energy consumption at least,through the analysis of the energy consumption of sensor parts function,found that when the sensor node dormancy,lowest energy consumption of sensor nodes,then we can revive the least nodes to make it work,make the rest of the sensor nodes in a dormant state,at the same time to achieve full coverage area and reduce the network energy consumption demand,so this article is based on the idea to design a new kind of node scheduling algorithm.Boolean logic satisfiability Problem(Boolean Satisfifiability Problem,SAT)is a NP complete Problem,and it has been solved,it is the core Problem of computer theory and application and on the world to solve the NP Problem is in the lead,the SAT Problem has been applied in numerous NP problems,for example,a lot of problems in the practical life can be converted into the SAT Problem to solve,such as password authentication,circuit design,sorting,etc.Current WSN are widespread application on high energy consumption and high requirements of the target area coverage two questions,so this article is based on the two problems,to design an efficient algorithm is based on MiniSAT node scheduling algorithm,the proposed algorithm the nodes can be reasonably dispatch,through the node scheduling problem is transformed into the SAT problem,after respectively from two aspects of logical level and implementation level is analyzed,finally MiniSAT solver is used to get the result of the experiment,and because the MiniSAT solver(a SAT solver)code open nature and structure of simplicity,Therefore,the MiniSAT solver could be used to automate the solution very quickly.The experimental results show that the algorithm designed in this paper finds out the minimum number of nodes and can cover all the areas that the observer needs to monitor as long as it wakes them up.Through thecomparative analysis with the traditional method,on the premise of all observers need monitoring area,the algorithm awaken the number of nodes need to work less than the traditional algorithm,and through the several means of node scheduling algorithm and the existing comparative analysis,found that under the same conditions,the existing several algorithms to achieve full coverage of monitoring area,but the algorithm of monitoring area coverage rate reached 100%,so the algorithm not only completely covers need to be monitoring the target area,and reduces the cost of energy consumption and application of WSN,the WSN can be widely used.