• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.784-795
• /
• 2016

In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

• ETRI Journal
• /
• 제42권5호
• /
• pp.700-711
• /
• 2020

Because of the rapid increase of mobile traffic, flexible broadband supportive unmanned aerial vehicle (UAV)-based 6G mobile networks using free space optical (FSO) links have been recently proposed. Considering the advancements made in UAVs, big data processing, and artificial intelligence precision control technologies, the formation of an additional wireless network based on UAV aerial platforms to assist the existing fixed base stations of the mobile radio access network is considered a highly viable option in the near future. In this paper, a combined time bound optimization scheme is proposed that can adaptively satisfy the control and communication time constraints as well as the processing time constraints in FSO-based 6G UAV aerial networks. The proposed scheme controls the relation between the number of data flows, input data rate, number of worker nodes considering the time bounds, and the errors that occur during communication and data processing. The simulation results show that the proposed scheme is very effective in satisfying the time constraints for UAV control and radio access network services, even when errors in communication and data processing may occur.

• 한국통신학회논문지
• /
• 제33권2B호
• /
• pp.82-89
• /
• 2008

단말의 이동을 인터넷 프로토콜 계층에서 지원하기 위하여 사용되는 모바일 아이피는 하나의 단말이 아닌 다수의 단말이 함께 이동할 경우 발생하는 문제를 해결하기 위하여 네트워크 이동성이라는 개념으로 확장되었다. 네트워크 이동성 시나리오에서 이동 라우터들 사이에 계층 구조가 존재할 경우를 특히 중첩 이동 네트워크라고 부르며 이러한 중첩 이동 네트워크에서는 계층의 깊이에 비례하여 비효율적인 라우팅 경로를 따르게 되는 핀볼 라우팅 문제가 발생한다. 본 논문에서는 기존의 이동 네트워크 지원 프로토콜과 호환성을 가지며 이질적인 이동 네트워크 환경을 고려하는 경로 최적화 기법을 제안하고 정량적 정성적 비교 분석을 수행한다.

• 전자공학회논문지T
• /
• 제36T권2호
• /
• pp.21-31
• /
• 1999

대규모 시스템 제어와 관련하여 몇 개의 부시스템으로 분할하여 처리하는 계층별 제어이론이 많이 연구되어 왔으며 특히 치수가 높은 대규모 비선형 시스템의 경우에 고차의 비선형 미분방정식을 동시에 적분을 해야하고 많은 계산량을 필요로 하므로 해를 구하기가 어려운 문제가 있다. 1980년대 Singh과 Hassan은 상호예측 알고리즘(two level prediction algorithm)을 제시한바 있고 이 방법은 비선형 대규모 시스템의 최적제어에 효과적이나 시스템 행렬 Q, R, S, H에 따라 제한된 최적화 구간에서만 성립되는 등 최적화 구간의 길이와 수렴성 여부가 행렬 값에 영향을 받는 알고리즘상의 단점이 있다. 본 연구에서는 수렴조건으로부터 평가함수에 구속조건(quadratic penalty term)을 부여하지 않는 새로운 개선된 알고리즘을 제시 적용하여 시스템 행렬 결정을 위한 과정 없이 수렴속도의 향상과 함께 최적의 수렴성 및 최적화 구간을 얻도록 했다. 분할된 비선형 시스템의 최적제어를 위해서는, 대수 반복연산만으로 2점 경계치 문제(two point boundary value problem)를 해결함으로써 기존의 수치 해석법에 비해 연산이 간단한 블록펄스 변환 방법을 사용해서 처리했다.

• 한국컴퓨터정보학회논문지
• /
• 제4권4호
• /
• pp.163-169
• /
• 1999

Mobile-IP는 모빌컴퓨터 이용자가 IP 주소를 변경하지 않으면서 자유로이 장소를 이동할 수 있도록 개발된 프로토콜이다. 본래 IP 주소는 고정된 위치를 가정하고 개발되었기 때문에, Mobile-IP에서는 사용자의 이동성을 지원하기 위해 홈 에이전트(Home Agent)와 외부에이전트(Foreign Agent) 라는 개념을 도입하였으며 에이전트 발견(Agent Discovery), 등록(Registration), 터널링(tunnelling)등의 기법을 사용한다. 경로 최적화(route optimization)는 통신노드에게 이동 호스트의 care-of address를 알려 줌으로써 triangle routing 문제를 피할 수 있게되었다. 이외에도 보다 진보된 성능향상 방안으로 한 사이트 안에서 빈번한 지역이동성으로 야기되는 오버헤드를 줄이기 위한 외부 에이전트들의 계층화(Hierarchical FAs), 통신에 참여하는 외부 에이전트에 버퍼링 메카니즘(Buffering Mechanism)을 설치하여 이동 호스트로 향한 패킷을 분실하지 않도록 하는 Smooth handoffs 등의 방법들이 제안되었다. 본 논문에서는 호스트의 이동성을 지원하기 위해 고려해야 할 문제점과 기존에 제안된 기법들을 살펴보고자 한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제1권3호
• /
• pp.152-160
• /
• 2012

