No Wait, No Waste: A Novel and Efficient Coordination Algorithm for Multiple readers in RFID Systems

How to efficiently coordinate multiple readers to work together is critical for high throughput in RFID systems. Existing researchers focus on designing efficient reader scheduling strategies that arrange adjacent readers to work in different time to avoid signal collisions. However, the impact of unbalanced tag number of readers on tag read throughput is still very challenging. In RFID systems, the distribution of tags is usually variable and uneven, which makes the number of tags covered by each reader (i.e. the load of it) imbalanced. This imbalance leads to different execution time for readers: the heavy load readers take longer time to collect all tags, while the other readers that finish execution earlier have to wait for nothing. To avoid this useless waiting and improve the system throughput, this paper focuses on the load balancing problem of multiple readers. It is an NP-hard problem, for which we design heuristic algorithms that adjust readers’ interrogation regions according to designed strategies to efficiently balance their loads. The amazing advantage of our algorithm is that it can be adopted by almost all existing protocols in multi-reader systems, including the reader scheduling protocol, to improve system throughput. Extensive experiments demonstrate that our algorithm can significantly improve the throughput in various scenarios.