Efficient Crowdsourcing-Aided Positioning and Ground-Truth-Aided Truth Discovery for Mobile Wireless Sensor Networks in Urban Fields

In urban fields, Mobile Wireless Sensor Networks (MWSNs) become ubiquitous. Accurate GPS positioning for sensors is a fundamental problem for MWSNs. To solve this problem, this paper proposes a Crowdsourcing-Aided Positioning scheme, which takes an ideal situation and a more realistic situation into...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications 2022-03, Vol.21 (3), p.1652-1664
Hauptverfasser: Lu, Haozhen, Gao, Xiaofeng, Chen, Guihai
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In urban fields, Mobile Wireless Sensor Networks (MWSNs) become ubiquitous. Accurate GPS positioning for sensors is a fundamental problem for MWSNs. To solve this problem, this paper proposes a Crowdsourcing-Aided Positioning scheme, which takes an ideal situation and a more realistic situation into account. In the ideal situation, all participants are considered accurate. Then, two optimization objectives are addressed for the efficient Crowdsourcing-Aided Positioning task. Their utility functions are proven to be submodular and a greedy algorithm is given to solve them. In the more realistic situation, randomly selected participants cannot guarantee the accuracy of the data. We propose a data-accuracy-calibration-based participant selection framework to solve this dilemma. Through data accuracy calibration, participants gain their data accuracy and reliability with the help of wireless sensor networks. First, we design three kinds of data accuracy calibration methods based on probabilistic models. Then, we propose a Truthful-Data-Driven Participant Selection problem, which tends to raise the data accuracy and reliability. The optimization problem is proved to be NP-hard and its optimization function has submodular property. We give a greedy algorithm with 1-\frac {1}{e} approximation ratio to solve this problem. Simulation experiments are conducted to validate the algorithmic effectiveness at last.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2021.3105906