Cart (Loading....) | Create Account
Close category search window
 

Simulation-based optimization algorithms with applications to dynamic spectrum access

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hegde, N. ; Technicolor, Paris Res. Lab., Paris, France ; Proutiere, A.

Wireless systems operating on the unlicensed part of the radio spectrum (e.g. WiFi and their evolutions) must share a (potentially large) number of frequency bands or channels in a decentralized manner. This task is complicated by fading and interference, i.e., the throughput achieved on each link depends on the quality and the level of congestion of the selected channel. In this paper, we propose and analyze decentralized protocols that aim at achieving utility-optimal allocations of spectrum resources. We first address the problem of finding an optimal static channel allocation (a classical channel assignment problem). We illustrate how optimal algorithms based on simple reversible Monte Carlo Markov Chain (MCMC) methods can be designed. We also evaluate the mixing time of these algorithms. We then consider scenarios where scheduling and channel selection algorithms operate at the same time-scale and have to be designed jointly. We formulate the corresponding optimization problem and combine CSMA protocols and MCMC methods to devise optimal decentralized scheduling and channel selection algorithms. The proposed algorithms differ from existing algorithms as they mimic centralized steepest coordinate ascent methods, yielding faster convergence.

Published in:

Information Sciences and Systems (CISS), 2012 46th Annual Conference on

Date of Conference:

21-23 March 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.