TY - GEN
T1 - Dynamic sensor selection for path coverage
AU - Shamoun, Simon
AU - Abdelzaher, Tarek F.
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:
© 2019 Association for Computing Machinery.
PY - 2019/1/4
Y1 - 2019/1/4
N2 - We study the problem of dynamically selecting sensors to maximize the number of steps covered on the path of a mobile target. The sensors are selected from those already deployed in a network as the target moves. The total number of sensors selected and rounds of selection are limited according to budget constraints. The variables are which sensors to select, when, and how. The best settings depend on how much is known about the target's path, such as its start and end locations and mobility pattern, which is updated as the target moves. We study how coverage is affected by these parameters, and how much such dynamic selection strategies can improve coverage over sensors selected in advance.
AB - We study the problem of dynamically selecting sensors to maximize the number of steps covered on the path of a mobile target. The sensors are selected from those already deployed in a network as the target moves. The total number of sensors selected and rounds of selection are limited according to budget constraints. The variables are which sensors to select, when, and how. The best settings depend on how much is known about the target's path, such as its start and end locations and mobility pattern, which is updated as the target moves. We study how coverage is affected by these parameters, and how much such dynamic selection strategies can improve coverage over sensors selected in advance.
KW - Dynamic selection
KW - Mobility model
KW - Path coverage
KW - Sensor selection
UR - http://www.scopus.com/inward/record.url?scp=85060910344&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060910344&partnerID=8YFLogxK
U2 - 10.1145/3288599.3288627
DO - 10.1145/3288599.3288627
M3 - Conference contribution
AN - SCOPUS:85060910344
T3 - ACM International Conference Proceeding Series
SP - 277
EP - 281
BT - ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking
PB - Association for Computing Machinery
T2 - 20th International Conference on Distributed Computing and Networking, ICDCN 2019
Y2 - 4 January 2019 through 7 January 2019
ER -