Skip to main navigation Skip to search Skip to main content

Connected wireless camera network deployment with visibility coverage

  • Hua Huang
  • , Chien Chun Ni
  • , Xiaomeng Ban
  • , Jie Gao
  • , Andrew T. Schneider
  • , Shan Lin
  • Temple University
  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

We consider the problem of deployment of cameras inside a complex indoor setting for surveillance applications. We formulate the problem of the minimum guarding network that places a minimum number of cameras satisfying both visual coverage of the domain and wireless network connectivity. We prove that finding the minimum guarding network in both the geometric setting and discrete setting is NP-hard. We also give a 2-approximation algorithm to the geometric minimum guarding network. Motivated by the connection of this problem with the watchman tour problem and the art gallery problem, we develop two algorithms that generate satisfactory results in a prototype testbed and in our simulations.

Original languageEnglish
Title of host publicationIEEE INFOCOM 2014 - IEEE Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1204-1212
Number of pages9
ISBN (Print)9781479933600
DOIs
StatePublished - 2014
Event33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014 - Toronto, ON, Canada
Duration: Apr 27 2014May 2 2014

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

Conference33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014
Country/TerritoryCanada
CityToronto, ON
Period04/27/1405/2/14

Keywords

  • Camera Networks
  • Visibility Coverage
  • Wireless Connectivity

Fingerprint

Dive into the research topics of 'Connected wireless camera network deployment with visibility coverage'. Together they form a unique fingerprint.

Cite this