• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.420-428
• /
• 2016

In this paper, we investigate the scheduling and power allocation for coordinated multi-point transmission in downlink long term evolution advanced (LTE-A) systems, where orthogonal frequency division multiple-access is used. The proposed scheme jointly optimizes user selection, power allocation, and modulation and coding scheme (MCS) selection to maximize the weighted sum throughput with fairness consideration. Considering practical constraints in LTE-A systems, the MCSs for the resource blocks assigned to the same user need to be the same. Since the optimization problem is a combinatorial and non-convex one with high complexity, a low-complexity algorithm is proposed by separating the user selection and power allocation into two subproblems. To further simplify the optimization problem for power allocation, the instantaneous signal-to-interference-plus-noise ratio (SINR) and the average SINR are adopted to allocate power in a single cell and multiple coordinated cells, respectively. Simulation results show that the proposed scheme can improve the average system throughput and the cell-edge user throughput significantly compared with the existing schemes with limited feedback.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.784-799
• /
• 2013

This paper presents an adaptive rate control scheme for streaming-based content sharing service. This scheme delivers multimedia contents from a user device to another device or seamlessly redirects streaming service across heterogeneous user devices. In the proposed scheme, a streaming server adjusts video quality level according to the network and client status. Our scheme is different from other rate control schemes, because the video quality at the server is decided not only based on the available bandwidth, but also based on the device characteristics and bandwidth requirement at the access network. We also propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows competing for the same narrow link with different Round Trip Times (RTTs). Through the simulation, we prove that our scheme improves the network stability and the quality of streaming service by appropriately adjusting the quality of the video stream. The simulation results also demonstrate the ability of the proposed scheme in ensuring RTT-fairness while remaining throughput efficient.

• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.36-41
• /
• 2016

Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.175-182
• /
• 2018

As Internet of things with a large number of nodes emerges, wireless-power communication networks (WPCN) based on a random access protocol needs to be investigated. In the random access-based WPCN, a terminal accessing later in given random access (RA) slots can harvest more energy before transmission and thus can transmit data with higher power and achieve higher throughput if the access is successful. On the basis of this property, the proposed random access control protocol gives the terminals priority and distinguishes the RA slots according to the priority level, so that a near terminal with access point allows to access preferentially other than a remote terminal. This operation decreases the throughput of near terminal and increases the throughput of remote terminal, and then, the doubly near-far problem in WPCN is resolved and the user fairness is improved. Results show that the proposed random access control improves both channel throughput and user fairness according to the priority level.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.346-357
• /
• 2010

Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5328-5346
• /
• 2016

An optimal power control algorithm based on convex optimization is proposed for base stations in long term evolution networks. An objective function was formulated to maximize the proportional fairness of the networks. The optimal value of the objective function was obtained using convex optimization and distributed methods based on the path loss model between the base station and users. Field tests on live networks were conducted to evaluate the performance of the proposed algorithm. The experimental results verified that, in a multi-cell multi-user scenario, the proposed algorithm increases system throughputs, proportional fairness, and energy efficiency by 9, 1.31 and 20.2 %, respectively, compared to the conventional fixed power allocation method.

• Journal of Satellite, Information and Communications
• /
• v.12 no.3
• /
• pp.8-14
• /
• 2017

In 4G mobile communication, data services of mobile communication began to be provided in earnest. As a result, services such as the internet and multimedia including the video have become the main contents in the recent wireless traffic. Accordingly, research on 5G mobile communication with higher transmission rate has been actively carried out. 5G mobile communication is expected to be based on 4G for compatibility with existing terminals. Therefore, the simulation of this paper is based on 4G and we propose a new user scheduling scheme based on the Max throughput scheduling algorithm to improve system performance. This paper derives the frequency efficiency and fairness to compare the existing user scheduling algorithm with the proposed user scheduling algorithm. The proposed scheme shows better frequency efficiency and fairness than Max throughput in all situations. This paper contributes to the research for improving the system performance of 5G mobile communication technology, and I hope that it will help some of the ongoing standardization work.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.524-532
• /
• 2002

With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.888-897
• /
• 2007

In this paper, we propose an uplink dynamic resource allocation algorithm to increase sector throughput and fairness among users in 802.16e OFDMA TDD system. In uplink, we address the difference between uplink and downlink channel state information in 802.16e OFDMA TDD system. The simulation results show that not only an increment of 10% of sector throughput but higher level of fairness is achieved by round-robin using the FLR and the rate / margin adaptive inner closed-loop power control algorithm. The FLR algorithm determines the number of sub-channels to be allocated to the user according to the user's position. Also, we get 31.8% more sector throughput compared with the round-robin using FLR by FASA algorithm using uplink channel state information. User selection, sub-channel allocation, power allocation algorithms and simulation methodology are mentioned in Part I.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2233-2252
• /
• 2018

For the problem of cross-layer joint resource allocation (JRA) in the Long-Term Evolution (LTE)-Advanced standard using carrier aggregation (CA) technology, it is difficult to obtain the optimal resource allocation scheme. This paper proposes a joint resource allocation algorithm based on the weights of user's average quality of experience (JRA-WQOE). In contrast to prevalent algorithms, the proposed method can satisfy the carrier aggregation abilities of different users and consider user fairness. An optimization model is established by considering the user quality of experience (QoE) with the aim of maximizing the total user rate. In this model, user QoE is quantified by the mean opinion score (MOS) model, where the average MOS value of users is defined as the weight factor of the optimization model. The JRA-WQOE algorithm consists of the iteration of two algorithms, a component carrier (CC) and resource block (RB) allocation algorithm called DABC-CCRBA and a subgradient power allocation algorithm called SPA. The former is used to dynamically allocate CC and RB for users with different carrier aggregation capacities, and the latter, which is based on the Lagrangian dual method, is used to optimize the power allocation process. Simulation results showed that the proposed JRA-WQOE algorithm has low computational complexity and fast convergence. Compared with existing algorithms, it affords obvious advantages such as improving the average throughput and fairness to users. With varying numbers of users and signal-to-noise ratios (SNRs), the proposed algorithm achieved higher average QoE values than prevalent algorithms.