• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.611-627
• /
• 2017

For enhancing the coverage of wireless networks and increasing the spectrum efficiency, small cell networks (SCNs) are considered to be one of the most prospective schemes. Most of the existing literature on resource allocation among non-cooperative small cell base stations (SBSs) has widely drawn close attention and there are only a small number of the cooperative ideas in SCNs. Based on the motivation, we further investigate the cooperative approach, which is formulated as a coalition formation game with power control algorithm (CFG-PC). First, we formulate the downlink sub-channel resource allocation problem in an SCN as a coalition formation game. Pareto order and utilitarian order are applied to form coalitions respectively. Second, to achieve more availability and efficiency power assignment, we expand and solve the power control using particle swarm optimization (PSO). Finally, with our proposed algorithm, each SBS can cooperatively work and eventually converge to a stable SBS partition. As far as the transmit rate of per SBS and the system rate are concerned respectively, simulation results indicate that our proposed CFG-PC has a significant advantage, relative to a classical coalition formation algorithm and the non-cooperative case.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1117-1124
• /
• 2013

As the recently soaring wireless traffic, small-cell techniques have been actively studied in order to support such a wireless demand for cellular wireless networks. This paper focuses on the inter-cell interference neutralization to resolve the main barrier for implementing small-cell cellular networks. Assuming that each message is delivered to the final destination by the help of base stations or relays, ergodic interference neutralization is proposed, which exploits the time-varying nature of wireless channels. The previous approach based on amplify-and-forward (AF) suffers from severe performance degradation in the low signal-to-noise (SNR) regime due to noise amplification. On the other hand, the proposed interference neutralization based on recently developed compute-and-forward (CF) fixes such a problem and improves the performance in the low SNR regime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2319-2337
• /
• 2019

In this paper, we study the distributed cooperative caching for Internet content providers in a small cell of heterogeneous network (HetNet). A general framework based on bankruptcy game model is put forth for finding the optimal caching policy. In this framework, the small cell and different content providers are modeled as bankrupt company and players, respectively. By introducing strategic decisions into the bankruptcy game, we propose a caching value assessment algorithm based on analytic hierarchy process in the framework of bankruptcy game theory to optimize the caching strategy and increase cache hit ratio. Our analysis shows that resource utilization can be improved through cooperative sharing while considering content providers' satisfaction. When the cache value is measured by multiple factors, not just popularity, the cache hit rate for user access is also increased. Simulation results show that our approach can improve the cache hit rate while ensuring the fairness of the distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.280-292
• /
• 2014

Recently, heterogeneous networks consisting of small-cells on top of traditional macro-cellular network has attracted much attention, because traditional macro-cellular network is not suitable to support more demanding mobile data traffic due to its limitation of spatial reuse. However, due to the transmit power difference between macro- and small-cells, most users are associated with macro-cells rather than small-cells. To solve this problem, enhanced inter-cell interference coordination (eICIC) has been introduced. Particularly, in eICIC, the small-cell coverage is forcibly expanded to associate more users with small-cells. Then, to avoid cross-tier interference from macro-cells, these users are allowed to receive the data during almost blank subframe (ABS) in which macro-cells almost remain silent. However, this approach is not sufficient to balance the load between macro- and small-cells because it only expands the small-cell coverage. In this paper, we propose a load balance scheme improving proportional fairness for heterogeneous networks employing eICIC. In particular, the proposed scheme combines the greedy-based user association and the ABS rate determination in a recursive manner to perform the load balance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.222-236
• /
• 2019

Wireless content caching in small cell networks has recently been considered as a promising way to alleviate the congestion of the backhaul in emerging heterogenous cellular network. However, how to select files which are cached in SBSs and how to make SBSs work together is an important issue for cooperative cache research for the propose of reducing file download time. In this paper, a Cooperative-Greedy strategy (CGS) among cache-enabled small base stations (SBSs) in small cell network is proposed, in order to minimize the download time of files. This problem is formulated as a Chinese restaurant game.Using this game model, we can configure file caching schemes based on file popularity and the spectrum resources allocated to several adjacent SBSs. Both the existence and uniquencess of a Nash equilibrium are proved. In the theoretical analysis section, SBSs cooperate with each other in order to cache popular files as many as possible near UEs. Simulation results show that the CGS scheme outperforms other schemes in terms of the file-download time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.886-900
• /
• 2015

