Worst-case analysis of a dynamic channel assignment strategy

DOI10.1016/J.DAM.2003.02.002MaRDI QIDQ1827841zbMATH OpenOpenAlexFDO

Authors Lata Narayanan, Yihui Tang

Publication date 6 August 2004

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2003.02.002

zbMATH Keywords

NP-completenessCellular networksApproximation algorithmsWorst-case analysisChannel assignmentGreedy algorithmsGraph multicoloring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• On-line algorithms for the channel assignment problem in cellular networks.
• Dynamic channel allocation in mobile cellular networks
• Efficient on-line frequency allocation and call control in cellular networks
• Approximation and Online Algorithms
• Frequency Allocation Problems for Linear Cellular Networks

Cites work

• Adaptive multicolouring
• Channel assignment and weighted coloring
• Colouring proximity graphs in the plane
• Distributed Online Frequency Assignment in Cellular Networks
• Distributed dynamic channel allocation for mobile computing
• Graph labeling and radio channel assignment
• Online channel allocation in FDMA networks with reuse constraints
• Static frequency assignment in cellular networks

Cited in

(4)

• Greedy online frequency allocation in cellular networks
• Fixed channel assignment using new dynamic programming approach in cellular radio networks
• Dynamic channel allocation in mobile cellular networks
• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs

This page was built for publication: Worst-case analysis of a dynamic channel assignment strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827841)