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

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.863-870
• /
• 2004

UMTS(Universal Mobile Telecommunication System) is recently recognized as a standard for 3rd generation of wireless networks and DSCH(Down-link Shared Chanel) is considered as a very effective multiplexing method in UMTS. So, it is inevitable to develope an effective packet scheduling algorithms for DSCH in UMTS. This paper describes an improved packet scheduling algorithm for DSCH of UMTS. The algorithm takes consideration in channel state for each mobile terminal to maximize link utilization, delay threshold for class 3 traffic and throughput for class 4 to get long term fairness. To verify the algorithm, we programmed a simulator using PARSEC simulation tool and got some simulation results by it. The simulation results show that the algorithm has reasonable characteristics in both of link utilization and fair-ness by trade-off.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.22-29
• /
• 2002

The Gauranteed Frame Rate service category was proposed by the ATM Forum as an enhancement to the UBR service. This service aims to support minimum cell rate gaurantee for each virtual connection and allow any excess bandwidth in the network to be shared among the contending VCs in a fair manner. We propose a new buffer management algorithm for GFR service through FIFO queuing discipline. Proposed scheme can provide minimum bandwidth guarantee for GFR VCs as well as improve the fairness among the competing GFR VCs on a single FIFO queue. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.5
• /
• pp.13-21
• /
• 2000

In this paper, we investigate the performance improvement by applying flow control to LonWorks-based network systems which support various communication media together with interpretable class of systems. To this end, we introduce a circular queue at each node of industrial network systems usually operated in open loop. Then we utilize the feedback information of the number of data in a queue, the data arriving interval in a queue and channel error to make the overall industrial network system in closed loop. We verify the improved performance of the network systems in view of throughput and fairness measures via the experimental results conducted in several field situation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.34-49
• /
• 2015

Market means of spectrum trading have been utilized as a vital method of spectrum sharing and access in future cognitive radio system. In this paper, we consider the spectrum trading with multiple primary carrier providers (PCP) leasing the spectrum to multiple secondary carrier providers (SCP) for a short period of time. Several factors including the price of the resource, duration of leasing, and the spectrum quality guides the proposed model. We formulate three trading policies based on the game theory for dynamic spectrum access in a LTE based cognitive radio system (CRS). In the first, we consider utility function based resource sharing (UFRS) without any knowledge of past transaction. In the second policy, each SCP deals with PCP using a non-cooperative resource sharing (NCRS) method which employs optimal strategy based on reinforcement learning. In variation of second policy, third policy adopts a Nash bargaining while incorporating a recommendation entity in resource sharing (RERS). The simulation results suggest overall increase in throughput while maintaining higher spectrum efficiency and fairness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.149-168
• /
• 2015

In cognitive radio networks (CRNs), hybrid overlay and underlay sharing transmission mode is an effective technique for improving the efficiency of radio spectrum. Unlike existing works in the literature, where only one secondary user (SU) uses overlay and underlay modes, the different transmission modes should be allocated to different SUs, according to their different quality of services (QoS), to achieve the maximal efficiency of radio spectrum. However, hybrid sharing mode allocation for heterogeneous services is still a challenge in CRNs. In this paper, we propose a new resource allocation method for hybrid sharing transmission mode of overlay and underlay (HySOU), to achieve more potential resources for SUs to access the spectrum without interfering with the primary users. We formulate the HySOU resource allocation as a mixed-integer programming problem to optimize the total system throughput, satisfying heterogeneous QoS. To decrease the algorithm complexity, we divide the problem into two sub-problems: subchannel allocation and power allocation. Cutset is used to achieve the optimal subchannel allocation, and the optimal power allocation is obtained by Lagrangian dual function decomposition and subgradient algorithm. Simulation results show that the proposed algorithm further improves spectrum utilization with a simultaneous fairness guarantee, and the achieved HySOU diversity gain is a satisfactory improvement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.308-324
• /
• 2018

HTTP adaptive streaming (HAS) is a promising technology for delivering video content over the Internet. HAS-based video streaming solutions rely on bandwidth estimation to select the appropriate video bitrate. Video streaming solutions that consider network conditions provide users with seamless video playback. However, when multiple clients compete for a common bottleneck link, conventional bandwidth estimation schemes that consider only one client overestimate the network bandwidth due to the ON-OFF traffic pattern. The bandwidth overestimation can cause Quality of Experience (QoE) degradation, such as unnecessary changes in video quality, and unfairness of video quality. In this paper, we propose a client-side bandwidth estimation scheme to obtain a better QoE of HAS in the multiple-client environment. The proposed scheme differentiates the client buffer status according to the buffer occupancy, and then estimates the available network bandwidth based on the buffer status and segment throughput. We evaluate the performance of HAS implemented in the ns-3 network simulator. Simulation results show that compared with the conventional schemes, the proposed scheme can enhance the QoE.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.91-94
• /
• 2007

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a fairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1610-1618
• /
• 1998

In this paper, we present the FB(Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved with the FB mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare through simulation the performance of the existing drop-tail, EB(Equal Buffering) and the proposed FB buffer management schemes, with and without RR(Roung-Robin) scheduling, and demonstrate that the proposed FB mechanism is most effective when used in conjunction with the RR scheduling scheme.