Abstract

Sensor selection is a crucial aspect in sensor network design. Due to the limitations on the hardware costs, availability of storage or physical space, and to minimize the processing and communication burden, the limited number of available sensors has to be smartly deployed. The node deployment should be such that a certain performance is ensured. Optimizing the sensors' spatial constellation or their temporal sampling patterns can be casted as a sensor selection problem. Sensor selection is essentially a combinatorial problem involving a performance evaluation over all possible choices, and it is intractable even for problems of modest scale. Nevertheless, using convex relaxation techniques, the sensor selection problem can be solved efficiently. In this paper, we present a brief overview and recent advances on the sensor selection problem from a statistical signal processing perspective. In particular, we focus on some of the important statistical inference problems like estimation, tracking, and detection.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.