Help | Advanced Search
Computer Science > Networking and Internet Architecture
Title: frequency assignment problem with net filter discrimination constraints.
Abstract: Managing radio spectrum resources is a crucial issue. The frequency assignment problem (FAP) basically aims to allocate, in an efficient manner, limited number of frequencies to communication links. Geographically close links, however, cause interference, which complicates the assignment, imposing frequency separation constraints. The FAP is closely related to the graph-coloring problem and it is an NP-hard problem. In this paper, we propose to incorporate the randomization into greedy and fast heuristics. As far as being implemented, the proposed algorithms are very straight forward and are without system parameters that need tuned. The proposed algorithms significantly improve, quickly and effectively, the solutions obtained by greedy algorithms in terms of the number of assigned frequencies and the range. The enhanced versions of proposed algorithms perform close to the lower bounds while running for a reasonable duration. Another novelty of our study is its consideration of the net filter discrimination effects in the communication model. Performance analysis is done by synthetic and measured data, where the measurement data includes the effect of the real 3-dimensional (3D) geographical features in the Daejeon region in Korea. In both cases, we observe a significant improvement by employing randomized heuristics.
Submission history
Access paper:.
- Other Formats
References & Citations
- Google Scholar
- Semantic Scholar
DBLP - CS Bibliography
Bibtex formatted citation.
Bibliographic and Citation Tools
Code, data and media associated with this article, recommenders and search tools.
- Institution
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .
A Metaheuristic Approach for the Frequency Assignment Problem
Ieee account.
- Change Username/Password
- Update Address
Purchase Details
- Payment Options
- Order History
- View Purchased Documents
Profile Information
- Communications Preferences
- Profession and Education
- Technical Interests
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
Frequency assignment problem in networks with limited spectrum
- Original Paper
- Published: 10 December 2016
- Volume 25 , pages 699–723, ( 2017 )
Cite this article
- Zehui Shao 1 , 2 ,
- Aleksander Vesel ORCID: orcid.org/0000-0003-3705-0071 3 &
244 Accesses
3 Citations
Explore all metrics
The frequency assignment problem (FAP) asks for assigning frequencies (channels) in a wireless network from the available radio spectrum to the transceivers of the network. One of the graph theoretical models of FAP is the L (3, 2, 1)-labeling of a graph, which is an abstraction of assigning integer frequencies to radio transceivers such that (i) transceivers that are one unit of distance apart receive frequencies that differ by at least three, (ii) transceivers that are two units of distance apart receive frequencies that differ by at least two, and (iii) transceivers that are three units of distance apart receive frequencies that differ by at least one. The relaxation of the L (3, 2, 1)-labeling called the ( s , t , r )-relaxed k - L (3, 2, 1)-labeling is proposed in this paper. This concept is a generalization of the ( s , t )-relaxed k - L (2, 1)-labeling (Lin in J Comb Optim 2016 , doi: 10.1007/s10878-014-9746-9 ). Basic properties of ( s , t , r )-relaxed k - L (3, 2, 1)-labeling are discussed and optimal ( s , t , r )-relaxed k - L (3, 2, 1)-labelings for paths and some cycles as well as for the hexagonal lattice and the square lattice are determined.
This is a preview of subscription content, log in via an institution to check access.
Access this article
Price includes VAT (Russian Federation)
Instant access to the full article PDF.
Rent this article via DeepDyve
Institutional subscriptions
Similar content being viewed by others
Network Design under General Wireless Interference
Magnús M. Halldórsson, Guy Kortsarz, … Tigran Tonoyan
Hole: An Emerging Character in the Story of Radio k-Coloring Problem
Algorithms for Solving Frequency Assignment Problem in Wireless Networks
Calamoneri T, Petreschi R (2004) \(L(h, 1)\) -labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414–426
Article Google Scholar
Chang GJ, Kuo D (1996) The \(L(2, 1)\) -labeling problem on graphs. SIAM J Discret Math 9:309–316
Chia M, Kuo D, Liao H, Yang C, Yeh RK (2011) \(L(3, 2, 1)\) -labeling of graphs. Taiwan J Math 15:2439–2457
Clipperton J, Gehrtz J, Szaniszlo Z, Torkornoo D (2006) \(L(3, 2, 1)\) -labeling of simple graphs. Valparaiso University, Verum
Google Scholar
Dai B, Lin WW (2015) On \((s, t)\) -relaxed \(L(2, 1)\) -labelings of the triangular lattice. J Comb Optim 29:655–669. doi: 10.1007/s10878-013-9615-y
Dai B, Lin W (2013) On \((s, t)\) -relaxed \(L(2, 1)\) -labelings of the square lattice. Inf Process Lett 113:704–709
Duan Z-M, Lv P-l, Miao L-Y, Miao Z-K (2010) Optimal channel assignment for wireless networks modelled as hexagonal and square grids. In: Proceedings of 2nd IEEE international conference on network security, wireless communications and trusted computing (NSWCTC), pp 85–88
Dupont A, Linhares AC, Artigues C, Feillet D, Michelon P, Vasquez M (2009) The dynamic frequency assignment problem. Eur J Oper Res 195:75–88
Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5:586–595
Jia-zhuang L, Zhen-dong S (2004) The \(L(3, 2, 1)\) -labeling problem on graphs. Math Appl 17:596–602
Kim BM, Rho Y, Song BC (2015) \(L(h, k)\) -labelling for octagonal grid. Int J Comput Math 92:2243–2250
Klavžar S, Špacapan S (2006) The \({\varDelta }^2\) -conjecture for \(L(2, 1)\) -labelings is true for direct and strong products of graphs. IEEE Trans Circuits Syst II Exp Briefs 53:274–277
Kratochvíl J, Kratsch D, Liedloff M (2007) Exact algorithms for \(L(2,1)\) -labeling of Graphs, MFCS 2007. LNCS 4708:513–524
Lin W (2016) On \((s, t)\) -relaxed \(L(2, 1)\) -labeling of graphs. J Comb Optim 31:405–426. doi: 10.1007/s10878-014-9746-9
LINGO 13.0 (2016) Optimization Modeling Software for Linear, Nonlinear, and Integer Programming. http://www.lindo.com/index.php?option=com_content&view=article&id=2&Itemid=10
Shao Z, Vesel A (2013) Integer linear programming model and satisfiability test reduction for distance constrained labellings of graphs: the case of \(L(3, 2, 1)\) labelling for products of paths and cycles. IET Commun 7:715–720
Shao Z, Vesel A (2015) \(L(3,2,1)\) -labeling of triangular and toroidal grids. Cent Eur J Oper Res 23:659–673
Shao Z, Zhu E, Vesel A, Xu J, Zhang X (2016) The complexity of (1,0)-relaxed \(L(2,1)\) -labeling of graphs, submitted
van den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263–283
Žerovnik J (1998) On the convergence of a randomized algorithm frequency assignment problem. Cent Eur J Oper Res Econ 6:135–151
Download references
Author information
Authors and affiliations.
School of Information Science and Engineering, Chengdu University, Chengdu, 610106, China
Research Institute of Big Data, Chengdu University, Chengdu, 610106, China
Faculty of Natural Sciences and Mathematics, University of Maribor, Koroška cesta 160, 2000, Maribor, Slovenia
Aleksander Vesel
School of Electronic Engineering and Computer Science, Peking University, Beijing, 100871, China
You can also search for this author in PubMed Google Scholar
Corresponding author
Correspondence to Aleksander Vesel .
Additional information
This project is supported by the National Natural Science Foundation of China under Grant 61309015, the Ministry of Science of Slovenia under the Grant 0101-P-297, the National Basic Research Program of China (973 Program) Grant Nos. 2013CB329601 and 2013CB329603.
Rights and permissions
Reprints and permissions
About this article
Shao, Z., Vesel, A. & Xu, J. Frequency assignment problem in networks with limited spectrum. Cent Eur J Oper Res 25 , 699–723 (2017). https://doi.org/10.1007/s10100-016-0462-7
Download citation
Published : 10 December 2016
Issue Date : September 2017
DOI : https://doi.org/10.1007/s10100-016-0462-7
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
- Frequency assignment
- ( s , t , r )-relaxed k - L (3, 2, 1 )-labeling
- Hexagonal lattice
- Square lattice
- Find a journal
- Publish with us
- Track your research
IMAGES
VIDEO
COMMENTS
This formulation, where adjacent vertices cannot share the same frequency is termed co-channel constrained and was shown by B.H. Metzger [] to be equivalent to the well-studied graph coloring problem.Typically, the objective is to find an assignment of frequencies (colors) to the transmitters (vertices) that minimizes the number of frequencies (colors) used.
The Frequency Assignment Problem Angela Erika Koller Submitted for the degree of Doctor of Philosophy 2004 Abstract This thesis examines a wide collection of frequency assignment problems. One of the largest topics in this thesis is that of L(2,1)-labellings of outerplanar graphs.
broadcasting, and most recently wireless LANs contributed to the literature on frequency assignment in recent years. This paper is not the first survey on the frequency assignment problem. Already Hale (1980) presented an overview of the frequency planning problems of that time, with a spe-cial focus on modeling the problems.
Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the ...
The term frequency assignment has been used to describe many types of problems which, quite often, have different modeling needs and objectives. These problems include: 1. Planning models for ...
The frequency constrained approach should be avoided if distance separation is employed to mitigate interference. A restricted class of graphs, called disk graphs, plays a central role in frequency-distance constrained problems. We introduce two generalizations of chromatic number and show that many frequency assignment problems are equivalent ...
Frequency assignment, as a subclass of general assignment problem, is a non-deterministic polynomial-time hard (NP-hard) optimization problem. Main difficulty in these types of problems is the time required to find an optimum solution, since the solution time increases exponentially as the size of the problem grows. To solve the problem in a limited computation time, meta-heuristic methods are ...
The frequency assignment problem (FAP) basically aims to allocate, in an efficient manner, limited number of frequencies to communication links. Geographically close links, however, cause interference, which complicates the assignment, imposing frequency separation constraints. The FAP is closely related to the graph-coloring problem and it is ...
We call the succession of frequency assignment problems encountered here the Dynamic Frequency Assignment Problem (DFAP). Though frequency assignment problems have been largely explored in the literature (see, e.g., Aardal et al., 2003, Aardal et al., 2007), the dynamic and the repair features met here make the DFAP a new problem.
The Frequency Assignment Problem is assignment of frequencies or channels to establish link between base station and mobile transmitter in cellular system. To avoid interference, minimum separation between assigned frequencies is required. This problem is NP-hard. Due to limited availability of spectrum and reuse of same frequencies at different geographical locations, an excellent assignment ...
The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters exploiting frequency reuse while keeping signal interference to acceptable levels ...
The term frequency assignment has been used to describe many types of problems which, quite often, have different modeling needs and objectives. These problems include: 1. Planning models for permanent spectrum allocation, licensing, and regulation which maximize utilization of all radio spectra [94]. 2.
The frequency assignment problem (FAP) asks for assigning frequencies (channels) in a wireless network from the available radio spectrum to the transceivers of the network. One of the graph theoretical models of FAP is the L(3, 2, 1)-labeling of a graph, which is an abstraction of assigning integer frequencies to radio transceivers such that (i ...
This challenge is commonly referred to as the Channel Assignment Problem (CAP) or Frequency Assignment Problem (FAP) [2,3]. The majority of CAP-related optimization problems seek to enhance network traffic, improve service quality, reduce the number of frequencies allocated to a given service, or minimize overall network interference [ 2 , 3 ...
The problem of assigning radio frequencies to a set of transmitters in a region is related to the theory of vertex colourings of graphs. Real frequency assignment problems often deal with a large number of transmitters. Exact methods of solution may be impracticable and heuristic methods must be used. Lower bounds for the frequency assignment ...
The frequency assignment problem (FAP) is the problem of assigning frequencies to transmission links such that no interference between signals occurs. This implies distance constraints between assigned frequencies of links. The objective is to minimize the number of used frequencies. We present an integer linear programming formulation that is ...
A frequency assignment problem (FAP) models the task of assigning radio spectrum to a set of transmitters. That is, if V is the set of all transmitters with v E V, f(v) denotes the continuum of frequencies assigned to v by the assignment rule f.
This study presents the game modeling of the multi-objective frequency assignment problem (FAP) in cellular networks considering two conflicting objectives: interference and separation costs, while respecting separation constraints, and thus improving the QoS for end users. Two types of cooperative games are suggested depending on the TRX and ...
The Frequency Assignment Problem (FAP) is considered in this paper. As the co-site constraint (CSC) may cause more interference in the real-world situation, we have paid more attention on CSC. The algorithm proposed here is a metaheuristic approach, which uses heuristic information combined with a modified PSO (Particle Swarm Optimization) algorithm to solve the FAP problem. Simulation results ...
The frequency assignment problem is of a fundamental importance when it comes to providing high-quality transmissions in satellite communication systems. The NP-complete frequency assignment problem in satellite communications involves the rearrangement of frequencies of one set of carriers while keeping the other set fixed in order to minimize ...
The frequency assignment problem (FAP) is a well-known combinatorial optimization problem that arises as one of the main issues in the design of GSM (Global system for mobile communications) networks (Mouly and Paulet 1992).In the FAP, a small set of frequencies has to be allocated to the elementary transceivers (TRXs) installed in the base stations of the cellular network.
In order to improve the frequent Doppler bias in the high-speed mobile scenario, improve the communication quality on HSR (High-Speed Railway). An algorithm can improve communication performance through RIS (intelligent metasurface) phase optimization. The optimization process is modeled as a reinforcement learning task, where the agent in the channel learns to select the optimal RIS phase by ...
The frequency assignment problem (FAP) asks for assigning frequencies (channels) in a wireless network from the available radio spectrum to the transceivers of the network. One of the graph theoretical models of FAP is the L(3, 2, 1)-labeling of a graph, which is an abstraction of assigning integer frequencies to radio transceivers such that (i) transceivers that are one unit of distance apart ...
This study presents the game modeling of the multi-objective frequency assignment problem (FAP) in cellular networks considering two conflicting objectives: interference and separation costs, while respecting separation constraints, and thus improving the QoS for end users. Two types of cooperative games are suggested depending on the TRX and frequency selection strategies each using two ...