Adaptive Multi-Objective Evolutionary Design for Sustainable and Efficient Wireless Sensor Networks

Accurate and fast localization of randomly deployed sensor nodes is needed for many applications in wireless sensor networks. Localization also benefits in recognizing the geographically area where an event took place. There is no meaning of any event information without the knowledge of its location coordinates. DV-Hop is one of the main range free localization technique, which estimates the position of nodes using distance vector. Particle swarm optimization is suitable for the localization issues because of its fast computing speed and high precision. To further reduce the positioning error, the traditional DV-Hop localization algorithm based on single objective optimization algorithm is converted into a multi objective optimization algorithm. In our proposed scheme, we have considered six different single objective functions and three different multi objective functions. In this paper, a multi objective particle swarm optimization based DV-Hop localization is proposed in 3-dimensional wireless sensor networks. The proposed functions has been evaluated on the basis of computation time, average localization error and localization error variance. The simulation results show that our proposed multi objective function performs better as compared to traditional single objective function.

A multi-objective particle swarm optimization (MOPSO) approach for multi-objective economic load dispatch problem in power system is presented in this paper. The economic load dispatch problem is a non-linear constrained multi-objective optimization problem. The proposed MOPSO approach handles the problem as a multi-objective problem with competing and non-commensurable fuel cost, emission and system loss objectives and has a diversity-preserving mechanism using an external memory (call “repository”) and a geographically-based approach to find widely different Pareto-optimal solutions. In addition, fuzzy set theory is employed to extract the best compromise solution. Several optimization runs of the proposed MOPSO approach were carried out on the standard IEEE 30-bus test system. The results revealed the capabilities of the proposed MOPSO approach to generate well-distributed Pareto-optimal non-dominated solutions of multi-objective economic load dispatch. Comparison with Multi-objective Evolutionary Algorithm (MOEA) showed the superiority of the proposed MOPSO approach and confirmed its potential for solving multi-objective economic load dispatch.

Multi-objective cluster head using self-attention based progressive generative adversarial network for secured data aggregation

In this paper, a multi-objective hybrid firefly and particle swarm optimization (MOHFPSO) was proposed for different multi-objective optimal power flow (MOOPF) problems. Optimal power flow (OPF) was formulated as a non-linear problem with various objectives and constraints. Pareto optimal front was obtained by using non-dominated sorting and crowding distance methods. Finally, an optimal compromised solution was selected from the Pareto optimal set by applying an ideal distance minimization method. The efficiency of the proposed MOHFPSO technique was tested on standard IEEE 30-bus and IEEE 57-bus test systems with various conflicting objectives. Simulation results were also compared with non-dominated sorting based multi-objective particle swarm optimization (MOPSO) and different optimization algorithms reported in the current literature. The achieved results revealed the potential of the proposed algorithm for MOOPF problems.

The initial Moth-Flame Optimization (MFO) algorithm is appropriately changed to deal with multi-objective optimization problems described as Multi-objective Moth-Flame Optimization (MMFO). The primary idea of this MFO is the navigating technique of moths in nature which fly in night time by keeping a fixed angle relative to the moon. Nevertheless, these elegant bugs are entrapped in a useless/deadly spiral route around fabricated lights. Normally principles like using fixed-sized external archive make the recommended technique vary from the initial single-objective MFO. The efficiency of recommended MMFO is tested on eight multi-objective engineering design problems concerning remarkable precision and uniformity compared to Multi-objective Particle Swarm Optimization (MOPSO), Multi-objective Gray Wolf Optimizer (MOGWO), and Multi-objective Ant Lion Optimizer (MOALO). According to the results of different performance metrics, such as Generational Distance (GD), Inverted Generational Distance (IGD), and Maximum Spread (MS), the proposed algorithm can provide quality Pareto fronts with very competitive results.

Spyware is the highest multifaceted, complicated and directed malware, which has been progressively affected from last few years to present. Spyware may be genuinely designed and used for certain specific purposes, but sadly most spyware is created or designed as malicious intention. The main function of the spyware is generally to capture user used passwords, financial credentials and any money other credentials which are useful for financial growth. This collected same information will be sent through internet to fraudsters. Gaining extraordinary convergence and finest outcomes leftovers a major contest in all the multi objective optimization problems. Many researchers have found many solutions in the same field, but this research paper presents the Interdisciplinary training consents for fusion of ideas and the synthesis of characteristics from several disciplines leads to ultimate best solution. This research shows about the innovative multi objective particle swarm optimization (PSO) algorithm with machine learning technique to achieve the improved results with additional accuracy.

