Weighted Centroid Localization Algorithm: Theoretical Analysis and Distributed Implementation
Information about primary transmitter location is crucial in enabling several key capabilities in dynamic spectrum access networks, including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy enforcement. Compared to other proposed non-interactive localization algorithms, the weighted centroid localization (WCL) scheme uses only the received signal strength information, which makes it simple to implement and robust to variations in the propagation environment. In this paper we present the first theoretical framework for WCL performance analysis in terms of its localization error distribution parameterized by node density, node placement, shadowing variance and correlation distance. Using this analysis, we quantify the robustness of WCL to various physical conditions and provide design guidelines, such as node placement, for the practical deployment of WCL. We also propose a practical method for employing WCL through a distributed cluster-based implementation. This approach achieves comparable accuracy with its centralized counterpart, and greatly reduces total transmit power.
- J. Wang, P. Urriza, Y. Han, D. Čabrić, Weighted Centroid Localization Algorithm: Theoretical Analysis and Distributed Implementation, IEEE Transactions on Wireless Communications, vol. 10, no. 10, pp. 3403-3413, Oct. 2011
- J. Wang, P. Urriza, Y. Han, D. Čabrić, Performance Analysis of Weighted Centroid Algorithm for Primary User Localization in Cognitive Radio Networks, in Proc. Asilomar Conference on Signals, Systems, and Computers, 7-10 Nov. 2010, Pacific Grove, CA, USA