Protocols for Secure Communication in Wireless Sensor Networks

More documents

Recommendations

Info

134 Chapter 5. Multipath Communication However, a tree provides a routing path for each pair of nodes. In total, the spanning tree requires less effort than maintaining pairwise paths individually. As for the price to pay, the length of a tree path is usually longer than the shortest path between any two nodes. We therefore prefer constructions for spanning trees that minimize their depth. Using optimal (shallow) spanning trees, we can expect the average path length to be approximatly twice the length of a direct path. 5.2.2 Spanning Tree Construction We describe a simple distributed spanning tree construction algorithm. This algorithm is not optimized to take parameters like link quality into account. However, an improved version could be designed based on existing approaches such as [9]. One node initiates the construction of a tree and will become its root. New spanning trees are constructed according to a certain schedule, or they may be constructed “spontaneously”, i.e. any node can initiate a tree construction when it sees fit. When using tree-based routing, the message load is unequally distributed. Nodes closer to the root of a tree are likely to be burdened with forwarding more messages than nodes closer to the leaves, thus a tree should have limited lifetime. When a tree’s lifetime expires, the associated information can be deleted. In order to avoid synchronisation issues between nodes, we assume that all nodes have lightly synchronised clocks and we assume that when the lifetime of a tree t expires, a node would cease to send own messages along that tree, but still relay messages from other nodes for a certain period. The algorithm for constructing and routing on a tree is semi-formally given as Algorithm 2. It is defined in an event-driven manner, i.e. each node continously runs this algorithm and reacts to the described events. Construction starts with a node sending a INIT message to its neighbours, who will forward this message to their own neighbours, and so forth. Each node then waits for its neighbours to respond with either a CHILD or a BOUND message. After all neighbours have answered, the node itself responds to the neighbours from where it has received the INIT message. The response contains an address space A that describes all the addresses being reachable within its subtree. The actual type for addresses will be discussed later. Note that the algorithm does not explicitly enforce shallow trees. For simplicity, we assume that this property of trees emerges from the fact that a message on a direct link is always faster than on an indirect link over multiple hops. As this assumption may not hold in practice, the algorithm might have to
5.2. Routing on Spanning Trees 135 be adapted to ensure that a node is connected to the parent that is closest to the root. Each node maintains a data structure T for each spanning tree, which holds the information required for routing. For a tree with identifier t, an entry T [t] is maintained. Such an entry has the following components: • parent – The parent node within this tree (where the root is its own parent). • reach – A mapping from child identifiers to their covered address space. For a child c, T [t].reach(c) is a representation of the address space reachable through c. If a message is destined to address d and d ∈ T [t].reach(c), node c may either be qualified to handle the message itself, or deliver it to a node closer to d. It is well possible that, during tree construction, overlaps between children occur and part of the address space is covered by multiple children. This is due to the (possible) fuzziness of the ⊎ operator, which merges the address spaces of a node and its children. We will discuss the inefficiencies that may arise when instantiating the routing framework with concrete schemes. 5.2.3 Addressing on Spanning Trees A critical aspect of tree-based routing is which type of addressing should be used. We discuss a canonical addressing scheme, which is useful only for a limited range of applications, and a more generally applicable geographical addressing scheme. Definitions Generally, we can consider an abstract address space D. With each node u, a set coveru ⊂ D is associated that comprises the set of addresses under which node u can be reached. Viewed from a different perspective, if for a target address d ∈ D of a message, d ∈ coveru, node u will be eligible to receive and process the message. A node may be part of multiple trees and for every tree, the above predicate should yield a different part of the address space. For a specific tree t, we will therefore write cover (t) u . We require an operation for combining addresses, which we will denote as ⊎. Two address covers D1,D2 ⊂ D combined using this operation satisfy the
Page 1:
Diss. ETH Nr. 18174 Protocols for S
Page 4 and 5:
ii often ad hoc and transient natur
Page 6 and 7:
iv Dieses Ziel kann durch kryptogra
Page 9 and 10:
Contents 1 Introduction 1 1.1 Backg
Page 11 and 12:
Contents ix 3.3.1 Basic Assumptions
Page 13 and 14:
Contents xi 6.3 Performance Evaluat
Page 15 and 16:
Chapter 1 Introduction 1.1 Backgrou
Page 17 and 18:
1.3. Contributions 3 on the other h
Page 19 and 20:
1.4. Thesis Outline 5 • Mario Str
Page 21 and 22:
Chapter 2 Wireless Sensor Networks
Page 23 and 24:
2.1. Applications of Wireless Senso
Page 25 and 26:
2.1. Applications of Wireless Senso
Page 27 and 28:
2.2. Sensor Node Characteristics 13
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
2.3. Related Network Types 21 zero,
Page 37 and 38:
2.3. Related Network Types 23 • P
Page 39 and 40:
2.3. Related Network Types 25 PAN,
Page 41 and 42:
2.4. Related Device Types 27 in con
Page 43 and 44:
2.4. Related Device Types 29 ports
Page 45 and 46:
2.5. Sensor Network Models 31 both
Page 47 and 48:
2.5. Sensor Network Models 33 are a
Page 49 and 50:
2.6. Simulation of Sensor Networks
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
2.7. Security Requirements 41 terac
Page 57 and 58:
2.7. Security Requirements 43 netwo
Page 59 and 60:
2.7. Security Requirements 45 acces
Page 61 and 62:
2.7. Security Requirements 47 2.7.6
Page 63 and 64:
2.7. Security Requirements 49 of te
Page 65 and 66:
2.8. Cryptography for Sensor Networ
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
2.9. Existing Approaches to Wireles
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Chapter 3 A Security Model for Wire
Page 81 and 82:
3.1. Attack Paths 67 field (cf. [17
Page 83 and 84:
3.1. Attack Paths 69 modules [63].
Page 85 and 86:
3.1. Attack Paths 71 closed environ
Page 87 and 88:
3.2. Attack Objectives 73 • Timel
Page 89 and 90:
3.2. Attack Objectives 75 Critical
Page 91 and 92:
3.2. Attack Objectives 77 Actors A
Page 93 and 94:
3.3. Adversary Characteristics 79 a
Page 95 and 96:
3.3. Adversary Characteristics 81 c
Page 97 and 98: 3.3. Adversary Characteristics 83 p
Page 99 and 100: 3.4. The Cost of End-to-End Securit
Page 101 and 102: 3.4. The Cost of End-to-End Securit
Page 103 and 104: 3.5. Approximating End-to-End Secur
Page 109 and 110: 3.7. Summary 95 Location-constraine
Page 111 and 112: Chapter 4 Key Establishment Shared
Page 113 and 114: 4.2. Random Key Pre-Distribution 99
Page 125 and 126: 4.3. Key Agreement Based on Hash Ch
Page 131 and 132: 4.4. Multiple Hash Chains for Key A
Page 133 and 134: 4.4. Multiple Hash Chains for Key A
Page 135 and 136: 4.5. Strengthening Random Key Pre-D
Page 137 and 138: 4.6. Related Work 123 pc = 0.33 Du-
Page 139 and 140: 4.6. Related Work 125 Probability o
Page 141 and 142: 4.7. Summary 127 The security of th
Page 143 and 144: Chapter 5 Multipath Communication T
Page 145 and 146: 5.1. Principles of Multipath Commun
Page 147: 5.2. Routing on Spanning Trees 133
Page 151 and 152: 5.2. Routing on Spanning Trees 137
Page 153 and 154: 5.2. Routing on Spanning Trees 139
Page 155 and 156: 5.3. Properties of Tree Paths 141 b
Page 157 and 158: 5.3. Properties of Tree Paths 143 a
Page 159 and 160: 5.3. Properties of Tree Paths 145 n
Page 161 and 162: 5.3. Properties of Tree Paths 147 F
Page 163 and 164: 5.3. Properties of Tree Paths 149 D
Page 165 and 166: 5.4. Security Evaluation 151 compro
Page 167 and 168: 5.5. Related Work 153 width usage a
Page 169 and 170: 5.5. Related Work 155 separation. F
Page 171 and 172: Chapter 6 Integrity-Preserving Comm
Page 173 and 174: 6.1. Authentication and Integrity P
Page 175 and 176: 6.2. Basic Interleaved Authenticati
Page 189 and 190: 6.3. Performance Evaluation 175 A B
Page 191 and 192: 6.3. Performance Evaluation 177 We
Page 193 and 194: 6.4. Security Evaluation 179 Bandwi
Page 195 and 196: 6.4. Security Evaluation 181 a sens
Page 197 and 198: 6.4. Security Evaluation 183 Number
Page 199 and 200:
6.4. Security Evaluation 185 We ass
Page 201 and 202:
6.4. Security Evaluation 187 Paths
Page 203 and 204:
6.4. Security Evaluation 189 ity of
Page 205 and 206:
6.4. Security Evaluation 191 of the
Page 207 and 208:
6.4. Security Evaluation 193 The se
Page 209 and 210:
6.5. Extended Interleaved Authentic
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
6.6. Comparing Interleaved and Mult
Page 223 and 224:
6.7. Applications 209 Psi 1 0.8 0.6
Page 225 and 226:
6.7. Applications 211 codes are att
Page 227 and 228:
6.7. Applications 213 domain. The r
Page 229 and 230:
6.9. Summary 215 simulations and by
Page 231 and 232:
Chapter 7 Conclusion This work prop
Page 233 and 234:
7.1. Secure Communication in Wirele
Page 235 and 236:
7.2. Future Work 221 7.1.4 Shortcut
Page 237 and 238:
Bibliography [1] Specification of t
Page 239 and 240:
Bibliography 225 1st European Works
Page 241 and 242:
Bibliography 227 [41] Rohan Chitrad
Page 243 and 244:
Bibliography 229 [64] L. Eschenauer
Page 245 and 246:
Bibliography 231 [85] Yahoo! Inc. D
Page 247 and 248:
Bibliography 233 [105] Kristof Van
Page 249 and 250:
Bibliography 235 [126] Anne Marie M
Page 251 and 252:
Bibliography 237 [150] Sylvia Ratna
Page 253 and 254:
Bibliography 239 [172] Thanos Stath
Page 255 and 256:
Bibliography 241 [192] Eric W. Weis
Page 257:
Curriculum Vitae Harald Vogt Person
show all

Protocols for Secure Communication in Wireless Sensor Networks

Create successful ePaper yourself

Delete template?

Save as template?