Specialized path-based technique to test Internet of Things system functionality under limited network connectivity

Klima, Matej and Bureš, Miroslav and Ahmed, Bestoun S. and Bellekens, Xavier and Atkinson, Robert and Tachtatzis, Christos and Herout, Pavel (2023) Specialized path-based technique to test Internet of Things system functionality under limited network connectivity. Internet of Things, 22. 100706. ISSN 2542-6605 (https://doi.org/10.1016/j.iot.2023.100706)

[thumbnail of Klima-etal-IoT-2023-Specialized-path-based-technique-to-test-Internet-of-Things-system-functionality]
Preview
 Text. Filename: Klima_etal_IoT_2023_Specialized_path_based_technique_to_test_Internet_of_Things_system_functionality.pdf
Final Published Version
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (2MB)| Preview

Abstract

Contemporary Internet-of-Things (IoT) systems are hindered by several reliability-related issues, especially, the dynamic behavior of IoT systems caused by limited and often unstable network connectivity. Several intuitive ad-hoc approaches can be employed to test this behavior; however, the effectiveness of these approaches in detecting defects and their overall testing costs remain questionable. Therefore, we present a new specialized path-based technique to test the processes of an IoT system in scenarios wherein parts of these processes are influenced by limited or disrupted network connectivity. The proposed technique can be scaled using two levels of test coverage criteria to determine the strengths of the test cases. For this purpose, we propose two algorithms for generating test cases to implement the technique: an ant colony optimization-based search and a graph-traversal-based test case composition. We compared the efficiency of the proposed approach with possible solutions obtained using a standard path-based testing approach based on prime paths computed by a set-covering algorithm. We consider the total number of test case steps as the main proxy for test effort in experiments employing 150 problem models. For the less intensive of the two used test-coverage criteria, EachBorderOnce, an ant colony optimization-based algorithm, produced test sets with the same averaged number of steps as the graph traversal-based test-case composition; however, this algorithm performed with averaged number of steps 10% lower than a prime paths-based algorithm. For the more intensive test coverage criterion, AllBorderCombinations, these differences favoring the ant colony optimization-based algorithm were 18% and 25%, respectively. For these two types of defined test coverage criteria, the ant colony optimization-based search, graph-traversal-based algorithm, and standard path-based testing approach based on prime paths achieved the best results for 93 and 78, 14 and 24, and 13 and 17 models for AllBorderCombinations and EachBorderOnce criterion, respectively. Therefore, to guarantee the best test set, all compared algorithms are combined in a portfolio strategy that yields the best results based on the potential of the produced test sets to detect simulated defects caused by limited network connectivity. Additionally, this portfolio strategy also yields test sets, implying the lowest test effort for experimental problem instances.

ORCID iDs

Klima, Matej, Bureš, Miroslav, Ahmed, Bestoun S., Bellekens, Xavier, Atkinson, Robert ORCID logoORCID: https://orcid.org/0000-0002-6206-2229, Tachtatzis, Christos ORCID logoORCID: https://orcid.org/0000-0001-9150-6805 and Herout, Pavel;
CORE (COnnecting REpositories)