• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.4
• /
• pp.76-86
• /
• 2013

As the basic Kalman filter is limited to be used for indoor navigation, and particle filters incur serious computational overhead, especially in mobile devices, we propose an adaptive hybrid filter for WiFi-based indoor positioning systems. The hybrid filter utilizes the same prediction framework of the basic Kalman filter, and it adopts the notion of particle filters only using a small number of particles. Restricting the predicts of a moving object to a small number of particles on a way network and substituting a dynamic weighting scheme for Kalman gain are the key features of the filter. The adaptive hybrid filter showed significantly better accuracy than the basic Kalman filter did, and it showed greatly improved performance in processing time and slightly better accuracy compared with a particle filter.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.968-972
• /
• 2009

The multi-core processors are being widely exploited by many high-end systems. With significant advances in processor architecture, the network band-width required on the high-end systems is increasing drastically. It is therefore highly desirable to manage multiple cores efficiently to achieve high network band-width with minimum resource requirements. Modern operating systems, however, still have significant design and optimization space to leverage the network performance over multi-core systems. In this paper, we suggest a novel networking process scheduling scheme, which decides the best processor affinity of networking processes based on the processor cache layout, communication intensiveness, and processor loads. The experimental results show that the scheduling scheme implemented in the Linux kernel can improve the network bandwidth and the effectiveness of processor utilization by 20% and 59%, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.816-823
• /
• 2010

