Frequency allocation problem over an algebraic structure

Annayat Ali () and Rameez Raja ()
Additional contact information
Annayat Ali: National Institute of Technology Srinagar
Rameez Raja: National Institute of Technology Srinagar

Journal of Combinatorial Optimization, 2025, vol. 49, issue 5, No 18, 20 pages

Abstract: Abstract In wireless telecommunication networks, where a multitude of communication links exist but only a restricted number of frequencies are available, the challenge of strategically assigning these frequencies to transmitters to minimize interference is known as the frequency allocation problem. This problem is commonly represented and approached through the lens of graph L(2, 1)-coloring, a recognized methodology for resolving such allocation challenges. In this paper, we consider frequency allocation as a graph L(2, 1)-coloring problem over an algebraic structure, a ring R with unity 1 not equal to zero. In L(2, 1)-coloring model of a network adjacent transceivers situated in very close proximity are assigned frequencies with a minimum difference of two. Meanwhile, transceivers in close vicinity are assigned frequencies that differ by at least one. This coloring scheme ensures effective frequency allocation while managing interference in wireless communication networks.

Keywords: Network; Frequency allocation problem; $$L(2; 1)$$ L ( 2; 1 ) -coloring; $$\lambda $$ λ -chromatic number; 05C15; 94A14 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01321-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01321-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01321-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().