Olusola Tolulope Odeyomi

Dr. Olusola Tolulope Odeyomi

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 May 2023 in Discover Internet of Things
Verified
Journal Article
Open access
PDF file
MBMANSI Himanshu BHAVSAR
MANSI Himanshu BHAVSAR
Kaushik RoyKaushik Roy
Kaushik Roy
JKJohn Kelly
John Kelly
OOOlusola Tolulope Odeyomi
Olusola Tolulope Odeyomi
Internet-of-Things (IoT) connects various physical objects through the Internet and it has a wide application, such as in transportation, military, healthcare, agriculture, and many more. Those applications are increasingly popular because they address real-time problems. In contrast, the use of transmission and communication protocols has raised serious security concerns for IoT devices, and traditional methods such as signature and rule-based methods are inefficient for securing these devices. Hence, identifying network traffic behavior and mitigating cyber attacks are important in IoT to provide guaranteed network security. Therefore, we develop an Intrusion Detection System (IDS) based on a deep learning model called Pearson-Correlation Coefficient - Convolutional Neural Networks (PCC-CNN) to detect network anomalies. The PCC-CNN model combines the important features obtained from the linear-based extractions followed by the Convolutional Neural Network. It performs a binary classification for anomaly detection and also a multiclass classification for various types of attacks. The model is evaluated on three publicly available datasets: NSL-KDD, CICIDS-2017, and IOTID20. We first train and test five different (Logistic Regression, Linear Discriminant Analysis, K Nearest Neighbour, Classification and Regression Tree,& Support Vector Machine) PCC-based Machine Learning models to evaluate the model performance. We achieve the best similar accuracy from the KNN and CART model of 98%, 99%, and 98%, respectively, on the three datasets. On the other hand, we achieve a promising performance with a better detection accuracy of 99.89% and with a low misclassification rate of 0.001 with our proposed PCC-CNN model. The integrated model is promising, with a misclassification rate (or False alarm rate) of 0.02, 0.02, and 0.00 with Binary and Multiclass intrusion detection classifiers. Finally, we compare and discuss our PCC-CNN model in comparison to five traditional PCC-ML models. Our proposed Deep Learning (DL)-based IDS outperforms traditional methods.

13 November 2024 in Electronics
Verified
Journal Article
Open access
PDF file
Richard HoldbrookRichard Holdbrook
Richard Holdbrook
OOOlusola Tolulope Odeyomi
Olusola Tolulope Odeyomi
SYSun Yi
Sun Yi
Kaushik RoyKaushik Roy
Kaushik Roy
In the face of rapidly evolving cyber threats, network-based intrusion detection systems (NIDS) have become critical to the security of industrial and robotic systems. This survey explores the specialized requirements, advancements, and challenges unique to deploying NIDS within these environments, where traditional intrusion detection systems (IDS) often fall short. This paper discusses NIDS methodologies, including machine learning, deep learning, and hybrid systems, which aim to improve detection accuracy, adaptability, and real-time response. Additionally, this paper addresses the complexity of industrial settings, limitations in current datasets, and the cybersecurity needs of cyber–physical Systems (CPS) and Industrial Control Systems (ICS). The survey provides a comprehensive overview of modern approaches and their suitability for industrial applications by reviewing relevant datasets, emerging technologies, and sector-specific challenges. This underscores the importance of innovative solutions, such as federated learning, blockchain, and digital twins, to enhance the security and resilience of NIDS in safeguarding industrial and robotic systems.

19 October 2023 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
OOOlusola Tolulope Odeyomi
Olusola Tolulope Odeyomi
ETEarl Tankard
Earl Tankard
DRDanda Rawat
Danda Rawat
Federated learning is a privacy-preserving machine learning paradigm to protect the data of clients against privacy breaches. A lot of work on federated learning considers the cross-device setting where the number of clients is large and the data sample size of each client is low. However, this work focuses on cross-silo settings, where clients are few and have large sample sizes. We consider a fully decentralized setting where clients communicate with their immediate time-varying neighbors without the need for a central aggregator prone to congestion and a single point of failure. Our goal is to address stragglers’ delays in cross-silo settings. Existing algorithms designed to overcome stragglers’ delays work with fixed data distributions. They cannot work in real-time settings, such as wireless communication, characterized by time-varying data distributions. Therefore, this paper proposes two online learning algorithms that work with time-varying data and address stragglers’ delays while guaranteeing differential privacy, strong convergence, and communication efficiency. Using the mirror descent technique, the first proposed algorithm addresses the case where the loss gradient is easily computed while the second proposed algorithm addresses the case where the loss gradient is difficult to compute. Simulation results show the performance of the proposed algorithms.

