• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.9
• /
• pp.40-49
• /
• 2011

Integrating massive components and low-power policies have been actively investigated for system-on-chip designs. But in recent years, finding the optimal interconnection structure among heterogeneous components has emerged as a critical system design issue. Therefore, various simulation tools to model interconnection designs are being developed and performance evaluation of simulation is reflected in the real design. But most of the simulation environments employ traffic generation based on the mathematical probability functions, and such traffic generation cannot fully cover for various situations that may be occurred in the real system. Therefore, the demand for traffic pattern generation based on real applications is increasing. However, there have been few simulators that adopt application-specific traffic generators. This paper proposes a novel traffic generation method in simulating various interconnection structures for multi-processor system-on-chip design. The proposed traffic generation method can generate traffic patterns that can reflect the actual characteristics of the application and evaluate the performance of an interconnection structure under more realistic circumstance than traffic patterns using mathematical probability functions. By comparing the differences between the proposed method and the one based on mathematical probability functions, this paper shows advantages of the proposed traffic generation method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1719-1729
• /
• 1994

In this paper, an adaptive CAC(Connection Admission Control) method is proposed. The adaptive CAC uses traffic estimates derived from both traffic parameter specified by user and cell flow measurements. Traffic estimation using user-specified parameters is performed at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. Traffic estimation using cell flow measurement is carried out when the number of connected calls does not change during a measurement reflection period-renewal period. The most import ant thing for the traffic estimation using cell flow measurement is the determination of the length of a renewal period to trace a real traffic flow with an allowable time lag and the measurement reflection ratio(MRR) both to reduce the portion of overestimation and to avoid underestimation of real traffic flow. To solve these problems, the adaptive CAC updates renewal period and MRR adaptively according to the number of connections and the elapsed time after last connection or release respectively. Performance analysis for the proposed method is evaluated in several aspects for the cases of both homogeneous and heterogeneous bursty traffic. Numerical examples show the adaptive CAC method has the better performance compared with conventional CAC method based on burst model from the both utilization and QOS point of view.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.93-95
• /
• 1998

본 논문에서는 기존의 파일 시스템을 이용한 모빌 에이전트가 아나라, 분산된 서로 다른 데이터베이스 환경에서 효과적인 데이터 탐색을 위한 디렉토리와 옐로우 페이지를 모빌 에이전트를 이용하여 설계하고 구현하였다. 그리고 개발 환경은 서로 다른 Windows NT와 유닉스 시스템을 혼용하였고, 플랫폼에 독립적인 Java 언어와 통합 모질 에이전트 환경을 지원하는 ASDK를 사용하였다. 이러한 기능을 전투 상황이라는 시나리오에 적용하였다. 신속하게 여러 부대 가용자산 정보를 수집해야 하는 긴박한 상황 속에서 이미 Traffic Jam 상태에 있는 제한되어있는 통신망은 요구하는 속도를 충족시키기 곤란할 것이다. 이러한 상황 속에서 모빌 에이전트의 활발한 활동은 필요한 데이터를 지속적으로 갱신, 탐색 할 것이며, 특히 모빌 컴퓨팅 환경과 결합되어 더욱 효율적인 결과를 나타낼 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.879-882
• /
• 2010

본 연구는 idle 상태의 단말을 위한 이종 무선 통신망 환경에서 네트워크 선택 알고리즘을 제안한다. 제안 하는 알고리즘은 셀과 사용자 각각의 상대적 상태 정보를 이용하는 프로필기반 네트워크 선택 프레임워크(Profile-based Network Selection Framework, PNSF)에 기반한다. PNSF 는 traffic status, mobility, 그리고 QoS (Quality of Service) 카테고리의 정보들을 바탕으로 셀과 사용자의 프로필을 생성한다. 생성된 프로필들을 3 차원의 프로필 공간에서 위치 시키고 각 셀과 사용자 프로필 사이의 거리를 각 카테고리를 구성하는 요소의 정적 특성을 반영하여 계산한다. 사용자는 최종적으로 가장 거리가 긴 셀을 선택하여 location update 를 수행한다. 본 연구에서 제안하는 알고리즘은 이종의 무선통신망 환경의 특성과 idle 모드의 특성을 반영하여 location update 의 발생 빈도를 합리적으로 줄이면서도 급증하는 데이터 통신 사용을 고려하여 사용자가 네트워크에 전체에 적절히 분산되도록 선택한다.

