• Corrosion Science and Technology
• /
• v.11 no.3
• /
• pp.71-76
• /
• 2012

Computational fluid dynamics (CFD) is nowadays a powerful and reliable tool for simulating different flow processes and temperature. CFD is used to analyze the various pot geometries and operative variables in 55% Al-Zn pot of CGL. In this research, different strip velocities were assumed and then shown the flow pattern in the pot that was similar in the different strip velocities. Temperature distribution in the pot depended on inductors and inlet strip temperature at the steady condition. Generation of dross particles and transport models were considered to describe dross particles evolution inside the pot. In order to observe dross influence by scrap location, dross particles were generated upon the sink roll. Floating time of dross particles is different by scraper locations above the sink roll.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.306-310
• /
• 2012

Location tracking system represents position by searching objects and humans. In this paper I would like to write about RF chip support Zigbee which is called CC2420. In simulated network circumstance, we can get the information about mobile-node by sending it to sink-node. Position finding is in error by 3m at outdoor environment. The error scale is acceptable within easy range of naked eyes. It can be overcome by using GPS information and Google maps with the wireless networking background.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.213-224
• /
• 2009

Most of existing routing methods in wireless sensor networks to counter the local eavesdropping-based packet-tracing deal with a single asset and suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. Recently, the author proposed a routing method, GSLP-w(GPSR-based Source-Location Privacy with crew size w), that enhances location privacy of the packet-originating node(i.e., active source) in the presence of multiple assets, yet taking a path of not too long. In this paper, we present a refined routing(i.e., next-hop selection) procedure of it and empirically study privacy strength and delivery latency with varying the crew size w(i.e., the number of packets being sent per path). It turns out that GSLP-w offers the best privacy strength when the number of packets being sent per path is randomly chosen from the range [$1,h_{s-b}/4$] and that further improvements on the privacy are achieved by increasing the random walk length TTLrw or the probability prw that goes into random walk(where, $h_{s-b}$ is the number of hops of the shortest path between packet-originating node s and sink b).

• Journal of Digital Convergence
• /
• v.14 no.1
• /
• pp.171-179
• /
• 2016

The energy consumption problem in wireless sensor networks is investigated. The problem is to expend as little energy as possible receiving and transmitting data, because of constrained battery. In this paper, in order to extend the lifetime of the network, we proposed a location-based clustering algorithm for wireless sensor network with skewed-topology. The proposed algorithm is to deploy multiple child nodes at the sink to avoid bottleneck near the sink and to save energy. Proposed algorithm can reduce control traffic overhead by creating a dynamic cluster. We have evaluated the performance of our clustering algorithm through an analysis and a simulation. We compare our algorithm's performance to the best known centralized algorithm, and demonstrate that it achieves a good performance in terms of the life time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.763-770
• /
• 2014

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

• Journal of Korean Society for Atmospheric Environment
• /
• v.13 no.2
• /
• pp.161-170
• /
• 1997

The concentrations of dimethylsulfide (DMS) were determined using samples collected from a station located at Kosan, Cheju Island during two field campaigns held in December 1996 and January 1997. The atmospheric DMS concentrations measured at 6-hr intervals during the entire campaign periods, after excluding a few extreme values, spanned in the range of 14 to 410 pptv with mean and 1 SD value of 127 $\pm$ 94 pptv (N=42). Between two month periods during which the field campaigns were conducted, a notable reduction in DMS levels was observed which was comparable to the dramatic shift in air temperature. A considerable difference was also noted in DMS levels, when data were grouped by day/night basis. The cause of unexpected, high day-to-night DMS ratios is best explained in terms of high efficiency of daytime source processes relative to low efficiency of nighttime sink processes due to the characteristics of the study location. The surface water DMS of the study site, although scarcely measured, also behaved similarly to its atmospheric counterpart with its range from 0.3 to 19 nM (N=11). When correlation analysis was conducted between the atmospheric DMS concentration and other concurrently determined parameters, significant correlations were observed from most basic meteorological parameters such as windspeed, relative humidy, and air temperature. However, the existence of "not-so-strong" correlations between air temperature and DMS concentrations relative to other ones indicated that the effect of temperature on DMS behavior must be reflected in more complicated manners at the study site. The sea-to-air flux of DMS was approximated through an application of the mass-balance flux calculation method of Wylie and de Mora (1996) under the assumption that sink mechanism within the marine boundary layer is in steady-state condition with its counterpart, source mechanism. Based on this estimation method, we reached a conclusion that oceanic DMS emitted from the southwest sea of the Korean Peninsula can amount to approximately 9 $\sim$ 36 Gg S $yr^{-1}$.$yr^{-1}$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.377-385
• /
• 2010

In this paper, we propose a SInk-initiated geographic Multicast (SIM) protocol to reduce frequent location updates from mobile sinks to a source and to achieve fast multicast tree construction and data delivery. The proposed protocol allows sinks to construct their own data delivery paths to a source node and a multicast tree to be atomically constructed by merging the paths. Then, the source forwards data to the destinations down the multicast tree. This paper also propose a round-based virtual infrastructure with a radial shape for increasing the merging probability of data delivery paths and reducing reconstruction ratio of the multicast tree due to mobility of sinks. Simulation results show that the proposed protocol is superior to previous SOurce-initiated geographic Multicast (SOM) protocols in term of average data delivery delay and average energy consumption.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1353-1358
• /
• 2014

Tremendous amount of dummy packets are generally generated for faking over a wireless sensor network so as to keep the location privacy of nodes on the communication paths against the global eavesdropping. In this paper, a scoped-flooding protocol is designed for transferring data between each source and mobile sink(aka, basestation) where, the only nodes within the scope are allowed to issue dummy packets at every idle time so that the location privacy of the nodes on the paths is kept and the amount of dummy packets is reduced to the extend of the flooding scope. The size of the flooding diameter can be taken into consideration of the privacy level and the communication cost. We design a detailed specification of the protocol and verify several properties.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.