Bandwidth allocation in cellular networks with multiple interferences

DOI10.1016/J.DAM.2015.05.013MaRDI QIDQ494422zbMATH OpenOpenAlexFDO

Authors Gleb Polevoy, Dror Rawitz, Reuven Bar-Yehuda

Publication date 1 September 2015

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

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

zbMATH Keywords

interval selectionapproximation algorithmsbandwidth allocationinterval schedulinglocal ratiomultiple interferences

Mathematics Subject Classification ID

Approximation algorithms (68W25) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Recommendations

• On the complexity of bandwidth allocation in radio networks
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• Flexible cell selection in cellular networks
• Efficient on-line frequency allocation and call control in cellular networks
• scientific article; zbMATH DE number 1953161

Cites work

• scientific article; zbMATH DE number 6118222 (Why is no real title available?)
• scientific article; zbMATH DE number 3869066 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 2086936 (Why is no real title available?)
• A unified approach to approximating resource allocation and scheduling
• Algorithms for next generation networks
• Approximate Algorithms for the 0/1 Knapsack Problem
• Approximating the throughput of multiple machines in real-time scheduling
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Fundamentals of Wireless Communication
• On the approximability of an interval scheduling problem
• On the complexity of bandwidth allocation in radio networks
• Reducibility among combinatorial problems
• The approximation of maximum subgraph problems

Cited in

(8)

• Spectrum graph coloring and applications to Wi-Fi channel assignment
• Accurate optimization models for interference constrained bandwidth allocation in cellular networks
• Flexible cell selection in cellular networks
• On bandwidth allocation for data dissemination in cellular mobile networks
• On the complexity of bandwidth allocation in radio networks
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• Achieving arbitrary throughput-fairness trade-offs in the inter-cell interference coordination with fixed transmit power problem
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

This page was built for publication: Bandwidth allocation in cellular networks with multiple interferences

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