This paper presents a survey on the current state-of-the-art in Wireless Sensor Network (WSN) Operating Systems (OSs). In recent years, WSNs have received tremendous attention in the research community, with applications in battlefields, industrial process monitoring, home automation, and environmental monitoring, to name but a few. A WSN is a highly dynamic network because nodes die due to severe environmental conditions and battery power depletion. Furthermore, a WSN is composed of miniaturized motes equipped with scarce resources e.g., limited memory and computational abilities. WSNs invariably operate in an unattended mode and in many scenarios it is impossible to replace sensor motes after deployment, therefore a fundamental objective is to optimize the sensor motes’ life time. These characteristics of WSNs impose additional challenges on OS design for WSN, and consequently, OS design for WSN deviates from traditional OS design. The purpose of this survey is to highlight major concerns pertaining to OS design in WSNs and to point out strengths and weaknesses of contemporary OSs for WSNs, keeping in mind the requirements of emerging WSN applications. The state-of-the-art in operating systems for WSNs has been examined in terms of the OS Architecture, Programming Model, Scheduling, Memory Management and Protection, Communication Protocols, Resource Sharing, Support for Real-Time Applications, and additional features. These features are surveyed for both real-time and non-real-time WSN operating systems.

In designing the wireless sensor networks, the energy is the most important consideration because the lifetime of the sensor node is limited by the battery of it. To overcome this demerit many research have been done. The clustering is the one of the representative approaches. In the clustering, the cluster heads gather data from nodes, aggregate it and send the information to the base station. In this way, the sensor nodes can reduce communication overheads that may be generated if each sensor node reports sensed data to the base station independently. LEACH is one of the most famous clustering mechanisms. It elects a cluster head based on probability model. This approach may reduce the network lifetime because LEACH does not consider the distribution of sensor nodes and the energy remains of each node. However, using the location and the energy information in the clustering can generate big overheads. In this paper we introduce CHEF - cluster head election mechanism using fuzzy logic. By using fuzzy logic, collecting and calculating overheads can be reduced and finally the lifetime of the sensor networks can be prolonged. To prove efficiency of CHEF, we simulated CHEF compared with LEACH using the matlab. Our simulation results show that CHEF is about 22.7% more efficient than LEACH.

The routing is a real-world engineering problem in IoT Collection Networks. It has a direct impact on the network performance. The routing problem can be treated as a multi-objective optimization problem. Our objective is then to study the IoT routing problem using the Multi-Objective Grey Wolf optimizer (MOGWO) [1], which consists in translating the routing process into a multi-objective optimization problem and implementing its execution with the MOGWO. In this context, the experimental study showed that the MOGWO provides better quality of routing (higher lifetime of the network, more efficient delivery delay and higher number of neighbors).

This paper formulates a bi-criteria fuzzy blocking flow shop scheduling problem with fuzzy processing time and fuzzy due date. An improved multi-objective grey wolf optimization (MOGWO) algorithm is proposed to solve this combinational optimization problem. The proposed MOGWO utilizes the ranked-order-value (ROV) rule for solution representation, employs a dynamic maintenance strategy to maintain archive, and develops a thorough mechanism for leader selection. In addition, to improve the performance of the neighborhood search, a VNS structure with three randomly ranked neighborhood search operators is introduced and implemented on the members of archive that may become the selected leaders. The proposed MOGWO is tested on a fuzzy blocking flow shop scheduling problem of panel block construction, and is compared with general MOGWO and multi-objective particle swarm optimization (MOPSO). Computational results suggest that the proposed MOGWO is superior to the compared algorithms in terms of the convergence, spread and coverage of the optimal solutions. This demonstrates the feasibility and effectiveness of the proposed MOGWO.

