The deployment of deep learning models on resource-constrained embedded platforms presents significant challenges due to limited computational power, memory, and energy efficiency. To address this issue, this study proposes a novel quantization method tailored to accelerate object detection using a quantized version of the YOLOv5m model, called Q_YOLOv5m. This method reduces the model's computational complexity and memory footprint, allowing for faster inference and lower power consumption, making it ideal for real-time applications on embedded systems. This approach incorporates advanced weight and activation quantization techniques to balance performance with accuracy, dynamically adjusting precision based on hardware capabilities. The efficacy of Q_YOLOv5m was confirmed, exhibiting substantial enhancements in inference speed and a reduction in model size with negligible loss in object detection accuracy. The findings underscore the capability of Q_YOLOv5m for edge applications, including autonomous vehicles, intelligent surveillance, and IoT-based monitoring systems.
20 June 2025 in International Journal of Innovative Research and Scientific Studies
The rapid adoption of the Internet of Things (IoT) presents significant challenges to digital forensics, particularly in securing evidence acquisition and detecting intrusions. Traditional forensic methods struggle with the decentralized and heterogeneous nature of IoT environments, resulting in gaps in forensic investigations. This study presents the Forensic-Based (FB) Framework, an intelligent solution for secure evidence acquisition and autonomous intrusion detection in IoT environments. Designed with smartwatch-controlled automation and lightweight forensic logging, the framework utilizes a Python-based simulation and machine learning algorithms, including LSTM, to enable real-time anomaly detection and log analysis. The results demonstrate a 92% detection accuracy, a 350 ms response time, and superior performance compared to existing models. The framework ensures data integrity through hashing mechanisms and supports scalable, low-latency forensic investigations across smart environments. It offers practical benefits for digital investigators and security practitioners working with resource-constrained IoT systems.
Edge computing is now widely used to support real-time and safety-critical IoT services. However, current edge schedulers usually optimize only performance, while security verification and trust assessment are handled as separate modules. This separation creates a practical risk: tasks may be assigned to lightly loaded but compromised edge nodes, or secure nodes may become overloaded, violating latency requirements. We propose EdgeGuard-AI, a unified trust-driven and load-aware scheduling framework inspired by zero-trust security principles for next-generation IoT edge networks. The framework jointly learns dynamic node trust and short-term workload patterns from distributed edge data and integrates both signals into scheduling decisions. Experimental results on a realistic IoT edge security dataset show a task success rate of 97.3 percent, average scheduling latency of 58.1 ms during stress periods, unsafe offloading below 2 percent, and trust discrimination AUC of 0.971.
As the scale and complexity of Internet of Things (IoT) deployments increase, maintaining resilience in resource-constrained mesh networks becomes a significant challenge. Frequent node failures due to battery depletion, environmental interference, or hardware degradation can disrupt data flows and lead to operational downtime. To address this, we propose EdgeRescue, a novel lightweight AI-driven framework for self-healing in energy-constrained IoT mesh environments. EdgeRescue enables each node to perform local anomaly detection using compact 1D Convolutional Neural Networks (1D-CNNs) and initiates distributed, energy-aware routing reconfiguration when faults are detected. Unlike cloud-dependent methods, EdgeRescue operates entirely at the edge, requiring minimal computation, memory, and communication overhead. Extensive simulations on a 100-node testbed demonstrate that EdgeRescue improves packet delivery by 13.2%, reduces recovery latency by 57%, and lowers average node energy consumption by 18.8% compared to state-of-the-art baselines. These results establish EdgeRescue as a scalable and practical solution for achieving real-time resilience in next-generation IoT mesh networks.
IoT networks now handle traffic from billions of devices, and edge nodes are under constant pressure to classify that traffic and dispatch tasks within tight latency deadlines. Most existing systems treat classification and scheduling as two separate steps that run one after the other. This sequence adds unnecessary delay and breaks the feedback between the two tasks: the scheduler never sees the traffic type, and the classifier never sees the queue state. We propose ParallelEdge-AI, a system built around a shared flow encoder that feeds two task-specific heads in parallel, one for multi-class traffic classification and one for task-urgency scoring. Both heads are trained end-to-end using a joint loss that combines cross-entropy and pairwise ranking. A load-balance controller then reads the urgency scores alongside live queue lengths to decide, every 200 ms, whether a task stays local or moves to a less-loaded edge node. No global synchronisation is needed. We test the system on three real IoT datasets: RT-IoT2022, N-BaIoT, and CICIoT2023. ParallelEdge-AI reaches 97.63% accuracy and an F1-score of 97.34%, which is 3.16 percentage points above the best baseline. Inference latency is 19.62 ms per batch, the deadline-miss rate is 2.34%, and the load-imbalance index is 0.083, all three are the best results in our comparison. These numbers show that running classification and scheduling together on a shared representation is both faster and more accurate than treating them as separate problems.
The widening performance gap between processor speed and memory access latency has made data locality a critical bottleneck in high-performance computing. In Non-Uniform Memory Access (NUMA) and distributed memory systems, remote accesses incur penalties far greater than local operations, degrading the efficiency of scientific and data-intensive workloads. This paper introduces CacheAware, a compiler–runtime framework for data locality-aware scheduling. CacheAware leverages compiler analysis to annotate tasks with memory access footprints and combines this static information with runtime monitoring of cache miss patterns to guide scheduling and dynamic task migration. Unlike existing NUMA balancing or runtime tasking systems, CacheAware integrates both proactive and reactive strategies to minimize cache thrashing and remote memory fetches. Experimental evaluation on scientific benchmarks demonstrates reductions of up to 30% in cache misses and over 20% improvements in execution time compared to Linux AutoNUMA, NUMA-aware schedulers, and task-based runtimes. These results confirm that CacheAware provides a practical and scalable approach for enhancing data locality and accelerating workloads on modern distributed memory systems.