IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference 2008
DOI: 10.1109/glocom.2008.ecp.713
|View full text |Cite
|
Sign up to set email alerts
|

A Graph-Based Approach to Multi-Cell OFDMA Downlink Resource Allocation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
36
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 60 publications
(36 citation statements)
references
References 10 publications
0
36
0
Order By: Relevance
“…In this paper, we apply the graph coloring algorithm [11] [12] to categorize the picocells into orthogonal groups, in which each color represents a group. Then the partition problem turns into a graph coloring method of allocating colors to the vertex set V appropriately to ensure no two vertices with an edge have the same color.…”
Section: ) Partitioning Picocells Into Groupsmentioning
confidence: 99%
“…In this paper, we apply the graph coloring algorithm [11] [12] to categorize the picocells into orthogonal groups, in which each color represents a group. Then the partition problem turns into a graph coloring method of allocating colors to the vertex set V appropriately to ensure no two vertices with an edge have the same color.…”
Section: ) Partitioning Picocells Into Groupsmentioning
confidence: 99%
“…In [8], graph approach had also been used to study the similar problems, but it only focused on avoiding inter-cell interference and neglected the traffic demands. Some other works consider the traffic demands in other forms, but each node in their graph just represents a single mobile station (MS) rather than a cell [9]. That would lead to a large-scale graph and make the problem more complex.…”
Section: Introductionmentioning
confidence: 98%
“…In this context, several approaches and algorithms have been investigated with various study foci, with different levels of complexity, and on different timescales. Such algorithm studies include beamforming with interference graphs between mobile terminals [41], centrally controlled dynamic channel allocation [44], decentralized algorithms applied for wireless local area networks (WLANs) [24], distributed algorithms using approaches from game theory [26], as well as distributed twostep algorithms [23].…”
Section: Introductionmentioning
confidence: 99%