Cosmas Ifeanyi Nwakanma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Cosmas Ifeanyi Nwakanma has a total of 97 co-authors. Here are the top co-authors by number of shared publications:
- Dong-Seong Kim
Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi, South Korea
26 shared publications - Jae-Min Lee
Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi, South Korea
17 shared publications Dong-Seong Kim
11 shared publicationsJae-Min Lee
10 shared publications- Judith Nkechinyere Njoku
Department of IT Convergence Engineering, Kumoh National Institute of Technology, Gumi, South Korea
10 shared publications - Love Allen Chijioke Ahakonye
ICT-Convergence Research Center, Kumoh National Institute of Technology, Gumi, South Korea
7 shared publications
Latest Publications
- Open Access
Evaluation of an Efficient Ring-Based Total Order Protocol in a Fairness-Controlled Environment
Crash-tolerant systems rely on total order protocols to ensure consistent request execution across replicated servers. The Logical Clock and Ring (LCR) protocol employs a ring-based, leaderless design that provides a high throughput but suffers latency inefficiencies under a high message concurrency due to its use of vector clocks and a fixed last-process rule for ordering concurrent messages. This paper presents the Daisy Chain Total Order Protocol (DCTOP), an enhanced version of LCR that integrates Lamport logical clocks for message sequencing and introduces dynamic last-process identification based on sender activity to accelerate message stabilisation and delivery. A modified fairness-control mechanism further balances message distribution among processes. The simulation results show that the DCTOP achieves an over 40% latency reduction compared to LCR while maintaining the same fairness and throughput across various cluster configurations.
Open AccessEvaluation of an Efficient Ring-Based Total Order Protocol in a Fairness-Controlled Environment
Crash-tolerant systems rely on total order protocols to ensure consistent request execution across replicated servers. The Logical Clock and Ring (LCR) protocol employs a ring-based, leaderless design that provides a high throughput but suffers latency inefficiencies under a high message concurrency due to its use of vector clocks and a fixed last-process rule for ordering concurrent messages. This paper presents the Daisy Chain Total Order Protocol (DCTOP), an enhanced version of LCR that integrates Lamport logical clocks for message sequencing and introduces dynamic last-process identification based on sender activity to accelerate message stabilisation and delivery. A modified fairness-control mechanism further balances message distribution among processes. The simulation results show that the DCTOP achieves an over 40% latency reduction compared to LCR while maintaining the same fairness and throughput across various cluster configurations.
- Open Access
- 15 October 2025
- Published by Elsevier in High-Confidence Computing
- Vol. 6 (1)
Digital twin and metaverse-enhanced battery management for electric vehicles
- 15 October 2025
- Published by Elsevier in High-Confidence Computing
- Vol. 6 (1)
Open AccessDigital twin and metaverse-enhanced battery management for electric vehicles
- Open Access
- 1 October 2025
- Published by Elsevier in High-Confidence Computing
- Vol. 6 (2)
PureChain-enhanced federated learning for dynamic fault tolerance and attack detection in distributed systems
- 1 October 2025
- Published by Elsevier in High-Confidence Computing
- Vol. 6 (2)
Open AccessPureChain-enhanced federated learning for dynamic fault tolerance and attack detection in distributed systems
- Open Access
- 4 September 2025
- Published by MDPI AG in Preprints.org
Evaluation of an Efficient Ring-Based Total Order Protocol in a Fairness-Controlled Environment
Server replication ensures crash tolerance by enforcing a total order of input requests across multiple servers. The Logical Clock and Ring (LCR) protocol, a ring-based lead-erless total order protocol, achieves high throughput by arranging processes in a logical ring with unidirectional message flow. However, LCR design assumption may not produce optimal latency under high message concurrency due to its use of vector clocks as vector timestamps for sequencing messages and a fixed "last" process for ordering concurrent messages. To improve latency, we propose using Lamport's logical clock as a message timestamp for sequencing messages and redefining the "last" process as the nearest process in the opposite direction of message flow, ensuring a unique last process for each message sender. Fairness is preserved using a modified fairness control algo-rithm from the Fixed Sequencer and Ring (FSR) protocol. Our evaluation shows that the proposed protocol offers latency improvement better than LCR across all considered configurations. Additionally, fairness among process replicas was maintained, evi-denced by an even distribution of message sending responsibilities, with each process contributing approximately equally to total message output.
- 4 September 2025
- Published by MDPI AG in Preprints.org
Open AccessEvaluation of an Efficient Ring-Based Total Order Protocol in a Fairness-Controlled Environment
Server replication ensures crash tolerance by enforcing a total order of input requests across multiple servers. The Logical Clock and Ring (LCR) protocol, a ring-based lead-erless total order protocol, achieves high throughput by arranging processes in a logical ring with unidirectional message flow. However, LCR design assumption may not produce optimal latency under high message concurrency due to its use of vector clocks as vector timestamps for sequencing messages and a fixed "last" process for ordering concurrent messages. To improve latency, we propose using Lamport's logical clock as a message timestamp for sequencing messages and redefining the "last" process as the nearest process in the opposite direction of message flow, ensuring a unique last process for each message sender. Fairness is preserved using a modified fairness control algo-rithm from the Fixed Sequencer and Ring (FSR) protocol. Our evaluation shows that the proposed protocol offers latency improvement better than LCR across all considered configurations. Additionally, fairness among process replicas was maintained, evi-denced by an even distribution of message sending responsibilities, with each process contributing approximately equally to total message output.
- 24 June 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (6) , 1-24
Systematic investigation of privacy preservation techniques for industrial IoT-enabled critical edge network Infrastructure
- 24 June 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (6) , 1-24
Systematic investigation of privacy preservation techniques for industrial IoT-enabled critical edge network Infrastructure
- Open Access
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (16) , 32469-32492
MetaWatch: Trends, Challenges, and Future of Network Intrusion Detection in the Metaverse
As the Metaverse progresses, its security measures must evolve to safeguard users from cyberattacks. To this end, Artificial Intelligence (AI)-powered Network Intrusion Detection Systems (NIDSs) have been implemented at the network layer to detect and respond to threats in real-time. Our survey -MetaWatch provides a comprehensive overview and analysis of relevant literature, focusing on studies that have explored NIDSs in the Metaverse. Unlike other surveys that have addressed Metaverse security issues more broadly, MetaWatch specifically provides a taxonomy of detection paradigms and defense mechanisms within Metaverse NIDS from 2021 to 2024. Additionally, MetaWatch identifies and discusses the key challenges and problems that impact the development of trustworthy, explainable, scalable, and robust Metaverse NIDS. Overall, the survey provides readers with a concise and informative summary of NIDS issues in the Metaverse and highlights open security problems worth exploring.
- 9 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (16) , 32469-32492
Open AccessMetaWatch: Trends, Challenges, and Future of Network Intrusion Detection in the Metaverse
As the Metaverse progresses, its security measures must evolve to safeguard users from cyberattacks. To this end, Artificial Intelligence (AI)-powered Network Intrusion Detection Systems (NIDSs) have been implemented at the network layer to detect and respond to threats in real-time. Our survey -MetaWatch provides a comprehensive overview and analysis of relevant literature, focusing on studies that have explored NIDSs in the Metaverse. Unlike other surveys that have addressed Metaverse security issues more broadly, MetaWatch specifically provides a taxonomy of detection paradigms and defense mechanisms within Metaverse NIDS from 2021 to 2024. Additionally, MetaWatch identifies and discusses the key challenges and problems that impact the development of trustworthy, explainable, scalable, and robust Metaverse NIDS. Overall, the survey provides readers with a concise and informative summary of NIDS issues in the Metaverse and highlights open security problems worth exploring.
- 29 April 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (5) , 1-19
A secure federated learning privacy method for industrial IoT edge networks
- 29 April 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (5) , 1-19
A secure federated learning privacy method for industrial IoT edge networks