Skip to Main Content
In parallel with the proliferation of radio-frequency identification (RFID) systems, many RFID readers have been increasingly employed. In such an environment, collision among readers becomes a serious problem. Existing anticollision algorithms, depending on the information of neighboring readers, may require constant effort in order to grasp such information. Although it may be given by a server or a coordinator, they may not be suitable in dense and dynamic RFID networks with mobile readers. In this paper, we propose an efficient reader anticollision algorithm using a polling server in dense and dynamic RFID networks with mobile readers. Owing to the assistance of the server, the readers can rapidly decide whether they can work or not without interfering neighbors and can be easily synchronized. Our proposed algorithm is simple and makes readers aware of neighbors to minimize reader collisions. Performance evaluation shows how many readers can operate in a network and indicates that our proposed algorithm is more efficient than distributed color selection, colorwave, and hierarchical Q-learning algorithm, particularly in dense and mobile environments.