A QuasiStatic ClusterComputing Approach for Dynamic Channel Assignment in Cellular Mobile.pdf

A Quasi-Static Cluster-Computing Approach for Dynamic Channel Assignment in Cellular Mobile Communication Systems YU-KWONG KWOK Department of Electrical and Electronic Engineering The University of Hong Kong, Pokfulam Road, Hong Kong Email: ykwok@eee.hku.hk † traffic demand can be satisfied as far as possible under Abstract —Efficient management of the radio spectrum can be accomplished by making use of the channel reuse constraints. A channel can be reused in channel assignment techniques, which work by that the same channel can be assigned to multiple cells allocating different channels of the spectrum to the cells simultaneously due to the radio propagation path loss. of the network in a conflict-free manner (i.e., the co- However, there are three types of channel reuse channel interference is minimized). The problem of constraints: co-channel constraints, channels separation dynamically reallocating the channels in response to constraints, and co-site constraints [6], [12]. The channel change in user location patterns, which occurs assignment problem has been tackled by many frequently for a micro-cell network architecture, is even researchers in the last two decades [6]. In a broad sense, more difficult to tackle in a timely manner. Most channel assignment algorithms can be classified as static existing approaches use various sequential search based and dynamic. In a static approach, also commonly called heuristics which cannot produce high quality allocation fixed channel assignment (FCA) [12],