Location Aware Wireless Networks

Transcription

1 Location Aware Wireless Networks Behnaam Aazhang CMC Rice University Houston, TX USA and CWC University of Oulu Oulu, Finland

2 Wireless A growing market 2

3 Wireless A growing market Still! 3

4 Wireless A growing market Still! Applications Users 4

5 Wireless Demand on the radio link 5

6 Wireless Demand on the radio link Paradigm shift 6

7 Wireless Demand on the radio link Paradigm shift Analog to digital 7

8 Wireless Demand on the radio link Paradigm shift Analog to digital SISO to MIMO 8

9 Wireless Demand on the radio link Paradigm shift Analog to digital SISO to MIMO Next? 9

10 The Theme Wireless network: 10

11 The Theme Wireless network: Location and network aware physical layer 11

12 The Theme Wireless network: Location and network aware physical layer Power and spectral efficiency 12

13 The Theme Wireless network: Location and network aware physical layer Power and spectral efficiency Bits per Joule Aggregate bits/second/hz 13

14 The Theme Wireless network: Location and network aware physical layer Power and spectral efficiency Bits per Joule -- battery life Aggregate bits/second/hz--applications and users 14

15 This Presentation On overlaid network Device to device on cellular Cooperative network Examples Initial model 15

16 This Presentation On overlaid network--location aware Device to device on cellular Cooperative network--network aware Examples Initial model 16

17 This Presentation On overlaid network--location aware Device to device on cellular Cooperative network--network aware Examples Initial model 17

18 An Overlaid Network Spectrum sharing Work of Brett Kaufman with Jorma Lilleberg (at Nokia) 18

19 19

20 19

21 19

22 20

23 20

24 20

25 21

26 21

27 21

28 22

29 Pros 22

30 Pros User Capacity 22

31 Pros User Capacity Throughput 22

32 Pros User Capacity Throughput Power Savings 22

33 Pros User Capacity Throughput Power Savings Cons 22

34 Pros User Capacity Throughput Power Savings Cons Spectrum Management 22

35 Pros User Capacity Throughput Power Savings Cons Spectrum Management Interference 22

36 Pros User Capacity Throughput Power Savings Cons Spectrum Management Interference Ad hoc: Uncertainty 22

37 Infrastructure: Cellular BS 23

38 Cellular Network 3 Users CU CU BS CU 24

39 Cellular Network 3 Users 3 Channels CU 2 CU 3 BS CU 1 25

40 Cellular Network 3 Users Orthogonal Channels FDMA 3 Channels CU 2 CU 3 BS CU 1 26

41 Cellular Network 3 Users Orthogonal Channels FDMA 3 Channels CU 2 CU 3 BS CU 1 Time-division Duplex 27

42 Cellular Network 3 Users Orthogonal Channels FDMA 3 Channels CU 2 CU 3 BS CU 1 Time-division Duplex Power Control 28

43 Cellular Network 3 Users Orthogonal Channels FDMA 3 Channels CU 2 CU 3 BS CU 1 Time-division Duplex Power Control Uplink Frame 29

44 Cellular Network 3 Users Orthogonal Channels FDMA 3 Channels CU 2 CU 3 BS CU 1 Fully Loaded System 30 Time-division Duplex Power Control Uplink Frame

45 Cellular Network 9 Users Orthogonal Channels FDMA 3 Channels CU CU 2 CU CU CU 3 BS CU CU CU CU Fully Loaded CU 1 CU CU Time-division Duplex Power Control System 31 Uplink Frame

46 Secondary ad-hoc network CU CU 2 CU CU CU 3 BS CU CU CU CU 1 CU CU CU 32

47 Secondary ad-hoc network Device To Device () Users CU 2 CU 3 BS CU 1 33

48 Secondary ad-hoc network Device To Device () Users CU 2 CU 3 BS CU 1 One Flow Within a cluster in the cell 34

49 Overlaid Network CU 2 CU 3 BS CU 1 35

50 Overlaid Network CU 2 CU 3 BS Two simultaneous links on the CU 1 same channel 35

51 Overlaid Network Uplink CU 2 CU 3 BS Two simultaneous links on the CU 1 same channel 35

52 Rice University Cluster Radius = 0.25 km 36

53 R 100 Probability of a Clustered Link (%) Analytical Simulated r R =0.30 r α 37

54 R 100 Probability of a Clustered Link (%) Analytical Simulated r R =0.20 r R =0.30 r α 38

55 100 Probability of a Clustered Link (%) Analytical Simulated r R =0.10 r R =0.20 r R =0.30 α 39

56 Probability of a Clustered Link (%) Analytical Simulated r R =0.05 r R =0.10 r R =0.20 r R =0.30 α 40

57 Probability of a Clustered Link (%) 100 r R = r R =0.10 r R =0.20 r R =0.30 r R =1 α 41

