scholarly journals Distributed Beacon Drifting Detection for Localization in Unstable Environments

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Ming Xia ◽  
Peiliang Sun ◽  
Xiaoyan Wang ◽  
Yan Jin ◽  
Qingzhang Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Detection Algorithm ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Detection Accuracy ◽  
Research Issue ◽  
Fundamental Research

Localization is a fundamental research issue in wireless sensor networks (WSNs). In most existing localization schemes, several beacons are used to determine the locations of sensor nodes. These localization mechanisms are frequently based on an assumption that the locations of beacons are known. Nevertheless, for many WSN systems deployed in unstable environments, beacons may be moved unexpectedly; that is, beacons are drifting, and their location information will no longer be reliable. As a result, the accuracy of localization will be greatly affected. In this paper, we propose a distributed beacon drifting detection algorithm to locate those accidentally moved beacons. In the proposed algorithm, we designed both beacon self-scoring and beacon-to-beacon negotiation mechanisms to improve detection accuracy while keeping the algorithm lightweight. Experimental results show that the algorithm achieves its designed goals.

scholarly journals An Adaptive Approach to Discriminate the Persistence of Faults in Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Mohan Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Detection Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transient Fault ◽  
Intermittent Faults ◽  
Parametric Fault ◽  
Simulation Results

This paper presents a parametric fault detection algorithm which can discriminate the persistence (permanent, intermittent, and transient) of faults in wireless sensor networks. The main characteristics of these faults are the amount the fault appears. We adopt this state-holding time to discriminate transient from intermittent faults. Neighbor-coordination-based approach is adopted, where faulty sensor nodes are detected based on comparisons between neighboring nodes and dissemination of the decision made at each node. Simulation results demonstrate the robustness of the work at varying transient fault rate.

scholarly journals Efficient Location Service for a Mobile Sink in Solar-Powered Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (2) ◽  
pp. 272 ◽  
Author(s):  
Minjae Kang ◽  
Ikjune Yoon ◽  
Dong Noh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Position Information ◽  
Location Service ◽  
Surplus Energy ◽  
Solar Powered

By utilizing mobile sinks in wireless sensor networks (WSNs), WSNs can be deployed in more challenging environments that cannot connect with the Internet, such as those that are isolated or dangerous, and can also achieve a balanced energy consumption among sensors which leads to prolonging the network lifetime. However, an additional overhead is required to check the current location of the sink in order for a node to transmit data to the mobile sink, and the size of the overhead is proportional to that of the network. Meanwhile, WSNs composed of solar-powered nodes have recently been actively studied for the perpetual operation of a network. This study addresses both of these research topics simultaneously, and proposes a method to support an efficient location service for a mobile sink utilizing the surplus energy of a solar-powered WSN. In this scheme, nodes that have a sufficient energy budget can constitute rings, and the nodes belonging to these rings (which are called ring nodes) maintain up-to-date location information on the mobile sink node and serve this information to the other sensor nodes. Because each ring node only uses surplus energy to serve location information, this does not affect the performance of a node’s general operations (e.g., sensing, processing, and data delivery). Moreover, because multiple rings can exist simultaneously in the proposed scheme, the overhead for acquiring the position information of the sink can be significantly reduced, and also hardly increases even if the network size becomes larger.

Sampling Sensor Nodes to Extend the Longevity of Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 53-63
Author(s):  
Mohammed Baqer ◽  
Luisella Balbis
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Smart Grids ◽  
Smart Cities ◽  
Sampling Rate ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
The Internet ◽  
Detection Accuracy

Background and Objective: Wireless Sensor Networks (WSN) are one of the most important elements in the Internet of Things (IoT) paradigm. It is envisaged that WSNs will seamlessly bridge the physical world with the Internet resulting in countless IoT applications in smart cities, wearable devices, smart grids, smart retails amongst others. It is necessary, however, to consider that sensing, processing and communicating large amounts of sensor data is an energy-demanding tasks. Recharging or replacing those battery-powered sensor nodes deployed in inaccessible locations is generally a tedious and time-consuming task. As a result, energy efficient approaches for WSN need to be devised in order to prolong the longevity of the network. Methods: In this paper, we present an approach that reduces energy consumption by controlling the sampling rate and the number of actively communicating nodes. The proposed approach applies compressive sensing to reduce the sampling rate and a statistical approach to decrease the sample size of sensor nodes. Results and Conclusion: The proposed approach is expected to significantly increase the lifetime of the network whilst maintaining the event detection accuracy.

