上浒充通大 Route Switching SHANGHAI JIAO TONG UNIVERSITY ▣ Spectrum Mobility Route Break Route Switching Potential Location for Building Bridges Bridge (correspond to a physical data link) (Correspond to a Licensed Channel) Source Destination Re-select a new spatial route(switch to a new spatial route)? Routing Costs Build a new bridge at the same location?(switch to a new channel)?Channe/Switching Costs 6
6 Route Switching ❑ Spectrum Mobility Route Break Route Switching Source Destination Build a new bridge at the same location? (switch to a new channel) ? Re-select a new spatial route (switch to a new spatial route) ? Channel Switching Costs Routing Costs Potential Location for Building Bridges (correspond to a physical data link) Bridge (Correspond to a Licensed Channel)
上浒充通大学 Route Switching SHANGHAI JIAO TONG UNIVERSITY In order to balance routing and switching costs,joint switching in both Spatial and Frequency domains is necessary! Two-Dimensional Route Switching 7
7 Route Switching In order to balance routing and switching costs, joint switching in both Spatial and Frequency domains is necessary! Two-Dimensional Route Switching
上浒充通大￥ Route Switching SHANGHAI JIAO TONG UNIVERSITY Two-Dimensional Route Switching 0 0 E Channel 1 2 1 2 Channel 2 Channel 2 Channel 5 B Channel 5 B D 2 1 2 1 Channel 4 Channel 3 Channel 4 Channel 3 (a)original route and channel assignment (b)channel 1 is reclaimed by PUs 0 0 E E Switch to Channel 6 2 Ch)e1 1 1 Channel 2 B B D Channel 2 Channel 5 Channel5 2 1 2 1 Channel 4 Channel 3 Channel 4 Channel 3 (c)strategy update when switching costs are 1 (d)strategy update when switching costs are 3 8
8 Route Switching ❑ Two-Dimensional Route Switching
8 上洋充通大学 Overview of Results SHANGHAI JIAO TONG UNIVERSITY Route Switching Existence of the potential function in CRN Existence of the Nash Equilibrium(NE) Complete Information An algorithm for finding the NE Game Model A low-complexity algorithm for finding the approximate NE Existence of Bayesian Nash Equilibria(BNE) Incomplete Information A simple algorithm for finding the BNE Price of Anarchy Be upper-bounded Game Analysis Bayesian Price of Anarchy Be deterministically bounded 9
9 Overview of Results Comp Complete lete Information Incomplete Information Existence of the potential function Existence of the Nash Equilibrium (NE) An algorithm for finding the NE A low-complexity algorithm for finding the approximate NE Existence of Bayesian Nash Equilibria (BNE) A simple algorithm for finding the BNE Game Analysis Be upper-bounded Be deterministically bounded Improvement Price of Anarchy Bayesian Price of Anarchy Game Model Route Switching in CRN
Outline 上浒充通大￥ SHANGHAI JIAO TONG UNIVERSITY ▣Introduction ▣Network Model >Network Architecture >Flow Interference Model >Cost Model Complete-Information Scenario Q Incomplete-Information Scenario ▣Game Analysis ▣Conclusion 10
10 Outline ❑ Introduction ❑ Network Model ➢ Network Architecture ➢ Flow & Interference Model ➢ Cost Model ❑ Complete-Information Scenario ❑ Incomplete-Information Scenario ❑ Game Analysis ❑ Conclusion