• ETRI Journal
• /
• v.35 no.4
• /
• pp.710-713
• /
• 2013

We propose a new space-time block coding (STBC) for asynchronous cooperative systems in full-duplex mode. The orthogonal frequency division multiplexing (OFDM) transmission technique is used to combat the timing errors from the relay nodes. At the relay nodes, only one OFDM time slot is required to delay for a pair-wise symbol swap operation. The decoding complexity is lower for this new STBC than for the traditional quasi-orthogonal STBC. Simulation results show that the proposed scheme achieves excellent performances.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.468-470
• /
• 1998

최근 영상회의 시스템과 관련하여 해결해야 할 문제 중 데이터 전송시 발생하는 지연에 관한 연구가 진행되고 있다. 본 논문에서는 영상회의 구성을 설명하고 영상회의 시 발생하는 전송 지연을 최소화 방법에 대해서 논한다. 전송 지연을 최소화하기 위해서 근원적으로 오디오와 비디오 데이터를 분리 시켜 전송하므로 전송 시 발생하는 지연을 최소화 시켰다. 또한 이를 효과적으로 지원할 수 있는 동시화 알고리즘을 제안하고, 이 알고리즘을 기반으로 영상회의 시스템을 설계하였다.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.175-177
• /
• 2007

This paper is concerned with a performance analysis using a wired/wireless gateway based on DeviceNet. For the performance analysis, the data transmission time between DeviceNet and the wireless devices is investigated and analyzed. The experimental results show the perfom1ance in terms of the polling/COS service time and end-to-end delay.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.9-17
• /
• 2010

The mobility of nodes are different in wireless ad hoc networks. Routes have to be refreshed frequently due to the mobility of the nodes acting as routers. Path consists of a few highly mobile nodes should be avoided to forward packets, because even only one highly mobile node may result in the break of path. We develop a mobility aware method to evaluate path stability for multipath routing in wireless Ad Hoc networks. Specifically, we extend it to a well-studied multipath routing protocol known as ad hoc on-demand multipath distance vector (AOMDV). The resulting protocol is referred to as path stability evaluation (PSE). Performance comparison of AOMDV with PSE are studied through ns-2. Simulation shows that PSE has optimistic results in performance metrics such as packet delivery, end-to-end delay, routing overhead and throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1903-1911
• /
• 2016

As interest in MANET is increasing nowadays, research upon an efficient MANET routing protocol is actively under way. A LQA(Link Qualty Aware)-AODV routing protocol to deal with frequent changes of topology and wireless link variations under tactical operating conditions is proposed in this paper. The suggested LQA-AODV takes into account the channel capacity of each hop during the route request process of the traditional AODV protocol. In detail, LQA-AODV adds a channel capacity cost value to the RREQ message format that occurs during the routing process of the existing AODV Routing Protocol causing the accumulated channel capacity cost values of each sections to be compared before establishing a route. To verify the performance of LQA-AODV, NS2.35 was utilized and the Link-Quality Model was applied in order to reflect the tactical wireless environment. The simulation compares and analyzes LQA-AODV and the existing AODV, showing a large improvement over the traditional AODV in regards to the Packet Delivery Ratio, and End-to-End Delay.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• Clinical and Experimental Pediatrics
• /
• v.46 no.3
• /
• pp.291-294
• /
• 2003

Ring chromosome 21 causes a multitude of phenotypes, ranging from severe abnormalities to normal. The proposed mechanism of ring formation, breakage of both short and long arms of a chromosome with subsequent end to end fusion, remains unproven. We encountered a 4-year-old boy who presented developmental delay, microcephaly, micrognathia, hypertelorism, low-set ears, mild optic nerve hypoplasia, cleft lip and palate, scoliosis and left foot valgus, but normal brain MRI. Chromosome study from peripheral blood showed 46,XY, r(21)(p11.2q22.1) karyotype. The authors report the first case of ring chromosome 21 in Korea with a review of the literature.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.589-602
• /
• 2012

With the increasing demand for real time applications in the Wireless Senor Network (WSN), real time critical events anticipate an efficient quality-of-service (QoS) based routing for data delivery from the network infrastructure. Designing such QoS based routing protocol to meet the reliability and delay guarantee of critical events while preserving the energy efficiency is a challenging task. Considerable research has been focused on developing robust energy efficient QoS based routing protocols. In this paper, we present the state of the research by summarizing the work on QoS based routing protocols that has already been published and by highlighting the QoS issues that are being addressed. The performance comparison of QoS based routing protocols such as SAR, MMSPEED, MCMP, MCBR, and EQSR has also been analyzed using ns-2 for various parameters.

• Proceedings of the KSMRM Conference
• /
• 2003.10a
• /
• pp.44-44
• /
• 2003

To determine feasibility of contrast-enhanced MRI (co-MRI) at true end-diastole (ED) free from limitation of time for inversion-recovery and trigger window for quantifying transmural extent of infarction. 대상 및 방법： MRI was performed in 18 patients with myocardial infarction. Cine imaging and co-MRI with same registered slices in short axis were peformed. To allow true ED co-MRI, ECG synchronization should use two RR-intervals for one acquisition of a segment of k-space by setting the heart rate to half that of the true heart rate. Trigger delay time was adjusted to the RR-interval for imaging at ED and to the sum of RR-interval plus the time between R-wave and the end-systole (ES) determined in cine images for imaging at ES.