• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.69-80
• /
• 2010

Wireless sensor networks (WSN) consisting of a large number of sensors aim to gather data in a variety of environments and are being used and applied to many different fields. The sensor nodes composing a sensor network operate on battery of limited power and as a result, high energy efficiency and long network lifetime are major goals of research in the WSN. In this paper we propose a novel tree-based clustering approach for energy efficient wireless sensor networks. The proposed scheme forms the cluster and the nodes in a cluster construct a tree with the root of the cluster-head., The height of the tree is the distance of the member nodes to the cluster-head. Computer simulation shows that the proposed scheme enhances energy efficiency and balances the energy consumption among the nodes, and thus significantly extends the network lifetime compared to the existing schemes such as LEACH, PEGASIS, and TREEPSI.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.673-677
• /
• 2010

Recently, NAND flash memory has been widely used in embedded systems, personal computers, and server systems because of its attractive features, such as non-volatility, fast access speed, shock resistance, and low power consumption. Due to its hardware characteristics, specifically its 'erase-before-write' feature, Flash Translation Layer is required for using flash memory like hard disk drive. Many FTL schemes have been proposed, but conventional FTL schemes have problems such as block thrashing and block associativity problem. The KAST scheme tried to solve these problems by limiting the number of associations between data block and log block to K. But it has also block thrashing problem in random access I/O pattern. In this paper, we proposed a new FTL scheme, UDA-LBAST. Like KAST, the proposed scheme also limits the log block association, but does not limit data block association. So we could minimize the cost of merge operations, and reduce merge costs by using a new block reclaim scheme, log block garbage collection.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.422-428
• /
• 2009

NAND flash memory is widely used in embedded systems because of many attractive features, such as small size, light weight, low power consumption and fast access speed. However, it requires garbage collection, which includes erase operations. Erase operation is slower than other operations. Further, a block has a limited erase lifetime (typically 100,000) after which a block becomes unusable. The proposed garbage collection policy focuses on minimizing the total number of erase operations, the deviation value of each block and the garbage collection time. NAND flash memory consists of pages of three types, such as valid pages, invalid pages and free pages. In order to achieve above goals, we use a page ratio to decide when to do garbage collection and to select the target victimblock. Additionally, we implement allocating method and group management method. Simulation results show that the proposed policy performs better than Greedy or CAT with the maximum rate 85% of reduction in the deviation value of the erase operations and 6% reduction in garbage collection time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.463-475
• /
• 2009

Flash memory is suitable for real time systems because of its consistent performance for random access, low power consumption and shock resistance. However, flash memory needs blocking time to perform a garbage collection to reclaim invalidated pages. Moreover, the worst-case garbage collection time is significantly longer than the best-case garbage collection time. In this paper, we propose a FTL (Flash Translation Layer) mapping scheme called KAST (K-Associative Sector Translation). In the KAST scheme, user can control the maximum association of the log block to limit the worst-case garbage collection time. Performance evaluation using simulation shows that not only KAST completes the garbage collection within the specified time but also provides about 10~15% better average performance than existing FTL schemes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.436-440
• /
• 2008

In IEEE 802.15.4 beacon-enabled mode, performance decreases as the number of devices competing in the contention access period(CAP) increases. In this letter, we propose partitioned contention access mechanism(PCAM) to compensate performance degradation. In PCAM, the PAN coordinator divides CAP into two sub-periods and activity of devices is delimited in their assigned sub-periods. Since PCAM reduces the number of devices which compete at the same time by half, collision probability between transmitted frames can be reduced. In addition, devices can save their power consumption because PCAM shorten the duration that devices stay in active state into half. We perform simulations to compare the performance of PCAM with that of the IEEE 802.15.4 standard. From the result, PCAM yields better performance than IEEE 802.15.4 standard.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.436-441
• /
• 2011

A TPMS is a wireless communication system designed to monitor its condition inside the pneumatic tires on various types of vehicles. These systems report the tire pressure information to the driver of the vehicle. While wireless communications is used to transmit the measurement data from TPMS sensors to a central processing unit in the vehicle, it suffers from the various interferences such as sensors of each tire or outside electrical equipments. Based on the conventional beamformer, a switching beamforming technique is proposed to minimize the interference and efficiently receive valid data. Moreover, in order to minimize the interference and reduce power consumption for communication, a system with unique Gold Code is presented for each tire. The performance of interference suppression is illustrated by computer simulations.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.640-652
• /
• 2012

Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.163-168
• /
• 2008

Navigation system based on indoor location estimation is one of the core technologies in mobile robot systems. Wireless sensor network has great potential in the indoor location estimation due to its characteristics such as low power consumption, low cost, and simplicity. In this paper we present an algorithm to estimate the indoor location of mobile robot based on wireless sensor network and fuzzy modeling. ZigBee-based sensor network usually uses RSSI(Received Signal Strength Indication) values to measure the distance between two sensor nodes, which are affected by signal distortion, reflection, channel fading, and path loss. Therefore we need a proper correction method to obtain accurate distance information with RSSI. We develop the fuzzy distance models based on RSSI values and an efficient algorithm to estimate the robot location which applies to the navigation algorithm incorporating the time-varying data of environmental conditions which are received from the wireless sensor network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.137-143
• /
• 2009

Through the development of techniques, robots are becomes smaller, and many of robots needed for application are greater and greater. Method of coordinating large number of autonomous robots through local interactions has becoming an important research issue in robot community. Swarm Robot System is a system that independent autonomous robots in the restricted environment infer their status from preassigned conditions and operate their jobs through the coorperation with each other. Within the SRS,a robot contains sensor part to percept the situation around them, communication part to exchange information, and actuator part to do a work. Specially, in order to cooperate with other robots, communicating with other robot is one of the essential elements. In such as Bluetooth has many adventages such as low power consumption, small size module package, and various standard procotols, it is rated as one of the efficent communcating system for autonomous robot is developed in this paper. and How to construct and what kind of procedure to develop the communicatry system for group behavior of the SRS under intelligent space is discussed in this paper.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.5 no.3
• /
• pp.159-167
• /
• 2005

Quantization effects (QEs), which manifests when the device dimensions are comparable to the de Brogile wavelength, are becoming common physical phenomena in the present micro-/nanometer technology era. While most novel devices take advantage of QEs to achieve fast switching speed, miniature size and extremely small power consumption, the mainstream CMOS devices (with the exception of EEPROMs) are generally suffering in performance from these effects. In this paper, an analytical model accounting for the QEs and poly-depletion effects (PDEs) at the silicon (Si)/dielectric interface describing the capacitance-voltage (C-V) and current-voltage (I-V) characteristics of MOS devices with thin oxides is developed. It is also applicable to multi-layer gate-stack structures, since a general procedure is used for calculating the quantum inversion charge density. Using this inversion charge density, device characteristics are obtained. Also solutions for C-V can be quickly obtained without computational burden of solving over a physical grid. We conclude with comparison of the results obtained with our model and those obtained by self-consistent solution of the $Schr{\ddot{o}}dinger$ and Poisson equations and simulations reported previously in the literature. A good agreement was observed between them.