Oluwatobi Akanbi

Dr. Oluwatobi Akanbi

University of Colorado Colorado Springs, Colorado Springs, Colorado, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 December 2013
Verified
Conference Paper
Closed access
AAAhmad Abunadi
Ahmad Abunadi
OAOluwatobi Akanbi
Oluwatobi Akanbi
AZAnazida Zainal
Anazida Zainal
In order to circumvent the adverse effect of fraudulent acts committed on the internet by adversaries, different researchers have proposed various solution to this problem. One of this online fraudulent act is website phishing. Website phishing is the act of luring unsuspecting online users into divulging private and confidential information which can be used by the phisher in fraud, blackmail or other ways to negatively affect the users involved. In this paper, we propose noble features to better improve the accuracy of machine learning algorithms in classifying phish. Furthermore, ranking of these new features according to their weighted values with existing features is carried out in order to show the potency of the new feature as compared with the current features. The experimental result of the research shows that the new features are highly potent and can be used to enhance the better performance of machine learning algorithm used for phishing detection.

2 August 2021 in Sensors
Verified
Journal Article
Open access
PDF file
AAAhmed Aljughaiman
Ahmed Aljughaiman
OAOluwatobi Akanbi
Oluwatobi Akanbi
UAUniversity Aljaedi
University Aljaedi
AAAdel Alharbi
Adel Alharbi
CCC. Edward Chow
C. Edward Chow
In a channel shared by several nodes, the scheduling algorithm is a key factor to avoiding collisions in the random access-based approach. Commonly, scheduling algorithms can be used to enhance network performance to meet certain requirements. Therefore, in this paper we propose a Delay-Aware Media Access Control (DAMAC) protocol for monitoring time-sensitive applications over multi-hop in Underwater Acoustic Sensor Networks (UASNs), which relies on the random access-based approach where each node uses Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) to determine channel status, switches nodes on and off to conserve energy, and allows concurrent transmissions to improve the underwater communication in the UASNs. In addition, DAMAC does not require any handshaking packets prior to data transmission, which helps to improve network performance in several metrics. The proposed protocol considers the long propagation delay to allow concurrent transmissions, meaning nodes are scheduled to transmit their data packets concurrently to exploit the long propagation delay between underwater nodes. The simulation results show that DAMAC protocol outperforms Aloha, BroadcastMAC, RMAC, Tu-MAC, and OPMAC protocols under varying network loads in terms of energy efficiency, communication overhead, and fairness of the network by up to 65%, 45%, and 726%, respectively.

5 November 2019 in IEEE Access
Verified
Journal Article
Open access
OAOluwatobi Akanbi
Oluwatobi Akanbi
AAAmer Aljaedi
Amer Aljaedi
XZXiaobo Zhou
Xiaobo Zhou
AAAdel R. Alharbi
Adel R. Alharbi
Recent studies have proposed different approaches to mitigate the risk of overload and failure in Software-Defined Networks (SDNs). Some of these approaches have proven effective but only in specific use cases, making it potentially difficult to generalize their application. Furthermore, network failure detection and recovery by the SDN control plane requires sophisticated software logic running on multiple controllers that are non-intrusive to the network environment. While this allows more flexibility to respond to failure events, it also implies that each controller application must include its recovery logic, which increases code complexity. In this paper, we propose a fast fail-over technique for solving the problem of a controller failure or target availability in the network. We argue that inter-domain controller synchronization can result in high network overhead and should be minimized to per-need base only. To this end, upon detecting a failure in the control plane, the proposed fast failure recovery technique leverages a load-shifting scheme to initialize alternate paths and proactively instantiate flow rules to reduce flow setup latency. To prevent packet loss during failure recovery, we utilize a forwarding information table that quickly replays inputs to the controller after failure recovery. Our extensive experiments show that the average latency incurred by the controller to controller communication is approximately twice that of per-need based synchronization. The experimental results also show that our proposed technique achieved a 50% reduction in service interruption period and 75% flow_mod reduction during a single link failure over the traditional SDN baseline approach.

1 January 2015
Verified
Book Chapter
Closed access
OAOluwatobi Akanbi
Oluwatobi Akanbi
IAIraj Sadegh Amiri
Iraj Sadegh Amiri
EFElahe Fazeldehkordi
Elahe Fazeldehkordi

1 January 2016
Verified
Book
Closed access
EFElahe Fazeldehkordi
Elahe Fazeldehkordi
IAIraj Sadegh Amiri
Iraj Sadegh Amiri
OAOluwatobi Akanbi
Oluwatobi Akanbi

21 August 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
ANAsim Nadeem
Asim Nadeem
AKAgha Kashif Khan
Agha Kashif Khan
SZSohail Zafar
Sohail Zafar
UAUniversity Aljaedi
University Aljaedi
OAOluwatobi Akanbi
Oluwatobi Akanbi
The symmetry of an interconnection network plays a key role in defining the functioning of a system involving multiprocessors where thousands of processor-memory pairs known as processing nodes are connected. Addressing the processing nodes helps to create efficient routing and broadcasting algorithms for the multiprocessor interconnection networks. Oxide interconnection networks are extracted from the silicate networks having applications in multiprocessor systems due to their symmetry, smaller diameter, connectivity and simplicity of structure, and a constant number of links per node with the increasing size of the network can avoid overloading of nodes. The fault tolerant partition basis assigns unique addresses to each processing node in terms of distances (hops) from the other subnets in the network which work in the presence of faults. In this manuscript, the partition and fault tolerant partition resolvability of oxide interconnection networks have been studied which include single oxide chain networks (SOXCN), rhombus oxide networks (RHOXN) and regular triangulene oxide networks (RTOXN). Further, an application of fault tolerant partition basis in case of region-based routing in the networks is included.