• Title/Summary/Keyword: 오버헤드

Search Result 1,754, Processing Time 0.031 seconds

A Study of Efficient Set Detour Routing using Context-Aware Matrix (MANET에서 상황인식 매트릭스를 이용한 효율적인 우회경로설정에 관한 연구)

  • Oh, Dong-keun;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.517-518
    • /
    • 2013
  • 모바일 에드 혹 네트워크(Mobile Ad hoc Network)는 이동성을 가진 노드로 구성된 네트워크로서, 통신기반 시설의 지원이 없어도 스스로 통신망을 구축하여 통신한다. 하지만 노드의 이동성으로 인한 토폴로지의 변화가 빈번하여, 라우팅 경로 재설정으로 인한 오버헤드가 생성된다. 오버헤드 생성을 줄이기 위하여 클러스터링을 이용한 연구가 진행되어 왔다. 클러스터가 형성된 MANET에서 클러스터 헤드 노드가 이동함에 따라 클러스터 영역을 벗어나게 되었을 경우, 클러스터 그룹에 속하는 멤버 노드들은 패킷을 보내지 못하며, 클러스터 헤드노드를 선출하지 못하여 사용할 수 없는 노드가 된다. 본 논문에서는 클러스터 헤드 노드가 클러스터 영역을 벗어날 경우, 클러스터 멤버노드의 상황인자 속성 벡터 정보가 유사한 클러스터 헤드노드를 이웃한 주변 클러스터 헤드로부터 검색 및 선택하여, 우회경로를 제공하는 알고리즘을 제안한다. 제안된 알고리즘에서 각 노드는 상황정보 매트릭스를 가지고 있어, 전송 커버리지 영역이 2홉 이내 반경에 있는 노드의 벡터 정보를 저장하게 된다. 클러스터 헤드 노드와의 연결이 끊어 졌을 경우, 클러스터 멤버 노드는 상황정보 매트릭스를 이용하여, 벡터정보가 유사한 클러스터 헤드 노드를 선택하여, 노드 간의 연결성 및 패킷의 전달성이 향상 된다.

  • PDF

Conditional Access System with A Group Hierarchy to Improve Broadcasting Channel Efficiency (방송 채널 효율 향상을 위한 그룹 계층 구성 기반 접근 제어 시스템)

  • Yang, Jang-Hoon;Kim, Dong-Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.5
    • /
    • pp.726-735
    • /
    • 2009
  • In this paper, we proposed a novel conditional access system to reduce the overhead transmission rate for messages which verify the entitlement of subscribers in bandwidth-limited system. We adapted a key update system with the tree structure which had been used for IP multicast to a group hierarchy for the subscriber groups or channel groups. We also analyzed the overhead transmission rate for periodic key update and aperiodic one for change in a subscriber. The numerical evaluations show that the proposed system can significantly reduce the overhead transmission rate for dynamic subscriber change up to several hundred thousands times for various system configuration.

  • PDF

Performance Analysis of Load Balanced Metadata Catalog Service (부하분산 메타데이터 카탈로그 서비스의 성능 분석)

  • Ahn, Sunil;Lee, Sehoon;Kim, Namgyu;Hwang, Soonwook
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.555-559
    • /
    • 2007
  • AMGA is a metadata catalogue service which offers access to metadata for files stored on the Grid. We evaluated the performance of AMGA and analyzed overhead in the current AMGA implementation. It had 700% poor throughput (read/insert per second) compared with the direct DB access. The biggest overhead was in managing GSI/SSL Connections, degrading throughput about 350%. We alsomeasured the throughput of load-balanced AMGA services, and it showed linear throughput improvement when we increased the number of AMGA server. In addition, we measured the throughputin the WAN environment, and it showed the number of the maximum connections that an AMGA server can handle is the most critical factor in the throughput.

  • PDF

A Power-Aware Scheduling Algorithm with Voltage Transition Overhead (전압 변경 오버헤드를 고려한 전력 관리 알고리즘)

  • Kweon, Hyek-Seong;Ahn, Byoung-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.641-650
    • /
    • 2008
  • As portable devices are used widely, power management algorithm is essential to extend battery use time on small-sized battery power. Although many methods have been proposed, they assumed the voltage transition overhead was negligible or was considered partially. However, the voltage transition overhead might not guarantee to schedule real-time tasks in portable multimedia systems. This paper proposes the adaptive power-aware algorithm to minimize the power consumption by considering the voltage transition overhead. It selects only a few discrete frequencies from the whole frequencies of a system and adjusts the interval between two consecutive frequencies based on the system utilization to reduce the number of frequency change. This algorithm saves the power consumption about 10 to 25 percent compared to a CC RT-DVS method and a frequency-smoothing method.

  • PDF