Recently research efforts for ubiquitous technology that includes RFID(Radio Frequency Deification and sensor networks are conducted very actively The architectural framework of the USN sensor network discovery service. The survey of the USN technology is conducted on four technological visions that contain USN system technology USN networking technology and USN middleware along with the service platform, With respect to each technological division domestic and worldwide leading research projects are primarily explored with their technical features and research projects are primarily explored with their technical features and research outputs. Boasted on the result of the survey we establish a USN software model that includes data sensing, sensor data storage sensor data storage sensor data naming and sensor feed name service. This main objective of this model is to provide a reference model for the facilitation of USN application developments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.6
• /
• pp.809-814
• /
• 2011

The major resource problem in sensor networks is energy efficiency. There are two major access methods to efficiently use energy. The first is to use dynamic power management (DPM). The second is to use energy efficient protocols. In DPM methods, the OS, the power manager, is responsible for managing the proper power state of CPU and each I/O with respect to the events, but the OS is not largely concerned about the internal operation of each network protocols. Also, energy efficient protocols are mainly focused on the power saving operation of the radio PHY. In addition, in wireless sensor network most of tasks are connected to communication. In such a situation, traditional power managers can waste unpredicted power. In this paper, we introduce an efficient power manger that can reduce a lot of unwanted power consumption through cooperative power management (CPM) in communication-related tasks between each units, such as radio, sensing unit, and CPU, for ad hoc wireless sensor nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.187-195
• /
• 2008

In MANET, it is important to efficiently manage data objects and traffic to improve network throughput and response time. This paper proposes a connection-degree based data object search and replication scheme in mobile ad-hoc networks. In this method, information about the path data object providers is stored at the cache of a cluster header at which lots of queries arrive, so that, to reduce the load of the cluster header, replicas can be created at its neighboring nodes. The method proposes an algorithm that picks up a cluster header among mobile nodes and makes it possible to search for and utilize adaptive and up-to-date information in MANET. The method is expected to be effective since it enables access to data objects in spite of broken links among mobile nodes with an enhancement in network response time of searching and a decrease in communication costs. The efficiency of this system was verified via simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.5
• /
• pp.91-98
• /
• 2020

The mobile agent, which handles a given task while migrating between the sensor nodes, moves including the execution commands and task processing results. This increases the size of the mobile agent, causing the network to load, leading to the migration time delay and the loss of migration reliability. This paper presents the method of lightening the mobile agent using distributed object technology and the algorithm for exploring and providing the optimal migration path that is actively performed in the event of network traffic, and it proposes a method to ensure the reliability of the mobile agent migration by applying them. In addition, through the comparative analysis experiments based on agent size and network traffic for the migration time of mobile agent equipped with active rules in sensor network-based mobile agent middleware environment, applying the proposed methods proves to ensure the autonomy and migration reliability of the mobile agent.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.607-614
• /
• 2006

The checkpointing schemes should reduce the process delay through managing the checkpoints of each node to fit the network load to enhance the performance of the process running on the cluster system that write the checkpoints into its global stable storage. For this reason, a cluster system with single IO space on a distributed RAID chooses a suitable checkpointng scheme to get the maximum IO performance and the best rollback recovery efficiency. In this paper, we improved the striped checkpointing scheme with dynamic stripe group size by adapting to the network bandwidth variation at the point of checkpointing. To analyze the performance of the multi striped checkpointing scheme, we applied Linpack HPC benchmark with MPI on our own cluster system with maximum 512 virtual nodes. The benchmark results showed that the multistriped checkpointing scheme has better performance than the striped checkpointing scheme on the checkpoint writing efficiency and rollback recovery at heavy system load.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.1-13
• /
• 2010

It is not easy to set RED(Random Early Detection) parameter according to environment in managing Network Device. Especially, it is more difficult to set parameter in the case of maintaining the constant service rate according to the change of environment. In this paper, we hypothesize the router that has Multi-core CPU in output queue and propose AI RED(Artificial Intelligence RED), which directly induces Genetic Algorithm of Artificial Intelligence in the output queue that is appropriate to the optimization of parameter according to RED environment, which is automatically adaptive to workload. As a result, AI RED Is simpler and finer than FuRED(Fuzzy-Logic-based RED), and RED parameter that AI RED searches through simulations is more adaptive to environment than standard RED parameter, providing the effective service. Consequently, the automation of management of RED parameter can provide a manager with the enhancement of efficiency in Network management.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.586-588
• /
• 1998

최근 들어 통신 기술이 급속하게 발전해감에 따라 대규모 분산 시스템에 대한 요구가 증가하였다. 이런 시스템들은 구성 요소들이 이질적이고, 각 구성 요소들이 다양한 정보를 생성하기 때문에 이들의 관리에는 많은 양의 사건 전송량(event traffic)을 생성한다. 따라서 이러 시스템들을 효율적으로 관리하기 위해서는 발생한 사건들에 대한 여과()가 필요하다. 또한 관리 서비스를 동적으로 변경할 수 있고, 확장성을 제공할 수 있으며, 네트워크 부하를 줄일 수 있어야 한다. 이러한 목적으로 분산 시스템 관리에 이동 에이전트를 사용하는 방법이 연구되어 왔다. 그러나 관리해야할 관리 대상의 수가 많고 복잡하기 때문에 기존의 이동 에이전트 방법으로 효율적인 관리가 어렵다. 따라서 본 논문에서는 효율적인 이동 에이전트의 이동 모델을 설계하고, 기존의 이동 에이전트의 이동 방법과 제안한 방법을 응답시간 관점에서 비교한다.

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

802.11과 같은 무선 네트워크에서는 전송오류에 의한 패킷손실이 많이 발생한다. 802.11 MAC 프로토콜에서는 에러 복구를 위해 ARQ방식을 통한 재전송을 통하여 에러를 정정하나 채널 에러 율이 증가하면 재전송 방식의 효율은 급격히 저하된다. 또한 재전송을하는데 있어서 다시 RTS와 CTS를 전송하여 데이터를 보낼 수 있는 채널을 확보해야 하므로 상당한 전송부하가 발생한다. 이에 재전송 없이 효율적인 에러 복구를 위해서는 FEC방식이 필요하다. 그러나 정적인 FEC방식은 연속적으로 변화하는 무선 채널의 전송 오류율에알맞은 정정 코드를 채택하지 못해 과도한 대역폭 낭비로 인하여 효율이 떨어지는 문제가 있다. 이러한 문제를 개선하기 위해서는 채널의 상태에 따라 정정 코드를 동적으로 변경하는 것이 필요하다. 본 논문은 FEC방식을 802.11 MAC 프로토콜에 적용할 수 있는 방안에 대해서 기술하고 채널 에러 변화에 따라 능동적으로 정정 코드 양을 조절하여 재 전송하는적응적 FEC 알고리즘을 제안한다. 본 논문에서 제안한 적응적 FEC 알고리즘을 802.11 MAC 프로토콜에 적용하여 성능을 측정한 결과 최대 80%정도 성능이 향상된 것을 확인할 수 있었다.