• Title/Summary/Keyword: load adaptive

Search Result 663, Processing Time 0.054 seconds

Methods for Adding Demand Response Capability to a Thermostatically Controlled Load with an Existing On-off Controller

  • Jin, Young Gyu;Yoon, Yong Tae
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.3
    • /
    • pp.755-765
    • /
    • 2015
  • A thermostatically controlled load (TCL) can be one of the most appropriate resources for demand response (DR) in a smart grid environment. DR capability can be effectively implemented in a TCL with various intelligent control methods. However, because traditional on-off control is still a commonly used method in a TCL, it is useful to develop a method for adding DR capability to the TCL with an existing on-off controller. As a specific realization of supervisory control for implementing DR capability in the TCL, two methods are proposed - a method involving the changing of a set point and a method involving the paralleling of an identified system without delay. The proposed methods are analyzed through the simulations with an electric heater for different power consumption levels in the on-state. Considerable cost benefit can be achieved with the proposed methods when compared with the case without DR. In addition, the observations suggest that a medium power consumption level, instead of the maximum power, in the on-state should be used for consistently obtaining the cost benefit without severe temperature deviation from the specified temperature range for DR.

Refined fixed granularity algorithm on Networks of Workstations (NOW 환경에서 개선된 고정 분할 단위 알고리즘)

  • Gu, Bon-Geun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.117-124
    • /
    • 2001
  • At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

  • PDF

A Fair Distributed Resource Allocation Method in UWB Wireless PANs with WiMedia MAC

  • Kim, Seok-Hwan;Hur, Kyeong;Park, Jong-Sun;Eom, Doo-Seop;Hwang, Kwang-Il
    • Journal of Communications and Networks
    • /
    • v.11 no.4
    • /
    • pp.375-383
    • /
    • 2009
  • The WiMedia alliance has specified a distributed medium access control (WiMedia MAC) protocol based on ultra wideband (UWB) for high data rate WPANs (HR-WPANs). The merits of WiMedia MAC such as distributed nature and high data rate make it a favorite candidate in HR-WPAN. Although QoS parameters such as the range of service rates are provided to a traffic stream, the WiMedia MAC is not able to use the QoS parameters and to determine or adjust a service rate using the QoS parameters for the traffic stream. In this paper, we propose a fair and adaptive resource allocation method that allocates time slots to isochronous streams according to QoS parameters and the current traffic load condition in a fully distributed manner. Although the traffic load condition changes, each device independently recognizes the changes and calculates fair and maximum allowable service rates for traffic streams. From the numerical and simulation results, it is proved that the proposed method achieves high capacity of traffic streams and fair QoS provisioning under various traffic load condition.

Dynamic Load Balancing and Network Adaptive Virtual Storage Service for Mobile Appliances

  • Ong, Ivy;Lim, Hyo-Taek
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.53-62
    • /
    • 2011
  • With the steady growth of mobile technology and applications, demand for more storage in mobile devices has also increased. A lightweight block-level protocol, Internet Advanced Technology Attachment (iATA), has been developed to deliver a cost-effective storage network solution for mobile devices to obtain more storage. This paper seeks to contribute to designing and implementing Load Balancing (LB), Network Monitoring (NM) and Write Replication (WR) modules to improve the protocol's scalability and data availability. LB and NM modules are invoked to collect system resources states and current network status at each associate node (server machine). A dynamic weight factor is calculated based on the collected information and sent to a referral server. The referral server is responsible to analyze and allocate the most ideal node with the least weight to serve the client. With this approach, the client can avoid connecting to a heavily loaded node that may cause delays in subsequent in-band I/O operations. Write replication is applied to the remaining nodes through a WR module by utilizing the Unison file synchronization program. A client initially connected to node IP A for write operations will have no hindrances in executing the relevant read operations at node IP B in new connections. In the worst case scenario of a node crashing, data remain recoverable from other functioning nodes. We have conducted several benchmark tests and our results are evaluated and verified in a later section.

