You can't get there from here: Sensor scheduling with refocusing delays

Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, Lance Kaplan, Thomas F. La Porta

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

Abstract

We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the observed sites. In the existing literature, it is typically assumed that the time for a sensor switching from one site to another is negligible. This may not be the case in applications such as camera surveillance of a border, however, in which the camera takes time to pan and tilt to refocus itself to a new geographical location. We formulate a problem with refocusing delay constraints. We prove the problem to be NP-hard and then study a special case in which refocusing is proportional to some Euclidian metric. We give a lower bound on the optimal cost for the scheduling problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of them based on this computed lower bound.

Original languageEnglish (US)
Title of host publication2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010
Pages462-471
Number of pages10
DOIs
StatePublished - Dec 1 2010
Event2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010 - San Francisco, CA, United States
Duration: Nov 8 2010Nov 12 2010

Publication series

Name2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

Other

Other2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010
CountryUnited States
CitySan Francisco, CA
Period11/8/1011/12/10

Fingerprint

Cameras
Scheduling
Sensors
Heuristic algorithms
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Alayev, Y., Bar-Noy, A., Johnson, M. P., Kaplan, L., & La Porta, T. F. (2010). You can't get there from here: Sensor scheduling with refocusing delays. In 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010 (pp. 462-471). [5663929] (2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010). https://doi.org/10.1109/MASS.2010.5663929
Alayev, Yosef ; Bar-Noy, Amotz ; Johnson, Matthew P. ; Kaplan, Lance ; La Porta, Thomas F. / You can't get there from here : Sensor scheduling with refocusing delays. 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010. 2010. pp. 462-471 (2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010).
@inproceedings{c0c15d4df65d4f0fb99d809a6ff756ce,
title = "You can't get there from here: Sensor scheduling with refocusing delays",
abstract = "We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the observed sites. In the existing literature, it is typically assumed that the time for a sensor switching from one site to another is negligible. This may not be the case in applications such as camera surveillance of a border, however, in which the camera takes time to pan and tilt to refocus itself to a new geographical location. We formulate a problem with refocusing delay constraints. We prove the problem to be NP-hard and then study a special case in which refocusing is proportional to some Euclidian metric. We give a lower bound on the optimal cost for the scheduling problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of them based on this computed lower bound.",
author = "Yosef Alayev and Amotz Bar-Noy and Johnson, {Matthew P.} and Lance Kaplan and {La Porta}, {Thomas F.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/MASS.2010.5663929",
language = "English (US)",
isbn = "9781424474882",
series = "2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010",
pages = "462--471",
booktitle = "2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010",

}

Alayev, Y, Bar-Noy, A, Johnson, MP, Kaplan, L & La Porta, TF 2010, You can't get there from here: Sensor scheduling with refocusing delays. in 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010., 5663929, 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010, pp. 462-471, 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010, San Francisco, CA, United States, 11/8/10. https://doi.org/10.1109/MASS.2010.5663929

You can't get there from here : Sensor scheduling with refocusing delays. / Alayev, Yosef; Bar-Noy, Amotz; Johnson, Matthew P.; Kaplan, Lance; La Porta, Thomas F.

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010. 2010. p. 462-471 5663929 (2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010).

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

TY - GEN

T1 - You can't get there from here

T2 - Sensor scheduling with refocusing delays

AU - Alayev, Yosef

AU - Bar-Noy, Amotz

AU - Johnson, Matthew P.

AU - Kaplan, Lance

AU - La Porta, Thomas F.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the observed sites. In the existing literature, it is typically assumed that the time for a sensor switching from one site to another is negligible. This may not be the case in applications such as camera surveillance of a border, however, in which the camera takes time to pan and tilt to refocus itself to a new geographical location. We formulate a problem with refocusing delay constraints. We prove the problem to be NP-hard and then study a special case in which refocusing is proportional to some Euclidian metric. We give a lower bound on the optimal cost for the scheduling problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of them based on this computed lower bound.

AB - We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the observed sites. In the existing literature, it is typically assumed that the time for a sensor switching from one site to another is negligible. This may not be the case in applications such as camera surveillance of a border, however, in which the camera takes time to pan and tilt to refocus itself to a new geographical location. We formulate a problem with refocusing delay constraints. We prove the problem to be NP-hard and then study a special case in which refocusing is proportional to some Euclidian metric. We give a lower bound on the optimal cost for the scheduling problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of them based on this computed lower bound.

UR - http://www.scopus.com/inward/record.url?scp=78650994530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650994530&partnerID=8YFLogxK

U2 - 10.1109/MASS.2010.5663929

DO - 10.1109/MASS.2010.5663929

M3 - Conference contribution

AN - SCOPUS:78650994530

SN - 9781424474882

T3 - 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

SP - 462

EP - 471

BT - 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

ER -

Alayev Y, Bar-Noy A, Johnson MP, Kaplan L, La Porta TF. You can't get there from here: Sensor scheduling with refocusing delays. In 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010. 2010. p. 462-471. 5663929. (2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010). https://doi.org/10.1109/MASS.2010.5663929