• ETRI Journal
• /
• 제24권1호
• /
• pp.43-55
• /
• 2002

This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

• Journal of Electrical Engineering and Technology
• /
• 제13권1호
• /
• pp.445-450
• /
• 2018

Reliable detection and parameter estimation of a radar cross section(RCS) fluctuating target have been known as a difficult task. To reduce the effect of RCS fluctuation, various diversity techniques have been considered. This paper presents a new method for synthesizing a covariance matrix applicable to a coherent multi-input multi-output(MIMO) radar with frequency diversity. It is achieved by efficiently combining covariance matrices corresponding to different carrier frequencies such that the signal-to-noise ratio(SNR) in the combined covariance matrix is maximized. The value of a synthesized covariance matrix is assessed by examining the phase curves of its entries and the improvement on direction of arrival(DOA) estimation.

• Journal of information and communication convergence engineering
• /
• 제10권2호
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• 정보통신설비학회논문지
• /
• 제8권4호
• /
• pp.201-206
• /
• 2009

The third generation mobile communications system requiring the reliable multimedia data transmission has provided with the reliable voice, data and video services over the variable propagation environment. However the broadband wireless multiple access technologies cause Inter Symbol Interference (ISI) or Multiple Access Interference (MAI) to degrade the performance of W-CDMA (Code Division Multiple Access) system. Constant Modulus Algorithm (CMA) which is frequently used as the adaptive blind equalizers to remove the interfering signal has ill-convergence phenomenon without proper initialization. In this paper, new blind equalization method based on conventional CMA is proposed to improve the channel efficiency, and through computer simulation this is tested over the time varying fading environment of mobile communication system. Consequently, new blind equalization method into concatenated Kalman filter with CMA is verified better than conventional CMA through adopting minimum mean square errors and eye-pattern obtained from algorithm are compared.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.246-260
• /
• 2016

A major challenge achieving scalable access control for a large number of subscribers in a public broadcast is to distribute key update messages reliably to all stateless receivers. However, in a public broadcast, the rekeying messages can be dropped or compromised during transmission over an insecure broadcast channel, or transmitted to receivers while they were off-line. In this study, we propose a novel group key management scheme. It features a mechanism to allow legitimate receivers to recover the current group key, even if they lose key update messages for long-term sessions. The scheme uses short hint messages and member computation. Performance analysis shows that the proposed scheme has the advantages of scalability and efficient rekeying compared to previous reliable group key distribution schemes. The proposed key management scheme targets a conditional access system in a media broadcast in which there is no feedback channel from receivers to the broadcasting station.

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.306-317
• /
• 2009

We consider the problem of architecting a reliable content delivery system across an overlay network using TCP connections as the transport primitive. We first argue that natural designs based on store-and-forward principles that tightly couple TCP connections at intermediate end-systems impose fundamental performance limitations, such as dragging down all transfer rates in the system to the rate of the slowest receiver. In contrast, the ROMA architecture we propose incorporates the use of loosely coupled TCP connections together with fast forward error correction techniques to deliver a scalable solution that better accommodates a set of heterogeneous receivers. The methods we develop establish chains of TCP connections, whose expected performance we analyze through equation-based methods. We validate our analytical findings and evaluate the performance of our ROMA architecture using a prototype implementation via extensive Internet experimentation across the PlanetLab distributed testbed.

• 전자통신동향분석
• /
• 제34권3호
• /
• pp.93-105
• /
• 2019

This study emphasizes the importance of the newly added Ultra-Reliable and Low-Latency Communications (URLLC) service as an important evolutionary step for 5G mobile communication, and proposes a remedial application. We analyze the requirements for the application of 5G mobile communication technology in high-precision vertical industries and applications, introduce the 5G URLLC design principles and standards of 3GPP, and summarize the current state of applied artificial intelligence technology in wireless communication. Additionally, we summarize the current state of research on ultra-reliable and low-latency machine learning-based wireless communication technology for application in ultra-high-precision vertical industries and applications. Furthermore, we discuss the technological direction of artificial intelligence technology for URLLC wireless communication.

• 한국통신학회논문지
• /
• 제37C권11호
• /
• pp.1112-1128
• /
• 2012

인지 무선 환경에서의 부 사용자들은 주 사용자가 일시적으로 사용하지 않는 채널을 기회적으로 이용하여 통신을 수행한다. 이러한 통신은 부 사용자 상호간에 접근이 가능한 공통 채널을 통해 이루어지는데, 부 사용자들의 통신을 위한 공통 채널은 주 사용자의 채널 사용 현황을 바탕으로 동적으로 변경될 수 있다. 최근 인지무선통신을 위한 연구가 많이 진행 되고 있으나, 공통 채널을 구성하기 위한 세부적인 절차에 대한 연구가 부족한 실정이다. 본 논문에서는 인지무선 네트워크 환경에서 군사용 무전기의 점대점 통신을 위한 신속하고 신뢰성 있는 동적 공통 채널 설정 및 복원 방법에 대한 방법과 절차를 제안하고, 공통 채널 설정과 복원 과정을 위한 패킷 교환 시간, 채널 요청 대기 시간, 랑데부 시간과 같은 시간 파라미터들을 고려하여, 각각의 세부적인 절차들을 기술하였다. 또한, 수치 해석을 통해서 채널 설정 및 복원 지연 시간과 처리량 등을 도출하여 제안된 방법의 성능을 평가하였다.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제2권6호
• /
• pp.253-256
• /
• 2013

VANET에서는 차량 안전 관련 정보가 차량들 간에 안정적으로 전달될 수 있도록 해주는 라우팅 프로토콜이 요구된다. 본 논문에서는 도시기반의 VANET 환경에서 차량 간의 빠르고 안정적인 통신을 위하여 차량 밀도 정보를 이용한 라우팅 기법을 제안한다. 제안 기법에서 각 차량은 비콘 메시지와 도로 정보을 이용해서 도로의 차량 밀도를 계산한다. 차량들은 이 정보를 이용해서 패킷을 전송할 안정적인 경로를 설정한다. NS-2 시뮬레이션을 통해 제안 기법과 GPSR의 성능을 비교했으며, 그 결과 제안 기법이 패킷 전송 성공률 측면에서 우수한 성능을 보임을 알 수 있었다.

• 한국통신학회논문지
• /
• 제34권12C호
• /
• pp.1123-1130
• /
• 2009

네트워크 분야와 멀티미디어 기술의 발전에 따라 실시간 처리에 대한 연구가 각광을 받고 있다. 또한, 많은 용용 분야에서 신뢰도가 높은 실시간 통신에 대한 필요성이 대두되고 있다. 이 논문에서는 큐브 구조를 갖는 다중 컴퓨터에 대한 실시간 통신 알고리즘을 벡터를 이용하여 구현하려고 한다. 큐브 형태의 n 차원 다중 컴퓨터에서 n 개의 안전 벡터는 이웃한 노드들의 결함의 분포와 근사적인 결함의 척도와 관련되어 있다. 이 연구에서는 실시간 채널에서 서로 설정하는 다른 우회 경로를 찾는 알고리즘을 개발한다. 개발한 알고리즘과 기존의 방법들을 비교하여 성능을 분석한다. 시뮬레이션 결과는 이미 제안된 알고리즘과 비교하여 보다 효율적임을 보이고 있다.