On sensor selection in linked information networks

—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between the different sensors are known. These redundancy relationships can be represented as virtual linkages among the different sensors. These virtual linkages correspond to an information network of sensors, in which it may often be desirable to know the least redundant sensors in order to maximize the information which is obtained at the least possible cost. In this paper, we formulate the problem of sensor selection when redundancy relationships between sensors can be formulated through information network modeling. The use of external linkage information as an approach to improve the efficiency of very large scale sensor selection is a unique feature of this paper, which has not been discussed in earlier works. We present methods for efficient sensor network selection by using regression models to estimate p...

• Type: Journal
• Year: 2011
• Where: DCOSS
• Authors: Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
• Keywords: Approximation Algorithm, DCOSS 2011, Distributed And Parallel Computing, External Linkage, Greedy Approximation