• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.5
• /
• pp.346-352
• /
• 2016

This paper proposes an adaptive robust control method for an acrobot system in the presence of input disturbance. The acrobot system is a typical example of the underactuated system with complex nonlinearity and strong dynamic coupling. Also, disturbance can cause limit cycle phenomenon which appears in the acrobot system around the desired unstable equilibrium point. To minimize the effect of the disturbance, we apply a fuzzy disturbance estimation method for the swing-up and balancing control of the acrobot system. In this paper, both disturbance observer and controller for the acrobot system are designed and verified through mathematical proof and simulations.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.37-47
• /
• 2011

Current researches in the Cloud focus on the appropriate interactions of cloud components in a large-scale system implementation. However, the current designs do not include intelligent methods like grouping the similar service providers based on their properties and integrating adaptive schemes for load distribution which can promote effective sharing of resource. This paper proposes an efficient virtualization of services by grouping the cloud providers to improve the service provisioning. The grouping of cloud service providers based on a cluster analysis collects the similar and related services in one group. The adaptive load balancing supports the service provisioning of the cloud system where it manages the load distribution within the group using an adaptive scheme. The proposed virtualization mechanism (GRALB) showed good results in minimizing message overhead and throughput performance compared to other methods.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.38-43
• /
• 2008

In this paper, adaptive channel borrowing approach fuzzy neural networks for load balancing (ACB-FNN) is presented to maximized the number of served calls and the depending on asymmetries traffic load problem. In a wireless network, the call's arrival rate, the call duration and the communication overhead between the base station and the mobile switch center are vague and uncertain. A new load balancing algorithm with cell involved negotiation is also presented in this paper. The ACB-FNN exhibits better learning abilities, optimization abilities, robustness, and fault-tolerant capability thus yielding better performance compared with other algorithms. It aims to efficiently satisfy their diverse quality-of-service (QoS) requirements. The results show that our algorithm has lower blocking rate, lower dropping rate, less update overhead, and shorter channel acquisition delay than previous methods.

• Journal of Internet Technology
• /
• v.20 no.1
• /
• pp.293-300
• /
• 2019

The Internet of Things (IoT) enables embedded devices to connect to the internet either through IP or the web in a physical environment. The increase in performance of wireless access services, adaptive load balancing, and interference routing metric becomes the key challenges in Wireless Mesh Networks (WMN). However, in the case of IoT over WMN, a large number of users generate abundant net flows, which can result in network traffic jam. Therefore, in this paper, we propose a Load Balancing and Interference Delay Aware routing metric algorithm to efficiently address the issues present in the current work. The proposed scheme efficiently utilizes the available mesh station queue information and the number of mesh stations suffering from channel interference in the available path. The simulations results show that the proposed scheme performed superior to the existing routing metrics present in the current literature for similar purposes.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.135-141
• /
• 2018

Wireless sensor networks (WSN) are composed of a large number of sensor nodes. Battery-powered sensor nodes have limited coverage; therefore, it is more efficient to transmit data via multi-hop communication. The network lifetime is a crucial issue in WSNs and the multi-hop routing protocol should be designed to prolong the network lifetime. Prolonging the network lifetime can be achieved by minimizing the power consumed by the nodes, as well as by balancing the power consumption among the nodes. A power imbalance can reduce the network lifetime even if several nodes have sufficient (battery) power. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes. To improve the balance of power consumption and improve the network lifetime, the proposed routing scheme adaptively controls the transmission range using a power control according to the residual power in the nodes. We developed a routing simulator to evaluate the performance of the proposed routing protocol. The simulation results show that the proposed routing scheme increases power balancing and improves the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.811-817
• /
• 2005

Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, I propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization. The most important features of my algorithm are its adaptability, flexibility and responsiveness to current network conditions. In addition, my online scheme to control bandwidth adaptively is a cell-oriented approach. This approach has low complexity making it practical for real cellular networks. Simulation results indicate the superior performance of my algorithm.

• Journal of TMJ Balancing Medicine
• /
• v.8 no.1
• /
• pp.11-15
• /
• 2018

Recently, clinical efficacies of the intraoral balancing appliance therapy have been reported by several researchers, and it has been found that there are various kinds of diseases that can be effectively applied. However, studies on cerebrovascular disease, one of the main diseases with a high mortality rate, are still poorly reported, and studies of temporomandibular joint disorder (TMD)-induced changes in brain function suggest that cerebrovascular disease is more appropriate as an adaptive disorder of the temporomandibular joint (TMJ) balancing device. In the developed countries, the importance of research on the structure and function of the brain has been recognized and spurred on the related research. In Korea, the research on brain function and cognitive disorders should have promoted more massively. In order to regain its former reputation in the Korean medicine in the field of cerebrovascular disease, it should be spurred on basic research and clinical case studies. In addition, extensive and in-depth studies including animal studies are needed to establish the basis of underlying mechanisms of the TMJ balancing therapies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2563-2568
• /
• 2013

Recently, various solutions to support explosively growing mobile data traffic have attracted intensive attentions. However, the range of spectrum which can be exploited for mobile communications is very limited. Small cell networks are actively investigated because they can efficiently offload mobile data traffic from macro cells without using additional spectrum. In this paper, we developed a system-level simulator considering small cell networks in the indoor environments. We compare the performance of outage probability when a load-balancing algorithm is utilized or not. We can reduce the outage probability of congested BS with the load-balancing algorithm. In addition, overall outage probability of whole wireless systems can be reduced by using the proposed load-balancing algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.