Ieee Infocom 2009 2009
DOI: 10.1109/infcom.2009.5061943
|View full text |Cite
|
Sign up to set email alerts
|

Full-Coverage and k-Connectivity (k=14,6) Three Dimensional Networks

Abstract: Abstract-In this paper, we study the problem of constructing full-coverage three dimensional networks with multiple connectivity. We design a set of patterns for full coverage and two representative connectivity requirements, i.e. 14-and 6-connectivity. We prove their optimality under any ratio of the communication range over the sensing range among regular lattice deployment patterns. We also conduct a study on the proposed patterns under practical settings. To our knowledge, our work is the first one that pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
48
0
1

Year Published

2010
2010
2014
2014

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 67 publications
(49 citation statements)
references
References 27 publications
(35 reference statements)
0
48
0
1
Order By: Relevance
“…After that, more and more researchers focus on putting the wireless sensor network into practice. Some paper discussed the problem in full coverage network mode [10][11][12]. The concept of barrier coverage was first introduced by Gage in the context of robot systems [13].…”
Section: Related Workmentioning
confidence: 99%
“…After that, more and more researchers focus on putting the wireless sensor network into practice. Some paper discussed the problem in full coverage network mode [10][11][12]. The concept of barrier coverage was first introduced by Gage in the context of robot systems [13].…”
Section: Related Workmentioning
confidence: 99%
“…Zhou et al [5] present two algorithms for discovering boundary nodes and constructing boundary surfaces in 3D wireless networks. Bai et al [6] designed and proved the optimality of one and two connectivity patterns under any value of the ratio of communication range over sensing range, among regular lattice deployment patterns. Slab Routing by Chiang and Peng [7] adapts 2D geographic face routing techniques to 3D space by dynamically creating a space partition and executing face routing over the planar projected graph of nodes contained within.…”
Section: Related Workmentioning
confidence: 99%
“…However, this protocol configures a network using centred control algorithm which limits the network scale, and at present most of the literatures 2 International Journal of Distributed Sensor Networks have not introduced this probability coverage model into three-dimensional sensor networks. In fact, most practical applied wireless sensor networks are deposited in threedimensional sensor networks so that it will be more accurate if it is simulated in a three-dimensional space [12,13]. In [12], Bai et al proposed and designed a series of connected coverage models in three-dimensional wireless sensor networks with low connectivity and full coverage.…”
Section: Introductionmentioning
confidence: 99%