NASIRU MUHAMMAD DANKOLO

Mr. NASIRU MUHAMMAD DANKOLO


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
21 April 2022 in Neural Computing and Applications
Verified
Journal Article
Open access
PDF file
DGDanlami Gabi
Danlami Gabi
NDNASIRU MUHAMMAD DANKOLO
NASIRU MUHAMMAD DANKOLO
AMAbubakar Atiku Muslim
Abubakar Atiku Muslim
Ajith AbrahamAjith Abraham
Ajith Abraham
MJMuhammad Usman Joda
Muhammad Usman Joda
ZZZalmiyah Zakaria
Zalmiyah Zakaria
Achieving sustainable profit advantage, cost reduction and resource utilization are always a bottleneck for resource providers, especially when trying to meet the computing needs of resource hungry applications in mobile edge-cloud (MEC) continuum. Recent research uses metaheuristic techniques to allocate resources to large-scale applications in MECs. However, some challenges attributed to the metaheuristic techniques include entrapment at the local optima caused by premature convergence and imbalance between the local and global searches. These may affect resource allocation in MECs if continually implemented. To address these concerns and ensure efficient resource allocation in MECs, we propose a fruit fly-based simulated annealing optimization scheme (FSAOS) to serve as a potential solution. In the proposed scheme, the simulated annealing is incorporated to balance between the global and local search and to overcome its premature convergence. We also introduce a trade-off factor to allow application owners to select the best service quality that will minimize their execution cost. Implementation of the FSAOS is carried out on EdgeCloudSim Simulator tool. Simulation results show that the FSAOS can schedule resources effectively based on tasks requirement by returning minimum makespan and execution costs, and achieve better resource utilization compared to the conventional fruit fly optimization algorithm and particle swarm optimization. To further unveil how efficient the FSAOSs, a statistical analysis based on 95% confidential interval is carried out. Numerical results show that FSAOS outperforms the benchmark schemes by achieving higher confidence level. This is an indication that the proposed FSAOS can provide efficient resource allocation in MECs while meeting customers’ aspirations as well as that of the resource providers.

25 April 2025 in Scientific Reports
Verified
Journal Article
Open access
PDF file
NDNASIRU MUHAMMAD DANKOLO
NASIRU MUHAMMAD DANKOLO
NRNor Haizan Mohamed Radzi
Nor Haizan Mohamed Radzi
NMNoorfa Haszlinna Mustaffa
Noorfa Haszlinna Mustaffa
NANoreen Izza Arshad
Noreen Izza Arshad
MNMaged Nasser
Maged Nasser
MYMuhammed Nura Yusuf
Muhammed Nura Yusuf
The rise of Internet of Things (IoT) applications has heightened the need for efficient resource allocation across the edge-cloud continuum, combining low-latency edge nodes with high powered cloud servers. Optimizing this resource allocation is challenging, especially when balancing cost and task completion time (makespan). Traditional algorithms often fall short in these dynamic environments, leading to suboptimal solutions. This paper introduces a hybrid Flower Pollination Algorithm and Tabu Search (FPA–TS) algorithm to address IoT-specific requirements for multi objective optimization. The enhanced FPA incorporates adaptive probability based on solution diversity and dynamic levy flight control for effective global search, while Tabu Search contributes memory guided local refinement to further minimize makespan and costs. Extensive simulations with IoT scenarios show that the hybrid FPA–TS outperforms existing algorithms, offering a robust approach to optimizing resource allocation for IoT-driven applications in the edge-cloud continuum.

22 November 2017 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
PDF file
NDNASIRU MUHAMMAD DANKOLO
NASIRU MUHAMMAD DANKOLO
NRNor Haizan Mohamed Radzi
Nor Haizan Mohamed Radzi
RSRoselina Sallehuddin
Roselina Sallehuddin
NMNoorfa Haszlinna Mustaffa
Noorfa Haszlinna Mustaffa
Microarray systems enable experts to examine gene profile at molecular level using machine learning algorithms. It increases the potentials of classification and diagnosis of many diseases at gene expression level. Though, numerous difficulties may affect the efficiency of machine learning algorithms which includes vast number of genes features comprised in the original data. Many of these features may be unrelated to the intended analysis. Therefore, feature selection is necessary to be performed in the data pre-processing. Many feature selection algorithms are developed and applied on microarray which including the metaheuristic optimization algorithms. This paper discusses the application of the metaheuristics algorithms for feature selection in microarray dataset. This study reveals that, the algorithms have yield an interesting result with limited resources thereby saving computational expenses of machine learning algorithms.

4 November 2024 in IEEE Access
Verified
Journal Article
Open access
NDNASIRU MUHAMMAD DANKOLO
NASIRU MUHAMMAD DANKOLO
NRNor Haizan Mohamed Radzi
Nor Haizan Mohamed Radzi
NMNoorfa Haszlinna Mustaffa
Noorfa Haszlinna Mustaffa
NONurul Aida Osman
Nurul Aida Osman
DGDanlami Gabi
Danlami Gabi
NYNura Yusuf
Nura Yusuf
The edge-cloud continuum integrates edge computing and cloud computing to optimize resource use and improve performance by bringing computation closer to data sources while leveraging vast cloud resources. Efficient resource allocation within this continuum is crucial for optimizing performance and minimizing delays. This paper proposes a novel approach to resource allocation using a modified Flower Pollination Algorithm (FPA). By incorporating dynamic switch probability, inertia weight for Levy flight balancing, and enhancing the initial solution using a chaotic map, the modified FPA enhances exploration and exploitation capabilities. Additionally, a network model is introduced to monitor network performance metrics, and a task dependency model ensures tasks are executed based on their dependencies. Experimental results demonstrate that the proposed approach significantly reduces delay and improves resource utilization compared to existing methods. This work provides a comprehensive framework for addressing the challenges.

8 March 2025 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
NDNASIRU MUHAMMAD DANKOLO
NASIRU MUHAMMAD DANKOLO
NRNor Haizan Mohamed Radzi
Nor Haizan Mohamed Radzi
NMNoorfa Haszlinna Mustaffa
Noorfa Haszlinna Mustaffa
DGDanlami Gabi
Danlami Gabi

25 February 2024 in Baghdad Science Journal
Verified
Journal Article
Open access
PDF file
NDNASIRU MUHAMMAD DANKOLO
NASIRU MUHAMMAD DANKOLO
NRNor Haizan Mohamed Radzi
Nor Haizan Mohamed Radzi
NMNoorfa Haszlinna Mustaffa
Noorfa Haszlinna Mustaffa
MTMohd Shukor Talib
Mohd Shukor Talib
ZYZuraihati Mohd Yunos
Zuraihati Mohd Yunos
DGDanlami Gabi
Danlami Gabi
The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. Existing research used metaheuristic algorithm to solve tak scheduling problem, however, must of the existing metaheuristics used suffers from falling into local mina due to their inefficiency to avoid unfeasible region in the solution search space. Therefore, there is a dire need for an efficient metaheuristic algorithm for task scheduling. This study proposed an FPA-ISFLA task scheduling model using hybrid flower pollination and improved shuffled frog leaping algorithms. The simulation results indicate that the FPA-ISFLA algorithm is superior to the PSO algorithm in terms of makespan time, resource utilization, and execution cost reduction, especially with an increasing number of tasks.