• Journal of Advanced Navigation Technology
• /
• v.13 no.4
• /
• pp.490-502
• /
• 2009

This monograph details the development of communication UAV(Unmanned Aerial Vehicle) in combined modems of HSDPA with Wibro by using two kinds of mobile network. In order to apply mobile network which is currently serviced to a UAV, it is necessary to solve some problems : insurance of wide coverage based on the range of the UAV, electrical transmission of extensive image data for UAV for watching and scouting, security of stable communication environment is related to network traffic. This paper proposes those difficulties to be solved by application of correspondence system to mobile network. The proposed system consists of two parts; HSDPA part and Wibro part. The use of those can not only secure wide range of coverage but also transmit huge data. Furthermore, through utilizing them along with two kinds of mobile network, stable communication environment can be built up. All of these effects can be confirmed by experimentations and simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.3
• /
• pp.277-288
• /
• 2013

3GPP LTE-Advanced (Third Generation Partnership Project Long Term Evolution-Advanced) as a next generation mobile communication standard introduced small base stations such as femto cells or pico cells, and D2D (Device-to-Device) communications between mobiles in the proximity in order to satisfy the needs of rapidly growing wireless data traffic. A diverse range of topics has been studied to solve various interference situations which may occur within a single cell. In particular, an introduction of a small base station along with D2D communication raises important issues of how to increase the channel capacity and frequency efficiency in HetNets (Heterogeneous Networks). To this end, we propose in this paper methods to manage the interference between the macro cell and other small cells in the HetNet to improve the frequency efficiency. The proposed CCN (Cluster Coordinator Node)-assisted ICI (Inter-Cell Interference) avoidance methods exploit the CCN to control the interference in HetNet comprising of an MeNB (Macro enhanced Node-B) and a large number of small cells. A CCN which is located at the center of a number of small cells serves to avoid the interference between macro cell and small cells. We propose methods of resource allocation to avoid ICI for user equipments within the CCN coverage, and evaluate their performance through system-level computer simulations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.52-59
• /
• 1996

The boroadband ISDN will transprot the traffics for a wide range of applications with different quality-of-service (QOS) requirements and the priorit control mechanism is an effective method to support multiple classes of services. This paper proposes a new mechanism to satisfy simultaneously the different levels of cell loss performance for the two classes of heterogeneous nonreal-time ATM traffics as well as the delay and loss requirements of real-time traffics. Its performance is analyzed using the stochastic integral approach with the cell arrivals of input streams modeled as markov modulated poisson processes.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.30-42
• /
• 2010

In this work we consider the problem of downlink resource allocation for proportional fairness of long term received rates of data users and quality of service for real time sessions in an OFDMA-based wireless system. The base station allocates available power and subchannels to individual users based on long term average received rates, quality of service (QoS) based rate constraints and channel conditions. We formulate and solve a joint bandwidth and power optimization problem, solving which provides a performance improvement with respect to existing resource allocation algorithms. We propose schemes for flat as well as frequency selective fading cases. Numerical evaluation results show that the proposed method provides better QoS to voice and video sessions while providing more and fair rates to data users in comparison with existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.731-763
• /
• 2017

In Underwater Linear Sensor Networks (UW-LSN) routing process, nodes without proper address make it difficult to determine relative sensor details specially the position of the node. In addition, it effects to determine the exact leakage position with minimized delay for long range underwater pipeline monitoring. Several studies have been made to overcome the mentioned issues. However, little attention has been given to minimize communication delay using dynamic addressing schemes. This paper presents the novel solution called Hop-by-Hop Dynamic Addressing based Routing Protocol for Pipeline Monitoring (H2-DARP-PM) to deal with nodes addressing and communication delay. H2-DARP-PM assigns a dynamic hop address to every participating node in an efficient manner. Dynamic addressing mechanism employed by H2-DARP-PM differentiates the heterogeneous types of sensor nodes thereby helping to control the traffic flows between the nodes. The proposed dynamic addressing mechanism provides support in the selection of an appropriate next hop neighbour. Simulation results and analytical model illustrate that H2-DARP-PM addressing support distribution of topology into different ranges of heterogeneous sensors and sinks to mitigate the higher delay issue. One of the distinguishing characteristics of H2-DARP-PM has the capability to operate with a fewer number of sensor nodes deployed for long-range underwater pipeline monitoring.

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