k-Coverage

Weili Wu, Zhao Zhang, Wonjun Lee and Ding-Zhu Du
Additional contact information
Weili Wu: University of Texas at Dallas
Zhao Zhang: Zhejiang Normal University
Wonjun Lee: Korea University
Ding-Zhu Du: University of Texas at Dallas

Chapter Chapter 7 in Optimal Coverage in Wireless Sensor Networks, 2020, pp 117-133 from Springer

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

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-52824-9_7

Ordering information: This item can be ordered from
http://www.springer.com/9783030528249

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

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().