TY - GEN
T1 - Local algorithms for sensor selection
AU - Shamoun, Simon
AU - Abdelzaher, Tarek
AU - Tu, Tianyi
AU - Bar-Noy, Amotz
N1 - Funding Information:
Research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-09-2-0053 (the ARL Network Science CTA). The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.
Publisher Copyright:
© 2018 Association for Computing Machinery.
PY - 2018/10/25
Y1 - 2018/10/25
N2 - We study local algorithms for sensor selection, in which each sensor in a network uses information from nearby sensors alone to decide if it should be selected to predict the data of non-selected sensors. Our goal is to show how the prediction quality can be improved by increasing the level of knowledge available to each sensor. We specifically study this for a graph model of the network, in which prediction quality is defined by virtual links between sensors. Each node knows the links along all paths of fixed length extending outward from itself. The maximum path length increases with the level of knowledge. We designed algorithms for the first few levels and evaluated them on randomly generated graphs and real datasets, determining the optimal parameters for each algorithm and comparing them to baseline global strategies. Our results show that just knowing the links to immediate neighbors is enough to be as good as a simple global greedy algorithm, and increasing the knowledge improves the selection quality.
AB - We study local algorithms for sensor selection, in which each sensor in a network uses information from nearby sensors alone to decide if it should be selected to predict the data of non-selected sensors. Our goal is to show how the prediction quality can be improved by increasing the level of knowledge available to each sensor. We specifically study this for a graph model of the network, in which prediction quality is defined by virtual links between sensors. Each node knows the links along all paths of fixed length extending outward from itself. The maximum path length increases with the level of knowledge. We designed algorithms for the first few levels and evaluated them on randomly generated graphs and real datasets, determining the optimal parameters for each algorithm and comparing them to baseline global strategies. Our results show that just knowing the links to immediate neighbors is enough to be as good as a simple global greedy algorithm, and increasing the knowledge improves the selection quality.
KW - Sensor selection; local algorithms
UR - http://www.scopus.com/inward/record.url?scp=85058234499&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85058234499&partnerID=8YFLogxK
U2 - 10.1145/3243046.3243059
DO - 10.1145/3243046.3243059
M3 - Conference contribution
AN - SCOPUS:85058234499
T3 - PE-WASUN 2018 - Proceedings of the 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks
SP - 84
EP - 91
BT - PE-WASUN 2018 - Proceedings of the 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks
PB - Association for Computing Machinery
T2 - 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2018
Y2 - 28 October 2018 through 2 November 2018
ER -