ReNLoc: an anchor-free localization algorithm for indirect ranging

TY - GEN

T1 - ReNLoc

T2 - IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks 2015

AU - Fanourakis, M.

AU - Wac, Katarzyna

N1 - Conference code: 16

PY - 2015/7/14

Y1 - 2015/7/14

N2 - Localization has been an important research issue in ubiquitous computing and wireless sensor networks (WSNs). From location-based services to autonomous mobile devices, location is prevalent in a wide range of applications. Localization methods for a mobile node vary from using GPS to localizing with respect to beacons with known locations, or using sensors like accelerometers and compasses. All of these solutions either require additional sensors in a node that reduce its battery life or require some kind of infrastructure and access to a database of anchor locations. Additionally, most solutions are for networks where nodes can communicate indiscriminately with each other. In this paper we introduce ReNLoc, a minimalistic anchor-free multilateration algorithm for 2D space (extendable to 3D space) with a centralized and a distributed version made for networks where the mobile nodes can only get range measurements to nodes with an unknown but fixed position that we call base nodes. The main assumption is that there is a minimum of three base nodes. ReNLoc takes advantage of geometric constraints that arise from the range measurements and represents them as sets on which we perform minimization over known geometric properties. We show that ReNLoc outperforms the commonly used multidimensional scaling (MDS) algorithm in a purely indirect ranging setup.

AB - Localization has been an important research issue in ubiquitous computing and wireless sensor networks (WSNs). From location-based services to autonomous mobile devices, location is prevalent in a wide range of applications. Localization methods for a mobile node vary from using GPS to localizing with respect to beacons with known locations, or using sensors like accelerometers and compasses. All of these solutions either require additional sensors in a node that reduce its battery life or require some kind of infrastructure and access to a database of anchor locations. Additionally, most solutions are for networks where nodes can communicate indiscriminately with each other. In this paper we introduce ReNLoc, a minimalistic anchor-free multilateration algorithm for 2D space (extendable to 3D space) with a centralized and a distributed version made for networks where the mobile nodes can only get range measurements to nodes with an unknown but fixed position that we call base nodes. The main assumption is that there is a minimum of three base nodes. ReNLoc takes advantage of geometric constraints that arise from the range measurements and represents them as sets on which we perform minimization over known geometric properties. We show that ReNLoc outperforms the commonly used multidimensional scaling (MDS) algorithm in a purely indirect ranging setup.

KW - Global Positioning System

KW - mobile computing

KW - mobile handsets

KW - sensor placement

KW - ubiquitous computing

KW - wireless sensor networks

KW - 2D space

KW - GPS

KW - ReNLoc

KW - WSN

KW - anchor-free localization algorithm

KW - autonomous mobile device

KW - battery life reduction

KW - indirect ranging

KW - minimalistic anchor-free multilateration algorithm

KW - multidimensional scaling algorithm

KW - wireless sensor network

KW - Coordinate measuring machines

KW - Distance measurement

KW - Mathematical model

KW - Position measurement

KW - Sensors

KW - Ubiquitous computing

KW - Wireless sensor networks

KW - anchor-free

KW - distributed

KW - localization

KW - multilateration

KW - sensor networks

U2 - 10.1109/wowmom.2015.7158145

DO - 10.1109/wowmom.2015.7158145

M3 - Article in proceedings

SP - 1

EP - 9

BT - World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2015 IEEE 16th International Symposium on a

PB - IEEE

Y2 - 14 June 2015 through 17 June 2015

ER -