Skip to main content
Fig. 3 | EURASIP Journal on Advances in Signal Processing

Fig. 3

From: Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization

Fig. 3

a Illustration of a network with non-unique identification sequences \(I_{\mathcal {K}}\) and \(I_{\mathcal {L}}\) and their respective distance measurements as seen by the receiving node [14]. The gray arrows and their corresponding measurements are not considered in the subproblem between \(I_{\mathcal {K}}\) and \(I_{\mathcal {L}}\). b Ambiguity corresponding to a, where v5 is given by the pair of measurements indicated in gray between agents “5” and “6.” For clarity, the edges are annotated with the measurements that give rise to them (cf. items 1(a) and 1(b) in the listing in Section 3). Independent of the previous example, c provides a general illustration of how vertices vi,j(l,r) are formed based on the measurement sets \(\mathcal {M}_{i}\) and \(\mathcal {M}_{j}\) of agents i and j, respectively

Back to article page
\