Heuristics for frequency assignment problem with realistic interference constraints

Bon Hong Koo, H. Birkan Yilmaz, Chan-Byoung Chae, Hwi Sung Park, Jae Hyun Ham, Sung Ho Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Due to the limited environments of radio frequency resources, the frequency assignment problem (FAP) is a crucial issue. We especially focus on the system that requires re-assignment of the frequencies often, so that the operation time is a limited resource as well as the radio resource. The FAP is closely related to the graph coloring problem, which is NP-hard problem. In this paper, we investigate a frequency assignment problem from a graph theory perspective for those limited system. We propose an effective algorithm based on the graph coloring theory and randomization incorporation into greedy heuristics. Main concern of the frequency assignments to clustered nodes is to reduce the number of used frequencies and the range. This paper has its another novelty in considering realistic interference constraints by considering net filter discrimination and measurement data from the field. Performance analysis is done by synthetic and measured data, and we observe a significant improvements by employing proposed algorithms in both cases.

Original languageEnglish
Title of host publication2016 IEEE International Conference on Communications, ICC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479966646
DOIs
Publication statusPublished - 2016 Jul 12
Event2016 IEEE International Conference on Communications, ICC 2016 - Kuala Lumpur, Malaysia
Duration: 2016 May 222016 May 27

Other

Other2016 IEEE International Conference on Communications, ICC 2016
CountryMalaysia
CityKuala Lumpur
Period16/5/2216/5/27

Fingerprint

Coloring
Graph theory
Computational complexity

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Koo, B. H., Yilmaz, H. B., Chae, C-B., Park, H. S., Ham, J. H., & Park, S. H. (2016). Heuristics for frequency assignment problem with realistic interference constraints. In 2016 IEEE International Conference on Communications, ICC 2016 [7510702] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2016.7510702
Koo, Bon Hong ; Yilmaz, H. Birkan ; Chae, Chan-Byoung ; Park, Hwi Sung ; Ham, Jae Hyun ; Park, Sung Ho. / Heuristics for frequency assignment problem with realistic interference constraints. 2016 IEEE International Conference on Communications, ICC 2016. Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{073b2632562c4fa4bce3d9c9bc985ca2,
title = "Heuristics for frequency assignment problem with realistic interference constraints",
abstract = "Due to the limited environments of radio frequency resources, the frequency assignment problem (FAP) is a crucial issue. We especially focus on the system that requires re-assignment of the frequencies often, so that the operation time is a limited resource as well as the radio resource. The FAP is closely related to the graph coloring problem, which is NP-hard problem. In this paper, we investigate a frequency assignment problem from a graph theory perspective for those limited system. We propose an effective algorithm based on the graph coloring theory and randomization incorporation into greedy heuristics. Main concern of the frequency assignments to clustered nodes is to reduce the number of used frequencies and the range. This paper has its another novelty in considering realistic interference constraints by considering net filter discrimination and measurement data from the field. Performance analysis is done by synthetic and measured data, and we observe a significant improvements by employing proposed algorithms in both cases.",
author = "Koo, {Bon Hong} and Yilmaz, {H. Birkan} and Chan-Byoung Chae and Park, {Hwi Sung} and Ham, {Jae Hyun} and Park, {Sung Ho}",
year = "2016",
month = "7",
day = "12",
doi = "10.1109/ICC.2016.7510702",
language = "English",
booktitle = "2016 IEEE International Conference on Communications, ICC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Koo, BH, Yilmaz, HB, Chae, C-B, Park, HS, Ham, JH & Park, SH 2016, Heuristics for frequency assignment problem with realistic interference constraints. in 2016 IEEE International Conference on Communications, ICC 2016., 7510702, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE International Conference on Communications, ICC 2016, Kuala Lumpur, Malaysia, 16/5/22. https://doi.org/10.1109/ICC.2016.7510702

Heuristics for frequency assignment problem with realistic interference constraints. / Koo, Bon Hong; Yilmaz, H. Birkan; Chae, Chan-Byoung; Park, Hwi Sung; Ham, Jae Hyun; Park, Sung Ho.

2016 IEEE International Conference on Communications, ICC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7510702.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Heuristics for frequency assignment problem with realistic interference constraints

AU - Koo, Bon Hong

AU - Yilmaz, H. Birkan

AU - Chae, Chan-Byoung

AU - Park, Hwi Sung

AU - Ham, Jae Hyun

AU - Park, Sung Ho

PY - 2016/7/12

Y1 - 2016/7/12

N2 - Due to the limited environments of radio frequency resources, the frequency assignment problem (FAP) is a crucial issue. We especially focus on the system that requires re-assignment of the frequencies often, so that the operation time is a limited resource as well as the radio resource. The FAP is closely related to the graph coloring problem, which is NP-hard problem. In this paper, we investigate a frequency assignment problem from a graph theory perspective for those limited system. We propose an effective algorithm based on the graph coloring theory and randomization incorporation into greedy heuristics. Main concern of the frequency assignments to clustered nodes is to reduce the number of used frequencies and the range. This paper has its another novelty in considering realistic interference constraints by considering net filter discrimination and measurement data from the field. Performance analysis is done by synthetic and measured data, and we observe a significant improvements by employing proposed algorithms in both cases.

AB - Due to the limited environments of radio frequency resources, the frequency assignment problem (FAP) is a crucial issue. We especially focus on the system that requires re-assignment of the frequencies often, so that the operation time is a limited resource as well as the radio resource. The FAP is closely related to the graph coloring problem, which is NP-hard problem. In this paper, we investigate a frequency assignment problem from a graph theory perspective for those limited system. We propose an effective algorithm based on the graph coloring theory and randomization incorporation into greedy heuristics. Main concern of the frequency assignments to clustered nodes is to reduce the number of used frequencies and the range. This paper has its another novelty in considering realistic interference constraints by considering net filter discrimination and measurement data from the field. Performance analysis is done by synthetic and measured data, and we observe a significant improvements by employing proposed algorithms in both cases.

UR - http://www.scopus.com/inward/record.url?scp=84981352343&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84981352343&partnerID=8YFLogxK

U2 - 10.1109/ICC.2016.7510702

DO - 10.1109/ICC.2016.7510702

M3 - Conference contribution

BT - 2016 IEEE International Conference on Communications, ICC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Koo BH, Yilmaz HB, Chae C-B, Park HS, Ham JH, Park SH. Heuristics for frequency assignment problem with realistic interference constraints. In 2016 IEEE International Conference on Communications, ICC 2016. Institute of Electrical and Electronics Engineers Inc. 2016. 7510702 https://doi.org/10.1109/ICC.2016.7510702