k-coverage

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

doi:10.1007/978-3-030-52824-9_7

k-coverage

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

School of Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Chapter

1 Citation (Scopus)

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 language	English
Title of host publication	Springer Optimization and Its Applications
Publisher	Springer
Pages	117-133
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-030-52824-9_7
Publication status	Published - 2020

Publication series

Name	Springer Optimization and Its Applications
Volume	162
ISSN (Print)	1931-6828
ISSN (Electronic)	1931-6836

ASJC Scopus subject areas

Control and Optimization

Access to Document

10.1007/978-3-030-52824-9_7

Cite this

@inbook{0c6282f6f89d40648734f946dfcf799a,

title = "k-coverage",

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

author = "Weili Wu and Zhao Zhang and Wonjun Lee and Du, {Ding Zhu}",

year = "2020",

doi = "10.1007/978-3-030-52824-9_7",

language = "English",

series = "Springer Optimization and Its Applications",

publisher = "Springer",

pages = "117--133",

booktitle = "Springer Optimization and Its Applications",

}

TY - CHAP

T1 - k-coverage

AU - Wu, Weili

AU - Zhang, Zhao

AU - Lee, Wonjun

AU - Du, Ding Zhu

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-030-52824-9_7

DO - 10.1007/978-3-030-52824-9_7

M3 - Chapter

AN - SCOPUS:85091911562

T3 - Springer Optimization and Its Applications

SP - 117

EP - 133

BT - Springer Optimization and Its Applications

PB - Springer

ER -

k-coverage

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this