• Title/Summary/Keyword: Load Sharing Algorithm

Search Result 67, Processing Time 0.021 seconds

Simplified Control Scheme of Unified Power Quality Conditioner based on Three-phase Three-level (NPC) inverter to Mitigate Current Source Harmonics and Compensate All Voltage Disturbances

  • Salim, Chennai;Toufik, Benchouia Mohamed
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.3
    • /
    • pp.544-558
    • /
    • 2013
  • This paper proposes a simplified and efficient control scheme for Unified Power Quality Conditioner (UPQC) based on three-level (NPC) inverter capable to mitigate source current harmonics and compensate all voltage disturbances perturbations such us, voltage sags, swells, unbalances and harmonics. The UPQC is designed by the integration of series and shunt active filters (AFs) sharing a common dc bus capacitor. The dc voltage is maintained constant using proportional integral voltage controller. The shunt and series AF are designed using a three-phase three-level (NPC) inverter. The synchronous reference frame (SRF) theory is used to get the reference signals for shunt and the power reactive theory (PQ) for a series APFs. The reference signals for the shunt and series APF are derived from the control algorithm and sensed signals are injected in tow controllers to generate switching signals for series and shunt APFs. The performance of proposed UPQC system is evaluated in terms of power factor correction and mitigation of voltage, current harmonics and all voltage disturbances compensation in three-phase, three-wire power system using MATLAB-Simulink software and SimPowerSystem Toolbox. The simulation results demonstrate that the proposed UPQC system can improve the power quality at the common connection point of the non-linear load.

A Study of Music Recommendation System in P2P Network using Collaborative Filtering (P2P 환경에서 협업 필터링을 이용한 음악 추천 시스템에 대한 연구)

  • Won, Hee-Jae;Park, Kyu-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1338-1346
    • /
    • 2008
  • In this paper, we propose a new P2P-based music recommendation system. In comparison with previous system in client-server environment, the proposed system shows higher quality of music recommendation through real-time sharing of music preference information between peers. A collaborative filtering is implemented as a recommendation algorithm. As a user preference profile, we use the inherit KID music genre index contained in all legitimate music file instead of music feature vectors as in previous research so that the proposed system can mitigate the performance degradation and high computational load caused by feature inaccuracy and feature extraction. The performance of the proposed system is evaluated in various ways with real 16-weeks transaction data provided by Korean music portal, 5 company and it shows comparative quality of recommendation with only small amount of computational load.

  • PDF

Efficient Flash Memory Access Power Reduction Techniques for IoT-Driven Rare-Event Logging Application (IoT 기반 간헐적 이벤트 로깅 응용에 최적화된 효율적 플래시 메모리 전력 소모 감소기법)

  • Kwon, Jisu;Cho, Jeonghun;Park, Daejin
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.2
    • /
    • pp.87-96
    • /
    • 2019
  • Low power issue is one of the most critical problems in the Internet of Things (IoT), which are powered by battery. To solve this problem, various approaches have been presented so far. In this paper, we propose a method to reduce the power consumption by reducing the numbers of accesses into the flash memory consuming a large amount of power for on-chip software execution. Our approach is based on using cooperative logging structure to distribute the sampling overhead in single sensor node to adjacent nodes in case of rare-event applications. The proposed algorithm to identify event occurrence is newly introduced with negative feedback method by observing difference between past data and recent data coming from the sensor. When an event with need of flash access is determined, the proposed approach only allows access to write the sampled data in flash memory. The proposed event detection algorithm (EDA) result in 30% reduction of power consumption compared to the conventional flash write scheme for all cases of event. The sampled data from the sensor is first traced into the random access memory (RAM), and write access to the flash memory is delayed until the page buffer of the on-chip flash memory controller in the micro controller unit (MCU) is full of the numbers of the traced data, thereby reducing the frequency of accessing flash memory. This technique additionally reduces power consumption by 40% compared to flash-write all data. By sharing the sampling information via LoRa channel, the overhead in sampling data is distributed, to reduce the sampling load on each node, so that the 66% reduction of total power consumption is achieved in several IoT edge nodes by removing the sampling operation of duplicated data.

Design and Evaluation of a Channel Reservation Patching Method for True VOD Systems (True VOD 시스템을 위한 채널 예약 패칭 방법의 설계 및 평가)

  • Lee, Joo-Yung;Ha, Sook-Jeong;Bae, Ihn-Han
    • The KIPS Transactions:PartB
    • /
    • v.9B no.6
    • /
    • pp.835-844
    • /
    • 2002
  • The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

Improvement of Computational Complexity of Device-to-Device (D2D) Resource Allocation Algorithm in LTE-Advanced Networks (LTE-Advanced 환경에서 D2D 자원 할당 알고리즘의 계산 복잡도 개선)

  • Lee, Han Na;Kim, Hyang-Mi;Kim, SangKyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.762-768
    • /
    • 2015
  • D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.

Performance Analysis of MBMS and Wi-Fi Priority Policy in Heterogeneous Networks having a dispersed Single-cell MBMS (분산된 단일 셀 MBMS을 지원하는 이종 네트워크 환경에서 MBMS와 와이파이 사용자 우선 정책에 대한 성능 분석)

  • Jeong, Un Ho;Lee, Jung Moon;Kim, Gi Taek;Nam, Boo Hee;Kim, Dong Hoi
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.215-224
    • /
    • 2013
  • With the rising popularity of smart-phones, the supply of Internet protocol television is largely increased and it causes the wireless communication network load to be increased. To overcome such an overloading problem, 3GPP is now working on the standardization of MBMS since LTE Release 6 specification. MBMS has good performance in bandwidth efficiency by sharing the same bandwidth with the mulitple MBMS users having the same content. According to the proposed algorithm, in heterogeneous networks having a dispersed Single-cell MBMS where 3GPP network and Wi-Fi network are mixed, if the number of MBMS users, who are belonging to cells supporting a dispersed Single-cell MBMS, is more than a specified threshold, the MBMS priority policy is operated. Otherwise, the Wi-Fi priority policy is executed. As the simulation results show both the increase of total available bandwidth ratio and the decrease of network usage cost, it is confirmed that the proposed scheme allows the network efficiency to be maximized.

Cooperative Priority-based Resource Allocation Scheduling Scheme for D2D Communications Underlaying 5G Cellular Networks (5G 셀룰러 네트워크 하의 D2D통신을 위한 협력적 우선순위 기반의 자원할당 스케줄링)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.18 no.10
    • /
    • pp.225-232
    • /
    • 2020
  • The underlaying communication scheme in 5G cellular network is a very promising resource sharing scheme, and it is an effective scheme for improving service performance of 5G and reducing communication load between a cellular link and a device to device (D2D) link. This paper proposes the algorithm to minimize the resource interference that occurs when performing 5G-based multi-class service on gNB(gNodeB) and the cooperative priority-based resource allocation scheduling scheme (CPRAS) to maximize 5G communication service according to the analyzed control conditions of interference. The proposed CPRAS optimizes communication resources for each device, and it optimizes resource allocation according to the service request required for 5G communication and the current state of the network. In addition, the proposed scheme provides a function to guarantee giga-class service by minimizing resource interference between a cellular link and a D2D link in gNB. The simulation results show that the proposed scheme is better system performance than the Pure cellular and Force cellular schemes. In particular, the higher the priority and the higher the cooperative relationship between UE(User Equipment), the proposed scheme shows the more effective control of the resource interference.