Competitive Spectrum Management with Incomplete Information

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper studies an interference interaction (game) between selfish and independent wireless communication systems in the same frequency band. Each system (player) has incomplete information about the other player's channel conditions. A trivial Nash equilibrium point in this game is where players mutually full spread (FS) their transmit spectrum and interfere with each other. This point may lead to poor spectrum utilization from a global network point of view and even for each user individually. In this paper, we provide a closed form expression for a non pure-FS epsilon-Nash equilibrium point; i.e., an equilibrium point where players choose FDM for some channel realizations and FS for the others. We show that operating in this non pure-FS epsilon-Nash equilibrium point increases each user's throughput and therefore improves the spectrum utilization, and demonstrate that this performance gain can be substantial. Finally, important insights are provided into the behaviour of selfish and rational wireless users as a function of the channel parameters such as fading probabilities, the interference-to-signal ratio.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Competitive Spectrum Management with Incomplete Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Competitive Spectrum Management with Incomplete Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Competitive Spectrum Management with Incomplete Information will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-692843

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.