• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.481-488
• /
• 2000

The demands for mobile communication service are growing rapidly. In heavily populated areas, cell split is unavoidable to increase the capacity of the cellular system. Cell splitting makes a cellular system to have mixed cell sizes. For cell planning, it is necessary to analyze the reverse link capacity of a CDMA cellular system with mixed cell sizes. In this paper, we propose a method to calculate the reverse link capacity of a CDMA cellular system with mixed cell sizes. When a macro cell is split into three micro cells, as an example, we calculate the reverse link capacities for the three micro cells and the neighboring macro cells. The results show that as the radius of a micro cell decreases, the reverse link capacity of the micro cell increases, while those of the neighboring macro cells decrease.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11B
• /
• pp.1534-1539
• /
• 2001

In this paper, effects of soft handoff region on the reverse link capacity of a DS-CDMA cellular system are investigated. The reverse link capacity of a CDMA cellular system is calculated at a given soft handoff region ratio (SHRR) and path loss model. The results show that the reverse link capacity increases by 1 ∼ 4 channels according to the soft handoff region ratio and the path loss model. However, in the case of the path loss model having a large attenuation exponent ($\mu$ = 5) and a small shadowing standard deviation ( $\sigma$ = 6 dB), the reverse link capacity is no more increased by increasing SHRR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• Journal of Digital Convergence
• /
• v.18 no.10
• /
• pp.225-232
• /
• 2020

The underlaying communication scheme in 5G cellular network is a very promising resource sharing scheme, and it is an effective scheme for improving service performance of 5G and reducing communication load between a cellular link and a device to device (D2D) link. This paper proposes the algorithm to minimize the resource interference that occurs when performing 5G-based multi-class service on gNB(gNodeB) and the cooperative priority-based resource allocation scheduling scheme (CPRAS) to maximize 5G communication service according to the analyzed control conditions of interference. The proposed CPRAS optimizes communication resources for each device, and it optimizes resource allocation according to the service request required for 5G communication and the current state of the network. In addition, the proposed scheme provides a function to guarantee giga-class service by minimizing resource interference between a cellular link and a D2D link in gNB. The simulation results show that the proposed scheme is better system performance than the Pure cellular and Force cellular schemes. In particular, the higher the priority and the higher the cooperative relationship between UE(User Equipment), the proposed scheme shows the more effective control of the resource interference.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.175-185
• /
• 2008

In this paper, we investigate the effect of cooperative and selection relaying schemes on multiuser diversity in downlink cellular systems with fixed relay stations (RSs). Each mobile station (MS) is either directly connected to a base station (BS) and/or connected to a relay station. We first derive closed-form solutions or upper-bound of the ergodic and outage capacities of four different downlink data relaying schemes: A direct scheme, a relay scheme, a selection scheme, and a cooperative scheme. The selection scheme selects the best access link between the BS and an MS. For all schemes, the capacity of the BS-RS link is assumed to be always larger than that of RS-MS link. Half-duplex channel use and repetition based relaying schemes are assumed for relaying operations. We also analyze the system capacity in a multiuser diversity environment in which a maximum signal-to-noise ratio (SNR) scheduler is used at a base station. The result shows that the selection scheme outperforms the other three schemes in terms of link ergodic capacity, link outage capacity, and system ergodic capacity. Furthermore, our results show that cooperative and selection diversity techniques limit the performance gain that could have been achieved by the multiuser diversity technique.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.1
• /
• pp.5-10
• /
• 2015

D2D (Device-to-Device) communication underlaying LTE-advanced networks is a promising technology to improve the system capacity and spectral efficiency. By sharing the same radio resources with cellular user equipments, D2D communications can significantly enhance the overall spectral efficiency. However, it may cause interference between D2D link and cellular link. Careful resource allocation and interference coordination between cellular and D2D communications are very important and need to be properly handled. This paper proposes a radio resource allocation scheme based on FFFR (Flexible Fractional Frequency Reuse) for D2D communication underlaying cellular networks. The base station selects randomly resource blocks assigned to cellular users, and reuses them for a D2D pair. Through simulations, we have confirmed that the proposed scheme improves the system throughput, reduces the computational complexity, and mitigates the interference of D2D link and cellular link.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.10
• /
• pp.1194-1199
• /
• 2010

In this paper, for a relay-based cellular network, a interference avoidance beamforming technique is proposed to enhance direct link capacity while minimizing loss in the capacity of concurrent relaying link. A direct link is transmitted by beamforming at the transmitter, and the relaying link with the least interference to the direct link is scheduled to transmit data by a collision avoidance scheduling algorithm. Simulation results show that the proposed IA beamforming provides a considerable direct link capacity enhancement while minimizing relaying link capacity loss by effectively mitigating inference between concurrent direct and relaying links only with limited feedback.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.49-55
• /
• 2008

To address the convergence issue of power control algorithms, a number of algorithms have been developed hat shape the dynamics of up-link power control for cellular network. Power algorithms based on fixed point iterations can be accelerated by the use of various methods, one of the simplest being the use of Newton iterations, however, this method has the disadvantage which not only needs derivatives of the cost function but also may be weak to noisy environment. we showed performance of the power control schemes to solve the fixed point problem under static or stationary channel. They proved goof performance to solve the fixed point problem due to their predictor based optimal control and quadratic convergence rate. Here, we apply the proposed power control schemes to the problem of the dynamic channel or to dynamic time varying link gains. The rigorous simulation results demonstrated the validity of our approach.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.3
• /
• pp.57-64
• /
• 2019

We consider the D2D sum utility maximization in the cellular system. D2D links reuse the uplink resource of cellular system. This reuse may cause severe interference to cellular users. To protect the cellular users, interference limit from the D2D links is required. In this setting, D2D sum utility maximization problem is investigated. Each D2D link has limited transmit power budget. Because optimum solution may require global information between links and computational complexity, we propose the distributed algorithm which only require the local information from each D2D link and simple broadcasting. Simulation results are provided to verify the performance of the proposed algorithm.