DiCa: Distributed Tag Access with Collision-Avoidance Among Mobile RFID Readers
Advances in wireless and mobile communication technologies have enabled the development of various RFID-based systems and applications in addition to the extension of the tag reading range of mobile readers. Thus, it has become commonplace that multiple readers concurrently attempt to read tags within ranges of the readers. However, this concurrent access among multiple mobile readers brings about a new problem called reader collision, where a reader’s transmission is interfered by other readers. There have been several studies focusing on solving the reader collision problem. These studies employ time division, frequency division, space division, or the centralized scheduling approach. In this paper, a cooperative, distributed reader collision avoidance algorithm is introduced. In particular, the proposed DiCa (Distributed Tag Access with Collision-Avoidance) is considerably suitable for energy-efficient wireless mobile network environments cooperated with RFID, since the DiCa is capable not only of avoiding collisions, but also changing power states autonomously through simple interaction of adjacent readers.
KeywordsSensor Network Control Channel Data Channel Concurrent Access Hide Node Problem
- 2.Clauberg, R.: RFID and Sensor Networks. IBM white paper (2004), http://www.m-lab.ch/rfid-workshop/ibm_paper.pdf
- 3.Engels, D.W., Sarma, S.E.: The Reader Collision Problem. In: IEEE International Conference (2002)Google Scholar
- 4.Birari, S.M.: Mitigating the Reader Collision Problem in RFID Networks with Mobile Readers. M.S. Dissertation in Indian Institute of Technology Bombay (2005)Google Scholar
- 5.Waldrop, J., Engels, D.W., Sarma, S.E.: Colorwave: An Anti-collision Algorithm for the Reader Collision Problem. In: ICC 2003 (2003)Google Scholar
- 6.Ho, J.K.: Solving the reader collision problem with a hierarchical q-learning algorithm. M. S. Dissertation in Massachusetts Institute of Technology (February 2003)Google Scholar