Locating RFID Tags. Matthias Benesch, Siegfried Bublitz Siemens AG. C-LAB Report. Vol. 8 (2009) No. 3

Similar documents
Cyclic difference sets with parameters (511, 255, 127) BACHER, Roland

UNIT 2 KINEMATICS OF LINKAGE MECHANISMS

Deutschen Kalibrierdienst D-K

1. Positive and regular linear operators.

D-optimally Lack-of-Fit-Test-efficient Designs and Related Simple Designs

Numerical Solution of the Generalised Poisson Equation on Parallel Computers

Graphing Review Part 1: Circles, Ellipses and Lines

Simplifying the Management of your 3D Data with automatic and scalable Workflows. Stephan Plabst M.O.S.S. Computer Grafik Systeme GmbH

Klausur zur Vorlesung Vertiefung Theoretische Informatik Sommersemester 2016

PHYSICS 221 SPRING EXAM 1: February 20, 2014; 8:15pm 10:15pm

MOTION ALONG A STRAIGHT LINE

Berichte zur Umweltphysik

T U M. Performing Permuting on a Multiprocessor Architecture Using Packet Communication I N S T I T U T F Ü R I N F O R M A T I K

3. Elastic Collision. 3.1 Introduction. 3.2 Theory. a) Kinetic Energy of a Rolling Ball

1. The Bergman, Kobayashi-Royden and Caratheodory metrics

Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur

1.1 Graphing Motion. IB Physics 11 Kinematics

Regulation of Nanomaterials the relevance of LCA and RA

OCR Mathematics Advanced Subsidiary GCE Core 1 (4721) January 2012

TOPICS IN GEOMETRY: THE GEOMETRY OF THE EUCLIDEAN PLANE. 1. Introduction

Characterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems

Covariograms of convex bodies in the plane: A remark on Nagel s theorem

first name (print) last name (print) brock id (ab17cd) (lab date) A friendly reminder: Is this your scheduled experiment? See the previous page.

4. Minkowski vertices and Chebyshev Systems

The notable configuration of inscribed equilateral triangles in a triangle

Twenty-fifth Annual UNC Math Contest First Round Fall, 2016 Rules: 90 minutes; no electronic devices. The positive integers are 1, 2, 3, 4,...

MATHEMATICS ( CANDIDATES WITH PRACTICALS/INTERNAL ASSESSMENT ) ( CANDIDATES WITHOUT PRACTICALS/INTERNAL ASSESSMENT )

7. Simultaneous Resource Bounds

Introduction to 1-D Motion Distance versus Displacement

Give a geometric description of the set of points in space whose coordinates satisfy the given pair of equations.

6664/01 Edexcel GCE Core Mathematics C2 Bronze Level B2

AP PHYSICS 1. Energy 2016 EDITION

PHYSICS Kinematics in One Dimension

Kindergarten Grade 1 Grade 2

3. Applications of the integral representation theorems

SOME APPLICATIONS OF THE GAUSS-LUCAS THEOREM

Integrated Math II. IM2.1.2 Interpret given situations as functions in graphs, formulas, and words.

Kinematic Analysis of a Pentapod Robot

G r a d e 1 1 P h y s i c s ( 3 0 s ) Midterm Practice exam

Y. D. Chai and Young Soo Lee

The Pierre Auger Observatory

A note on the Hopf-Stiefel function. ELIAHOU, Shalom, KERVAIRE, Michel

Electromagnetic Theory Prof. D. K. Ghosh Department of Physics Indian Institute of Technology, Bombay

POE FINAL SEMESTER 2

Physics 4A Chapter 1: Concepts of Motion

ALGEBRAISCHE GEOMETRIE

51. IWK Internationales Wissenschaftliches Kolloquium International Scientific Colloquium

Maintaining Communication Between an Explorer and a Base Station

Make sure that you are able to operate with vectors rapidly and accurately. Practice now will pay off in the rest of the course.

Time: 1 hour 30 minutes

Core Mathematics C12

Learning Outcomes and Assessment Standards

Coimisiún na Scrúduithe Stáit State Examinations Commission. Leaving Certificate Examination Mathematics

Mehrphasensimulationen zur Charakterisierung einer Aerosol-Teilprobenahme

ENCYCLOPEDIA OF PHYSICS

Experiment 2 Vectors. using the equations: F x = F cos θ F y = F sin θ. Composing a Vector

Potential and Kinetic Energy

Assuming the Earth is a sphere with radius miles, answer the following questions. Round all answers to the nearest whole number.

