Abul Kalam Azad
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
Abul Kalam Azad has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- A. F. M. Shahen Shah
Department of Electronics and Communication Engineering, Yildiz Technical University, Istanbul, Trkiye
1 shared publication - Farjana Akter
Division of Infectious Diseases and Division of Computer-Aided Drug Design, The Red-Green Research Centre, BICCB, 16 Tejkunipara, Tejgaon, Dhaka, 1215, Bangladesh
1 shared publication - John Ekoru
Academic Development Unit (ADU), Faculty of Engineering and the Built Environment, University of the Witwatersrand, Johannesburg, South Africa
1 shared publication - Milka C. I. Madahana
University of the Witwatersrand
1 shared publication - Mohammed Anis Oukebdane
Department of Electronics and Communication Engineering, Yildiz Technical University, İstanbul, Turkey
1 shared publication - Sultana Jahan Soheli
Department of Information and Communication Engineering, Noakhali Science and Technology University, Noakhali, Bangladesh
1 shared publication
Latest Publications
- Open Access
- 21 July 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Mobile and Wireless Intelligence
- Vol. 1 (1) , 1-10
A 2-Step Nearest Neighbor Approach to TSP for Mobile Data Collection Route Optimization in IoT
The Traveling Salesman Problem (TSP) is a well-known NP-hard problem that aims to find the optimal tour among cities, visiting each exactly once and returning to the origin. Over the years, many researchers have proposed various approaches to find near-optimal solutions for TSP. This paper proposed a variant of the nearest neighbor algorithm termed the 2-step nearest neighbor algorithm. Unlike the original nearest neighbor approach, this algorithm considers two nearest nodes as potential next nodes. For each of those nearest nodes, the two nearest nodes have been considered. The sub-tour with the minimum cost among the resulting four has added to the final tour. This process continues until all nodes are covered. The performance of the proposed algorithm compared with that of existing brute-force, nearest-neighbor, and genetic algorithms. The proposed algorithm's utility extends from classical TSP instances to route planning for mobile data collectors in Internet of things (IoT) environments. In such scenarios, a mobile collector visits distributed IoT sensor nodes to gather data and return to its base station, minimizing total travel costs and making the problem analogous to TSP. Result analysis shows that in most scenarios, the proposed approach yields a shorter distance tour than the existing nearest neighbor approach, though with slightly increased computational time. The approach could also be adapted based on the number of nodes, the optimal solution requirement, and available computational resources. The code is available at https://github.com/azad-nstu/CS570-Proj-1-Traveling-Salesman-Problem-TSP.
- 21 July 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Transactions on Mobile and Wireless Intelligence
- Vol. 1 (1) , 1-10
Open AccessA 2-Step Nearest Neighbor Approach to TSP for Mobile Data Collection Route Optimization in IoT
The Traveling Salesman Problem (TSP) is a well-known NP-hard problem that aims to find the optimal tour among cities, visiting each exactly once and returning to the origin. Over the years, many researchers have proposed various approaches to find near-optimal solutions for TSP. This paper proposed a variant of the nearest neighbor algorithm termed the 2-step nearest neighbor algorithm. Unlike the original nearest neighbor approach, this algorithm considers two nearest nodes as potential next nodes. For each of those nearest nodes, the two nearest nodes have been considered. The sub-tour with the minimum cost among the resulting four has added to the final tour. This process continues until all nodes are covered. The performance of the proposed algorithm compared with that of existing brute-force, nearest-neighbor, and genetic algorithms. The proposed algorithm's utility extends from classical TSP instances to route planning for mobile data collectors in Internet of things (IoT) environments. In such scenarios, a mobile collector visits distributed IoT sensor nodes to gather data and return to its base station, minimizing total travel costs and making the problem analogous to TSP. Result analysis shows that in most scenarios, the proposed approach yields a shorter distance tour than the existing nearest neighbor approach, though with slightly increased computational time. The approach could also be adapted based on the number of nodes, the optimal solution requirement, and available computational resources. The code is available at https://github.com/azad-nstu/CS570-Proj-1-Traveling-Salesman-Problem-TSP.
- Open Access
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 114934-114958
Unraveling the Nexus of ML and 6G: Challenges, Opportunities, and Future Directions
Machine learning (ML) and sixth-generation (6G) wireless networks together present a revolutionary paradigm ready to meet hitherto unheard-of needs in connection, scalability, and intelligence. Including physical-layer signal processing, edge computing, resource optimisation, network slicing, and security, this study provides a thorough and cross-layer study of ML integration into 6G systems. Unlike previous works that concentrate on isolated use cases, this paper systematically classifies and evaluates developing techniques such as federated learning (FL), quantum machine learning (QML), swarm intelligence, and explainable AI within the framework of key 6G performance indicators including ultra-low latency, energy efficiency, and privacy. Presenting a thorough taxonomy and comparative benchmarking, we show the operational trade-offs of centralised, distributed, and meta-learning models. We also find important difficulties like model heterogeneity across ultra-dense networks, adversarial vulnerability in FL, and reconfigurable intelligent surfaces (RIS)-assisted privacy risks. Moreover, we describe open research areas and suggest a single orchestration design to support intelligent, scalable, and reliable 6G systems. Researchers and professionals aiming to create strong, ML-driven wireless infrastructures beyond 5G find basic reference in this work.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 114934-114958
Open AccessUnraveling the Nexus of ML and 6G: Challenges, Opportunities, and Future Directions
Machine learning (ML) and sixth-generation (6G) wireless networks together present a revolutionary paradigm ready to meet hitherto unheard-of needs in connection, scalability, and intelligence. Including physical-layer signal processing, edge computing, resource optimisation, network slicing, and security, this study provides a thorough and cross-layer study of ML integration into 6G systems. Unlike previous works that concentrate on isolated use cases, this paper systematically classifies and evaluates developing techniques such as federated learning (FL), quantum machine learning (QML), swarm intelligence, and explainable AI within the framework of key 6G performance indicators including ultra-low latency, energy efficiency, and privacy. Presenting a thorough taxonomy and comparative benchmarking, we show the operational trade-offs of centralised, distributed, and meta-learning models. We also find important difficulties like model heterogeneity across ultra-dense networks, adversarial vulnerability in FL, and reconfigurable intelligent surfaces (RIS)-assisted privacy risks. Moreover, we describe open research areas and suggest a single orchestration design to support intelligent, scalable, and reliable 6G systems. Researchers and professionals aiming to create strong, ML-driven wireless infrastructures beyond 5G find basic reference in this work.
- Open Access
- 31 August 2020
- Published by Academy and Industry Research Collaboration Center (AIRCC) in International Journal of Managing Information Technology
- Vol. 12 (3) , 25-42
Analyzing the Opportunities of Digital Marketing in Bangladesh to Provide an Efficient Interrelation between Business Organization and Consumer
- 31 August 2020
- Published by Academy and Industry Research Collaboration Center (AIRCC) in International Journal of Managing Information Technology
- Vol. 12 (3) , 25-42
Open AccessAnalyzing the Opportunities of Digital Marketing in Bangladesh to Provide an Efficient Interrelation between Business Organization and Consumer