EconPapers    
Economics at your fingertips  
 

Connected Sensor Cover

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 4 in Optimal Coverage in Wireless Sensor Networks, 2020, pp 33-65 from Springer

Abstract: Abstract The connected sensor cover was first studied by Cardei et al. The minimum connected sensor cover problem (Problem 1.3.2) was first proposed by Gupta, Das, and Gu. They presented a greedy algorithm with performance ratio O ( r ln n ) $$O(r \ln n)$$ where n is the number of sensors and r is the link radius of the sensor network, i.e., for any two sensors s and s′ with a sensing point in common, there exists a path between s and s′ with hop distance at most r in communication network. Zhang and Hou studied the minimum connected sensor cover problem in homogeneous wireless sensor networks with property that R c ≥ 2R s. They showed that in this case, the coverage of a connected target area implies the connectivity. This result was generalized by Zhou, Das, and Gupta to the m-connectivity that if every point in a connected target area is covered by at least m sensors, then those sensors induce an m-connected sensor network. Xing et al. presented a coverage configuration protocol which can give different degree of coverage requested by applications. Bai et al. studied a sensor deployment problem regarding the coverage and connectivity. Alam and Haas studied this problem in three-dimensional sensor networks.

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_4

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

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

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 ().

 
Page updated 2025-04-01
Handle: RePEc:spr:spochp:978-3-030-52824-9_4