• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.240-244
• /
• 2006

무선 센서 네트워크의 노드들은 소형으로써 배터리로 작동하고, 사용자로부터 원거리 또는 산악지대와 같이 배터리 교체가 쉽지 않은 곳에 배치되기 때문에 한정된 에너지를 효율적으로 사용하는 기술이 매우 중요하다. 이를 위해서 같은 지역에 대해 중첩되게 센싱하고 있는 노드들이 있다면 적정한 수의 노드만 활동하게 하고 나머지는 활동하지 않게 함으로써 노드들의 에너지 사용 효율을 높일 수 있다. 본 논문에서는 센서 노드가 유효센싱범위(ESA, Effective Sensing Area)를 계산하여 threshold초과 여부에 따라 working/sleeping하도록 함으로써 중첩되는 센싱범위를 최소화 하고 전체 센싱 커버리지를 유지시키면서 네트워크 수명을 증가시키는 스케줄링 프로토콜을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.495-497
• /
• 2013

Wireless sensor networks (WSNs) have emerged as an attractive and key research area over the last decade. Time synchronization is a vital part of infrastructure for any distributed system. In embedded sensor networks, time synchronization is an essential service for correlating data among nodes and communication scheduling. This is realized by exchanging messages that are time stamped using the local clocks on the nodes. Various time synchronization protocols have been proposed aiming to attain high synchronization accuracy, high efficiency and low communication overhead. However, it requires that the time between resynchronization intervals to be as large as possible to obtain a system which is energy efficient having low communication overhead. This paper presents a simple but effective skew compensation algorithm that measures the skew rate of the sensor nodes with respect to the reference node and calibrates itself to compensate for the difference in the frequencies of the nodes. The proposed method can be incorporated with any existing time synchronization protocol for WSNs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.107-116
• /
• 2011

In this paper, a traffic adaptive sleep based medium access control (TAS-MAC) protocol for wireless sensor networks (WSNs) is proposed. The protocol aims for WSNs which consist of clustered sensor nodes and is based on TDMA-like schema. It is a typical schedule based mechanism which is adopted in previous protocols such as LEACH and Bit-Map Assisted MAC. The proposed MAC, however, considers unexpected long silent period in which sensor nodes have no data input and events do not happen in monitoring environment. With the simple traffic measurement, the TAS-MAC eliminates scheduling phases consuming energy in previous centralized approaches. A frame structure of the protocol includes three periods, investigation (I), transmission (T), and sleep-period (S). Through the I-period, TAS-MAC aggregates current traffic information from each end node and dynamically decide the length of sleep period to avoid energy waste in long silent period. In spite of the energy efficiency of this approach, the delay of data might increase. Thus, we propose an advanced version of TAS-MAC as well, each node in cluster sends one or more data packets to cluster head during the T-period of a frame. Through simulation, the performance in terms of energy consumption and transmission delay is evaluated. By comparing to BMA-MAC, the results indicate the proposed protocol is more energy efficient with tolerable expense in latency, especially in variable traffic situation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.16-27
• /
• 2017

IEEE 802.15.6 standard, a Wireless Body Area Network, aims to transfer not only medical data but also non-medical data, such as physical activity, streaming, multimedia game, living information, and entertainment. Services which transfer those data have very various data rates, intervals and frequencies of continuous access to a medium. Therefore, an efficient anti-collision operations and medium assigning operation have to be carried out when multiple nodes with different data rates are accessing shared medium. IEEE 802.15.6 standard for CSMA/CA medium access control method distributes access to the shared medium, transmits a control packet to avoid collision and checks status of the channel. This method is energy inefficient and causes overhead. These disadvantages conflict with the low power, low cost calculation requirement of wireless body area network, shall minimize such overhead for efficient wireless body area network operations. Therefore, in this paper, we propose a medium access scheduling scheme, which adjusts the time interval for accessing to the shared transmission medium according to the amount of data for generating respective sensor node, and a priority control algorithm, which temporarily adjusts the priority of the sensor node that causes transmission concession due to the data priority until next successful transmission to ensure fairness.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.348-357
• /
• 2007

One of the major issues in recent researches on wireless sensor networks is to reduce energy consumption of sensor nodes operating with limited battery power, in order to lengthen their lifespan. Among the researches, we are interested in the schemes in which a sensor node periodically turns on and off its radio and requires information on the time when its neighbors will wake up (or turn on). Clock synchronization is essential for wakeup scheduling in such schemes. This paper proposes three methods based on the asynchronous averaging algorithm for clock synchronization in sensor nodes which periodically wake up: (1) a fast clock synchronization method during an initial network construction period, (2) a periodic clock synchronization method for saving energy consumption, and (3) a decision method for switching the operation mode of sensor nodes between the two clock synchronization methods. Through simulation, we analyze maximum clock difference and the number of messages required for clock synchronization.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.255-264
• /
• 2011

