Kelvin Anoh

Dr. Kelvin Anoh

Electrical and Electronic Engineering, University of Bolton, Bolton, UK
orcid

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
13 August 2019 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
Kelvin AnohKelvin Anoh
Kelvin Anoh
SMSabita Maharjan
Sabita Maharjan
AIAugustine Ikpehai
Augustine Ikpehai
YZYan Zhang
Yan Zhang
Bamidele AdebisiBamidele Adebisi
Bamidele Adebisi
Traditionally, energy consumers pay non-commodity charges (e.g. transmission, environmental and network costs) as a major component of their energy bills. With the distributed energy generation, enabling energy consumption close to producers can minimize such costs. The physically constrained energy prosumers in power networks can be logically grouped into virtual microgrids (VMGs) using communication systems. Prosumer benefits can be optimised by modelling the energy trading interactions among producers and consumers in a VMG as a Stackelberg game in which producers lead and consumers follow. Considering renewable (RES) and non-renewable energy (nRES) resources, and given that RES are unpredictable thus unschedulable, we also describe cost and utility models that include load uncertainty demands of producers. The results show that under Stackelberg equilibrium (SE), the costs incurred by a consumer for procuring either the RES or nRES are significantly reduced while the derived utility by producer is maximized. We further show that when the number of prosumers in the VMG increases, the CO2 emission cost and consequently the energy cost are minimized at the SE. Lastly, we evaluate the peer-to-peer (P2P) energy trading scenario involving noncooperative energy prosumers with and without Stackelberg game. The results show that the P2P energy prosumers attain 47% higher benefits with Stackelberg game.

28 November 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
AIAugustine Ikpehai
Augustine Ikpehai
Bamidele AdebisiBamidele Adebisi
Bamidele Adebisi
Khaled RabieKhaled Rabie
Khaled Rabie
Kelvin AnohKelvin Anoh
Kelvin Anoh
RARuth E. Ande
Ruth E. Ande
UMUche M. Mbanaso
Uche M. Mbanaso

24 April 2021 in Sensors
Verified
Journal Article
Open access
PDF file
SPSegun Popoola
Segun Popoola
Bamidele AdebisiBamidele Adebisi
Bamidele Adebisi
RARuth Ande
Ruth Ande
Mohammad HammoudehMohammad Hammoudeh
Mohammad Hammoudeh
Kelvin AnohKelvin Anoh
Kelvin Anoh
RARemi Atayero
Remi Atayero
Nowadays, hackers take illegal advantage of distributed resources in a network of computing devices (i.e., botnet) to launch cyberattacks against the Internet of Things (IoT). Recently, diverse Machine Learning (ML) and Deep Learning (DL) methods were proposed to detect botnet attacks in IoT networks. However, highly imbalanced network traffic data in the training set often degrade the classification performance of state-of-the-art ML and DL models, especially in classes with relatively few samples. In this paper, we propose an efficient DL-based botnet attack detection algorithm that can handle highly imbalanced network traffic data. Specifically, Synthetic Minority Oversampling Technique (SMOTE) generates additional minority samples to achieve class balance, while Deep Recurrent Neural Network (DRNN) learns hierarchical feature representations from the balanced network traffic data to perform discriminative classification. We develop DRNN and SMOTE-DRNN models with the Bot-IoT dataset, and the simulation results show that high-class imbalance in the training data adversely affects the precision, recall, F1 score, area under the receiver operating characteristic curve (AUC), geometric mean (GM) and Matthews correlation coefficient (MCC) of the DRNN model. On the other hand, the SMOTE-DRNN model achieved better classification performance with 99.50% precision, 99.75% recall, 99.62% F1 score, 99.87% AUC, 99.74% GM and 99.62% MCC. Additionally, the SMOTE-DRNN model outperformed state-of-the-art ML and DL models.