Robust Tracking Control Based on Intelligent Sliding-Mode Model-Following Position Controllers for PMSM Servo Drives

  • El-Sousy Fayez F.M.
    • Journal of Power Electronics
    • /
    • v.7 no.2
    • /
    • pp.159-173
    • /
    • 2007
  • In this paper, an intelligent sliding-mode position controller (ISMC) for achieving favorable decoupling control and high precision position tracking performance of permanent-magnet synchronous motor (PMSM) servo drives is proposed. The intelligent position controller consists of a sliding-mode position controller (SMC) in the position feed-back loop in addition to an on-line trained fuzzy-neural-network model-following controller (FNNMFC) in the feedforward loop. The intelligent position controller combines the merits of the SMC with robust characteristics and the FNNMFC with on-line learning ability for periodic command tracking of a PMSM servo drive. The theoretical analyses of the sliding-mode position controller are described with a second order switching surface (PID) which is insensitive to parameter uncertainties and external load disturbances. To realize high dynamic performance in disturbance rejection and tracking characteristics, an on-line trained FNNMFC is proposed. The connective weights and membership functions of the FNNMFC are trained on-line according to the model-following error between the outputs of the reference model and the PMSM servo drive system. The FNNMFC generates an adaptive control signal which is added to the SMC output to attain robust model-following characteristics under different operating conditions regardless of parameter uncertainties and load disturbances. A computer simulation is developed to demonstrate the effectiveness of the proposed intelligent sliding mode position controller. The results confirm that the proposed ISMC grants robust performance and precise response to the reference model regardless of load disturbances and PMSM parameter uncertainties.

Analysis on load-bearing contact characteristics of face gear tooth surface wear with installation errors

  • Fan Zhang;Xian-long Peng
    • Computers and Concrete
    • /
    • v.31 no.2
    • /
    • pp.163-171
    • /
    • 2023
  • Face gear transmission is widely used in aerospace shunt-confluence transmission system. Tooth wear is one of the main factors affecting its bearing transmission performance. Furthermore, the installation errors of face gear are inevitable. In order to study the wear mechanism of face gear tooth surface with installation errors, based on tooth contact analysis numerical method and Archard wear theory, the UMESHMOTION subroutine in ABAQUS is developed.Combining with Arbitrary Lagrangian-Eulerian adaptive mesh technology, the finite element mesh wear model of abraded face gear pair is established.The preprocessing conditions are set to generate the inp files.Then,the inp files for each corner are imported and batch processed in ABAQUS.The loading tooth contact problem at each rotation angle is solved and the load distribution coefficient among gear tooth, tooth root bending stress, tooth surface contact stress and loaded transmission error are obtained. Results show that the tooth root wear is the most serious and the wear at the pitch cone is close to 0.The wear law of tooth surface along tooth width direction is convex parabola and the wear law along tooth height direction is concave parabola.

Adaptive Upstream Backup Scheme based on Throughput Rate in Distributed Spatial Data Stream System (분산 공간 데이터 스트림 시스템에서 연산 처리율 기반의 적응적 업스트림 백업 기법)

  • Jeong, Weonil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.10
    • /
    • pp.5156-5161
    • /
    • 2013
  • In distributed spatial data stream processing, processed tuples of downstream nodes are replicated to the upstream node in order to increase the utilization of distributed nodes and to recover the whole system for the case of system failure. However, while the data input rate increases and multiple downstream nodes share the operation result of the upstream node, the data which stores to output queues as a backup can be lost since the deletion operation delay may be occurred by the delay of the tuple processing of upstream node. In this paper, the adaptive upstream backup scheme based on operation throughput in distributed spatial data stream system is proposed. This method can cut down the average load rate of nodes by efficient spatial operation migration as it processes spatial temporal data stream, and it can minimize the data loss by fluid change of backup mode. The experiments show the proposed approach can prevent data loss and can decrease, on average, 20% of CPU utilization by node monitoring.

