WiFACT -- Wireless Fingerprinting Automated Continuous Training
ABSTARCT :
The increasing importance in ubiquitous computing and context-dependent information has led in the last years to a growing interest in location-based applications and services. A considerable market demand concentrates on indoor localization tasks. In this setting, WiFi fingerprinting is currently one of the most popular and widespread techniques as it provides reasonable positioning accuracy while being able to exploit, at the same time, existing wireless infrastructures. WiFi-fingerprinting systems mainly operate though two distinct phases: one initial, named training, in which signals are collected and one subsequent, named usage, in which the recorded data are used to localize users. While the usage phase is fast and effective, the training phase is time consuming. Moreover, to maintain a localization accuracy, the training needs to be repeated anytime the network structure changes. The latter may occur, for example, if an access point goes off-line or it is removed. In this paper, we propose a novel framework that allows for an automatic and continuous training in WiFi-fingerprinting systems, which is based on an opportune deployment of a WSN(Wireless Sensor Network). Precisely, the solution we propose allows for an efficient real-time updating of the database collecting the signals, without any human intervention.
EXISTING SYSTEM :
? The fingerprint database has temporal correlation, considering the similarity that exists between RSSI values obtained by an AP at different times in a fixed position.
? Due to the huge potential of such a network, many proposals have been made to improve the communication between the nodes, to select the best routing protocol possible, and to locate nodes inside the net.
? In particular, the more the nodes are the more the precision of the algorithm grows.
? This is obviously something to avoid: for this reason, we introduce a displacement factor, which represents how much one is ready to sacrifice the coverage in favor of a better user-based distribution of the signal.
DISADVANTAGE :
? The probabilistic methods achieve greater location accuracy since they solve uncertainty problems.
? The localization problem becomes how to estimate the grid ID of the mobile user given the RSSI measurements collected from several APs at each RP.
? To reduce the impact of environmental interference, AP clusters were constructed in, where hierarchical PCA was used to obtain cluster RSSI features by converting the raw data to a linearly independent dimensional matrix.
? The impact of utilizing different training samples obtained at each RP on the mean localization error and percentage of improvements of the proposed HMM-DMD.
PROPOSED SYSTEM :
• We proposed a logic range free algorithm able to uniformly distribute hubs around a given environment: this distribution is aimed to give the best coverage possible of the areas of interest.
• Using the same approach, in they propose a range free algorithm based on RSSI comparisons, called Ring Overlapping.
• An important indicator which is largely used in Wireless Sensor Networks for localization purposes is the RSSI (Received Signal Strength Indicator).
• This indicator provides the power of the received signal in a certain point and it has a strong relevance since not only it gives important knowledge for the purpose of localization, but it is also recognizable by any device on the market.
ADVANTAGE :
? The performance and computing cost of the HMM are dependent on the feature dimension since a large quantity of RSSI measurements are required for the learning process.
? The approach ignores APs that may contain useful information, thus affecting the system’s performance.
? The extracted feature vector of the raw WiFi RSSI dataset is important to enhance the performance of the HMM and minimize the computational cost of the localization system.
? The localization distance errors (accuracy) and the cumulative distribution function (CDF) are employed as a performance metric.
|