A randomized saturation degree heuristic for channel assignment in cellular radio networks

IEEE Transactions on Vehicular Technology

Volumn 50, Issue 2, 2001, Pages 364-374

  Battiti, Roberto ^a,b   Bertossi, Alan ^b   Cavallaro, Daniela ^b  

^a IEEE   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Cellular network; Channel assignment problem (CAP); Graph coloring; Heuristic; Local search

Indexed keywords

CHANNEL ASSIGNMENT TECHNIQUES; RANDOMIZED SATURATION DEGREE (RSD);

COCHANNEL INTERFERENCE; COMMUNICATION CHANNELS (INFORMATION THEORY); GRAPH THEORY; HEURISTIC METHODS; PACKET NETWORKS; PROBLEM SOLVING; RADIO INTERFERENCE;

CELLULAR RADIO SYSTEMS;

EID: 0035268622     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/25.923049     Document Type: Article

References (19)

1. Assigning codes in wireless networks: Bounds and scaling properties
2. New methods to color the vertices of a graph
3. A heuristic technique for assigning frequencies to mobile radio nets
4. Channel assignment for cellular radio using simulated annealing
5. A neural network algorithm for channel assignments in cellular radio networks
6. Homogeneous distribution of frequencies in a regular hexagonal cell system
7. Some lower bounds for a class of frequency assignment problems
8. Frequency assignment: Theory and applications
9. Worst-case performance of cellular channel assignment policies
10. A two-phase algorithm for frequency assignment in cellular mobile systems
11. Channel assignment for cellular radio using neural networks
12. Channel assignment in cellular radio networks
13. Graph teoretical consierations of channel offset systems in a cellular mobile system
14. Channel assignment in cellular radio
15. A new lower bound for the frequency assignment problem
16. Local search for channel assignment in cellular mobile networks