Lab: Vectors. You are required to finish this section before coming to the lab. It will be checked by one of the lab instructors when the lab begins.

9.1 Circles and Parabolas. Copyright Cengage Learning. All rights reserved.

Isaac Newton ( )

Describing Motion. Newton Newton s Laws of Motion. Position Velocity. Acceleration. Key Concepts: Lecture 9

Analytische Qualitätssicherung Baden-Württemberg

Mathematics 5 Worksheet 14 The Horizon

Algebra. Übungsblatt 12 (Lösungen)

Use a BLOCK letter to answer each question: A, B, C, or D (not lower case such a b or script such as D)

Dynamical billiards 1

UNIVERSITY OF SASKATCHEWAN Department of Physics and Engineering Physics

MAT 272 Test 1 Review. 1. Let P = (1,1) and Q = (2,3). Find the unit vector u that has the same

Making a Weather Wheel

1 The role of gravity The view of physics that is most generally accepted at the moment is that one can divide the discussion of the universe into

PHY 111L Activity 2 Introduction to Kinematics

Using Microsoft Excel

Preliminary Physics. Moving About. DUXCollege. Week 2. Student name:. Class code:.. Teacher name:.

Laws of Force Gravity and the Inverse Square Law. 632 MHR Unit 6 Electric, Gravitational, and Magnetic Fields

AP Physics 2 - Summer Assignment

SS BMMM01 Basismodul Mathematics/Methods Block 1: Mathematics for Economists. Prüfer: Prof. Dr.

Orbital Mechanics Laboratory

Math 114 Spring 2013 Final Exam

Physics General Physics. Lecture 3 Newtonian Mechanics. Fall 2016 Semester. Prof. Matthew Jones

PHYS 106 Fall 2151 Homework 3 Due: Thursday, 8 Oct 2015

CHAPTER 2: Describing Motion: Kinematics in One Dimension

L'Enseignement Mathématique

AP PHYSICS SUMMER ASSIGNMENT

STEP CORRESPONDENCE PROJECT. Assignment 31

Chapter 2. Motion in One Dimension. AIT AP Physics C

Integer Sequences and Circle Chains Inside a Tangential Quadrilateral

Paper Reference. Core Mathematics C2 Advanced Subsidiary. Thursday 22 May 2014 Morning Time: 1 hour 30 minutes

Maths Higher Prelim Content

2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016

Time-optimal scheduling for high throughput screening processes using cyclic discrete event models

Physics 2A Chapter 1: Introduction and Mathematical Concepts

California Common Core State Standards for Mathematics Standards Map Mathematics I

3. Rational curves on quartics in $P^3$

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Positioning Sytems: Trilateration and Correlation

Name. Satellite Motion Lab

AU-5029 GURU GHASIDAS VISHWAVIDYALAYA, BILASPUR (C.G.) INSTITUTE OF TECHNOLOGY DEPARTMENT OF CIVIL ENGINEERING B.TECH

4. The Round-Robin Tournament Method

The Sphere OPTIONAL - I Vectors and three dimensional Geometry THE SPHERE

Potential and Kinetic Energy: The Roller Coaster Lab Teacher Version

Transcription:

Locating RFID Tags Matthias Benesch, Siegfried Bublitz Siemens AG C-LAB Report Vol. 8 (009) No. 3 Cooperative Computing & Communication Laboratory ISSN 1619-7879 C-LAB ist eine Kooperation der Universität Paderborn und der Siemens AG www.c-lab.de info@c-lab.de

