Distributed Dynamic Frequency Allocation in Wireless Cellular Networks Using Graph Multicoloring

نویسندگان

  • Narayan Patra
  • Bhramar Ray
  • Shakti Prasad Mohanty
چکیده

Frequency Allocation Problem in wireless cellular networks is a major area of research in telecommunication industries. Since users of mobile phones are increasing exponentially, the existing limited frequency spectrum is unable to provide services efficiently. To enhance the performance of the networks, some measures must be taken to reduce drop call probabilities due to non availability of free frequency. The existing frequency allocation scheme call “hybrid with borrow” drops the calls regularly if frequencies are not free in a given cell. In this paper, we have developed a new scheme called “HYBORROW”, which elegantly increases the utilization of new drop call probability by 20% over an existing scheme by borrowing the frequencies from neighbor cells.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed 6/5-competitive Algorithm for Multicoloring Triangle-free Hexagonal Graphs

An important optimization problem in the design of cellular networks is to assign sets of frequencies to transmitters to avoid unacceptable interference. A cellular network is generally modeled as a subgraph of the infinite triangular lattice. The distributed frequency assignment problem can be abstracted as a multicoloring problem on a weighted hexagonal graph, where the weight vector represen...

متن کامل

1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs

In the frequency allocation problem, we are given a cellular telephone network whose geographical coverage area is divided into cells, where phone calls are serviced by assigned frequencies, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of frequencies used....

متن کامل

1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs

In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by frequencies assigned to them, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of used freque...

متن کامل

A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs

In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by frequencies assigned to them, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of used freque...

متن کامل

Decentralized Routing and Power Allocation in FDMA Wireless Networks based on H∞ Fuzzy Control Strategy

Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015