Resource-Efficient Security Management in Wireless Sensor Networks

다국어 초록 (Multilingual Abstract)

Security in wireless sensor network (WSN) encompasses a great number of challenges; ranging from the nature of wireless communications, constrained resources of the sensors, unknown topologies of the deployed networks,
unattended and accessible environment where sensors might be susceptible to physical attacks, dense and large networks, etc.
In general, the research areas on security in WSN could be categorized as; (a) Key Management (b) Secure routing and transport, (c) Security services (deployment strategy, security framework, etc.) (d) Intrusion detection system
A single mechanism cannot solve all the issues. Keeping this point in mind; this thesis deals with security services and secure routing [areas (b) and (c)] in WSN. It analyzes the impact of security mechanisms on the resource efficiency in wireless sensor network. Here, the issue of resource-efficient security management in wireless sensor network is divided into two approaches. In the first approach, a secure network formation mechanism is proposed. This approach uses the notion of weakly connected dominating set (WCDS) to reduce the number of cluster-heads in the network for greater resource
efficiency. The clusters in the network are formed in a secure and efficient way so that no hostile entity could be included in any cluster during network structuring process. An efficient algorithm is proposed to form a network-wide
secure WCDS, which includes an optional re-keying mechanism to increase the level of security. The objective is to ensure security in distributed sensor network from the bootstrapping stage up to the beginning of its operation, and
of course with the goal of keeping the utilization of resources as low as possible.
In the second approach, a secure routing mechanism; SERP is proposed. SERP considers a dense deployment scenario of wireless sensor network. It ensures data transmission security for the network. According to the design goals, SERP structures the network in an energy-efficient way in which the base station or the intermediate nodes can detect the presence of falsely injected data. The resources of the network are used efficiently so that the
network can be resistant against node failures (due to resource exhaustion) before the expected lifetime.
Both the mechanisms emphasize on secure network structuring from the bootstrapping state of the network and try to utilize the available resources in the best possible way. We know that high level security requires more resource usage as that requires relatively more operations. Again, to achieve resource efficiency (energy, communication, processing, and memory) we need to
reduce the number of operations. So, in this sense, ensuring robust security and resource efficiency in WSN at the same time could be considered as contradictory objectives. The solutions proposed in this thesis make trade off between these two apparently contradictory parameters. Proposed mechanisms could be applied separately or jointly (if needed) for a particular wireless sensor network application. The analyses and results presented in the thesis show significant achievements and efficiency of our mechanisms.
Besides presenting two mechanisms to analyze the impact of security schemes on the resource usage of the tiny sensors, we present our view of security and
define various terminologies related to security in wireless sensor networks.

목차 (Table of Contents)

• CHAPTER 1 INTRODUCTION 1
• 1.1 BACKGROUND 3
• 1.1.1 Key Aspects to Consider for WSN Security 5
• 1.1.2 Feasibility of Different Security Approaches in WSN 8
• 1.2 MOTIVATION AND THESIS CONTRIBUTION 10
• 1.2.1 Motivation and Problem Description 10
• 1.2.2 Goals and Contributions 11
• 1.3 OUTLINE OF THIS THESIS 13
• CHAPTER 2 LITERATURE REVIEW: SECURITY ISSUES IN WIRELESS SENSOR NETWORK 15
• 2.1 DENIAL OF SERVICE (DOS) ATTACK 16
• 2.2 ATTACKS ON INFORMATION IN TRANSIT 22
• 2.3 SYBIL ATTACK 24
• 2.4 BLACKHOLE/SINKHOLE ATTACK 26
• 2.5 HELLO FLOOD ATTACK 27
• 2.6 WORMHOLE ATTACK 28
• 2.7 KEY MANAGEMENT ISSUES IN WSN 31
• 2.8 SECURE ROUTING AND PHYSICAL SECURITY ISSUES 35
• 2.9 RESEARCH CHALLENGES 38
• 2.9.1 Holistic Approach to Security in WSN 39
• 2.9.2 Achievements and Goals 40
• CHAPTER 3 PHASE I: SECURE CLUSTERING AND OPERATION IN DISTRIBUTED SENSOR NETWORKS 43
• 3.1 OVERVIEW 44
• 3.2 RELATED WORKS 47
• 3.3 NETWORK MODEL, ASSUMPTIONS, AND PRELIMINARIES 49
• 3.4 PROPOSED APPROACH OF SECURE CLUSTERING 53
• 3.4.1 Offline Rank Assignment with Key Pre-Distribution 54
• 3.4.2 Post Deployment Cluster Formation 56
• 3.4.3 Authenticated Message Delivery 59
• 3.4.4 Optional Re-keying Mechanism 60
• 3.5 PERFORMANCE EVALUATION AND COMPARISON 62
• 3.5.1 Simulation, Analysis, and Results 62
• 3.5.2 Limitations of our Approach 69
• 3.6 SUMMARY 70
• CHAPTER 4 PHASE II: SERP: SECURE ENERGY-EFFICIENT ROUTING PROTOCOL 71
• 4.1 INTRODUCTION 72
• 4.2 RELATED WORKS 74
• 4.3 ASSUMPTIONS AND PRELIMINARIES 77
• 4.3.1 Sensor Deployment and Network Model 77
• 4.3.2 Energy Model and Observations 77
• 4.3.3 Basic Terms and Definitions 79
• 4.3.4 Security Assumptions and Threat Model 81
• 4.3.5 Design Goals 82
• 4.4 SECURE ENERGY-EFFICIENT ROUTING PROTOCOL (SERP) 82
• 4.4.1 Tree Construction and OHC Initialization Phase 83
• 4.4.2 Network Operation and Secure Data Transmission Phase 87
• 4.4.3 Optional Key Refreshment 91
• 4.4.4 Repairing a Broken Path and OHC Re-Initialization 92
• 4.5 SIMULATION RESULTS AND PERFORMANCE ANALYSIS 94
• 4.5.1 Simulation 94
• 4.5.2 Storage Requirement for One-way Hash Chain 98
• 4.5.3 Security Analysis 100
• 4.5.3.1 Base Station Detection 100
• 4.5.3.2 Detection by the Intermediate Nodes 101
• 4.6 SUMMARY 103
• CHAPTER 5 CONCLUSIONS AND FUTURE WORKS 104
• BIBLIOGRAPHY 107