An improved resource allocation scheme for plane cover multiple access using genetic algorithm

An improved resource allocation scheme is proposed in this paper which uses genetic algorithms (GAs) in conjunction with the recently developed plane cover multiple-access (PCMA) scheme in order to maximize the attainable capacity of packet-based wireless cellular networks. The studied problem has been proven to be in the class of nondeterministic polynomial (NP)-hard problem, therefore, the powerful search capability of the GA is a key factor in improving the performance of cellular resource allocation. Computer simulation results suggest that the proposed approach outperforms the "uniform" and the "greedy" algorithm-based "min " methods in terms of the number of serviced users.

[1]  Yi-Bing Lin.  Reducing location update cost in a PCS network , 1996, Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications.

[2]  Mahmoud Naghshineh,et al.  Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 1996 .

[3]  Vittorio Trecordi,et al.  Capture-division packet access for wireless personal communications , 1996, IEEE J. Sel. Areas Commun..

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  George C. Polyzos,et al.  Packet cellular system optimizations for non-uniform traffic , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[6]  R. Fujimoto,et al.  A case study in simulating PCS networks using time warp , 1995, Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE).

[7]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[8]  George C. Polyzos,et al.  Plane cover multiple access: a new approach to maximizing cellular system capacity , 2001, IEEE J. Sel. Areas Commun..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Jens Zander,et al.  Capacity allocation and channel assignment in cellular radio systems using reuse partitioning , 1992 .

[11]  Anthony S. Acampora.  Wireless ATM: a perspective on issues and prospects , 1996, IEEE Wirel. Commun..

[12]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[13]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[14]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[15]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[16]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  Yi-Bing Lin,et al.  The sub-rating channel assignment strategy for PCS hand-offs , 1996 .

[19]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[20]  Mischa Schwartz.  Network management and control issues in multimedia wireless networks , 1995, IEEE Wirel. Commun..

[21]  Mahmoud Naghshineh,et al.  An architecture and methodology for mobile-executed handoff in cellular ATM networks , 1994, IEEE J. Sel. Areas Commun..