2012
DOI: 10.1007/978-3-642-33383-5_9
|View full text |Cite
|
Sign up to set email alerts
|

100% Connectivity for Location Aware Code Based KPD in Clustered WSN: Merging Blocks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(14 citation statements)
references
References 13 publications
0
14
0
Order By: Relevance
“…The work devises a protocol in the lines of an earlier works that perform efficiently with only one CH per cluster thereby establishes that 3 “agents” per cluster is a luxurious requirement of . More recent works imitate similar tricks as the literature (without due reference to these earlier works) while proposing their respective schemes. These schemes perform equally efficiently with only 1 “supernode” per cluster.…”
Section: Related Workmentioning
confidence: 93%
See 4 more Smart Citations
“…The work devises a protocol in the lines of an earlier works that perform efficiently with only one CH per cluster thereby establishes that 3 “agents” per cluster is a luxurious requirement of . More recent works imitate similar tricks as the literature (without due reference to these earlier works) while proposing their respective schemes. These schemes perform equally efficiently with only 1 “supernode” per cluster.…”
Section: Related Workmentioning
confidence: 93%
“…For instance, a desired property of a randomized scheme may occur only with a certain probability whereas they can be proven to hold in a deterministic scheme (refer to the literature). This led to proposals of numerous deterministic KPS etc using various combinatorial tricks. Certain KPS exploit special structures like unique factorization domain (UFD).…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations