Browse > Article

Better Analysis of Lower Bounds of Frequency Assignment Problems in Wireless Networks with Cellular Topology  

Lee, Sang-Kyu (숙명여자대학교 컴퓨터과학과)
Lee, Ju-Young (덕성여자대학교 인터넷 정보공학)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.33, no.11, 2006 , pp. 830-835 More about this Journal
Abstract
Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.
Keywords
Frequency assignment; Frequency interference; Cellular topology; Wireless networks; Graph coloring;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Raman, 'Channl Allocation in 802.11-based Mesh Networks,' Proc. of IEEE INFOCOM '06, April 2006   DOI
2 H. Ju and I. Rubin, 'Mesh Topology Construction for Interconnected Wireless LANs,' Proc. of IEEE INFOCOM '06, April 2006
3 A. Sen, T. Roxborough and S. Medidi, 'Upper and Lower bounds of a Class of Channel Assignment Problems in Cellular Networks,' Proc. of IEEE INFOCOM '98, San Francisco, April 1998   DOI
4 M.Duque-Anton, D.Kunz and B.Ruber, 'Channel Assignment for Celluler Radio Using Simulated Annealing,' IEEE Transactions on Vehicular Technology, Vol. 42, No. 1, pp.14-21, Feb 1993   DOI
5 S. Jordan and E.J, Schwabe. 'Worst-case Performance of Cellular Channel Assignment Policies,' Wireless Networks, Vol. 2, No 4, pp.265-275, 1996   DOI
6 D.Kunz, 'A Graph Theoretic Approach for Channel Assignment In Cellular Networks,' Wireless Networks, Vol. 7, No. 6, pp. 567-574, Nov. 2001   DOI   ScienceOn
7 K.K. Leung and B.J. Kim, 'Frequency Assignment for IEEE 802.11 Networks,' Proc. of IEEE Veh. Tech. Conf. Oct. 2003   DOI
8 D. Tcha, Y. Chung and T. Choi, 'A New Lower Bound for the Frequency Assignment Problem,' IEEE/ACM Transactions on Networking, Vol. 5, No. 1, pp. 34-39, Feb 1997   DOI   ScienceOn
9 D.B. West, 'Introduction to graph theory,' Prentice-Hall, 1996
10 T.R. Gensen and B. Toft, 'Graph coloring problems,' Wiley-interscience, New York, 1995