Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.10.001
Sita Rani , Sachin Kumar , Aman Kataria , Hong Min
Due to the complex functioning of Smart Healthcare Systems (SHS), many security concerns have been raised in the past. It provisions the attackers to hamper the working of SHS in a variety of ways, e.g., injection of false data to replace vital signs, tampering of medical devices to prevent informing critical situations, etc. In this work, a novel ML-based framework, i.e., SmartHealth is proposed to secure IoMT devices in SHS. SmartHealth watches the vital signs gathered through different IoMT to analyze the change in various body activities to differentiate between normal activities and dangerous security attacks. The performance of the SmartHealth is also analyzed for three different dangerous attacks. During performance analysis, it has been observed that SmartHealth can identify wicked activities in IoMT 92% times accurately with an F1-score of 90%.
{"title":"SmartHealth: An intelligent framework to secure IoMT service applications using machine learning","authors":"Sita Rani , Sachin Kumar , Aman Kataria , Hong Min","doi":"10.1016/j.icte.2023.10.001","DOIUrl":"10.1016/j.icte.2023.10.001","url":null,"abstract":"<div><p>Due to the complex functioning of Smart Healthcare Systems (SHS), many security concerns have been raised in the past. It provisions the attackers to hamper the working of SHS in a variety of ways, e.g., injection of false data to replace vital signs, tampering of medical devices to prevent informing critical situations, etc. In this work, a novel ML-based framework, i.e., SmartHealth is proposed to secure IoMT devices in SHS. SmartHealth watches the vital signs gathered through different IoMT to analyze the change in various body activities to differentiate between normal activities and dangerous security attacks. The performance of the SmartHealth is also analyzed for three different dangerous attacks. During performance analysis, it has been observed that SmartHealth can identify wicked activities in IoMT 92% times accurately with an F1-score of 90%.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 425-430"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523001170/pdfft?md5=144439fcd5ccb7bc21527f663e6a247a&pid=1-s2.0-S2405959523001170-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135605569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.11.004
Tuan-Minh Pham , Thi-Minh Nguyen
Maintaining a service continuum is crucial for providing a reliable service in an Internet-of-Things (IoT) system based on Network Function Virtualization (NFV) due to the distribution of Virtual Network Functions (VNF). We address the optimization problem of VNF migration in an NFV-enabled IoT system (NIoT), considering the dynamics of traffic volume processed by an individual IoT function. We develop an optimization model based on integer linear programming and a function traffic-aware heuristic algorithm to solve the problem. The evaluation results show that our proposed heuristic algorithm offers an approximation solution very close to the optimal VNF migration in significantly reduced time. It outperforms a benchmark solution based on Simulated Annealing in both the service restoration cost and computation time. Furthermore, our findings provide valuable insights into an investment strategy for an IoT service provider seeking to enhance the system performance in the presence of a failure.
{"title":"Function traffic-aware VNF migration for service restoration in an NFV-enabled IoT system","authors":"Tuan-Minh Pham , Thi-Minh Nguyen","doi":"10.1016/j.icte.2023.11.004","DOIUrl":"10.1016/j.icte.2023.11.004","url":null,"abstract":"<div><p>Maintaining a service continuum is crucial for providing a reliable service in an Internet-of-Things (IoT) system based on Network Function Virtualization (NFV) due to the distribution of Virtual Network Functions (VNF). We address the optimization problem of VNF migration in an NFV-enabled IoT system (NIoT), considering the dynamics of traffic volume processed by an individual IoT function. We develop an optimization model based on integer linear programming and a function traffic-aware heuristic algorithm to solve the problem. The evaluation results show that our proposed heuristic algorithm offers an approximation solution very close to the optimal VNF migration in significantly reduced time. It outperforms a benchmark solution based on Simulated Annealing in both the service restoration cost and computation time. Furthermore, our findings provide valuable insights into an investment strategy for an IoT service provider seeking to enhance the system performance in the presence of a failure.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 374-379"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523001479/pdfft?md5=5724545eb5624775a6223c255874b9ce&pid=1-s2.0-S2405959523001479-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135670292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.08.001
Tran Manh Hoang , Le The Dung , Ba Cao Nguyen , Taejoon Kim
In this paper, we propose and analyze an unmanned aerial vehicle (UAV)-assisted non-orthogonal multiple access (NOMA) short packet communication (SPC) system, where finite-size data packets are transmitted from a UAV to multiple users. The block error rate (BLER), throughput, and energy efficiency (EE) are used as metrics to evaluate the proposed system performance. We adopt the Gaussian-Chebyshev quadrature and the first-order Riemann integral to derive the approximate expressions of BLERs. The accuracy of the derived expressions is verified by presenting that numerical results are perfectly matched with analysis results. We also formulate optimization problems to maximize the throughput with respect to the number of transmitted bits and the altitude of the UAV. Numerical results in this paper provide useful knowledge about the relationships among BLER, throughput, EE, transmitted packet size, the altitude of the UAV, and the Rician factor.
{"title":"Performance analysis and optimization of UAV-assisted NOMA short packet communication systems","authors":"Tran Manh Hoang , Le The Dung , Ba Cao Nguyen , Taejoon Kim","doi":"10.1016/j.icte.2023.08.001","DOIUrl":"10.1016/j.icte.2023.08.001","url":null,"abstract":"<div><p>In this paper, we propose and analyze an unmanned aerial vehicle (UAV)-assisted non-orthogonal multiple access (NOMA) short packet communication (SPC) system, where finite-size data packets are transmitted from a UAV to multiple users. The block error rate (BLER), throughput, and energy efficiency (EE) are used as metrics to evaluate the proposed system performance. We adopt the Gaussian-Chebyshev quadrature and the first-order Riemann integral to derive the approximate expressions of BLERs. The accuracy of the derived expressions is verified by presenting that numerical results are perfectly matched with analysis results. We also formulate optimization problems to maximize the throughput with respect to the number of transmitted bits and the altitude of the UAV. Numerical results in this paper provide useful knowledge about the relationships among BLER, throughput, EE, transmitted packet size, the altitude of the UAV, and the Rician factor.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 292-298"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523000942/pdfft?md5=8baab726bf524fbba5712a809d6359ee&pid=1-s2.0-S2405959523000942-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136135941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.07.011
Ehab Mahmoud Mohamed
In this paper, we will consider the problem of multi-unmanned aerial vehicles (UAVs) deployment among users’ hotspots. UAVs carry reconfigurable intelligent surface (RIS) boards to strengthen millimeter wave (mmWave) coverage at these hotspots. UAVs should maximize hotspots’ sum data rates while minimizing their flights’ cost, i.e., hovering and flying energy consumptions. Moreover, collisions should be avoided among UAVs, i.e., one hotspot should be served by only one UAV at a time. In this paper, this problem is considered as a multi-player multi-armed bandit (MP-MAB) game with budget constraint and collision avoidance. In this context, budget constraint Thompson sampling (TS) with collision avoidance MAB algorithm (BTSCA-MAB) is proposed to efficiently implement the formulated MP-MAB game. Numerical analysis confirms the superior performance of the proposed BTSCA-MAB over other benchmarks.
在本文中,我们将考虑在用户热点之间部署多无人机(UAV)的问题。无人飞行器携带可重构智能表面(RIS)板,以加强这些热点的毫米波(mmWave)覆盖。无人机应最大限度地提高热点的总数据传输率,同时最大限度地降低飞行成本,即悬停和飞行能耗。此外,还应避免无人飞行器之间发生碰撞,即一个热点每次只能由一个无人飞行器提供服务。本文将这一问题视为具有预算约束和避免碰撞的多人多臂强盗(MP-MAB)博弈。在此背景下,提出了预算约束汤普森采样(TS)与避免碰撞 MAB 算法(BTSCA-MAB),以有效实现所制定的 MP-MAB 博弈。数值分析证实了所提出的 BTSCA-MAB 算法的性能优于其他基准算法。
{"title":"Deployment of mmWave multi-UAV mounted RISs using budget constraint Thompson sampling with collision avoidance","authors":"Ehab Mahmoud Mohamed","doi":"10.1016/j.icte.2023.07.011","DOIUrl":"10.1016/j.icte.2023.07.011","url":null,"abstract":"<div><p>In this paper, we will consider the problem of multi-unmanned aerial vehicles (UAVs) deployment among users’ hotspots. UAVs carry reconfigurable intelligent surface (RIS) boards to strengthen millimeter wave (mmWave) coverage at these hotspots. UAVs should maximize hotspots’ sum data rates while minimizing their flights’ cost, i.e., hovering and flying energy consumptions. Moreover, collisions should be avoided among UAVs, i.e., one hotspot should be served by only one UAV at a time. In this paper, this problem is considered as a multi-player multi-armed bandit (MP-MAB) game with budget constraint and collision avoidance. In this context, budget constraint Thompson sampling (TS) with collision avoidance MAB algorithm (BTSCA-MAB) is proposed to efficiently implement the formulated MP-MAB game. Numerical analysis confirms the superior performance of the proposed BTSCA-MAB over other benchmarks.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 277-284"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523000905/pdfft?md5=0235934103d5a555f223bcbfaaf7fc42&pid=1-s2.0-S2405959523000905-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76979847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.08.007
Viacheslav Kovtun, Yuriy Ivanov
In 1997, the US National Science Foundation recognized the need to unite research communities together to solve mutual problems, overcome challenges, future development and practical applications of cryptography and error correction coding. Recent works in this area are connected with turbo codes, which have a special ability to provide error correction characteristics of the information transmission close to theoretically obtained values. Besides, they are used for television (DVB-RCS, DVB-RCT), wireless local networks (WiMAX), software-defined radio systems, mobile (3G, 4G, Inmarsat) and space (CCSDS) communications etc. In this article is presented the crypto coding system based on turbo codes with secret keys used by interleavers. All calculations are performed during data encoding, which reduces the computational complexity of data pre-encryption. The necessary mathematical apparatus was presented, the security level of the communication system was estimated, a simulation of the error correction characteristics was performed, and multimedia information was processed. The working characteristics of the classical and proposed turbo codecs do not differ statistically. The results can be used in communication systems for various functional purposes.
{"title":"Crypto coding system based on the turbo codes with secret keys","authors":"Viacheslav Kovtun, Yuriy Ivanov","doi":"10.1016/j.icte.2023.08.007","DOIUrl":"10.1016/j.icte.2023.08.007","url":null,"abstract":"<div><p>In 1997, the US National Science Foundation recognized the need to unite research communities together to solve mutual problems, overcome challenges, future development and practical applications of cryptography and error correction coding. Recent works in this area are connected with turbo codes, which have a special ability to provide error correction characteristics of the information transmission close to theoretically obtained values. Besides, they are used for television (DVB-RCS, DVB-RCT), wireless local networks (WiMAX), software-defined radio systems, mobile (3G, 4G, Inmarsat) and space (CCSDS) communications etc. In this article is presented the crypto coding system based on turbo codes with secret keys used by interleavers. All calculations are performed during data encoding, which reduces the computational complexity of data pre-encryption. The necessary mathematical apparatus was presented, the security level of the communication system was estimated, a simulation of the error correction characteristics was performed, and multimedia information was processed. The working characteristics of the classical and proposed turbo codecs do not differ statistically. The results can be used in communication systems for various functional purposes.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 330-335"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523001091/pdfft?md5=9532dae942c22d37249cbfc5f48de222&pid=1-s2.0-S2405959523001091-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74510105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.12.002
S.K. Wijayasekara , P. Sasithong , H.-Y. Hsieh , P. Saengudomlert , C.-B Chae , L. Wuttisittikulkij
This work investigates the problem of efficient packet scheduling and transmission for IEEE 802.15.4e TSCH based on the Traffic-Aware Scheduling Algorithm (TASA). Three Integer Linear Programming (ILP) formulations are proposed, namely ILP1, ILP2, and ILP3, to comprehensively address key aspects of how packets are optimally delivered from child nodes to the root node, including node parent selection, packet scheduling, and frequency assignment. ILP1 is proposed to model the fundamental operations of TASA including packet scheduling and frequency assignment, while ILP2 further takes node parent selection into consideration for jointly optimizing node parent selection, packet scheduling, and frequency assignment. Despite its superior performance, ILP2 is only applicable to relatively small network problems due to high computational complexity. Therefore, we finally propose ILP3 for fast and efficient node parent selection. ILP3 can be combined with ILP1 and, most importantly, TASA for achieving effective node parent selection atop packet scheduling and frequency assignment for practical TSCH networks. ILP3 combined with ILP 1 led to computational complexity while ILP3 combined with TASA yielded good performance where it required less than one second of execution time and less packet delivery time.
{"title":"Optimization of packet transmission scheduling and node parent selection for 802.15.4e Time Slotted Channel Hopping (TSCH)","authors":"S.K. Wijayasekara , P. Sasithong , H.-Y. Hsieh , P. Saengudomlert , C.-B Chae , L. Wuttisittikulkij","doi":"10.1016/j.icte.2023.12.002","DOIUrl":"10.1016/j.icte.2023.12.002","url":null,"abstract":"<div><p>This work investigates the problem of efficient packet scheduling and transmission for IEEE 802.15.4e TSCH based on the Traffic-Aware Scheduling Algorithm (TASA). Three Integer Linear Programming (ILP) formulations are proposed, namely ILP1, ILP2, and ILP3, to comprehensively address key aspects of how packets are optimally delivered from child nodes to the root node, including node parent selection, packet scheduling, and frequency assignment. ILP1 is proposed to model the fundamental operations of TASA including packet scheduling and frequency assignment, while ILP2 further takes node parent selection into consideration for jointly optimizing node parent selection, packet scheduling, and frequency assignment. Despite its superior performance, ILP2 is only applicable to relatively small network problems due to high computational complexity. Therefore, we finally propose ILP3 for fast and efficient node parent selection. ILP3 can be combined with ILP1 and, most importantly, TASA for achieving effective node parent selection atop packet scheduling and frequency assignment for practical TSCH networks. ILP3 combined with ILP 1 led to computational complexity while ILP3 combined with TASA yielded good performance where it required less than one second of execution time and less packet delivery time.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 442-450"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523001601/pdfft?md5=2f5adadfd16bccc191bfbbd20ab8866e&pid=1-s2.0-S2405959523001601-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139019105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.08.006
Sang-Woo Lee , Jung-Hyok Kwon , Dongwan Kim , Eui-Jik Kim
This paper presents bidirectional encoder representations from transformers (BERT)-based deep learning model for the classification of scientific articles. This model aims to increase the efficiency and reliability of human health risk assessments related to electromagnetic fields (EMF). The proposed model takes the title and abstract of EMF-related articles and classifies them into four categories: animal exposure experiment, cell exposure experiment, human exposure experiment, and epidemiological study. We conducted a performance evaluation to verify the superiority of the proposed model. The results demonstrated that the proposed model outperforms other deep learning models that use pre-trained embeddings, with an average accuracy of 98.33%.
{"title":"Research category classification of scientific articles on human health risks of electromagnetic fields using pre-trained BERT","authors":"Sang-Woo Lee , Jung-Hyok Kwon , Dongwan Kim , Eui-Jik Kim","doi":"10.1016/j.icte.2023.08.006","DOIUrl":"10.1016/j.icte.2023.08.006","url":null,"abstract":"<div><p>This paper presents bidirectional encoder representations from transformers (BERT)-based deep learning model for the classification of scientific articles. This model aims to increase the efficiency and reliability of human health risk assessments related to electromagnetic fields (EMF). The proposed model takes the title and abstract of EMF-related articles and classifies them into four categories: animal exposure experiment, cell exposure experiment, human exposure experiment, and epidemiological study. We conducted a performance evaluation to verify the superiority of the proposed model. The results demonstrated that the proposed model outperforms other deep learning models that use pre-trained embeddings, with an average accuracy of 98.33%.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 336-341"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S240595952300108X/pdfft?md5=15f9324a2d9c0d5df63909e1b4a2ea6f&pid=1-s2.0-S240595952300108X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72479890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2024.02.002
Mindaugas Juodis, Ernestas Filatovas, Remigijus Paulavičius
The decentralization paradigm has made blockchain one of the most disruptive technologies today. When evaluating the level of decentralization, the key metric for most public blockchain networks is the degree of decentralization of the resources responsible for determining who generates the blocks. In turn, it facilitates a greater understanding of both security and scalability on a blockchain. This work provides an overview of the current state-of-the-art on wealth decentralization, which has not yet received the attention it deserves. We collect data, calculate various wealth decentralization metrics, and compare our results with research on the same methodology. As the amount of data for various blockchains increases rapidly, it is helpful to have techniques to aggregate data for statistical analysis. We introduce and provide conservative estimates of decentralized group metrics based on the reduced data and compare them with full-data measurements. Our research considers both the Layer 1 blockchains of Bitcoin and Ethereum, along with Layer 2 blockchains such as Arbitrum, Optimism, and Polygon.
{"title":"Overview and empirical analysis of wealth decentralization in blockchain networks","authors":"Mindaugas Juodis, Ernestas Filatovas, Remigijus Paulavičius","doi":"10.1016/j.icte.2024.02.002","DOIUrl":"10.1016/j.icte.2024.02.002","url":null,"abstract":"<div><p>The decentralization paradigm has made blockchain one of the most disruptive technologies today. When evaluating the level of decentralization, the key metric for most public blockchain networks is the degree of decentralization of the resources responsible for determining who generates the blocks. In turn, it facilitates a greater understanding of both security and scalability on a blockchain. This work provides an overview of the current state-of-the-art on wealth decentralization, which has not yet received the attention it deserves. We collect data, calculate various wealth decentralization metrics, and compare our results with research on the same methodology. As the amount of data for various blockchains increases rapidly, it is helpful to have techniques to aggregate data for statistical analysis. We introduce and provide conservative estimates of decentralized group metrics based on the reduced data and compare them with full-data measurements. Our research considers both the Layer 1 blockchains of Bitcoin and Ethereum, along with Layer 2 blockchains such as Arbitrum, Optimism, and Polygon.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 380-386"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959524000079/pdfft?md5=cdd1ef5281579e570dc9185b4b505df5&pid=1-s2.0-S2405959524000079-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139890409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2024.02.008
Yehia Ibrahim Alzoubi , Alok Mishra
Numerous consensus mechanisms have been suggested to cater to the specific characteristics of fog computing. To comprehensively understand their unique features, performance, and applications in fog computing, it is crucial to conduct a systematic analysis of these mechanisms. For this study, 79 relevant articles were carefully selected based on predefined criteria. Among these articles, 35 employed work-proof-based consensus mechanisms, 24 utilized voting-based mechanisms, and 22 adopted capability-based mechanisms. Among the 26 identified consensus mechanisms, proof of work remains the most prevalent one. It is important to note that the scope of this paper is limited to the research available in the predominant databases at the time of writing. Future research may expand to include additional databases and more recent literature in this domain.
{"title":"Blockchain consensus mechanisms comparison in fog computing: A systematic review","authors":"Yehia Ibrahim Alzoubi , Alok Mishra","doi":"10.1016/j.icte.2024.02.008","DOIUrl":"10.1016/j.icte.2024.02.008","url":null,"abstract":"<div><p>Numerous consensus mechanisms have been suggested to cater to the specific characteristics of fog computing. To comprehensively understand their unique features, performance, and applications in fog computing, it is crucial to conduct a systematic analysis of these mechanisms. For this study, 79 relevant articles were carefully selected based on predefined criteria. Among these articles, 35 employed work-proof-based consensus mechanisms, 24 utilized voting-based mechanisms, and 22 adopted capability-based mechanisms. Among the 26 identified consensus mechanisms, proof of work remains the most prevalent one. It is important to note that the scope of this paper is limited to the research available in the predominant databases at the time of writing. Future research may expand to include additional databases and more recent literature in this domain.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 342-373"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959524000213/pdfft?md5=9f3fb4eed0214fddae565660753ed984&pid=1-s2.0-S2405959524000213-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139965479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-01DOI: 10.1016/j.icte.2023.11.007
Cosmas Ifeanyi Nwakanma, Goodness Oluchi Anyanwu, Love Allen Chijioke Ahakonye, Jae-Min Lee, Dong-Seong Kim
Nowadays, research works into the dynamic and static human activities on Smart spaces abounds. Artificial Intelligence (AI) and low cost non-privacy invasive ambient sensors have made this ubiquitous. This review presents a state-of-the-art analysis, performance evaluation, and future research direction. One of the aims of activity recognition (especially that of humans) systems using thermal sensors and AI is the safety of persons in Smart spaces. In a Smart home, human activity detection systems are put in place to ensure the safety of persons in such an environment. This system should have the ability to monitor issues like fall detection, a common home-related accident. In this work, a review of trends in thermal sensor deployment, an appraisal of the popular datasets, AI algorithms, testbeds, and critical challenges of the recent works was provided to direct the research focus. In addition, a summary of AI models and their performance under various sensor resolutions was presented.
{"title":"A review of thermal array sensor-based activity detection in smart spaces using AI","authors":"Cosmas Ifeanyi Nwakanma, Goodness Oluchi Anyanwu, Love Allen Chijioke Ahakonye, Jae-Min Lee, Dong-Seong Kim","doi":"10.1016/j.icte.2023.11.007","DOIUrl":"10.1016/j.icte.2023.11.007","url":null,"abstract":"<div><p>Nowadays, research works into the dynamic and static human activities on Smart spaces abounds. Artificial Intelligence (AI) and low cost non-privacy invasive ambient sensors have made this ubiquitous. This review presents a state-of-the-art analysis, performance evaluation, and future research direction. One of the aims of activity recognition (especially that of humans) systems using thermal sensors and AI is the safety of persons in Smart spaces. In a Smart home, human activity detection systems are put in place to ensure the safety of persons in such an environment. This system should have the ability to monitor issues like fall detection, a common home-related accident. In this work, a review of trends in thermal sensor deployment, an appraisal of the popular datasets, AI algorithms, testbeds, and critical challenges of the recent works was provided to direct the research focus. In addition, a summary of AI models and their performance under various sensor resolutions was presented.</p></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 2","pages":"Pages 256-269"},"PeriodicalIF":5.4,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2405959523001509/pdfft?md5=37960ef6490d2cd38759d29a65f86891&pid=1-s2.0-S2405959523001509-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139301149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}