An efficient genetic algorithm for large-scale planning of dense and robust industrial wireless networks

摘要

With the penetration of Internet of things in manufacturing industry, it is an unavoidable issue to maintain robust wireless connections among machines and human workers in harsh industrial environments. However, the existing wireless planning tools focus on office environments, which are less harsh than industrial environments regarding shadowing effects of diverse obstacles. To fill this gap, this paper proposes an over-dimensioning (OD) model, which automates the decision making on deploying a robust industrial wireless local area network (IWLAN). This model creates two full coverage layers while minimizing the deployment cost, and guaranteeing a minimal separation distance between two access points (APs) to prevent APs that cover the same region from being simultaneously shadowed by an obstacle. Moreover, an empirical one-slope path loss model, which considers three-dimensional obstacle shadowing effects, is proposed for simple yet precise coverage calculation. To solve this OD model even at a large size, an efficient genetic algorithm based over-dimensioning (GAOD) algorithm is designed. Genetic operators, parallelism, and speedup measures are tailored to enable large-scale optimization. A greedy heuristic based over-dimensioning (GHOD) algorithm is further proposed, as a state-of-the-art heuristic benchmark algorithm. In small- and large-size OD problems based on industrial data, the GAOD was demonstrated to be 20%-25% more economical than benchmark algorithms for OD in the same environment. The effectiveness of GAOD was further experimentally validated with a real deployment system. Though this paper focuses on an IWLAN, the proposed GAOD can serve as a decision making tool for deploying other types of robust industrial wireless networks in terms of coverage, such as wireless sensor networks and radio-frequency identification (RFID) networks. (C) 2017 Elsevier Ltd. All rights reserved.