Loading…

Ultra reliable load-aware connection management (LACM) algorithm in WIA-FA systems

The increasing demand for industrial automation and intelligence has put forward higher requirements for the reliability of industrial wireless communication technology. As an international standard based on 802.11, Wireless networks for Industrial Automation-Factory Automation (WIA-FA) greatly impr...

Full description

Saved in:
Bibliographic Details
Published in:China communications 2024-08, Vol.21 (8), p.142-161
Main Authors: Gang, Liu, Chunhao, Jiang, Xiaochun, Ren, Pingzhi, Fan, Chengchao, Liang, Zheng, Ma
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The increasing demand for industrial automation and intelligence has put forward higher requirements for the reliability of industrial wireless communication technology. As an international standard based on 802.11, Wireless networks for Industrial Automation-Factory Automation (WIA-FA) greatly improves the reliability in factory automation scenarios by Time Division Multiple Access (TDMA). However, in ultra-dense WIA-FA networks with mobile users, the basic connection management mechanism is inefficient. Most of the handover and resource management algorithms are all based on frequency division multiplexing, not suitable for the TDMA in the WIA-FA network. Therefore, we propose Load-aware Connection Management (LACM) algorithm to adjust the linkage and balance the load of access devices to avoid blocking and improve the reliability of the system. And then we simulate the algorithm to find the optimal settings of the parameters. After comparing with other existing algorithms, the result of the simulation proves that LACM is more efficient in reliability and maintains high reliability of more than 99.8% even in the ultra-dense moving scenario with 1500 field devices. Besides, this algorithm ensures that only a few signaling exchanges are required to ensure load balancing, which is no more than 5 times, and less than half of the best state-of-the-art algorithm.
ISSN:1673-5447
DOI:10.23919/JCC.ea.2022-0537.202401