Improving the localization probability and decreasing communication cost for mobile users

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies the problem of localization for mobile users with low communication cost. Due to the sparse deployment of anchors, the localization probabilities achieved by the traditional fixed anchors-based methods are not acceptable. To solve this problem, we propose to exploit the localized users as the mobile anchors for localizing the non-localized users. In this way, the localization probability can be improved. Moreover, an algorithm for electing mobile anchors is designed to decrease the communication cost, with several provable properties. This electing algorithm is a distributed method, without negotiation among mobile users. Extensive experimental results demonstrate that in terms of localization probability, our method outperforms the traditional fixed anchors-based methods by approximately 30%~60% with a small increment of communication cost.

Cite

CITATION STYLE

APA

Wang, W., Wang, T., Bhuiyan, M. Z. A., Cai, Y., Tian, H., & Chen, Y. (2016). Improving the localization probability and decreasing communication cost for mobile users. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10067 LNCS, pp. 197–207). Springer Verlag. https://doi.org/10.1007/978-3-319-49145-5_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free