Privacy-Preserving Distributed Iterative Localization for Wireless Sensor Networks

Effectively determining the accurate locations of sensor nodes while preserving data privacy is an interesting and challenging problem in the research of wireless sensor networks. On the basis of the well-performing distributed iterative localization framework in wireless sensor networks, this article proposes a dual privacy-preserving scheme based on node-intermittent updates and noises injection. A comprehensive analysis of the localization algorithm in terms of convergence and privacy-preserving performance is presented. It is theoretically demonstrated that the localization algorithm can achieve global accurate localization without leaking the privacy information of sensor nodes. At last, the performance of the privacy-preserving localization algorithm is verified by building an experimental platform containing six robots.

Automated summary

This article proposes a dual privacy-preserving scheme for accurately determining the locations of sensor nodes in wireless sensor networks. The localization algorithm is analyzed in terms of convergence and privacy-preserving performance, and it is demonstrated that accurate localization can be achieved without leaking sensor node privacy information. The performance of the privacy-preserving localization algorithm is verified through experiments with six robots.