Greedy online frequency allocation in cellular networks

DOI10.1016/j.ipl.2006.11.015zbMath1184.68651OpenAlexW2007792143MaRDI QIDQ845962

Hong Zhu, Deshi Ye, Joseph Wun-Tat Chan, Yong Zhang, Francis Y. L. Chin

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.015

zbMATH Keywords

greedy algorithmcompetitive analysiscellular networkon-line algorithmsfrequency allocation

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Online algorithms; streaming algorithms (68W27)

Related Items (11)

A constant-competitive algorithm for online OVSF code assignment ⋮ Better bounds for incremental frequency allocation in bipartite graphs ⋮ Constant-competitive tree node assignment ⋮ A Constant-Competitive Algorithm for Online OVSF Code Assignment ⋮ Deterministic on-line call control in cellular networks ⋮ Absolute and asymptotic bounds for online frequency allocation in cellular networks ⋮ Three Results on Frequency Assignment in Linear Cellular Networks ⋮ Online call control in cellular networks revisited ⋮ A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs ⋮ Three results on frequency assignment in linear cellular networks ⋮ Online data caching in edge-cloud collaborative system with the data center

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Efficient on-line frequency allocation and call control in cellular networks
• Worst-case analysis of a dynamic channel assignment strategy
• Distributed Online Frequency Assignment in Cellular Networks
• Channel assignment and weighted coloring
• Models and solution techniques for frequency assignment problems

This page was built for publication: Greedy online frequency allocation in cellular networks