• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.794-799
• /
• 2015

To manage cell outage problem in indoor wireless communication systems, we should resolve the problem of abrupt network failure quickly. In this paper, we propose a near-optimal cell outage management (NoCOM) scheme to support seamless services to users. In consideration of system throughput, user fairness, and the guarantee of QoS simultaneously, the NoCOM scheme finds the solution of subchannel and power allocations using a non-convex optimization technique and allocates radio resources to users iteratively. Through intensive simulations, we verify the outstanding performances of the proposed NoCOM scheme with respect to the average cell capacity, user fairness, and computational complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1606-1612
• /
• 2012

Cognitive radio technology enables us to utilize the extra spectrum which is not used by the primary users by sensing the channel condition. To use such an extra spectrum, spectrum allocation is one of the important issues in the cognitive radio networks. The network is dynamic and the available channels are changeable, and the opportunistic channel allocation is required to use the resource efficiently without interference to the primary networks. In this paper, modified proportional fairness scheduling is proposed for cognitive radio networks to satisfy the both fairness and system throughput, and the modified scheduling was designed to reduce the interference to the primary users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5820-5834
• /
• 2017

This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.248-254
• /
• 2005

The existing buffer management scheme is caused by with burstness characteristic of the TCP traffic and with only the transmission which is not loss it provides the smallest transmission rate guarantee where the GFR demands and a fair characteristic. In order to provide a high fair characteristic from the dissertation which it sees with the smallest transmission rate guarantee where the GFR demands it proposed the existing buffer algorithm which applies a Fuzzy mechanism in the existing buffer management technique. The proposed algorithm decides a packet disuse used by three parameters which are composed of tagging information, the buffer usage, and the load of VC. Simulation results shows that the fairness and goodput of the proposed algorithm were excellent where the size of MCR will become larger, from the switch the Double-EPD or the DFBA was visible a similar efficiency even from size change of the buffer. The algorithm which is proposed provides a good throughput and a fair characteristic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.373-378
• /
• 2007

In this paper, the Game Theory based power control for OFDM system is studied, which has attained intensive interest as a core artificial intelligent technology for Cognitive Radio and its efficiency is evaluated using performance metrics such as system throughput and fairness. Utility Function for joint user centric and network centric power control is defined and simulation results show that game theory based power control is far better than closed loop power control. The contribution of this paper is to formalize the game theory based power control toward the Cognitive Radio that recognizes and adapts to the radio communication environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.147-151
• /
• 2002

One of the main issues in Diffserv AS architecture is guaranteeing fairness among the flows which have their own QoS requirements. Because the methodology of resource allocation and traffic conditioning would affect the end-to-end QoS and backbone link utilization. In this paper, we propose a variant of TSW algorithm for enhancing fair bandwidth allocation and link utilization and presents performance evaluation between TSW & TS2W3C through NS-2 Simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2382-2388
• /
• 2014

To provide network reliability in indoor wireless communication systems, we should resolve the problem of unexpected network failure rapidly. In this paper, we propose an adaptive resource management (ARM) scheme to support seamless connectivity to users. In consideration of system throughput and user fairness simultaneously, the ARM scheme adaptively determines the set of healing channels, and performs scheduling and power allocation iteratively based on a constrained non-convex optimization technique. Through intensive simulations, we demonstrate the superior performance results of the proposed ARM scheme in terms of the average cell capacity and user fairness.

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

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.1-14
• /
• 2011

This paper analyzes the fairness and efficiency of channel sharing when heterogeneous wireless networks that have different transmission power and/or coverage coexist with the contention-based channel access protocol. First, we show that the existing CSMA (carrier sensing multiple access) protocol, that is a prevailing contention-based mechanism, results in significant unfairness of channel access because of (1) the asymmetric capability of carrier sensing and (2) the blindness of binary exponential backoff and link adaptation mechanisms to the interference-driven transmission failures. Next, we derive the feasible region of carrier sensing thresholds that assures spatial reuse and fair channel sharing simultaneously. Moreover, we establish an analytical model for per-system throughput and investigate the effect of contention window size and transmission rate on the fairness and efficiency of channel sharing. Finally, we compare the performance of several approaches for fair channel sharing via simulations under various network configurations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.5
• /
• pp.425-432
• /
• 2014

The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.