2007
DOI: 10.1109/tmc.2007.1020
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Hybrid Security Mechanisms for Heterogeneous Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0
1

Year Published

2007
2007
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 82 publications
(52 citation statements)
references
References 28 publications
0
51
0
1
Order By: Relevance
“…The storage space and energy consumption of each node is high. Kausar, et al, [11], proposed a key management scheme based on random key pre-distribution for heterogeneous sensor network. In the scheme, all the keys of the key pool are assigned to H-Sensors.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The storage space and energy consumption of each node is high. Kausar, et al, [11], proposed a key management scheme based on random key pre-distribution for heterogeneous sensor network. In the scheme, all the keys of the key pool are assigned to H-Sensors.…”
Section: Related Workmentioning
confidence: 99%
“…We use the network model given in [10] and describe in [11]. There are two types of node in the network mobile node MN and fixed node FN and a base station BS.…”
Section: Frameworkmentioning
confidence: 99%
“…For WMSNs proposed above, heavyweight computations should be performed by gateways. Furthermore, asymmetric-key solutions are difficult to implement in such a resource-constrained environment, and symmetric-key methods coupled with a priori key distribution schemes would be more appropriate to achieve goals of data secrecy and integrity [10].…”
Section: Requirements For Secure Routing In Wireless Meshmentioning
confidence: 99%
“…Next, a dynamic key management scheme is needed to create new and revoke old or compromised keys. Rigorous work has been published on random pre-deployment of keys [2,5,6,8,10,19] where a limited number of pair-wise or partial keys are randomly assigned to nodes before deployment. In general, the number of necessary pre-deployed keys or partial keys increases with network size [2,5,6,8,10,11].…”
Section: Introductionmentioning
confidence: 99%
“…Typically, a shared key is used since low complexity and energy requirements of the shared-key encryption schemes. Such a pair-wise key can be either generated from pre-deployed partial keys [2,5], or found among the pre-deployed keys [8,10,11,19], or established through a third party who shares the pair-wise keys with each of the nodes in the pair [2,5,8,10,11,19]. In contrast, the proposed scheme dynamically creates pair-wise keys between neighbor nodes during short initial postdeployment phase.…”
Section: Introductionmentioning
confidence: 99%