Householder Algorithm Applied to Localization for Wireless Sensor Networks

Householder Algorithm Applied to Localization for Wireless Sensor Networks

Abderrahim Beni Hssane, Moulay Lahcen Hasnaoui, Said Benkirane, Driss El Ouadghiri, Mohamed Laghdir
Copyright: © 2012 |Pages: 13
DOI: 10.4018/jmcmc.2012010102
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Many applications in Wireless Sensor Networks (WSNs) must know the position of sensor nodes in the network. That is, information from the sensors is useful only if node location information is also available. Additionally, some routing protocols use position to determine viable routes. Several localization algorithms have been proposed which can be categorized as: range-based and range-free algorithms. In this paper, the authors propose an Optimized DV-Hop (ODV-Hop), a localization range-free algorithm. The authors have used a new formula for computing the optimal hope size and used Householder algorithm for solving least square localization problem. Finally, simulation results show that the ODV-Hop achieves good location accuracy than normal DV-Hop.
Article Preview
Top

Many works in the literature propose schemes and methods for localization in WSNs for many purposes (Tian, Zhang, Liu, Sun, & Wang, 2007). The representative schemes of range-free schemes are DV-Hop (Niculescu & Nath, 2001). APIT (He, Huang, Blum, Stankovic, & Abdelzaher, 2003), Amorphous (Nagpal, 1999), and Centroid (Capkun, Hamdi, & Hubaux, 2001; Juang, 2000; Logsdon, 1999).

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing