Distributed Online Frequency Assignment in Cellular Networks

DOI10.1006/JAGM.1999.1068MaRDI QIDQ4500850zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cellular networkdistributed online frequency assignment problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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

(25)

• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
• Deterministic broadcasting time with partial knowledge of the network.
• On-line algorithms for the channel assignment problem in cellular networks.
• Worst-case analysis of a dynamic channel assignment strategy
• Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks
• Distributive online channel assignment for hexagonal cellular networks with constraints
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
• Online multi-coloring with advice
• Optimal L(3, 2, 1)-labeling of triangular lattice
• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
• 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
• 2-local distributed algorithms for generalized coloring of hexagonal graphs
• Online Multi-Coloring with Advice
• Competitive algorithms and lower bounds for online randomized call control in cellular networks
• Online multi-coloring on the path revisited
• A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
• scientific article; zbMATH DE number 1163710 (Why is no real title available?)
• A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs
• Frequency Allocation Problems for Linear Cellular Networks
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• Static frequency assignment in cellular networks
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• Simpler multicoloring of triangle-free hexagonal graphs
• New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's conjecture
• Greedy online frequency allocation in 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)