• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.223-228
• /
• 2012

There are many algorithms to improve the network traffic and to avoid losing packets in the network. This paper proposed determining the shortest paths for hops, which are in the middle of the source and destination. The shortest path in this paper means the fastest path between them. Recently, dynamic routing algorithm is currently used now but this paper suggests the fastest paths between the source and the destination is by using the record of the network traffic history. People are using the networking and the network traffic is always corresponding to how many people use the networking in specific time. Therefore, I can predict the network condition by referring to the history of network traffic record, and then the shortest path can be produced without using RIP too much. It will be helpful to improve the network traffic.

• Journal of Biomedical Engineering Research
• /
• v.18 no.2
• /
• pp.147-156
• /
• 1997

Various prosthetic heart valves have been developed and used clinically, but they have problems, such as thrombogenecity, hemoltsis, high cost and low durability. New types of trileaflet polymer heart valves have been developed in order to use them as inlet and outlet valves in a ventricular assist device. The aim of this study is to determine the hydrodynamic effectiveness of the newly designed trileaflet polymer valves and their feasibility for temporary use in the blood pumps. Trileaflet polymer valves are made of polyurethane, because of its good blood compatibility, high tonsil strength and good resistance to fatigue. An in vitro experimental investigation was perf'ormed in order to ev91ua1e hydrodynamic performance of the trileaflet polymer valves having different design and fabrication tech- niques. The St. Jude Medical valve (SJMV) and floating-type monoleaflet polymer valve (MLPV) were also tested The pressure drop across the valve, leakage volume, and the flow patterns mere investigated for valves. The result of comparative tests showed that the trileaflet polymer valves had a better hydrodynamic performance than the others. TPV which has two stable membrane shape showed the lowest back flow. The pressure hops of TPVs were lower than that of MLPV, but slightly higher than SJMV. The hydrodynamic performance of valves under the pulastile flow showed the similar results as steady flow. The velocity profiles and turbulent intensities were measured at the distal sites of valves using a hot-film anemometer. Central flow was maintained in trileaflet polymer valves, and the maximum turbulent intensities were lower in TPVs comparing to MLPV.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.14-19
• /
• 2009

In Mobile Ad-hoc Network, link failure and packet loss may occur frequently due to its nature of mobility and limited battery life. In this paper, an enhanced robust routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance is presented. If the node movement is detected, the routing agent switches local path to its neighbor node. Simulation results show that the performance of the proposed routing scheme is superior to previous AODV protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.18-26
• /
• 2009

Various relay technologies have been considered in wireless communication systems to enlarge the coverage and to enhance the system throughput. However, the coverage is limited by its modulation levels and additional time slot(s) is required for relaying. In the paper, by applying the hierarchical modulation to two-relay systems, two-hop relaying can be implemented instead of three hops, and both throughput and coverage can be enhanced. Throughout simulation analysis, the coverage extension is evaluated for different modulation levels and the total throughput is increased by up to two times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.30-35
• /
• 2002

Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

• Journal of information and communication convergence engineering
• /
• v.16 no.2
• /
• pp.84-92
• /
• 2018

For large wireless sensor networks running on battery power, the time synchronization of all sensor nodes is becoming a crucial task for waking up sensor nodes with exact timing and controlling transmission and reception timing. However, as network size increases, this synchronization process tends to require long processing time consume significant power. Furthermore, a naïve synchronization scheduler may leave some nodes unsynchronized. This paper proposes a power-efficient scheduling algorithm for time synchronization utilizing the notion of density, which is defined by the number of neighboring nodes within wireless range. The proposed scheduling algorithm elects a sequence of minimal reference nodes that can complete the synchronization with the smallest possible number of hops and lowest possible power consumption. Additionally, it ensures coverage of all sensor nodes utilizing a two-pass synchronization scheduling process. We implemented the proposed synchronization algorithm in a network simulator. Extensive simulation results demonstrate that the proposed algorithm can reduce the power consumption required for the periodic synchronization process by up to 40% for large sensor networks compared to a simplistic multi-hop synchronization method.

• Journal of Korea Multimedia Society
• /
• v.22 no.8
• /
• pp.913-922
• /
• 2019

The Internet of Things (IoT) envisions smart objects collecting and sharing data at a massive scale via the Internet. One challenging issue is how to disseminate data to relevant data consuming objects efficiently. In such a massive IoT network, Mission critical data dissemination imposes constraints on the message transfer delay between objects. Due to the low power and communication range of IoT objects, data is relayed over multi-hops before arriving at the destination. In this paper, we propose a quorum-based adaptive dissemination algorithm (QADA) for the critical data in the monitoring-based applications of massive IoTs. To design QADA, we first design a new stepped-triangular grid structures (sT-grid) that support data dissemination, then construct a triangular grid overlay in the fog layer on the lower IoT layer and propose the data dissemination algorithm of the publish/subscribe model that adaptively uses triangle grid (T-grid) and sT-grid quorums depending on the mission critical in the overlay constructed to disseminate the critical data, and evaluate its performance as an analytical model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.848-850
• /
• 2014

Mobile Ad hoc Networks(MANET) is consist of node that has mobility, MANET build cluster formation for using energy efficient. In existing LEACH algorithm elect cluster head node in coverage area by distribution function. However, when the cluster head node, that elected by distribution function, is divided coverage area unevenly, the network can't consumption energy efficiency. To solve this problem, we proposed CSWC(Coverage Scheduling Weight-value Control) algorithm. When the coverage area is divided nonchalance, proposed algorithm increased number of hops, that determines coverage area, for balance coverage area. As the result proposed algorithm is set balance coverage area, the network consumption energy efficiency.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.59.2-59.2
• /
• 2019

Event Horizon Telescope (EHT) aims to resolve the innermost region to the super massive black hole (SMBH) with its extremely high angular resolution (~20-25 uas) and enhanced sensitivity (down to 1-10 mJy) in concert with the Atacama Large Millimeter/submillimeter Array (ALMA) at 1.3 mm wavelength. This has a great importance as the first observational probe of the black hole shadow which has been theoretically predicted as a ring-like emission affected by the general relativistic effect under a strong gravitational field of SMBH. During the 2017 April 5-11, four nights of EHT observing campaign were carried out towards its primary targets, M87 and $SgrA{\ast}$. To robustly ensure the data processing, independent pipelines for various radio data calibration softwares (e.g., AIPS, HOPS, CASA) have been developed and cross-compared each other. The EHT has also been developing newer interferometric imaging techniques (e.g., eht-imaging-library, SMILI, dynamical imaging), as well as using an established method (CLEAN). With these, the EHT has designed various strategies which will be adopted for convincing imaging results. In this talk, I review how the robustness of EHT data processing and imaging will be validated so that the results can be ensured against well known uncertainties or biases in the interferometric data calibration and imaging.