Euclidean matrix completion problems in tracking and geo-localization

We consider the problem of emitter tracking using received signal strengths (RSS) measured at a number of in-range access points (AP) when some of the AP locations are unknown. This can be formulated as a Euclidean distance matrix completion problem (EDMCP) to which an iterative distributed weighted multidimensional scaling (dwMDS) algorithm can be applied to simultaneously track emitters and localize APs. The algorithm is illustrated using real-time data collected by the University of California San Diego (UCSD) wireless topology discovery (WTD) project.