Herausgegeben von Published by Dr. Wolfgang Kern, Siemens AG Prof. Dr. Franz-Josef Rammig, Universität Paderborn Das C-LAB - Cooperative Computing & Communication Laboratory - leistet Forschungs- und Entwicklungsarbeiten und gewährleistet deren Transfer an den Markt. Es wurde 1985 von den Partnern Nixdorf Computer AG (nun Siemens AG) und der Universität Paderborn im Einvernehmen mit dem Land Nordrhein-Westfalen gegründet. Die Vision, die dem C-LAB zugrunde liegt, geht davon aus, dass die gewaltigen Herausforderungen beim Übergang in die kommende Informationsgesellschaft nur durch globale Kooperation und in tiefer Verzahnung von Theorie und Praxis gelöst werden können. Im C-LAB arbeiten deshalb Mitarbeiter von Hochschule und Industrie unter einem Dach in einer gemeinsamen Organisation an gemeinsamen Projekten mit internationalen Partnern eng zusammen. C-LAB - the Cooperative Computing & Cooperation Laboratory - works in the area of research and development and safeguards its transfer into the market. It was founded in 1985 by Nixdorf Computer AG (now Siemens AG) and the University of Paderborn under the auspices of the State of North-Rhine Westphalia. C-LAB's vision is based on the fundamental premise that the gargantuan challenges thrown up by the transition to a future information society can only be met through global cooperation and deep interworking of theory and practice. This is why, under one roof, staff from the university and from industry cooperate closely on joint projects within a common research and development organization together with international partners. In doing so, C-LAB concentrates on those innovative subject areas in which cooperation is expected to bear particular fruit for the partners and their general well-being. ISSN 1619-7879 C-LAB Fürstenallee 11 3310 Paderborn fon: +49 551 60 60 60 fax: +49 551 60 60 66 email: info@c-lab.de Internet: www.c-lab.de Siemens AG und Universität Paderborn 009 Alle Rechte sind vorbehalten. Insbesondere ist die Übernahme in maschinenlesbare Form sowie das Speichern in Informationssystemen, auch auszugsweise, nur mit schriftlicher Genehmigung der Siemens AG und der Universität Paderborn gestattet. All rights reserved. In particular, the content of this document or extracts thereof are only permitted to be transferred into machine-readable form and stored in information systems when written consent has been obtained from Siemens AG and the University of Paderborn.

Abstract Computing the position of an RFID tag based on signals received at several RFID readers can be done with a mathematical model. However, real world constraints impact this approach. In this paper we detail a combination of strict mathematics and heuristic approaches for a specific set of tags and readers. Contents 1 Introduction...4 1.1 RFID reader and tags...4 1. General Approaches...4 Behaviour of RFID Reader...5 3 Geometrical model of RFID Reader Locations...6 4 Geometrical conditions...8 5 Position of RFID Tag...9 6 Adaptation of Position...10 6.1 Example...1 7 Determining RFID Reader Circle Radius Size...13 8 Conclusions...14 9 References...15 C-LAB-TR-009-3 Seite 3 von 15

1 Introduction We want to determine the position of an RFID tag based on signals received at different RFID reader stations. For our purposes, a very limited model of RFID technology is sufficient. This will be described in the next section. 1.1 RFID reader and tags An RFID reader is an equipment producing electromagnetic fields in its vicinity. An RFID tag is an equipment able to manipulate this electromagnetic field. This manipulation can be detected by the reader. This way, information is transmitted between reader and tag. 1. General Approaches Determing the position of an RFID tag attached to a moving object e.g. a person based on signals received by different RFID readers can be done in several different ways. One approach is to determine the signal strengths at different locations in the tracking area and create a map of this area showing the signal levels. When using this signal map, the real position is determined by comparing the actual signals with the ones from the map. Another approach is to use a simple mathematical model based on balls and their intersections. In this paper we use this approach. When there is no abstacle, the electromagnetic field is a ball with the reader as centre. All points with the same distance from the centre receive the same signal strength. Model assumptions We have the following assumptions for our model: 1. There is a set of RFID readers with fixed locations.. There are no obstacles: the signal strength of the electromagnetic field from a specific RFID is dependent on distance only. This assumptions may sound naiive, and indeed they are. Nevertheless, this helps us in creating a basic model. At the end of this paper we discuss how to deal with obstacles. C-LAB-TR-009-3 Seite 4 von 15

Behaviour of RFID Reader Each RFID reader is capable of generating a sequence of n different signal strengths 0 s 0 s 1... s i i s i... s n 1. In our special case we have n=4 but this is not essential for the following considerations. In one round, the reader starts the first step by sending a signal of strength s n 1 and waits for reactions from tags for this signal strength. This is repeated with decreasing signal strengths until s 0 is reached. We consider a fixed RFID tag with distance r 0 from a fixed RFID reader. Let's assume the tag is receiving signals from the reader. Let s {s 0, s 1,..., s i i,s i,..., s n 1 } be the weakest signal that is received by the tag. Let r i be the largest possible distance where signals of strength s i can be received by the RFID tag. When the tag receives signals of strength s i it will receive stronger signals as well and thus is located within the ball of radius r i. If it does not receive weaker signals s s i it is located outside the ball of radius r i 1. Together, we have the condition r i 1 r r i if s=s i. Written in an algorithmic pseudo language, each reader executes the following steps: 1 Forever do let dist = 0 // this means no signal received 3 for signal strength si from s4 to s1 do 4 send signal of strenght si 5 wait for reaction from RFID tags nearby 6 timeout according to predefined value 7 if reaction from tag 8 dist = di 9 endif 10 end for 11 if dist > 0 1 echo 'tag is within distance '. dist. ' from reader' 13 else 14 echo 'reader does not see tag' 15 endif 16 done C-LAB-TR-009-3 Seite 5 von 15

