.png){kind=icon}
Return
Weighted Centroid Localization Algorithm: Theoretical Analysis and Distributed Implementation
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2011.081611.102209.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Information about primary transmitter location is crucial in enabling several key capabilities in cognitive radio 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, correlation distance and inaccuracy of sensor node positioning. Using this analysis, we quantify the robustness of WCL to various physical conditions and provide design guidelines, such as node placement and spacing, for the practical deployment of WCL. We also propose a power-efficient method for implementing WCL through a distributed cluster-based algorithm, that achieves comparable accuracy with its centralized counterpart.
Keywords:
Cognitive radio
performance analysis
rangefree localization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveMeasurement properties of mental health literacy tools measuring help-seeking: a systematic review*
PREAI
ShareSavePhotooxidation of Glycylglycine. Two-Channel Reaction Mechanism as Studied by Time-Resolved FT EPR
PREAI
ShareSave
View more