TY - GEN
T1 - A matrix-completion approach to mobile network localization
AU - Ye, Qiang
AU - Cheng, Jie
AU - Du, Hongwei
AU - Jia, Xiaohua
AU - Zhang, Jing
N1 - Publisher Copyright:
Copyright © 2014 ACM.
PY - 2014/8/11
Y1 - 2014/8/11
N2 - Localization in mobile networks is of paramount importance to a variety of pervasive applications. Due to the limitations of GPS, such as high deployment cost, many researchers have devised a variety of different localization schemes based on the measurements of connectivity or distance between neighboring nodes. The existing schemes sufer seriously from either low localization precision or overlong computation time. In this paper, we present a novel localization scheme based on matrix completion, MALL, that utilizes the collected connectivity and distance information to achieve high-precision localization. Since MALL only involves convex optimization and low-complexity non-convex optimization, it can localize mobile nodes at a fast pace. Furthermore, MALL leads to low communication cost. Through intensive simulation and testbed experiments, we found that MALL outperforms the state-of-the-art localization schemes. An in-depth analysis of the time complexity and communication cost of MALL is also included in this paper.
AB - Localization in mobile networks is of paramount importance to a variety of pervasive applications. Due to the limitations of GPS, such as high deployment cost, many researchers have devised a variety of different localization schemes based on the measurements of connectivity or distance between neighboring nodes. The existing schemes sufer seriously from either low localization precision or overlong computation time. In this paper, we present a novel localization scheme based on matrix completion, MALL, that utilizes the collected connectivity and distance information to achieve high-precision localization. Since MALL only involves convex optimization and low-complexity non-convex optimization, it can localize mobile nodes at a fast pace. Furthermore, MALL leads to low communication cost. Through intensive simulation and testbed experiments, we found that MALL outperforms the state-of-the-art localization schemes. An in-depth analysis of the time complexity and communication cost of MALL is also included in this paper.
KW - Decentralized schemes
KW - Localization
KW - Matrix completion
KW - Mobile networks
UR - https://www.scopus.com/pages/publications/84944324858
U2 - 10.1145/2632951.2632986
DO - 10.1145/2632951.2632986
M3 - 会议稿件
AN - SCOPUS:84944324858
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 327
EP - 336
BT - MobiHoc 2014 - Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing
PB - Association for Computing Machinery
T2 - 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2014
Y2 - 11 August 2014 through 14 August 2014
ER -