Proceedings of the Fourth ACM Workshop on Security of Ad Hoc and Sensor Networks 2006
DOI: 10.1145/1180345.1180365
|View full text |Cite
|
Sign up to set email alerts
|

Location-aware key predistribution scheme for wide area wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
40
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(40 citation statements)
references
References 8 publications
0
40
0
Order By: Relevance
“…In Simonova et al 's [27] scheme, the number of specialized nodes depends upon the size of the network unlike ours which is constant (=1). The resiliency as given in the graph is much lower compared to our scheme.…”
Section: Lemma 15 When S Ij Number Of Nodes Are Compromised In Groupmentioning
confidence: 72%
See 3 more Smart Citations
“…In Simonova et al 's [27] scheme, the number of specialized nodes depends upon the size of the network unlike ours which is constant (=1). The resiliency as given in the graph is much lower compared to our scheme.…”
Section: Lemma 15 When S Ij Number Of Nodes Are Compromised In Groupmentioning
confidence: 72%
“…Lemma 3 says that in order to compromise the links between any two nodes, the adversary is required to compromise at least c (c is the security parameter) nodes having Figure 5 Graphical comparison of fraction of links disconnected. This comparison is done with respect to the number of nodes compromised for our scheme and the schemes in [18,20,21,[23][24][25][26][27][28][29]39,40]. http://jwcn.eurasipjournals.com/content/2013/1/145 information from the same key space as the two nodes.…”
Section: Lemma 15 When S Ij Number Of Nodes Are Compromised In Groupmentioning
confidence: 99%
See 2 more Smart Citations
“…Schemes combining a square grid with polynomial-based key predistribution are discussed in [12,14,19,22,28]; a square grid with random key predistribution was considered in [5], and the combination of a square grid with a scheme due to Lee and Stinson was considered in [26]. Papers describing the use of hexagonal grids with polynomial-based key predistribution include [3,[9][10][11]17,18,22,31]; hexagonal grids combined with random key predistribution were analysed in [24].…”
Section: Location-aware Schemesmentioning
confidence: 99%