scholarly journals Detecting Boundary Nodes and Coverage Holes in Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Li-Hui Zhao ◽  
Wenyi Liu ◽  
Haiwei Lei ◽  
Ruixia Zhang ◽  
Qiulin Tan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Outer Boundary ◽  
Wireless Sensor ◽  
Special Events ◽  
Simulation Results ◽  
Novel Algorithms ◽  
Coverage Holes

The emergence of coverage holes in wireless sensor networks (WSNs) means that some special events have broken out and the function of WSNs will be seriously influenced. Therefore, the issues of coverage holes have attracted considerable attention. In this paper, we focus on the identification of boundary nodes and coverage holes, which is crucially important to preventing the enlargement of coverage holes and ensuring the transmission of data. We define the problem of coverage holes and propose two novel algorithms to identify the coverage holes in WSNs. The first algorithm, Distributed Sector Cover Scanning (DSCS), can be used to identify the nodes on hole borders and the outer boundary of WSNs. The second scheme, Directional Walk (DW), can locate the coverage holes based on the boundary nodes identified with DSCS. We implement the algorithms in various scenarios and fully evaluate their performance. The simulation results show that the boundary nodes can be accurately detected by DSCS and the holes enclosed by the detected boundary nodes can be identified by DW. The comparisons confirm that the proposed algorithms outperform the existing ones.

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 Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

Performance Analysis of OQPSK Signals with Bi-Kappa Noise for Wireless Sensor Networks

2013 ◽  
Vol 330 ◽  
pp. 957-960
Author(s):  
Qiao Ling Du ◽  
Zhi Rui Wang ◽  
Yu Pei ◽  
Yi Ding Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Performance Analysis ◽  
Error Rate ◽  
Fading Channel ◽  
Rayleigh Fading ◽  
Symbol Error Rate ◽  
Wireless Sensor ◽  
Channel Simulation ◽  
Simulation Results

This paper investigates the performance analysis of OQPSK in HF band for wireless sensor networks. An analytical model for getting symbol error rate (SER) is given in presence of Bi-Kappa noise in HF band. And the SER of OQPSK is given in AWGN and Rayleigh fading channel. Simulation results HF noise as Bi-Kappa noise should be investigated in HF band for WSN.

scholarly journals Secure and Robust 3D Localization in Wireless Sensor Networks

2019 ◽  
Vol 9 (1S) ◽  
pp. 104-111
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Malicious Nodes ◽  
3D Localization ◽  
Secure Localization ◽  
Simulation Results ◽  
Two Phases

The fundamental capacity of a sensor system is to accumulate and forward data to the destination. It is crucial to consider the area of gathered data, which is utilized to sort information that can be procured using confinement strategy as a piece of Wireless Sensor Networks (WSNs).Localization is a champion among the most basic progressions since it agreed as an essential part in various applications, e.g., target tracking. If the client can't gain the definite area information, the related applications can't be skillful. The crucial idea in most localization procedures is that some deployed nodes with known positions (e.g., GPS-equipped nodes) transmit signals with their coordinates so as to support other nodes to localize themselves. This paper mainly focuses on the algorithm that has been proposed to securely and robustly decide thelocation of a sensor node. The algorithm works in two phases namely Secure localization phase and Robust Localization phase. By "secure", we imply that malicious nodes should not effectively affect the accuracy of the localized nodes. By “robust”, we indicate that the algorithm works in a 3D environment even in the presence of malicious beacon nodes. The existing methodologies were proposed based on 2D localization; however in this work in addition to security and robustness, exact localization can be determined for 3D areas by utilizing anefficient localization algorithm. Simulation results exhibit that when compared to other existing algorithms, our proposed work performs better in terms of localization error and accuracy.

scholarly journals Implementation of Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks

2021 ◽  
pp. 664-670
Author(s):  
Manoshri A. Ghawade ◽  
Dr. Sheetal S. Dhande
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Practical Interest ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks ◽  
Multiple Sensor ◽  
Simulation Results ◽  
Multiple Sensing

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. In this paper, we consider this issue according to heterogeneous WSN models. Furthermore, we consider two sensing detection models: single-sensing detection and multiple-sensing detection... Our simulation results show the advantage of multiple sensor heterogeneous WSNs.

scholarly journals Overview of DOS attacks on wireless sensor networks and experimental results for simulation of interference attacks

2018 ◽  
Vol 38 (1) ◽  
pp. 130-138 ◽  
Author(s):  
Željko Gavrić ◽  
Dejan Simić
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Denial Of Service ◽  
Wireless Sensor ◽  
Dos Attacks ◽  
Security Issue ◽  
Simulation Scenario ◽  
Simulation Results ◽  
Potential Methods

