Minimizing the Route of Sink Node in Wireless Sensor Network

Abstract

The introduction of mobile drain is one of the promising methods of energy balancing in wireless sensor networks. The model is based on the travelling salesman problem. The criteria of optimization and its metric are defined by the functionality of the network. To assess the efficiency and effectiveness of the method for solving the problem, an experimental study was conducted using the Matlab simulation software package. The traveling salesman problem was solved for uniform and normal distribution of distances between network routers for 10 and 30 routers. The values of the sample average length of the optimal mobile drain route and the length of the route without optimization on a sample of 500 experiments were obtained. It is shown that the use of optimization when choosing a mobile drain route in the wireless sensor network allows on average to reduce the length of the bypass path of mobile drain by 30%-40% compared with random bypass depending on the law of distribution of distances between nodes. Recommendations for conducting a full-scale experiment based on one of the many available wireless modules of well-known manufacturers are proposed.