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: Contribution to journalArticle

1 Citation (Scopus)

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 constraints modeling refocusing delays. 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, and we derive exact solutions for some special cases of the problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of which are based on the computed lower bound, for the setting of one sensor and many sites.

Original languageEnglish (US)
Pages (from-to)1683-1698
Number of pages16
JournalWireless Networks
Volume21
Issue number5
DOIs
StatePublished - Jul 15 2015

Fingerprint

Scheduling
Sensors
Cameras
Heuristic algorithms
Costs

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

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. In: Wireless Networks. 2015 ; Vol. 21, No. 5. pp. 1683-1698.
@article{7fe9436a3eea44e9927bc975dd87deef,
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 constraints modeling refocusing delays. 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, and we derive exact solutions for some special cases of the problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of which are based on the computed lower bound, for the setting of one sensor and many sites.",
author = "Yosef Alayev and Amotz Bar-Noy and Johnson, {Matthew P.} and Lance Kaplan and {La Porta}, {Thomas F.}",
year = "2015",
month = "7",
day = "15",
doi = "10.1007/s11276-014-0873-0",
language = "English (US)",
volume = "21",
pages = "1683--1698",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "5",

}

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.

In: Wireless Networks, Vol. 21, No. 5, 15.07.2015, p. 1683-1698.

Research output: Contribution to journalArticle

TY - JOUR

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 - 2015/7/15

Y1 - 2015/7/15

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 constraints modeling refocusing delays. 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, and we derive exact solutions for some special cases of the problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of which are based on the computed lower bound, for the setting of one sensor and many sites.

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 constraints modeling refocusing delays. 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, and we derive exact solutions for some special cases of the problem. Finally, we provide and experimentally evaluate several heuristic algorithms, some of which are based on the computed lower bound, for the setting of one sensor and many sites.

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

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

U2 - 10.1007/s11276-014-0873-0

DO - 10.1007/s11276-014-0873-0

M3 - Article

AN - SCOPUS:84931274989

VL - 21

SP - 1683

EP - 1698

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 5

ER -