Research on Relay Node Placement Based on Hybrid Greedy Optimization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 644-650 ◽  
pp. 3028-3031
Author(s):  
Hui Xu ◽  
Hang Zhang

In this paper, we propose a hybrid greedy optimization algorithm for (WSN, wireless sensor networks) and then design the relay node layout system. The test results demonstrate that the hybrid algorithm greatly reduces the number of nodes required to avoid wasting too much unnecessary relay node.

2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga

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