• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1031-1037
• /
• 2003

A new scheduling scheme, which uses channel quality information of each flow in Bluetooth system of ad-hoc network for effective bandwidth assignment, has been proposed in this paper. By an effective bandwidth assignment, QoS (Quality of Service) could have been ensured in case of asymmetric data traffic, mixed data transmission, and congested data transmission in a specific channel. The scheduling algorithm determines channel weights using partial channel information of flows. Case studies conducted by NS-2 (Network Simulator 2) and Bluehoc simulator has been presented to show the effectiveness of the proposed scheduling scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.816-822
• /
• 2010

In this paper, we propose an algorithm to improve TCP performance over wireless links. TCP is known to have poor performance over wireless links because TCP has no mechanism to differentiate congestion loss from wireless loss, and treats all losses as congestive. We present a simple method to determine the cause of packet loss using the successive ECN. In addition, we present an algorithm to control the congestion window size based on the estimated queue state in order to guarantee the fairness and high link utilization.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.405-408
• /
• 2002

To support Internet traffic efficiently over ATM \networks, Guaranteed Frame Rate(GFR) has been proposed in tile ATM Forum to ensure minimum rate guarantees to VCs. In this paper, we proposed fuzzy logic based buffer management algorithm that provides MCR guarantee and fair sharing to GFR VCs. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load rate of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation result shows that proposed scheme significantly has improved fairness and TCP throughput compared with previous schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.36-44
• /
• 2010

When multi-user MIMO (Multiple-Input Multiple-Output) systems utilize a sum-rate maximization (SRM) scheduler, the throughput of the systems can be enhanced. However, fairness problems may arise because users located near cell edge or experiencing poor channel conditions are less likely to be selected by the SRM scheduler. In this paper, a weighted sum-rate maximization (WSRM) scheduler is used to enhance the fairness performance of the MIMO systems. Closed-form expressions for the optimal transmit power allocation of WSRM and corresponding weighted sum-rate (WSR) are derived in the 6-sector collaborative transmission system. Using the derived results, we propose an algorithm which searches the optimal power allocation for WSRM in the 3-sector collaborative transmission system. Based on the derived closed-form expressions and the proposed algorithm, we perform computer simulations to compare performance of the WSRM scheduler and the SRM scheduler with respect to the sum-rate and the log-sum-of-average rates. We further verify that the WSRM scheduler efficiently improves fairness performance by showing the enhanced performance of average transmission rates in low percentile region.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.889-894
• /
• 2004

Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.269-279
• /
• 2004

The most important factor influencing the robustness of the Internet Is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes worse the network congestion. Recently, Brakmo and Peterson have proposed a new version of TCP, which is named TCP Vegas, with a fundamentally different congestion control scheme from that of the Reno. Many studies indicate that the Vegas is able to achieve better throughput and higher stability than the Reno. But there are two unfairness problems in Vegas. These problems hinder the spread of the Vegas in current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP PowerVegas. The existing Vegas depends mainly only on the rtt(round trip time), but the proposed PowerVegas use the new congestion control scheme combined the Information on the rtt with the information on the packet loss. Therefore the PowerVegas performs the congestion control more competitively than the Vegas. Thus, the PowerVegas is able to solve effectively these unfairness problems which the Vegas has experienced. To evaluate the proposed approach, we compare the performance among PowerVegas, Reno and Vegas under same network environment. Using simulation, the PowerVegas is able to achieve better throughput and higher stability than the Reno and is shown to achieve much better fairness than the existing Vegas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.547-564
• /
• 2001

In this paper a simulation has been performed to compare and evaluate the performance between the EPRCA(Enhanced Proportional Rate Control Algorithm) and EMRCA(Explicit Max_min Rate Control Algorithm) switches. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. The EMRCA switch is more stable than the EPRCA switch and reduces its buffer size. Also, it achieves a higher utilization rate of the link bandwidth than the EPRCA switch. The hardware complexity of the EMRCA switch is significantly lower than the EPRCA and other rate-based switches. Since it eliminates the necessity of the floating-point operation for calculation of the MACR(Mean Allowed Cell Rate) at the switch.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.521-529
• /
• 2010

In this paper, we propose a new scheduling algorithms in OFDM systems to reduce inter-cell interference. The proposed algorithm applies different subcarrier allocation sequences for different cells which is optimized through integer programming to minimize inter-cell interference. System level simulation is executed to derive the performance of the proposed algorithm. Simulation results show that the proposed scheduling algorithm improves user fairness as well as throughput compared with previous algorithms and therefore improves support of user QoS.