No abstract

No abstract

Nowadays, location-based services, which include services to identify the location of a person or an object, have many uses in social life. Though traditional GPS positioning can provide high quality positioning services in outdoor environments, due to the shielding of buildings and the interference of indoor environments, researchers and enterprises have paid more attention to how to perform high precision indoor positioning. There are many indoor positioning technologies, such as WiFi, Bluetooth, UWB and RFID. RFID positioning technology is favored by researchers because of its lower cost and higher accuracy. One of the methods that is applied to indoor positioning is the LANDMARC algorithm, which uses RFID tags and readers to implement an Indoor Positioning System (IPS). However, the accuracy of the LANDMARC positioning algorithm relies on the density of reference tags and the performance of RFID readers. In this paper, we introduce the weighted path length and support vector regression algorithm to improve the positioning precision of LANDMARC. The results show that the proposed algorithm is effective.

With the fast development of the Internet of Things, Radio Frequency Identification (RFID) has been widely applied into many areas. Nevertheless, security problems of the RFID technology are also gradually exposed, when it provides life convenience. In particular, the appearance of a large number of fake and counterfeit goods has caused massive loss for both producers and customers, for which the clone tag is a serious security threat. If attackers acquire the complete information of a tag, they can then obtain the unique identifier of the tag by some technological means. In general, because there is no extra identifier of a tag, it is difficult to distinguish an original tag and its clone one. Once the legal tag data is obtained, attackers can be able to clone this tag. Therefore, this paper shows an efficient RFID mutual verification protocol. This protocol is based on the Physical Unclonable Function (PUF) and the lightweight cryptography to achieve efficient verification of a single tag. The protocol includes three process: tag recognition, mutual verification and update. The tag recognition is that the reader recognizes the tag; mutual verification is that the reader and tag mutually verify the authenticity of each other; update is supposed to maintain the latest secret key for the following verification. Analysis results show that this protocol has a good balance between performance and security.