“…, 4, and obtain: Node placement terms a procedure of how to place usernodes in Euclidean space enabling (Cyclic) IA by propagation delay. Here, we consider the problem as an Euclidean embedding of the dissimilarity matrix ∆ according to [9], [10] with fixed entries in the matrix C and variable entries a, b ∈ R + in B, A, respectively. To derive the sought distances b and a, the receivers j and k, j ≠ k ∈ {3, 4}, must be positioned s. t. all the given distances in C are fulfilled.…”