Security and cooperation in wireless networks : thwarting malicious and selfish behavior in the age of ubiquitous computing

This is the first self-contained text to consider security and non-cooperative behavior in wireless networks. Major networking trends are analyzed and their implications explained in terms of security and cooperation, and potential malicious and selfish misdeeds are described along with the existing and future security techniques. Fundamental questions of security including user and device identification; establishment of security association; secure and cooperative routing in multi-hop networks; fair bandwidth distribution; and privacy protection are approached from a theoretical perspective and supported by real-world examples including ad hoc, mesh, vehicular, sensor, and RFID networks. Important relationships between trust, security, and cooperation are also discussed. Contains homework problems and tutorials on cryptography and game theory. This text is suitable for advanced undergraduates and graduate students of electrical engineering and computer science, and researchers and practitioners in the wireless industry. Lecture slides and instructor-only solutions available online (www.cambridge.org/9780521873710).

• Preface p. xi
• Acknowledgements p. xvi
• Part I Introduction p. 1
• 1 The security of existing wireless networks p. 3
• 1.1 Vulnerabilities of wireless networks p. 4
• 1.2 Security requirements p. 6
• 1.3 How existing wireless networks are secured p. 7
• 1.4 Summary p. 31
• 1.5 To probe further p. 31
• 1.6 Questions p. 32
• 2 Upcoming wireless networks and new challenges p. 33
• 2.1 Introduction p. 33
• 2.2 Upcoming wireless networks p. 34
• 2.3 Trends and security challenges in wireless networks p. 68
• 2.4 Summary p. 69
• 2.5 To probe further p. 69
• 2.6 Questions p. 72
• 3 Trust assumptions and adversary models p. 74
• 3.1 About trust p. 74
• 3.2 Trust in the era of ubiquitous computing p. 76
• 3.3 Adversary p. 77
• 3.4 Summary p. 80
• 3.5 To probe further p. 80
• 3.6 Questions p. 81
• Part II Thwarting malicious behavior p. 83
• 4 Naming and addressing p. 85
• 4.1 The future of naming and addressing in the Internet p. 85
• 4.2 Attacks against naming and addressing p. 91
• 4.3 Protection techniques p. 94
• 4.4 Summary p. 101
• 4.5 To probe further p. 101
• 4.6 Questions p. 102
• 5 Establishment of security associations p. 103
• 5.1 Key establishment in sensor networks p. 104
• 5.2 Exploiting physical contact p. 117
• 5.3 Exploiting mobility p. 118
• 5.4 Exploiting the properties of vicinity and of the radio link p. 128
• 5.5 Revocation p. 134
• 5.6 Summary p. 136
• 5.7 To probe further p. 137
• 5.8 Questions p. 140
• 6 Securing neighbor discovery p. 141
• 6.1 The wormhole attack p. 142
• 6.2 Wormhole detection mechanisms p. 146
• 6.3 Summary p. 167
• 6.4 To probe further p. 167
• 6.5 Questions p. 168
• 7 Secure routing in multi-hop wireless networks p. 169
• 7.1 Routing protocols for mobile ad hoc networks p. 169
• 7.2 Attacks on ad hoc network routing protocols p. 182
• 7.3 Securing ad hoc network routing protocols p. 191
• 7.4 Provable security for ad hoc network routing protocols p. 217
• 7.5 Secure routing in sensor networks p. 226
• 7.6 Summary p. 234
• 7.7 To probe further p. 235
• 7.8 Questions p. 236
• 8 Privacy protection p. 237
• 8.1 Important privacy related notions and metrics p. 240
• 8.2 Privacy in RFID systems p. 243
• 8.3 Location privacy in vehicular networks p. 254
• 8.4 Privacy preserving routing in ad hoc networks p. 260
• 8.5 Summary p. 267
• 8.6 To probe further p. 268
• 8.7 Questions p. 270
• Part III Thwarting selfish behavior p. 273
• 9 Selfish behavior at the MAC layer of CSMA/CA p. 275
• 9.1 Operating principles of IEEE 802.11 p. 276
• 9.2 Detecting selfish behavior in hotspots p. 280
• 9.3 Selfish behavior in pure ad hoc networks p. 301
• 9.4 Summary p. 327
• 9.5 To probe further p. 328
• 9.6 Questions p. 329
• 10 Selfishness in packet forwarding p. 331
• 10.1 Game theoretic model of packet forwarding p. 332
• 10.2 Meta-model p. 335
• 10.3 Analytical results p. 338
• 10.4 Simulation results p. 343
• 10.5 Summary p. 347
• 10.6 To probe further p. 348
• 10.7 Questions p. 348
• 11 Wireless operators in a shared spectrum p. 350
• 11.1 Multi-domain sensor networks p. 350
• 11.2 Border games in cellular operators p. 361
• 11.3 Summary p. 376
• 11.4 To probe further p. 376
• 11.5 Questions p. 377
• 12 Secure protocols for behavior enforcement p. 379
• 12.1 System model p. 379
• 12.2 Cooperation-optimal protocol p. 381
• 12.3 Protocol for the routing stage p. 383
• 12.4 Protocol for packet forwarding p. 387
• 12.5 Discussion p. 389
• 12.6 Summary p. 390
• 12.7 To probe further p. 390
• 12.8 Questions p. 391
• Appendix A Introduction to cryptographic algorithms and protocols p. 393
• A1 Introduction p. 393
• A2 Encryption p. 394
• A3 Hash functions p. 407
• A4 Message authentication codes p. 409
• A5 Digital signatures p. 411
• A6 Session key establishment protocols p. 412
• A7 Pseudo-random number generators p. 417
• A8 Advanced authentication techniques p. 418
• A9 To probe further p. 422
• A10 Questions p. 422
• Appendix B A tutorial on game theory for wireless networks p. 423
• B1 Introduction p. 423
• B2 Static games p. 427
• B3 Dynamic games p. 437
• B4 Repeated games p. 444
• B5 Discussion p. 451
• B6 Summary p. 454
• B7 To probe further p. 454
• B8 Questions p. 455
• References p. 458
• Index p. 479