3 Geometrical model of RFID Reader Locations For determing the position of one tag between different readers, we use the following approach: Whenever there are distance values from at least 3 different readers available, we skip all but the 3 most tight circles. This results in 3 different circles. We consider plain circles, but the computation is very similar in 3 dimensions as well. A detailed description of this concepts and the following mathematical results used can e.g. be found in [6]. Notation: In the following, capital letters always describe vectors and lowercase letters always describe scalar (or real) values. Vectors consist of components of real values, That means M is (m1, m). Two consecutive capital letters denote a scalar product, i.e. MN = m1*n1 + m*n and M² = MM. For each pair of circles K1 and K with centres M and N, M N, there is a straight line g running throught both centres. Let r be the radius of K1 and s be the radius of K. If r + s is larger than the distance between M and N, then there are different intersection points Q and T between K1 and K. Let h be the straight line connecting Q and T. Then, h is perpendicular on g. We compute the point P which is just the intersection of the straight lines g and h. For all points X on the circular line of K1, we have the following equation: 1 X M r =0 and correspondingly for K: X N s =0 For the straight line g we have 3 X=M t N M Subtracting () from (1) gives the following condition for T and Q: C-LAB-TR-009-3 Seite 6 von 15

4 0= X M r X N s = X XM M r X XN N s = X N M M N r s This is just the definition of the straight line h. Since P must fullfil both (3) and (4), we can insert the value for X from (3) in (4) and continue as follows: 4' 0= M t N M N M M N r s = MN M t N M M N r s = t N M N M r s This can be solved to show t: 5 t= N M r s N M And thus P is according to (3) 6 P=M N M r s N M N M P is always a point on g. If Q and T coincide, which is true for N M = r s we have the situation where h is a tangent at K1 and K in P: C-LAB-TR-009-3 Seite 7 von 15

6' P = M N M r s N M = M r s r s r s N M N M r s r r s = M N M = M r r s r s N M P is always a point on g but not necessarily between M and N. If r s N M we have for the fraction in (6): 6'' N M r s 1 N M Inserted as value for t in (3) this means we have the situation of the following figure, where P is not between M and N. 4 Geometrical conditions In order to exclude pathological situations, we have the following requirements. The circles do not collapse: R1 r 0 R s 0 C-LAB-TR-009-3 Seite 8 von 15

The circles have different centres: R3 M N The centre of K is not contained in K1: R4 N M r or alternatively: circle K is not completely inside of K1 (tangent is allowed): R4' N M r s The centre of K1 is not contained in K: R5 N M s or alternatively: circle K1 is not completely inside of K (tangent is allowed): R5' N M s r And when all these conditions are fulfilled, there is an intersection point P when the following condition is met: R6 N M r s In the case of equality h is tangent at both circles. 5 Position of RFID Tag Having computed (6) for the 3 corners A, B, C of all 3 pairs of combinations from the 3 circles, the actual position of the tag can be guessed as the centre of gravity S of the corresponding triangle, which is just 7 S= A B C 3 C-LAB-TR-009-3 Seite 9 von 15

6 Adaptation of Position Taking the centry of gravity can mislead for triangles where e.g. A and C are closed to each other but B is far away. In this case, the centre of gravity S is too far away from both A and C and too close to B in contrast to the expected position of tracking. For the following discussions, let E point to the middle of the segment between A and C, i.e. 8 E= A C We move B on the line connecting B and E towards E, up to a distance equal to the one between A and C. If G denotes the new position of B, we have a new triangle (A, G, C) where the formula (7) can be applied to determine the tracking position, of course with G substituting B. Being on the line between E and B with the same distance as between A and C gives the following condition for G: 9 G=E A C B E B E Remember that there is a scalar product under the root, so we cannot shortcut here. Now (8) helps to substitute E, thus (9) becomes: 10 G= A C A C B A C B A C = A C A C B A C B A C For the last equation we have applied the linearity of the scalar product. Now let us determine the terms under the root: 11 A C = a 1 a c and 1 B A C = a 1 b a c =4b 1 a 1 c 1 a 1 a 1 a 1 c 1 c 1 a 1 c 1 c 1 4b a b b c a b a a c b c a c c =a 1 4a 1 a 1 4b 1 4 c 1 c 1 a 4a b a b 4b 4b c c C-LAB-TR-009-3 Seite 10 von 15

