A Quorum-based Distributed Channel Allocation Algorithm for Mobile Systems. available at http://maple.ece.utexa.edu/chakarat
Abstract:
Abstract- Since radio spectrum is a scarce resource, efficient allocation of frequency channels is critical for the performance of mobile systems. The update approach is a way to allocate radio channels among cells in distributed fashion. In update-based algorithms, each cell maintains its local knowledge about channels available for its use by exchanging messages among cells in its interference neighborhood. The existing update algorithms suffer from high message complexity or high storage overhead. In this paper, we present a distributed update-based algorithm that imposes lower message complexity, while requiring smaller storage overhead than existing algorithms.
Citations
| 1746 | Time, clocks, and the ordering of events in a distributed system – Lamport - 1978 |
| 178 | A √ N Algorithm for Mutual Exclusion in Decentralized Systems – Maekawa - 1985 |
| 116 | An Optimal Algorithm for Mutual Exclusion in Computer Networks – Ricart, Agrawala - 1981 |
| 32 | Distributed Dynamic Channel Allocation for Mobile Computing – Prakash, Shivarati, et al. - 1995 |
| 17 | Efficient faulttolerant algorithms for distributed resource allocation – Choy, Singh - 1995 |
| 10 | Distributed Dynamic Carrier Allocation in Mobile Cellular Networks: Search vs. Update – Dong, Lai - 1997 |
| 6 | Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations – Garg, Papatriantafilou, et al. - 1996 |
| 3 | Efficient Distributed Algorithms for Dynamic Channel Assignment – Choy, Singh - 1996 |

