Abstract
The channel assignment problem (CAP) in a cellular network requires finding a channel assignment to the call requests from cells such that three types of interference constraints are not only satisfied, but also the number of channels (channel span) is minimized. This paper presents a three-stage iterative algorithm, called the Quasi-solution state evolution algorithm for CAP (QCAP). QCAP evolutes quasi-solution states where a subset of call requests is assigned channels and no more request can be satisfied without violating the constraint. The first stage computes the lower bound on the channel span. After the second stage greedily generates an initial quasi-solution state, the third stage evolutes them for a feasible solution by iteratively generating best neighborhoods, with help of the dynamic state jump and the gradual span expansion for global convergence. The performance is evaluated through solving benchmark instances in literature, where QCAP always finds the optimum or near-optimum solution in very short time.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. H. MacDonald, “Advanced mobile phone service: the cellular concept,” Bell Syst. Tech. J., vol. 58, pp. 15–41, Jan. 1979.
W. K. Hale, “Frequency assignment: theory and applications,” Proc. IEEE, vol. 68, no. 12, pp. 1497–1514, Dec. 1980.
A. Gamst and W. Rave, “On frequency assignment in mobile automatic telephone systems,” in Proc. GLOBECOM, 1982, pp. 309–315.
A Gamst, “Some lower bounds for a class of frequency assignment problems,” IEEE Trans. Veh. Technol., vol. VT-35, no. 1, pp. 8–14, Feb. 1986.
K. N. Sivarajan, R. J. McEliece, and J. W. Letchum, “Channel assignment in cellular radio,” in Proc. 39th IEEE Veh. Technol. Conf., 1989, pp. 846–850.
D. Kunz, “Channel assignment for cellular radio using neural networks,” IEEE Trans. Veh. Technol., vol. 40, no. 1, pp. 188–193, Feb. 1991.
N. Funabiki and Y. Takefuji, “A neural network parallel algorithm for channel assignment problems in cellular radio networks,” IEEE Trans. Veh. Technol., vol. 41, no. 4, pp. 430–437, Nov. 1992.
W. Wang and C. K. Rushforth, “An adaptive local-search algorithm for the channel assignment problem (CAP),” IEEE Trans. Veh. Technol., vol. 45, no. 3, pp. 459–466, Aug. 1996.
C. W. Sung and W. S. Wong, “Sequential packing algorithm for channel assignment under cochannel and adjacent-channel interference constraint,” IEEE Trans. Veh. Technol., vol. 46, no. 3, pp. 676–686, Aug. 1997.
S. Hurley, D. H. Smith, and S. U. Thiel, “FASoft: a system for discrete channel frequency assignment,” Radio Science, vol. 32, no. 5, pp. 1921–1939, Sep.-Oct. 1997.
A. N. Rouskas, M. G. Kazantzakis, and M. E. Anagnostou, “Minimization of frequency assignment span in cellular networks,” IEEE Trans. Veh. Technol., vol. 48, no. 3, pp. 873–882, May 1999.
D. Beckmann and U. Killat, “A new strategy for the application of genetic algorithms to the channel-assignment problem,” IEEE Trans. Veh. Technol., vol. 48, no. 4, pp. 1261–1269, July 1999.
N. Funabiki, N. Okutani, and S. Nishikawa, “A three-stage heuristic combined neural-network algorithm for channel assignment in cellular mobile systems,” IEEE Trans. Veh. Technol., vol. 49, no. 2, pp. 397–403, March 2000.
H. Murakami, Y. Ogawa, and T. Ohgane, “Channel allocation in mobile communications using the genetic algorithm,” IEICE Tech. Report, RCS98-48, pp. 87–94, 1998.
H. Murakami, Y. Ogawa, and T. Ohgane, “Fixed channel allocation method in mobile radio communications using the genetic algorithm,” IEICE Trans., vol. J83-B, no. 6, pp. 769–779, June 2000.
S. Matsui and K. Tokoro, “A fast genetic algorithm using allocation order for fixed channel assignment in mobile communications,” IEICE Trans., vol. J83-B, no. 5, pp. 645–653, May 2000.
B. Selman and H. Kautz, “Domain-independent extensions to GSAT: solving large structured satisfiability problems,” in Proc. 13th Int’l Joint Conf. Artificial Intelligence, pp. 290–295, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Funabiki, N., Nakanishi, T., Yokohira, T., Tajima, S., Higashino, T. (2002). A Proposal of a Quasi-Solution State Evolution Algorithm for Channel Assignment Problems. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-45801-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44255-4
Online ISBN: 978-3-540-45801-2
eBook Packages: Springer Book Archive