Using (11) and (1) show for the components of G directly from (10): 13 g 1 = a 1 c 1 a 1 a c a 1 4a 1 a 1 4 4 c 1 c 1 a 4a b a b 4b 4b c c a 1 and the same for the second component: 14 g = a c a 1 a c a 1 4a 1 a 1 4 4 c 1 c 1 a 4a b a b 4b 4b c c b a c For ease of computation, it might be better to use a product version, so (13) becomes (15): 15 g 1 = a 1 c 1 a 1 a c a 1 b a c b a c 1 1 1 and 14 becomes (16): 16 g = a c a 1 a c a 1 b a c b a c C-LAB-TR-009-3 Seite 11 von 15

6.1 Example Let A=(1,), B=(1,6), C=(,4), see the following picture where the y-coordinate runs downwards. We do the following computations: 17 S= A B C = 1 1 3 3 E= A C 1 =, 4, 6 4 = 8,4 3 = 1.5,3 a 1 = 1 1 =39 b a c = 6 4=6 g 1 = 1 1 39 6 39 3.71 S' 1 3.71 3 g = 4 1 39 6 6 3.34, 4 3.34.37, 3.113 3 C-LAB-TR-009-3 Seite 1 von 15

7 Determining RFID Reader Circle Radius Size In this section we try to give a good estimation for the circle radius of a given RFID reader based on signal strength received from a fixed RFID tag. The time is divided into cycles. In each cycle, a fixed tag sends for each of the 4 signal strengths several (4) packages containing the signal strength and the tag's id. The reader receives a fraction of this packages and tries to determine the distance to the tag based on the signal strength and the fraction of packages received. This fraction can be adjusted to be the relative frequency of received packages compared to the total number of packages sent. This gives a bundle of functions computing the estimated radius for a given signal strength based on this frequency: 18 f si :[0,1] R for 1 i 4 We assume the left and right border of the interval to contain useless values which we try to keep off from being used for the subsequent computations. The best values expected shall be described this way: 19 f si x 1 =d i for 1 i 5 for example x 1 =0.5 Note that we have extended the values for the index i to contain an additional value (5). This will be needed later on. The values computed here shall describe the radius for the fixed signal strength when receiving best. This functions must be interconnected. The worst case values for smaller radius should correspond to the best cases values of the next larger radius: 0 f si x 0 =f si 1 x 1 for 1 i 4 for example x 0 =0 Applying (19) to this gives: 1 f si x 0 =d i 1 for 1 i 4 C-LAB-TR-009-3 Seite 13 von 15

Assuming the functions are linear (which means straight lines) in between, we have the following solution: f si x = d i d i 1 x 1 x 0 x x 0 d i 1 for 1 i 4 And indeed, inserting the best value into () just gives: f si x 1 = d i d i 1 x 1 x 0 x 1 x 0 d i 1 =d i d i 1 d i 1 =d i for 1 i 4 But this is just (19). Furthermore: f si x 0 = d i d i 1 x 1 x 0 x 0 x 0 d i 1 =d i 1 for 1 i 4 Which is just (1). 8 Conclusions Determining positions of RFID tags can start with a simple mathematical model but needs to be adjusted to real world constraints. Here, we took the freedom to introduce assumptions modifying our simple model towards real world effects. The realisation of this approach and the corresponding check within a real world project guided us and justified the appoach. C-LAB-TR-009-3 Seite 14 von 15

9 References [1] Bublitz, S, Eikerling, H-J.: Optimierung von Wartungs- und Instandhaltungsprozessen durch Wearable Computing, C-LAB Report, 006 [] Basiswissen RFID, http://www.info-rfid.de/downloads/basiswissen_rfid.pdf [3] RFID-Studie 007, Technologieintegrierte Datensicherheit bei RFID-Systemen, http://www.sit.fraunhofer.de/fhg/images/rfid-studie007_tcm105-9798.pdf [4] Stephan J. Engberg, Morten B. Harning, Christian Damsgaard Jensen: Zeroknowledge Device Authentication: Privacy & Security Enhanced RFID preserving Business Value and Consumer Convenience, http://www.rfidsec.com/docs/pst004_rfid_ed.pdf [5] Berger, F.: Kontextverarbeitung auf Basis von RFID bei der mobilen Wartung von komplexen Produkten, C-LAB Report, 007 [6] Grotemeyer, K.-P.,.: Analytische Geometrie, Gruyter, Walter de GmbH; Berlin, 1969 C-LAB-TR-009-3 Seite 15 von 15