The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Data networks
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A guided tour of Chernoff bounds
Information Processing Letters
Efficient fault tolerant algorithms for resource allocation in distributed systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Precoloring extension. I: Interval graphs
Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
Impact of mobility on distributed computations
ACM SIGOPS Operating Systems Review
List colourings of planar graphs
Discrete Mathematics
Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
An optimization method for the channel assignment in mixed environments
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Distributed dynamic channel allocation for mobile computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
Distributed Soft Path Coloring
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
To avoid signal interference in mobile communication it is necessary that the frequencies used for communication within each cell are allocated so that no signal interference occurs with neighbouring cells. We model this channel allocation problem as a generalised list colouring problem and we show how to analytically measure and provide worst-case guarantees regarding request satisfiability. To the best of our knowledge, this has not been done before and gives a new perspective to the problem, as well as a clear direction for further investigation. We propose distributed approaches for solving the problem, which are able to adapt fast to temporal variations in channel demands in different cells, as well as to cope with crash failures, by limiting the failure-locality --- the size of the network that can be affected by a faulty station, in terms of the distance from that station. Our first approach is inspired by a relatively recent theorem relating graph colourings and orientations; it achieves the equivalent of the best known sequentially achievable upper bound for request satisfiability, implied by the theorem. It also employs a powerful synchronisation mechanism to achieve worst-case response time that depends only on Δ --- the degree of the signal interference graph --- and failure locality 4. Our second proposal is a first approach towards exploring what bound in request satisfiability is achievable without the use of extra synchronisation; by employing randomisation in frequency choices, in only one round of communication, a base station can expect to pick ƒ/(4Δ) frequencies, where ƒ is the size of the list at the node; the failure locality of this solution is only 1.