• Applied Chemistry for Engineering
• /
• v.34 no.3
• /
• pp.285-290
• /
• 2023

Poly-lactic acid (PLA) is the most promising polymer in additive manufacturing as an alternative to acrylonitrile butadiene styrene (ABS). Since it is produced from renewable resources such as corn starch and sugar beets, it is also biocompatible and biodegradable. However, PLA has a couple of issues that limit its use. First, it has a comparatively low glass transition temperature of around 60 ℃, such that it exhibits low thermal resistance. Second, PLA has low impact strength because it is brittle. Due to these problems, scientists have found methods to improve the crystallinity and ductility of PLA. Polyethylene glycol (PEG) is one of the most studied plasticizers for PLA to give it chain mobility. However, the blend of PLA and PEG becomes unstable, and phase separation occurs even at room temperature as PEG is self-crystallized. Thus, it is necessary to investigate the optimal mixing ratio of PLA-PEG at the molecular scale. In this study, molecular dynamics will be conducted with various ratios of L-type PLA (PLLA) or DL-type PLA-PEG (PDLA-PEG) systems by using BIOVIA Materials Studio.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2017

Communications for mobile sink groups such as rescue teams or platoons bring about a new challenging issue for handling mobility in wireless sensor networks. To do this, many studies have been proposed to support mobile sink groups. When closely looking at mobile sink groups, they can be divided into (multiple) small groups according to the property of applications. For example, a platoon can be divided into multiple squads to carry out its mission in the battle field. However, the previous studies cannot efficiently support the division of mobile sink groups because they do not address three challenging issues engendered by the mobile sink group division. The first issue is to select a leader sink for a new small mobile sink group. The efficient data delivery from a source to small mobile sink groups is the second issue. Last, the third issue is to share data between leader sinks of small mobile sink groups. Thus, this paper proposes a routing protocol to efficiently support the division of mobile sink groups by solving the three challenging issues. For the first issue, the proposed protocol selects a leader sink of a new small mobile sink group which provide a minimum summation of the distance between the new leader sink and the previous leader sink and the distance from the new leader sink to all of its member sinks. For the efficient data delivery from a source to small mobile sink groups in the second issue, the proposed protocol determines the path to minimize the data dissemination distance from source to small mobile sink group by calculating with the location information of both the source and the leader sinks. With regard to the third issue, the proposed protocol exploits member sinks located among leader sinks to provide efficient data sharing among leaders sinks by considering the location information of member sinks. Simulation results verified that the proposed protocol is superior to the previous protocol in terms of the energy consumption.

• Korean Journal of Environmental Agriculture
• /
• v.26 no.4
• /
• pp.343-350
• /
• 2007

Three different experiments were carried out to investigate the runoff and erosion losses of endosulfan from sloped-field by rainfall. The mobility of endosulfan and which phase it was transported by were examined in adsorption study, the influence of rainfall pattern and slope degree on the pesticide loss were evaluated in simulated rainfall study, and the pesticide losses from soybean-grown field comparing with bare soil were measured in field lysimeter study. Adsorption parameter (K) of endosulfan ranged from 77 to 131 by adsorption method and K values by the desorption method were higher than those by the adsorption method. By the SSLRC's classification for pesticide mobility endosulfan was classified as non-mobile class ($K_{oc}>4,000$). Runoff and erosion loss of endosulfan by three rainfall scenarios ranged from 3.4 to 5.6%and from 4.4 to 15.6%of the amount treated. Endosulfan residues were mainly remained at the top 5 cm of soil depth after the simulated rainfall study. Pesticide loss in case of 30%-slope degree ranged from 0.6 to 0.9 times higher than those in case of 10%-slope degree. The difference of pesticide runoff loss was related with its concentration in runoff water and the difference of pesticide erosion loss would related closely with the quantity of soil eroded. Endosulfan losses from a series of lysimeter plots in sloped land by rainfall ranged from 5 to 35% of the amount treated. The erosion rate of endosulfan from soybean-plots was 66% of that from bare soil plots. The effect of slope conditions was not great for runoff loss, but was great for erosion loss as increasing to maximum $4{\sim}12$ times with slope degree and slope length. The peak runoff concentration of endosulfan in soybean-plots and bare soil plots ranged from 8 to 10 and from 7 to $9{\mu}gL^{-1}$ on nine plots with different slope degree and slope length. Therefore the difference of the peak runoff concentrations between bare soil plots and soybean-plots were not great.

