An ACO Algorithm for Sum-Rate Maximization Problem in Opportunistic Spectrum Allocation

A major problem of opportunistic spectrum allocation is how to maximize spectrum utilization given a bunch of available channels, i.e. sum-rate maximization problem, which is considered as a combinatorial optimization problem in our paper. ant colony optimization (ACO) is a well-known metaheuristic...

Full description

Saved in:
Bibliographic Details
Published in2008 4th International Conference on Wireless Communications, Networking and Mobile Computing pp. 1 - 4
Main Authors Wei Fei, Yang Zhen
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2008
Subjects
Ant colony optimization
Attenuation
Channel capacity
Chromium
Cognitive radio
Information processing
Interference constraints
Internet
Protection
Signal processing
Online AccessGet full text
ISBN9781424421077
1424421071
ISSN2161-9646
DOI10.1109/WiCom.2008.322

Cover

More Information
Summary:A major problem of opportunistic spectrum allocation is how to maximize spectrum utilization given a bunch of available channels, i.e. sum-rate maximization problem, which is considered as a combinatorial optimization problem in our paper. ant colony optimization (ACO) is a well-known metaheuristic in which a colony of ants cooperate in exploring good solutions to a combinatorial optimization problem. In this paper, we present an MMAS algorithm for maximizing spectrum utilization based on ACO. Experimental results show improvements over existing algorithms for the sum-rate maximization problem in opportunistic spectrum allocation.
ISBN:9781424421077
1424421071
ISSN:2161-9646
DOI:10.1109/WiCom.2008.322