Results 1 to 10 of about 473,326 (299)

The dynamic frequency assignment problem [PDF]

open access: yesEuropean Journal of Operational Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dupont, Audrey   +5 more
openaire   +5 more sources

The F/DR-D-10 Algorithm: A Novel Heuristic Strategy to Solve the Minimum Span Frequency Assignment Problem Embedded in Mobile Applications

open access: yesMathematics, 2023
Wireless communication supports various real-world applications, such as aeronautical navigation, satellite and TV broadcasting, wireless LANs, and mobile communications.
Carlos-Iván Páez-Rueda   +4 more
doaj   +1 more source

Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem

open access: yesEURO Journal on Computational Optimization, 2022
We consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of a portfolio of different neighborhoods, specifically designed for this problem.We undertake at once the two versions ...
Sara Ceschia   +3 more
doaj   +1 more source

Towards Optimal Frequency Plans: A Survey of Frequency Assignment Strategies, Models, and Methods

open access: yesENP Engineering Science Journal, 2023
The frequency assignment problem in a telecommunication network refers to the task of assigning frequencies to transmitters to minimize or eliminate interference and to optimize at least one other parameter.
Aicha Mahmoudi   +4 more
doaj   +1 more source

Solving Frequency Assignment Problems via Tree-Decomposition [PDF]

open access: yesElectronic Notes in Discrete Mathematics, 2000
In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition.
Koster A.M.C.A.   +2 more
openaire   +3 more sources

Radio Number for Friendship Communication Networks

open access: yesMathematics, 2023
This paper investigates the radio labeling of friendship networks (F3,k,  F4,k,  F5,k, and  F6,k). In contrast, a mathematical model is proposed for determining the upper bound of radio numbers for (F3,k,  F4,k,  F5,k, and  F6,k).
Ahmad H. Alkasasbeh   +3 more
doaj   +1 more source

Edge Weight Power and Frequency Assignment Algorithm [PDF]

open access: yesInternational Journal of Electronics and Telecommunications, 2019
In cellular networks, cells are grouped more densely around highly populated areas to provide more capacity. Antennas are pointed in accordance with local terrain and clutter to reduce signal shadows and interference.
O.S. Pharatlhatlhe   +2 more
doaj   +1 more source

Relationship between radio k-chromatic number of graphs and square graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G.
Laxman Saha
doaj   +1 more source

Joint Power and Channel Allocation for Non-Orthogonal Multiple Access in 5G Networks and Beyond

open access: yesSensors, 2023
Spectral efficiency is a crucial metric in wireless communication systems, as it defines how much information can be transmitted over a given amount of spectrum resources.
Qusay Alghazali   +2 more
doaj   +1 more source

LBFA: A Load-Balanced and Fragmentation-Aware Resource Allocation Algorithm in Space-Division Multiplexing Elastic Optical Networks

open access: yesPhotonics, 2021
We consider a space-division multiplexing elastic optical network (SDM-EON) that supports super-channels (SChs). A Sch comprises a set of contiguous frequency slots on multiple cores in a multi-core fiber.
Shengyu Zhang   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy