• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.24-30
• /
• 2009

This paper presents a simple resource allocation scheme for throughput enhancement in relay based orthogonal frequency division multiple access (OFDMA) cellular systems. The resource allocation schemes, which are based on the optimization problem, have high computational complexity. That is why a searching process is required on the overall allocable resources. Since these schemes should be performed in real time, we propose a simple resource allocation scheme which has very low computational complexity. Firstly, we formulate the optimization problem and draw observations for throughput maximization. Based on observations, we propose a three step allocation scheme that separates the allocable resources into three (i.e. relay, frequency and time). By doing so, the computational complexity can be reduced. Simulation results show that the proposed scheme has near-optimum performance in spite of its low computational complexity.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.518-528
• /
• 2009

IEEE 802.11 wireless local area network (WLAN) has become the prevailing solution for wireless Internet access while transport control protocol (TCP) is the dominant transport-layer protocol in the Internet. It is known that, in an infrastructure-based WLAN with multiple stations carrying long-lived TCP flows, the number of TCP stations that are actively contending to access the wireless channel remains very small. Hence, the aggregate TCP throughput is basically independent of the total number of TCP stations. This phenomenon is due to the closed-loop nature of TCP flow control and the bottleneck downlink (i.e., access point-to-station) transmissions in infrastructure-based WLANs. In this paper, we develop a comprehensive analytical model to study TCP dynamics in infrastructure-based 802.11 WLANs. We calculate the average number of active TCP stations and the aggregate TCP throughput using our model for given total number of TCP stations and the maximum TCP receive window size. We find out that the default minimum contention window sizes specified in the standards (i.e., 31 and 15 for 802.11b and 802.11a, respectively) are not optimal in terms of TCP throughput maximization. Via ns-2 simulation, we verify the correctness of our analytical model and study the effects of some of the simplifying assumptions employed in the model. Simulation results show that our model is reasonably accurate, particularly when the wireline delay is small and/or the packet loss rate is low.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.400-402
• /
• 2005

무선랜에서 QoS에 따른 쓰루풋 차별화를 만들기 위하여 IEEE 802.11e에서는 한 개 이상의 802.11 매개변수 제어를 허용한다. 본 논문은 차별화 아래 어떻게 총 쓰루풋을 최대화 하는지를 연구한다. 일반적으로 QoS차별화를 시키는 것과 총 쓰루풋을 최대화시키는 것은 별개의 연구 내용으로 다루어져 왔다. 본 논문에서는 QoS 차별화와 동시에 쓰루풋을 최대화시킬 수 있는 해결책을 제공한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.417-420
• /
• 2006

This paper suggests that resource allocation algorithm in multiuser orthogonal frequncy divisioin multiplexing (OFDM). The proposed algorithm considers throughput maximization with power constraint and quality of service (QoS) constraint. This problem has a optimal solution with using well known water-filling algorithm but the algorithm requires high computational complexity. Therefore the problem needs a sub-optimal algorithm for decreasing computational complexity. We propose a sub-optimal joint subcarrier and power allocation algorithm for multiuser OFDM system and compare with previous resource allocation algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.744-748
• /
• 2003

Developing an interactive satellite multi­media system, such as a digital video broadcasting (DVB) return channel via satellite (RCS) system, is gaining popularity over the world To accommodate the increasing traffic demand we are motivated to investigate an alternative for improving return channel utilization We develop an efficient method for optimal packet scheduling in an interactive satellite multimedia system using hybrid CDMA/TDMA channels. We formulate the timeslot-code assignment problem as a binary integer programming (BIP) problem, where the throughput maximization is the objective, and decompose this BIP problem into two sub-problems for the purpose of solution efficiency. With this decomposition, we promote the computational efficiency in finding the optimal solution of the original BIP problem Since 2001, ETRI has been involved in a development project where we have successfully completed an initial system integration test on broadband mobile Internet access via Ku-band channels using the proposed resource allocation algorithm.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.140-150
• /
• 2012

In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.130-139
• /
• 2012

Energy harvesting has emerged as a powerful technology for complementing current battery-powered communication systems in order to extend their lifetime. In this paper a general framework is introduced for the optimization of communication systems in which the transmitter is able to harvest energy from its environment. Assuming that the energy arrival process is known non-causally at the transmitter, the structure of the optimal transmission scheme, which maximizes the amount of transmitted data by a given deadline, is identified. Our framework includes models with continuous energy arrival as well as battery constraints. A battery that suffers from energy leakage is studied further, and the optimal transmission scheme is characterized for a constant leakage rate.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.13-15
• /
• 2015

본 논문에서는 하나의 중계기가 하나의 송신기로부터 신호를 받아 증폭한 후에 수신기로 재전송하는 방식으로 송신기와 수신기 사이의 통신을 돕는 네트워크를 고려하였다. 중계기가 독자적인 에너지원이 없는 경우 일정한 양을 에너지를 확보하여 중계에 사용하기 위해서 송신기로부터의 신호를 에너지로 하베스팅하는 모델을 생각하였다. 또한, 나아가 현재의 다양한 무선통신 네트워크에서 사용중인 적응변조를 적용하여 항상 일정이상의 비트오율을 만족할 수 있는 더욱 현실적인 모델이 되도록 하였다. 이러한 모델에서 정해진 만큼의 시간을 하베스팅에 사용했을 경우 처리율을 구하였으며, 나아가 그 시간을 최적화하여 유도한 처리율을 최대화하는 문제를 만들었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.247-254
• /
• 2009

Over the last decade multiple-input and multiple-output (MIMO) systems have been actively researched and started to be deployed in wireless communications owing to the significant increase in channel capacity. In this paper, we propose a energy saving MAC protocol in systems by focusing on energy efficiency instead of capacity maximization. We considers the energy consumption together with the tradeoff between reliability (i.e., diversity) and throughput (i.e., multiplexing gain), and dynamically chooses an appropriate number of antennas for transmission. In computing the total energy consumption, we counts circuit energy as well as transmission energy. Naturally the circuit energy consumption is directly proportional to the number of active antennas. Through numerical analysis, we confirm that our power saving MAC scheme for MIMO considerably saves energy consumption compared to conventional capacity maximization schemes that use a fixed number of MIMO channels, for a given outage constraint. Our finding is that the capacity maximizing communication which possibly can be regarded best in terms of energy efficiency gives a different solution from the energy minimizing communication.