Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Scaling Laws for Cooperative Node Localization in Non-Line-of-Sight Wireless Networks

Venkatesan N E, Kannan Ramchandran and Raja Sengupta

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2011-20
March 20, 2011

http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-20.pdf

We study the problem of cooperative node lo- calization in non-line-of-sight (NLOS) wireless networks and address design questions such as, “How many anchors and what fraction of line-of-sight (LOS) measurements are needed achieve a specified target accuracy?”. We analytically characterize the performance improvement in localization accuracy as a function of the number of nodes in the network and the fraction of LOS measurements. In particular, we show that the Cramer- Rao Lower Bound (CRLB) can be expressed as a product of two factors - a scalar function that depends only on the parameters of the noise distribution and a matrix that depends only on the geometry of node locations. This holds for arbitrary distance and angle measurement modalities under an additive noise model. Further, a simplified expression is obtained for the CRLB, which provides an insightful understanding of the bound and helps deduce the scaling behavior of the estimation error as a function of the number of agents and anchors in the network. The mean squared error in localization is shown to have an inverse linear relationship with the number of anchors or agents. The error is also shown to have an approximately inverse linear relationship with the fraction of LOS readings except at the extremes. The behavior at the extremes suggests that even a small fraction of LOS measurements can provide significant improvements. Conversely, a small fraction of NLOS measurements can significantly degrade the performance.


BibTeX citation:

@techreport{N E:EECS-2011-20,
    Author = {N E, Venkatesan and Ramchandran, Kannan and Sengupta, Raja},
    Title = {Scaling Laws for Cooperative Node Localization in Non-Line-of-Sight Wireless Networks},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2011},
    Month = {Mar},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-20.html},
    Number = {UCB/EECS-2011-20},
    Abstract = {We study the problem of cooperative node lo- calization in non-line-of-sight (NLOS) wireless networks and address design questions such as, “How many anchors and what fraction of line-of-sight (LOS) measurements are needed achieve a specified target accuracy?”. We analytically characterize the performance improvement in localization accuracy as a function of the number of nodes in the network and the fraction of LOS measurements. In particular, we show that the Cramer- Rao Lower Bound (CRLB) can be expressed as a product of two factors - a scalar function that depends only on the parameters of the noise distribution and a matrix that depends only on the geometry of node locations. This holds for arbitrary distance and angle measurement modalities under an additive noise model. Further, a simplified expression is obtained for the CRLB, which provides an insightful understanding of the bound and helps deduce the scaling behavior of the estimation error as a function of the number of agents and anchors in the network. The mean squared error in localization is shown to have an inverse linear relationship with the number of anchors or agents. The error is also shown to have an approximately inverse linear relationship with the fraction of LOS readings except at the extremes. The behavior at the extremes suggests that even a small fraction of LOS measurements can provide significant improvements. Conversely, a small fraction of NLOS measurements can significantly degrade the performance.}
}

EndNote citation:

%0 Report
%A N E, Venkatesan
%A Ramchandran, Kannan
%A Sengupta, Raja
%T Scaling Laws for Cooperative Node Localization in Non-Line-of-Sight Wireless Networks
%I EECS Department, University of California, Berkeley
%D 2011
%8 March 20
%@ UCB/EECS-2011-20
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-20.html
%F N E:EECS-2011-20