Research On Node Scheduling Algorithm For Three-Dimensional Wireless Sensor Networks

Wireless Sensor Networks(WSN)Node scheduling algorithm is a node adaptive management technology to improve network resource utilization and extend network running time.Considering the robustness of wireless sensor network,and sensor battery capacity is limited and not easy to supplement,most of the wireless sensor network through densely deployed sensors to obtain a high coverage rate,at the same time through the node scheduling algorithm makes the nodes to work alternately,so as to save energy,prolong the network life cycle.However,the problems such as overlapredundancy,data redundancy,channel conflict and network congestion caused by dense deployment will waste a lot of unnecessary energy and shorten the network lifetime.Closing some redundant nodes is the main method of node scheduling technology under the premise of guaranteeing the minimum network coverage of supporting application requirements.Most of the existing node scheduling algorithm based on the two-dimensional plane,because of the complexity of sensor network connectivity and coverage calculation in three-dimensional space,node scheduling algorithm for two-dimensional plane is hard to be applied to the 3D environment.Based on the analysis of the existing two-dimensional node scheduling algorithm,this paper proposes a new scheduling algorithm to improve the network lifetime.The main work of this paper is as follows:1.A scheduling algorithm based on neighbor node classification(NeighborClassification-based scheduling algorithm,NCBS)is proposed.Node scheduling algorithm usually saves energy by dormant part of redundant nodes,but some nodes after dormancy will face the network coverage cannot meet the application requirements,NCBS algorithm can meet the specified coverage requirements,more sensor nodes sleep.Firstly,the neighbor nodes are divided into two categories according to the distance,and the constraint relationship between the network coverage and the number of active nodes is analyzed,and then judge whether the node is redundant.2.A method of 3D Node Scheduling Based on relative local density(Node-Based relative density scheduling,NBLD)is proposed.Most of the current node scheduling algorithm with redundant nodes to sleep negotiation backoff mechanism of redundant nodes,communication and collision of the serious energy waste avoidance,NBLD algorithm can effectively reduce the energy consumption of the redundant node scheduling,and balance the network boundary nodes energy consumption.The algorithm defines the node relative local density concept,according to the principle of redundancy judging whether the node is the boundary nodes and the coverage redundancy,then according to the residual energy of nodes and the relative local density make redundant nodes with probability competition way so as to avoid the energy consumption of node dormancy,dormancy retreatThe simulation results show that the algorithm can effectively identify the sleep redundant nodes under the condition of satisfying the specified coverage rate,balance the network energy consumption and prolong the network lifetime.