Learning, prediction and selection algorithms for opportunistic spectrum access
|
|
- Justin Hudson
- 6 years ago
- Views:
Transcription
1 Learning, prediction and selection algorithms for opportunistic spectrum access TRINITY COLLEGE DUBLIN Hamed Ahmadi Research Fellow, CTVR, Trinity College Dublin
2 Future Cellular, Wireless, Next Generation Broadband & IoT
3 CONNECT is a one stop shop for all things to do with future networks and communications in Ireland. IoT Wireless Cellular Fixed hardware, software, infrastructure, architecture, management, applications, services
4 10 THE INSTITUTIONAL TEAM 35 PIs 200 researchers in total
5
6 35+ THE INDUSTRY TEAM
7 Learning, prediction and selection algorithms for opportunistic spectrum access
8 Opportunistic spectrum access
9 From the literature: To predict the presence/absence of the primary user we can learn the activities of the primary user using machine learning algorithms. We ask: Is learning the activities of the primary user always beneficial? We show that the predictability of a channel strongly depends on the duty cycle and the complexity of PU activities on that channel.
10 Can we make predictions with less information about channels? We present an ANN which can predict the expected transmission rate on a channel knowing only the duty cycle and complexity of PU s activity on the channel.
11 Do we need to observe all the channels? With a greedy algorithm we select a subset of channels to observe and compare its performance with the performance of the system when observing all channels.
12 Markov process- based Learning Algorithm The presence of a PU on a channel is represented with a 1 and the absence of PUs with a 0. The channel state at the next time slot will be predicted by: y t + 1 = 0 p(x t, 0 λ) p(x t, 1 λ) 1 otherwise
13 Duty cycle and Lempel-Ziv complexity A spectrum occupancy sequence can be characterized in terms of the observed DC and the complexity of the PU activity. Each channel is the realization of a 2-state first order Markov chain (MC). For an ergodic source the Lempel-Ziv complexity equals the entropy rate of the source, which for a Markov chain X is given by: h X = δ i p ij log p ij ij
14 Impact of LZ and DC on the prediction accuracy We considered 5 possible δ 0 values in the range 0.5,, 0.9. For each of these values, we considered 5 transition probability matrices, each corresponding to a different value of entropy rate. At each point K = 3 channels. P f is the probability of at least one free channel existing.
15 Probability of selecting a free channel The three configurations refer to the same stationary distribution δ = Blue=[ ; ], red= [ ; ], green=[ ; ]. For each simulation, we used a training sequence of 1000 time steps and an evaluation sequence of 20,000 time steps.
16 Reducing the number of channels Here 3 channels are characterized by DC = 0.6 (low, medium and high complexity) and the other 3 channels correspond to DC = 0.5 (low, medium and high complexity).
17 Estimating the complexity The LZ complexity converges to the entropy rate of a sequence if we compute it over infinite samples. We conducted 1000 independent simulations and computed the LZ complexity values of binary sequences generated according to four different channel transition matrices.
18 Impact on real spectrum data The analysis and simulations are preformed over the Rheinisch- Westfalische Technische Hochschule (RWTH) Aachen University data set. We use the data (power spectrum density) K = 4 channels of 2.4-GHz ISM band
19 Impact on real spectrum data Probability of success of the Markov process-based learning algorithm as a function of the average LZ complexity and the probability of at least one free channel existing. Each point represents a particular instance of the Markov process-based learning algorithm applied to K = 4 channels of GSM 1800.
20 There are many more channels to observe in reality!!!
21 Success rate prediction with neural networks We use DC and LZ proactively to predict success rate (E[T]) We use a feed forward neural network with a single layer of hidden units. The number of inputs to each network is 2 C, with C {2, 3,..., k}. We tested the accuracy of the proposed approach relying on both an idealized mathematical model of PU behaviour and on actual PU activity data.
22 Evaluating NN with synthetic data Training data set: we considered 7 possible δ 0 values in the range 0.2,..., 0.8. For each of these values, we considered p 11 (or p 00 ) values of 0.1, 0.3, 0.5, 0.7, 0.9 if δ 0 >= 0.5 (if δ 0 < 0.5), obtaining 35 different transition probability matrices. Test data set: we considered 7 additional possible δ 0 values in the range 0.15,..., For each of these values, we considered p 11 (or p 00 ) values of 0.1, 0.3, 0.5, 0.7, 0.9 if δ 0 >= 0.5 (if δ 0 < 0.5), obtaining 35 different transition probability matrices.
23 Evaluating NN with real data Training set: we considered sequences of spectrum occupancy over 12 hours (from 11:00 to 23:00) in a number of frequency bands: the 2.4 GHz ISM band, the DECT band, and the GSM900 and GSM1800 bands. Considering all the possible combinations of channels with duty cycle DC [0.3, 0.8]. Test set: we generated the test set for each network using the same procedure and considering sequences of spectrum occupancy over 12 hours on a different day.
24 The problem is not totally solved yet! We cannot observe all channels!
25 How to select the best subset of channels to observe? Consider a set S of channels within which a CR has to identify a subset of at most k channels to be later exploited using a dynamic channel selection (DCS) approach. The selection of the optimal subset of channels can be formulated as: where u(c) denotes the performance of the DCS approach corresponding to the set of channels C and P k (S) is the set of subsets of S with cardinality C {2,..., k}. The dimension of the search space is
26 Channel Subset selection algorithm To reduce the search space we propose a greedy algorithm
27 Performance of our greedy algorithm on synthetic data We create a set of 12 two-state MCs that can model channels with three different DC (DC {0.55, 0.57, 0.6}) and four different LZ complexity values for each DC
28 Performance of our greedy algorithm on real data We consider all channels in the 2.4GHz ISM band with DC [0.3, 0.8] over a period of 12 hours. the E[T] obtained by trying to exploit all the channels is 0.66, which is slightly lower than the E[T] corresponding to the best 5 channels in the band.
29 NN-based Greedy algorithm 2.4GHz ISM band: the difference in performance between the E[T] corresponding to the optimum subset and the E[T] of NNbased exhaustive search(e1) and NN-based greedy algorithm (e2).
30 Selecting fungible channel sets for multiple users
31 Bundling of channels Assigning fungible channel sets to different CRs 31
32 Low-High complexity The average difference between the performance of the Markov process-based learning algorithm on the optimum subsets and the subsets of channels with Lowest DC (LDC). We consider 3 users, 10 channels with high LZ and base-dc, and 10 channels with low LZ and DC=base-DC+Δ.
33 Algorithm
34 Real Data Average and variance of the performance of the Markov process-based learning algorithm on the optimum, the NNG selected subsets and the subsets of channels with Lowest DC over a data set of all channels in 2.4 GHz ISM band with DC [0:3; 0:8] (in total 19 channels).
35 What if the channel statistics significantly change?
36 Summary What we did is
37 Summary What we did is And what we are going to do is
38 Carrier Aggregation as a Repeated Game: Learning Algorithms for Efficient Convergence to a Nash Equilibrium
39 In Game of thrones you either WIN or you DIE Cersei Lannister
40 In Game theory we study the mathematical models of conflict and cooperation between intelligent rational decision-makers In Game of thrones you either WIN or you DIE Cersei Lannister
41 Motivation Extension of current static CA to dynamic CA has been explored recently Dynamic CA is possible in a distributed manner Few works allow each network to aggregate non-contiguous channels in multiple frequency bands Effect of out-of-channel (OOC) interference in adjacent frequency channels is not considered in existing works Ahmadi H, Macaluso I, DaSilva L.A, Carrier aggregation as a repeated game: learning algorithms for efficient convergence to a Nash equilibrium, Accepted in IEEE Globcom 13.
42 What we do Model the preference for contiguous channels aggregation Assign a higher cost to the inter-band CA Model the problem of dynamic CA as a non-cooperative game Propose learning algorithms that converge to a pure NE within a reasonable number of iterations under the conditions of incomplete and imperfect information
43 Intra-band and inter-band CA nbands(a) is the number of bands that a node accesses when selecting action a
44 System model N wireless networks B available frequency bands, each band has K b channels The cardinality of each network s action space is: The reward function of network i is Distributed CA problem as a game denoted by G = (N,A, r)
45 ITEL-BA
46 ITEL-BA with imperfect information To deal with noisy feedback/sensing, each player computes the received and hypothetical payoffs and then updates r i (k) using an n-sample weighted moving average In ITEL-BAWII, when a player experiments with new actions either in content or discontent mood, she will select the action that maximizes the average estimated payoff r i (k) The expected sensing time is TsM for all the states
47 Results Convergence probability of ITEL-BA to an NE for different scenarios
48 Results Convergence probability of ITEL-BA and ITEL-BAWII when the observations are not perfect
49 Conclusions We modelled CA problem of autonomous networks operating in shared spectrum as a repeated game We proposed learning algorithms that efficiently converge to an NE without the need for complete or even perfect information Our results show that the algorithm, which effectively converges to an NE with incomplete information (ITEL-BA), is not efficient in the case of imperfect information Our algorithm that effectively deals with imperfect and incomplete information (ITELBAWII) requires additional sensing and computational resources
50 Thank you Questions?
Cognitive Radios Games: Overview and Perspectives
Cognitive Radios Games: Overview and Yezekael Hayel University of Avignon, France Supélec 06/18/07 1 / 39 Summary 1 Introduction 2 3 4 5 2 / 39 Summary Introduction Cognitive Radio Technologies Game Theory
More informationImperfect Monitoring in Multi-agent Opportunistic Channel Access
Imperfect Monitoring in Multi-agent Opportunistic Channel Access Ji Wang Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements
More informationThroughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks ArticleInfo ArticleID : 1983 ArticleDOI : 10.1155/2010/653913 ArticleCitationID : 653913 ArticleSequenceNumber :
More informationReading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.
Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read
More informationLECTURE 26: GAME THEORY 1
15-382 COLLECTIVE INTELLIGENCE S18 LECTURE 26: GAME THEORY 1 INSTRUCTOR: GIANNI A. DI CARO ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation
More informationOverview. Cognitive Radio: Definitions. Cognitive Radio. Multidimensional Spectrum Awareness: Radio Space
Overview A Survey of Spectrum Sensing Algorithms for Cognitive Radio Applications Tevfik Yucek and Huseyin Arslan Cognitive Radio Multidimensional Spectrum Awareness Challenges Spectrum Sensing Methods
More informationAlternation in the repeated Battle of the Sexes
Alternation in the repeated Battle of the Sexes Aaron Andalman & Charles Kemp 9.29, Spring 2004 MIT Abstract Traditional game-theoretic models consider only stage-game strategies. Alternation in the repeated
More informationCognitive Radio: Smart Use of Radio Spectrum
Cognitive Radio: Smart Use of Radio Spectrum Miguel López-Benítez Department of Electrical Engineering and Electronics University of Liverpool, United Kingdom M.Lopez-Benitez@liverpool.ac.uk www.lopezbenitez.es,
More informationSummary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility
Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should
More informationReinforcement Learning in Games Autonomous Learning Systems Seminar
Reinforcement Learning in Games Autonomous Learning Systems Seminar Matthias Zöllner Intelligent Autonomous Systems TU-Darmstadt zoellner@rbg.informatik.tu-darmstadt.de Betreuer: Gerhard Neumann Abstract
More informationDistributed and Coordinated Spectrum Access Methods for Heterogeneous Channel Bonding
Distributed and Coordinated Spectrum Access Methods for Heterogeneous Channel Bonding 1 Zaheer Khan, Janne Lehtomäki, Simon Scott, Zhu Han, Marwan Krunz, and Alan Marshall Abstract Channel bonding (CB)
More informationConvergence in competitive games
Convergence in competitive games Vahab S. Mirrokni Computer Science and AI Lab. (CSAIL) and Math. Dept., MIT. This talk is based on joint works with A. Vetta and with A. Sidiropoulos, A. Vetta DIMACS Bounded
More informationDynamic Spectrum Access in Cognitive Radio Networks. Xiaoying Gan 09/17/2009
Dynamic Spectrum Access in Cognitive Radio Networks Xiaoying Gan xgan@ucsd.edu 09/17/2009 Outline Introduction Cognitive Radio Framework MAC sensing Spectrum Occupancy Model Sensing policy Access policy
More informationSequential Multi-Channel Access Game in Distributed Cognitive Radio Networks
Sequential Multi-Channel Access Game in Distributed Cognitive Radio Networks Chunxiao Jiang, Yan Chen, and K. J. Ray Liu Department of Electrical and Computer Engineering, University of Maryland, College
More informationJoint Spectrum and Power Allocation for Inter-Cell Spectrum Sharing in Cognitive Radio Networks
Joint Spectrum and Power Allocation for Inter-Cell Spectrum Sharing in Cognitive Radio Networks Won-Yeol Lee and Ian F. Akyildiz Broadband Wireless Networking Laboratory School of Electrical and Computer
More informationComparative Analysis of ANN Techniques for Predicting Channel Frequencies in Cognitive Radio
Comparative Analysis of ANN Techniques for Predicting Channel Frequencies in Cognitive Radio Imran Khan Department of Telecommunication Engineering Dawood University of Engineering and Technology Karachi,
More informationCognitive Radio: Brain-Empowered Wireless Communcations
Cognitive Radio: Brain-Empowered Wireless Communcations Simon Haykin, Life Fellow, IEEE Matt Yu, EE360 Presentation, February 15 th 2012 Overview Motivation Background Introduction Radio-scene analysis
More informationBeamforming and Binary Power Based Resource Allocation Strategies for Cognitive Radio Networks
1 Beamforming and Binary Power Based Resource Allocation Strategies for Cognitive Radio Networks UWB Walter project Workshop, ETSI October 6th 2009, Sophia Antipolis A. Hayar EURÉCOM Institute, Mobile
More informationOptimization of Spectrum Allocation in Cognitive Radio and Dynamic Spectrum Access Networks
Wright State University CORE Scholar Browse all Theses and Dissertations Theses and Dissertations 2012 Optimization of Spectrum Allocation in Cognitive Radio and Dynamic Spectrum Access Networks Tao Zhang
More informationGame Theory. Department of Electronics EL-766 Spring Hasan Mahmood
Game Theory Department of Electronics EL-766 Spring 2011 Hasan Mahmood Email: hasannj@yahoo.com Course Information Part I: Introduction to Game Theory Introduction to game theory, games with perfect information,
More informationChapter 3 Learning in Two-Player Matrix Games
Chapter 3 Learning in Two-Player Matrix Games 3.1 Matrix Games In this chapter, we will examine the two-player stage game or the matrix game problem. Now, we have two players each learning how to play
More informationSpectrum Sharing for Device-to-Device Communications in Cellular Networks: A Game Theoretic Approach
2014 IEEE International Symposium on Dynamic Spectrum Access Networks DYSPAN 1 Spectrum Sharing for Device-to-Device Communications in Cellular Networks: A Game Theoretic Approach Yong Xiao, Kwang-Cheng
More informationGame Theory and MANETs: A Brief Tutorial
Game Theory and MANETs: A Brief Tutorial Luiz A. DaSilva and Allen B. MacKenzie Slides available at http://www.ece.vt.edu/mackenab/presentations/ GameTheoryTutorial.pdf 1 Agenda Fundamentals of Game Theory
More informationModeling the Dynamics of Coalition Formation Games for Cooperative Spectrum Sharing in an Interference Channel
Modeling the Dynamics of Coalition Formation Games for Cooperative Spectrum Sharing in an Interference Channel Zaheer Khan, Savo Glisic, Senior Member, IEEE, Luiz A. DaSilva, Senior Member, IEEE, and Janne
More informationFull-Duplex Machine-to-Machine Communication for Wireless-Powered Internet-of-Things
1 Full-Duplex Machine-to-Machine Communication for Wireless-Powered Internet-of-Things Yong Xiao, Zixiang Xiong, Dusit Niyato, Zhu Han and Luiz A. DaSilva Department of Electrical and Computer Engineering,
More informationDecentralized Cognitive MAC for Opportunistic Spectrum Access in Ad-Hoc Networks: A POMDP Framework
Decentralized Cognitive MAC for Opportunistic Spectrum Access in Ad-Hoc Networks: A POMDP Framework Qing Zhao, Lang Tong, Anathram Swami, and Yunxia Chen EE360 Presentation: Kun Yi Stanford University
More informationRouting in Max-Min Fair Networks: A Game Theoretic Approach
Routing in Max-Min Fair Networks: A Game Theoretic Approach Dejun Yang, Guoliang Xue, Xi Fang, Satyajayant Misra and Jin Zhang Arizona State University New Mexico State University Outline/Progress of the
More informationAdvanced Microeconomics: Game Theory
Advanced Microeconomics: Game Theory P. v. Mouche Wageningen University 2018 Outline 1 Motivation 2 Games in strategic form 3 Games in extensive form What is game theory? Traditional game theory deals
More informationSelfish Attacks and Detection in Cognitive Radio Ad-Hoc Networks using Markov Chain and Game Theory
Selfish Attacks and Detection in Cognitive Radio Ad-Hoc Networks using Markov Chain and Game Theory Suchita S. Potdar 1, Dr. Mallikarjun M. Math 1 Department of Compute Science & Engineering, KLS, Gogte
More informationChannel Sensing Order in Multi-user Cognitive Radio Networks
2012 IEEE International Symposium on Dynamic Spectrum Access Networks Channel Sensing Order in Multi-user Cognitive Radio Networks Jie Zhao and Xin Wang Department of Electrical and Computer Engineering
More informationEmerging Technologies for High-Speed Mobile Communication
Dr. Gerd Ascheid Integrated Signal Processing Systems (ISS) RWTH Aachen University D-52056 Aachen GERMANY gerd.ascheid@iss.rwth-aachen.de ABSTRACT Throughput requirements in mobile communication are increasing
More informationDynamic Spectrum Sharing
COMP9336/4336 Mobile Data Networking www.cse.unsw.edu.au/~cs9336 or ~cs4336 Dynamic Spectrum Sharing 1 Lecture overview This lecture focuses on concepts and algorithms for dynamically sharing the spectrum
More information/13/$ IEEE
A Game-Theoretical Anti-Jamming Scheme for Cognitive Radio Networks Changlong Chen and Min Song, University of Toledo ChunSheng Xin, Old Dominion University Jonathan Backens, Old Dominion University Abstract
More informationBeamforming on mobile devices: A first study
Beamforming on mobile devices: A first study Hang Yu, Lin Zhong, Ashutosh Sabharwal, David Kao http://www.recg.org Two invariants for wireless Spectrum is scarce Hardware is cheap and getting cheaper 2
More informationResource Allocation Challenges in Future Wireless Networks
Resource Allocation Challenges in Future Wireless Networks Mohamad Assaad Dept of Telecommunications, Supelec - France Mar. 2014 Outline 1 General Introduction 2 Fully Decentralized Allocation 3 Future
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationAdaptation in a Channel Access Game with Private Monitoring
Adaptation in a Channel Access Game with Private Monitoring Zaheer Khan, Janne Lehtomäki, Luiz A. DaSilva, Matti Latva-aho and Markku Juntti Centre for Wireless Communications CWC University of Oulu, Oulu,
More informationSUPPOSE that we are planning to send a convoy through
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 40, NO. 3, JUNE 2010 623 The Environment Value of an Opponent Model Brett J. Borghetti Abstract We develop an upper bound for
More informationMS&E 246: Lecture 15 Perfect Bayesian equilibrium. Ramesh Johari
MS&E 246: ecture 15 Perfect Bayesian equilibrium amesh Johari Dynamic games In this lecture, we begin a study of dynamic games of incomplete information. We will develop an analog of Bayesian equilibrium
More information2. LITERATURE REVIEW
2. LITERATURE REVIEW In this section, a brief review of literature on Performance of Antenna Diversity Techniques, Alamouti Coding Scheme, WiMAX Broadband Wireless Access Technology, Mobile WiMAX Technology,
More informationCMU-Q Lecture 20:
CMU-Q 15-381 Lecture 20: Game Theory I Teacher: Gianni A. Di Caro ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent
More informationAnalysis of Distributed Dynamic Spectrum Access Scheme in Cognitive Radios
Analysis of Distributed Dynamic Spectrum Access Scheme in Cognitive Radios Muthumeenakshi.K and Radha.S Abstract The problem of distributed Dynamic Spectrum Access (DSA) using Continuous Time Markov Model
More informationEfficiency and detectability of random reactive jamming in wireless networks
Efficiency and detectability of random reactive jamming in wireless networks Ni An, Steven Weber Modeling & Analysis of Networks Laboratory Drexel University Department of Electrical and Computer Engineering
More informationHedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents Walid Saad, Zhu Han, Tamer Basar, Me rouane Debbah, and Are Hjørungnes. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10,
More informationfinal examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:
The final examination on May 31 may test topics from any part of the course, but the emphasis will be on topic after the first three homework assignments, which were covered in the midterm. Topics from
More informationPopulation Adaptation for Genetic Algorithm-based Cognitive Radios
Population Adaptation for Genetic Algorithm-based Cognitive Radios Timothy R. Newman, Rakesh Rajbanshi, Alexander M. Wyglinski, Joseph B. Evans, and Gary J. Minden Information Technology and Telecommunications
More informationRESOURCE ALLOCATION IN HETEROGENEOUS NETWORKS USING GAME THEORY
RESOURCE ALLOCATION IN HETEROGENEOUS NETWORKS USING GAME THEORY YUAN PU School of Electrical and Electronic Engineering A Thesis submitted to the Nanyang Technological University in partial fulfillment
More informationInternet of Things Cognitive Radio Technologies
Internet of Things Cognitive Radio Technologies Torino, 29 aprile 2010 Roberto GARELLO, Politecnico di Torino, Italy Speaker: Roberto GARELLO, Ph.D. Associate Professor in Communication Engineering Dipartimento
More informationOPPORTUNISTIC SPECTRUM ACCESS IN MULTI-USER MULTI-CHANNEL COGNITIVE RADIO NETWORKS
9th European Signal Processing Conference (EUSIPCO 0) Barcelona, Spain, August 9 - September, 0 OPPORTUNISTIC SPECTRUM ACCESS IN MULTI-USER MULTI-CHANNEL COGNITIVE RADIO NETWORKS Sachin Shetty, Kodzo Agbedanu,
More informationMobile Broadband Multimedia Networks
Mobile Broadband Multimedia Networks Techniques, Models and Tools for 4G Edited by Luis M. Correia v c» -''Vi JP^^fte«jfc-iaSfllto ELSEVIER AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN
More informationChapter 13. Game Theory
Chapter 13 Game Theory A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes. You can t outrun a bear, scoffs the camper. His friend coolly replies, I don
More informationChapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks
Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional
More informationIntelligent Adaptation And Cognitive Networking
Intelligent Adaptation And Cognitive Networking Kevin Langley MAE 298 5/14/2009 Media Wired o Can react to local conditions near speed of light o Generally reactive systems rather than predictive work
More informationWireless Network Pricing Chapter 2: Wireless Communications Basics
Wireless Network Pricing Chapter 2: Wireless Communications Basics Jianwei Huang & Lin Gao Network Communications and Economics Lab (NCEL) Information Engineering Department The Chinese University of Hong
More informationStrategic Surveillance Against Primary User Emulation Attacks in Cognitive Radio Networks
Strategic Surveillance Against Primary User Emulation Attacks in Cognitive Radio Networks Duc-Tuyen Ta, Nhan Nguyen-Thanh, Patrick Maillé, Van-Tam Nguyen To cite this version: Duc-Tuyen Ta, Nhan Nguyen-Thanh,
More informationSense in Order: Channel Selection for Sensing in Cognitive Radio Networks
Sense in Order: Channel Selection for Sensing in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences Temple University, Philadelphia, PA 19122 Email: {ying.dai,
More informationChapter 6. Agile Transmission Techniques
Chapter 6 Agile Transmission Techniques 1 Outline Introduction Wireless Transmission for DSA Non Contiguous OFDM (NC-OFDM) NC-OFDM based CR: Challenges and Solutions Chapter 6 Summary 2 Outline Introduction
More informationChapter 2 Basics of Game Theory
Chapter 2 Basics of Game Theory Abstract This chapter provides a brief overview of basic concepts in game theory. These include game formulations and classifications, games in extensive vs. in normal form,
More informationCooperative Spectrum Sharing in Cognitive Radio Networks: A Game-Theoretic Approach
Cooperative Spectrum Sharing in Cognitive Radio Networks: A Game-Theoretic Approach Haobing Wang, Lin Gao, Xiaoying Gan, Xinbing Wang, Ekram Hossain 2. Department of Electronic Engineering, Shanghai Jiao
More informationJoint Transmitter-Receiver Adaptive Forward-Link DS-CDMA System
# - Joint Transmitter-Receiver Adaptive orward-link D-CDMA ystem Li Gao and Tan. Wong Department of Electrical & Computer Engineering University of lorida Gainesville lorida 3-3 Abstract A joint transmitter-receiver
More informationModelling of Real Network Traffic by Phase-Type distribution
Modelling of Real Network Traffic by Phase-Type distribution Andriy Panchenko Dresden University of Technology 27-28.Juli.2004 4. Würzburger Workshop "IP Netzmanagement, IP Netzplanung und Optimierung"
More informationIntroduction Economic Models Game Theory Models Games Summary. Syllabus
Syllabus Contact: kalk00@vse.cz home.cerge-ei.cz/kalovcova/teaching.html Office hours: Wed 7.30pm 8.00pm, NB339 or by email appointment Osborne, M. J. An Introduction to Game Theory Gibbons, R. A Primer
More informationInter-Cell Interference Coordination in Wireless Networks
Inter-Cell Interference Coordination in Wireless Networks PhD Defense, IRISA, Rennes, 2015 Mohamad Yassin University of Rennes 1, IRISA, France Saint Joseph University of Beirut, ESIB, Lebanon Institut
More informationGame Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)
Game Theory: The Basics The following is based on Games of Strategy, Dixit and Skeath, 1999. Topic 8 Game Theory Page 1 Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)
More informationBasics of Game Theory
Basics of Game Theory Giacomo Bacci and Luca Sanguinetti Department of Information Engineering isa University {giacomo.bacci,luca.sanguinetti}@iet.unipi.it April - May, 2010 G. Bacci and L. Sanguinetti
More informationCoalition Formation of Vehicular Users for Bandwidth Sharing in Vehicle-to-Roadside Communications
Coalition Formation of Vehicular Users for Bandwidth Sharing in Vehicle-to-Roadside Communications Dusit Niyato, Ping Wang, Walid Saad, and Are Hørungnes School of Computer Engineering, Nanyang Technological
More informationA Multi Armed Bandit Formulation of Cognitive Spectrum Access
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationTESTS AND TRIALS OF SOFTWARE-DEFINED AND COGNITIVE RADIO IN IRELAND
TESTS AND TRIALS OF SOFTWARE-DEFINED AND COGNITIVE RADIO IN IRELAND Keith E. Nolan, Centre for Telecommunications Value-Chain Research (CTVR) at University of Dublin, Trinity College (keithnolan@mee.tcd.ie),
More informationCross-Layer Game Theoretic Mechanism for Tactical Mobile Networks
Cross-Layer Game Theoretic Mechanism for Tactical Mobile Networks William J. Rogers Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of
More informationIntelligent Wireless Communications Enabled by Cognitive Radio and Machine Learning
1 Intelligent Wireless Communications Enabled by Cognitive Radio and Machine Learning Xiangwei Zhou, Mingxuan Sun, Geoffrey Ye Li, and Biing-Hwang (Fred) Juang Abstract arxiv:1710.11240v3 [cs.it] 1 Apr
More informationChapter- 5. Performance Evaluation of Conventional Handoff
Chapter- 5 Performance Evaluation of Conventional Handoff Chapter Overview This chapter immensely compares the different mobile phone technologies (GSM, UMTS and CDMA). It also presents the related results
More informationPRIMARY USER BEHAVIOR ESTIMATION AND CHANNEL ASSIGNMENT FOR DYNAMIC SPECTRUM ACCESS IN ENERGY-CONSTRAINED COGNITIVE RADIO SENSOR NETWORKS
PRIMARY USER BEHAVIOR ESTIMATION AND CHANNEL ASSIGNMENT FOR DYNAMIC SPECTRUM ACCESS IN ENERGY-CONSTRAINED COGNITIVE RADIO SENSOR NETWORKS By XIAOYUAN LI A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL
More informationCooperative Spectrum Sensing in Cognitive Radio
Cooperative Spectrum Sensing in Cognitive Radio Project of the Course : Software Defined Radio Isfahan University of Technology Spring 2010 Paria Rezaeinia Zahra Ashouri 1/54 OUTLINE Introduction Cognitive
More informationCS 1571 Introduction to AI Lecture 12. Adversarial search. CS 1571 Intro to AI. Announcements
CS 171 Introduction to AI Lecture 1 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 39 Sennott Square Announcements Homework assignment is out Programming and experiments Simulated annealing + Genetic
More informationCHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:
CHAPTER 4 4.1 LEARNING OUTCOMES By the end of this section, students will be able to: Understand what is meant by a Bayesian Nash Equilibrium (BNE) Calculate the BNE in a Cournot game with incomplete information
More informationCognitive Radios and Networks: Theory and Practice
Cognitive Radios and Networks: Theory and Practice May 13-16, 2013 Dr. Nicola Marchetti Assistant Professor Ussher Lecturer in Wireless Communications CTVR, Trinity College Dublin OUTLINE Techniques for
More informationDistributed Power Control in Cellular and Wireless Networks - A Comparative Study
Distributed Power Control in Cellular and Wireless Networks - A Comparative Study Vijay Raman, ECE, UIUC 1 Why power control? Interference in communication systems restrains system capacity In cellular
More informationOn Regulation of Spectrum Sharing: An Analysis Supporting a Distributed Pilot Channel
On Regulation of Spectrum Sharing: An Analysis Supporting a Distributed Pilot Channel Jens P. Elsner, Leonid Chaichenets, Hanns-Ulrich Dehner and Friedrich K. Jondral Universität Karlsruhe (TH), Germany,
More informationDesign of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan
Design of intelligent surveillance systems: a game theoretic case Nicola Basilico Department of Computer Science University of Milan Introduction Intelligent security for physical infrastructures Our objective:
More informationCS510 \ Lecture Ariel Stolerman
CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will
More informationNonstationary Resource Sharing with Imperfect Binary Feedback: An Optimal Design Framework for Cost Minimization
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 213 Nonstationary Resource Sharing with Imperfect Binary Feedback: An Optimal Design Framework for Cost Minimization
More informationRedline Communications Inc. Combining Fixed and Mobile WiMAX Networks Supporting the Advanced Communication Services of Tomorrow.
Redline Communications Inc. Combining Fixed and Mobile WiMAX Networks Supporting the Advanced Communication Services of Tomorrow WiMAX Whitepaper Author: Frank Rayal, Redline Communications Inc. Redline
More informationAn Artificially Intelligent Ludo Player
An Artificially Intelligent Ludo Player Andres Calderon Jaramillo and Deepak Aravindakshan Colorado State University {andrescj, deepakar}@cs.colostate.edu Abstract This project replicates results reported
More informationCooperative Spectrum Sensing and Decision Making Rules for Cognitive Radio
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference
More informationOn the efficiency of luminance-based palette reordering of color-quantized images
On the efficiency of luminance-based palette reordering of color-quantized images Armando J. Pinho 1 and António J. R. Neves 2 1 Dep. Electrónica e Telecomunicações / IEETA, University of Aveiro, 3810
More information4. Games and search. Lecture Artificial Intelligence (4ov / 8op)
4. Games and search 4.1 Search problems State space search find a (shortest) path from the initial state to the goal state. Constraint satisfaction find a value assignment to a set of variables so that
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 5, MAY
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 5, MAY 2016 3143 Dynamic Channel Access to Improve Energy Efficiency in Cognitive Radio Sensor Networks Ju Ren, Student Member, IEEE, Yaoxue Zhang,
More informationIntroduction to Game Theory
Introduction to Game Theory Review for the Final Exam Dana Nau University of Maryland Nau: Game Theory 1 Basic concepts: 1. Introduction normal form, utilities/payoffs, pure strategies, mixed strategies
More informationA Factor Graph Based Dynamic Spectrum Allocation Approach for Cognitive Network
IEEE WCNC - Network A Factor Graph Based Dynamic Spectrum Allocation Approach for Cognitive Network Shu Chen, Yan Huang Department of Computer Science & Engineering Universities of North Texas Denton,
More informationCS 2710 Foundations of AI. Lecture 9. Adversarial search. CS 2710 Foundations of AI. Game search
CS 2710 Foundations of AI Lecture 9 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square CS 2710 Foundations of AI Game search Game-playing programs developed by AI researchers since
More informationOFDM Pilot Optimization for the Communication and Localization Trade Off
SPCOMNAV Communications and Navigation OFDM Pilot Optimization for the Communication and Localization Trade Off A. Lee Swindlehurst Dept. of Electrical Engineering and Computer Science The Henry Samueli
More informationCognitive Ultra Wideband Radio
Cognitive Ultra Wideband Radio Soodeh Amiri M.S student of the communication engineering The Electrical & Computer Department of Isfahan University of Technology, IUT E-Mail : s.amiridoomari@ec.iut.ac.ir
More informationZukunft der Netze 9. Fachtagung des ITG-FA 5.2 Stuttgart, 7. Oktober 2010 Cognitive Radio How Much Self-Organization is Viable at Spectrum Level?
Zukunft der Netze 9. Fachtagung des ITG-FA 5.2 Stuttgart, 7. Oktober 2010 Cognitive Radio How Much Self-Organization is Viable at Spectrum Level? Klaus-D. Kohrt (ITG-FG 5.2.4) & Erik Oswald (Fraunhofer
More informationTUD Poker Challenge Reinforcement Learning with Imperfect Information
TUD Poker Challenge 2008 Reinforcement Learning with Imperfect Information Outline Reinforcement Learning Perfect Information Imperfect Information Lagging Anchor Algorithm Matrix Form Extensive Form Poker
More informationApril 1998 doc:. IEEE /158. IEEE P Wireless LANs. WINForum Sharing Rules Requirements And Goals
IEEE P802.11 Wireless LANs WINForum Sharing Rules Requirements And Goals Date: April 6, 1998 Source: WINForum 5 GHz Sharing Rules Development Committee (SRDC) Submitted by: Donald C. Johnson, Chairman
More informationSupervisory Control for Cost-Effective Redistribution of Robotic Swarms
Supervisory Control for Cost-Effective Redistribution of Robotic Swarms Ruikun Luo Department of Mechaincal Engineering College of Engineering Carnegie Mellon University Pittsburgh, Pennsylvania 11 Email:
More informationLecture 6: Basics of Game Theory
0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 6: Basics of Game Theory 25 November 2009 Fall 2009 Scribes: D. Teshler Lecture Overview 1. What is a Game? 2. Solution Concepts:
More informationFictitious Play applied on a simplified poker game
Fictitious Play applied on a simplified poker game Ioannis Papadopoulos June 26, 2015 Abstract This paper investigates the application of fictitious play on a simplified 2-player poker game with the goal
More informationTraffic Offloading in Unlicensed Spectrum for 5G Cellular Network: A Two-Layer Game Approach
entropy Article Traffic Offloading in Unlicensed Spectrum for 5G Cellular Network: A Two-Layer Game Approach Yan Li and Shaoyi Xu * ID School of Electronics and Information Engineering, Beijing Jiaotong
More informationA survey on broadcast protocols in multihop cognitive radio ad hoc network
A survey on broadcast protocols in multihop cognitive radio ad hoc network Sureshkumar A, Rajeswari M Abstract In the traditional ad hoc network, common channel is present to broadcast control channels
More information