The current thinking concerning computations required by Internet of Things (IoT) applications is shifting toward fog computing instead of cloud computing, thereby achieving most of the required computations at the network edge of the IoT devices. Fog computing can thus improve the quality of service of delay-sensitive applications by allowing such applications to take advantage of the low latency provided by fog computing rather than the high latency of the cloud. Therefore, tasks in various IoT applications must be effectively distributed over the fog nodes to improve the quality of service, specifically the task response time. In this paper, two nature-inspired meta-heuristic schedulers, namely ant colony optimization (ACO) and particle swarm optimization (PSO), are used to propose two different scheduling algorithms to effectively load balance IoT tasks over the fog nodes under communication cost and response time considerations. The experimental results of the proposed algorithms are compared with those of the round robin (RR) algorithm. The evaluations show that the proposed ACO-based scheduler achieves an improvement in the response times of IoT applications compared to the proposed PSO-based and RR algorithms and effectively load balances the fog nodes.
Brain diseases are mainly caused by abnormal growth of brain cells that may damage the brain structure, and eventually will lead to malignant brain cancer. An early diagnosis to enable decisive treatment using a Computer-Aided Diagnosis (CAD) system has major challenges, especially accurate detection of different diseases in the magnetic resonance imaging (MRI) images. In this paper, a new Deep Convolutional Neural Network (DCNN) architecture is proposed for effective diagnosis of glioma, meningioma and pituitary. The architecture uses batch normalization for fast training with a higher learning rate and ease initialization of the layer weights. The proposed architecture is a computationally lightweight model with a small number of convolutional, max-pooling layers and training iterations. A demonstrative comparison between the proposed architecture and other discussed models in this paper is conducted. An outstanding competitive accuracy is achieved of 97.72% overall, 99% in detecting glioma, 98.26% in detecting meningioma, 95.95% in detecting pituitary and 97.14% in detecting normal images when tested on a dataset with 3394 MRI images. Experimental results prove the robustness of the proposed architecture which has increased the detection accuracy of a variety of brain diseases in a short time.
Unlike a traditional virtual machine (VM), a container is an emerging lightweight virtualization technology that operates at the operating system level to encapsulate a task and its library dependencies for execution. The Container as a Service (CaaS) strategy is gaining in popularity and is likely to become a prominent type of cloud service model. Placing container instances on virtual machine instances is a classical scheduling problem. Previous research has focused separately on either virtual machine placement on physical machines (PMs) or container, or only tasks without containerization, placement on virtual machines. However, this approach leads to underutilized or overutilized PMs as well as underutilized or overutilized VMs. Thus, there is a growing research interest in developing a container placement algorithm that considers the utilization of both instantiated VMs and used PMs simultaneously. The goal of this study is to improve resource utilization, in terms of number of CPU cores and memory size for both VMs and PMs, and to minimize the number of instantiated VMs and active PMs in a cloud environment. The proposed placement architecture employs scheduling heuristics, namely, Best Fit (BF) and Max Fit (MF), based on a fitness function that simultaneously evaluates the remaining resource waste of both PMs and VMs. In addition, another meta-heuristic placement algorithm is proposed that uses Ant Colony Optimization based on Best Fit (ACO-BF) with the proposed fitness function. Experimental results show that the proposed ACO-BF placement algorithm outperforms the BF and MF heuristics and maintains significant improvement of the resource utilization of both VMs and PMs.
Internet of Things (IoT) tasks are offloaded to servers located at the edge network for improving the power consumption of IoT devices and the execution times of tasks. However, deploying edge servers could be difficult or even impossible in hostile terrain or emergency areas where the network is down. Therefore, edge servers are mounted on unmanned aerial vehicles (UAVs) to support task offloading in such scenarios. However, the challenge is that the UAV has limited energy, and IoT tasks are delay-sensitive. In this paper, a UAV-based offloading strategy is proposed where first, the IoT devices are dynamically clustered considering the limited energy of UAVs, and task delays, and second, the UAV hovers over each cluster head to process the offloaded tasks. The optimization problem of dynamically determining the optimal number of clusters, specifying the member tasks of each cluster, is modeled as a mixed-integer, nonlinear constraint optimization. A discrete differential evolution (DDE) algorithm with new mutation and crossover operators is proposed for the formulated optimization problem, and compared with the particle swarm optimization (PSO) and genetic algorithm (GA) meta-heuristics. Further, the ant colony optimization (ACO) algorithm is employed to identify the shortest path over the cluster heads for the UAV to traverse. The simulation results validate the effectiveness of the proposed offloading strategy in terms of tasks delays and UAV energy consumption.
Mobile edge computing (MEC) has emerged as a key solution for addressing the demands of computation-intensive network services by providing computational resources at the network edge, thereby minimizing service delays. Leveraging their flexible deployment, wide coverage, and reliable wireless communication, unmanned aerial vehicles (UAVs) have been integrated into MEC systems to enhance performance. This paper investigates the task offloading problem in a Multi-UAV-assisted MEC environment and proposes a collaborative optimization framework that integrates the Distance to Task Location and Capability Match (DTLCM) mechanism with a Multi-Agent Deep Deterministic Policy Gradient (MADDPG) algorithm. Unlike traditional task priority-based offloading schemes, the proposed approach ensures optimal UAV selection based on both computational capability and spatial proximity. The system gain is defined in terms of energy efficiency and task delay with the optimization formulated as a mixed-integer programming problem. To efficiently solve this complex problem, a Multi-Agent Deep Reinforcement Learning framework is employed, combining MADDPG with DTLCM to jointly optimize UAV trajectories, task offloading decisions, computational resource allocation, and communication resource management. Comprehensive simulations demonstrate that the proposed MADDPG-DTLCM framework significantly outperforms four state-of-the-art methods (MADDPG-DTLCM,MADQN, MADDPG without DTLCM, and Greedy offloading), achieving 18% higher task completion rates and 12% lower latency under varying network conditions, particularly in high-user-density scenarios with UAV collaboration.
Due to advances in high-performance computing technologies, computer graphics techniques—especially those related to mesh simplification—have been noticeably improved. These techniques, which have a strong impact on many applications, such as geometric modeling and visualization, have been well studied for more than two decades. Recent advances in GPUs have led to significant improvements in terms of speed and interactivity. In this paper, we present a mesh simplification algorithm that benefits from the parallel framework provided by recent GPUs. We customize the halfedge data structure for adaption with the dynamic memory restrictions of CUDA. The proposed algorithm is fully parallelized by employing a lock-free skip priority queue and a set of disjoint regions of the mesh. The proposed technique accelerates the simplification process while preserving the topological properties of the mesh. Some results and comparisons are provided to verify the efficiency of the proposed algorithm.