Wireless sensor networks are now used in various fields. The information transmitted in the wireless sensor networks is very sensitive, so the security issue is very important. DOS (denial of service) attacks are a fundamental threat to the functioning of wireless sensor networks. This paper describes some of the most common DOS attacks and potential methods of protection against them. The case study shows one of the most frequent attacks on wireless sensor networks – the interference attack. In the introduction of this paper authors assume that the attack interference can cause significant obstruction of wireless sensor networks. This assumption has been proved in the case study through simulation scenario and simulation results.

E-VEDGE

2020 ◽  
pp. 1538-1556
Author(s):  
Mira Rani Debbarma ◽  
Sangita Rani Bhowmik ◽  
Abhishek Majumder
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Delaunay Triangulation ◽  
Critical Issue ◽  
Wireless Sensor ◽  
Voronoi Polygon ◽  
Maximum Coverage ◽  
Minimization Technique ◽  
Simulation Results

Hole minimization in wireless sensor networks is a critical issue. In the presence of obstacles, the issue becomes much more challenging. In this article, a hole minimization technique named enhanced VEDGE (E-VEDGE) has been proposed. The scheme uses both the Voronoi polygon and Delaunay triangulation so that it can work efficiently in presence of obstacle. The proposed scheme, along with two other existing schemes namely: VEDGE and the Delaunay Triangulation-Score (DT-Score) has been simulated. Simulation results show that while the proposed E-VEDGE provides a maximum coverage of 95% to 96.8%, VEDGE and DT-Score provide maximum coverage of 89% to 92.5% and 86% to 87%, respectively.

E-VEDGE

2018 ◽  
Vol 9 (4) ◽  
pp. 54-74 ◽  
Author(s):  
Mira Rani Debbarma ◽  
Sangita Rani Bhowmik ◽  
Abhishek Majumder
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Delaunay Triangulation ◽  
Critical Issue ◽  
Wireless Sensor ◽  
Voronoi Polygon ◽  
Maximum Coverage ◽  
Minimization Technique ◽  
Simulation Results

Hole minimization in wireless sensor networks is a critical issue. In the presence of obstacles, the issue becomes much more challenging. In this article, a hole minimization technique named enhanced VEDGE (E-VEDGE) has been proposed. The scheme uses both the Voronoi polygon and Delaunay triangulation so that it can work efficiently in presence of obstacle. The proposed scheme, along with two other existing schemes namely: VEDGE and the Delaunay Triangulation-Score (DT-Score) has been simulated. Simulation results show that while the proposed E-VEDGE provides a maximum coverage of 95% to 96.8%, VEDGE and DT-Score provide maximum coverage of 89% to 92.5% and 86% to 87%, respectively.

Weight Selection and PSO Based Three-Dimensional Localization for Wireless Sensor Networks

2013 ◽  
Vol 427-429 ◽  
pp. 2540-2544 ◽  
Author(s):  
Jia Liang Lv ◽  
Ying Long Wang ◽  
Huan Qing Cui ◽  
Nuo Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Optimization Problem ◽  
Three Dimensional ◽  
Wireless Sensor ◽  
Swarm Optimization ◽  
Localization Algorithms ◽  
Key Technologies ◽  
Simulation Results

Localization is one of the key technologies of wireless sensor networks, and the problem of localization is always formulated as an optimization problem. Particle swarm optimization (PSO) is easy to implement and requires moderate computing resources, which is feasible for localization of sensor networks. To improve the efficiency and precision of PSO-based localization methods, this paper proposes a novel three-dimensional PSO method based on weight selection (WSPSO). Simulation results show that the proposed method outperforms standard PSO and existing localization algorithms.

scholarly journals Online fault diagnosis of wireless sensor networks

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Diagnosis ◽  
Wireless Sensor ◽  
Transient Faults ◽  
Intermittent Faults ◽  
Detection Latency ◽  
Time Redundancy ◽  
Simulation Results ◽  
Time And Energy

AbstractThis paper proposes an adaptive online distributed solution for fault diagnosis in wireless sensor networks (WSNs). Fault diagnosis is achieved by comparing the heartbeat message generated by neighboring nodes and dissemination of decision made at each node. Time redundancy is used to detect the intermittent faults since an intermittent fault will not occur consistently. The diagnosis performance degradation due to intermittent faults in sensing and transient faults in communication is analyzed. A near optimal trade-off between detection latency and number of tests required to detect intermittent faults is obtained. Simulation results are provided and they show that this work performs better, from both time and energy complexity viewpoint.

Sign in / Sign up

Export Citation Format

Share Document