scholarly journals Reputation-Based Secure Sensor Localization in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jingsha He ◽  
Jing Xu ◽  
Xingye Zhu ◽  
Yuqiang Zhang ◽  
Ting Zhang ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evaluation Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Sensor Localization ◽  
Security Scheme ◽  
Beacon Node ◽  
Untrusted Environments

Location information of sensor nodes in wireless sensor networks (WSNs) is very important, for it makes information that is collected and reported by the sensor nodes spatially meaningful for applications. Since most current sensor localization schemes rely on location information that is provided by beacon nodes for the regular sensor nodes to locate themselves, the accuracy of localization depends on the accuracy of location information from the beacon nodes. Therefore, the security and reliability of the beacon nodes become critical in the localization of regular sensor nodes. In this paper, we propose a reputation-based security scheme for sensor localization to improve the security and the accuracy of sensor localization in hostile or untrusted environments. In our proposed scheme, the reputation of each beacon node is evaluated based on a reputation evaluation model so that regular sensor nodes can get credible location information from highly reputable beacon nodes to accomplish localization. We also perform a set of simulation experiments to demonstrate the effectiveness of the proposed reputation-based security scheme. And our simulation results show that the proposed security scheme can enhance the security and, hence, improve the accuracy of sensor localization in hostile or untrusted environments.

scholarly journals FCS-MBFLEACH: Designing an Energy-Aware Fault Detection System for Mobile Wireless Sensor Networks

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 28 ◽  
Author(s):  
Shahaboddin Shamshirband ◽  
Javad Hassannataj Joloudari ◽  
Mohammad GhasemiGol ◽  
Hamid Saadatfar ◽  
Amir Mosavi ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Large Scale ◽  
Detection System ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Support Vector ◽  
Detection Accuracy ◽  
Classification Methods

Wireless sensor networks (WSNs) include large-scale sensor nodes that are densely distributed over a geographical region that is completely randomized for monitoring, identifying, and analyzing physical events. The crucial challenge in wireless sensor networks is the very high dependence of the sensor nodes on limited battery power to exchange information wirelessly as well as the non-rechargeable battery of the wireless sensor nodes, which makes the management and monitoring of these nodes in terms of abnormal changes very difficult. These anomalies appear under faults, including hardware, software, anomalies, and attacks by raiders, all of which affect the comprehensiveness of the data collected by wireless sensor networks. Hence, a crucial contraption should be taken to detect the early faults in the network, despite the limitations of the sensor nodes. Machine learning methods include solutions that can be used to detect the sensor node faults in the network. The purpose of this study is to use several classification methods to compute the fault detection accuracy with different densities under two scenarios in regions of interest such as MB-FLEACH, one-class support vector machine (SVM), fuzzy one-class, or a combination of SVM and FCS-MBFLEACH methods. It should be noted that in the study so far, no super cluster head (SCH) selection has been performed to detect node faults in the network. The simulation outcomes demonstrate that the FCS-MBFLEACH method has the best performance in terms of the accuracy of fault detection, false-positive rate (FPR), average remaining energy, and network lifetime compared to other classification methods.

scholarly journals An Information Entropy Based Event Boundary Detection Algorithm in Wireless Sensor Networks

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 537 ◽  
Author(s):  
Huafeng Wu ◽  
Qingshun Meng ◽  
Jiangfeng Xian ◽  
Xiaojun Mei ◽  
Christophe Claramunt ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Information Entropy ◽  
Large Scale ◽  
Boundary Detection ◽  
Detection Algorithm ◽  
Wireless Sensor ◽  
Detection Accuracy ◽  
Environment Monitoring ◽  
Event Boundary

Wireless Sensor Networks (WSNs) have been extensively applied in ecological environment monitoring. Typically, event boundary detection is an effective method to determine the scope of an event area in large-scale environment monitoring. This paper proposes a novel lightweight Entropy based Event Boundary Detection algorithm (EEBD) in WSNs. We first develop a statistic model using information entropy to figure out the probability that a sensor is a boundary sensor. The EEBD is independently executed on each wireless sensor in order to judge whether it is a boundary sensor node, by comparing the values of entropy against the threshold which depends on the boundary width. Simulation results demonstrate that the EEBD is computable and offers valuable detection accuracy of boundary nodes with both low and high network node density. This study also includes experiments that verify the EEBD which is applicable in a real ocean environmental monitoring scenario using WSNs.

