An efficient algorithm for PMFAP

Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for...

Full description

Saved in:

Bibliographic Details
Published in:	2016 8th International Conference on Communication Systems and Networks (COMSNETS) pp. 1 - 8
Main Authors:	Atta, Soumen, Mahapatra, Priya Ranjan Sinha
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01-01-2016
Subjects:	Algorithms Benchmarking Channel allocation Communication systems Conferences Data structures Frequency assignment Frequency Assignment Problem (FAP) Frequency measurement Heuristic Algorithm Heuristic algorithms Interference constraints Networks Perturbation Perturbation-Minimizing Frequency Assignment Problem (PMFAP) Radiofrequency interference
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Conference-1 ObjectType-Feature-3 content type line 23 SourceType-Conference Papers & Proceedings-2
ISSN:	2155-2509
DOI:	10.1109/COMSNETS.2016.7440013