Performance analysis of optimal schedulers in single channel dense radio frequency identification environments

摘要: Schedulers in radio frequency identification dense environments aim at distributing optimally a set of t slots between group m readers. In single-channel environments, the readers within mutual interference range must transmit different times; otherwise, interferences prevent tags. The goal is to maximize expected number tags successfully identified slots. This problem may be formulated as mixed integer non-linear mathematical program, which effectively exploit available knowledge about competing reading zone each reader. this paper, we present optimization and analyze impact tag estimation performance achieved by scheduler. results demonstrate that optimal solutions outperform reference scheduler based on dividing proportionally addition, depending scenario load, reveal there exist an optimum for topology considered, since total average identifications depend non-linearly load. Finally, study effect imperfect population