Implicit authentication mechanisms are expected to prevent security and privacy threats for mobile devices using behavior modeling. However, recently, researchers have demonstrated that the performance of behavioral biometrics is insufficiently accurate. Furthermore, the unique characteristics of mobile devices, such as limited storage and energy, make it subject to constrained capacity of data collection and processing. In this paper, we propose an implicit authentication architecture based on edge computing, coined Edge computing-based mobile Device Implicit Authentication (EDIA), which exploits edge-based gait biometric identification using a deep learning model to authenticate users. The gait data captured by a device’s accelerometer and gyroscope sensors is utilized as the input of our optimized model, which consists of a CNN and a LSTM in tandem. Especially, we deal with extracting the features of gait signal in a two-dimensional domain through converting the original signal into an image, and then input it into our network. In addition, to reduce computation overhead of mobile devices, the model for implicit authentication is generated on the cloud server, and the user authentication process also takes place on the edge devices. We evaluate the performance of EDIA under different scenarios where the results show that i) we achieve a true positive rate of 97.77% and also a 2% false positive rate; and ii) EDIA still reaches high accuracy with limited dataset size.

Location-based services (LBS) have long been recognized as a significant component of the emerging information services. However, the localization cost and the performance of algorithm still need to be optimized. In the study, an improved particle swarm optimization algorithm based on a feed-forward neural network (IMPSO-FNN) combined with RFID sensors is proposed, which can achieve the best indoor positioning location and overcome the problems effectively. In IMPSO-FNN, an improved PSO algorithm (IMPSO) is developed to determine the optimal connecting weights and markedly optimize the network parameters and structural parameters for the FNN, and then an optimal location prediction model is established by the IMPSO-FNN. To avoid the interference of environmental noise for the experimental data, some preprocessing methods are used during the positioning process. The computational results for learning two continuous functions show that the proposed positioning algorithm has a faster convergence rate and higher generalization performance. The model evaluation results also verify that the proposed positioning method really is superior to other algorithms in terms of the learning ability, efficiency, and positioning accuracy.

Nowadays, the increasing demands of location-based services (LBS) have spurred the rapid development of indoor positioning systems (IPS). However, the performance of IPSs is affected by the fluctuation of the measured signal. In this study, a Gaussian filtering algorithm based on an extreme learning machine (ELM) is proposed to address the problem of inaccurate indoor positioning when significant Received Signal Strength Indication (RSSI) fluctuations happen during the measurement process. The Gaussian filtering method is analyzed and compared, which can effectively filter out the fluctuant signals that were caused by the environment effects in an RFID-based positioning system. Meanwhile, the fast learning ability of the proposed ELM algorithm can reduce the time consumption for the offline and online service, and establishes the network positioning regression model between the signal strengths of the tags and their corresponding positions. The proposed positioning system is tested in a real experimental environment. In addition, system test results demonstrate that the positioning algorithms can not only provide higher positioning accuracy, but also achieve a faster computational efficiency compared with other previous algorithms.

Time of arrival (TOA) measurement is a promising method for target positioning based on a set of nodes with known positions, with high accuracy and low computational complexity. However, most positioning methods based on TOA (such as least squares estimation, maximum-likelihood, and Chan, etc.) cannot provide desirable accuracy while maintaining high computational efficiency in the case of a non-line of sight (NLOS) path between base stations and user terminals. Therefore, in this paper, we proposed a creative 3-D positioning system based on particle swarm optimization (PSO) and an improved Chan algorithm to greatly improve the positioning accuracy while decreasing the computation time. In the system, PSO is used to estimate the initial location of the target, which can effectively eliminate the NLOS error. Based on the initial location, the improved Chan algorithm performs iterative computations quickly to obtain the final exact location of the target. In addition, the proposed methods will have computational benefits in dealing with the large-scale base station positioning problems while has highly positioning accuracy and lower computational complexity. The experimental results demonstrated that our algorithm has the best time efficiency and good practicability among stat-of-the-art algorithms.

A Radio Frequency Identification (RFID) grouping-proof protocol is to generate an evidence of the simultaneous existence of a group of tags and it has been applied to many different fields. For current grouping-proof protocols, there still exist some flaws such as low grouping-proof efficiency, being vulnerable to trace attack and information leakage. To improve the secure performance and efficiency, we propose a lightweight RFID grouping-proof protocol based on parallel mode and DHCP (Dynamic Host Configuration Protocol) mechanism. Our protocol involves multiple readers and multiple tag groups. During the grouping-proof period, one reader and one tag group are chosen by the verifier by means of DHCP mechanism. When only a part of the tags of the chosen group exist, the protocol can also give the evidence of their co-existence. Our protocol utilizes parallel communication mode between reader and tags so as to ensure its grouping-proof efficiency. It only uses Hash function to complete the mutual authentication among verifier, readers and tags. It can preserve the privacy of the RFID system and resist the attacks such as eavesdropping, replay, trace and impersonation. Therefore the protocol is secure, flexible and efficient. It only uses some lightweight operations such as Hash function and a pseudorandom number generator. Therefore it is very suitable to some low-cost RFID systems.