Efficient memoryless protocol for tag identification (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Proceedings of the 2004 international symposium on Low power electronics and design
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
An Enhanced Dynamic Framed Slotted ALOHA Algorithm for RFID Tag Identification
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Collision avoidance in a dense RFID network
WiNTECH '06 Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation & characterization
Energy-Aware Tag Anti-Collision Protocols for RFID Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Performance-effective and low-complexity redundant reader detection in wireless RFID networks
EURASIP Journal on Wireless Communications and Networking - Intelligent Systems for Future Generation Wireless Networks
Alleviating reader collision problem in mobile RFID networks
Personal and Ubiquitous Computing
Improved bit-by-bit binary tree algorithm in ubiquitous ID system
PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
Guest editorial: Advances in RFID technology
Information Systems Frontiers
Information Systems Frontiers
| Hi-index | 0.00 |
With the emergence of wireless RFID technologies, the problem of Anti-Collision has been arousing attention and instigated researchers to propose different heuristic algorithms for advancing RFID systems operated in more efficient manner. However, there still have challenges on enhancing the system throughput and stability due to the underlying technologies had faced different limitation in system performance when network density is high. In this paper, we present a Threshold Jumping (TJ) and a Wrap-Around Scan (WAS) techniques, which are query tree based approaches, aiming to coordinate simultaneous communications in high density RFID environments, to speedup tag identification, to increase the overall read rate and to improve system throughput in large-scale RFID systems. The main idea of the Threshold Jumping is to limit the number of collisions. When the number of collisions exceeds a predefined threshold, it reveals that tag density in RF field is too high. To avoid unnecessary enquiry messages, the prefix matching will be moved to next level of the query tree, alleviating the collision problems. The method of setting frequency bound indeed improves the efficiency in high density and randomly deployed RFID systems. However, in irregular or imbalanced RFID networks, inefficient situation may happen. The problem is that the prefix matching is performed in single direction level-order scheme, which may cause an imbalance query tree on which the right sub-tree always not been examined if the identification process goes to next level before scan the right sub-tree due to threshold jumping. By scanning the query tree from right to left in alternative levels, i.e., wrap-around, this flaw cold be ameliorated. To evaluate the performance of proposed techniques, we have implemented the TJ and the WAS method along with the query tree protocol. The simulation results show that the proposed techniques provide superior performance in high density environments. It is shown that the TJ and WAS are effective in terms of increasing system throughput and minimizing identification delay.