Optimizing quality-of-information in cost-sensitive sensor data fusion

This paper investigates maximizing quality of information subject to cost constraints in data fusion systems. We consider data fusion applications that try to estimate or predict some current or future state of a complex physical world. Examples include target tracking, path planning, and sensor node localization. Rather than optimizing generic network-level metrics such as latency or throughput, we achieve more resource-efficient sensor network operation by directly optimizing an application-level notion of quality, namely prediction error. This is done while accommodating cost constraints. Unlike prior cost-sensitive prediction/regression schemes, our solution considers more complex prediction problems that arise in sensor networks where phenomena behave differently under different conditions, and where both ordered and unordered prediction attributes are used. The scheme is evaluated through real sensor network applications in localization and path planning. Experimental results show that non-trivial cost savings can be achieved by our scheme compared to popular cost-insensitive schemes, and a significantly better prediction error can be achieved compared to the cost-sensitive linear regression schemes. ¹