MARC details
| 000 -LEADER |
|---|
| fixed length control field |
05937nam a22002537a 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
210301b2016 a|||f mb|| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
EG-CaNU |
| Transcribing agency |
EG-CaNU |
| 041 0# - Language Code |
|---|
| Language code of text |
eng |
| Language code of abstract |
eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005 |
| 100 0# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Abdel Rahman Youssef Mohamed Fahim |
| 245 1# - TITLE STATEMENT |
|---|
| Title |
RFID Tag Identification Using Bit Tracking / |
| Statement of responsibility, etc. |
Abdel Rahman Youssef Mohamed Fahim |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Date of publication, distribution, etc. |
2016 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
65 p. |
| Other physical details |
ill. |
| Dimensions |
21 cm. |
| 500 ## - GENERAL NOTE |
|---|
| Materials specified |
Supervisor: Tamer ElBatt |
| 502 ## - Dissertation Note |
|---|
| Dissertation type |
Thesis (M.A.)—Nile University, Egypt, 2016 . |
| 504 ## - Bibliography |
|---|
| Bibliography |
"Includes bibliographical references" |
| 505 0# - Contents |
|---|
| Formatted contents note |
Contents:<br/>Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1<br/>1.1 RFID overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2<br/>1.2 Thesis organization . . . . . . . . . . . . . . . . . . . . . . . . . . . 4<br/>2. Literature Survey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6<br/>2.1 Tag collision . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6<br/>2.2 Reader-reader collision . . . . . . . . . . . . . . . . . . . . . . . . . 8<br/>3. Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11<br/>3.1 Bit tracking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11<br/>3.2 Optimal binary tracking tree protocol (OBTT) [2] . . . . . . . . . . 12<br/>4. Multi-Reader RFID Tag Identification using Bit Tracking (MRTI-BT) . . 15<br/>4.1 System model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16<br/>4.2 Multi-reader RFID tag identification using bit tracking (MRTI-BT) 17<br/>4.2.1 Random number generation . . . . . . . . . . . . . . . . . . 19<br/>4.2.2 Collision handling . . . . . . . . . . . . . . . . . . . . . . . 21<br/>ix<br/>4.2.3 Parallel identification . . . . . . . . . . . . . . . . . . . . . 25<br/>4.3 Performance evaluation . . . . . . . . . . . . . . . . . . . . . . . . 27<br/>4.3.1 Simulation setup . . . . . . . . . . . . . . . . . . . . . . . . 28<br/>4.3.2 Simulation results . . . . . . . . . . . . . . . . . . . . . . . 28<br/>5. Repetition Gain in Bit-tracking Anti-Collision Algorithms to Recover Mistransition<br/>Bit Error . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33<br/>5.1 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34<br/>5.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34<br/>5.3 Mis-transition selective recovering (MSR) . . . . . . . . . . . . . . 38<br/>5.3.1 Choosing most reliable collided bit . . . . . . . . . . . . . . 39<br/>5.3.2 Recovering bit errors . . . . . . . . . . . . . . . . . . . . . . 40<br/>5.3.3 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40<br/>5.4 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 43<br/>5.4.1 Simulation Results . . . . . . . . . . . . . . . . . . . . . . . 43<br/>6. Conclusion and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . 47<br/>6.1 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47<br/>6.2 Future work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48<br/>Bibliography . . . . . . . |
| 520 3# - Abstract |
|---|
| Abstract |
Abstract:<br/>In this work, we study the problem of tag identification in single and multi-reader<br/>RFID systems. First, we propose a novel solution to the reader-to-reader collisions<br/>and tag collisions in multi-reader systems, using the concept of bit tracking. Second,<br/>we explore the bit error types that could occur while using bit tracking. Although bit<br/>tracking has a significant contribution on decreasing the identification time, we define<br/>a bit error type coined mis-transition that occurs in bit-tracking based protocols only.<br/>In addition, we propose a novel technique that tackles mis-transition bit error.<br/>RFID systems consist of one or more readers and tags. Our main focus in this<br/>work is on battery free RFID tag which is known as passive tags. Passive tags harvest<br/>energy from RFID reader and follow the reader’s commands for collision resolving and<br/>slot assigning.<br/>In the first part of this work, we propose the multi-reader RFID tag identification<br/>using bit tracking (MRTI-BT) algorithm which allows concurrent tag identification,<br/>by neighboring RFID readers, as opposed to time-consuming scheduling. First,<br/>MRTI-BT identifies tags exclusive to different RFIDs, concurrently. Second, the concept<br/>of bit tracking and the proposed parallel identification property are leveraged<br/>to reduce the identification time compared to the state-of-the-art. Our simulation<br/>results exhibit considerable performance improvement with 113% reduction in the<br/>identification time, on the average, compared to Season algorithm [1].<br/>iv<br/>In the second part of this work, we investigate the bit errors that could occur while<br/>using bit tracking. Bit tracking based anti-collision algorithms have gained researchers<br/>interest due to their significant contribution in decreasing the identification time.<br/>They allow readers to detect the location of collided bits in a collision slot. However,<br/>through our deep investigation in bit tracking, we found a new significant bit error<br/>called mis-transition which increases the identification time. Mis-transition bit error<br/>is different from flipped bit error and it occurs when a reader mistakenly declares<br/>collision. In this work, we study and evaluate the effect of mis-transition bit error. In<br/>addition, we propose a zero cost algorithm that tackles this problem without using any<br/>coding scheme i.e, without adding extra coding bits. Tags may send their ID many<br/>times to resolve collision. We make use of the successfully received bits in collision<br/>slots to recover mis-transition bit error. Our simulations show the great potential of<br/>using repetition gain on recovering bit errors. |
| 546 ## - Language Note |
|---|
| Language Note |
Text in English, abstracts in English. |
| 650 #4 - Subject |
|---|
| Subject |
Wireless Technologies |
| 655 #7 - Index Term-Genre/Form |
|---|
| Source of term |
NULIB |
| focus term |
Dissertation, Academic |
| 690 ## - Subject |
|---|
| School |
Wireless Technologies |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Thesis |
| 650 #4 - Subject |
|---|
| -- |
327 |
| 655 #7 - Index Term-Genre/Form |
|---|
| -- |
187 |
| 690 ## - Subject |
|---|
| -- |
327 |