• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.580-582
• /
• 2002

이동 에이전트는 네트워크 내에서 스스로 이동하면서 사용자 또는 다론 개체 대신 행동할 수 있는 컴퓨터 프로그램을 말하며 이동 에이전트가 적용될 수 있는 분야로는 전자상거래, 정보 검색, 병렬／분산 처리, 네트워크 관리 등이 있다. 본 논문에서는 유휴 컴퓨팅자원뿐만 아니라 개별 사용자에 의해 사용중인 컴퓨팅 자원을 포함하는 분산／병렬 처리 환경에서의 스케줄링 방법에 대해 연구하였다. 컴퓨팅 자원이 사용 중일지라도 부하가 적을 경우 적절한 방법으로 분산처리 환경에 포함시킨다면 전체 컴퓨팅 자원들의 사용율은 증대할 것이다. 본 논문에서는 세 가지 스케줄링 방법을 적용하여 작업 노드들을 그룹으로 구성하고, 이동 에이전트를 통해 작업 그룹에 속한 노드들에게 분해할 수 없는 다수의 작업을 할당하여 처리토록 한다.

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

센서 네트워크는 데이터를 수집하는 싱크 주변에 있는 센서 노드가 극심한 에너지 소비를 보이는 문제가 있다. 이러한 싱크 주변 센서 노드의 에너지 소비 분산을 위해 모바일 싱크를 사용한 데이터 수집방법에 대한 연구가 최근 활발히 진행되고 있다. 모바일 싱크를 사용하여 데이터를 수집하기 위해서는 각 센서 노드별 데이터 수신 순서를 스케줄링하여 각 센서 노드에게 균등한 데이터 전송 기회를 부여하는 것이 중요하다. 본 논문에서는 싱글 홉 센서 네트워크에서 모바일 싱크를 이용한 균등한 데이터 수집을 위한 데이터 가중치 기반 스케줄링기법인 DWEDF를 제안한다. 또한 시뮬레이션을 통해 여러 다른 스케줄링 기법들에 비해 약 1.5배에서 3배가량 높은 성능을 보임으로써 그 효율성을 검증하였다.

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

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

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.633-640
• /
• 2008

Sensor node clustering is one of the most popular research topics to reduce the energy of sensor nodes in wireless sensor networks. Previous researches, however, did not consider prediction effects of sensed environment information on TDMA scheduling of a cluster, resulting energy inefficiency. In this paper, we suggest an energy efficient cluster-based scheduling scheme that can be applied flexibly to many environment information systems. This scheme reflects the environment information obtained at the application layer to the MAC layer to set up the schedule of a cluster. The application layer information sets up the scheduling referring to the similarity of sensed data of cluster head. It determines the data transmission considering the result of similarity. We show that our scheme is more efficient than LEACH and LEACH-C in energy, which are popular clustering schemes, through simulation.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.21-33
• /
• 2008

The wireless sensor nodes near to the fixed sink node suffer from the quickly exhausted battery energy. To address this problem, the mobile sink node has been applied to distribute the energy consumption into all wireless sensor nodes. However, since the mobile sink node moves, the data collection scheduling scheme is necessary for the sink node to receive the data from all sensor nodes as fair as possible. The application fields of wireless sensor network need the real-time processing. If the uneven data collection occurs in the wireless sensor network, the real-time processing for the urgent events can not be satisfied. In this paper, a new method is proposed to support the lair data collection between all sensor nodes. The proposed method performs the scheduling algorithm based on the resident time of the sink node staying in a radius of communication range and the amount of data transferred already. In this paper, the proposed method and existing data collection scheduling schemes are evaluated in wireless sensor network with the mobile sink node. The result shows that the proposed method provides the best fairness among all data collection schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.116-126
• /
• 2015

In a distributed heterogeneous computing system, the performance of a parallel application greatly depends on its task scheduling algorithm. Therefore, in order to improve the performance, it is essential to consider some factors that can have effect on the performance of the parallel application in a given environment. One of the most important factors that affects the total execution time is a critical path. In this paper, we propose the CLTS algorithm for a task scheduling. The CLTS sets the priorities of all nodes to improve overall performance by applying leveling method to improve parallelism of task execution and by reducing the delay caused by waiting for execution of critical nodes in priority phase. After that, it conditionally uses insertion based policy or duplication based policy in processor allocation phase to reduce total schedule time. To evaluate the performance of the CLTS, we compared the CLTS with the DCPD and the HCPFD in our simulation. The results of the simulations show that the CLTS is better than the HCPFD by 7.29% and the DCPD by 8.93%. with respect to the average SLR, and also better than the HCPFD by 9.21% and the DCPD by 7.66% with respect to the average speedup.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.245-252
• /
• 2001

Multicomputer systems achieve high performance by utilizing a number of computing nodes. Multidimensional meshes have become popular as multicomputer architectures due to their simplicity and efficiency. In this paper we propose an efficient processor allocation scheme for 3D torus based on first-fit approach. The scheme minimizes the allocation time by effectively manipulating the 3D information an 2D information using CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the proposed scheme is always smaller than the earlier scheme based on best-fit approach, while allowing comparable processor utilization. The difference gets more significant as the input load increases. To investigate the performance of the proposed scheme with different scheduling environment, non-FCFs scheduling policy along with the typical FCFS policy is also studied.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.18 no.2
• /
• pp.39-47
• /
• 2010

As vehicles become intelligent for convenience and safety of drivers, in-vehicle networking (IVN) systems are essential components of intelligent vehicles. Recently, the chassis networking system which require increased network capacity and real-time capability is being developed to expand the application area of IVN systems. Also, FlexRay has been developed for the chassis networking system. However, FlexRay needs a complex scheduling method of static segment, which is a barrier for implementing the chassis networking system. Especially, if we want to migrate from CAN network to FlexRay network using CAN message database that was well constructed for the chassis networking system by automotive vendors, a novel scheduling method is necessary to be able to reduce design complexity. This paper presents a node-based scheduling method for FlexRay network system. And, in order to demonstrate the method's feasibility, its performance is evaluated through an experimental testbed.