Optimal Tag Coverage and Tag Report Elimination Book Chapter

Carbunar, B, Krishna Ramanathan, M, Koyuturk, M et al. (2010). Optimal Tag Coverage and Tag Report Elimination . 321-347. 10.1002/9780470665251.ch12

cited authors

  • Carbunar, B; Krishna Ramanathan, M; Koyuturk, M; Jagannathan, S; Grama, A

authors

abstract

  • This chapter addresses two important tag detection problems occurring in RFID systems. The first problem, of optimally covering tags, consists of identifying a minimal set of readers that cover all tags present in the system. The second problem, of optimally reporting detected tags, consists of eliminating redundant tag reports generated by multiple readers. The optimal tag coverage problem is equivalent to the problem of determining the maximum number of redundant readers. A redundant reader can be safely turned off or removed from the network without affecting the number of tags covered. In this chapter, we first describe the coverage redundancy problem in wireless sensor networks and explain differences between this problem and the optimal tag coverage problem. Second, we study different techniques for solving the tag coverage and reporting problems. We show that the algorithms studied are adaptive to system changes, including new tag and reader deployments, as well as component leaves or failures. © 2009 Intel Corporation.

publication date

  • July 5, 2010

Digital Object Identifier (DOI)

International Standard Book Number (ISBN) 13

start page

  • 321

end page

  • 347