Cost-Aware Compressive Sensing for Networked Sensing Systems
- Liwen Xu ,
- Xiaohong Hao ,
- Nicholas Lane ,
- Xin Liu ,
- Thomas Moscibroda
IPSN 2015: 14th International Conference on Information Processing in Sensor Networks, Seattle, Washington |
Published by ACM - Association for Computing Machinery
Compressive Sensing is a technique that can help to reduce the sampling rate of sensing tasks. In mobile crowdsensing applications or wireless sensor networks, the resource burden of collecting samples is often a major concern. Therefore, compressive sensing is a promising approach in such scenarios. An implicit assumption underlying compressive sensing–both in theory and its applications–is that every sample has the same cost: the goal is to reduce the number of samples while achieving a good recovery accuracy. In many networked sensing systems, however, the cost of obtaining a specific sample may highly depend on the location of the sample, the time, the condition of the device, and many other factors.
In this paper, we study compressive sensing in situations where different samples have different costs, and we seek to find a good trade-off between minimizing the total sample cost and the resulting recovery accuracy. We design Cost-Aware Compressive Sensing (CACS), a technique that incorporates the cost-diversity of samples into the compressive sensing framework, and we apply CACS in networked sensing systems. Technically, we use regularized column sum (RCS) as a predictive metric for recovery accuracy, and use this metric to design an algorithm for finding a least cost randomized sample matrix with provable recovery guarantees. We also show how CACS can be applied in a distributed context. Using traffic monitoring and air pollution as concrete application examples, we evaluate CACS based on large-scale real-life traces. Our results show that CACS achieves significant cost savings, outperforming natural baselines (greedy and random sampling) by up to 4x.
© ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version can be found at http://dl.acm.org.