Location awareness enables autonomous commissioning in wireless sensor networks

2016 ◽  
Author(s):  
Stijn Crul ◽  
Geoffrey Ottoy ◽  
Lieven De Strycker
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Location Awareness

scholarly journals Hybrid Training with Binary Search Protocol for Wireless Sensor Networks

2007 ◽  
Vol 3 (3-4) ◽  
pp. 233-249 ◽  
Author(s):  
Ruzana Ishak ◽  
Qingwen Xu ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Binary Search ◽  
Wireless Sensor ◽  
Training Procedure ◽  
Location Awareness ◽  
Distributed Sensor ◽  
Number Of Cycles ◽  
And Training ◽  
Training Protocol

Locationing problem in Wireless Sensor Networks(WSNs) can be viewed as a general distributed sensor problem. It is with sensors that can discover other nodes or estimate ranges between nodes, that serve as position references. In this paper, we show that sensors acquire coarse-grain location awareness by the training protocol. The training protocol which hybrids the synchronization and training procedure. In this protocol, synchronization and training are combined into one scheme. The sink node sends two beacons in each slot instead of one. In the training, sensor searching for its location using a binary search scheme. Our simulation results shown less number of cycles needed for training.

scholarly journals Survey on Multi Agent Energy Efficient Clustering Algorithms in Wireless Sensor Networks

2014 ◽  
Vol 3 (3) ◽  
pp. 172-184
Author(s):  
Nazli Bagherzadeh karimi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Awareness ◽  
Multi Agent ◽  
Energy Efficient Clustering

In the last few years, there are many applications for Wireless Sensor Networks (WSNs). One of the main drawbacks of these networks is the limited battery power of sensor nodes. There are many cases to reduce energy consumption in WSNs. One of them is clustering. Sensor nodes partitioned into the clusters so that one is chosen as Cluster Head (CH). Clustering and selection of the proper node as CH is very significant in reducing energy consumption and increasing network lifetime. In this paper, we have surveyed a multi agent clustering algorithms and compared on various parameters like cluster size, cluster count, clusters equality, parameters used in CHs selection, algorithm complexity, types of algorithm used in clustering, nodes location awareness, inter-cluster and intra-cluster topologies, nodes homogeneity and MAC layer communications.

Localization Algorithms and Strategies for Wireless Sensor Networks

2009 ◽  
pp. 54-95 ◽  
Author(s):  
Ferit Ozan Akgul ◽  
Mohammad Heidari ◽  
Nayef Alsindi ◽  
Kaveh Pahlavan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Channel ◽  
Wireless Sensor ◽  
Location Awareness ◽  
Positioning Systems ◽  
Localization Algorithms ◽  
Physical Limitations ◽  
And Performance ◽  
Performance Results

This chapter discusses localization in WSNs specifically focusing on the physical limitations imposed by the wireless channel. Location awareness and different methods for localization are discussed. Particular attention is given to indoor TOA based ranging and positioning systems. Various aspects of WSN localization are addressed and performance results for cooperative schemes are presented.

scholarly journals Regularized Least Square Multi-hops Localization Algorithm for wireless sensor networks

2021 ◽  
Author(s):  
Hend Liouane ◽  
Sana Messous ◽  
Omar Cheikhrouhou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Connectivity ◽  
Least Square ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Awareness ◽  
Localization Algorithm ◽  
Multihop Wireless ◽  
Localization Accuracy

Abstract Multi-hop localization is a an important technique for Wireless Sensor Networks. Location awareness is very crucial for almost existing sensor network applications. However, using Global Positioning System (GPS) receivers to every node is very expensive. Therefore, the Distance Vector-Hop algorithm (DV-Hop) is proposed and very famous for its simplicity and localization accuracy for Wireless Sensor Networks. The cited algorithm uses a small number of anchor nodes, which are equipped with GPS, thus their locations are known, while other nodes estimate their location from the network connectivity information. However, DV-Hop presents some deficiencies and drawbacks in terms of localization accuracy. Therefore, we propose in this paper an improvement of DV-Hop algorithm, called Regularized Least Square DV-Hop Localization Algorithm for multihop wireless sensors networks. The proposed solution improves the location accuracy of sensor nodes within their sensing field in both isotropic and anisotropic networks. Simulation results prove that the proposed algorithm outperforms the original DV-Hop algorithm with up to 60%, as well as other related works, in terms of localization accuracy.

Sign in / Sign up

Export Citation Format

Share Document