• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.15-21
• /
• 2011

In the range-based localization, the localization accuracy will be high dependent on the accuracy of distance measurement between two nodes. The received signal strength(RSS) is one of the simplest methods of distance measurement, and can be easily implemented in a ranging-based method. However, a RSS-based localization scheme has few problems. One problem is that the signal in the communication channel is affected by many factors such as fading, shadowing, obstacle, and etc, which makes the error of distance measurement occur and the localization accuracy of sensor node be low. The other problem is that the sensor node estimates its location for itself in most cases of the RSS-based localization schemes, which makes the sensor network life time be reduced due to the battery limit of sensor nodes. Since beacon nodes usually have more resources than sensor nodes in terms of computation ability and battery, the beacon node based localization scheme can expand the life time of the sensor network. In this paper, therefore we propose a beacon node based localization algorithm using received signal strength(RSS) and path loss calibration in order to overcome the aforementioned problems. Through simulations, we prove the efficiency of the proposed scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.216-217
• /
• 2015

Duty-cycling could efficiently prolong the life time of Wireless Sensor Networks (WSNs) by let nodes be in dormant state most of the time, and only wake up (for sending or receiving) for a very short period. Flooding is one critical operation of WSNs. Many studies have been studied to improve the delay and/or energy efficiency of flooding. In this paper, we propose a novel time slot design, and the switching decision that reduce energy consumption for the schedule-based flooding tree. Each node, if failed to receive from its parent, will look for other candidate, among its siblings to overhear the flooding packet. By accurately collect information from other siblings, each node can make the best as possible switching decision; therefore the energy efficiency of the network is improved.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.629-636
• /
• 2009

Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network can not operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the life time of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.149-157
• /
• 2012

In WSN environment, the sensor nodes collect sensed data, and transmit data to the BS. BS is difficult to trust the data from unauthenticated nodes. Therefore, many papers have been proposed about the node authentication and the safety of data. In the AM-E paper, data is delivered after node authentication. In this time, the sensor nodes are directly communicated to BS the AREQ/AREP message for authentication. Therefore, the sensor nodes consume more energy for authentication. Also, noes communicate directly with the BS for authentication will have problem due to the limited energy of nodes. In this paper, the same security with AM-E is supported, Furthermore, to minimize the energy consumption, IDE based hierarchical node authentication protocol is proposed. Compared with AM-E, the number of alive nodes is increased about 39%. Thus, the entire network life time is extended and energy efficiency is improved.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.31-40
• /
• 2009

What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.3
• /
• pp.86-91
• /
• 2011

Wireless sensor network (WSN) is a distributed self-organizing network which contains a large number of tiny multi-functional sensor nodes. The network life time is an important issue in WSN because every sensor node has a constraint on electric supply. In this paper, an energy consumption model is described and a GA-based algorithm will be used to optimize the energy consumption by analyzing the working model of sensor nodes. The model will provide an effective reference of working pattern for WSN. This algorithm is evaluated through analysis and simulations.

• Archives of Reconstructive Microsurgery
• /
• v.26 no.1
• /
• pp.1-8
• /
• 2017

Lymphedema is a frequent complication after the treatment of various cancers, particularly breast cancer, gynecological cancers, melanomas, and other skin and urological cancers. Lymphedema patients have chronic swelling of the affected extremity, recurrent infections, limited mobility and decreased quality of life. Once lymphedema develops, it is usually progressive. Over time, lymphedema leads to fat deposition and subsequent fibrosis of the surrounding tissues. However, there is no cure for lymphedema. Recently, the development of microsurgery has led to introduction of new surgical techniques for lymphedema, such as vascularized lymph node transfer. We report here the latest trends in the surgical treatment of lymphedema, as well as diagnosis and conventional treatments of lymphedema.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.61-69
• /
• 2009

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.165-177
• /
• 2009

Embedded database systems (EDBMS) based on NAND flash memories are widely adopted for logging data on sensor nodes. Since write and erase operations of a flash memory are time consuming compared to read operations and wear memory cells, it is important to reduce these operations to enhance the EDBMS performance and to extend the memory life. In this paper, we propose a delayed write scheme to archive this goal. Proposed scheme stores updated parts of database pages into delayed write records to reduce the database page writes. By doing that, it decreases write and erase operations on a flash memory. Therefore, the proposed scheme enhances the logging performance of a write-intensive EDBMS on a sensor node and extends the flash memory life.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.2099-2100
• /
• 2006

제한된 전력의 노드들로 구성된 무선 센서 네트워크에서 효율적인 정보 수집이 이루어지기 위해서는 전체 네트워크의 Life Time을 늘리는 게 중요하다. 각각의 센서 노드들이 멀리 떨어져 있는 BS(Base Station)으로 직접 데이터를 전송하면 전력소비가 매우 크고 비효율 적이다. 그리하여 네트워크의 life time을 늘리기 위한 많은 연구가 이루어지고 있다. 그중에 클러스터링 기법은 가장 널리 연구되는 기법 중에 하나이다. 대표적인 클러스터링 기법 LEACH(Low-Energy Adaptive Clustering Hierarchy)[1]는 전체 노드 수의 5%클 클러스터 헤드로 결정하여 나머지 노드들로부터 데이터를 수집하여 BS로 전송함으로써 에너지를 효율적으로 사용하는 알고리즘이다. 그러나 클러스터 헤드를 결정하는데 있어서 잔여 에너지를 고려하지 않고 순환적으로 결정하는 문제점을 가지고 있다. 그래서 본 논문에서는 SVM(Supprt Vector Machine)을 이용하여 FND(First Node Dic)가 발생했을 때 각 노드들의 에너지 잔량 정도를 따져서 영역을 나눈 후, 에너지가 더 많은 영역에서 클러스터 헤드를 선정하는 방법을 제안한다. 잔량 에너지가 많은 노드를 클러스터 헤드로 결정함으로써 전체 네트워크의 life time을 늘릴 수 있다.