A gravitational search algorithm for solving the relay node placement problem in wireless sensor networks

2015 ◽  
Vol 30 (2) ◽  
pp. e2957 ◽  
Author(s):  
Jose M. Lanza-Gutierrez ◽  
Juan A. Gomez-Pulido
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Placement Problem ◽  
Node Placement ◽  
Gravitational Search

scholarly journals Toward a Robust Multi-Objective Metaheuristic for Solving the Relay Node Placement Problem in Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 677 ◽  
Author(s):  
José Lanza-Gutiérrez ◽  
Nuria Caballé ◽  
Juan Gómez-Pulido ◽  
Broderick Crawford ◽  
Ricardo Soto
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Energy Cost ◽  
Search Algorithm ◽  
Relay Node ◽  
Wireless Sensor ◽  
Placement Problem ◽  
Node Placement ◽  
Multi Objective

During the last decade, Wireless sensor networks (WSNs) have attracted interest due to the excellent monitoring capabilities offered. However, WSNs present shortcomings, such as energy cost and reliability, which hinder real-world applications. As a solution, Relay Node (RN) deployment strategies could help to improve WSNs. This fact is known as the Relay Node Placement Problem (RNPP), which is an NP-hard optimization problem. This paper proposes to address two Multi-Objective (MO) formulations of the RNPP. The first one optimizes average energy cost and average sensitivity area. The second one optimizes the two previous objectives and network reliability. The authors propose to solve the two problems through a wide range of MO metaheuristics from the three main groups in the field: evolutionary algorithms, swarm intelligence algorithms, and trajectory algorithms. These algorithms are the Non-dominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary Algorithm 2 (SPEA2), Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), Multi-Objective Artificial Bee Colony (MO-ABC), Multi-Objective Firefly Algorithm (MO-FA), Multi-Objective Gravitational Search Algorithm (MO-GSA), and Multi-Objective Variable Neighbourhood Search Algorithm (MO-VNS). The results obtained are statistically analysed to determine if there is a robust metaheuristic to be recommended for solving the RNPP independently of the number of objectives.

An Obstacle-resistant Relay Node Placement in Constrained Environment

2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Robots ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Node Placement ◽  
Simulation Results ◽  
Additional Hardware ◽  
Shape And Size

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.

Sign in / Sign up

Export Citation Format

Share Document