Security and Privacy in RFID Applications

Concerns about privacy and security may limit the deployment of RFID technology and its benefits, therefore it is important they are identified and adequately addressed. System developers and other market actors are aware of the threats and are developing a number of counter measures. RFID systems can never be absolutely secure but effort needs to be made to ensure a proper balance between the risks and the costs of counter measures. The approach taken to privacy and security should depend on the application area and the context of a specific application. In this chapter, we selected and discussed four application areas, but there are many others where privacy and security issues are relevant.JRC.J.4-Information Societ

Passive RFID Rotation Dimension Reduction via Aggregation

Radio Frequency IDentification (RFID) has applications in object identification, position, and orientation tracking. RFID technology can be applied in hospitals for patient and equipment tracking, stores and warehouses for product tracking, robots for self-localisation, tracking hazardous materials, or locating any other desired object. Efficient and accurate algorithms that perform localisation are required to extract meaningful data beyond simple identification. A Received Signal Strength Indicator (RSSI) is the strength of a received radio frequency signal used to localise passive and active RFID tags. Many factors affect RSSI such as reflections, tag rotation in 3D space, and obstacles blocking line-of-sight. LANDMARC is a statistical method for estimating tag location based on a target tag’s similarity to surrounding reference tags. LANDMARC does not take into account the rotation of the target tag. By either aggregating multiple reference tag positions at various rotations, or by determining a rotation value for a newly read tag, we can perform an expected value calculation based on a comparison to the k-most similar training samples via an algorithm called K-Nearest Neighbours (KNN) more accurately. By choosing the average as the aggregation function, we improve the relative accuracy of single-rotation LANDMARC localisation by 10%, and any-rotation localisation by 20%

Information Producers, Information Consumers : Location Data Privacy in Institutional Settings

Peer reviewedPreprin

Array signal processing for source localization and enhancement

“A common approach to the wide-band microphone array problem is to assume a certain array geometry and then design optimal weights (often in subbands) to meet a set of desired criteria. In addition to weights, we consider the geometry of the microphone arrangement to be part of the optimization problem. Our approach is to use particle swarm optimization (PSO) to search for the optimal geometry while using an optimal weight design to design the weights for each particle’s geometry. The resulting directivity indices (DI’s) and white noise SNR gains (WNG’s) form the basis of the PSO’s fitness function. Another important consideration in the optimal weight design are several regularization parameters. By including those parameters in the particles, we optimize their values as well in the operation of the PSO. The proposed method allows the user great flexibility in specifying desired DI’s and WNG’s over frequency by virtue of the PSO fitness function. Although the above method discusses beam and nulls steering for fixed locations, in real time scenarios, it requires us to estimate the source positions to steer the beam position adaptively. We also investigate source localization of sound and RF sources using machine learning techniques. As for the RF source localization, we consider radio frequency identification (RFID) antenna tags. Using a planar RFID antenna array with beam steering capability and using received signal strength indicator (RSSI) value captured for each beam position, the position of each RFID antenna tag is estimated. The proposed approach is also shown to perform well under various challenging scenarios”--Abstract, page iv

Puolivalvottu WLAN-radiokarttojen oppiminen

In this thesis a manifold learning method is applied to the problem of WLAN positioning and automatic radio map creation. Due to the nature of WLAN signal strength measurements, a signal map created from raw measurements results in non-linear distance relations between measurement points. These signal strength vectors reside in a high-dimensioned coordinate system. With the help of the so called Isomap-algorithm the dimensionality of this map can be reduced, and thus more easily processed. By embedding position-labeled strategic key points, we can automatically adjust the mapping to match the surveyed environment. The environment is thus learned in a semi-supervised way; gathering training points and embedding them in a two-dimensional manifold gives us a rough mapping of the measured environment. After a calibration phase, where the labeled key points in the training data are used to associate coordinates in the manifold representation with geographical locations, we can perform positioning using the adjusted map. This can be achieved through a traditional supervised learning process, which in our case is a simple nearest neighbors matching of a sampled signal strength vector. We deployed this system in two locations in the Kumpula campus in Helsinki, Finland. Results indicate that positioning based on the learned radio map can achieve good accuracy, especially in hallways or other areas in the environment where the WLAN signal is constrained by obstacles such as walls.Työssä sovelletaan monisto-oppimismenetelmää WLAN-paikannuksen ja automaattisen radiokartan luonnin ongelmaan. WLAN-signaalivoimakkuuksien mittausten luonteen takia käsittelemättömät mittaukset aiheuttavat epälineaarisia suhteita radiokartan mittauspisteiden välille. Nämä signaalivoimakkuusvektorit sijaitsevat avaruudessa jolla on korkea ulottuvuus. Niin kutsutun Isomap-algoritmin avulla kartan ulottuvuuksia voidaan karsia, jolloin sitä on helpompi työstää. Upottamalla karttaan merkittyjä avainpisteitä, se voidaan automaattisesti säätää vastaamaan mitattua ympäristöä. Ympäristö siis opitaan puolivalvotusti; keräämällä harjoituspisteitä ja upottamalla ne kaksiulotteiseen monistoon saadaan karkea kartta ympäristöstä. Kalibrointivaiheen jälkeen, jossa merkittyjä avainpisteitä käytetään yhdistämään moniston koordinaatit maantieteellisiin kohteisiin, voidaan suorittaa paikannusta säädetyn kartan avulla. Tämä voidaan tehdä perinteisen valvotun oppimisen avulla, joka tässä tapauksessa on yksinkertainen lähimmän naapurin löytäminen mitatulle signaalivoimakkuusvektorille. Järjestelmää kokeiltiin kahdessa paikassa Kumpulan kampuksessa Helsingissä. Tulokset viittaavat siihen että opitun radiokartan avulla paikannus voi saavuttaa hyvän tarkkuuden, etenkin käytävissä ja muissa tiloissa jossa esteet kuten seinät rajoittavat WLAN-signaalia

A Novel Approach To Intelligent Navigation Of A Mobile Robot In A Dynamic And Cluttered Indoor Environment

The need and rationale for improved solutions to indoor robot navigation is increasingly driven by the influx of domestic and industrial mobile robots into the market. This research has developed and implemented a novel navigation technique for a mobile robot operating in a cluttered and dynamic indoor environment. It divides the indoor navigation problem into three distinct but interrelated parts, namely, localization, mapping and path planning. The localization part has been addressed using dead-reckoning (odometry). A least squares numerical approach has been used to calibrate the odometer parameters to minimize the effect of systematic errors on the performance, and an intermittent resetting technique, which employs RFID tags placed at known locations in the indoor environment in conjunction with door-markers, has been developed and implemented to mitigate the errors remaining after the calibration. A mapping technique that employs a laser measurement sensor as the main exteroceptive sensor has been developed and implemented for building a binary occupancy grid map of the environment. A-r-Star pathfinder, a new path planning algorithm that is capable of high performance both in cluttered and sparse environments, has been developed and implemented. Its properties, challenges, and solutions to those challenges have also been highlighted in this research. An incremental version of the A-r-Star has been developed to handle dynamic environments. Simulation experiments highlighting properties and performance of the individual components have been developed and executed using MATLAB. A prototype world has been built using the WebotsTM robotic prototyping and 3-D simulation software. An integrated version of the system comprising the localization, mapping and path planning techniques has been executed in this prototype workspace to produce validation results