Mohammad Arif Hossain

Mohammad Arif Hossain, Abdullah Ridwan Hossain, Nirwan Ansari

Adept network management is key for supporting extremely heterogeneous applications with stringent quality of service (QoS) requirements; this is more so when envisioning the complex and ultra-dense 6G mobile heterogeneous network (HetNet). From both the environmental and economical perspectives, non-homogeneous QoS demands obstruct the minimization of the energy footprints and operational costs of the envisioned robust networks. As such, network intelligentization is expected to play an essential role in the realization of such sophisticated aims. The fusion of artificial intelligence (AI) and mobile networks will allow for the dynamic and automatic configuration of network functionalities. Machine learning (ML), one of the backbones of AI, will be instrumental in forecasting changes in network loads and resource utilization, estimating channel conditions, optimizing network slicing, and enhancing security and encryption. However, it is well known that ML tasks themselves incur massive computational burdens and energy costs. To overcome such obstacles, we propose a novel layer-based HetNet architecture which optimally distributes tasks associated with different ML approaches across network layers and entities; such a HetNet boasts multiple access schemes as well as device-to-device (D2D) communications to enhance energy efficiency via collaborative learning and communications.

Mostafa Zaman Chowdhury, Mohammad Arif Hossain, Shakil Ahmed et al.

In the modern era, cellular communication consumers are exponentially increasing as they find the system more user-friendly. Due to enormous users and their numerous demands, it has become a mandate to make the best use of the limited radio resources that assures the highest standard of Quality of Service (QoS). To reach the guaranteed level of QoS for the maximum number of users, maximum utilization of bandwidth is not only the key issue to be considered, rather some other factors like interference, call blocking probability etc. are also needed to keep under deliberation. The lower performances of these factors may retrograde the overall cellular networks performances. Keeping these difficulties under consideration, we propose an effective dynamic channel borrowing model that safeguards better QoS, other factors as well. The proposed scheme reduces the excessive overall call blocking probability and does interference mitigation without sacrificing bandwidth utilization. The proposed scheme is modeled in such a way that the cells are bifurcated after the channel borrowing process if the borrowed channels have the same type of frequency band (i.e. reused frequency). We also propose that the unoccupied interfering channels of adjacent cells can also be inactivated, instead of cell bifurcation for interference mitigation. The simulation endings show satisfactory performances in terms of overall call blocking probability and bandwidth utilization that are compared to the conventional scheme without channel borrowing. Furthermore, signal to interference plus noise ratio (SINR) level, capacity, and outage probability are compared to the conventional scheme without interference mitigation after channel borrowing that may attract the considerable concentration to the operators.

A. R. M. Jalal Uddin Jamali, Mohammad Arif Hossain, G. M. Moniruzzaman et al.

Recently hybrid evolutionary computation (EC) techniques are successfully implemented for solving large sets of linear equations. All the recently developed hybrid evolutionary algorithms, for solving linear equations, contain both the recombination and the mutation operations. In this paper, two modified hybrid evolutionary algorithms contained time-variant adaptive evolutionary technique are proposed for solving linear equations in which recombination operation is absent. The effectiveness of the recombination operator has been studied for the time-variant adaptive hybrid algorithms for solving large set of linear equations. Several experiments have been carried out using both the proposed modified hybrid evolutionary algorithms (in which the recombination operation is absent) and corresponding existing hybrid algorithms (in which the recombination operation is present) to solve large set of linear equations. It is found that the number of generations required by the existing hybrid algorithms (i.e. the Gauss-Seidel-SR based time variant adaptive (GSBTVA) hybrid algorithm and the Jacobi-SR based time variant adaptive (JBTVA) hybrid algorithm) and modified hybrid algorithms (i.e. the modified Gauss-Seidel-SR based time variant adaptive (MGSBTVA) hybrid algorithm and the modified Jacobi-SR based time variant adaptive (MJBTVA) hybrid algorithm) are comparable. Also the proposed modified algorithms require less amount of computational time in comparison to the corresponding existing hybrid algorithms. As the proposed modified hybrid algorithms do not contain recombination operation, so they require less computational effort, and also they are more efficient, effective and easy to implement.