• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.738-749
• /
• 2011

In this paper, we study QoS(Quality of Service) control protocols and the effect using MAC/PHY parameters of client device in mobile network. We proposes the way of controling the bit-rate by estimating the channel condition of the client with measured MAC/PHY parameters which is sent from the client. With the proposed method, more accurate available bit-rate can be estimated compared to conventional protocol, RTCP(Real-time Transport Control Protocol). The accurate bit-rate estimation can decrease wasted bit-rate and transport delay. In the result of the advantages, the transported video quality can be enhanced. In this paper, we show the effects of enhancement using client's the field data measured in WiMAX.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.4
• /
• pp.78-85
• /
• 2011

In vehicle ad-hoc network (VANET) environments, traffic related information such as accident information, emergency information and real time traffic condition have to be delivered to on-board-unit (OBU) or/and road-side-equipment (RSE) for preventing traffic accidents in advance. In this paper, we introduce a Multi-Channel MAC (MCM) since the existing single channel operation may cause packet transmission delay and unexpected communication failure. To offer a seamless safety message transmission during the various services, it is necessary to manage the MAC scheduler in wireless access in vehicular environments (WAVE) systems. The MCM consists of MAC softwares and MAC hardwares where the former and the later ones are implemented with real time operation system based C language and FPGA module with VHDL language, respectively. The performance and QoS are verified by practical measurements and compared with the scheme using single channel operation.

• Journal of the Korean Society for Railway
• /
• v.17 no.4
• /
• pp.313-319
• /
• 2014

Additional train scheduling is often required to increase the capacity of transporting passengers or freight. In most previous studies on scheduling additional trains, operation time of the added train is designated first; and then the train operation feasibility is examined. However, it is often difficult to apply this approach to domestic trains because the density of the railroad network in Korea is high and various types of trains are in use. Moreover, for freight trains, it is even more challenging because the delay is accumulated due to lower priority whenever a freight train and a passenger train contend for a common segment of rail. In this paper, we address the additional train scheduling problem which entails finding a feasible schedule for an additional train having a fixed departure time or departure time windows. The problem is modeled as a mixed integer programming and a column generation technique is used to solve it.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.11
• /
• pp.269-274
• /
• 2018

MMORPG is a role-playing game that tens of thousands of people access it online at the same time. Users connect to the server through the game client and play with their own characters. If the user moves to a management area of another server beyond the area managed by the server, the user information must be transmitted to the server to be moved. In an actual game, the user is required to synchronize the established and the transferred information. In this paper, we propose a migration agent server in the virtual systems. We implement a seamless virtual server using the grid method to experiment with seamless server architecture for virtual systems. We propose a method to minimize the delay and equalize the load when the user moves to another server region in the virtual environment. Migration Agent acts as a cache server to reduce response time, the response time was reduced by 50% in the case of 70,000 people.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.1
• /
• pp.287-295
• /
• 2017

Recently, MTC (Machine Type Communication) is known as an important part to support IoT (Internet of Things) applications. MTC provides network connectivities between MTC devices without human intervention. In MTC, a large number of devices try to access over communication resource with a short period of time. Due to the limited communication resource, resource contention becomes severe and it brings about access failures of devices. To solve the problem, it needs to regulate device accesses. In this paper, we present an efficient access management scheme. We measure the number of devices which try to access in a certain time period and predict the change of the number of devices in the next time period. Using the predicted change, we control the number of devices which try to access. To verify our scheme, we conduct experiments in terms of success probability, failure probability, collision probability and access delay.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.508-514
• /
• 2005

The research in internetworking between UMTS and WLAN, which is completed with merits and demerits, Is actively progressed to establish global roaming environments. This internetworking is classified into two groups: loosely-coupled and tightly-coupled. h tightly-coupled mechanism demands lots of investment and considerable amountof time to construct, which is directly connoted between UNTS and WLAN via IWU. On the other hand, a tersely-coupled mechanism is more scalable and easier to implement than a tightly-coupled one while it has critical drawbacks of packet loss and blocking of services due to handover delay. To alleviate these drawbacks. this work proposes a handover scheme between UMTS and WLAN, which is based on HMIPv6. The performance of the proposed scheme is evaluated by the simaulation. The proposed internetworking scheme based on HMIPv6 shows hotter performance than those based on MIPv6.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.196-201
• /
• 2013

In this paper, we propose an asynchronous and adaptive message passing scheme based on S-MAC for handling with the problem on energy efficiency in wireless sensor networks. The proposed scheme consists of a policy that differentiate transmission errors caused by packet collision or radio interference from congestion errors caused by buffer overflow and a method that adaptively controls the size of a fragment according to the variance of traffic loads. Especially, it presents a method that highly reduce the energy consumption by keeping the size of fragment not being excessively smaller than the one that may result in rapid increment of the total transfer time. Finally, with the simulation results we show that network throughput and delay are improved by using the proposed message passing scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.45-57
• /
• 2005

In this paper, we extend the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. Even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congetion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps. By analyzing the periodic bursty behavior of the source IP queue, we derive estimated for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.1 no.2
• /
• pp.102-109
• /
• 2006

In this paper, we improve the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. For example, even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congestion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps.