±Þ°ÝÈ÷ Áõ°¡ÇÏ°í ÀÖ´Â ¹«¼± Åë½Å¿¡ ´ëÇÑ ¼ö¿äÀÇ Áõ°¡´Â Á¦ÇÑµÈ ÁÖÆļö ÀÚ¿øÀ» È¿°úÀûÀ¸·Î ÀÌ¿ëÇÏ¿© ¼ö¿ä Áõ°¡¸¦ ¼ö¿ëÇϱâ À§ÇÑ ¹æ¾ÈÀÌ ÇÊ¿äÇÏ°Ô µÇ¾ú°í À̸¦ À§ÇØ ÁøÇàµÇ´Â ¿©·¯ °¡Áö ¿¬±¸ Áß¿¡ ÁÖÆļö ä³Î ÇÒ´ç (frequence channel assignment) ¹®Á¦°¡ ´õ¿í Áß¿äÇÏ°Ô °í·ÁµÇ¾î ÀÌ ¹®Á¦¿¡ ´ëÇÑ ¿¬±¸°¡ ¿©·¯ °¡Áö °¢µµ¿¡¼ È°¹ßÇÏ°Ô ÁøÇàµÇ°í ÀÖ´Ù[1, 2].
¼¿·ê·¯ ³×Æ®¿öÅ©¿¡¼´Â Áö¸®ÀûÀÎ ¿µ¿ªÀ» ³ª´©¾î¼ ¼ºñ½º¸¦ ÇÏ°í Àִµ¥ ÀÌ ¼ºñ½º ¿µ¿ªÀº Á¾Á¾ À°°¢ÇüÀÇ ¼¿·ê·¯ ¿µ¿ª(¼¿À̶ó ºÎ¸§)À¸·Î Ç¥½ÃµÇ¾îÁø´Ù. °¢ ¼¿Àº ±× ¼¿ ³»¿¡ À§Ä¡ÇÏ´Â À̵¿ Åë½Å Ŭ¶óÀ̾ðÆ®µéÀÇ Åë½ÅÀ» °ü¸®ÇÏ´Â ±âº» ½ºÅ×À̼Ç(base station)À» °¡¿îµ¥ °¡Áö°í ÀÖÀ¸¸ç ÀÌ ±âº» ½ºÅ×À̼ÇÀº ´Ù¸¥ ¼¿¿¡ ÀÖ´Â ½ºÅ×À̼ǰúÀÇ Åë½ÅÀ» ÅëÇÏ¿© ÀÚ½ÅÀÇ ¼ºñ½º ¿µ¿ªÀÇ Å¬¶óÀ̾ðÆ®°¡ ÀûÀº ÆÄ¿öÀÇ ´Ü¸»±â¸¦ °¡Áö°íµµ ¸Õ °÷ÀÇ ´Ù¸¥ »ç¿ëÀÚ¿ÍÀÇ Åëȸ¦ °¡´ÉÇÏ°Ô ÇØÁØ´Ù. °¢°¢ÀÇ Å¬¶óÀ̾ðÆ®ÀÇ È£Ãâ(call)ÀÌ ÀÖÀ» ¶§ °ü°èÇÏ´Â ±âº» ½ºÅ×À̼ÇÀÌ Æ¯Á¤ ÁÖÆļö ä³ÎÀ» ÇÒ´ç½ÃÅ°´Âµ¥, ÀÎÁ¢ÇÑ ¼¿ °£¿¡ °°Àº ä³ÎÀ» ÇÒ´ç½ÃŲ °æ¿ì ä³Î °£¼·(interference)À» ¾ß±â ½Ãų ¼ö ÀÖ´Ù. ÁÖÆļöÀÇ ´ë¿ªÆø(bandwidth)À» È¿°úÀûÀ¸·Î °ø¡¦(»ý·«)
|
[1] A. Sen, T. Roxborough and S. Medidi, `Upper and Lower bounds of a Class of Channel Assignment Problems in Cellular Networks`, Technical Report, Department of Computer Science and Engineering, Arizona State Univ., January 1998. [2] G. Cao and M. Singhal, `Efficient Distributed channel Allocation for Mobile Cellular Networks`, The Ohio State Univ., technical Report OSU-CISRC-5/98-TR14, p. 19, 1998. [3] D.B. West, `Introduction to graph theory`, Prentice-Hall, 1996. [4] T.R. Gensen and B. Toft, `Graph coloring problems`, Wiley-interscience, New York, 1995.
|