2012
DOI: 10.1109/wcl.2012.121411.110059
|View full text |Cite
|
Sign up to set email alerts
|

On the Joint Estimation of the RSS-Based Location and Path-loss Exponent

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
35
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 80 publications
(35 citation statements)
references
References 11 publications
0
35
0
Order By: Relevance
“…The localization performance is improved by adopting convex optimization techniques. In [26], the authors deal with RSSI-based localization in an unknown path loss model and the proposed method exhibits better performance at low signal-to-noise ratio. In [27], a weighed least squares (WLS) is derived to localize the target with unknown transmission power and path loss exponent.…”
Section: Introductionmentioning
confidence: 99%
“…The localization performance is improved by adopting convex optimization techniques. In [26], the authors deal with RSSI-based localization in an unknown path loss model and the proposed method exhibits better performance at low signal-to-noise ratio. In [27], a weighed least squares (WLS) is derived to localize the target with unknown transmission power and path loss exponent.…”
Section: Introductionmentioning
confidence: 99%
“…This was achieved through a measurement campaign consisting of a number of usage scenarios, in a 2-storey terrace house in Bristol, United Kingdom (UK). The received signal strength indicator (RSSI), which is conventionally used for localization [15][16][17][18] in indoor or outdoor environments and for the determination of the channel model that relates the received signal strength with the distance [19][20][21][22], is the measured parameter in this campaign.…”
Section: Introductionmentioning
confidence: 99%
“…Due to the non linear nature of the localization problem, location estimation via RSS (and also for ToA) can be achieved using maximum likelihood (ML) techniques [14], [15], [16] that commonly operate in an iterative fashion. Generally, a close initial estimate of location is required for the ML algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…The solution to (6) is obtained using high complexity iterative techniques such as the Gauss-Newton or LevenbergMarquardt techniques [15], [16]. Due to its iterative nature, the ML techniques can converge to local minimum instead of global minimum if given an initial seed that is far from the actual node location.…”
Section: Introductionmentioning
confidence: 99%