Research On K Coverage Problem In RFID Network

In recent years, with the rapid development of wireless sensor technology and automatic identification technology, Radio Frequency Identification(RFID) has been widely applied to many fields. The RFID network is a special network, which consists of many tags and readers that distributed in detection area. In the research of RFID network, network coverage is a main subject. It provides better service to RFID network by distributing the resources reasonably. In the actual detection task, in order to guarantee the reliability of detection, often needs several readers for a target for monitoring at the same time. Each target point is in k or more readers' coverage range, that is to say, each target is covered by at least k different readers.This paper gives a further study of the coverage problem in the RFID network. It introduces the recent research status at home and abroad. It talks about the technology of RFID, as well as some relative knowledge of wireless sensor network, such as coverage, deployment. The key point is the k coverage problem, approximate algorithm based on integer linear programming and FoV detection algorithm based an heuristic algorithm as well as distributed greedy algorithm are proposed.This paper analyzes the system model of k coverage problem and proposes LPA. The perception model of k coverage in traditional barrier-free environment is too simple and limited, which can not be applied to complicated obstacle environment. In view of the above limitations, it's the first time that this paper discuss the k coverage problem in obstacle environment. What's more, it proposes the FoV detection algorithm based on heuristic algorithm to realize automatic orientation of d-RFID, which can make it avoid obstacles effectively and reach maximize coverage. It also proposes a distributed greedy algorithm to realize k coverage.In the end, this paper verifies the k coverage problems and obstacle environment respectively. The results show that the LPA algorithm can get feasible solutions in the barrier-free environment and need less readers to finish this task. The FoV detection algorithm in the obstacle environment can make the d-RFID become automatic orientation to realize maximize coverage. The distributed greedy algorithm has good performance guarantee and the solution is very close to the optimal solution.