Dynamic sensor selection for path coverage

Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking
PublisherAssociation for Computing Machinery
Pages277-281
Number of pages5
ISBN (Electronic)9781450360944
DOIs
StatePublished - Jan 4 2019
Event20th International Conference on Distributed Computing and Networking, ICDCN 2019 - Bangalore, India
Duration: Jan 4 2019Jan 7 2019

Publication series

NameACM International Conference Proceeding Series

Other

Other20th International Conference on Distributed Computing and Networking, ICDCN 2019
CountryIndia
CityBangalore
Period1/4/191/7/19

Fingerprint

Sensors

Keywords

  • Dynamic selection
  • Mobility model
  • Path coverage
  • Sensor selection

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Shamoun, S., Abdelzaher, T. F., & Bar-Noy, A. (2019). Dynamic sensor selection for path coverage. In ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking (pp. 277-281). (ACM International Conference Proceeding Series). Association for Computing Machinery. https://doi.org/10.1145/3288599.3288627

Dynamic sensor selection for path coverage. / Shamoun, Simon; Abdelzaher, Tarek F.; Bar-Noy, Amotz.

ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery, 2019. p. 277-281 (ACM International Conference Proceeding Series).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shamoun, S, Abdelzaher, TF & Bar-Noy, A 2019, Dynamic sensor selection for path coverage. in ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. ACM International Conference Proceeding Series, Association for Computing Machinery, pp. 277-281, 20th International Conference on Distributed Computing and Networking, ICDCN 2019, Bangalore, India, 1/4/19. https://doi.org/10.1145/3288599.3288627
Shamoun S, Abdelzaher TF, Bar-Noy A. Dynamic sensor selection for path coverage. In ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery. 2019. p. 277-281. (ACM International Conference Proceeding Series). https://doi.org/10.1145/3288599.3288627
Shamoun, Simon ; Abdelzaher, Tarek F. ; Bar-Noy, Amotz. / Dynamic sensor selection for path coverage. ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking. Association for Computing Machinery, 2019. pp. 277-281 (ACM International Conference Proceeding Series).
@inproceedings{52bb53ea56b348e285b193bc211e0bee,
title = "Dynamic sensor selection for path coverage",
abstract = "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.",
keywords = "Dynamic selection, Mobility model, Path coverage, Sensor selection",
author = "Simon Shamoun and Abdelzaher, {Tarek F.} and Amotz Bar-Noy",
year = "2019",
month = "1",
day = "4",
doi = "10.1145/3288599.3288627",
language = "English (US)",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery",
pages = "277--281",
booktitle = "ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking",

}

TY - GEN

T1 - Dynamic sensor selection for path coverage

AU - Shamoun, Simon

AU - Abdelzaher, Tarek F.

AU - Bar-Noy, Amotz

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

ER -