Hybrid multi-objective evolutionary algorithms based on decomposition for wireless sensor network coverage optimization
Applied Soft ComputingPublished 6 April 2018Open access
Ying Xu, Ou Ding, Rong Qu, Keqin Li
Citations112
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Simulation results show that the proposed improved hybrid multi-objective evolutionary algorithms have a significant better performance compared with existing algorithms in the literature in terms of all the objectives concerned.
Abstract
In Wireless Sensor Networks (WSN), maintaining a high coverage and extending the network lifetime are two conflicting crucial issues considered by real world service providers. In this paper, we consider the coverage optimization problem in WSN with three objectives to strike the balance between network life-time and coverage. These include minimizing the energy consumption, maximizing the coverage rate and maximizing the equilibrium of energy consumption. Two improved hybrid multi-objective evolutionary algorithms, namely Hybrid-MOEA/D-I and Hybrid-MOEA/D-II, have been proposed. Based on the well-known multi-objective evolutionary algorithm based on decomposition (MOEA/D), Hybrid-MOEA/D-Ihybrids a genetic algorithm and a differential evolutionary algorithm to effectively optimize sub-problems of the multi-objective optimization problem in WSN. By integrating a discrete particle swarm algorithm, we further enhance solutions generated by Hybrid-MOEA/D-I in a new Hybrid-MOEA/D-II algorithm. Simulation results show that the proposed Hybrid-MOEA/D-I and Hybrid-MOEA/D-II algorithms have a significant better performance compared with existing algorithms in the literature in terms of all the objectives concerned.
Keywords
Computer ScienceEngineering
IEEE Transactions on Evolutionary ComputationA fast and elitist multiobjective genetic algorithm: NSGA-II
47,759 Citations2002Kalyanmoy Deb, Amrit Pratap +2 more
This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Particle swarm optimization
47,523 Citations2002James Kennedy, R.C. Eberhart
Swarm IntelligenceParticle swarm optimization
21,351 Citations2007Riccardo Poli, James Kennedy +1 more
A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
IEEE Transactions on Wireless CommunicationsAn application-specific protocol architecture for wireless microsensor networks
10,455 Citations2002Wendi Heinzelman, Anantha P. Chandrakasan +1 more
This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
IEEE Transactions on Evolutionary ComputationMOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
9,561 Citations2007Qingfu Zhang, Hui Li
Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
IEEE Computational Intelligence Magazine2015 IEEE Congress on Evolutionary Computation (CEC2015)
807 Citations2015Kalyanmoy Deb, Kay Tan +14 more
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)Particle Swarm Optimization in Wireless-Sensor Networks: A Brief Survey
732 Citations2010Raghavendra V. Kulkarni, Ganesh K. Venayagamoorthy
Issues in WSNs are outlined,PSO is introduced, and its suitability for WSN applications is discussed, and a brief survey of how PSO is tailored to address these issues is presented.
IEEE Communications Surveys & TutorialsComputational Intelligence in Wireless Sensor Networks: A Survey
696 Citations2010Raghavendra V. Kulkarni, Anna Förster +1 more
An extensive survey of CI applications to various problems in WSNs from various research areas and publication venues is presented and a general evaluation of CI algorithms is presented, which will serve as a guide for using CI algorithms for W SNs.
Network Protocols and AlgorithmsCoverage in Wireless Sensor Networks: A Survey
203 Citations2010Raymond Mulligan
A representative survey of the current work that has been done in wireless sensor networks is taken and several terms and concepts are defined and then shown how they are being utilized in various research works.
Swarm and Evolutionary ComputationEnergy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks
176 Citations2011Enan A. Khalil, Bara’a A. Attea
An evolutionary-based routing protocol is proposed, which can guarantee better tradeoff between the lifespan and the stability period of the network with efficient energy utilization and can provide more robust results than the existing heuristic and meta-heuristic protocols in terms of network stability period, lifetime, and energy consumption.
SensorsProbabilistic Dynamic Deployment of Wireless Sensor Networks by Artificial Bee Colony Algorithm
163 Citations2011Celal Öztürk, Derviş Karaboğa +1 more
The artificial bee colony algorithm is applied to the dynamic deployment of stationary and mobile sensor networks to achieve better performance by trying to increase the coverage area of the network.
Computers & Mathematics with ApplicationsMulti-objective optimization for coverage control in wireless sensor network with adjustable sensing radius
156 Citations2008Jie Jia, Jian Chen +3 more
A novel coverage control scheme based on elitist non-dominated sorting genetic algorithm (NSGA-II) is proposed in a heterogeneous sensor network and an ameliorated binary coding is addressed to represent both sensing radius adjustment and sensor selection.
Computer communications and networksCoverage Control in Sensor Networks
143 Citations2010Bang Wang
This easy-to-read text focuses on challenges in coverage control in sensor networks, examines fundamental coverage problems, and presents the most recent advances and techniques in the field.
IEEE Transactions on Wireless CommunicationsSensor Deployment With Limited Communication Range in Homogeneous and Heterogeneous Wireless Sensor Networks
95 Citations2016Jun Guo, Hamid Jafarkhani
By defining an appropriate sensing performance measure, this paper proposes a Restrained Lloyd (RL) algorithm and a deterministic annealing (DA) algorithm to optimize sensor deployment in both the homogeneous and heterogeneous WSNs.
Applied Soft ComputingEnergy efficient chain based cooperative routing protocol for WSN
82 Citations2015Shalli Rani, Jyoteesh Malhotra +1 more
This paper investigates the reduction in total transmission time and the energy consumption of wireless sensor networks using multi-hop data aggregation by forming coordination in hierarchical clustering and shows by extended simulations that Chain Based Cluster Cooperative Protocol (CBCCP) performs very well in terms of energy and time.
IEEE Transactions on CyberneticsA Hybrid Memetic Framework for Coverage Optimization in Wireless Sensor Networks
78 Citations2014Chia-Pang Chen, Subhas Chandra Mukhopadhyay +5 more
A hybrid memetic framework for coverage optimization (Hy-MFCO) is presented to cope with the hybrid problem using two major components: a memetic algorithm (MA)-based scheduling strategy and a heuristic recursive algorithm (HRA).
Multi-objective Mobile Agent Routing in Wireless Sensor Networks
63 Citations2005R. Rajagopalan, Chilukuri K. Mohan +2 more
Simulation results show that the mobile agent routing problem can be solved successfully using evolutionary multi-objective algorithms such as EMOCA and NSGA-II, and enables choosing between two alternative routing algorithms, to determine which one results in higher detection accuracy.
Wireless Personal CommunicationsMulti-Objective Evolutionary Algorithm Based on Decomposition for Energy Efficient Coverage in Wireless Sensor Networks
62 Citations2012Suat Özdemi̇r, Bara’a A. Attea +1 more
A recently developed multi-objective optimization algorithm, the so-called multi-Objective evolutionary algorithm based on decomposition (MOEA/D) is employed to solve simultaneously the coverage preservation and energy conservation design problems in cluster-based WSNs.
IEEE/ACM Transactions on NetworkingHomology-Based Distributed Coverage Hole Detection in Wireless Sensor Networks
52 Citations2014Feng Yan, Anaïs Vergne +2 more
Simulation results are consistent with the proposed analytical lower bound, with a maximum difference of 0.5%.
The Analysis and Improvement of Binary Particle Swarm Optimization
39 Citations2009Jianhua Liu, Xiaoping Fan
An improved Binary PSO is proposed which changes the formula of its probability mapping and the formulas of bit obtaining value to intensify the local exploration of binary PSO.
Journal of HeuristicsParticle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems
39 Citations2012Rong Qu, Ying Xu +2 more
This paper develops a novel PSO algorithm based on the jumping PSO (JPSO) algorithm recently developed by Moreno-Perez et al. (Proc. of the 7th Metaheuristics International Conference, 2007), and proposes two novel local search heuristics within the JPSO framework.
Annals of Operations ResearchA simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
32 Citations2013Ying Xu, Rong Qu +1 more
Experimental results demonstrate that both the simulated annealing based strategies and the genetic local search within the proposed multi- objective algorithm can efficiently identify high quality non-dominated solution set for multi-objective multicast routing problems and outperform other conventional multi-Objective evolutionary algorithms in the literature.
Cluster based routing protocol to prolong network lifetime through mobile sink in WSN
30 Citations2016B Y Kushal, M. Chitra
Proposed method is aimed to optimize the energy dissipation by modifying the CH (Cluster Head) selection approach in LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm and avoids the energy-hole problem considering mobility to the sink node which helps to prolong the lifetime of entire network.
IEEE Systems JournalDemand-Based Coverage and Connectivity-Preserving Routing in Wireless Sensor Networks
29 Citations2014Hari Prabhat Gupta, S. Venugopal Rao
A demand-based coverage and connectivity-preserving routing protocol to provide desired Coverage and connectivity requirements in WSNs and prolongs the network lifetime is presented.
SensorsMemetic Algorithm-Based Multi-Objective Coverage Optimization for Wireless Sensor Networks
26 Citations2014Zhi Chen, Shuai Li +1 more
The experiment and evaluation results show MOCADMA can have good capabilities in maintaining the sensing coverage, achieve higher network coverage while improving the energy efficiency and effectively prolonging the network lifetime, and have a significant improvement over some existing algorithms.
Wireless Personal CommunicationsNADS: Neighbor Assisted Deployment Scheme for Optimal Placement of Sensor Nodes to Achieve Blanket Coverage in Wireless Sensor Network
20 Citations2016Vikrant Sharma, R. B. Patel +2 more
A Neighbor Ass deployment scheme (NADS) to uniformly distribute the randomly spread Mobile Sensor Nodes (MSNs) within a candidate region is proposed and it is observed that NADS is realistic, scalable and yields better performance in terms of coverage, connectivity, setup-time and energy-efficiency with minimum number of MSNs as compared to existing schemes.
An efficient Multi-Parent Hierarchical routing protocol for WSNs
17 Citations2014Carolina Del-Valle-Soto, Carlos Mex-Perera +4 more
The main goal is to achieve reliable delivery of data in a single sink scenario while keeping low overhead, reduced latency and low energy consumption, and an experimental demonstration of the capabilities of the MPH protocol is presented.
WSN's energy-aware coverage preserving optimization model based on multi-objective bat algorithm
16 Citations2015Marwa Sharawi, E. Emary +2 more
This research introduces a WSN's energy-aware and coverage preserve hierarchal clustering and routing model based on multi-objective bat swarm optimization algorithm that outperforms the LEACH routing and clustering protocol.
Reliable energy-aware routing protocol for heterogeneous WSN based on beaconing
15 Citations2014Ya-tang Li, Pengjun Wang +3 more
A novel routing protocol for heterogeneous WSN based on beaconing, EARBB(a Energy-Aware Routing Based on Beaconing) which can provide a reliable and energy-efficient routing scheme for both information collection and dissemination with beaconing packets exchanged between nodes and their neighbour.
Optimal coverage of Wireless Sensor Network using Termite Colony Optimization Algorithm
12 Citations2015Pronaya Prosun Das, Nirjhar Chakraborty +1 more
A Termite Colony Optimization algorithm, an adaptable and balanced way, which optimizes a minimal number of sensors while covering a maximum area, which has shown more effectiveness and robustness compared to other population based algorithms.
Minimizing energy consumption in transmit-only sensor networks via optimal placement of the cluster heads
12 Citations2016Murtadha Aldeer, Richard Howard +1 more
Simulation results showed that reduction in energy consumption in a range of (16-24)% can be achieved by employing the optimization-based approach as compared to other standard placement methods.
SAERP: An energy efficiency Real-time Routing protocol in WSNs
11 Citations2014Kaebeh Yaeghoobi, S. S. Tyagi +2 more
The adaptation of this protocol is to practically addresses on communication energy for every packet, based on its limitation that can handle power saving and least usage without omitting any packet limitations and covers the scalability, bandwidth and memory limitation constraints.
Coverage optimization in a terrain-aware wireless sensor network
11 Citations2016Husam I. Sweidan, Timothy C. Havens
Three algorithms are used to examine the problem: the Artificial Immune System (AIS), the Normalized Genetic Algorithm (NGA) and the Particle Swarm Optimization (PSO) algorithm, where the AIS and NGA algorithms outperform the PSO algorithm in terms of coverage rate and mobility cost, especially for a lower count of sensors.
Heuristic and Meta-Heuristic Approaches for Energy-Efficient Coverage-Preserving Protocols in Wireless Sensor Networks
9 Citations2017Antonina Tretyakova, Franciszek Seredyński +1 more
This paper proposes two new scheduling heuristics for addressing the problem of maximizing the lifetime of a WSN under the constraint of coverage of a subset of fixed targets, the first of which is a stochastic greedy algorithm and the second one based on applying Simulated Annealing.
H-IECBR: HBO based-Improved Energy Efficient Chain Based Routing protocol in WSN
8 Citations2016Aman Gupta, Abhishek Thakur +3 more
This paper has optimized the routing path in IECBR (Improved Energy Efficient Chain Based Routing) protocol which is one of the most recent techniques based on PEGASIS (Power Efficient Gathering in Sensor Information System).
Multi-objective sensor placement using the effective independence model (SPEM) for wireless sensor networks in structural health monitoring
7 Citations2015Mohamed Elsersy, Mohamed H. Ahmed +2 more
Results show that mop-SPEM is able to trade-off the energy with the information quality by adjusting the relative weights of the objective functions and adds more flexibility because the energy consumption and the informationquality can be easily traded-off.
Coverage optimization in wireless sensor networks
6 Citations2014Esmaeil Kaffashi, Mehdi Taghizade Shoorabi +1 more
This paper considers a more realistic network scenario of WSNs with fixed and heterogeneous sensors, where the sensors are distributed randomly and their sensing radius can be controlled in an interval and the goal function and a simple pruning algorithm are presented.
Fault tolerant placement strategy for WSN
5 Citations2016Hanen Idoudi, Jihen Bennaceur
A new fault tolerant initial deployment schema that outperforms random and uniform grid deployment models in terms of connectivity, network lifetime and energy consumption, and is derived from a circular multi-layer model.
Jisuanji yingyong yanjiuHybrid sensor networks coverage-enhancing approach based on particle swarm optimization
5 Citations2010Yudong Li
The results of simulation show that the algorithm is able to improve the coverage of the networks and the performances of this algorithm are compared with other two latest algorithms.
Improved differential evolution to solve the two-objective coverage problem of wireless sensor networks
4 Citations2016Yulong Xu, Wang Xiaohui +1 more
This article introduces a sorting method which only handles the highest rank individual in current population and incorporates the proposed method into differential evolution to solve the two-objective coverage problem of WSN.
The analysis and research of wireless sensor network coverage optimization algorithm
2 Citations2012Jie Xu, Dawei Jiang +1 more
This paper studies and analyzes the Dividing Domain Algorithms, Delaminating and Non-Uniformity Coverage algorithm and Neighbourhood Node Utmost Coverage Algorithm, summarize and compare these algorithm characteristics, and the current main problems of covering algorithm are discussed.
Chuangan jishu xuebaoMulti-Objective Coverage Control Strategy for Wireless Sensor Networks
2 Citations2010Zhou Hui
Simulation shows that the multi-objective optimization coverage control strategy can reduce and balance the energy consumption effectively while ensuring the high network coverage.