Movement-Assisted Load Balancing Data Collection Strategy In Three-Dimensional Sensor Network

Wireless Sensor Networks(WSN)is a distributed system,which consists of several sensor nodes.One of the most important functions is data collection.It is necessary to extend the network lifetime as long as possible in order to enable WSN to collect data for users for a long time.However,WSN cannot work continuously because of the limited energy of sensor nodes.Therefore,extending network lifetime has become a key problem to be solved at this stage.There exists the problem of short network lifetime whether in two-dimensional or three-dimensional WSN.The thesis mainly researches the data collection in the three-dimensional wireless sensor network,which introduces the mobile Sink.In addition,starting from reducing network energy consumption and balancing network load,a data collection method BADC(Buffer-Assisted Data Collecting,BADC)with buffer is designed.The main work of the thesis is as follows:(1)The overall scheme of three-dimensional WSN data collection is designed.The basic design idea of BADC is proposed,and BADC network model and energy consumption model are established.The problem of prolonging the network lifetime as long as possible is transformed into two minimization problems.In other words,the total energy consumption of the network and the maximum average load of the network are minimized under the routing strategy of the source node and the mobile strategy of Sink.(2)BADC is divided into three parts.Firstly,BADC buffer region is designed.Considering the network energy consumption and load balancing,the optimal buffer region(ball ring)is obtained.Secondly,data routing of source nodes is designed.Artificial bee colony algorithm is applied to data routing design of source nodes.The optimal data routing is obtained by considering the path length of the external node in the bufer area and the residual energy of the node through which the routing is carried out.Thirdly,the path of Sink is designed.Ant colony algorithm is used to design the shortest path that Sink can traverse all data nodes in the buffer area.(3)The performance of BADC is simulated and analyzed.The optimal data routing of source nodes based on artificial bee colony algorithm and Sink shortest path based on ant colony algorithm are simulated by MATLAB.The path length of all data nodes in buffer region based on ant colony algorithm is compared with random traversal.In addition,the thesis compares network energy consumption,network load distribution and network lifetime under different buffer settings.The experimental results show that BADC has the best performance.