scholarly journals A Weighted and Distributed Algorithm for Range-Based Multi-Hop Localization Using a Newton Method

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2324
Author(s):  
Jose Diaz-Roman ◽  
Boris Mederos ◽  
Ernesto Sifuentes ◽  
Rafael Gonzalez-Landaeta ◽  
Juan Cota-Ruiz
Keyword(s):  
Distributed Algorithm ◽  
Scaling Factor ◽  
Sensor Nodes ◽  
Network Robustness ◽  
Wireless Sensor ◽  
Distance Measurements ◽  
Weighted Function ◽  
Localization Method ◽  
Anisotropic Networks ◽  
Newton Scheme

Wireless sensor networks are used in many location-dependent applications. The location of sensor nodes is commonly carried out in a distributed way for energy saving and network robustness, where the handling of these characteristics is still a great challenge. It is very desirable that distributed algorithms invest as few iterations as possible with the highest accuracy on position estimates. This research proposes a range-based and robust localization method, derived from the Newton scheme, that can be applied over isotropic and anisotropic networks in presence of outliers in the pair-wise distance measurements. The algorithm minimizes the error of position estimates using a hop-weighted function and a scaling factor that allows a significant improvement on position estimates in only few iterations. Simulations demonstrate that our proposed algorithm outperforms other similar algorithms under anisotropic networks.

Dynamic Function Alternation to Realize Robust Wireless Sensor Network

2012 ◽  
Vol 3 (3) ◽  
pp. 17-34 ◽  
Author(s):  
Toshiaki Miyazaki
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Distributed Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network System ◽  
Dynamic Function ◽  
Disaster Monitoring

In this paper, a distributed algorithm to realize a dynamic function alternation is proposed. The algorithm enables sensor nodes to take over the damaged functions of their neighboring sensor nodes automatically in a wireless sensor network. After describing the concept of the function alternation, the algorithm is explained in detail with some evaluation results. Comparing the results obtained using the proposed algorithm with those obtained using non-function alternation methods shows that the proposed algorithm makes the initial functionality of each sensor function sustainable even if some sensor nodes are damaged. A wireless sensor network system dedicated to disaster monitoring is also introduced, as an application of the proposed function alternation algorithm.

scholarly journals Indoor Localization by using Particle Filtering Approach with Wireless Sensor Nodes

2013 ◽  
Vol 9 (1) ◽  
pp. 74
Author(s):  
Hakan Koyuncu ◽  
Ahmet Çevik
Keyword(s):  
Particle Filtering ◽  
Indoor Localization ◽  
Propagation Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distance Measurements ◽  
Wireless Sensor Nodes ◽  
Object Distance ◽  
Object Locations ◽  
Current Estimation

Jennic type wireless sensor nodes are utilized together with a novel particle filtering technique for indoor localization. Target objects are localized with an accuracy of around 0.25 meters. The proposed technique introduces a new particle generation and distribution technique to improve current estimation of object positions. Particles are randomly distributed around the object in the sensing area within a circular strip of 2 STD of object distance measurements. Particle locations are related to object locations by using Gaussian weight distribution methods. Object distances from the transmitters are determined by using received RSSI values and ITU-R indoor propagation model. Measured object distances are used together with the particle distances from the transmitters to predict the object locations.

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.

scholarly journals A Sub-A Ultrasonic Wake-Up Trigger with Addressing Capability for Wireless Sensor Nodes

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Emanuele Lattanzi ◽  
Matteo Dromedari ◽  
Valerio Freschi ◽  
Alessandro Bogliolo
Keyword(s):  
Degrees Of Freedom ◽  
State Diagram ◽  
Propagation Speed ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dynamic Power Management ◽  
Distance Measurements ◽  
Wireless Sensor Nodes ◽  
Ultra Low Power ◽  
Ultrasonic Signals

Wireless sensor nodes spend most of the time waiting either for sensed data or for packets to be routed to the sink. While on board, sensors can raise hardware interrupts to trigger the wake-up of the processor, incoming packets require the radio module to be turned on in order to be properly received and processed; thus, reducing the effectiveness of dynamic power management and exposing the node to unintended packets cause energy waste. The capability of triggering the wake-up of a node over the air would makes it possible to keep the entire network asleep and to wake up the nodes along a path to the sink whenever there is a packet to transmit. This paper presents an ultrasonic wake-up trigger for ultra-low-power wireless sensor nodes developed as a plug-in module for VirtualSense motes. The module supports a simple out-of-band addressing scheme to enable the selective wake-up of a target node. In addition, it makes it possible to exploit the propagation speed of ultrasonic signals to perform distance measurements. The paper outlines the design choices, reports the results of extensive measurements, and discusses the additional degrees of freedom introduced by ultrasonic triggering in the power-state diagram of VirtualSense.

An Anchor Selection Algorithm in Wireless Sensor Network

2013 ◽  
Vol 380-384 ◽  
pp. 3962-3965
Author(s):  
Qiang Chang ◽  
Hong Tao Hou ◽  
Xiang Hui Zeng ◽  
Qun Li ◽  
Wei Ping Wang
Keyword(s):  
Distributed Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Selection Algorithm ◽  
Computation Complexity ◽  
Precise Location ◽  
Localization Accuracy ◽  
Resource Limited ◽  
Proper Number ◽  
Anchor Nodes

Wireless sensor networks consist of two kinds of nodes: the anchor and the Agent. The anchor is equipped with special hardware to obtain precise location information and employed to derive the locations of Agents. Due to the resource-limited nature of single sensors, actively participating nodes should be kept to a proper number. Based on an investigation on the trade-off between the localization accuracy and the computation complexity of sensor nodes, we propose a distributed algorithm to select subsets of anchor nodes for localization and analyze this algorithm regarding the energy consumption of every node.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Deterministic Deployment for Wireless Image Sensor Nodes

2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Visual Information ◽  
Image Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Effective Coverage ◽  
Area Of Interest ◽  
Key Issues

Wireless sensor networks composed of camera enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. The node deployment is one of the key issues in the application of wireless sensor networks. In this paper, we take the effective coverage and connectivity as the evaluation indices to analyze the effect of the perceivable angle and the ratio of communication radius and sensing radius for the deterministic circular deployment. Experimental results demonstrate that the effective coverage area of the triangle deployment is the largest when using the same number of nodes. When the nodes are deployed in the same monitoring area in the premise of ensuring connectivity, rhombus deployment is optimal when √2 < rc / rs < √3 . The research results of this paper provide an important reference for the deployment of the image sensor networks with the given parameters.

Sign in / Sign up

Export Citation Format

Share Document