| Preface | 5 |
---|
| Contents | 7 |
---|
| 1 Introduction | 11 |
---|
| 1.1 RFID Technology | 11 |
| 1.2 FSA Stability | 12 |
| 1.3 Tag Counting | 13 |
| 1.4 Tag Monitoring | 14 |
| 1.5 Book Organization | 14 |
| References | 15 |
| 2 Stability Analysis of Frame Slotted Aloha Protocol | 17 |
---|
| 2.1 Introduction | 17 |
| 2.1.1 Context and Motivation | 17 |
| 2.1.2 Summary of Contributions | 18 |
| 2.2 Related Work | 19 |
| 2.3 System Model | 20 |
| 2.3.1 Physical Layer and Random Access Model in FSA | 20 |
| 2.3.2 Traffic Model | 21 |
| 2.3.3 Packet Success Probability | 22 |
| 2.3.3.1 Packet Success Probability of FSA-SPR | 22 |
| 2.3.3.2 Packet Success Probability of FSA-MPR | 23 |
| 2.4 Main Results | 23 |
| 2.4.1 Results for FSA-SPR | 25 |
| 2.4.2 Results for FSA-MPR | 26 |
| 2.5 Stability Analysis of FSA-SPR | 27 |
| 2.5.1 Characterising Backlog Markov Chain | 27 |
| 2.5.2 Stability Analysis | 29 |
| 2.5.3 System Behavior in Instability Region | 34 |
| 2.6 Stability Analysis of FSA-MPR | 37 |
| 2.6.1 Stability Analysis | 37 |
| 2.6.2 System Behavior in Instability Region | 39 |
| 2.7 Discussion | 41 |
| 2.8 Numerical Results | 42 |
| 2.8.1 Stability Properties of FSA | 42 |
| 2.8.2 Comparison Under Different Frame Sizes | 43 |
| 2.8.3 Comparison Between FSA-SPR and FSA-MPR | 44 |
| 2.9 Conclusion | 45 |
| 2.10 Proofs | 45 |
| 2.10.1 Proof of Lemma 2.3 | 45 |
| 2.10.2 Proof of Lemma 2.6 | 47 |
| 2.10.3 Proof of Lemma 2.7 | 50 |
| References | 51 |
| 3 From Static to Dynamic Tag Population Estimation: An Extended Kalman Filter Perspective | 53 |
---|
| 3.1 Introduction | 53 |
| 3.1.1 Context and Motivation | 53 |
| 3.1.2 Summary of Contributions | 54 |
| 3.2 Related Work | 54 |
| 3.2.1 Tag Population Estimation for Static RFID Systems | 55 |
| 3.2.2 Tag Population Estimation for Dynamic RFID Systems | 55 |
| 3.3 Technical Preliminaries | 56 |
| 3.3.1 Extended Kalman Filter | 57 |
| 3.3.2 Boundedness of Stochastic Process | 58 |
| 3.4 System Model and Problem Formulation | 60 |
| 3.4.1 System Model | 60 |
| 3.4.2 Tag Population Estimation Problem | 60 |
| 3.5 Tag Population Estimation: Static Systems | 61 |
| 3.5.1 System Dynamics and Measurement Model | 61 |
| 3.5.2 Tag Population Estimation Algorithm | 62 |
| 3.6 Tag Population Estimation: Dynamic Systems | 64 |
| 3.6.1 System Dynamics and Measurement Model | 64 |
| 3.6.2 Tag Population Estimation Algorithm | 64 |
| 3.6.3 Detecting Tag Population Change: CUSUM Test | 65 |
| 3.7 Performance Analysis | 67 |
| 3.7.1 Static Case | 68 |
| 3.7.2 Dynamic Case | 75 |
| 3.8 Discussion | 80 |
| 3.9 Numerical Analysis | 81 |
| 3.9.1 Algorithm Verification | 81 |
| 3.9.2 Algorithm Performance | 82 |
| 3.9.2.1 Static System (zk=104) | 83 |
| 3.9.2.2 Dynamic System | 84 |
| 3.10 Conclusion | 84 |
| References | 84 |
| 4 Finding Needles in a Haystack: Missing Tag Detection in Large RFID Systems | 86 |
---|
| 4.1 Introduction | 86 |
| 4.1.1 Motivation and Problem Statement | 86 |
| 4.1.2 Prior Art and Limitation | 87 |
| 4.1.3 Proposed Solution and Main Contributions | 88 |
| 4.2 Related Work | 89 |
| 4.2.1 Probabilistic Protocols | 89 |
| 4.2.2 Deterministic Protocols | 89 |
| 4.2.3 Bloom Filter | 90 |
| 4.3 System Model and Problem Formulation | 90 |
| 4.3.1 System Model | 90 |
| 4.3.2 Problem Formulation | 90 |
| 4.4 Bloom Filter-Based Missing Tag Detection Protocol | 92 |
| 4.4.1 Design Rational and Protoco
|