Simulation-based optimization algorithms with applications to dynamic spectrum access

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

Volumn , Issue , 2012, Pages

  Hegde, Nidhi ^a   Proutiere, Alexandre ^b  

^a Paris Research Lab   (France)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL ASSIGNMENT PROBLEM; CHANNEL SELECTION; COORDINATE ASCENT; DECENTRALIZED PROTOCOLS; DYNAMIC SPECTRUM ACCESS; FASTER CONVERGENCE; MCMC METHOD; MIXING TIME; MONTE CARLO MARKOV CHAIN; OPTIMAL ALGORITHM; OPTIMIZATION PROBLEMS; OR CHANNELS; RADIO SPECTRA; SIMULATION-BASED OPTIMIZATIONS; STATIC CHANNELS; TIME-SCALES; WIRELESS SYSTEMS;

FREQUENCY BANDS; INFORMATION SCIENCE; OPTIMIZATION; SCHEDULING; WIRELESS NETWORKS;

ALGORITHMS;

EID: 84868599417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2012.6310766     Document Type: Conference Paper

References (17)

1. R. Boorstyn, A. Kershenbaum, B. Maglaris, and V. Sahin. Throughput analysis in multihop CSMA packet radio networks. Communications, IEEE Transactions on, 35(3):267-274, Mar. 1987.
2. V. Borkar. Stochastic Approximation: A Dynamical Systems Viewpoint. Hindustan Book Agency (Cambridge University Press), 2008.
3. P. Brémaud. Markov chains: Gibbs fields, Monte Carlo simulation, and queues, volume 3L. Springer, 1999.
4. R. Bubley and M. Dyer. Path coupling: A technique for proving rapid mixing of markov chains. In 38th Symposium on Foundations of Computer Science, 1997.
5. A. Frieze and E. Vigoda. A survey on the use of Markov chains to randomly sample colorings. Oxford University Press, 2007.
6. L. Jiang and J.Walrand. A distributed csma algorithm for throughput and utility maximization in wireless networks. In 46th Allerton Conference on Communication, Control, and Computing, 2008.
7. L. Jiang and J. Walrand. A distributed CSMA algorithm for throughput and utility maximization in wireless networks. Networking, IEEE/ACM Transactions on, 18(3):960-972, 2010.
8. V. Kanodia, A. Sabharwal, and E. Knightly. Moar: a multi-channel opportunistic auto-rate media access protocol for ad hoc networks. In IEEE BroadNets, 2004.
9. B. Kauffmann, F. Baccelli, A. Chaintreau, V. Mhatre, D. Papagiannaki, and C. Diot. Measurement-based self organization of interfering 802.11 wireless access networks. In Proceedings of IEEE INFOCOM, 2007.
10. H. J. Kushner and G. Yin. Stochastic Approximation: Algorithms and Applications. 2nd ed., Springer-Verlag, New York, 2003.
11. D. A. Levin, Y. Peres, and E. L. Wilmer. Markov chains and Mixing times. American Mathematical Society, 2009.
12. R. Maheshwari, H. Gupta, and S. Das. Multichannel MAC protocols for wireless networks. In IEEE SECON, 2006.
13. F. Martinelli, A. Sinclair, and D. Weitz. Fast mixing for independent sets, colorings and other models on trees. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '04, 2004.
14. J. Mo, H. So, and J. Walrand. Comparison of multi-channel mac protocols. IEEE Trans. on Mobile Computing, 7(1):50-65, 2008.
15. Y. Nesterov. Efficiency of coordinate descent methods on huge-scale optimization problems. Core discussion papers, Universit catholique de Louvain, Center for Operations Research and Econometrics (CORE), Jan. 2010.
16. J. Ni, B. Tan, and R. Srikant. Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. In Proc. IEEE Infocom, 2010.
17. A. Proutiere, Y. Yung, T. Lan, and M. Chiang. Resource allocation over network dynamics without time-scale separation. In Proc. IEEE Infocom, 2010.