Reviews from various domains is being posted in web increasingly day by day. Analyzing this enormous content would be useful in decision making for various stakeholders. Text summarization techniques generate concise summaries including sentiments which are useful in analyzing the large content. So text summarization systems become significant in analyzing this huge content. The summaries are generated based on important features using multi objective approaches where sufficient literature is not available. Major limitations of text summarization systems are scalability and performance. Two variants of multi objective optimization techniques such as Discrete and Continuous which work under the principles of particle swarm optimization (PSO) for extractive summarization of reviews had been proposed for performance improvement. The performance is validated using Recall-Oriented Understanding for Gisting Evaluation (ROUGE), Success Counting (SC) and Inverted Generational Distance (IGD). Based on the experimental results it is found that the system is effective using multi-objective PSO algorithm when compared to other state-of-art approaches like Liu’s approach feature based binary particle swarm optimization and etc. for feature based review summarization.

SummaryThe arbitrary distribution of sensor nodes and irregularity of the routing path led to unordered data, which is complex to handle in a wireless sensor network (WSN). To increase WSN lifetime, data aggregation models are developed to minimize energy consumption or ease the computational burden of nodes. The compressive sensing (CS) provides a new technique for prolonging the WSN lifetime. A hybrid optimized model is devised for cluster head (CH) selection and CS‐based data aggregation in WSN. The method aids to balance the energy amidst different nodes and elevated the lifetime of the network. The hybrid golden circle inspired optimization (HGCIO) is considered for cluster head (CH) selection, which aids in selecting the CH. The CH selection is done based on fitness functions like distance, energy, link quality, and delay. The routing is implemented with HGCIO to transmit the data projections using the CH to sink and evenly disperse the energy amidst various nodes. After that, compressive sensing is implemented with the Bayesian linear model. The convolutional neural network‐long short term memory (CNN‐LSTM) is employed for the data aggregation process. The proposed HGCIO‐based CNN‐LSTM provided the finest efficiency with a delay of 0.156 s, an energy of 0.353 J, a prediction error of 0.044, and a packet delivery ratio (PDR) of 76.309%.

Using wireless sensor networks (WSNs) in delay and reliability critical environments is highly desired due to their unique advantages such as low cost, ease of deployment, and redundancy. However, successful deployment of resource-limited WSNs in such applications requires strict quality-of-service (QoS) provisioning techniques to meet the desired latency and reliability targets of those applications. Implementation of QoS techniques in WSNs is significantly challenging since WSNs have been initially devised for low-data-rate non-real-time applications. Therefore, WSN designers and developers resort to different cross-layer interaction and optimization techniques to provision QoS in WSNs. In this paper, we present a survey on the state of the art of cross-layer QoS approaches in wireless terrestrial sensor networks to achieve delay and reliability bounds in critical applications. Our paper provides a unique classification of cross-layer QoS approaches in WSNs that allows surveying a large amount of studies with utmost clarity. Furthermore, we highlight the main challenges of implementing QoS protocols in WSNs and present an overview of QoS-aware WSN applications.

Due to increased search complexity in multi-objective optimization, premature convergence becomes a problem. Complex engineering problems poses high number of variables with many constraints. Hence, more difficult benchmark problems must be utilized to validate new algorithms performance. A well-known optimizer, Multi-Objective Particle Swarm Optimizer (MOPSO), has a few weakness that needs to be addressed, specifically its convergence in high dimensional problems and its constraints handling capability. For these reasons, we propose a modified MOPSO (M-MOPSO) to improve upon these aspects. M-MOPSO is compared with four other algorithms namely, MOPSO, Multi-Objective Grey Wolf Optimizer (MOGWO), Multi-Objective Evolutionary Algorithm based on Decompositions (MOEA/D) and Multi-Objective Differential Evolution (MODE). M-MOPSO emerged as the best algorithm in eight out of the ten constrained benchmark problems. It also shows promising results in bioprocess application problems and tumor treatment problems. In overall, M-MOPSO was able to solve multi-objective problems with good convergence and is suitable to be used in real world problem.

Wireless sensor networks (WSN) have been recently be proposed for great deal of applications in industrial automation, health and environment monitoring. Increasingly there is a need to access wireless sensor networks from other IP-based networks. However, WSN has its own application-specific non-standardized protocols such as data-centric router protocol, which is a significant challenge to establish interconnection with IP networks which is based on address-centric router protocols. Service-Oriented Architecture (SOA) has been chosen to implement the communication among distributed applications. In this paper, we propose a Service-Oriented framework for inter-connection between data-centric WSN and IP network. This framework enables service-based query for data-centric WSN based on Device Profile for Web service (DPWS). It provides transparent access from one network to the other without modifying protocols running in either network.