Distributed Online Frequency Assignment in Cellular Networks
From MaRDI portal
Publication:4500850
DOI10.1006/JAGM.1999.1068zbMATH Open0957.68007OpenAlexW2055960596MaRDI QIDQ4500850FDOQ4500850
Authors: Jeannette Janssen, D. Krizanc, Lata Narayanan, Sunil Shende 
Publication date: 22 November 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1068
Recommendations
- Static frequency assignment in cellular networks
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- A distributed \(6/5\)-competitive algorithm for multicoloring triangle-free hexagonal graphs
- Frequency Allocation Problems for Linear Cellular Networks
- Efficient on-line frequency allocation and call control in cellular networks
Cited In (24)
- 2-local distributed algorithms for generalized coloring of hexagonal graphs
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Greedy online frequency allocation in cellular networks
- Online Multi-Coloring with Advice
- Competitive algorithms and lower bounds for online randomized call control in cellular networks
- Title not available (Why is that?)
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
- Online multi-coloring with advice
- On-line algorithms for the channel assignment problem in cellular networks.
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
- Simpler multicoloring of triangle-free hexagonal graphs
- \(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs
- Distributive online channel assignment for hexagonal cellular networks with constraints
- Worst-case analysis of a dynamic channel assignment strategy
- Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks
- Static frequency assignment in cellular networks
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
- A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
- Deterministic broadcasting time with partial knowledge of the network.
- Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
- Online multi-coloring on the path revisited
- Frequency Allocation Problems for Linear Cellular Networks
This page was built for publication: Distributed Online Frequency Assignment in Cellular Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500850)
