Font Size: a A A

Research Of Pairwise Key Establishment Schemes In Wireless Sensor Networks

Posted on:2009-10-21Degree:MasterType:Thesis
Country:ChinaCandidate:S J LiFull Text:PDF
GTID:2178360242990871Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
A wireless sensor network is composed of a large number of sensor nodes with limited power, computation, storage, and communication capabilities. Wireless sensor networks have received a lot of attention due to their wide applications in military as well as civilian fields to this day. In most cases, wireless sensor networks are randomly deployed in unattended even hostile environments. Compared with the other networks, wireless sensor networks are vulnerable to various potential attacks, such as eavesdropping, spoofing, traffic analysis, nodes capture etc.. So, security mechanism providing confidentiality, authentication, and data integrity is vital to ensure proper network operations. Key management is the core of the issues. However, due to the resource constraints on sensor nodes, it is not feasible to use traditional key management techniques such as public key cryptography and key distribution center(KDC).First, in this paper, a pairwise key establishment scheme based on trusted-initial is proposed. Compared with the corresponding scheme, the scheme can low the storage overhead on worker nodes and the power cost for distributing keys on service nodes remarkably in the case that the local connectivity is equal. Moreover, the resilience of this scheme is perfect, which is nothing to do with the nodes'deployment.Then, this paper proposes a pairwise key establishment scheme based on a combination of predistribution scheme and Hash function. Last, a pairwise key establishment scheme based on a combination of nodes'deployment knowledge, predistribution scheme and Hash function is presented, which considers secure management of continuity. In this scheme, there is almost no change in the performace of networks when we add nodes to networks to substitute for the dead or captured nodes. To the second scheme, theoretical and simulation analyses on local connectivity and resilience are presented. Simulation analysis of the third scheme is also provided. Compared with the corresponding schemes respectively, the results show that the two schemes can achieve low storage overhead and strong resilience in the case that the local connectivity is equal.
Keywords/Search Tags:Wireless sensor networks, Pairwise key, Key predistribution, Hash function, Deployment knowledge
PDF Full Text Request
Related items