k-coverage

Weili Wu, Zhao Zhang, Wonjun Lee, Ding Zhu Du

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Consider a set S of n homogeneous sensors and a set A of m targets. A subset S′ of S is called a sensor k-cover if every target in A is covered by at least k sensors in S′. In this chapter, we study the following problem.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer
Pages117-133
Number of pages17
DOIs
Publication statusPublished - 2020

Publication series

NameSpringer Optimization and Its Applications
Volume162
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint

Dive into the research topics of 'k-coverage'. Together they form a unique fingerprint.

Cite this