A Singular Value Decomposition Based Upgraded DV-Hop Localization Algorithm for Wireless Sensor Networks

A Singular Value Decomposition Based Upgraded DV-Hop Localization Algorithm for Wireless Sensor Networks

Aarti Jain (Ambedkar Institute of Advanced Communication Technologies and Research, New Delhi, India)
Copyright: © 2020 |Pages: 20
DOI: 10.4018/IJKBO.2020010104

Abstract

Finding the location of unknown nodes using a computationally inexpensive range-free localization method is one of the most popular research areas in wireless sensor networks (WSNs). DV-hop localization is one of the most popular and localization methods in WSNs. In this article, the authors propose an upgraded DV-Hop based localization method that provides better location accuracy along with minimal computational complexity. In the proposed method, the second step of DV-Hop algorithm is modified by improving the effective average hop size and the third step of DV-Hop is modified to enhance the localization accuracy by minimizing the ranging errors. The said minimization of ranging errors has been achieved by using singular value decomposition-based estimation method. The authors have compared the upgraded DV-Hop localization method with original DV-Hop localization method as well as with improved versions of DV-Hop localization method. The simulation results show that the proposed method has less computational complexity and high location accuracy than the compared methods.
Article Preview
Top

Introduction

WSNs comprise a large number of nodes, each of which integrates with one or more sensors, a processing subsystem and a radio transceiver (Akyildiz, Su, Sankarasubramaniam, & Cayirci, 2002). They are randomly deployed in a monitored and controlled area and are responsible for real time information collection, processing and transmission. Sensor nodes in WSNs are small in size and having low computational and communication capabilities. In most of the applications of these kinds of networks, nodes are deployed randomly without any central assistance (Bakhouya & Gaber, 2008; Platonov, & Bergman, 2011; Sabooret, Hörbst, & Ammenwerth, 2013).

In WSNs, the information collected by sensor nodes is required to be transmitted to the base station directly (single hop) or with the help of intermediate nodes (multi hop). For efficient data transmission, most of the applications require location information of the sender node (Jain, 2017). Moreover, location information (Stoleru, He, Mathiharan, George, & Stankovic, 2012; Targowski, 2014) is indispensable in most commonly used geography-based routing protocols and for implementing efficient MAC layer protocols. To estimate the location of a sensor node, Global Positioning System (GPS) (Nait-Sidi-Moh, Bakhouya, Gaber, & Wack, 2013) hardware can be attached to each sensor node. But the use of GPS in each sensor node makes network expensive and also a GPS equipped sensor node will result in more power consumption and is comparatively larger in size. Thus, it is not practically feasible to equip all the nodes with GPS. However, the use of few GPS equipped nodes i.e. as anchor nodes, to assist the other normal nodes in finding their location is practically viable and has been successfully used in several localization methods (Han et al., 2016).

In literature, under the constraints of WSNs, the localization of nodes has been addressed by various range based and range free localization algorithms (Yun, Lee, Chung, Kim, & Kim, 2009). The range-based algorithms are the methods that use point to point distance estimates or orientation information between neighbor nodes for localization. They provide higher location accuracy but require additional hardware for measurement of distance or angle information. However, range free algorithms do not need absolute distance or orientation information between the nodes (Singh & Khilar, 2017). They estimate the location of the nodes through network connectivity and with the help of anchor nodes (nodes having their own location information). The range free localization algorithms provide cost effective localization methods, but the results are less precision and accuracy. However, constrained WSNs adopt range free localization methods as the most preferred localization solution and research is in progress to further improve localization accuracy achieved by these algorithms. Some typical range free algorithms are Approximate Point in Triangle (APIT) (He, Huang, Blum, Stankovic, & Abdelzaher, 2003), Mid Perpendicular (Singh & Khilar, 2017), Distance Vector-Hop (DV-Hop) (Niculescu & Nath, 2001).

In range free algorithms, DV-Hop is the most popular method. DV-Hop is a distributed, hop-by-hop positioning algorithm. The algorithm is a three steps procedure viz. (1) acquiring hop count between anchor nodes, (2) calculating average hop size and finally, location of sensor nodes are estimated by trilateration method (Niculescu & Nath, 2001; Asmaa, Hatim, & Abdelaaziz, 2014). DV-Hop is one of the simplest, cost effective and scalable algorithms with high coverage quality. But localization error in DV-Hop algorithm is very high due to presence of ranging errors. In literature, several modifications to DV-Hop algorithm are proposed and research is still in progress to reduce computational complexity and increase the localization accuracy.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2020): 1 Released, 3 Forthcoming
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing