View Article |
Optimization of channel assignment for mobile communication using tabu search
Loh, S.L1, Amat Ali, N.A2, Chong , S.H3, Fam, S.F4, Malinin, D5.
Mobile communication is a process of exchanging information by connecting two parties through a wireless network. Practically, mobile communication system involves a large coverage area. However, there has only limited channels to accommodate all the users. Hence, with the increasing number of mobile users recently, it leads to channel assignment problem (CAP). To optimize the channel assignment problem, an initiative is taken to reuse the existing channels in an efficientway with the minimum interference occur in the channels assignment. This helps to optimize the usage of the channel assignment in mobile communication. Tabu Search (TS) technique is implemented to solve the CAP by searching for the global optimum solution with the minimum interference cost value. The reallocated channels are being analyzed on the value of the penalty cost based on the penalty cost function. The optimization of the channels assignment is a process of reducing total channels required as the solution is improved. An analytical analysis is carried out to investigate the effect of demand calls and the number of available channels on the cost value.
Affiliation:
- Universiti Teknikal Malaysia Melaka, Malaysia
- Universiti Teknikal Malaysia Melaka, Malaysia
- Universiti Teknikal Malaysia Melaka, Malaysia
- Universiti Teknikal Malaysia Melaka, Malaysia
- University of Florence, Italy
Download this article (This article has been downloaded 31 time(s))
|
|
Indexation |
Indexed by |
MyJurnal (2021) |
H-Index
|
2 |
Immediacy Index
|
0.000 |
Rank |
0 |
Indexed by |
Scopus 2020 |
Impact Factor
|
CiteScore (0.7) |
Rank |
Q4 (Industrial and Manufacturing Engineering)) Q4 (Management of Technology and Innovation) Q4 (Automotive Engineering) Q4 (Control and Optimization) Q4 (Computer Networks and Communications) Q4 (Software) Q4 (Hardware and Architecture) |
Additional Information |
SJR (0.221) |
|
|
|