Last Lecture: Localization Primitives This Lecture: Indoor - - PowerPoint PPT Presentation

last lecture localization primitives this lecture indoor
SMART_READER_LITE
LIVE PREVIEW

Last Lecture: Localization Primitives This Lecture: Indoor - - PowerPoint PPT Presentation

6.808: Mobile and Sensor Computing aka IoT Systems Lecture 3: Practical Device-based Localization Last Lecture: Localization Primitives This Lecture: Indoor Positioning Systems: RADAR [2000] Cricket [2000] Outdoor


slide-1
SLIDE 1

Lecture 3: Practical Device-based Localization

6.808: Mobile and Sensor Computing

aka IoT Systems

slide-2
SLIDE 2
  • Last Lecture: Localization Primitives
  • This Lecture:

–Indoor Positioning Systems:

  • RADAR [2000]
  • Cricket [2000]

–Outdoor Positioning System:

  • GPS
slide-3
SLIDE 3

Case Study 1: RADAR [INFOCOM ’00]

  • First paper to propose using wireless LANs for

indoor location estimation

  • Measurement-based / analysis paper (not

system)

  • Key idea: which of the localization

primitives?

  • Pioneering idea; with many enhancements

it’s a viable approach today in many settings

Why are we reading this paper?

slide-4
SLIDE 4
  • Database
  • Different
  • rientations
slide-5
SLIDE 5

Signal strength at the base stations as user walks

slide-6
SLIDE 6
  • Summarize signal strength samples at base

stations

  • Metric for determining best match
  • Determine “best match”

Approach

slide-7
SLIDE 7
  • Summarize signal strength samples at base stations

– Mean signal strength over a time window

  • Determine “best match”

– Empirical method – Signal propagation model

  • Metric for determining best match

– Nearest neighbor in signal space, i.e., Euclidean distance between ss’ and ss vectors

Approach

slide-8
SLIDE 8

Evaluation

  • Critique the evaluation?
slide-9
SLIDE 9

Why does the graph look like this? Averaging multiple nearest neighbors

slide-10
SLIDE 10

Case Study 2: Cricket [MobiCom ’00]

A general-purpose indoor location system for mobile and sensor computing applications

slide-11
SLIDE 11
  • Must work well indoors
  • Must scale to large numbers of devices
  • Should not violate user location privacy — location-support rather than track
  • Must be easy to deploy and administer
  • Should have low energy consumption

Cricket Design Goals

slide-12
SLIDE 12

Cricket Architecture

Passive listeners + active beacons scales well,
 helps preserve user privacy Decentralized, self-configuring network of 
 autonomous beacons

Beacon Listener info = “a1” info = “a2” Estimate distances to infer location

slide-13
SLIDE 13

SPACE = NE43-510 COORD = (146 272 0)

Obtain linear distance estimates Pick nearest to infer “space” Solve for device’s (x, y, z) Determine q w.r.t. each beacon and deduce

  • rientation vector
slide-14
SLIDE 14

Beacon Listener

Determining Distance

RF data (space name) Ultrasound (pulse)

  • A beacon transmits an RF and an ultrasonic signal

simultaneously

–RF carries location data, ultrasound is a narrow pulse

  • The listener measures the time gap between the

receipt of RF and ultrasonic (US) signals

–Velocity of US << velocity of RF

slide-15
SLIDE 15

Multiple Beacons Cause Complications

Beacon A Beacon B time RF B RF A US B US A Incorrect distance Listener

  • Beacon transmissions are uncoordinated
  • Ultrasonic pulses reflect off walls

These make the correlation problem hard and can lead to incorrect distance estimates

Solution: Beacon interference avoidance + listener interference detection

slide-16
SLIDE 16

Choosing the bitrate of transmission

  • How long should the packet be?
  • tau: 2 x ultra-sound longest TOF
  • packet size: S bits
  • bitrate < S/tau
  • “Long radio”
  • Other proposal for dealing with interference?
slide-17
SLIDE 17

Localization Schemes

  • How to localize?
  • majority (pick beacon with highest freq of occurrence)
  • minmean (pick beacon with smallest mean distance)
  • minmode (pick beacon with smallest mean distance)
  • Other proposals?
  • Intrinsic Challenges?
  • Extending to orientation?
slide-18
SLIDE 18

Compute the distance to the GPS satellites

d1 d3 d2

distance = propagation delay x speed of light

18

Case Study 3: GPS

slide-19
SLIDE 19

How to Compute the Propagation Delay?

Code

19

Each satellite has its own code

slide-20
SLIDE 20

How to Compute the Propagation Delay?

Code delay

Code arrives shifted by propagation delay

20

slide-21
SLIDE 21

How to Compute the Propagation Delay?

Correlation Spike

delay

Spike determines the delay use it to compute distance and localize

slide-22
SLIDE 22

GPS Data Packet

  • Almanac & ephemeris data
  • Satellite location, clock, orbital parameters,

etc.

  • Bitrate?
  • 50 bits/second
  • Takes about 12.5 minutes to download
  • How do today’s systems use it?
  • A-GPS (Assisted GPS)
  • WiFi APs are mapped — war-driving

22

slide-23
SLIDE 23

Summary: Device-Based Localization

  • Case Study 1: RADAR
  • first WLAN-based system
  • used RSSI+fingerprinting
  • Case Study 2: Cricket
  • ToF based / trilateration
  • new challenges with interference
  • Case Study 3: GPS
  • trilateration, A-GPS, WiFi APs

23

Next Lecture: Device-Free Localization