Efficient scalable sensor node placement algorithm for fixed target coverage applications of wireless sensor networks

2017 ◽  
Vol 7 (2) ◽  
pp. 44-54 ◽  
Author(s):  
Arouna Ndam Njoya ◽  
Christopher Thron ◽  
Jordan Barry ◽  
Wahabou Abdou ◽  
Emmanuel Tonye ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Fixed Target ◽  
Node Placement ◽  
Placement Algorithm ◽  
Sensor Node Placement

scholarly journals A Review on Sensor Node Placement Techniques in Wireless Sensor Networks

2017 ◽  
Vol 7 (1) ◽  
pp. 190 ◽  
Author(s):  
Husna Zainol Abidin ◽  
Norashidah Md. Din ◽  
Nurul Asyikin Mohamed Radzi ◽  
Zairi Ismael Rizman
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Node Placement ◽  
Sensor Node Placement

A Grid-Based Relay Node Placement Algorithm in Wireless Sensor Networks

2013 ◽  
Vol 385-386 ◽  
pp. 1632-1637
Author(s):  
Zhu Wang ◽  
Cui Cui Lv ◽  
Ling Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Physical Factors ◽  
Relay Node Placement ◽  
Relay Nodes ◽  
Node Placement ◽  
Placement Algorithm

The relay node placement in wireless sensor networks is usually constrained by physical factors, while most of present relay node placement approaches are unconstrained. To solve the problem, the paper presents a constrained relay node placement algorithm. Based on grid routing mechanism, the algorithm determines the grid intersections as candidates for the relay node locations, and places as fewer relay nodes as possible to assure the network connectivity. Consideration must be given to both the number of relay nodes and energy efficient, the paper uses the greedy norm and constrains to place relay nodes. By the analysis and study of the experiments, the performance of the proposed algorithm is more superior to the algorithm without constrains.

Node placement for connected target coverage in wireless sensor networks with dynamic sinks

2019 ◽  
Vol 59 ◽  
pp. 101070 ◽  
Author(s):  
Phi Le Nguyen ◽  
Nguyen Thi Hanh ◽  
Nguyen Tien Khuong ◽  
Huynh Thi Thanh Binh ◽  
Yusheng Ji
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Node Placement

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.

A Novel Static Path Planning Method for Mobile Anchor-Assisted Localization in Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Sensor Node ◽  
Large Scale ◽  
Performance Metrics ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Planning Methods

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.

Sign in / Sign up

Export Citation Format

Share Document