The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2009
DOI: 10.1109/tvt.2008.2008191
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Signal-Range-Based Probabilistic Key Predistribution Scheme in a Wireless Sensor Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
12
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(12 citation statements)
references
References 31 publications
0
12
0
Order By: Relevance
“…The threshold-based schemes [7,14] maintain network resiliency only when the number of compromised nodes is lesser than the threshold. The polynomial pool-based KPS [30] combines the idea of key pool [9,31] with poly-based KPS. In the scheme proposed in [30], the setup server randomly selects a subset of polynomials for each node.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The threshold-based schemes [7,14] maintain network resiliency only when the number of compromised nodes is lesser than the threshold. The polynomial pool-based KPS [30] combines the idea of key pool [9,31] with poly-based KPS. In the scheme proposed in [30], the setup server randomly selects a subset of polynomials for each node.…”
Section: Related Workmentioning
confidence: 99%
“…The polynomial pool-based KPS [30] combines the idea of key pool [9,31] with poly-based KPS. In the scheme proposed in [30], the setup server randomly selects a subset of polynomials for each node. All the nodes are assigned with the polynomial shares selected from the corresponding subsets.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In recent years, issue of key distribution and user authentication mechanisms received a substantial attention from researchers . Various schemes to authenticate users in WSNs have been designed as discussed in the review of , but most of these schemes are at risk of one or other security attacks.…”
Section: Introductionmentioning
confidence: 99%
“…To address the drawback, Huang et al [9] proposed a structure of dual hash chains, but the structure introduces high computational overheads by adopting a high-order polynomial. In [10], Nguyen et al proposed to use location information of sensor nodes to improve the secure connectivity, however, since the final positions of nodes are difficult to determined, the scheme that uses much deployment knowledge is controversial. In our previous work [15], WSN life-time improvement has been analyzed by introducing heterogeneous nodes.…”
mentioning
confidence: 99%