In the complex application environment of the internet of things

tag collision in RFID (radio frequency identification) technology has become one of the core research hotspots in recent years

which is the main reason for the high delay of tag identification and communication cost. To solve the problems above

a MRCT (multi-reader cooperative tree-based algorithm) is proposed in this paper. In the first stage of the algorithm

readers delete part of the invalid nodes according to the advantage of manchester code which can identify the collision bits of tags; In the second stage

readers share the prefix and the current broadcast result in each round of broadcast. The tree structure of the readers is continuously optimized by the information readers shared. The optimization strategy is to allocate a queue of nodes’ priority to be broadcasted for each reader. The probability of tags to be broadcasted is calculated by the shared information. The priority of nodes to be broadcasted is adjusted according to its probability

and the invalid nodes are deleted continuously. In the next broadcast

readers select the node with the highest probability to broadcast. Simulation results show that the average tag recognition efficiency of this algorithm is 59.9%

and MRCT has advantage in total time slots.