3 July 2023 in IEEE Access
Verified
Journal Article
Open access
OOOlusola Tolulope Odeyomi
Olusola Tolulope Odeyomi
BUBassey Ude
Bassey Ude
KRKaushik Roy
Kaushik Roy
Meta-learning is a learning-to-learn paradigm that leverages past learning experiences for quick adaptation to new learning tasks. It has a wide application, such as in few-shot learning, reinforcement learning, neural architecture search, federated learning, etc. It has been extended to the online learning setting where task data distribution arrives sequentially. This provides continuous lifelong learning. However, in the online meta-learning setting, a single agent has to learn many varieties of related tasks. Yet, a single agent is limited to its local task data and must collaborate with neighboring agents to improve its learning performance. Therefore, online decentralized meta-learning algorithms are designed to allow an agent to collaborate with neighboring agents in order to improve learning performance. Despite their advantages, online decentralized meta-learning algorithms are susceptible to Byzantine attacks caused by the diffusion of poisonous information from unidentifiable Byzantine agents in the network. This is a serious problem where normal agents are unable to learn and convergence to the global meta-initializer is thwarted. State-of-the-art algorithms, such as BRIDGE, designed to provide robustness against Byzantine attacks are slow and cannot work in online learning settings. Therefore, we propose an online decentralized meta-learning algorithm that works with two Byzantine-resilient aggregation techniques, which are modified coordinate-wise screening and centerpoint aggregation. The proposed algorithm provides faster convergence speed and guarantees both resiliency and continuous lifelong learning. Our simulation results show that the proposed algorithm performs better than state-of-the-art algorithms.

18 January 2022 in IEEE Access
Verified
Journal Article
Open access
OOOlusola Tolulope Odeyomi
Olusola Tolulope Odeyomi
There has been an exponential growth over the years in the number of users connected to social networks. This has spurred research interest in social networks to ensure the privacy of users. From a theoretical standpoint, a social network is modeled as a directed graph network and interactions among agents in the directed graph network can be analyzed with non-Bayesian learning and online learning strategies. The goal of the agents is to learn the underlying time-varying true state of the network through repeated cooperative interaction among themselves. To overcome privacy challenges in social networks, recent research works include differential privacy in the social network analysis to guarantee the privacy of shared information among the agents. However, the common online learning strategy adopted in most existing work is the stochastic multi-armed bandit approach which assumes that the loss distribution is independent and identically distributed. This does not account for the arbitrariness of the time-varying true state in the social network. Therefore, this paper proposes a tougher but realistic setting that removes the restriction on the loss distribution. Two non-stochastic multi-armed bandit algorithms are proposed. The first algorithm uses the Laplace mechanism to guarantee differential privacy against a third-party intruder. The second algorithm uses the Laplace mechanism to guarantee differential privacy against both a third-party intruder and any spying agent in the network. The simulation results show that the agents’ beliefs converge to the most dominant true state among the sequence of arbitrarily time-varying true states over the time horizon. The speed of convergence comes as a trade-off with privacy. Regret bounds are obtained for the proposed algorithms and compared to the non-private algorithm in the literature.

28 July 2020 in IEEE Access
Verified
Journal Article
Open access
OOOlusola Tolulope Odeyomi
Olusola Tolulope Odeyomi
This paper explains how agents in a social network can learn the arbitrary time-varying true state of the network. This is practical in social networks where information is released and updated without any coordination. Most existing literature for learning the true state using the non-Bayesian learning approach, assumes that this true state is fixed, which is impractical. To address this problem, the social network is modeled as a graph network, and the time-varying true state is treated as a multi-armed bandit problem. The few works that have applied multi-armed bandit to a social network did not take into consideration the adversarial effects. Therefore, this paper proposes two non-stochastic multi-armed bandit algorithms that can handle the time-varying true state, even in the presence of an oblivious adversary. Regret bounds on the algorithms are obtained, and the simulation performance shows that all agents can converge to the most stable state. The sublinearity of the proposed algorithms is also compared with two well-known non-stochastic multi-armed bandit algorithms.