Comparison of Random Key Predistribution Schemes in Wireless Sensor Networks Based on Average Distance

论文摘要

传感器网络的生存周期取决于传感器节点所存储的电源。电源消耗主要包括感知、通讯、数据处理三个部分,数据通讯包括转发和接收消息。在随机密钥预分配方案中,密钥被随机地从密钥池中选择,预先装配到每个传感器结点的内存。在传感器节点分布完成后,通过在拥有相同密钥的节点之间建立路径,得到了一张无线传感器网络的密钥图。为了达到节约结点有限电源的目的,信息在任意两个结点之间传递的平均路径距离,是衡量传感器网络性能的一个很重要的标准。因此,本文首先提出密钥图的平均距离作为判断密钥预分配方案性能的一个标准。平均路径距离,是基于所有节点之间的总距离推算得出来的。评判标准是：平均路径距离值越小,密钥方案越好。这是因为较小的平均路径距离意味着较低的能源消耗。本文比较了基本的随机密钥分配方案、q-密钥方案、随机对密钥方案、邻近对密钥方案。实验显示,邻近对密钥方案在平均路径距离上表现好,而随机密钥分配方案最差,随机密钥分配方案略强于q-密钥方案。实验同时显示,伴随着结点的度增加,跳数减少,因此平均路径距离减少。其他对平均路径距离有影响的因素包括：密钥环的大小、节点通讯半径、分布模式、网络规模（指结点密度）。通过实验观察到,随机密钥分配方案在结点与通讯范围内的邻居结点没有产生共享密钥时,平均路径比较长；而当结点的密钥环大小增加时,相应地平均路径距离迅速减小。基于上述考虑,本文提出一种新的随机密钥分配增强方案：每个结点都分配一个特别的密钥,它们在密钥路径建立过程中使用,以达到缩减平均路径距离长度的作用。模拟实验表明,本文提出的增强方案相对于随机密钥分配方案来说,性能有显著的提高。

论文目录

• Abstract
• 摘要
• Acknowledgement
• Table of Contents
• List of Figures
• List of Tables
• Chapter 1:Introduction
• 1.1 Introduction
• 1.2 Effect of Reducing the Average Distance
• 1.3 Problem Statement
• 1.4 Contribution of this Thesis
• 1.5 Components of a Sensor Node
• 1.6 Wireless Sensor Network Models
• 1.6.1 Hierarchical Model
• 1.6.2 Distributed Model
• 1.7 Ap plication of Wireless Sensor Nodes
• 1.8 Outline
• Chapter 2:Communication and Security Challenges in WSN
• 2.1 Introduction
• 2.2 Communication in WSN
• 2.3 Importance of Multi-hop Communication in WSN
• 2.4 Security Requirements
• 2.5 Security Challenges
• 2.6 Attacks on WSN
• 2.6.1 Classification of Attacks
• 2.6.2 Specific Attacks
• 2.7 Effects of the Attacks on WSN
• 2.8 Measures to Mitigate the Attacks
• 2.9 Security Design Considerations
• 2.10 Conclusion
• Chapter 3:Key Distribution in WSN
• 3.1 Introduction
• 3.2 Sensor Networks based on Random Key Distribution Mechanisms
• 3.2.1 Basic Probabilistic
• 3.2.2 Q-Composite Scheme
• 3.2.3 Random Pair-Wise Scheme
• 3.2.4 Closest Pair-Wise Scheme
• 3.3 Constraints in Designing a Key Distribution Scheme
• 3.4 Key Distribution Phases in Random Key Predistribution Schemes
• 3.5 Sensor Network Connectivity with Random-graph Theory
• 3.6 Conclusion
• Chapter 4:Comparison of the Random Key Predistribution Schemes based on AverageDistance
• 4.1 Overview
• 4.2 Evaluation Metrics for the Comparison
• 4.3 Calculating the Average Distance
• 4.4 Advantage of Average Distance in Key Predistribution Schemes
• 4.5 Simulation
• 4.5.1 Analysis
• 4.6 Conclusion
• Chapter 5:A New Scheme Based on Enhancing the Random Pair-wise KeyPredistribution Scheme
• 5.1 Introduction
• 5.2 Key Initialization
• 5.3 Shared Key Discovery
• 5.4 Path Key Establishment
• 5.5 Path Key Establishment Using the Unique Key
• 5.6 Simulation with Enhancements
• 5.7 Analysis
• 5.8 Communication Overhead
• 5.9 Resistance to Node Capture
• 5.10 Scalability
• 5.11 Conclusion
• REFERENCE
• APPENDIX