Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Pervasive Computing Goes the Last 100 Feet with RFID Systems
IEEE Pervasive Computing
Trust and Radio Frequency Identification (RFID) Adoption within an Alliance
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 07
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
Special Issue: Technology Strategy for Electronic Marketplaces
Journal of Management Information Systems
Managing RFID data in supply chains
International Journal of Internet Protocol Technology
An Agent-Oriented Dynamic Adaptive Threshold Transmission for XML Data on Networks
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Adaptive binary splitting for a RFID tag collision arbitration via multi-agent systems
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
| Hi-index | 0.00 |
One of problems that we faced for Radio frequency identification (RFID) systems is that the collision between tags which lowers the efficiency of the RFID systems. One of the popular anti-collision algorithms is ALOHA-type algorithms, which are simple and have good performance when the number of tags to be read is reasonable small. In this paper, an enhanced dynamic framed slotted ALOHA algorithm for RFID is extended to a more general close form, hence reference [9] becomes only one special case described in our paper. The improved ALOHA algorithm for RFID tag identifications has much larger capacity to handle the cases when the tag numbers increasing largely while every frame keeping the optimum system efficiency 35.5%. Simulation results show that the proposed algorithm improves the efficiency nicely in comparison with the conventional algorithms keeping 80% as the previous paper shown.