• Journal of the Korea Society of Computer and Information
• /
• v.23 no.2
• /
• pp.35-43
• /
• 2018

In this paper, we propose a grid-based efficient routing protocol for a mobile sink in wireless sensor networks. In the proposed protocol, the network is partitioned into grids and each grid has a grid head. For the efficient routing to a mobile sink, the proposed protocol uses a mobile sink representative node to send the data to a mobile sink and grid heads are used as a mobile sink representative node. Furthermore, the proposed protocol uses nodes in the boundary of the center grid as position storage nodes. The position storage nodes store the position of a mobile sink representative node and provide source nodes with it for data delivery. With these features, the proposed protocol can reduce a lot of overhead to update the position information and improve the delay of data delivery to a mobile sink. The proposed protocol performs better than other protocols in terms of the delay and the energy consumption per node in the performance evaluation.

• Journal of Sensor Science and Technology
• /
• v.19 no.5
• /
• pp.342-348
• /
• 2010

The wireless sensor networks have been extensively researched. One of the issues in wireless sensor networks is a developing energy-efficient clustering protocol. Clustering algorithm provides an effective way to extend the lifetime of a wireless sensor networks. In this paper, we proposed an energy efficient clustering scheme by adjusting group size. In sensor network, the power consumption in data transmission between sensor nodes is strongly influenced by the distance of two nodes. And cluster size, that is the number of cluster member nodes, is also effected on energy consumption. Therefore we proposed the clustering scheme for high energy efficiency of entire sensor network by controlling cluster size according to the distance between cluster header and sink.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.43-50
• /
• 2018

In this paper, we propose a hexagon model-based efficient beacon frame scheduling approach for wireless sensor networks. The existing beacon frame scheduling approaches use a lot of slots and subslots for the beacon frame scheduling. Thus, the data from source nodes are not efficiently delivered to a sink node. Also in case a sink node needs to broadcast a beacon frame to the nodes in the network, delivering the beacon frame to the network nodes is not efficient as well. Thus, to solve the problem, we use a hexagon model to find the number of slots and subslots for the beacon frame scheduling. By using them for the beacon frame scheduling, the proposed approach performs better than other approaches in terms of the data transmission delay, the number of received data, the beacon transmission delay and the number of relaying the beacon frames.

• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.207-221
• /
• 2005

The proliferation of wireless local area networks (WLANs) offering high data rate in hot spot area have spurred the demand for possible WLANs and third-generation (3G) cellular network integration solutions as the initiative step towards 4G systems. This paper provides a novel architecture for seamless location-aware integration of WLANs into 3G cellular networks and also an analysis for the efficient handover techniques. We introduce location as a key context in secure roaming mechanism for context-aware interworking in 4G systems. The fast secure roaming with location-aware authentication is implemented at an entity called location-aware service (LAS) broker that utilizes the concepts of direction of user and pre-warming zone. The location-ware interworking architecture supports seamless roaming services among heterogeneous wireless networks including WLANs, wireless metropolitan area networks (WMANs), and 3G cellular networks. This paper also includes a description of procedures needed to implement efficient mobility and location management. We show how the LAS broker with pre-warming and context transfer can obtain significant lower latency in the vertical handover.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.429-440
• /
• 2005

As rapid improvement in electronic technologies makes sensor hardware more powerful and capable, the application range of sensor networks Is getting to be broader. The main purpose of sensor networks is to monitor the phenomena in interesting regions (e.g., factory warehouses, disaster areas, wild fields, etc) and return required data. The k Nearest Neighbor (KNN) query that finds k objects which are geographically close to the given point is an Important application in sensor networks. However, most previous approaches are either seem to be impractical or are not energy-efficient in resource-limited sensor networks. In this paper. we propose an efficient KNN query processing method in sensor networks. In the proposed method, we dynamically increase searching boundary, if necessary, and traverse nodes inside the boundary until finding k nearest neighbors. Since only the representative sensor nodes are visited, our algorithm reduces a number of messages. We show thorough experiments that the proposed method performs better than the existing method in various network environments.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.4
• /
• pp.90-98
• /
• 2004

This paper covers the issue of securing ad hoc networks. Such networks exhibit a number of characteristics that make such a task challenging. One of the major challenges is that ad hoc networks typically lack a fixed infrastructure both in form of physical infrastructure such as routers, servers, and stable communication links and in the form of an organizational or administrative infrastructure. Another difficulty lies in the highly dynamic nature of ad hoc networks since new nodes can join and leave the network at any time. The major problem in providing security services in such infrastructure less networks is how to manage the cryptographic keys that are needed. In order to design practical and efficient key management systems it is necessary to understand the characteristics of ad hoc networks and why traditional key management systems cannot be used. These issues are covered and we also present a new efficient key management solutions. Finally we show that the proposed method is more efficient than the previous works through simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2307-2314
• /
• 2008

The study that automates the variety of equipment using the USN(Ubiquitous Sensor Networks) has been executed, and the research field is ranged to almost all fields including a road, harbors. building, military affairs, agriculture and home. By deploying these sensors into the greenhouse environment, we can monitor the environmental change and the growth of plants 24 hours a day. However, the limited resources of a sensor node like limited energy, short transmission range etc, make it difficult to expand the size of the sensor networks. In this paper, we studied to expand the site of sensor networks by using WMN(Wireless Mesh Networks) with simulation. With this simulation, we could validate that using the Wireless Mesh Networks technology for expanding sensor networks is more efficient in the energy aspect than the normal sensor network.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.505-517
• /
• 2020

The increasing size and complexity of deep neural networks (DNNs) necessitate the development of efficient high-performance accelerators. An efficient memory structure and operating scheme provide an intuitive solution for high-performance accelerators along with dataflow control. Furthermore, the processing of various neural networks (NNs) requires a flexible memory architecture, programmable control scheme, and automated optimizations. We first propose an efficient architecture with flexibility while operating at a high frequency despite the large memory and PE-array sizes. We then improve the efficiency and usability of our architecture by automating the optimization algorithm. The experimental results show that the architecture increases the data reuse; a diagonal write path improves the performance by 1.44× on average across a wide range of NNs. The automated optimizations significantly enhance the performance from 3.8× to 14.79× and further provide usability. Therefore, automating the optimization as well as designing an efficient architecture is critical to realizing high-performance DNN accelerators.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1657-1666
• /
• 2010

Underwater wireless sensor networks (UWSN) need stable efficient data transmission methods because of environmental characteristics such as limited energy resource, limited communication bandwidth, variable propagation delay and so on. In this paper, we explain an enhanced hybrid transmission method that uses a hexagon tessellation with an ideal cell size in a two-dimensional underwater wireless sensor network model (2D) that consists of fixed position sensors on the bottom of the ocean. We also propose an energy efficient sensing and communication coverage method for effective data transmission in a three-dimensional underwater wireless sensor network model (3D) that equips anchored sensors on the bottom of the ocean. Our simulation results show that proposed methods are more energy efficient than the existing methods for each model.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.457-458
• /
• 1993