Deployment optimization for a long-distance wireless backhaul network in industrial cyber physical systems

Industrial wireless networks are an important component of industrial cyber physical systems, and their transmission performance directly determines the quality of the entire system. During deployment, the nodes of an industrial wireless network can be deployed in only some specific regions due to physical environment restrictions in the factory; thus, occlusions are not always effectively circumvented and network performance is reduced. Therefore, this article focuses on the layout problem of the industrial backhaul network: a WiFi long-distance, multi-hop network. The optimization objectives were network throughput and construction cost, and the network delay was used as a constraint. For small networks, we propose a hierarchical traversal method to obtain the optimal solution, whereas for a large network, we used a hierarchical heuristic method to obtain an approximate solution, and for extremely large networks, we used a parallel interactive local search algorithm based on dynamic programming. Then, if the original network layout cannot meet the transmission demands due to traffic bursts, we propose a network bandwidth recovery method based on the Steiner tree to recover the network’s performance. Finally, the results of a simulation showed that the algorithms proposed in this article obtain an effective solution and that the heuristic algorithm requires less computing time.

[1]  Heng Wang,et al.  A TR069 WAN management protocol for WIA-PA Wireless sensor Networks , 2016, 2016 25th Wireless and Optical Communication Conference (WOCC).

[2]  Keke Gai,et al.  Dynamic energy-aware cloudlet-based mobile cloud computing model for green computing , 2016, J. Netw. Comput. Appl..

[3]  Zenghua Zhao,et al.  Long-Distance IEEE 802.11 Wireless Mesh Networks: A Survey , 2012 .

[4]  Zhou Feng,et al.  Weight-Based Link Scheduling for Convergecast in WirelessHART Network , 2016 .

[5]  Ronald L. Graham,et al.  On the history of the Euclidean Steiner tree problem , 2013, Archive for History of Exact Sciences.

[6]  T. V. Levanova,et al.  Algorithms of Ant System and Simulated Annealing for the p-median Problem , 2004 .

[7]  Giovanni Righini,et al.  A branch‐and‐price algorithm for the capacitated p‐median problem , 2005, Networks.

[8]  Keke Gai,et al.  Spoofing-Jamming Attack Strategy Using Optimal Power Distributions in Wireless Smart Grid Networks , 2017, IEEE Transactions on Smart Grid.

[9]  Wei Hu,et al.  A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median , 2013, SODA.

[10]  Zvi Drezner,et al.  New heuristic algorithms for solving the planar p-median problem , 2015, Comput. Oper. Res..

[11]  Xi Jin,et al.  End-to-end delay analysis in wide-area heterogeneous wireless network for industrial monitoring and control applications , 2015 .

[12]  Iftekhar Hussain,et al.  An Efficient TDMA MAC Protocol for Multi-hop WiFi-Based Long Distance Networks , 2016, Wirel. Pers. Commun..

[13]  José Muñoz-Pérez,et al.  An Efficient Neural Network Algorithm for the p-Median Problem , 2002, IBERAMIA.

[14]  Illya V. Hicks,et al.  A Branch Decomposition Algorithm for the p-Median Problem , 2017, INFORMS J. Comput..

[15]  Mark H. Karwan,et al.  Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems , 2016 .

[16]  Dilson Lucas Pereira,et al.  A comparison of several models for the hamiltonian p‐median problem , 2014, Networks.

[17]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[18]  Y. Kochetov,et al.  LARGE NEIGHBORHOOD LOCAL SEARCH FOR THE P-MEDIAN PROBLEM , 2005 .

[19]  John N. Tsitsiklis,et al.  The complexity of dynamic programming , 1989, J. Complex..

[20]  Mohamed F. Younis,et al.  Connectivity restoration in a partitioned wireless sensor network with assured fault tolerance , 2015, Ad Hoc Networks.

[21]  Abraham Duarte,et al.  Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem , 2016, Eur. J. Oper. Res..

[22]  Mohamed F. Younis,et al.  Optimized relay placement to federate segments in wireless sensor networks , 2010, IEEE Journal on Selected Areas in Communications.

[23]  P. Pardalos,et al.  The p-Median Problem , 2013 .

[24]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[25]  Li Kang,et al.  The algorithms for the bi-level programming location model based on the demand assigning , 2013, FSKD.

[26]  Mohamed F. Younis,et al.  A robust relay node placement heuristic for structurally damaged wireless sensor networks , 2009, 2009 IEEE 34th Conference on Local Computer Networks.

[27]  Masayuki Miyazaki,et al.  Reliable Wireless Communication Technology of Adaptive Channel Diversity (ACD) Method Based on ISA100.11a Standard , 2017, IEEE Transactions on Industrial Electronics.