Path selection and algorithm optimization of wireless sensor networks based on sink mobile distance-constraint

In this paper, the authors have discussed the problem of longest network lifetime in the wireless sensor networks on the condition of limited sink moving distance. The optimal solution of integer linear programming model is obtained by using the energy limitation of nodes, the distance between the base stations and the model energy loss. The mobile sink path and the network lifetime can be directly obtained by the using the model. However, the execution time of the integer linear programming model increases tremendously if number of nodes is more than 25. Therefore, the authors have decomposed the optimal solution into three steps. The first step is to solve the residence time of each node by using the linear programming model without considering the moving distance. The second step is to limit the longest residence time of the base station to each node in the mobile range. The final step is to gradually increase the optimal path of the nodes until the energy of the node becomes 0. The simulation results have demonstrated that the running time of the optimized scheme is greatly reduced, but the overall lifetime of the network is slightly lower. © Copyright 2016 American Scientific Publishers All rights reserved.