Exploiting signal strength detection and collision cancellation for tag identification in RFID systems

Radio Frequency IDentification (RFID) systems are becoming more and more popular in the field of ubiquitous computing, in particular for objects identification. An RFID system is composed by one or more readers and a number of tags. One of the main issues in an RFID network is the fast and reliable identification of all tags in the reader range. The reader issues some queries, and tags properly answer. Then, the reader must identify the tags from such answers. This is crucial for most applications. Since the transmission medium is shared, the typical problem to be faced is a MAC-like one, i.e, to avoid or limit the number of tags transmission collisions. We propose a protocol which, under some assumptions about transmission techniques, achieves a 60% perfomance on the average (in terms of transmitted bits). It is based on a proper recursive splitting of the concurrent tags sets and on signal storing and later cancellation, until all tags have been identified.