• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.1
• /
• pp.39-46
• /
• 2016

According to general architecture of flight simulator made up of several independent rendering display systems, display synchronization problem between them naturally happens. In addition, since the flight simulator is usually implemented in the same networks where network delay is not big concern, it is necessary to consider different factors of existing synchronization technique. Among them, in this paper, we propose a new display synchronization scheme for flight simulator where each system has different rendering capacity. In the proposed scheme, each system is synchronized by considering maximum and minimum frames per second (FPS) while considering level of detail and latency. Also, experimental results are given to demonstrate the suitability of the proposed scheme for display synchronization scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.1009-1017
• /
• 2010

Offering of different attractive opportunities by different wireless technologies trends the convergence of heterogeneous networks for the future wireless communication system. To make a seamless handover among the heterogeneous networks, the optimization of the power consumption, and optimal selection of interface are the challenging issues. The access of multi interfaces simultaneously reduces the handover latency and data loss in heterogeneous handover. The mobile node (MN) maintains one interface connection while other interface is used for handover process. However, it causes much battery power consumption. In this paper we propose an efficient interface selection scheme including interface selection algorithms, interface selection procedures considering battery power consumption and user mobility with other existing parameters for overlaying networks. We also propose a priority based network selection scheme according to the service types. MN‘s battery power level, provision of QoS/QoE and our proposed priority parameters are considered as more important parameters for our interface selection algorithm. The performances of the proposed scheme are verified using numerical analysis.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.585-595
• /
• 2020

Integration of multiple communication technologies in a smart grid (SG) enables employing cognitive radio (CR) technology for improving reliability and security with low latency by adaptively and effectively allocating spectral resources. The versatile features of the CR enable the smart meter to select either the unlicensed or the licensed band for transmitting data to the utility company, thus reducing communication outage. Demand response management is regarded as the control unit of the SG that balances the load by regulating the real-time price that benefits both the utility company and consumers. In this study, joint allocation of the transmission power to the smart meter and consumer's demand is formulated as a two stage multi-armed bandit game in which the players select their optimal strategies noncooperatively without having any prior information about the media. Furthermore, based on historical rewards of the player, a real-time pricing adaptation method is proposed. The latter is validated through numerical results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.1
• /
• pp.9-15
• /
• 2018

This paper describes the applicability of Bluetooth and ZigBee networks for real-time control in wireless networked control system and suggests an effective usage of them. The Bluetooth SCO link, SPP and HID profiles and the ZigBee non-beacon enabled network are analyzed and the latency of them are measured. A number of wireless networked control system experiments are performed via DC motor control system and the various profiles of Bluetooth and ZigBee in real-time wireless networked control system are compared.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.69-79
• /
• 2014

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

• Communications for Statistical Applications and Methods
• /
• v.21 no.3
• /
• pp.225-234
• /
• 2014

We propose a novel hierarchical clustering for distribution valued dissimilarities. Analysis of large and complex data has attracted significant interest. Symbolic Data Analysis (SDA) was proposed by Diday in 1980's, which provides a new framework for statistical analysis. In SDA, we analyze an object with internal variation, including an interval, a histogram and a distribution, called a symbolic object. In the study, we focus on a cluster analysis for distribution valued dissimilarities, one of the symbolic objects. A hierarchical clustering has two steps in general: find out step and update step. In the find out step, we find the nearest pair of clusters. We extend it for distribution valued dissimilarities, introducing a measure on their order relations. In the update step, dissimilarities between clusters are redefined by mixture of distributions with a mixing ratio. We show an actual example of the proposed method and a simulation study.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1597-1604
• /
• 2005

Recursive Patching is an efficient multicast technique for large-scale video on demand systems and recursively shares existing video streams with asynchronous clients. When Recursive Patching initiates a transition stream, it always makes a transition stream have additional data for the worst future request. In order to share a VOD server's limited network bandwidth efficiently, this paper proposes Practical Patching that removes the unnecessary data included in the transition stream. The proposed Practical Patching dynamically expands ongoing transition streams when a new request actually arrives at the server. As a result, the transition streams never have unnecessary data. Simulation result confirmed that the proposed technique is better than Recursive Patching in terms of service latency and defection rate.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.161-167
• /
• 2014

Web caches help to reduce latencies arising from slow networks through storing and reusing what was used before. Repeat access to a cached resource does not incur network latencies. However, resources that have never been used will not be found in the cache. Cache prefetching is a technique that helps to fill a cache with still-unused resources in anticipation that these resources will be used in the near future. Typically these unused resources are related to the resources that have been accessed in the recent past. While web caching exploits temporal locality, prefetching attempts to exploit spatial locality. Access to the prefetched resources will be cache hits, and therefore reduces the latency as perceived by the user. This paper reviews the cache infrastructure supported by the hypertext transfer protocol and discusses web cache prefetching in general, including Mozilla's prefetching infrastructure. It then classifies and reviews some prefetching techniques.

• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.89-96
• /
• 2016

In mobile communication, there are various types of handoff for the support of all forms of mobility. Proxy mobile IPv6 (PMIPv6) enables local network-based mobility management of a mobile node without any effect of mobility-related signaling. Recently, PMIPv6 has been considered for supporting mobility management in LTE/SAE-based mobile networks. To support seamless mobility in heterogeneous mobile networks, the overall cost of handoffs needs to be minimized and the procedure should be guaranteed to be secure. However, the reduction of the authentication cost has not been fully investigated to provide seamless connectivity when mobile users perform a handoff between the PMIPv6 domains. This paper proposes secure pre-authentication schemes, completing an authentication procedure before performing a handoff, for a fast handoff in PMIPv6. Analytic models have been used for measuring the authentication latency and for the overhead cost analysis. In addition to providing fast authentication, the proposed pre-authentication schemes can prevent threats such as replay attacks and key exposure.