A Novel RFID Tag Identification Protocol: Adaptive n-Resolution and k-Collision Arbitration |
| |
Authors: | Kuo-Hui Yeh Nai-Wei Lo Kuo-Yu Tsai Yingjiu Li Enrico Winata |
| |
Affiliation: | 1. Department of Information Management, National Dong Hwa University, Hualien, 974, Taiwan 2. Department of Information Management, National Taiwan University of Science and Technology, Taipei, 106, Taiwan 3. Department of Management Information Systems, Hwa Hsia Institute of Technology, New Taipei City, 235, Taiwan 4. School of Information Systems, Singapore Management University, Singapore, 178902, Singapore
|
| |
Abstract: | Since radio frequency identification (RFID) technology has become increasingly common in numerous applications, including large-scale supply chain management, improving the efficiency of RFID tag identification is an important task. In practical settings, the identification of RFID tags often occurs in a dynamic environment, in which tags move through a specific interrogation range. However, the literature contains few studies on the design of efficient identification protocols in dynamic environments. This study proposes a novel tag identification protocol that is particularly efficient in dynamic environments. the proposed protocol involves two anti-collision techniques: adaptive n-Resolution (AnR) and k-Collision Arbitration (kCA). These two techniques significantly improve the tag identification delay and communication overhead. This improvement is primarily due to the use of a newly designed challenge-response bit sequence mechanism and the information obtained from the previous tag identification procedure. As a result, AnR requires only a constant number of interrogation times regardless of the number of target tags, while kCA further improves the efficiency of tag identification with \(k\) -splitting collision arbitration. Rigorous analysis and simulation experiments show that this tag identification protocol significantly outperforms related methods (by at least 48.85 % identification delay and 23.87 % communication overhead can). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|