Article ID: | iaor20095 |
Country: | Poland |
Volume: | 29 |
Issue: | 3 |
Start Page Number: | 685 |
End Page Number: | 700 |
Publication Date: | Jan 2000 |
Journal: | Control and Cybernetics |
Authors: | Vidal R.V.V., Borges Pedro Castro |
Keywords: | heuristics |
The problem of fixed channel assignment in cellular communication systems with non-uniform traffic distribution is addressed. The objective of the channel assignment is to minimise the average blocking probability. Methods for finding a good allocation can be based on first building a number of sets of co-channel cells or allocation patterns and then assigning them to channels. This usually implies that only a subset of the feasible region is attainable. The approach suggested in this paper uses the concept of packed pattern, since all patterns in an optimal solution will be of that kind. With a constructive method, the entire set of packed patterns is built and used in the optimisation process.