• 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 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1286-1302
• /
• 2012

In this paper, the resource allocation problem with proportional fairness rate in cognitive OFDM-based wireless network is studied. It aims to maximize the total system throughput subject to constraints that include total transmit power for secondary users, maximum tolerable interferences of primary users, bit error rate, and proportional fairness rate among secondary users. It is a nonlinear optimization problem, for which obtaining the optimal solution is known to be NP-hard. An efficient bio-inspired suboptimal algorithm called immune clonal optimization is proposed to solve the resource allocation problem in two steps. That is, subcarriers are firstly allocated to secondary users assuming equal power assignment and then the power allocation is performed with an improved immune clonal algorithm. Suitable immune operators such as matrix encoding and adaptive mutation are designed for resource allocation problem. Simulation results show that the proposed algorithm achieves near-optimal throughput and more satisfying proportional fairness rate among secondary users with lower computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.171-182
• /
• 2003

In this paper, we propose an efficient and simple fair queueing algorithm, called Minimum Possible Virtual Start Time Fair Queueing (MPSFQ), which has O(1) complexity for the virtual time computation while it has good delay and fairness properties. The key idea of MPSFQ is that it has an easy system virtual time recalibration method while it follows a rate-proportional property. MPSFQ algorithm recalibrates system virtual time to the minimum possible virtual start time of all backlogged sessions. We will show our algorithm has good delay and fairness properties by analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5098-5115
• /
• 2017

A number of automotive electronics-safety, driver assistance, and infotainment devices-have been deployed in recent vehicles. This raises new challenges regarding in-vehicular network arbitration. A performance analysis of non-destructive arbitration has revealed a fairness issue. The arbitration prioritizes without collisions, despite multiple simultaneous transmissions; however, the performances of the highest priority node and the lowest priority node are very different. In this paper, an ID-rotation arbitration method to solve the arbitration-fairness problem is proposed. The proposed algorithm was applied to several engine control units (ECUs), including a controller area network (CAN) controller. Experimental results showed that the algorithm improved the fairness as well as the total throughput within a specific performance constraint.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.98-106
• /
• 2005

We propose a new wireless fair queueing algorithm, WFQ-R (Wireless Fair Queueing with Retransmission), which is well matched with the LLR (Link Level Retransmission) algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. Thus, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission under the MAC layer. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively and maximizes system throughput. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.549-552
• /
• 2005

Multiple wireless devices in wired and wireless heterogeneous networks communicate with counterparts via a single access point (AP). In this case, the AP becomes a bottleneck of the network, therefore buffer overflows occur frequently and result in TCP performance degradation. In this paper, a new algorithm that prevents buffer overflows at AP and enhances TCP fairness is proposed. Depending on the buffer usage of AP, the new algorithm adaptively controls each TCP senders' transmission rate, prevents buffer overflows and thus guarantees improved TCP fairness. It is proved that the algorithm makes better of TCP throughput and fairness by preventing buffer overflows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.6
• /
• pp.1638-1658
• /
• 2024

As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite association-based resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.649-652
• /
• 2015

Previous marking policy for the AF service of TCP traffic in the Diffserv network have no sufficient consideration on the effect of RTT and target rate. In this paper, in order to improve fairness Index by the effect RTT difference of TCP traffic, we propose the modified TSW3CDM(Time Sliding Window Three Color Dynamic Marker) based on average transfer rate estimation and the flow state. The proposed algorithm is dynamic marking policy that do allocate band width in proportion to transmission rate. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed TSW3CDM algorithm improves fairness index by comparison with TSW3CM.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.89-98
• /
• 2004

AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.