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


Hilal Hudan Nuha has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Pseudo Gradient Teaching Learning Based Optimization for Proactive SLA Prediction in 6G Networks

    by Hilal Hudan Nuha, Pratama Azmi Atmajaya, Gian Maxmillian Firdaus

    Proactive prediction of Service Level Agreement (SLA) satisfaction lets 6G radio access networks act before a link misses its throughput and latency targets. This paper proposes Pseudo Gradient Teaching Learning Based Optimization (PGTLBO), which adds to the teacher step the direction from the worse half to the better half of the ranked population, and uses it to train a multilayer perceptron. All trainers receive the same number of function evaluations, and a random direction control isolates the effect of the direction. On 6G SLA prediction for unseen clients, PGTLBO reaches 0.846 accuracy, tied with standard TLBO (0.844), and outperforms the genetic algorithm, particle swarm optimization, and Harris hawks optimization on all 20 splits. PGTLBO reaches a lower training loss than TLBO in 57 of 80 paired runs and its direction beats a random one, but test accuracy is limited by the data.

  • Open Access

    Reducing VR Delivery Latency in UAV-Enabled Mobile Edge Computing using PSO, GA, and Gradient-Based Approaches

    by Hilal Hudan Nuha, M. Faris Fathoni, Hassan Rizky Putra Sailellah

    Virtual reality (VR) services delivered through UAV-enabled mobile edge computing (MEC) require joint decisions on user association, caching, computing-resource allocation, and UAV placement. This study benchmarks three CVX-free placement solvers, namely Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and gradient-based L-BFGS-B, within the same alternating-optimization framework for N ∈ {15, 18, 21, 24, 27, 30} VR users served by M = 2 UAV base stations (UBSs). The channel rate follows the outage-constrained logistic approximation of an elevation-angle-dependent Rician fading model. To account for stochastic variability, the evaluation uses 30 independent Monte Carlo system realizations for every N , paired across solvers, and includes random and centroid placement baselines. The optimized maximum aggregate UBS task-completion latency increases from approximately 225 ms at N = 15 to 723 ms at N = 30. PSO and GA achieve numerically identical latency values, while L-BFGS-B yields comparable latency at each tested user load, differing by at most 0.714 ms in any paired comparison; after Holm correction, only the N = 15 difference is statistically significant and its median magnitude is only 0.054 ms. Relative to random placement, optimization reduces mean aggregate latency by approximately 21–33%, whereas the gain over centroid placement is modest (about 0.26–0.47%). L-BFGS-B has the lowest average runtime over all loads, although PSO is faster at several individual load levels, and GA is consistently the slowest. The reported objective is an aggregate task-level latency metric inherited from the reference UAV-MEC model and must not be interpreted as per-frame motion-to-photon latency

  • Open Access

    Ensemble Machine Learning Approach for Traffic Congestion and Travel Time Prediction in Urban Bus Rapid Transit Systems: A Case Study of Trans Metro Bandung

    by Rendy Munadi, Dadan Nur Ramadan, Sussi, Nurwulan Fitriyanti, Hilal H. Nuha

    Traffic congestion and travel time uncertainty remain major challenges to the operational efficiency of Bus Rapid Transit (BRT) systems in urban areas of developing countries. This study proposes an integrated solution for the Trans Metro Bandung (TMB) system by leveraging Internet of Things (IoT)–based GPS data and tree-based ensemble machine learning algorithms. Spatio-temporal data collected from on-board GPS modules are processed to predict traffic congestion levels and estimate travel time across route segments. The performance of Decision Tree, Random Forest, and XGBoost models is evaluated in terms of prediction accuracy, interpretability, and computational efficiency, with particular consideration for deployment on resource-constrained hardware. Experiments conducted on 20,156 data samples show that the Decision Tree model achieves the highest congestion classification accuracy of 96.8%, while Random Forest outperforms other models in travel time regression, achieving an R2 value of 0.95 and a root mean square error (RMSE) of 5.80 min. The trained models are successfully deployed on a Raspberry Pi 3B microcontroller for real-time inference, enabling fleet management and travel planning without reliance on cloud connectivity. The results demonstrate that cost-effective and interpretable machine learning solutions can deliver reliable performance in heterogeneous urban infrastructures while providing a replicable framework for medium-sized cities seeking to implement affordable smart transportation systems.


  • Open Access

    Round-Trip Time Estimation Using Enhanced Regularized Extreme Learning Machine

    by Hassan Rizky Putra Sailellah, Hilal Hudan Nuha, Aji Gautama Putrada

    Reliable Internet connectivity is essential for latency-sensitive services such as video conferencing, media streaming, and online gaming. Round-trip time (RTT) is a key indicator of network performance and is central to setting retransmission timeout (RTO); inaccurate RTT estimates may trigger unnecessary retransmissions or slow loss recovery. This paper proposes an Enhanced Regularized Extreme Learning Machine (RELM) for RTT estimation that improves generalization and efficiency by interleaving a bidirectional log-step heuristic to select the regularization constant C. Unlike manual tuning or fixed-range grid search, the proposed heuristic explores C on a logarithmic scale in both directions (×10 and /10) within a single loop and terminates using a tolerance–patience criterion, reducing redundant evaluations without requiring predefined bounds. A custom RTT dataset is generated using Mininet with a dumbbell topology under controlled delay injections (1–1000 ms), yielding 1000 supervised samples derived from 100,000 raw RTT measurements. Experiments follow a strict train/validation/test split (6:1:3) with training-only standardization/normalization and validation-only hyperparameter selection. On the controlled Mininet dataset, the best configuration (ReLU, 150 hidden neurons, C=102) achieves R2=0.9999, MAPE=0.0018, MAE=966.04, and RMSE=1589.64 on the test set, while maintaining millisecond-level runtime. Under the same evaluation pipeline, the proposed method demonstrates competitive performance compared to common regression baselines (SVR, GAM, Decision Tree, KNN, Random Forest, GBDT, and ELM), while maintaining lower computational overhead within the controlled simulation setting. To assess practical robustness, an additional evaluation on a public real-world WiFi RSS–RTT dataset shows near-meter accuracy in LOS and mixed LOS/NLOS scenarios, while performance degrades markedly under dominant NLOS conditions, reflecting physical-channel limitations rather than model instability. These results demonstrate the feasibility of the Enhanced RELM and motivate further validation on operational networks with packet loss, jitter, and path variability.

  • Open Access

    Enhanced Wireless Sensor Network Lifetime Using EGWO-Optimized Neural Network Approach

    by Mohamad Nurkamal Fauzan, Rendy Munadi, Sony Sumaryo, Hilal Hudan Nuha

    Efficient clustering is essential for reducing energy consumption and extending the operational lifetime of Wireless Sensor Networks. Classical protocols such as LEACH, PEGASIS, HEED, and EEHC frequently exhibit unbalanced energy usage, resulting in early node failures and reduced communication reliability. This study introduces an Enhanced Grey Wolf Optimization-based Neural Network (EGWO-NN) designed to adaptively select cluster heads by continuously optimizing decision parameters according to real-time network conditions. The proposed method is evaluated against four benchmark protocols using statistical comparisons of node survivability, transmission energy, and communication performance. Results show that EGWO-NN sustains significantly more alive nodes per round, with strong statistical differences compared with LEACH, PEGASIS, HEED, and EEHC (t = 18.27, 9.94, 18.91, 18.93; p < 10−22). Transmission energy analysis similarly indicates significant improvements across all pairwise tests (|t| = 4.12–46.34; p < 10−4), supported by an overall ANOVA result (F = 14.74, p = 1.42×10−10). EGWO-NN also enhances data delivery, outperforming baseline protocols in both packets sent and Packet Delivery Ratio, with highly significant differences (t = 17.62–19.75 and 11.25–22.89). These findings demonstrate that EGWO-NN provides a robust and scalable approach for improving energy efficiency and communication reliability in WSNs.


  • Open Access

    A Statistical Method and Deep Learning Models for Detecting Denial of Service Attacks in the Internet of Things (IoT) Environment

    by Ruuhwan, Rendy Munadi, Hilal Hudan Nuha, Erwin Budi Setiawan, Niken Dwi Wahyu Cahyani

    The flourishing of the Internet of Things (IoT) has not only improved our lives in smart homes and healthcare but also made us more susceptible to cyberattacks. Legacy intrusion detection systems are simply overwhelmed by the scale and diversity of IoT traffic, which is why there is a need for more intelligent forensic solutions. In this paper, we present a statistical technique, the Averaging Detection Method (ADM), for detecting attack traffic. Furthermore, the five deep learning models SimpleRNN, LSTM, GRU, BLSTM, and BGRU are compared for malicious traffic detection in IoT network forensics. A smart home dataset with a simulated DoS attack was used for performance analysis of accuracy, precision, recall, F1-score, and training time. The results indicate that all models achieve high accuracy, above 97%. BiGRU achieves the best performance, 99% accuracy, precision, recall, and F1-score, at the cost of high training time. GRU achieves perfect precision and recall (100%) with faster training, which can be considered for resource-constrained scenarios. SimpleRNN trains faster with comparable accuracy, while LSTMs and their bidirectional counterparts are better at capturing long-term dependencies but are computationally more expensive. In summary, deep learning, especially BiGRU and GRU, holds great promise for boosting IoT forensic investigation by enabling real-time DoS detection and reliable evidence collection. Meanwhile, the proposed ADM is simpler and more efficient at classifying DoS traffic than deep learning models.


  • Open Access

    Enhanced Grey Wolf Optimization for Efficient Transmission Power Optimization in Wireless Sensor Network

    by Mohamad Nurkamal Fauzan, Rendy Munadi, Sony Sumaryo, Hilal Hudan Nuha

    The Internet of Things (IoT) and Wireless Sensor Networks (WSNs) heavily rely on the lifetime of sensor nodes, which is inversely proportional to transmission power. Nodes with greater separation demand higher transmission power, while those closer together require less power. In practice, node placement varies significantly due to diverse terrain and contours, making power transmission configuration a critical and challenging issue in WSNs. This paper introduces an Enhanced Grey Wolf Optimization (EGWO) algorithm designed to optimize power transmission in WSN environments. Traditional Grey Wolf Optimization (GWO) employs a parameter that decreases linearly with iterations to regulate exploitation. In contrast, the proposed EGWO adopts a concave decline in the exploitation rate, allowing for more precise optimization in areas under exploration. The enhancement utilizes a cosine function that gradually decreases from 1 to 0, providing a smoother and more controlled transition. The experimental results demonstrate that EGWO outperforms other optimization algorithms. The proposed method achieves the lowest fitness value of −4.21, compared to 1.22 for standard GWO, −2.81 for PSO, and 2.86 for BESO, indicating its superiority in optimizing power transmission in WSNs.


  • Open Access

    Enhancing the Performance of Optimization Algorithms for Offloading Tasks in Mobile-Edge Computing Networks

    by Yohanes Armenian Putra, Hilal Hudan Nuha

    JCM is an open access journal on the science and engineering of communication.


  • Top Cited Papers
    Open Access

    Privacy-Preserving Tools and Technologies: Government Adoption and Challenges

    by Sidik Prabowo, Aji Gautama Putrada, Ikke Dian Oktaviani, Maman Abdurohman, Marijn Janssen, Hilal Hudan Nuha, Sarwono Sutikno

    Understanding the landscape of privacy protection in governmental systems is crucial for ensuring the trustworthiness of public services and safeguarding citizens’ sensitive data from breaches or misuse. Systematic mapping and synthesis of previous research can help identify existing privacy-preserving techniques, assess their effectiveness, and highlight areas for improvement, offering valuable insights for policymakers and practitioners. We aim to conduct a systematic literature review (SLR) of privacy-preserving tools and technologies, focusing on their adoption and governments’ challenges. This study also uncovers emerging trends and future research directions, contributing to developing more robust privacy strategies tailored to government needs.Given its extensive reach and government-centric methodology, this evaluation distinguishes itself from previous research. Our work methodically synthesizes privacy-preserving tools and technologies from the distinct perspective of government roles, in contrast to previous assessments that concentrate narrowly on certain technologies or areas. Our findings offer a synthesis of the government’s diverse roles in privacy preservation—regulator, enforcer, user, and service provider—and address existing concerns and key privacy-related technologies. Finally, we identify significant research opportunities, such as improving privacy-preserving mechanisms to strengthen the integrity of public services and mitigate the risks of data breaches and misuse.


  • Open Access

    K-Nearest Neighbors with Third-Order Distance for Flooding Attack Classification in Optical Burst Switching Networks

    by Hilal H. Nuha, Satria Akbar Mugitama, Ahmed Abo Absa, Sutiyo

    Optical burst switching (OBS) is a network architecture that combines the advantages of packet and circuit switching techniques. However, OBS networks are susceptible to cyber-attacks, such as flooding attacks, which can degrade their performance and security. This paper introduces a novel machine learning method for flooding attack detection in OBS networks, based on a third-order distance function for k-nearest neighbors (KNN3O). The proposed distance is expected to improve detection accuracy due to higher sensitivity with respect to the distance difference between two points. The developed method is compared with seven other machine learning methods, namely standard KNN, KNN with cosine distance (KNNC), multi-layer perceptron (MLP), naive Bayes classifier (NBC), support vector machine (SVM), decision tree (DT), and discriminant analysis classifier (DAC). The methods are further assessed using five metrics: accuracy, precision, recall, F1-score, and specificity. The proposed method achieved an accuracy of 99.3%, outperforming the original KNN, MLP, and SVM, which achieved accuracies of 99%, 76.4%, and 94.7%, respectively. The results show that KNN3O is the best method for flooding attack detection in OBS networks, as it achieves the highest scores in all five metrics.