A sensor network is a special network that makes physical data sensed by sensor nodes and manages the data. The sensor network is a technology that can apply to many parts of field. It is very important to transmit the data to a user at real-time. The core of the sensor network is a sensor node and small operating system that works in the node. TinyOS developed by UC Berkeley is a sensor network operating system that used many parts of field. It is event-driven and component-based operating system. Basically, it uses non-preemptive scheduler. If an urgent task needs to be executed right away while another task is running, the urgent one must wait until another one is finished. Because of that property, it is hard to guarantee real-time requirement in TinyOS. According to recent study, Priority Level Scheduler, which can let one task preempt another task, was proposed in order to have fast response in TinyOS. It has restrictively 5 priorities, so a higher priority task can preempt a lower priority task. Therefore, this paper suggests Preemptive EDF(Earliest Deadline First) Scheduler that guarantees a real-time requirement and reduces average respond time of user tasks in TinyOS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.647-650
• /
• 2006

무선 센서 네트워크에서는 다른 네트워크보다 전력 공급이 큰 제약으로 작용하고 있는데, 본 논문에서는 클러스터를 기반으로 하는 프로토콜에서 클러스터를 구성하는 센서 노드의 밀도에 따라서 클러스터 헤더에게 데이터를 전송하는 노드 수를 조정하는 방법을 제안한다. 제안하는 스케줄링 개념은 노드 밀도가 큰 클러스터에서는 클러스터 멤버 노드들의 라운드 당 데이터 전송 회 수를 줄임으로써 전송 에너지 소모를 줄일 수 있으며 네트워크 전체의 라이프 타임을 증가 시킬 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.691-699
• /
• 2014

In order to increase network lifetime, duty-cycle MAC protocols which can reduce energy consumption caused by idle listening is proposed for WSNs. In common duty-cycle MAC protocols, each sensor node calculates its duty-cycle interval based on the current amount of residual energy. However, in WSNs with the capability of energy harvesting, existing duty-cycle intervals based on the residual energy may cause the sensor nodes which have high energy harvesting rate to suffer unnecessary sleep latency. Therefore, a duty-cycle scheduling scheme which adjust the duty-cycle interval based on both of the residual energy and the energy harvesting rate was proposed in our previous work. However, since this duty-cycle MAC protocol overlooked the performance variation according to the change of duty-cycle interval and adjusted the duty-cycle interval only linearly, the optimal duty-cycle interval could not be obtained to meet application requirements. In this paper, we propose three methods which calculate the duty-cycle interval and analyse their results. Through simulation study, we verify that network lifetime, end-to-end delay and packet delivery ratio can be improved up to 23%, 44% and 31% as compared to the existing linear duty-cycle scheduling method, respectively.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1285-1298
• /
• 2010

Since the TinyOS incorporating a non-preemptive task scheduling policy uses a FIFO (First-In First-Out) queue, a task with the highest priority cannot preempt a task with lower priority before the task with lower priority must run to completion. Therefore, the non-preemptive TinyOS cannot guarantee the completion of real-time user tasks within their deadlines. Additionally, the non-preemptive TinyOS needs to meet the deadlines of user tasks as well as those of TinyOS platform tasks called by user tasks in order to guarantee the deadlines of the real-time services requested by user tasks. In this paper, we present a group-based real-time scheduling technique that makes it possible to guarantee the deadlines of real-time user tasks in the TinyOS incorporating a non-preemptive task scheduling policy. The proposed technique groups together a given user task and TinyOS platform tasks called and activated by the user task, and then schedule them as a virtual big task. A case study shows that the proposed technique yields efficient performance in terms of guaranteeing the completion of user tasks within their deadlines and aiming to provide them with good average response time, while maintaining the compatibility of the existing non-preemptive TinyOS platform.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.753-760
• /
• 2017

In this paper, we propose a new method to improve the performance of a Quorum-based NDP (Neighbor Discovery Protocol) in heterogeneous wireless sensor networks. It creates a new set of discovery schedules by combining two different Quorum-based matrices. The original Quorum-based schedule guarantees only two overlapping active slots with a cycle, but the newly created matrix greatly increases the chance of neighbor discovery. Therefore, although the size of the combined matrix of the proposed method increases, the number of discovery chances with neighboring nodes considerably increases, and the new approach is superior to the original Quorum-based neighbor node discovery protocol. In this study, we compares the performance of the proposed method to the Quorum-based protocols such as SearchLight and Hedis using TOSSIM. We assume all sensor nodes operates in a different duty cycle in the experiment. The experimental results show that the proposed algorithm is superior to other Quorum-based methods.