The University of Southampton
University of Southampton Institutional Repository

Space-time hierarchical-graph based cooperative localization in wireless sensor networks

Space-time hierarchical-graph based cooperative localization in wireless sensor networks
Space-time hierarchical-graph based cooperative localization in wireless sensor networks
It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the information always propagates from the upper layers to a certain lower layer and the message passing process is further optimized at each layer. Hence, the potential error propagation can be mitigated. Additionally, both position estimation and position broadcasting are carried out by the sensor nodes. Furthermore, a sensor activation mechanism is conceived, which is capable of significantly reducing both the energy consumption and the network traffic overhead incurred by the localization process. The analytical and numerical results provided demonstrate the superiority of our space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.
Cooperative localization, space-time hierarchical-graph, information propagation, energy management, activation mechanism
1053-587X
322-334
Lv, Tiejun
fb465673-1068-4cae-bb94-93ab1dd63f4d
Gao, Hui
d1b095e6-df29-4eb6-b7fb-efa6baf8e162
Li, Xiaopeng
f369d729-0c1c-4c1d-a04c-ae73a66f94d2
Yang, Shaoshi
df1e6c38-ff3b-473e-b36b-4820db908e60
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Lv, Tiejun
fb465673-1068-4cae-bb94-93ab1dd63f4d
Gao, Hui
d1b095e6-df29-4eb6-b7fb-efa6baf8e162
Li, Xiaopeng
f369d729-0c1c-4c1d-a04c-ae73a66f94d2
Yang, Shaoshi
df1e6c38-ff3b-473e-b36b-4820db908e60
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Lv, Tiejun, Gao, Hui, Li, Xiaopeng, Yang, Shaoshi and Hanzo, Lajos (2016) Space-time hierarchical-graph based cooperative localization in wireless sensor networks. IEEE Transactions on Signal Processing, 64 (2), 322-334. (doi:10.1109/TSP.2015.2480038).

Record type: Article

Abstract

It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the information always propagates from the upper layers to a certain lower layer and the message passing process is further optimized at each layer. Hence, the potential error propagation can be mitigated. Additionally, both position estimation and position broadcasting are carried out by the sensor nodes. Furthermore, a sensor activation mechanism is conceived, which is capable of significantly reducing both the energy consumption and the network traffic overhead incurred by the localization process. The analytical and numerical results provided demonstrate the superiority of our space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.

Text
location_doublecolumn.pdf - Accepted Manuscript
Download (1MB)

More information

Published date: 15 January 2016
Keywords: Cooperative localization, space-time hierarchical-graph, information propagation, energy management, activation mechanism
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 375768
URI: http://eprints.soton.ac.uk/id/eprint/375768
ISSN: 1053-587X
PURE UUID: 3ed85fc6-b9b5-4870-8571-511dcdd16ed5
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 14 Apr 2015 08:42
Last modified: 18 Mar 2024 02:35

Export record

Altmetrics

Contributors

Author: Tiejun Lv
Author: Hui Gao
Author: Xiaopeng Li
Author: Shaoshi Yang
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×