A Study on the Efficient LT Decoding Scheme using GE Triangularization (GE 삼각화를 이용한 효율적인 LT 복호 기법 연구)

  • Cheong, Ho-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.57-62
    • /
    • 2011
  • In this paper an efficient LT decoding scheme using GE triangularization is proposed. The proposed algorithm has the desirable performance in terms of both overhead and computational complexity. Belief propagation algorithm is a fast and simple decoding scheme for LT codes. However, for a small code block length k, it requires a large overhead to decode, and OFG which has a small overhead has a large computational complexity. Simulation results show that the proposed algorithm noticeably reduces the computational complexity by more than 1/5 with respect to that of OFG and also its overhead has a small value about 1~5%.

Design and Implementation of Context Synchronizer for Efficient Offloading Execution in IoT-Cloud Fusion Virtual Machine (IoT-Cloud 융합 가상 기계에서 효율적인 오프로딩 실행을 위한 문맥 동기화기의 설계 및 구현)

  • Kim, Sangsu;Son, Yunsik;Lee, Yangsun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2017.11a
    • /
    • pp.1199-1202
    • /
    • 2017
  • IoT-Cloud 융합 가상 기계 시스템은 저성능의 사물인터넷 장비에서 고성능 클라우드 서버의 연산력을 제공받는 오프로딩 기법을 사용한다. 오프로딩 기법을 사용하는 경우 실행 대상 프로그램은 사물인터넷 장비와 클라우드 서버 사이에 일관성이 유지되어야하기 때문에 문맥 동기화가 필요하다. 기존 IoT-Cloud 융합 가상 기계의 문맥 동기화 방식은 전체 문맥 동기화를 시도하기 때문에 네트워크 오버헤드가 증가하여 비효율적이다. 네트워크 오버헤드는 오프로딩 실행 성능을 기존보다 감소시킬 수 있기 때문에 효율적인 오프로딩을 위해서는 오프로딩 실행에 필요한 문맥 정보만을 동기화하여 네트워크 오버헤드를 줄여야 한다. 본 논문에서는 효율적인 오프로딩 실행을 위해 정적 프로파일링을 통해 추출된 문맥 정보를 기반으로 오프로딩 실행에 필요한 문맥 정보만을 동기화하는 문맥 동기화기를 설계 및 구현하였다. 오프로딩 실행에 필요한 문맥 정보만 동기화가 이뤄지면 문맥 동기화 시 발생하는 네트워크 오버헤드의 크기가 줄어들기 때문에 효율적인 오프로딩 실행이 가능하다.

Reduction of Hardware Overhead for Test Pattern Generation in BIST (내장형 자체 테스트 패턴 생성을 위한 하드웨어 오버헤드 축소)

  • 김현돈;신용승;김용준;강성호
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.7
    • /
    • pp.526-531
    • /
    • 2003
  • Recently, many BIST(Built-in Self Test) schemes have been researched to reduce test time and hardware. But, most BIST schemes about pattern generation are for deterministic pattern generation. In this paper a new pseudo-random BIST scheme is provided to reduce the existing test hardware and keep a reasonable length of test time. Theoretical study demonstrates the possibility of the reduction of the hardware for pseudo-random test with some explanations and examples. Also the experimental results show that in the proposed test scheme the hardware for the pseudo-random test is much less than in the previous scheme and provide comparison of test time between the proposed scheme and the current one.

Voltage Selection Methodology for DVFS Overhead Minimization (동적 전압 주파수 스케일링 오버헤드 최소화를 위한 전압 선택 방법론)

  • Chang, Jin Kyu;Han, Tae Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.854-857
    • /
    • 2015
  • As the number of devices integrated on system-on-chip(SoC) increases exponentially, energy reduction technology is essential. Dynamic Voltage and Frequency Scaling (DVFS) is a very effective technique for reducing power consumption. Since it requires complex voltage regulators and PLL circuits, DVFS tends to have significant overheads. In this paper, we propose a new voltage selection algorithm to minimize transition overhead for multiprocessor SoC (MPSoC). Simulation results show that proposed algorithm appears less energy consumption with transition overhead even though maintains performance.

  • PDF

Autonomous Broadcast Pruning Scheme using Coverage Estimation in Wireless Ad Hoc Network (무선 Ad Hoc 망에서 영역 추정을 통한 ABP 브로드캐스트 기법)

  • Bae Ki chan;Kim Nam gi;Yoon Hyun soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.170-177
    • /
    • 2005
  • Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.

Estimation of Velocity and Training Overhead Constraints for Energy Efficient Cooperative Technique in Wireless Sensor Networks (협력통신을 이용하는 무선 센서네트워크에서의 에너지 소비 감소를 위한 속도와 훈련심볼의 오버헤드 임계값 추정)

  • Islam, Mohanmmad Rakibul;Kim, Jin-Sang;Cho, Won-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.443-448
    • /
    • 2009
  • A boundary value of the velocity of data gathering node (DGN) and a critical value for training overhead beyond which the scheme will not be feasible for a Multiple Input Multiple Output (MIMO) based cooperative communication for energy-limited wireless sensor networks is proposed in this paper. The performance in terms of energy efficiency and delay for a combination of two transmitting and two receiving antennas is analyzed. The results show that a set of critical value of velocity and training overhead pair is present for the long haul communication from the sensors to the data gathering node. Finally a relation between training overhead and velocity is simulated.