A low-complexity cooperative localization algorithm based on variational message passing in wireless networks

Weijie YUAN; Nan WU; Bin LI; Hua WANG; Jingming KUANG

doi:10.1109/WCSP.2014.6992025

A low-complexity cooperative localization algorithm based on variational message passing in wireless networks

Weijie YUAN, Nan WU^*, Bin LI, Hua WANG, Jingming KUANG

^*Corresponding author for this work

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

2 Citations (Scopus)

Abstract

We consider a wireless network where target nodes aim to locate themselves. A cooperative localization algorithm can provide high accuracy by exchanging location information between nodes. In this paper, a novel distributed cooperative localization algorithm based on factor graph and variational message passing (VMP) is proposed. Compared with other message passing method, VMP algorithm features lower communication overhead. An approximation of likelihood function is made thus all messages on factor graph can be obtained in closed Gaussian forms and therefore reduce the computational complexity and communication cost. Simulation results show that the proposed method performs very close to SPAWN with much lower complexity.

Original language	English
Title of host publication	2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014
Publisher	IEEE
ISBN (Electronic)	9781479973392
DOIs	https://doi.org/10.1109/WCSP.2014.6992025
Publication status	Published - 18 Dec 2014
Externally published	Yes
Event	2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014 - Hefei, China Duration: 23 Oct 2014 → 25 Oct 2014

Conference

Conference	2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014
Country/Territory	China
City	Hefei
Period	23/10/14 → 25/10/14

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

Keywords

Cooperative Localization
Gaussian Message Representation
Taylor Expansion
Variational Message Passing

Access to Document

10.1109/WCSP.2014.6992025

Cite this

@inproceedings{9f973de380e7432a9ef012aae63b27df,

title = "A low-complexity cooperative localization algorithm based on variational message passing in wireless networks",

abstract = "We consider a wireless network where target nodes aim to locate themselves. A cooperative localization algorithm can provide high accuracy by exchanging location information between nodes. In this paper, a novel distributed cooperative localization algorithm based on factor graph and variational message passing (VMP) is proposed. Compared with other message passing method, VMP algorithm features lower communication overhead. An approximation of likelihood function is made thus all messages on factor graph can be obtained in closed Gaussian forms and therefore reduce the computational complexity and communication cost. Simulation results show that the proposed method performs very close to SPAWN with much lower complexity.",

keywords = "Cooperative Localization, Gaussian Message Representation, Taylor Expansion, Variational Message Passing",

author = "Weijie YUAN and Nan WU and Bin LI and Hua WANG and Jingming KUANG",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014 ; Conference date: 23-10-2014 Through 25-10-2014",

year = "2014",

month = dec,

day = "18",

doi = "10.1109/WCSP.2014.6992025",

language = "English",

booktitle = "2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014",

publisher = "IEEE",

}

YUAN, W, WU, N, LI, B, WANG, H & KUANG, J 2014, A low-complexity cooperative localization algorithm based on variational message passing in wireless networks. in 2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014., 6992025, IEEE, 2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014, Hefei, China, 23/10/14. https://doi.org/10.1109/WCSP.2014.6992025

A low-complexity cooperative localization algorithm based on variational message passing in wireless networks. / YUAN, Weijie; WU, Nan; LI, Bin et al.
2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014. IEEE, 2014. 6992025.

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

TY - GEN

T1 - A low-complexity cooperative localization algorithm based on variational message passing in wireless networks

AU - YUAN, Weijie

AU - WU, Nan

AU - LI, Bin

AU - WANG, Hua

AU - KUANG, Jingming

PY - 2014/12/18

Y1 - 2014/12/18

N2 - We consider a wireless network where target nodes aim to locate themselves. A cooperative localization algorithm can provide high accuracy by exchanging location information between nodes. In this paper, a novel distributed cooperative localization algorithm based on factor graph and variational message passing (VMP) is proposed. Compared with other message passing method, VMP algorithm features lower communication overhead. An approximation of likelihood function is made thus all messages on factor graph can be obtained in closed Gaussian forms and therefore reduce the computational complexity and communication cost. Simulation results show that the proposed method performs very close to SPAWN with much lower complexity.

AB - We consider a wireless network where target nodes aim to locate themselves. A cooperative localization algorithm can provide high accuracy by exchanging location information between nodes. In this paper, a novel distributed cooperative localization algorithm based on factor graph and variational message passing (VMP) is proposed. Compared with other message passing method, VMP algorithm features lower communication overhead. An approximation of likelihood function is made thus all messages on factor graph can be obtained in closed Gaussian forms and therefore reduce the computational complexity and communication cost. Simulation results show that the proposed method performs very close to SPAWN with much lower complexity.

KW - Cooperative Localization

KW - Gaussian Message Representation

KW - Taylor Expansion

KW - Variational Message Passing

UR - http://www.scopus.com/inward/record.url?scp=84921668266&partnerID=8YFLogxK

U2 - 10.1109/WCSP.2014.6992025

DO - 10.1109/WCSP.2014.6992025

M3 - Conference paper (refereed)

AN - SCOPUS:84921668266

BT - 2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014

PB - IEEE

T2 - 2014 6th International Conference on Wireless Communications and Signal Processing, WCSP 2014

Y2 - 23 October 2014 through 25 October 2014

ER -

A low-complexity cooperative localization algorithm based on variational message passing in wireless networks

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this