Optimisation Methods for Dynamic Frequency Planning in OFDMA Networks

Author

Lopez-Perez, David ; Juttner, A. ; Jie Zhang

Author_Institution

Centre for Wireless Network Design, Univ. of Bedforshire, Luton

fYear

2008

fDate

Sept. 28 2008-Oct. 2 2008

Firstpage

1

Lastpage

28

Abstract

The PowerPoint presentation work has introduced a novel dynamic frequency planning approach to the frequency assignment problem tailored to OFDMA networks. DFP may decrease the inter-cell interference and increase the capacity of the network by dynamically adapting the radio frequency parameters to the specific scenario. DFP uses novel algorithms to sense the radio channel, and adapted versions of simulated annealing, tabu search, or greedy algorithms to solve the optimization problem.

Keywords

OFDM modulation; frequency allocation; greedy algorithms; radio networks; radiofrequency interference; search problems; simulated annealing; telecommunication network planning; wireless channels; DFP; OFDMA networks; dynamic frequency planning; greedy algorithms; inter-cell interference; network capacity; optimization problem; radio channel; radio frequency parameters; simulated annealing; tabu search; Frequency diversity; Greedy algorithms; Interference; Land mobile radio cellular systems; Optimization methods; Simulated annealing; Technology planning; Throughput; WiMAX; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunications Network Strategy and Planning Symposium, 2008. Networks 2008. The 13th International

Conference_Location

Budapest

Print_ISBN

978-963-8111-68-5

Type

conf

DOI

10.1109/NETWKS.2008.4763671

Filename

4763671