• The Korean Journal of Pesticide Science
• /
• v.10 no.4
• /
• pp.279-288
• /
• 2006

Three different experiments were undertaken to investigate the runoff and erosion loss of diazinon and metolachlor from sloped-field by rainfall. The mobility of two pesticides and which phase they were transported by were examined in adsorption study, the influence of rainfall pattern and slope degree on the pesticide losses were evaluated in simulated rainfall study, and the pesticide losses from soybean field comparing with bare soil were measured in field lysimeter study. Freundlich adsorption parameter (K) ranged $1.6{\sim}2.0$ for metolachlor and $4.0{\sim}5.5$ for diazinon. The K values of pesticides by the desorption method were higher than those ones by the adsorption method. Another parameter (1/n) in Freundlich equation for the pesticides tested ranged $0.96{\sim}1.02$ by desorption method and $0.87{\sim}1.02$ by adsorption method. By the SSLRC's classification for pesticide mobility of diazinon and metolachlor were classified as moderately mobile ($75{\leq}Koc$ <500). Runoff and erosion losses of pesticides by three rainfall scenarios were $0.5{\sim}1.0%$ and $0.1{\sim}0.7%$ for metolachlor and $0.1{\sim}0.6%$ and $0.1{\sim}0.2%$ for diazinon. Distribution of pesticides in soil polite were investigated after the simulated rainfall events. Metolachlor was leached to $10{\sim}15$ cm soil layer and diazinon was leached to $5{\sim}10$ cm soil layer. Losses of each pesticide in the 30% of sloping degree treatment were $0.2{\sim}1.9$ times higher than those ones in the 10% of sloping degree treatment. Pesticide losses from a series of lysimeter plots in sloped land by rainfall ranged $1.0{\sim}3.1%$ for metolachlor and $0.23{\sim}0.50%$ for diazinon, and were $1/3{\sim}2.5$ times to the ones in the simulated rainfall study. The erosion rates of pesticides from soybean-plots were $21{\sim}75%$ lower than the ones from bare soil plots. The peak runoff concentration in soybean-plots and bare soil plots were $1{\sim}9{\mu}gL^{-1}$ and $3{\sim}16{\mu}gL^{-1}$ for diazinon, $7{\sim}31{\mu}gL^{-1}$ and $5{\sim}40{\mu}gL^{-1}$ for metolachlor, respectively.

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

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• Journal of radiological science and technology
• /
• v.37 no.4
• /
• pp.253-259
• /
• 2014

Large volume of $6{\times}6{\times}12mm^3$ CdZnTe ${\gamma}$-ray detector was fabricated with CdZnTe single crystals grown by Traveling Heater Method (THM) to evaluate the energy resolution of 662 keV in $^{137}Cs$. Hole tailing effect which originated from the large mobility difference in electron and hole degrade energy resolution of radiation detector and its effects become more severe for a large volume detectors. Generally, single carrier collection technique is very useful method to remove/minimize hole tailing effect and thereby improvement in energy resolution. Virtual Frisch-grid technique is also one of single charge collection method through weighting potential engineering and it is very simple and easily applicable one. In this paper, we characterized CZT detector grown by THM and evaluated the effectiveness of virtual Frisch-grid technique for a high energy gamma-ray detector. The proper position and width of virtual Frisch-grid was determined from electric field simulation using ANSYS Maxwell ver. 14.0. Energy resolution of 2.2% was achieved for the 662 keV ${\gamma}$-peak of $^{137}Cs$ with virtual Frisch-grid CdZnTe detector.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.414-428
• /
• 2004

