Abstract In this paper, we propose an improved anti-collision technique based on the binary search algorithm. The improvement is achieved thanks to the manner of the requests’ building. This latter reduces considerably the responding tag's numbers and therefore, decreases the probability of bit's collision. Further, the algorithm provides a noticeable advantage for the length of transmitted binary data compared against basic binary search and dynamic binary search algorithms. Besides, it provides same performance in terms of average request's number making the identification process faster, and the expose time of information is then reduced.