11 December 2017 in Energies
Verified
Journal Article
Open access
PDF file
OJOlamide Jogunola
Olamide Jogunola
AIAugustine Ikpehai
Augustine Ikpehai
Kelvin AnohKelvin Anoh
Kelvin Anoh
Bamidele AdebisiBamidele Adebisi
Bamidele Adebisi
Mohammad HammoudehMohammad Hammoudeh
Mohammad Hammoudeh
GHGeorgina Harris
Georgina Harris
Transaction-based energy (TE) management and control has become an increasingly relevant topic, attracting considerable attention from industry and the research community alike. As a result, new techniques are emerging for its development and actualization. This paper presents a comprehensive review of TE involving peer-to-peer (P2P) energy trading and also covering the concept, enabling technologies, frameworks, active research efforts and the prospects of TE. The formulation of a common approach for TE management modelling is challenging given the diversity of circumstances of prosumers in terms of capacity, profiles and objectives. This has resulted in divergent opinions in the literature. The idea of this paper is therefore to explore these viewpoints and provide some perspectives on this burgeoning topic on P2P TE systems. This study identified that most of the techniques in the literature exclusively formulate energy trade problems as a game, an optimization problem or a variational inequality problem. It was also observed that none of the existing works has considered a unified messaging framework. This is a potential area for further investigation.

2 June 2017 in IEEE Access
Verified
Journal Article
Open access
Kelvin AnohKelvin Anoh
Kelvin Anoh
CTCagri Tanriover
Cagri Tanriover
Bamidele AdebisiBamidele Adebisi
Bamidele Adebisi
Orthogonal frequency division multiplexing (OFDM) offers spectral efficiency advantage, however, it is limited by peak-to-average power (PAPR) problem. The PAPR can be reduced using iterative clipping and filtering (ICF) scheme but requires that the same signals are iteratively clipped with a fixed clipping threshold at different clipping iterations. This method warrants that fast-Fourier transform (FFT)/inverse FFT (IFFT) blocks must be driven in the order of iterations many times to attain a desired PAPR threshold which expends the system power and expands the processing time. Using a second order cone program, the number of iterations required to attain the desired PAPR threshold was reduced. This optimized ICF (OICF) was later simplified using Lagrange multiplier (LM). In this paper, we apply an adaptive clipping threshold to the LM scheme to improve the performance of the simplified OICF (SOICF). Our results show significant reduction of the PAPR problem compared with the earlier SOICF scheme albeit with some degradation in the bit error ratio (BER) performance that can be under 1.0 dB depending on the chosen clipping threshold. In addition, we also illustrate the results of the performances and the theoretical relationships between the error vector magnitude (EVM) and PAPR, between clipping ratio (CR) and EVM, and lastly the inter-dependencies of EVM, PAPR, the number of OFDM subcarriers, and the CR.

29 December 2017 in Energies
Verified
Journal Article
Open access
PDF file
OJOlamide Jogunola
Olamide Jogunola
AIAugustine Ikpehai
Augustine Ikpehai
Kelvin AnohKelvin Anoh
Kelvin Anoh
Bamidele AdebisiBamidele Adebisi
Bamidele Adebisi
Mohammad HammoudehMohammad Hammoudeh
Mohammad Hammoudeh
GHGeorgina Harris
Georgina Harris
Rising awareness and emergence of smart technologies have inspired new thinking in energy system management. Whilst integration of distributed energy resources in micro-grids (MGs) has become the technique of choice for consumers to generate their energy, it also provides a unique opportunity to explore energy trading and sharing amongst them. This paper investigates peer-to-peer (P2P) communication architectures for prosumers’ energy trading and sharing. The performances of common P2P protocols are evaluated under the stringent communication requirements of energy networks defined in IEEE 1547.3-2007. Simulation results show that the structured P2P protocol exhibits a reliability of 99.997% in peer discovery and message delivery whilst the unstructured P2P protocol yields 98%, both of which are consistent with the requirements of MG applications. These two architectures exhibit high scalability with a latency of 0.5 s at a relatively low bandwidth consumption, thus, showing promising potential in their adoption for prosumer to prosumer communication.