Resilient Wireless Sensor Networks (eBook)

Preface 8
Contents 10
1 Introduction 12
1.1 Wireless Sensor Networks 12
1.2 Wireless Sensor Networks Failures 13
1.3 Resilient Operation of WSNs 14
1.4 Network Coding: Concepts and Advantages 16
1.5 Book Organization 18
References 18
2 Network Coding-Based Resilient WSNs: The Centralized Approach 19
2.1 Problem Description 19
2.2 Network Coding-Based Resilience Approach 21
2.2.1 Assumptions, Definitions and Notation 21
2.2.2 Sufficient and Necessary Conditions 23
2.3 Generalizations and Practical Considerations 25
2.3.1 General Network Topology 25
2.3.2 Multiple Failures 26
2.3.3 The Case of |L| > n+1
2.3.4 Networks with Limited Minimum Cuts 27
2.3.5 MILP Formulation 28
2.4 Coding 30
2.4.1 Path Coding and Tree Coding 30
2.4.2 Constructing a Coding Tree 33
2.5 Network Performance 35
2.6 Chapter Summary 38
References 38
3 Network Coding-Based Resilient WSNs: The Distributed Approach 39
3.1 Tolerating a Single Loss 39
3.1.1 Assumptions and Notation 39
3.1.2 Rules of Operation 40
3.2 Tolerating Multiple Losses 44
3.3 Coding/Decoding Issues 46
3.3.1 Relative Indexing for Efficient Encoding 46
3.3.2 Best Effort Decoding 48
3.4 Routing for Maximally Disjoint Paths 50
3.5 Selecting Parameter h 54
3.5.1 Evaluating P(rcv) 57
3.6 Simulation Results 59
3.7 Chapter Summary 61
Reference 62
4 Transmissions Scheduling in Network Coding-Based Resilient WSNs 63
4.1 Introduction 63
4.2 Scheduling Based on Digital Network Coding 65
4.3 Scheduling Based on Analog Network Coding 67
4.3.1 Special Case: When ?L = 2 68
4.3.2 Special Case: When G is a Tree 69
4.3.3 Maximum Gain of ANC-Based Scheduling 71
4.4 Performance Evaluation and Comparison 72
4.5 Chapter Summary 74
References 75
5 Conclusions 76