{'fraction_non_alphanumeric': 0.016958733747880157, 'fraction_numerical': 0.0, 'mean_word_length': 5.4363636363636365, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Learning-Automata-Based Confident Information Coverage Barriers for Smart Ocean Internet of Things

As an emerging network paradigm, the Internet of Things (IoT) which consists of a significant number of multifunctional and heterogeneous IoT nodes has attracted dramatic attentions from both academia and industry. With the merits of intelligent capacity, desirable scalability, and high reliability, the IoT recently has been applied for smart ocean applications to provide protection for ocean environment monitoring and surveillance. Aiming to provide coverage service for ocean border environmental surveillance, this article studies the barrier coverage problem which investigates how to select a collection of IoT nodes to obtain an IoT node chain and build barrier paths to detect intruders and trespassers crossing the border region of interest. To overcome the disadvantages in the existing works on barrier coverage, we adopt a novel and widely adopted confident information coverage (CIC) model as the fundamental coverage model and formulate the CIC barrier path construction (CICBC) problem with the goals of maximizing the number of barrier paths and minimizing the amount of IoT nodes in each barrier path. We propose a distributed CIC barrier path (CICBP) construction approach based on learning automata (CBLA). The CBLA includes four crucial phases which are initialization phase, learning phase, monitoring phase, and repairing phase. Each IoT node equips a learning automaton. CBLA selects an optimal IoT node to construct the barrier path by learning. The simulation results show that the performance of the CBLA algorithm outperforms two peer algorithms in terms of the number of barrier paths and the average number of nodes in each barrier path.