• 베이커리
• /
• no.6 s.383
• /
• pp.94-95
• /
• 2000

• 베이커리
• /
• no.3 s.452
• /
• pp.128-131
• /
• 2006

• 베이커리
• /
• no.9 s.422
• /
• pp.126-129
• /
• 2003

• 베이커리
• /
• no.6 s.347
• /
• pp.161-161
• /
• 1997

• 베이커리
• /
• no.6 s.359
• /
• pp.154-154
• /
• 1998

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2410-2418
• /
• 2015

In this paper, we consider the femto users and their mutual interference as graph elements, nodes and weighted edges, respectively. The total bandwidth is divided into a number of resource blocks (RBs) and these are assigned to the femto user equipment (FUEs) using a graph coloring algorithm. In addition, resources blocks are assigned to the femto users to avoid inter-cell interference. The proposed scheme is compared with the traditional scheduling schemes in terms of throughput and fairness and performance improvement is achieved by exploiting the graph coloring scheme.