This paper proposes a frame-level rate control algorithm for low delay video applications to reduce the fluctuations in the bitrate. The proposed algorithm minimizes the bitrate fluctuations in two ways with minimal coding loss. First, the proposed rate control applies R-Q model to all frames including the first frame of every group of pictures (GOP) except for the first one of a sequence. Conventional rate control algorithms do not use any R-Q models for the first frame of each GOP and do not estimate the generated-bit. An unexpected output rate result from the first frame affects the remainder of the pictures in the rate control. Second, a rate-distortion (R-D) cost is calculated regardless of the hierarchical coding structure for low bitrate fluctuations because the hierarchical coding structure controls the output bitrate in rate distortion optimization (RDO) process. The experimental results show that the average variance of per-frame bits with the proposed algorithm can reduce by approximately 33.8% with a delta peak signal-to-noise ratio (PSNR) degradation of 1.4dB for a "low-delay B" coding structure and by approximately 35.7% with a delta-PSNR degradation of 1.3dB for a "low-delay P" coding structure, compared to HM 8.0 rate control.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2824-2838
• /
• 2013

There has been a lot of attention paid recently to analyze dynamic human gestures that vary over time. Most attention to dynamic gestures concerns with spatio-temporal features, as compared to analyzing each frame of gestures separately. For accurate dynamic gesture recognition, motion feature extraction algorithms need to find representative features that uniquely identify time-varying gestures. This paper proposes a new feature-extraction algorithm using temporal self-similarity based on a hierarchical human model. Because a conventional temporal self-similarity method computes a whole movement among the continuous frames, the conventional temporal self-similarity method cannot recognize different gestures with the same amount of movement. The proposed model-based temporal self-similarity method groups body parts of a hierarchical model into several sets and calculates movements for each set. While recognition results can depend on how the sets are made, the best way to find optimal sets is to separate frequently used body parts from less-used body parts. Then, we apply a multiclass support vector machine whose optimization algorithm is based on structural support vector machines. In this paper, the effectiveness of the proposed feature extraction algorithm is demonstrated in an application for taebo gesture recognition. We show that the model-based temporal self-similarity method can overcome the shortcomings of the conventional temporal self-similarity method and the recognition results of the model-based method are superior to that of the conventional method.

• 한국도로학회논문집
• /
• 제17권3호
• /
• pp.13-25
• /
• 2015

PURPOSES : This paper aims at the implementation of a balanced scorecard that can be widely applied to modern business management for use in the public road management sector. METHODS : This study applied the newly developed LOS-based balanced scorecard system instead of a traditional Key Performance Index (KPI) for better decision making in asset management planning. As an evaluation technique, a" hierarchical alignment and cascading method" is also suggested. Finally, the suggested system has been empirically applied to a regional government. RESULTS : To provide stable and sustainable road services, the balanced scorecard informs the regional government of needed improvements in its asset management plans regarding budget optimization, structural management, the development of inner-business processes, and human resources. CONCLUSIONS : An LOS-based balanced scorecard for managing road services and organizations in a quantitative manner has been successfully developed and tested through a field study. The developed scorecard is a timely topic and a useful analytical tool for coping with the new phases of an aging infrastructure, tighter budgets, and demand for greater public accountability.

• 전기학회논문지
• /
• 제61권8호
• /
• pp.1164-1171
• /
• 2012

Recently, machine olfactory systems as an artificial substitute of the human olfactory system are being studied actively because they can scent dangerous gases and identify the type of gases in contamination areas instead of the human. In this paper, we present an effective design method for the gas identification system. Even though dimensionality reduction is the very important part, in pattern analysis, We handled effectively the dimensionality reduction by grouping the sensors of which the measured patterns are similar each other, where genetic algorithms were used for combination optimization. To identify the gas type, we constructed the hierarchical rule base with two frames by using rough set theory. The first frame is to accept measurement characteristics of each sensor and the other one is to reflect the identification patterns of each group. Thus, the proposed methods was able to accomplish effectively dimensionality reduction as well as accurate gas identification. In simulation, we demonstrated the effectiveness of the proposed methods by identifying five types of gases.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.381-388
• /
• 2020

Weapon target assignment problem is an essential technology for automating the operator's rapid decision-making support in a battlefield situation. Weapon target assignment problem is a kind of the optimization problem that can build up an objective function by maximizing the number of threat target destructed or maximizing the survival rate of the protected assets. Weapon target assignment problem is known as the NP-Complete, and various studies have been conducted on it. Among them, a greedy heuristic algorithm which guarantees (1-1/e) approximation has been considered a very practical method in order to enhance the applicability of the real weapon system. In this paper, we formulated the weapon target assignment problem for supporting decision-making at the level of artillery. The lazy strategy based on hierarchical structure is proposed to accelerate the greedy algorithm. By experimental results, we show that our algorithm is more efficient in processing time and support the same level of the objective function value with the basic greedy algorithm.