1. Location Y. Richard Yang 4/6/2011

2. 2 Wireless Networking: Summary send receive status info info/control - The ability to communicate is a foundational support of wireless mobile networks - Unfortunately, the capacity of such networks using current techniques is limited - Much progress has been made, but still more are coming.

3. Outline r Admin. r Localization m overview 3

4. 4 Motivations r The ancient question: Where am I? r Localization is the process of determining the positions of the network nodes r This is as fundamental a primitive as the ability to communicate

5. 5 Localization: Many Applications r Location aware information services m e.g., E911, location-based search, advertisement, inventory management, traffic monitoring, emergency crew coordination, intrusion detection, air/water quality monitoring, environmental studies, biodiversity, military applications, resource selection (server, printer, etc.)  “ Sensing data without knowing the location is meaningless. ” [IEEE Computer, Vol. 33, 2000]

6. 6 Measurements The Localization Process Localizability (opt) Location Computation Location Based Applications

7. 7 Classification of Localization based on Measurement Modality r Coarse-grained measurements, e.g., m signal signature a database of signal signature (e.g. pattern of received signal, visible set of APs (http://www.wigle.net/)) at different locations match to the signature m connectivity r Usage m e.g., Microsoft “Locate Me” m Place lab: http://data.placelab.org/ r Advantages m low cost; measurements do not need line-of-sight r Disadvantages m low precision For a detailed study, see “Accuracy Characterization for Metropolitan-scale Wi-Fi Localization,” in Mobisys 2005.

8. 8 Classification of Localization based on Measurement Modality (cont’) r Fine-grained localization m distance m angle (esp. with MIMO) r Usage m GPS, sensor networks r Advantages m high precision r Disadvantages m measurements need line-of-sight for good performance Cricket

9. Outline r Admin. r Localization m Overview m GPS 9

10. 10 Global Position Systems r US Department of Defense: need for very precise navigation r In 1973, the US Air Force proposed a new system for navigation using satellites r The system is known as: Navigation System with Timing and Ranging: Global Positioning System or NAVSTAR GPS http://www.colorado.edu/geography/gcraft/notes/gps/gps_f.html

11. 11 GPS Operational Capabilities Initial Operational Capability - December 8, 1993 Full Operational Capability declared by the Secretary of Defense at 00:01 hours on July 17, 1995

12. 12 NAVSTAR GPS Goals r What time is it? r What is my position (including attitude)? r What is my velocity? r Other Goals: - What is the local time? - When is sunrise and sunset? - What is the distance between two points? - What is my estimated time arrival?

13. 13 GSP Basics Simply stated: The GPS satellites are nothing more than a set of wireless base stations in the sky r The satellites simultaneously broadcast beacon messages (called navigation messages) r A GPS receiver measures time of arrival to the satellites, and then uses “trilateration” to determine its position

14. 14 GPS Basics: Triangulation r Measurement: Computes distance

15. 15 GPS Basics: Triangulation r In reality, receiver clock is not sync’d with satellites r Thus need to estimate clock called pseudo range

16. 16 GPS with Clock Synchronization?

17. 17 GPS Design/Operation r Segments (components) m user segment: users with receivers m control segment: control the satellites m space segment: the constellation of satellites transmission scheme

18. 18 Control Segment Master Control Station is located at the Consolidated Space Operations Center (CSOC) at Flacon Air Force Station near Colorado Springs

19. 19 CSOC r Track the satellites for orbit and clock determination r Time synchronization r Upload the Navigation Message r Manage Denial Of Availability (DOA)

20. 20 Space Segment: Constellation

21. 21 Space Segment: Constellation r System consists of 24 satellites in the operational mode: 21 in use and 3 spares 3 other satellites are used for testing r Altitude: 20,200 Km with periods of 12 hr. r Current Satellites: Block IIR- $25,000,000 2000 KG r Hydrogen maser atomic clocks m these clocks lose one second every 2,739,000 million years

22. 22 GPS Orbits

23. 23 GPS Satellite Transmission Scheme: Navigation Message r To compute position one must know the positions of the satellites r Navigation message consists of: - satellite status to allow calculating pos - clock info r Navigation Message at 50 bps m each frame is 1500 bits m Q: how long for each message? More detail: see http://home.tiscali.nl/~samsvl/nav2eu.htm

24. 24 GPS Satellite Transmission Scheme: Requirements r All 24 GPS satellites transmit Navigation Messages on the same frequencies r Resistant to jamming r Resistant to spoofing r Allows military control of access (selected availability)

25. 25 GPS As a Communication Infrastructure r All 24 GPS satellites transmit on the same frequencies BUT use different codes m i.e., Direct Sequence Spread Spectrum (DSSS), and m Code Division Multiple Access (CDMA) m Using BPSK to encode bits

26. 26 Basic Scheme

27. 27 GPS Control r Controlling precision m Lower chipping rate, lower precision r Control access/anti-spoofing m Control chipping sequence

28. 28 GPS Chipping Seq. and Codes r Two types of codes m C/A Code - Coarse/Acquisition Code available for civilian use on L1 Chipping rate: 1.023 M 1023 bits pseudorandom numbers (PRN) m P Code - Precise Code on L1 and L2 used by the military Chipping rate: 10.23 M PRN code is 6.1871 × 10 12 (repeat about one week) P code is encrypted called P(Y) code http://www.navcen.uscg.gov/gps/geninfo/IS-GPS-200D.pdf http://www.gmat.unsw.edu.au/snap/gps/gps_survey/chap3/chap3.htm

29. 29 GPS PHY and MAC Layers

30. 30 Typical GPS Receiver: C/A code on L1 r During the “acquisition” time you are receiving the navigation message also on L1 r The receiver then reads the timing information and computes “pseudo-ranges”

31. Military Receiver r Decodes both L1 and L2 m L2 is more precise m L1 and L2 difference allows computing ionospheric delay 31

32. 32 Denial of Accuracy (DOA) r The US military uses two approaches to prohibit use of the full resolution of the system r Selective availability (SA) m noise is added to the clock signal and m the navigation message has “lies” in it m SA is turned off permanently in 2000 r Anti-Spoofing (AS) - P-code is encrypted

33. 33 Extensions to GPS r Differential GPS m ground stations with known positions calculate positions using GPS m the difference (fix) transmitted using FM radio m used to improve accuracy r Assisted GPS m put a server on the ground to help a GPS receiver m reduces GPS search time from minutes to seconds m E.g., iPhone GPS: http://www.broadcom.com/products/GPS/GPS- Silicon-Solutions/BCM4750http://www.broadcom.com/products/GPS/GPS- Silicon-Solutions/BCM4750

34. 34 GPS: Summary r GPS is among the “simplest” localization technique (in terms topology): one-step trilateration

35. 35 GPS Limitations r Hardware requirements vs. small devices r GPS jammed by sophisticated adversaries r Obstructions to GPS satellites common each node needs LOS to 4 satellites GPS satellites not necessarily overhead, e.g., urban canyon, indoors, and underground

36. 36 Percentage of localizable nodes localized by Trilateration. Uniformly random 250 node network. Limitation of Trilateration Ratio Average Degree

37. Outline r Admin. r GPS r General localization 37

38. 38 Extending GPS: Multilateration r A subset of nodes (called anchors) know their positions m through GPS, e.g., nodes close to windows, at the entrance of a cave, at an open field inside a forest, etc m manual configuration r Nodes measure relative distance among each other 5 4 1 2 3

39. 39 General Localization node with known position (anchor) node with unknown position distance measurement

40. 40 Localization Service Definition Given: set of n nodes positions of k of them known distances between m pairs of nodes Find: positions of nodes node with known position (anchor) node with unknown position distance measurement

41. Outline r Admin. r GPS r General localization m Overview m Foundation 41

42. 42 Measurement Graph r Consider network nodes as vertices in a graph r There is an edge between two vertices if the distance between the corresponding nodes are known 5 4 1 2 3 5 4 1 2 3

43. 43 Grounded Graph r The measurement graph structure needs to distinguish between anchor nodes and non- anchor nodes r Solution: add an edge between every pair of anchor nodes, since the distance between them is implicitly known! r The resulting graph is called grounded graph, whose graphical properties determine localizability with probability 1 5 4 1 2 3 5 4 1 2 3

44. 44 Grounded Graphs r The grounded graph captures all distance constraints m we no longer need to distinguish between anchor nodes and non-anchor nodes m use anchor only at the last to pinpoint all nodes

45. 45 In case you were wondering : Why “with probability 1”? 2 1 3 4 probability 1 case 2 1 3 4 probability 0 case 4 2 1 3 {x 1, x 2, x 3 } {d 14, d 24, d 34} 2 1 3 ? ? In general, this graph is uniquely realizable. In degenerate case, it is not: The constraints are redundant.

46. 46 Summary of Problem: General Localization using Grounded Graphs r Determine if the positions of all nodes are fixed relative to each other due to the known distance measurements, then all nodes have unique positions (the network is thus localizable) m Then the only deformation allowed is translation or rotation of the complete network m This is called trivial continuous transformation r Use anchors can remove trivial transformation

47. Example 47 Question: any continuous transformation to move points from one configuration to another one while respecting all distance constraints?

48. 48 Non-Uniqueness Due to Continuous Deformation Continuous non-uniqueness: -Non-trivial continuous transformation to move points from one configuration to another one while respecting all distance constraints

49. 49 Graph Rigidity r A localization network is flexible if it admits a non-trivial continuous deformation r A localization network with a unique realization cannot be flexible r A localization network that is not flexible is called rigid r Rigidity is a necessary condition for network localizability

50. Rigidity in Other Contexts 50

51. 51

52. 52 Intuition: Total degrees of freedom:2n How many distance constraints are necessary to limit a graph to only trivial continuous deformations? == How many edges are necessary for a graph to be rigid?

53. 53 Each edge can remove a single degree of freedom How Many Constrains are Necessary to Make a Localization Network of n Nodes Rigid? Rotations and translations will always be possible, so at least 2n-3 edges are necessary for a graph to be rigid.

54. 54 Are 2n-3 Edges Sufficient? n = 3, 2n-3 = 3 yes n = 4, 2n-3 = 5 n = 5, 2n-3 = 7 no

55. 55 Further Intuition r Need at least 2n-3 “well-distributed” edges r If not well-distributed, a subgraph has more edges than necessary: some edges are redundant r Non-redundant edges are called independent n = 5, 2n-3 = 7

56. 56 Determining Edge Independence This means that a graph with 2n-3 edges is rigid if and only if no subgraph has more than 2n’-3 edges. * n’ is the number of nodes |V’| in the subgraph (V’,E’). The edges of a graph are independent if and only if no subgraph has more than 2n’-3 edges*. Laman’s Condition: n = 5, 2n-3 = 7

57. 57 Algorithm to Test Laman ’ s Condition r Laman’s condition taken literally leads to poor algorithm, as it involves checking all subgraphs r Efficient and intuitive algorithm exists, based on counting degrees of freedom to check and identify rigid components

58. 58 Alternate Laman ’ s condition For a graph G=(V,E) with m edges and n vertices, the following are equivalent: A. The edges of G are independent in 2-D. B. For each edge (a,b) in G, the graph formed by adding 3 additional copies of (a,b) has no subgraph G’ with more than 2n’ edges.

59. 59 Illustration no subgraph with >2n’ edges “quadruple an edge” G

60. 60 Basic idea r Grow a maximal set of independent edges one at a time r Each candidate edge quadrupled and the resulting graph tested using Laman’s revised condition r If 2n’-3 independent edges found for n’ nodes, the subgraph is rigid

61. 61 “ The Pebble Game ” r Each node assigned 2 pebbles r An edge is covered by having one pebble placed on either of its ends r Pebble covering is assignment of pebbles so that all edges in graph are covered r Existence of pebble covering of graph implies balanced edges implies all edges independent

62. 62 initial testing e1 for independence e1 4 copies of e2 Pebble Covering e2

63. 63 r Assume we have a set of independent edges covered with pebbles and we want to add a new edge r First, look at vertices incident to new edge m if either has a free pebble, use it to cover the edge and done. m otherwise, their pebbles are covering existing edges. if vertex at other end of one of these edges has free pebble, then use that pebble to cover existing edge, freeing up pebble to cover new edge Search for free pebbles in a directed graph. –if edge e a,b is covered by pebble from vertex a, the edge if directed from a to b Search until pebble is found, then swap pebbles until new edge covered, else fail Pebble Game Algorithm

64. 64 0 1 2 3 1 2 3 3 2 3 4 4 0 5 4 3 1 2 3 3 2 3 4 4 unassigned pebble Assume node 0 gets a new edge to cover.

65. 65 a b c d initial state a c d a c d b (a,b) independent testing (a,b) b after (a,b) included

66. 66 c b a c d b input to next step a d a c d b after (b,c) included testing (b,c)

67. 67 a a c d b input to next step c d b testing (a,c) ? a c d b after (a,c) included

68. 68 d a c d b input to next step a c b testing (a,d) a c d b after (a,d) included

69. 69 b d a c d b input to next step a c d b after (b,d) included a c testing (b,d) G=({a,b,c,d}, {ab,ac,ad,bc,bd}) is rigid

70. 70 a c d b input to next step a c d b testing (c,d) fails!

71. 71 Pebble Game Properties r Testing edge for independence takes O(n) time. At worst, all m edges will be tested for a running time of O(nm) r If entire graph not rigid, pebble game discovers rigid subgraphs r Algorithm is amenable to distributed implementation

72. 72 Continuous Deformation Solved Continuous non-uniqueness: -Can move points from one configuration to the other while respecting constraints

73. Backup Slides 73

74. 74 GPS PHY and MAC Layers

75. 75

76. 76 GPS Chipping Seq. and Codes r Two types of codes m C/A Code - Coarse/Acquisition Code available for civilian use on L1 1023 bits pseudorandom numbers (PRN) m P Code - Precise Code on L1 and L2 used by the military PRN code is 6.1871 × 10 12 (repeat about one week) P code is encrypted called P(Y) code http://www.navcen.uscg.gov/gps/geninfo/IS-GPS-200D.pdf http://www.gmat.unsw.edu.au/snap/gps/gps_survey/chap3/chap3.htm