The advancement of the Internet of Things (IoT) and the availability of wide cloud services have led to the horizon of edge computing paradigm which demands for processing the data at the edge of the network. The development of 5G technology has led to the increased usage of IoT-based devices and the generation of a large volume of data followed by increased data traffic, which is difficult to process by the mobile edge computing (MEC) platform. The latest inventions related to unmanned aerial vehicles (UAVs) helps to assist and replace the edge servers used for MEC. In the present work, the objective is to develop self-adaptive trajectory optimization algorithm (STO) which is a multi-objective optimization algorithm used to solve the vital objectives associated with the above scenario of a UAV-assisted MEC system. The objectives identified are minimizing the energy consumed by the MEC and minimizing the process emergency indicator, where the process emergency indicator implies the urgency level of a particular process. Finding the optimal values for these conflicting objectives will help to further efficiently apply UAV for MEC systems. A self-adaptive multi-objective differential evolution-based trajectory optimization algorithm (STO) is proposed, where a pool of trial vector generation strategies is extended. The strategies and the crossover rate associated with a differential evolution (DE) algorithm are self-adapted using fuzzy systems to improve the population diversity. The experimentation is planned to be conducted on hundreds of IoT device instances considered to be fixed on the ground level and to evaluate the performance of the proposed algorithm for a single unmanned aerial vehicle-assisted mobile edge computing system.
Deepfake techniques have been evolving rapidly in recent days and pose a severe security threat. Detecting such generated fake videos is a challenging task. Existing deep learning based deep fake detection model struggle in identifying fake videos when experimented on challenging dataset. In this paper, we propose a Fuzzy logic based Deepfake Detector system (Fuzzy-DFD) using a deep learning model ResNet-50 as encoder. The system workflow includes preprocessing, frame extraction, deep fake detection and decision fusion. In preprocessing, frames are extracted from video, facial region is cropped, and frame resizing is performed. Next, optical flow maps are generated using SEA-RAFT model and edge defined frames generated using Frei-Chen mask technique. These three frame variants present a rich representation of video for the deep learning model. 3 ResNet-50 models are employed as encoders to generate feature maps trained using above frame types, ensuring anomaly identification in spatial, temporal and structural domains. A novel three input and one output Fuzzy Inference System is designed for decision fusion combining the detection results of all three classifier models to make decision on video being a fake. The performance of the proposed Fuzzy-DFD system is evaluated by training the model on well-known deep fake classification datasets namely FakeForensics++ and Celeb-DF(v2). Further results are compiled and evaluated using performance indicators like accuracy, Precision, F1-Score, Recall and AUC. Fuzzy-DFD system attained accuracy of 99% and 93% for FaceForensics++ and Celeb-DF(v2) datasets respectively. Comparison study with other SOTA deep fake detection models is conducted, and Fuzzy-DFD significantly outperformed the other models taken for comparison. The anomaly learning through RGB, optical flow and structural characteristics with fuzzy system-based decision fusion technique contributes to a robust deep fake detection system.
Simulated by nature’s evolution, numerous evolutionary algorithms had been proposed. These algorithms perform better for a particular problem domain and extensive parameter fine tuning and adaptations are required in optimizing problems of varied domain. This paper aims to develop robust and self-adaptive memetic algorithm by combining Differential Evolution based algorithm, a popular population based global search method with the Controlled Local search procedure to solve multi-objective optimization problems. Memetic Algorithm is an enhanced evolutionary algorithm, it combines global search method with local search techniques for faster convergence. Memetic algorithm improves both exploration and exploitation, preventing premature convergence and also refines the current best solutions efficiently. Proposed algorithm is named as Fuzzy based Memetic Algorithm using Diversity control (F-MAD). In F-MAD, population diversity is controlled through the control parameters self-adaptation of Differential Evolution algorithm (DE) such as, crossover rate and scaling factor by using two fuzzy systems. A controlled local search procedure is adapted for guiding convergence process thus balancing explore-exploit cycle. The control parameter self-adaptation and enhanced selection method with controlled local search method aid population diversity control in decision space and attaining optimal solutions with uniform distribution in terms of diversity and convergence metrics in objective space. These characteristics help the proposed method suitable to be extended to different application domain without the need of trial-and-error fine tuning of the parameters. The performance is tested through standard benchmark test problems-CEC 2009 test problems and DTLZ test problem and further validated through performance metrics and statistical test. It is compared with popular optimization algorithms and experiment results indicate that F-MAD perform well than State of-The-Art (SOTA) algorithms taken for comparison. F-MAD algorithm attains better results for 8 out of 10 CEC 2009 test problems (UF1-UF10) when compared to 20 other algorithms taken for comparison. For DTLZ problems, F-MAD attains better results for ALL 7 problems (DTLZ 1-DTLZ7) when compared to 8 other SOTA algorithms. The performance is further evaluated using Friedman rank test and the proposed F-MAD significantly outperformed other algorithms.
The objective measurements of the real-world optimization problems are mostly subject to noise which occurs due to several reasons like human measurement or environmental factors. The performance of the optimization algorithm gets affected if the effect of noise is higher than the negligible limit. The previous noise handling optimization algorithms use a large population size or multiple sampling at same region which increases the total count of function evaluations, and few methods work for a particular problem type. To address the above challenges, a Differential Evolution based Noise handling Optimization algorithm (NDE) to solve and optimize noisy bi-objective optimization problems is proposed. NDE is a Differential Evolution (DE) based optimization algorithm where the strategies for trial vector generation and the control parameters of DE algorithm are self-adapted using fuzzy inference system to improve the population diversity along the evolution process. In NDE, explicit averaging based method for denoising is used when the noise level is higher than negligible limit. Extending noise handling method enhances the performance of the optimization algorithm in solving real world optimization problems. To improve the convergence characteristics of the proposed algorithm, a restricted local search procedure is proposed. The performance of NDE algorithm is experimented using DTLZ and WFG problems, which are benchmark bi-objective optimization problems. The obtained results are compared with other SOTA algorithm using modified Inverted Generational Distance and Hypervolume performance metrics, from which it is confirmed that the proposed NDE algorithm is better in solving noisy bi-objective problems when compared to the other methods. To further strengthen the claim, statistical tests are conducted using the Wilcoxon and Friedman rank tests, and the proposed NDE algorithm shows significance over the other algorithms rejecting the null hypothesis.
The complicated topographical limitations and NP-hard nature of the sensor placement problem make it difficult to achieve optimal coverage and connectivity in Wireless Sensor Networks (WSNs) deployed over irregular terrains. WSNs encounter critical challenges in uneven regions due to irregular obstacles, elevation variations, and dynamic terrain profiles, all of which influence coverage and connectivity. Classical methods, such as greedy or evolutionary strategies, often struggle to scale efficiently as terrain complexity increases and may converge to suboptimal solutions due to their heuristic nature. This paper applies Grover’s quantum search algorithm to enhance sensor placement, the primary focus of this study. Unlike classical techniques that traverse solution spaces step by step, the Grover algorithm enhances the search process with a quadratic speedup. This enhancement enables the efficient identification of near-optimal sensor configurations in complicated contexts. This quantum-assisted method not only reduces the number of necessary sensors but also enhances performance in coverage and connectivity metrics, along with a substantial decrease in computation burden. The integration of terrain-awareness and quantum search diverges significantly from traditional approaches, providing an intelligent, scalable, and computationally promising methodology for WSN deployment in the real-world terrains.