DocumentCode
2383450
Title
Dynamic Markov-Chain Monte Carlo Channel Negotiation for Cognitive Radio
Author
Wang, Xiao Yu ; Wong, Alexander ; Ho, Pin-Han
Author_Institution
Univ. of Waterloo, Waterloo, ON, Canada
fYear
2010
fDate
15-19 March 2010
Firstpage
1
Lastpage
5
Abstract
In ad hoc cognitive radio (CR) networks, channel negotiation and access have been raised as challenging issues due to its highly dynamic nature and strong user diversity, particularly in situations where a dedicated common control channel is not reserved among the distributed CR nodes. In this paper, a novel stochastic channel negotiation algorithm is proposed for improving spectrum sharing efficiency in the CR networks. The paper first formulates the problem of channel selection for negotiation, aiming to maximize the probability of successful channel negotiation. The formulated optimization problem is then solved using a dynamic Markov-Chain Monte-Carlo (MCMC) scheme. Simulation is conducted to examine the performance of the proposed approach and demonstrate its merits. We have witnessed that the proposed approach can serve as an excellent complementary to the CR networks in which dedicated control channels are not defined.
Keywords
Markov processes; Monte Carlo methods; ad hoc networks; cognitive radio; optimisation; probability; wireless channels; ad hoc networks; cognitive radio; control channels; dynamic Markov-Chain Monte-Carlo scheme; dynamic channel negotiation; formulated optimization problem; successful channel negotiation probability; Chromium; Cognitive radio; Communication system control; Data communication; Frequency; Media Access Protocol; Monte Carlo methods; Peer to peer computing; Signal to noise ratio; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM IEEE Conference on Computer Communications Workshops , 2010
Conference_Location
San Diego, CA
Print_ISBN
978-1-4244-6739-6
Electronic_ISBN
978-1-4244-6739-6
Type
conf
DOI
10.1109/INFCOMW.2010.5466619
Filename
5466619
Link To Document