spectrum sharing applications
play

Spectrum Sharing Applications Sreeraj Rajendran rsreeraj@gmail.com - PowerPoint PPT Presentation

Spectrum Sharing Applications Sreeraj Rajendran rsreeraj@gmail.com FOSDEM 15 , Brussels February 1, 2015 Intro Algorithms Tools Contents 5G Spectrum Sharing Challenge Some approaches in literature Single channel solutions


  1. Spectrum Sharing Applications Sreeraj Rajendran rsreeraj@gmail.com FOSDEM ’15 , Brussels February 1, 2015

  2. Intro Algorithms Tools Contents ◮ 5G Spectrum Sharing Challenge ◮ Some approaches in literature ◮ Single channel solutions ◮ Prototyping tools 2 / 16

  3. Intro Algorithms Tools Challenge Setup 3 / 16

  4. Intro Algorithms Tools Scoring criteria ◮ Final Score Score = T SU × S PU � � 0 , 10 9 T PU − � S PU = max T PU ◮ T SU - Delivered secondary user throughput ◮ S P U - Primary user satisfaction ◮ T P U - Delivered primary user throughput ◮ � T P U - Offered primary throughput ◮ Objective winner ◮ Based on the highest score ◮ Subjective winner ◮ Based on the quality of the paper ◮ More details: ieee-dyspan.org 4 / 16

  5. Intro Algorithms Tools Simple Scenario (Single Channel selection) ◮ Assumptions ◮ Entire time duration divided into slots ◮ Secondary collisions are the only cause for primary throughput reduction ◮ Channel occupancy distribution is known ◮ Objective ◮ Maximize SU throughput ◮ Channel selection ◮ Select the channel with minimum occupancy 5 / 16

  6. Intro Algorithms Tools Problems ◮ Issues ◮ SU lacks the information about the channel ◮ SU has to explore the channel to estimate its occupancy ◮ Exploration-Exploitation trade-off ◮ Models ◮ Popular multi-armed bandit problems 6 / 16

  7. Intro Algorithms Tools Upper confidence bound (UCB) based strategies ◮ Sensing and Transmission slot T T T SE T TX ◮ Assign positive reward if the channel is sensed free ◮ Average the reward and calculate an upper confidence bound for the sample mean ◮ Select the channel based on this UCB Reference: W. Jouini, D. Ernst, C. Moy, and J. Palicot, ”Upper confidence bound based decision making strategies and dynamic spectrum access,” in Proceedings of the IEEE International Conference on Communications (ICC ’10) 7 / 16

  8. Intro Algorithms Tools Single channel selection Demo (UCB) 8 / 16

  9. Intro Algorithms Tools We could do better ◮ There will be sensing errors ◮ Obvious since PU and SU are not synchronized ◮ Exploit the feedback information ( T PU , T SU ) ◮ Sensing and transmission slots are fixed ◮ Stop sensing if channel is always free 9 / 16

  10. Intro Algorithms Tools Reinforcement Learning ◮ A more general framework ◮ A discrete set of states, S ◮ A discrete set of actions, A ◮ A policy π that maximizes the expected reward Agent New state s t +1 Reward r t +1 Action a t Environment 10 / 16

  11. Intro Algorithms Tools Q-Learning ◮ Most popular model-free algorithm for reinforcement learning ◮ Learns from delayed reinforcement ◮ Model ◮ Action set: { sense, transmit, channel switch } ◮ States, S : { 0 , .., n } where n is the number of available channels ◮ QL update � � Q t +1 ( s, a t ) = Q t ( s, a t ) + α r ( s, a t ) + γ max Q t ( s, a ) − Q t ( s, a t ) a α is the learning rate and γ is the discount factor 11 / 16

  12. Intro Algorithms Tools More details: How to select a channel ’s’? ◮ Q ( s, a se ) : Sensing reward � 0 if channel is occupied r ( s, a se ) = 1 if channel is free ◮ Q ( s, a tx ) : Transmission reward r ( s, a tx ) = T SU − T CO ◮ Q ( s, a sw ) V ( s ) = Q t ( s, a se ) + Q t ( s, a tx ) � s = arg max V ( h ) h ∈ S Q t +1 ( s, a cs ) = V ( � s ) − V ( s ) ◮ Soft-max selection policy, π t ( s, a ) Reference: Marco Di Felice, Kaushik Roy Chowdhury, Andreas Kassler and Luciano Bononi, ”Adaptive Sensing Scheduling and Spectrum Selection” in Proceedings of the 20th International Conference on Computer Communications and Networks (ICCCN ’11) 12 / 16

  13. Intro Algorithms Tools Simulation Results ◮ After every 4000 × T slot a random channel is made free 13 / 16

  14. Intro Algorithms Tools We could do better ◮ Room for improvement ◮ Multi-Channel solutions ◮ Consider PU throughput ◮ PU will back-off due to the presence of carrier sense (802.15.4) ◮ No intelligence in PU to maximize throughput 14 / 16

  15. Intro Algorithms Tools Prototyping tools ◮ GNURadio examples ◮ gnuradio.org ◮ OOT modules from Bastian Bloessl ◮ github.com/bastibl/gr-ieee802-15-4 ◮ github.com/bastibl/gr-foo ◮ RFNoC ◮ github.com/EttusResearch/uhd/wiki/RFNoC ◮ Labview ◮ dyspanchallenge@esat.kuleuven.be 15 / 16

  16. Intro Algorithms Tools THANK YOU 16 / 16

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend