2018
DOI: 10.4172/jcsb.1000276
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Approach to Preserve the Network Connectivity of WSN by Cautiously Removing the Crossing Edges Using COLS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…In general, the existing planar topology based WSN built by generating planarized graph, such as Relative Neighborhood Graph (RNG), Voronoi diagram, Delaunay triangulation, Gabriel Graph (GG) and some cross edge removal approaches do not provide any fault tolerance support on its own. Node failures can cause network partitioning and reduce the application performance [21][22][23]. Also, some restoration schemes do exist, but they didn't effectively consider the network coverage, connectivity and topology quality, which are also crucial to a WSN [6,10,[24][25][26].…”
Section: Introductionmentioning
confidence: 99%
“…In general, the existing planar topology based WSN built by generating planarized graph, such as Relative Neighborhood Graph (RNG), Voronoi diagram, Delaunay triangulation, Gabriel Graph (GG) and some cross edge removal approaches do not provide any fault tolerance support on its own. Node failures can cause network partitioning and reduce the application performance [21][22][23]. Also, some restoration schemes do exist, but they didn't effectively consider the network coverage, connectivity and topology quality, which are also crucial to a WSN [6,10,[24][25][26].…”
Section: Introductionmentioning
confidence: 99%