58 A link and a Cellular link coexist with high probability Probability of a Clustered Link (%) 100 r R = r R =0.10 r R =0.20 r R =0.30 r R =1 α 42

59 The multichannel model 43

60 The multichannel model Higher probability for spatial reuse 44

61 100 Probability of a Clustered Link (%) N C =1 r R =0.25 α 45

62 100 Probability of a Clustered Link (%) N C =2 N C =1 r R =0.25 α 46

63 Probability of a Clustered Link (%) N C =5 N C =2 N C =1 r R =0.25 α 47

64 Probability of a Clustered Link (%) N C = 10 N C =5 N C =2 N C =1 r R =0.25 α 48

65 Multi hop within a cluster CU 2 CU 3 BS CU 1 49

66 Probability of a Multihop Route (%) A = 1300 m A = 600 m A = 0 m A Number of Idle Users 50

67 Probability of a Multihop Route (%) A = 1300 m A = 600 m A = 0 m Multihop links are more likely then the direct link A Number of Idle Users 51

68 Power Consumption CU 2 CU 3 BS CU 1 52

69 Power Consumption CU 2 CU 3 BS P T otal = P T CU 1 Normalize with respect to cellular mode 52

70 Power Consumption Direct Link CU 2 CU 3 BS CU 1 53

71 Power Consumption Direct Link CU 2 CU 3 BS P T otal = P T CU 1 53

72 Power Consumption Multihop Link CU 2 CU 3 BS CU 1 54

73 Power Consumption Multihop Link CU 2 CU 3 BS P T otal = P T CU 1 54

74 100 A Normalized Power Consumption (%) A = 0 m A = 600 m A = 1300 m Number of Idle Users 55

75 Normalized Power Consumption (%) A = 0 m A = 600 m A = 1300 m Substantial power savings A Number of Idle Users 56

76 Technical Challenges CU 2 CU 3 BS CU 1

77 Technical Challenges Managing interference CU 2 CU 3 BS CU 1 58

78 Model For a cellular link SINR BS β BS 59

79 Model For a cellular link For a link SINR BS β BS SINR β D 60

80 Model For a cellular link For a link SINR BS β BS SINR β D Margin for interference κ 61

81 Model P T P R d α N P R = P T d α + N

82 Power BS CU Tx Rx Downlink 63

83 Power Control Info Data BS CU Tx Rx Downlink 63

84 Power Control Info Data BS CU Tx Rx Constant Power Level Downlink 64

85 Power Control Info Data BS CU D α Tx Rx Constant Power Level Downlink 65

86 Power Use channel information to bound the transmit power BS CU Tx Rx Uplink 66

87 Power Use channel information to bound the transmit power BS CU Tx Rx Uplink 67

88 Power Use channel information to bound the transmit power BS CU Tx Rx This is done for each channel and by each user Uplink 68

89 Technical Challenges Discovery CU 2 CU 3 BS CU 1

90 Modified Dynamic Source Routing (DSR) Source initiated Source Destination Hop Count Relay 1... Relay N

91 Link Discovery S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 71

92 Link Discovery S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 72

93 Link Discovery Route Request S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 73

94 Link Discovery Route Request S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 73

95 Link Discovery Route Request S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 73

96 Link Discovery Route Reply S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 74

97 Link Discovery Route Reply S 3 S 2 S 6 S 1 S 4 S 8 S 5 S 7 74

98 Technical Challenges Performance analysis

99 Technical Challenges Performance analysis Pr{ connection exists} Random placement of nodes

100 Technical Challenges Performance analysis Pr{ connection exists} Random placement of nodes Active cellular users Idle nodes in a cluster

101 Technical Challenges Performance analysis Pr{ connection exists} Random placement of nodes Active cellular users Idle nodes in a cluster A geometric analysis

102 1 Channel R BS A r Cluster Randomly Located Cluster 79

103 1 Channel 1 Tx R D A BS r Tx B Cluster Randomly Located Cluster 80

104 1 Channel 1 Tx 1 Cellular User R D A BS r Tx B Cluster b C CU Randomly Located Cluster 81

105 1 Channel 1 Cellular User 1 Tx 1 Rx R D A BS r Tx d B Cluster b C Rx c CU Randomly Located Cluster 82

106 1 Channel 1 Cellular User 1 Tx 1 Rx R D A BS d max Tx d B Cluster r b C Rx c CU Randomly Located Cluster Maximum Transmission Range? 83

107 Pr[Link Exists] = Pr[d d max ] R D A BS d max Tx d B Cluster r b C Rx c CU 84

108 Pr[d d max ]= C b c A B D R D A BS d max Tx d B Cluster r b C Rx c CU 85

109 Location Aware Network Opportunistic overlaid 86

110 Network Aware Physical Layer Cooperation 87

111 Final Thoughts Location aware A spectrum sharing example Network aware Models and formulations Promising initial results 88