Dynamic sensor selection for path coverage

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

doi:10.1145/3288599.3288627

Dynamic sensor selection for path coverage

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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 language	English
Title of host publication	ICDCN 2019 - Proceedings of the 2019 International Conference on Distributed Computing and Networking
Publisher	Association for Computing Machinery
Pages	277-281
Number of pages	5
ISBN (Electronic)	9781450360944
DOIs	https://doi.org/10.1145/3288599.3288627
State	Published - 4 Jan 2019
Externally published	Yes
Event	20th International Conference on Distributed Computing and Networking, ICDCN 2019 - Bangalore, India Duration: 4 Jan 2019 → 7 Jan 2019

Publication series

Name	ACM International Conference Proceeding Series

Conference

Conference	20th International Conference on Distributed Computing and Networking, ICDCN 2019
Country/Territory	India
City	Bangalore
Period	4/01/19 → 7/01/19

Bibliographical note

Publisher Copyright:
© 2019 Association for Computing Machinery.

Funding

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.

Funders	Funder number
Army Research Laboratory	W911NF-09-2-0053

Keywords

Dynamic selection
Mobility model
Path coverage
Sensor selection

Access to Document

10.1145/3288599.3288627

Cite this

@inproceedings{0989021b95ab4b0abf2abb7e57f95de0,

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",

note = "Publisher Copyright: {\textcopyright} 2019 Association for Computing Machinery.; 20th International Conference on Distributed Computing and Networking, ICDCN 2019 ; Conference date: 04-01-2019 Through 07-01-2019",

year = "2019",

month = jan,

day = "4",

doi = "10.1145/3288599.3288627",

language = "אנגלית",

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",

}

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, 4/01/19. 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 proceeding › Conference contribution › peer-review

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

U2 - 10.1145/3288599.3288627

DO - 10.1145/3288599.3288627

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

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 -

Dynamic sensor selection for path coverage

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this