• Journal of the Korean Society of Visualization
• /
• v.6 no.1
• /
• pp.34-40
• /
• 2008

The flow characteristics in a confined slot jet impinging on a flat plate were investigated in low Reynolds number regime (Re$\leq$1,000) by using time-resolved particle image velocimetry technique. The jet Reynolds number was varied from 404 to 1026, where it is presumed that the transient regime exists. It is found that the vortical structures in the shear layer are developed with increasing Reynolds number and that the jet remains steady at the Reynolds number of 404. Vortical structures and their temporal evolution are verified and the results were compared with previous numerical studies.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.91-92
• /
• 2003

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.530-530
• /
• 1999

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.85-85
• /
• 2000

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.5
• /
• pp.21-30
• /
• 2011

In this paper, we propose a real-time service based on retransmission slot in low rate WPAN. In the proposed scheme, during the communication period of the beacon-enabled mode in LR-WPAN standard, a special GTSs is dynamically assigned for retransmission of the packet that fails during a real-time service such as voice. This provides a time diversity in the severe channel error environments to support the required QoS. Analytical results show that this scheme achieves a much higher throughput and better transmission success rate per GTS slot than conventional schemes such as a common reserved scheme in LR WPAN.

• Journal of Astronomy and Space Sciences
• /
• v.28 no.4
• /
• pp.345-354
• /
• 2011

Earth acquisition is to solve when earth can be visible from satellite after Sun acquisition during launch and early operation period or on-station satellite anomaly. In this paper, the algorithm and test result of the Communication, Ocean and Meteorological Satellite (COMS) Earth acquisition are presented in case of on-station satellite anomaly status. The algorithms for the calculation of Earth-pointing attitude control parameters including those attitude direction vector, rotation matrix, and maneuver time and duration are based on COMS configuration (Eurostar 3000 bus). The coordinate system uses the reference initial frame. The constraint calculating available time-slot to perform the earth acquisition considers eclipse, angular separation, solar local time, and infra-red earth sensor blinding conditions. The results of Electronics and Telecommunications Research Institute (ETRI) are compared with that of the Astrium software to validate the implemented ETRI software.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.1
• /
• pp.53-59
• /
• 2007

Wimedia UWB(Ultra-Wideband) platform provides data rates up to 480Mbps in WPAN (Wireless Personal Area Network). Wimedia conformant devices access to the channels through superframe concept for communications. As the channel resource is limited, the optimal channel time required for each device needs to be estimated to share the resource efficiently among the devices. In this paper, we propose a scheme to estimate the required channel time in a super frame to satisfy the QoS of the application on a device. The channel time is estimated from the service rate which is computed from the TSPEC of the application. In the process of the estimation, we take the frame overhead for data transmission as well as the overhead due to the acknowledgement scheme, preamble, and MDSU size into consideration. We also analyze and compare the throughputs for different acknowledgement scheme, preamble, and MDSU size situations. The estimated channel time required for a given service rate is allocated in the unit of MAS(Medium Access Slot).

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.33-40
• /
• 2015

The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1567-1576
• /
• 2015

This paper proposes a reliable real-time data dissemination protocol for mitigating transmission failure of real-time data in WSNs. The re-transmission is well-known for recovery of transmission failure, but this may violate the real-time requirement by transmission delay. To solve this problem, the proposed protocol exploits broadcasting nature and temporal opportunity allocation. In a radio-range of sending node, there may be neighbors satisfying the real-time requirement. The neighbors of specific node could receive data simultaneously by broadcasting, and decide their priority using temporal opportunity allocation method. The method uses time slot and tolerable time. The time slot specifies the priority and transmission deadline for each neighbors, and the tolerable time is the real-time requirement at the sending node. By giving the priority to the node with shorter tolerable time in each slot, we may get more opportunities to forward toward the destination. In other words, even if a node have the longer tolerable time, it still has a chance to forward with the real-time requirement. Simulation results show that the proposed protocol is superior to the existing protocols.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.15-23
• /
• 2008

In this paper, an algorithm, that provisions absolute differentiation of packet delays is proposed, simulated, and implemented with VHDL on XPC 860 CPU based test board with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through both simulation and the real traffic test on the board that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.