Determination of the Multicast Optimal Route for Mobile Sinks in a Specified Deadline Using Network Coding and Tabu Search Algorithm in Wireless Sensor Networks

Abstract

The purpose of this paper is to determine a multicast optimal route (OR) at a specific deadline for mobile sinks (MSs) using network coding (NC) in wireless sensor networks (WSNs). For this purpose, we first show that the solution of the problem of OR of MSs (ORM) is NP-hard; then to solve this problem, we propose several convex optimization models based, on the mixed integer linear model (MILP). In these models, NC and support vector regression (SVR) methods are used, and the difference of the models is based on their objective function, which includes maximizing the fit value, minimizing the total energy consumption of the active sensor nodes (ASNs), minimizing the energy consumption of the entire network, and maximizingthe remaining energy of ASNs. These models cannot be solved in polynomial time because they have several parameters and WSNs resources are limited. For this purpose, we propose an algorithm based on the tabu search (TS) algorithm. In the simulation section, we compare the proposed algorithm and optimization models with the famous traveling salesman problem (TSP). The results show the superiority of the proposed models and algorithm based on the deadline, the number of ASNs in energy consumption and network lifetime and calculation time. Each model based on its objective function improves energy consumption by 23% and network lifetime by 16%. The reason for this excellence is the use of NC in models. However, the calculation time in the models is 8% more than the proposed and TSP algorithms.