An Improvement of LEACH Protocol Based on Motes’ Location Information

2010 ◽  
Vol 108-111 ◽  
pp. 1176-1181
Author(s):  
Yu Jiang ◽  
Yan Chun Liang ◽  
Li Li He ◽  
Ying Hui Cao ◽  
Cheng Quan Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Life Cycle ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Location Information ◽  
Leach Protocol ◽  
Entire Network

Network’s life cycle and the energy expending rates of mote are important performance criterions for wireless sensor networks (WSN). An improved routing protocol based on LEACH was proposed in this paper to prolong the network’s life cycle. The improved routing protocol took the circumstance into consideration, that is every mote knows the location information of its own and that of the base station. We analyzed that how to use these location information to extend the mote’s life cycle. And then the extension of the entire network life cycle was achieved. Simulation on the NS2-environment was conducted. And the experimental results show that the whole network’s life cycle was extended greatly.

scholarly journals Energy Efficient Distributed Fault Identification Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Meenakshi Panda ◽  
P. M. Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Fault Identification ◽  
Detection Accuracy ◽  
Identification Algorithm ◽  
Byzantine Faults ◽  
Fault Information

A distributed fault identification algorithm is proposed here to find both hard and soft faulty sensor nodes present in wireless sensor networks. The algorithm is distributed, self-detectable, and can detect the most common byzantine faults such as stuck at zero, stuck at one, and random data. In the proposed approach, each sensor node gathered the observed data from the neighbors and computed the mean to check whether faulty sensor node is present or not. If a node found the presence of faulty sensor node, then compares observed data with the data of the neighbors and predict probable fault status. The final fault status is determined by diffusing the fault information from the neighbors. The accuracy and completeness of the algorithm are verified with the help of statistical model of the sensors data. The performance is evaluated in terms of detection accuracy, false alarm rate, detection latency and message complexity.

scholarly journals Method for Detecting Manipulated Compilation of Sensing Reports in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Hae Young Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Base Stations ◽  
Wireless Sensor ◽  
Message Authentication ◽  
Security Attacks ◽  
Authentication Codes ◽  
Malicious Adversary

In cluster-based wireless sensor networks (WSNs), a few sensor nodes, including cluster heads (CHs), can be physically compromised by a malicious adversary. By using compromised CHs, the adversary can intentionally attach false message authentication codes into legitimate sensing reports in order to interrupt reporting of the real events. The existing solutions are vulnerable to such a type of security attacks, calledmanipulated compilation attacks(MCAs), since they assume that CHs are uncompromised. Thus, the reports manipulated by compromised CHs will be discarded by forwarding nodes or rejected at base stations, so that real events on the fields cannot be properly reported to the users. In this paper, the author proposes a method for the detection of MCAs in cluster-based WSNs. In the proposed method, every sensing report is collaboratively generated and verified by cluster nodes based on very loose synchronization. Once a cluster node has detected an MCA for a real event, it can reforward a legitimate report immediately. Therefore, the event can be properly reported to the users. The performance of the proposed method is shown with analytical and experimental results at the end of the paper.

Localization Security in Wireless Sensor Networks

2008 ◽  
pp. 617-627 ◽  
Author(s):  
Yawen Wei ◽  
Zhen Yu ◽  
Yong Guan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Malicious Attacks ◽  
Distance Measurements ◽  
Secure Localization ◽  
Comprehensive Survey ◽  
Hostile Environments

Localization of sensor nodes is very important for many applications proposed for wireless sensor networks (WSN), such as environment monitoring, geographical routing, and target tracking. Because sensor networks may be deployed in hostile environments, localization approaches can be compromised by many malicious attacks. The adversaries can broadcast corrupted location information; they can jam or modify the transmitting signals between sensors to mislead them to obtain incorrect distance measurements or nonexistent connectivity links. All these malicious attacks will cause sensors not able to or wrongly estimate their locations. In this chapter, we summarize the threat models and provide a comprehensive survey and taxonomy of existing secure localization and verification schemes for wireless sensor networks.

Sign in / Sign up

Export Citation Format

Share Document