Minimal Node Placement for Ensuring Target Coverage With Network Connectivity and Fault Tolerance Constraints in Wireless Sensor Networks

2019 ◽  
Author(s):  
Nguyen Thi Hanh ◽  
Huynh Thi Thanh Binh ◽  
Nguyen Van Son ◽  
Phan Ngoc Lan
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Target Coverage ◽  
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.

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

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

scholarly journals Energy Efficient Fault Tolerant Coverage in Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Shagufta Henna
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Large Scale ◽  
Fault Tolerant ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Problem

Energy efficiency and fault tolerance are two of the major concerns in wireless sensor networks (WSNs) for the target coverage. Design of target coverage algorithms for a large scale WSNs should incorporate both the energy efficiency and fault tolerance. In this paper, we study the coverage problem where the main objective is to construct two disjoint cover sets in randomly deployed WSNs based on relay energy (Erelay). Further, we present an approximation algorithm called Energy Efficient Maximum Disjoint Coverage (EMDC) with provable approximation ratios. We analyze the performance of EMDC theoretically and also perform extensive simulations to demonstrate the effectiveness of EMDC in terms of fault tolerance and energy efficiency.

scholarly journals Relay Node Placement Techniques in Wireless Sensor Networks

2020 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga ◽  
Suneer Angra
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Approximation Algorithms ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Node Placement ◽  
Research Challenges ◽  
Research Domain

<div>Relay node placement is one of the critical need of wireless sensor networks when connectivity, lifetime, fault tolerance like factors are desired in the network. In this study, we review the present relay node placement techniques and provide an overall view of this study by summarizing previous achievements. We categorize the placement strategies into four broad categories, namely, approximation, algorithms, heuristics, meta-heuristics based techniques. A taxonomy is presented to enlist the present techniques. The paper also emphasizes on the research challenges and gives an idea of potential future scope in this research domain. </div>

Sign in / Sign up

Export Citation Format

Share Document