Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks

Wireless Networks

Volumn 8, Issue 1, 2002, Pages 49-60

  Garg, Naveen ^a   Papatriantafilou, Marina ^b   Tsigas, Philippas ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Cellular networks; Distributed frequency allocation; Dynamic frequency allocation; Failure locality; Request satisfiability

Indexed keywords

CELLULAR RADIO SYSTEMS; FAILURE ANALYSIS; SIGNAL INTERFERENCE; SYNCHRONIZATION;

CELLULAR NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 0036156898     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012719525108     Document Type: Article

References (22)

1. Colourings and orientations of graphs
2. Network decomposition and locality in distributed computation
3. Impact of mobility on distributed computations
4. Concurrency in heavily loaded neighbourhood-constrained systems
5. Precoloring extensions. I. Interval graphs
6. The drinking philosophers problem
7. Efficient fault tolerant algorithms for resource allocation in distributed systems
8. Performance issues and algorithms for dynamic channel assignment
9. Choosability in graphs
10. A self-stabilising algorithm for colouring planar graphs
11. A guided tour of Chernoff bounds
12. Graph colouring problems
13. An optimisation method for the channel assignment in mixed environments
14. Distributed dynamic channel allocation for mobile computing
15. Every planar graph is 5-choosable
16. List colourings of planar graphs