Mixed Materials
Specialized path-based technique to test Internet of Things system functionality under limited network connectivity
| Τίτλος: | Specialized path-based technique to test Internet of Things system functionality under limited network connectivity |
|---|---|
| Συγγραφείς: | Klima, Matej, Bures, Miroslav, Ahmed, Bestoun S., Bellekens, Xavier, Atkinson, Robert, Tachtatzis, Christos, Herout, Pavel |
| Στοιχεία εκδότη: | Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013) Czech Technical University in Prague, CZE Czech Technical University in Prague, CZE Czech Technical University in Prague, CZE Lupovis.io, GBR University of Strathclyde, GBR University of Strathclyde, GBR University of West Bohemia, CZE 2023 |
| Τύπος εγγράφου: | Mixed materials |
| Περίληψη: | 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 |
| Όροι ευρετηρίου: | Internet of Things, Limited network connectivity, Model-based testing, Path-based testing, Reliability, Test automation, Test case generation, Computer and Information Sciences, Data- och informationsvetenskap, Article in journal, info:eu-repo/semantics/article, text |
| DOI: | 10.1016.j.iot.2023.100706 |
| Σύνδεσμος: | Internet of Things : Engineering Cyber Physical Human Systems, 2023, 22 |
| Διαθεσιμότητα: | Open access content. Open access content info:eu-repo/semantics/openAccess |
| Σημείωση: | application/pdf English |
| Other Numbers: | UPE oai:DiVA.org:kau-93965 0000-0001-9051-7609 doi:10.1016/j.iot.2023.100706 ISI:001004574800001 Scopus 2-s2.0-85149070767 1400057628 |
| Πηγή συνεισφοράς: | UPPSALA UNIV LIBR From OAIster®, provided by the OCLC Cooperative. |
| Αριθμός Καταχώρησης: | edsoai.on1400057628 |
| Βάση Δεδομένων: | OAIster |
| DOI: | 10.1016.j.iot.2023.100706 |
|---|