Radio Frequency Identification (RFID) technology has been widely used in indoor location tracking, especially serving human beings, due to its advantage of low cost, non-contact communication, resistance to hostile environments and so forth. Over the years, many indoor location tracking methods have been proposed. However, tracking mobile RFID readers in real-time has been a daunting task, especially for achieving high localization accuracy. In this paper, we propose a new Mobile RFID (M-RFID)-based Localization approach for Indoor Human Tracking, named MRLIHT. Based on the M-RFID model where RFID readers are equipped on the moving objects (human beings) and RFID tags are fixed deployed in the monitoring area, MRLIHT implements the real-time indoor location tracking effectively and economically. First, based on the readings of multiple tags detected by an RFID reader simultaneously, MRLIHT generates the response regions of tags to the reader. Next, MRLIHT determines the potential location region of the reader where two algorithms are devised. Finally, MRLIHT estimates the location of the reader by dividing the potential location region of the reader into finer-grained grids. The experimental results demonstrate that the proposed MRLIHT performs well in both accuracy and scalability.

The nearest neighbors query problem on road networks constitutes a crucial aspect of location-oriented services and has useful practical implications; e.g., it can locate the k-nearest hotels. However, researches who study road networks still encounter obstacles due to the method’s inherent limitations with respect to object mobility. More popular methods employ indexes to store intermediate results to improve querying time efficiency, but these other methods are often accompanied by high time costs. To balance the costs of time and space, a lightweight flow graph index is proposed to reduce the quantity of candidate nodes, and with this index the results of a kNN query can be efficiently obtained. Experiments on real road networks confirm the efficiency and accuracy of our optimized algorithm.