We cast the sensor selection problem for 3-D arrays using the worst-case two-target Cramér-Rao bound as a convex semi-definite program and obtain the binary selection by randomized rounding.

With the continuous development of network functions virtualization (NFV) and software-defined networking (SDN) technologies and the explosive growth of network traffic, the requirement for computing ...