An efficient placement of sinks and SDN controller nodes for optimizing the design cost of industrial IoT systems

被引:20
作者
Faragardi, Hamid Reza [1 ]
Vahabi, Maryam [2 ]
Fotouhi, Hossein [2 ]
Nolte, Thomas [2 ]
Fahringer, Thomas [1 ]
机构
[1] Univ Innsbruck, Inst Comp Sci, A-6020 Innsbruck, Austria
[2] Malardalen Univ, POB 883, SE-72123 Vasteras, Sweden
关键词
industrial IoT; node placement; parallel ant colony optimization; software-defined networking; wireless sensor networks; WIRELESS SENSOR NETWORKS; TASK ALLOCATION; MAXIMIZING RELIABILITY; TOPOLOGY CONTROL; DEPLOYMENT; SOFTWARE; COVERAGE;
D O I
10.1002/spe.2593
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Recently, a growing trend has emerged toward using Internet of Things (IoT) in the context of industrial systems, which is referred to as industrial IoT. To deal with the time-critical requirements of industrial applications, it is necessary to consider reliability and timeliness during the design of an industrial IoT system. Through the separation of the control plane and the data plane, software-defined networking provides control units (controllers) coexisting with sink nodes, efficiently coping with network dynamics during run-time. It is of paramount importance to select a proper number of these devices (i.e., software-defined networking controllers and sink nodes) and locate them wisely in a network to reduce deployment cost. In this paper, we optimize the type and location of sinks and controllers in the network, subject to reliability and timeliness as the prominent performance requirements in time-critical IoT systems through ensuring that each sensor node is covered by a certain number of sinks and controllers. We propose PACSA-MSCP, an algorithm hybridizing a parallel version of the max-min ant system with simulated annealing for multiple-sink/controller placement. We evaluate the proposed algorithm through extensive experiments. The performance is compared against several well-known methods, and it is shown that our approach outperforms those methods by lowering the total deployment cost by up to 19%. Moreover, the deviation from the optimal solution achieved by CPLEX is shown to be less than 2.7%.
引用
收藏
页码:1893 / 1919
页数:27
相关论文
共 57 条
[1]   Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks [J].
Altinel, I. Kuban ;
Aras, Necati ;
Guney, Evren ;
Ersoy, Cem .
COMPUTER NETWORKS, 2008, 52 (12) :2419-2431
[2]  
[Anonymous], NOW AVAILABLE NEW C4
[3]  
[Anonymous], THESIS
[4]  
[Anonymous], P IEEE INT C COMM IC
[5]  
[Anonymous], 2009, METAHEURISTICS DESIG
[6]  
[Anonymous], 14 GI ITG C MEAS MOD
[7]  
[Anonymous], PAPER PRESENTED AT 1
[8]  
[Anonymous], 2010, HDB METAHEURISTICS
[9]  
[Anonymous], P 2 INT C COMP COMM
[10]  
[Anonymous], NETW OP MAN S NOMS K