Identifying state-free networked tags

Abstract

Traditional RFID technologies allow tags to communicate with a reader but not among themselves. By enabling peer communications between nearby tags, the emerging networked tags represent a significant enhancement to today’s RFID tags. They support applications in previously infeasible scenarios where the readers cannot cover all tags due to cost or physical limitations. This chapter introduces a fundamental problem of identifying networked tags. To prolong the lifetime of networked tags and make identification protocols scalable to large systems, energy efficiency and time efficiency are most critical. We reveal that the traditional contention-based protocol design will incur too much energy overhead in multihop tag systems, while a reader-coordinated design that significantly serializes tag transmissions performs much better. In addition, we show that load balancing is important in reducing the worst-case energy cost to the tags, and we present a solution based on serial numbers.