A factor graph based dynamic spectrum allocation approach for cognitive network

Cognitive radios share the whitespace in the absence of licensed users. For spectrum sharing, avoiding the interference among multiple secondary users is a fundamental problem (known as dynamic spectrum allocation problem). This paper proposes a factor graph based approach to solve the dynamic spect...

Full description

Saved in:
Bibliographic Details
Published in2011 IEEE Wireless Communications and Networking Conference pp. 850 - 855
Main Authors Shu Chen, Yan Huang, Namuduri, K
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2011
Subjects
Dynamic scheduling
Heuristic algorithms
Interference
Peer to peer computing
Receivers
Resource management
Transmitters
Online AccessGet full text

Cover

More Information
Summary:Cognitive radios share the whitespace in the absence of licensed users. For spectrum sharing, avoiding the interference among multiple secondary users is a fundamental problem (known as dynamic spectrum allocation problem). This paper proposes a factor graph based approach to solve the dynamic spectrum allocation problem in an efficient manner. With the proposed DWA-Tree (Distributed Wave Algorithm), this problem can be solved with 2n number of messages for tree structured graphs. This paper also proposes another novel algorithm called DWA-Cycle to solve the problem for general graphs with cycles. Simulation results show that both DWA-Tree and DWA-Cycle can improve the global link quality consistently better than naive local optimization approaches.
ISBN:1612842550
9781612842554
ISSN:1525-3511
1558-2612
DOI:10.1109/WCNC.2011.5779243