A novel algorithm LWFO for redundant reader elimination in RFID networks

Abstract- Today, the Radio frequency identification system is widely used in various applications on a large scale. The readers must be densely deployed in order to cover their entire work area. If the number of readers is not optimal, some readers will be redundant, which will reduce the efficiency of the whole system. In more detail, redundant readers increase system overhead, unnecessary tag-reader communication, tag collision, and reader collision, and also, decrease the lifetime of RFID networks. The redundant reader elimination problem is a process that finds the least number of readers to cover all system tags. It is proved that the redundant reader elimination problem is NP_hard. One of the useful tasks in eliminating redundant readers is improving the performance of existing approximation algorithms. In this paper, we propose a distributed algorithm, the LWFO algorithm, which combines the count base algorithm (CBA) and a weighting algorithm. The simulation results show that the proposed algorithm reduces reader redundancy compared to existing algorithms also processing time is reasonable.

Keywords:

RFID , Optimal tag coverage , Redundant reader elimination , NP_hard problems