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.

Wireless Sensor Networks Deployment Based on Monte Carlo Method

2014 ◽  
Vol 568-570 ◽  
pp. 573-576
Author(s):  
Qiang Wei Xin ◽  
Ding Yi Fang
Keyword(s):  
Wireless Sensor Networks ◽  
Monte Carlo ◽  
Sensor Networks ◽  
Monte Carlo Method ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Node Deployment ◽  
Monitoring Task ◽  
Accuracy Requirement ◽  
Algorithm Base

How to use the least nodes to complete the monitoring task is an important problem about deploying in wireless sensor networks (WSN). We present MBT algorithm, base on Monte Carlo method combines the edge betweenness and signal transition distance, in order to study sensor node deployment problem. The proposed algorithm of sensor node deployment can meet the demand or the monitoring accuracy requirement of the premise, and reduce the number of nodes. Simulation experiments show that MBT algorithm can reduce the required nodes of deploying.

scholarly journals The effects of LT-SN on energy dissipation and lifetime in wireless sensor networks

2016 ◽  
Vol 7 (1) ◽  
pp. 50-58
Author(s):  
Zeydin Pala
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Low Cost ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sleep Mode ◽  
Security Vulnerabilities ◽  
Waking Up

Wireless sensor networks (WSNs) still attract the attention of researchers, users and the private sector despite their low power and low range tendency for malfunction. This attraction towards WSNs results from their low cost structure and the solutions they offer for many prevalent problems. Many conditions, which remain unforeseen or unexpected during the design of the system, may arise after the initialization of the system. Similarly, many situations where security vulnerabilities take place may emerge in time in WSNs operating normally. In this study, we called nodes which enter sleeping mode without any further waking up and causing a sparser number of nodes in the network without any function in data transmission as Long-Term Sleep Nodes (LT-SN); and considered energy spaces caused by such nodes as a problem; and established two Linear Programming (LP) models based on the efficiency of the present nodes. We offered two different models which present the effect of sensor nodes, which were initially operating in wireless sensor network environment and did not wake up following sleep mode, on network lifetime. The results of the present study report that as the number of LT-SN increases, the lifetime of the network decreases.

scholarly journals Distributed Multi-Scale Calibration of Low-Cost Ozone Sensors in Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2503 ◽  
Author(s):  
Jose M. Barcelo-Ordinas ◽  
Pau Ferrer-Cid ◽  
Jorge Garcia-Vidal ◽  
Anna Ripoll ◽  
Mar Viana
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Low Cost ◽  
Wireless Sensor ◽  
Multi Scale ◽  
Ozone Concentrations ◽  
Linear Correction ◽  
Scale Calibration ◽  
Kriging Estimation

New advances in sensor technologies and communications in wireless sensor networks have favored the introduction of low-cost sensors for monitoring air quality applications. In this article, we present the results of the European project H2020 CAPTOR, where three testbeds with sensors were deployed to capture tropospheric ozone concentrations. One of the biggest challenges was the calibration of the sensors, as the manufacturer provides them without calibrating. Throughout the paper, we show how short-term calibration using multiple linear regression produces good calibrated data, but instead produces biases in the calculated long-term concentrations. To mitigate the bias, we propose a linear correction based on Kriging estimation of the mean and standard deviation of the long-term ozone concentrations, thus correcting the bias presented by the sensors.

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.

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.

scholarly journals A Data-Based Fault-Detection Model for Wireless Sensor Networks

2019 ◽  
Vol 11 (21) ◽  
pp. 6171 ◽  
Author(s):  
Jangsik Bae ◽  
Meonghun Lee ◽  
Changsun Shin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Data Transmission ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sensors And Actuators ◽  
Detection Model ◽  
Management Platform

With the expansion of smart agriculture, wireless sensor networks are being increasingly applied. These networks collect environmental information, such as temperature, humidity, and CO2 rates. However, if a faulty sensor node operates continuously in the network, unnecessary data transmission adversely impacts the network. Accordingly, a data-based fault-detection algorithm was implemented in this study to analyze data of sensor nodes and determine faults, to prevent the corresponding nodes from transmitting data; thus, minimizing damage to the network. A cloud-based “farm as a service” optimized for smart farms was implemented as an example, and resource management of sensors and actuators was provided using the oneM2M common platform. The effectiveness of the proposed fault-detection model was verified on an integrated management platform based on the Internet of Things by collecting and analyzing data. The results confirm that when a faulty sensor node is not separated from the network, unnecessary data transmission of other sensor nodes occurs due to continuous abnormal data transmission; thus, increasing energy consumption and reducing the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document