Load-Balancing Rendezvous Approach for Mobility-Enabled Adaptive Energy-Efficient Data Collection in WSNs

  • Zhang, Jian;Tang, Jian;Wang, Zhonghui;Wang, Feng;Yu, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1204-1227
    • /
    • 2020
  • The tradeoff between energy conservation and traffic balancing is a dilemma problem in Wireless Sensor Networks (WSNs). By analyzing the intrinsic relationship between cluster properties and long distance transmission energy consumption, we characterize three node sets of the cluster as a theoretical foundation to enhance high performance of WSNs, and propose optimal solutions by introducing rendezvous and Mobile Elements (MEs) to optimize energy consumption for prolonging the lifetime of WSNs. First, we exploit an approximate method based on the transmission distance from the different node to an ME to select suboptimal Rendezvous Point (RP) on the trajectory for ME to collect data. Then, we define data transmission routing sequence and model rendezvous planning for the cluster. In order to achieve optimization of energy consumption, we specifically apply the economic theory called Diminishing Marginal Utility Rule (DMUR) and create the utility function with regard to energy to develop an adaptive energy consumption optimization framework to achieve energy efficiency for data collection. At last, Rendezvous Transmission Algorithm (RTA) is proposed to better tradeoff between energy conservation and traffic balancing. Furthermore, via collaborations among multiple MEs, we design Two-Orbit Back-Propagation Algorithm (TOBPA) which concurrently handles load imbalance phenomenon to improve the efficiency of data collection. The simulation results show that our solutions can improve energy efficiency of the whole network and reduce the energy consumption of sensor nodes, which in turn prolong the lifetime of WSNs.

Implementation of Self-adaptive System using the Algorithm of Neural Network Learning Gain

  • Lee, Seong-Su;Kim, Yong-Wook;Oh, Hun;Park, Wal-Seo
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.3
    • /
    • pp.453-459
    • /
    • 2008
  • The neural network is currently being used throughout numerous control system fields. However, it is not easy to obtain an input-output pattern when the neural network is used for the system of a single feedback controller and it is difficult to obtain satisfactory performance with when the load changes rapidly or disturbance is applied. To resolve these problems, this paper proposes a new mode to implement a neural network controller by installing a real object for control and an algorithm for this, which can replace the existing method of implementing a neural network controller by utilizing activation function at the output node. The real plant object for controlling of this mode implements a simple neural network controller replacing the activation function and provides the error back propagation path to calculate the error at the output node. As the controller is designed using a simple structure neural network, the input-output pattern problem is solved naturally and real-time learning becomes possible through the general error back propagation algorithm. The new algorithm applied neural network controller gives excellent performance for initial and tracking response and shows a robust performance for rapid load change and disturbance, in which the permissible error surpasses the range border. The effect of the proposed control algorithm was verified in a test that controlled the speed of a motor equipped with a high speed computing capable DSP on which the proposed algorithm was loaded.

An Adaptive Handoff Method for Dynamic Traffic Distribution in Next-Generation Packet-based Mobile Systems (차세대 패킷 기반 이동 통신 시스템에서 트래픽 분산을 위한 적응적 핸드오프 기법)

  • Kim, Nam-Gi;Choi, Hye-Eun;Yoon, Hyun-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.3
    • /
    • pp.404-414
    • /
    • 2005
  • In the packet data network systems beyond 3G, the service quality of current users is affected by traffic load due to the packet burstiness. There also exists a hot cell problem, a well-known problem of cellular systems, caused by traffic centraliBation. Hot cell problem is one of the major reasons of degrading system performance because hot cell increases the call drop rate without fully utilization of system resource. Therefore, it is very important to distribute the traffic on the several neighboring cells so that system uses its resource effectively and maintains the quality of service. In this paper, we propose the adaptive handoff algorithms for distributing traffic in the packet data network systems. In addition, we propose a new load estimation method with MAC state diagram suitable for packet data network systems. Through the simulation results, we could find that proposed algorithm is able to improve efficiency of system resource and to assure the service quality of users through traffic distribution.