A Low Complexity Algorithm for Sensor Localization
Konferenz: European Wireless 2005 - 11th European Wireless Conference 2005 - Next Generation wireless and Mobile Communications and Services
10.04.2006 - 13.04.2005 in Nicosia, Cyprus
Tagungsband: European Wireless 2005
Seiten: 5Sprache: EnglischTyp: PDFPersönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt
Rydström, Mats; Ström, Erik G.; Svensson, Arne (Department of Signals and Systems, Communication Systems Group, Chalmers University of Technology, Göteborg, Sweden)
Urruela, Andreu (Department of Signal Theory and Communications, Campus Nord, D5 Jordi Girona 1-3, 08034 Barcelona, Spain)
Locationing in sensor networks is an area that has received much attention over the last few years. In most applications of sensor networks, position-awareness at individual sensors is crucial for a successful operation of the sensor network. Estimation of relative node coordinates, based on measured distances between nodes in the network, has been suggested as a means to provide position-awareness in sensor networks. Localization algorithms, based on distance measurements, may be realized using complex optimization algorithms, estimating not only node coordinates, but also individual node clock-offsets. As sensor sizes decrease and power becomes a scarce resource, such complex locationing algorithms may not be feasible. In this paper, we present a distributed locationing algorithm, called the kernel algorithm. The kernel algorithm handles unknown clock-offsets through a time-difference-of- arrival approach and does not assume any synchronization among the nodes in the network. The algorithm offers robustness and accuracy while keeping complexity low by means of a divide and conquer approach. Numerical simulations verifies the performance and robustness of the proposed algorithm.