Allocating Channels to a Temporary Base Station

This paper presents the allocation of cells of a mobile cellular network as a dynamic ordered orderk multiplicatively weighted Voronoi diagram. The farthest neighbor search is applied to the channel allocation scheme of a temporary base station. Whenever a temporary base station is deployed, its power, antenna height, group of channels and other features are to be configured. The nearest and the farthest point search are applied to the problem of finding the nearest and the farthest base station surrounding the temporary station, in order to identify the group of channels to be allocated. Proximity relations are acquired from the Voronoi diagram and used in solving the problem of allocating channels with a minimum cochannel interference.