scholarly journals Discrete Path Selection and Entropy Based Sensor Node Failure Detection in Wireless Sensor Networks

2016 ◽  
Vol 16 (3) ◽  
pp. 137-153 ◽  
Author(s):  
K. Spoorthi ◽  
Saha Snehanshu ◽  
Mathur Archana
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Low Cost ◽  
Failure Detection ◽  
Path Selection ◽  
Wireless Sensor ◽  
Sensing Model ◽  
Cost Efficient ◽  
Almost All

Abstract Exertion of wireless sensor networks has been increasing in recent years, and it imprints in almost all the technologies such as machine industry, medical, military and civil applications. Due to rapid growth in electronic fabrication technology, low cost, efficient, multifunctional and accurate sensors can be produced and thus engineers tend to incorporate many sensors in the area of deployment. As the number of sensors in the field increases, the probability of failure committed by these sensors also increases. Hence, efficient algorithms to detect and recover the failure of sensors are paramount. The current work concentrates mainly on mechanisms to detect sensor node failures on the basis of the delay incurred in propagation and also the energy associated with sensors in the field of deployment. The simulation shows that the algorithm plays in the best possible way to detect the failure in sensors. Finally, the Boolean sensing model is considered to calculate the network coverage of the wireless sensor network for various numbers of nodes in the network.

scholarly journals An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 1831 ◽  
Author(s):  
Yu-Ning Chen ◽  
Wu-Hsiung Lin ◽  
Chiuyuan Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Detection Probability ◽  
Sensor Node ◽  
Fundamental Problem ◽  
Wireless Sensor ◽  
Sensor Deployment ◽  
Sensing Model ◽  
Definition Of ◽  
Probabilistic Sensing Model

The coverage problem is a fundamental problem for almost all applications in wireless sensor networks (WSNs). Many applications even impose the requirement of multilevel (k) coverage of the region of interest (ROI). In this paper, we consider WSNs with uncertain properties. More precisely, we consider WSNs under the probabilistic sensing model, in which the detection probability of a sensor node decays as the distance between the target and the sensor node increases. The difficulty we encountered is that there is no unified definition of k-coverage under the probabilistic sensing model. We overcome this difficulty by proposing a “reasonable” definition of k-coverage under such a model. We propose a sensor deployment scheme that uses less number of deployed sensor nodes while ensuring good coverage qualities so that (i) the resultant WSN is connected and (ii) the detection probability satisfies a predefined threshold p th , where 0 < p th < 1 . Our scheme uses a novel “zone 1 and zone 1–2” strategy, where zone 1 and zone 2 are a sensor node’s sensing regions that have the highest and the second highest detection probability, respectively, and zone 1–2 is the union of zones 1 and 2. The experimental results demonstrate the effectiveness of our scheme.

scholarly journals Approximate K-Coverage Configuration in WirelessSensor Networks

2011 ◽  
pp. 262-267
Author(s):  
Prasan Kumar Sahoo ◽  
Meng Chun Wueng ◽  
I Shyan Hwang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Low Cost ◽  
Computational Cost ◽  
Deterministic Algorithm ◽  
Wireless Sensor ◽  
Monitoring Task ◽  
Ace Algorithm

The K-coverage configuration is widely exploited to guarantee the surveillance quality of applications on wireless sensor networks. To prolong the system lifetime, a sensor node is determined to sleep if its sensing range is already K-covered. Many K-coverage configuration algorithms in literature cannot satisfy the requirements of high quality and low cost simultaneously. In this paper, we propose an efficient K-coverage eligibility algorithm, which determines the eligibility of each sensor node at very low cost. The distinct feature of the ACE algorithm is to discover the regions with lower coverage degree of each sensor node. Experimental results show that the accuracy of the ACE algorithm is guaranteed to be higher than 90%, while its computational cost is only 11% of a well-known deterministic algorithm. The ACE algorithm is suitable to be used for a long-term monitoring task on wireless sensor networks.

scholarly journals Wireless sensor networks and structural health monitoring: Experiences with slab track infrastructures

2019 ◽  
Vol 15 (3) ◽  
pp. 155014771982600 ◽  
Author(s):  
Eduardo Cañete ◽  
Jaime Chen ◽  
Manuel Díaz ◽  
Luis Llopis ◽  
Bartolomé Rubio
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
High Speed ◽  
Low Cost ◽  
Failure Detection ◽  
Relevant Information ◽  
Wireless Sensor ◽  
Communication Architecture ◽  
Slab Track ◽  
Structural Health

Slab track systems have the potential to become a more sustainable option for high-speed railway infrastructures than traditional ballasted tracks. Traditionally, the systems that monitor these infrastructures have been costly, but advances in the last few decades have made the use of wireless sensor networks within these infrastructures a feasible solution that can be used to evaluate their degradation for failure detection and prediction. Since the cost of these systems is steadily decreasing, it is now possible to use permanent wireless sensor networks as an integral part of the overall system to pave the way for smart infrastructures that can get real-time information about the structural health of the infrastructure at a relatively low cost. In order to show the suitability of this kind of system to monitor the structural health, three demonstrators, developed in the context of the FASTRACK project, related to the design and construction of a monitoring system for slab track systems that measures vibrations and displacements in the track, are presented. FASTRACK uses an innovative approach where data read by sensors are sent to passing trains, which are used as data mules to upload the information to a remote server. On arrival at the station, the data are stored in a database, which is queried by an application to extract relevant information by means of analysis algorithms to detect and predict failures. The first real scenario tests the limits of the system under stress situations. The second one tests the system in an actual, installed slab track to analyze the suitability of the communication architecture and to study a transition zone between slab tracks to a ballast track. The last scenario deals with the data mule performance tests.

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.

scholarly journals A Low-Cost Jamming Detection Approach Using Performance Metrics in Cluster-Based Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1179
Author(s):  
Carolina Del-Valle-Soto ◽  
Carlos Mex-Perera ◽  
Juan Arturo Nolazco-Flores ◽  
Alma Rodríguez ◽  
Julio C. Rosas-Caro ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Performance Metrics ◽  
Low Cost ◽  
Detection Algorithm ◽  
Anomalous Behavior ◽  
Wireless Sensor ◽  
Jamming Detection ◽  
Minimal Energy Expenditure

Wireless Sensor Networks constitute an important part of the Internet of Things, and in a similar way to other wireless technologies, seek competitiveness concerning savings in energy consumption and information availability. These devices (sensors) are typically battery operated and distributed throughout a scenario of particular interest. However, they are prone to interference attacks which we know as jamming. The detection of anomalous behavior in the network is a subject of study where the routing protocol and the nodes increase power consumption, which is detrimental to the network’s performance. In this work, a simple jamming detection algorithm is proposed based on an exhaustive study of performance metrics related to the routing protocol and a significant impact on node energy. With this approach, the proposed algorithm detects areas of affected nodes with minimal energy expenditure. Detection is evaluated for four known cluster-based protocols: PEGASIS, TEEN, LEACH, and HPAR. The experiments analyze the protocols’ performance through the metrics chosen for a jamming detection algorithm. Finally, we conducted real experimentation with the best performing wireless protocols currently used, such as Zigbee and LoRa.

Sign in / Sign up

Export Citation Format

Share Document