Many portable devices are coming to be commercially successful and provide useful services to mobile users. Mobile devices may request a variety of data types, including text and multimedia data, thanks to the rich content of the Internet. Different types of data and/or different classes of users may need to be treated with different qualities of service. The implementation of service differentiation in wireless networks is very difficult because of device mobility and wireless channel contention when the backoff algorithm is used to resolve contention. Modification of the t)mary exponential backoff algorithm is one possibility to allow the design of several classes of data traffic flows. We present a study of modifications to the backoff algorithm to support three classes of flows: sold, silver, and bronze. For example, the gold c]ass flows are the highest priority and should satisfy their required target bandwidth, whereas the silver class flows should receive reasonably high bandwidth compared to the bronze class flows. The mixture of the two different transport protocols, UDP and TCP, in ad hoc networks raises significant challenges when defining backoff algorithm modifications. Due to the different characteristics of UDP and TCP, different backoff algorithm modifications are applied to each class of packets from the two transport protocols. Nevertheless, we show by means of simulation that our approach of backoff algorithm modification clearly differentiates service between different flows of classes regardless of the type of transport protocol.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.984-998
• /
• 1999

최근 개인 휴대 통신에 대한 관심도가 증가하면서 B-ISDN (Broadband Integrated Services Digital Network)과 같은 기존의 유선 망에서 제공하던 다양한 멀티미디어 응용 지원을 무선 망으로 확장시키기 위한 연구가 활발히 진행되고 있다. 그러나 기존의 유선 망에서는 멀티미디어 응용 지원을 위해 QoS (Quality of Service) Provisioning에 관한 많은 연구가 되어 있으나 무선 망에서는 이동성과 무선 전파의 열악한 전송으로 인해 새로운 QoS Provisioning 방법에 관한 연구가 필수적이다. 본 논문에서는 이러한 무선 망의 특수성으로 인해 발생할 수 있는 서비스의 질 저하와 강제 종료를 줄임으로써 지속적인 QoS를 보장해 주고 한정된 무선 자원을 효율적으로 사용하며 처리에 의한 오버헤드를 줄이기 위하여 다음과 같은 세 가지 방법을 제안하였다. 첫째, 핸드오프 강제 종료율을 줄이기 위하여 대역폭 예약 방법을 사용하되 특정 셀의 트래픽 특성에 맞게 또한 시간대에 따른 트래픽 특성에 따라 예약 대역폭의 양을 조절하는 적응적 대역폭 예약 방법이다. 둘째, 많은 경우 각 셀의 트랙픽 변화는 일정한 주기로 변화한다는 특성에 따라 과거의 트래픽 정보를 이용하는 예측 기반의 대역폭 예약 방법이다. 마지막으로 호의 종류, 트래픽 특성, 단말기의 이동 속도에 따라 다른 우선 순위에 의해 호 수락 제어를 수행하는 우선 순위 기반의 호 수락 제어를 제안하였다. 시뮬레이션을 통하여 기존에 제안된 방법과 성능 비교하여, 요구되는 수준의 QoS 보장과 효율적인 자원의 사용, 요구되는 처리비용의 최소화를 통해 전체 시스템의 성능 향상을 입증하였다.Abstract As interest in wireless hand-held terminals and in personal communications services increases recently, there have been broad studies on the ways to support multimedia applications provided in wired networks such as B-ISDN (Broadband Integrated Services Digital Network) in wireless networks. However, since many studies have focused on Quality of Service (QoS) Provisioning in wired networks to provide multimedia applications, new methods of QoS Provisioning are needed in wireless networks to resolve the problem of wireless channel fading and the difficulty of mobility occurred in wireless networks. This paper proposes three schemes of QoS Provisioning in wireless networks which will make continuous QoS guarantee and efficient use of limited wireless resources possible. The first scheme reserves bandwidth in proportion to the amount of real-time traffic in the neighbor cells to decrease the handoff dropping rate of delay sensitive real-time connections, adapting reserved bandwidth for efficient resource utilization. The second scheme is predictive bandwidth reservation scheme that utilizes the past handoff information. It can decrease overheads required to adapt bandwidth reservation. The last scheme is priority-based call admission control prioritizing traffic type (real-time traffic/ non-real-time traffic), connection type (new connection /handoff connection), and mobile terminal speed (fast mobile/slow mobile). Simulation results show that the proposed QoS Provisioning schemes improve the total system performance by achieving three goals - required QoS guarantee, higher bandwidth utilization and less overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.79-89
• /
• 2006

TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.