scholarly journals Three Results on Frequency Assignment in Linear Cellular Networks

2009 ◽  
pp. 129-139 ◽  
Author(s):  
Marek Chrobak ◽  
Jiří Sgall
Keyword(s):  
Cellular Networks ◽  
Frequency Assignment

scholarly journals Fast-Lipschitz Power Control and User-Frequency Assignment in Full-Duplex Cellular Networks

2017 ◽  
Vol 16 (10) ◽  
pp. 6672-6687 ◽  
Author(s):  
Jose Mairton B. da Silva ◽  
Gabor Fodor ◽  
Carlo Fischione
Keyword(s):  
Power Control ◽  
Cellular Networks ◽  
Full Duplex ◽  
Frequency Assignment

scholarly journals CONFLICT-FREE COLORINGS OF SHALLOW DISCS

2008 ◽  
Vol 18 (06) ◽  
pp. 599-604 ◽  
Author(s):  
NOGA ALON ◽  
SHAKHAR SMORODINSKY
Keyword(s):  
Cellular Networks ◽  
Upper Bound ◽  
Frequency Assignment

We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O( log 3 k) colors so that for each point p in the union of all discs there is at least one disc in the collection containing p whose color differs from that of all other members of the collection that contain p. This is motivated by a problem on frequency assignment in cellular networks, and improves the best previously known upper bound of O( log n) when k is much smaller than n.

Static Frequency Assignment in Cellular Networks

Algorithmica ◽  
2001 ◽  
Vol 29 (3) ◽  
pp. 396-409 ◽  
Author(s):  
L. Narayanan ◽  
S. M. Shende
Keyword(s):  
Cellular Networks ◽  
Frequency Assignment

scholarly journals Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks

2019 ◽  
Vol 10 (3) ◽  
pp. 134-150
Author(s):  
Yasmine Lahsinat ◽  
Dalila Boughaci ◽  
Belaid Benhamou
Keyword(s):  
Local Search ◽  
Cellular Networks ◽  
Assignment Problem ◽  
Frequency Assignment ◽  
Neighborhood Search ◽  
Stochastic Local Search ◽  
Frequency Assignment Problem ◽  
Solution Quality ◽  
Interference Frequency ◽  
Minimum Interference

The minimum interference frequency assignment problem (MI-FAP) plays an important role in cellular networks. MI-FAP is the problem of finding an assignment of a small number of frequencies to a large number of transceivers (TRXs) that minimizes the interferences level. The MI-FAP is known to be NP-Hard, thus it cannot be solved in polynomial time. To remedy this, researchers usually use meta-heuristic techniques to find an approximate solution in reasonable time. Here, the authors propose three meta-heuristics for the MI-FAP: a variable neighborhood search (VNS) and a stochastic local search (SLS) that are combined to obtain a third and a new one, which is called VNS-SLS. The SLS method is incorporated into the VNS process as a subroutine in order to enhance the solution quality. All three proposed methods are evaluated on some well-known datasets to measure their performance. The empirical experiments show that the proposed method VNS-SLS succeeds in finding good results compared to both VNS and SLS confirming a good balance between intensification and diversification.

Distributed online frequency assignment in cellular networks

1998 ◽  
pp. 3-13 ◽  
Author(s):  
Jeannette Janssen ◽  
Danny Krizanc ◽  
Lata Narayanan ◽  
Sunil Shende
Keyword(s):  
Cellular Networks ◽  
Frequency Assignment

scholarly journals Three results on frequency assignment in linear cellular networks

2010 ◽  
Vol 411 (1) ◽  
pp. 131-137 ◽  
Author(s):  
Marek Chrobak ◽  
Jiří Sgall
Keyword(s):  
Cellular Networks ◽  
Frequency Assignment

Minimization of frequency assignment span in cellular networks

1999 ◽  
Vol 48 (3) ◽  
pp. 873-882 ◽  
Author(s):  
A.N. Rouskas ◽  
M.G. Kazantzakis ◽  
M.E. Anagnostou
Keyword(s):  
Cellular Networks ◽  
Frequency Assignment

A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks

2003 ◽  
Vol 14 (03) ◽  
pp. 439-463 ◽  
Author(s):  
Sasthi C. Ghosh ◽  
Bhabani P. Sinha ◽  
Nabanita Das
Keyword(s):  
Cellular Networks ◽  
Channel Assignment ◽  
Computation Time ◽  
Frequency Separation ◽  
Frequency Assignment ◽  
Optimal Assignment ◽  
New Approach ◽  
Bandwidth Requirement ◽  
Benchmark Instances ◽  
Assignment Scheme

Given a hexagonal cellular network with specific demand Vector and frequency separation constraints, we introduce the concept of a critical block of the network, that leads us to an efficient channel assignment scheme for the whole network. A novel idea of partitioning the critical block into several smaller sub-networks with homogeneous demands has been introduced which provides an elegant way of assigning frequencies to the critical block. This idea of partitioning is then extended for assigning frequencies to the rest of the network. The proposed algorithm provides an optimal assignment for all well-known benchmark instances including the most difficult two. It is shown to be superior to the existing frequency assignment algorithms, reported so far, in terms of both bandwidth requirement and computation time.

Sign in / Sign up

Export Citation Format

Share Document