Householder Algorithm Applied to Localization for Wireless Sensor Networks

Householder Algorithm Applied to Localization for Wireless Sensor Networks

Abderrahim Beni Hssane (Chouaïb Doukkali University, Morocco), Moulay Lahcen Hasnaoui (Chouaïb Doukkali University, Morocco), Said Benkirane (Chouaïb Doukkali University, Morocco), Driss El Ouadghiri (Moulay Ismail University, Morocco) and Mohamed Laghdir (Chouaïb Doukkali University, Morocco)
Copyright: © 2012 |Pages: 13
DOI: 10.4018/jmcmc.2012010102

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

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).

Purchase this article to continue reading all 13 pages >

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2019): Forthcoming, Available for Pre-Order
Volume 9: 4 Issues (2018): 3 Released, 1 Forthcoming
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