Small cells are deployed in Heterogeneous Networks (HetNet) to improve overall performance. These access points can provide high-rate mobile services at hotspots to users. In a Small Cell Network (SCN), the good deployment of small cells can guarantee the performance of users on the basis of average and cell edge spectrum efficiency. In this paper, the performance of small cell deployment is analyzed by using system-level simulations. The positions of small cells can be adjusted according to the deployment radius and angle. Moreover, different Inter-Cell Interference Coordination (ICIC) techniques are also studied, which can be implemented either in time domain or in frequency domain. The network performances are evaluated under different ICIC techniques when the locations of Small evolved Nodes (SeNBs) vary. Simulation results show that the average throughput and cell edge throughput can be greatly improved when small cells are properly deployed with the certain deployment radius and angle. Meanwhile, how to optimally configure the parameters to achieve the potential of the deployment is discussed when applying different ICIC techniques.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.58-67
• /
• 2020

In this paper, we propose a data-driven-based beam selection scheme for massive multiple-input and multiple-output (MIMO) systems in ultra-dense networks (UDN), which is capable of addressing the problem of high computational cost of conventional coordinated beamforming approaches. We consider highly dense small-cell scenarios with more small cells than mobile stations, in the millimetre-wave band. The analog beam selection for hybrid beamforming is a key issue in realizing millimetre-wave UDN MIMO systems. To reduce the computation complexity for the analog beam selection, in this paper, two deep neural network models are used. The channel samples, channel gains, and radio frequency beamforming vectors between the access points and mobile stations are collected at the central/cloud unit that is connected to all the small-cell access points, and are used to train the networks. The proposed machine-learning-based scheme provides an approach for the effective implementation of massive MIMO system in UDN environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.9
• /
• pp.548-556
• /
• 2014

To cope with recently increasing demand for data traffics, heterogeneous networks have been actively studied, where small cells are deployed within a macro cell coverage with the same frequency band. To mitigate the interference from the macro cell to small cells, an enhanced Inter-cell Interference Coordination (eICIC) technique has been proposed, where ABS (Almost Blank Subframe) is used in time domain. However, there is a waste of resource since no data is transmitted in a macro-cell in ABS. In this paper, we propose a new interference management method by using a 3D sector beam based on Active Antenna System (AAS), where Genetic Algorithm (GA) is applied to reduce the antenna gain toward a small-cell. With the proposed scheme, the macro-cell and small cells can transmit data at the same time with the AAS antenna pattern generating reduced interference to small cells. The performance of the proposed scheme is evaluated by using an LTE-Advanced system level simulator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4799-4818
• /
• 2015

In this paper, we investigate the problem of achieving global optimization for distributed carrier aggregation (CA) in small cell networks, using a game theoretic solution. To cope with the local interference and the distinct cost of intra-band and inter-band CA, we propose a non-cooperation game which is proved as an exact potential game. Furthermore, we propose a spatial adaptive play learning algorithm with heterogeneous learning parameters to converge towards NE of the game. In this algorithm, heterogeneous learning parameters are introduced to accelerate the convergence speed. It is shown that with the proposed game-theoretic approach, global optimization is achieved with local information exchange. Simulation results validate the effectivity of the proposed game-theoretic CA approach.

• Journal of Internet Computing and Services
• /
• v.22 no.6
• /
• pp.9-15
• /
• 2021

In ultra-dense heterogeneous networks, the amount of interference from small-cell base stations(SBS) to macro-cell user equipments (MUEs) increases significantly as the number of SBSs increases and it causes the MUEs to decrease the signal-to-interference and noise ratio(SINR) and system capacity. In this paper, we propose a small-cell based cooperative multi-point(CoMP) communication scheme that can guarantee the performance of MUEs even when the number of SBSs increases. In the proposed scheme, MUEs first find SBSs that give signal strength equal to or greater than a given SINR threshold and then they are served by different numbers of the selected SBSs using CoMP to improve the performance of MUEs. Simulation results show that the proposed small-cell based CoMP scheme outperforms other interference management or CoMP schemes in terms of the SINR and system capacity of MUEs.