• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.231-242
• /
• 2009

The EPC-Discovery Service (EPC-DS) is a good representative of the RFID Track & Trace. But this mechanism has several problems. EPC-DS uses centralized server scheme which may arise bottle-neck state and that cannot provide detail trace information of a RFID object. In addition, a trace node requires direct access method to a RFID object or an element which has information of the RFID object for Track & Trace. In this paper, we propose a novel RFID Track & Trace mechanism which based on the SIP presence model and SIP event notification. This mechanism can provide detail trace information and monitoring function, and also can rid the bottle-neck section by combination of SIP methods instead of centralized element.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.02a
• /
• pp.436-437
• /
• 2012

Double patterning technology (DPT) has been suggested as a promising candidates of the next generation lithography technology in FLASH and DRAM manufacturing in sub-40nm technology node. DPT enables to overcome the physical limitation of optical lithography, and it is expected to be continued as long as e-beam lithography takes place in manufacturing. Several different processes for DPT are currently available in practice, and they are litho-litho-etch (LLE), litho-etch-litho-etch (LELE), litho-freeze-litho-etch (LFLE), and self-aligned double patterning (SADP) [1]. The self-aligned approach is regarded as more suitable for mass production, but it requires precise control of sidewall space etch profile for the exact definition of hard mask layer. In this paper, we propose etch end point detection (EPD) in spacer etching to precisely control sidewall profile in SADP. Conventional etch EPD notify the end point after or on-set of a layer being etched is removed, but the EPD in spacer etch should land-off exactly after surface removal while the spacer is still remained. Precise control of real-time in-situ EPD may help to control the size of spacer to realize desired pattern geometry. To demonstrate the capability of spacer-etch EPD, we fabricated metal line structure on silicon dioxide layer and spacer deposition layer with silicon nitride. While blanket etch of the spacer layer takes place in inductively coupled plasma-reactive ion etching (ICP-RIE), in-situ monitoring of plasma chemistry is performed using optical emission spectroscopy (OES), and the acquired data is stored in a local computer. Through offline analysis of the acquired OES data with respect to etch gas and by-product chemistry, a representative EPD time traces signal is derived. We found that the SE-EPD is useful for precise control of spacer etching in DPT, and we are continuously developing real-time SE-EPD methodology employing cumulative sum (CUSUM) control chart [2].

• The Journal of the Korea Contents Association
• /
• v.12 no.7
• /
• pp.21-28
• /
• 2012

The data centric storage (DCS) scheme is one of representative methods to efficiently store and maintain data generated in wireless sensor networks. In the DCS schemes, each node has the specified data range for storing data. This feature is highly vulnerable to the faults of nodes. In this paper, we propose a new recovery scheme for the lost data caused by the faults of nodes in DCS environments. The proposed scheme improves the accuracy of query results by recovering the lost data using the spatial continuity of physical data. To show the superiority of our proposed scheme, we simulate it in the DCS environments with the faults of nodes. In the result, our proposed scheme improves the accuracy by about 28% through about 2.5% additional energy consumption over the existing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.453-461
• /
• 2010

A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

• Journal of Life Science
• /
• v.23 no.7
• /
• pp.847-853
• /
• 2013

The genus Hemerocallis (family Xanthorthoeaceae) is a herbaceous species, some of which are very important in herbal medicines. We evaluated the rps16-trnK region of the chloroplast DNA of a representative sample of eight taxa in Korea to estimate phylogenetic relationships within the taxa of this genus. Due to differences in the number of inserted nucleotides, the aligned data for Hemerocallis ranged from 729 (H. aurantiaca) to 742 nucleotides (H. fulva var. kwanso), with a mean of 736. Although several small indels and 20 inserts were present, sequence variation within the Hemerocallis genus was mostly due to nucleotide substitutions. All rps16-trnK trees generated in Korea exhibited a well-solved topology, with high bootstrap support, irrespective of the methods (parsimony) and the setting used. The node of H. minor and H. littorea was strongly supported, with a high bootstrap value in three trees, and these two taxa were sistered with H. thunbergii. The number of chromosomes was not congruent with that found in a previous study with RAPD, but the number was in agreement with the results of this study.

• The Journal of the Korea Contents Association
• /
• v.13 no.4
• /
• pp.73-85
• /
• 2013

This study examines the online social capital of local press using the website and social media. Moreover, the paper respectively visualizes web feature as Web 1.0 and social feature analysis as Web 2.0 by applying correspondence analysis. For data, the study analyzes 10 representative local press in Yeungnam areas. To collect the data, two coders coded web features from the websites and we employed NodeXL, an open-source software tool, for social media data. The results reveal that local websites expend online social capital using social media account. Especially, the social features of local presses attach importance to Twitter as the main press keep the well-balance use among all platforms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.493-496
• /
• 2011

Currently in the development of community wireless technology is gaining interest in location-based services and as a result, the importance of the location information is a growing trend. To calculate the location information is being suggested several ways, among them Trilateration is representative. Trilateration is three beacon nodes, the distance between the location in which you want to calculate with information. Beacon from a node to know where to get information when the distance between the obstacle and the distance error caused by the surrounding environment, which leads to the exact location can not be obtained. Currently due to distance error, location information has a variety of algorithms to reduce the error. However, a systematic analysis of these algorithms is not progress. This paper analyzes the location-aware technologies, and the error the distance of the location information to reduce errors in the various aspects of the algorithm for the systematic and empirical comparison was evaluated through the analysis.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.647-654
• /
• 2002

Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other supporting communication facilities (such as base stations, etc.). Therefore, the topology of an Ad-hoc network frequently changes due to the movement of mobile host, which nay lead to sudden packet loss. Recently, the large amount of research has focused on the routing protocols needed in such an environment. In this paper, TCP Reno, Sack, and Tahoe versions are analysed using DSR protocol which is the representative On-Demand routing protocol in Ad-hoc wireless network. As the result of this simulation, we know that TCP Reno relatively has higher throughput than that of Sack and Tahoe, and TCP Reno has more stable performance than that of TCP Tahoe and Sack, regardless of the speed of mobile node and the size of topology.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.