Worst-Case Robust Distributed Power Allocation in Shared Unlicensed Spectrum

Details Worst-Case Robust Distributed Power Allocation in Shared Unlicensed Spectrum Worst-Case Robust Distributed Power Allocation in Shared Unlicensed Spectrum

2011-05-16

arxiv.org/abs/1105.2989v3

Computer Science

Information Theory

Scientific paper

This paper considers non-cooperative and fully-distributed power-allocation for selfish transmitter-receiver pairs in shared unlicensed spectrum when normalized-interference to each receiver is uncertain. We model each uncertain parameter by the sum of its nominal (estimated) value and a bounded additive error in a convex set, and show that the allocated power always converges to its equilibrium, called robust Nash equilibrium (RNE). In the case of a bounded and symmetric uncertainty region, we show that the power allocation problem for each user is simplified, and can be solved in a distributed manner. We derive the conditions for RNE's uniqueness and for convergence of the distributed algorithm; and show that the total throughput (social utility) is less than that at NE when RNE is unique. We also show that for multiple RNEs, the social utility may be higher at a RNE as compared to that at the corresponding NE, and demonstrate that this is caused by users' orthogonal utilization of bandwidth at RNE. Simulations confirm our analysis.

Affiliated with

Also associated with

No associations

Rating

Worst-Case Robust Distributed Power Allocation in Shared Unlicensed Spectrum 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 Worst-Case Robust Distributed Power Allocation in Shared Unlicensed Spectrum, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Worst-Case Robust Distributed Power Allocation in Shared Unlicensed Spectrum will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-76744