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

2018 ◽  
Author(s):  
Ehsan Kharati ◽  
Mohamad Khalili ◽  
Hamid Kermajani
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Tabu Search ◽  
Network Coding ◽  
Search Algorithm ◽  
Wireless Sensor ◽  
Optimization Models ◽  
Tabu Search Algorithm ◽  
Optimal Route ◽  
Mobile Sinks

Recent studies have shown that the use of mobile sinks and Network Coding (NC) and determining the Sink Optimal Route (SOR) in wireless sensor networks (WSNs) reduces the energy consumption. The purpose of this paper is to determine the multicast SOR to move mobile sinks at specific deadline using NC and modeling and problem formulating based on a Mixed Integer Linear Programming (MILP) in WSNs. In this paper, we first show that finding the SOR is NP-hard, and then for determining the SOR, several convex optimization models are presented using Support Vector Regression (SVR). Solving these models in a polynomial time is not possible due to various parameters and limited resources of WSNs. To solve this problem in polynomial time, a Tabu Search algorithm is proposed to reduce runtime and energy consumption. Simulation results show that optimization models and proposed Tabu Search algorithm significantly reduce energy consumption and required time for computing than non-NC methods.

Application of the Tabu Search Algorithm on Solving the Optimum Heating Institution of Reheating Furnace

2011 ◽  
Vol 130-134 ◽  
pp. 1725-1729
Author(s):  
Ye Jian Yang ◽  
Ze Yi Jiang ◽  
Xin Xin Zhang ◽  
Peng Jin
Keyword(s):  
Mathematical Model ◽  
Energy Consumption ◽  
Tabu Search ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Reheating Furnace ◽  
Consumption Cost ◽  
Optimum Heat ◽  
Heating Model ◽  
Oxidation Loss

With the aim of minimizing the energy consumption cost and taking the billet heating quality as the constraint condition, a mathematical model was established based on the billet heating model to solve the optimum heat institution of the reheating furnace. The tabu search algorithm was employed to solve the model. The results of the industrial production data optimization showed that the proposed mathematical model and the solving method could fully meet the practical production demand of the reheating furnace. In addition to satisfying the heating quality requirements, the energy consumption is reduced and the oxidation loss is decreased. Compared with the original one, the heating institution obtained from the mentioned model and algorithm had a better performance on energy efficiency.

scholarly journals Shortest Distribution Route Determination Of Pesticides Product Using Tabu Search Algorithm (Case Study : CV. Buana Artha Mandiri, Sidoarjo, Indonesia)

2020 ◽  
Vol 1 (01) ◽  
pp. 56-60
Author(s):  
Yustina Ngatilah ◽  
Anasyah Septiara ◽  
Caecilia Pujiastuti ◽  
Desak Ayu Clara Dewanti
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Distribution Area ◽  
Tabu Search Algorithm ◽  
Optimal Route ◽  
Industrial Chemicals ◽  
Large Area ◽  
Distribution Process ◽  
Tabu Search Method ◽  
Fixed Distribution

Distribution is activity of delivering goods or services from producers to consumers. CV. Artha BuanaMandiri is a company engaged in Agricultural Industrial Chemicals. The products produced by CV. Artha Buana Mandiri are pesticides. With a large area distribution, the company's distribution process is still considered to be less optimal because there is no fixed distribution route due to the large number of routes used for the East Java distribution area, causing delays in the distribution process of pesticide products. The purpose of this study is to minimize the distance to obtain the optimal distribution route. Optimal route determination is included in the problem of Traveling Salesman Problem (TSP). One solution to solve TSP problems is to use the Tabu Search Algorithm. Tabu Search is a metaheuristic method based on local search. The process of performance moves from one solution to the next by choosing the best solution. The main purpose of this method is to prevent the search process from re-searching the space of the solution that has been traced. From the calculation it can be seen that the optimal route of the Tabu Search method is better than the company route with an optimum route of 251.3 km.

Prolonging the Lifetime of Wireless Sensor Networks using LPA-star Search Algorithm

2016 ◽  
Vol 1 (2) ◽  
pp. 390
Author(s):  
Ahmed A. Alkathmawee ◽  
Lusong Feng ◽  
Imad S. Alshawi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Search Algorithm ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Network Partition ◽  
Data Packets ◽  
Power Resources ◽  
New Energy

<p>Since sensors have limited power resources, energy consumption has become a critical challenge to Wireless Sensor Networks (WSNs). Most of the routing protocols proposed to transmit data packets through paths which consume low energy aim simply to reduce battery power consumption. This can lead to lead to network partition and reduce network lifetime.Therefore, to balance energy consumption and extend network lifetime while minimizing packet delivery delay; this paper proposes a new energy-routing protocol using the lifelong planning A-star (LPA-star) search algorithm. This algorithm is used to find an optimum forwarding path between the source node and the sink. The optimum path can be selected depending on highest residual sensor energy, the shortest distance to the sink and lowest traffic load. Simulation results indicate that the proposed protocol increased the lifetime of the network compared with the A-star routing (EERP) protocol.</p>

scholarly journals Biased trajectory dissemination of uncontrolled mobile sinks for event collection in wireless sensor networks

2016 ◽  
Vol 12 (12) ◽  
pp. 155014771668203 ◽  
Author(s):  
Guisong Yang ◽  
Lijun Wang ◽  
Linhua Jiang ◽  
Xingyu He
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Path Length ◽  
Cluster Head ◽  
Mobile Sink ◽  
Superior Performance ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
The Social

Considering the social properties of mobile sinks, we propose a biased trajectory dissemination of uncontrolled mobile sinks for event collection in wireless sensor networks. In biased trajectory dissemination of uncontrolled mobile sink, we first divide the whole network into clusters which can be managed by cluster heads that are elected in turn for intra-cluster event collection and inter-cluster communication. Second, for a mobile sink, we further divide the clusters it visits into biased clusters and non-biased clusters according to its staying probability. The mobile sink will send its mobility message which shows its location as it moves into a new cluster. We then construct a biased loop which is composed of all biased clusters and some non-biased clusters to disseminate a mobile sink’s mobility message only to clusters on it when the mobile sink moves into a biased cluster. We also construct query path that connects any cluster head that is not on the biased loop to a cluster head on it. An event could be transmitted to the biased loop along the query path for further forwarding to the mobile sink. Numerous simulations show the superior performance of biased trajectory dissemination of uncontrolled mobile sink compared to the representative schemes in terms of average path length, delay, and network energy consumption.

Sign in / Sign up

Export Citation Format

Share Document