• Journal of the Society of Naval Architects of Korea
• /
• v.37 no.2
• /
• pp.70-76
• /
• 2000

A numerical study on the viscous flow around a 2-dimensional circulation control foil is carried out for application on the field of naval architecture and ocean engineering. The governing equations are the RANS and the continuity equations. The equations are discretized by finite difference method and MAC method and the pressure poisson equation is calculate by a SOR method and an O-type non-staggered boundary fitted coordinate system which is overlapped near the slot is used to improve the numerical accuracy. Turbulence is approximated by a modified Baldwin-Lomax turbulence model. In the present paper, the Coanda effect on a 2-dimensional foil of a 20% thickness ellipse with modified rounded trailing edge has been numerically studied. The change in drag and lift of the foil with various jet momentums are calculated and compared to the experimental results to show good agreements.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.941-950
• /
• 2011

In this paper, we analysis the end-to-end performance of the incremental cooperative communication with relay selection. In the conventional cooperative scheme, the source(S) broadcasts the signal to the relay(R) and the destination(D) at 1st phase, and the R forwards the signal to the D at 2nd phase. Although this scheme can improve performance and provide diversity gain, it suffers from decreasing spectrum efficiency. In order to overcome this problem, the incremental cooperative model can be used. In this paper, we study two incremental cooperative method : the first uses ARQ with threshold SNR and the second uses HARQ with channel coding. we also evaluated performance of the incremental cooperative communication based on the R arrangement by using both methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1252-1260
• /
• 1999

The HFC network has a architecture of a star topology in fiber optic trunks, and tree and branch topology is used in the part of coaxial cable. It is well known that the HFC upstream channel is noisy. Ingress, common mode distortion and impulse noise exist in the upstream channel. In order to provide Quality of Service(QoS) to users with real-time data such as voice, video and interactive services, the evolving IEEE 802.14 standard for HFC networks must include an effective priority scheme. The scheme separates and resolves collisions between stations in a priority order. It is important to simulate protocols under a practical environment. The proposed algorithm in this paper is simulated with the assumption that the collision detector made certain mistake due to noises. Simulation results show that the proposed algorithm is more efficient than existing tree-based algorithm under practical environment.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.688-693
• /
• 2014

With the advent of ubiquitous environments, the smart phone has come into wide use and the demand for various content increases. Thus, in order to efficiently utilize limited resources cognitive radio technology is regarded as a possible solution. Besides spectrum sensing or access schemes, the provision of VoIP traffic service for secondary users with limited spectrum resources is a very important issue. In this paper, a resource allocation and control system for VoIP QoS provision in cognitive radio networks is proposed. Firstly, as the system model, the time structure of the network is addressed and, according to the structure, a bandwidth broker is proposed. In addition, based on available bandwidth estimated by the bandwidth broker, a connection admission control for secondary users is developed. It is demonstrated that the provision of VoIP QoS is greatly affected by channel utilization, the number of channels, and the length of timeslot.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.141-152
• /
• 2007

In this paper, we present a network-oriented lightweight real-time system, which is composed of an event-driven operating system called the Embedded Lightweight Operating System (ELOS) and a generic multi hop ad hoc routing protocol suite. In the ELOS, a conditional preemptive FCFS scheduling method with a guaranteed time slot is designed for efficient real-time processing. For more elaborate configurations, we reinforce fault tolerance by supplementing semi-auto configuration using wireless agent nodes. The developed hardware platform is also introduced, which is a scalable prototype constructed using off-the-shelf components. In addition, in order to evaluate the performance of the proposed system, we developed a ubiquitous network test-bed on which several experiments with respect to various environments are conducted. The results show that the ELOS is considerably favorable for tiny ubiquitous networked systems with real-time constraints.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.33-41
• /
• 2007

The IEEE 802.11 DCF channel access function allows single transmission inside two-hop network in order to avoid collisions and eliminate the hidden and exposed terminal problems. Singular transmission capability causes data frames waiting for the entire roundtrip time in the transmitter neighborhood, and results in increased frame latency and lower network throughput. Real-time and pervasive applications are severely affected for the lower medium utilization; especially with high network traffic. This work proposes a new scheme with the help of Frame Aggregation technique in IEEE802.11n and overcomes the single transmission barrier maintaining the basic DCF functionality. Proposed scheme allows parallel transmissions in non-interfering synchronized slots. Parallel transmissions bypass the conventional physical carrier sense and random Backoff time for several cases and reduce the frame latency and increase the medium utilization and network capacity.

• Journal of Digital Contents Society
• /
• v.18 no.7
• /
• pp.1387-1391
• /
• 2017

Cutting power estimation can be used to select appropriate actuators in the design process of machine tools. Therefore, accurate estimation of cutting power is an important part of the design process. In this study, pipe cutting power is first calculated theoretically using the slotting cutting power equation and then verified experimentally. In this case, a pipe cutting machine is used to cut two pipes made of different materials. Power consumptions in the motor during pipe cutting are measured by using the embedded software, Labview, and NI hardware. The slotting cutting power equation can thus be confirmed easily comparing theoretically calculated cutting powers with experimentally measured cutting powers. The pipe materials used in this study are SUS304 and AL6N01. The specific cutting power of AL6N01 material is proposed through our cutting experiment. As a result, this cutting power can be used to design machining tools for AL6N01 material.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2191-2204
• /
• 1997

An efficient packet transmit scheduling algorithm should be able to allocate the resource to each connection fairly based on the bandwidth and quality of service requirements negotiated during the call admission procedure and it should be able to isolate the effects of users that are behaving badly. In this paper, we propose an effective round-robin packet transmit scheduling mechanism, which we call the delay tolerant packet reserving scheme (DTPRS) based on delay QoS requirments. The proposed scheme can not only provide fairness and but also reduce delay, delay variation, and packet loss rate by reserving output link time slots of delay tolerant packets and assigning the reserved slotsto delay urgent packets. Our scheme is applicable to high speed networks including ATM network because it only requires O(1) work to process a packet, and is simple enough to implement.