Rusu, Cristian, Thompson, John and Robertson, Neil M. (2018) Sensor Scheduling With Time, Energy, and Communication Constraints. IEEE Transactions on Signal Processing, 66 (2). pp. 528-539. ISSN 1941-0476
Full text not available from this repository.Abstract
In this paper, we present new algorithms and analysis for the linear inverse sensor placement and scheduling problems over multiple time instances with power and communications constraints. The proposed algorithms, which deal directly with minimizing the mean squared error (MSE), are based on the convex relaxation approach to address the binary optimization scheduling problems that are formulated in sensor network scenarios. We propose to balance the energy and communications demands of operating a network of sensors over time while we still guarantee a minimum level of estimation accuracy. We measure this accuracy by the MSE for which we provide average case and lower bounds analyses that hold in general, irrespective of the scheduling algorithm used. We show experimentally how the proposed algorithms perform against state-of-the-art methods previously described in the literature.
Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics > Electronic computers. Computer science T Technology > T Technology (General) > Information Technology > Electronic computers. Computer science Q Science > QA Mathematics > Computer software T Technology > T Technology (General) > Information Technology > Computer software |
Divisions: | School of Computing > Staff Research and Publications |
Depositing User: | Caoimhe Ní Mhaicín |
Date Deposited: | 02 Jul 2018 09:58 |
Last Modified: | 02 Jul 2018 09:58 |
URI: | https://norma.ncirl.ie/id/eprint/3026 |
Actions (login required)
View Item |