• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.292-300
• /
• 2013

Nowadays, energy saving has become a hot topic and information and communication technology has become a major power consumer. In long term evolution advanced (LTE-A) networks, heterogeneous deployments of low-power nodes and conventional macrocells provide some new features, such as coverage extension, throughput enhancement, and load balancing. However, a large-scale deployment of low-power nodes brings substantial energy consumption and interference problems. In this paper, we propose a novel switching strategy (NS), which adaptively switches on or off some low-power nodes based on the instantaneous load of the system. It is compatible with the microcells' load balancing feature and can be easily implemented on the basis of existing LTE-A specifications. Moreover, we develop an analytical model for analyzing the performance of system energy consumption, block rate, throughput, and energy efficiency. The performance of NS is evaluated by comparison with existing strategies. Theoretical analysis and simulation results show that NS not only has a low block rate, but also achieves a high energy efficiency.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.153-162
• /
• 2017

Advances in communication technologies and the decreasing cost of computers have made distributed computer systems an attractive alternative for satisfying the information needs of large organizations. This paper presents a distributed algorithm for performance improvement through load balancing and file migration in distributed systems. We employed a sender initiated strategy for task migration and used learning automata with several internal states for file migration. A task can be migrated according to the load information of a computer. A file is migrated to the destination processor when it is in the right boundary state. We also described an analytical model for load balancing with file migration to verify the proposed algorithm. Analytical and simulation results show that our algorithm is very well-suited for distributed system environments.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.83-97
• /
• 2000

Internet-based retail business spreads rapidly in Korea. Companies are trying to develop and use various strategic capabilities. The strategies employed by those companies include activities related to the design of shopping sites, market positionsing, facilitation of purchasing process, payment mechanism, and the provision of various consumer services. However, the success of these strategies depends on various environmental factors and internal capability of the companies. Especially, balancing activities performed on-line with those performed off-line is suggested to be essential. In this study, we examined three successful Internet shopping mall companies and compared them to draw useful guidelines for balancing shopping mall strategies - on - line vs. off - line. These three companies were selected because they are all considered sucessful by now, but brought different backgrounds.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.455-460
• /
• 2001

For some applications, the computational structure changes dynamically during the program execution. When this happens, static partitioning and allocation of tasks are not enough to achieve high performance in parallel computers. In this paper, we propose a dynamic load balancing algorithm efficiently distributes the computation with dynamically growing tree structure to processors. We present an implementation technique for the algorithm on mesh architectures, and analyze its complexity. We also demonstrate through experiments how our algorithm provides good quality solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1133-1151
• /
• 2010

Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.

• ETRI Journal
• /
• v.45 no.5
• /
• pp.887-898
• /
• 2023

Aerial base stations (ABSs) seem promising to enhance the coverage and capacity of fifth-generation and upcoming networks. With the flexible mobility of ABSs, they can be positioned in air to maximize the number of users served with a guaranteed quality of service (QoS). However, ABSs may be overloaded or underutilized given inefficient placement, and user association has not been well addressed. Hence, we propose a three-dimensional ABS placement scheme with a delay-QoS-driven user association to balance loading among ABSs. First, a load balancing utility function is designed based on proportional fairness. Then, an optimization problem for joint ABS placement and user association is formulated to maximize the utility function subject to statistical delay QoS requirements and ABS collision avoidance constraints. To solve this problem, we introduce an efficient modified gray wolf optimizer for ABS placement with a greedy user association strategy. Simulation results demonstrate that the proposed scheme outperforms baselines in terms of load balancing and delay QoS provisioning.

• Journal of Power Electronics
• /
• v.15 no.3
• /
• pp.775-785
• /
• 2015

Many equalization circuits have been proposed to improve pack performance and reduce imbalance. Although bidirectional equalization topologies are promising in these methods, pre-equalization global equalization strategy is lacking. This study proposes a novel state-of-charge (SoC) equalization algorithm for bidirectional equalizer based on particle swarm optimization (PSO), which is employed to find optimal equalization time and steps. The working principle of bidirectional equalization topologies is analyzed, and the reason behind the application of SoC as a balancing criterion is explained. To verify the performance of the proposed algorithm, a pack with 12 LiFePO4 batteries is applied in the experiment. Results show that the maximum SoC gap is within 2% after equalization, and the available pack capacity is enhanced by 13.2%. Furthermore, a comparison between previously used methods and the proposed PSO equalization algorithm is presented. Experimental tests are performed, and results show that the proposed PSO equalization algorithm requires fewer steps and is superior to traditional methods in terms of equalization time, energy loss, and balancing performance.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.61-69
• /
• 2009

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.550-558
• /
• 2018

This paper presents the current limit strategy of voltage controller of delta-connected H-bridge static synchronous compensator (STATCOM) under an unbalanced voltage fault event. When phase to ground fault happens, the feasibility to heighten the magnitude of sagging phase voltage is considered by using symmetric transformation method in delta-structure STATCOM. And the efficiency to cover the maximum physical current limit of switching device is considered by using vector analysis method that calculate the zero sequence current for balancing the cluster energy in delta connected H-bridge STATCOM. The result is simple and obvious. Only positive sequence current has to be used to support the unbalanced voltage sag. Although the relationship between combination of the negative sequence voltage with current and zero sequence current is nonlinear, the more negative sequence current is supplying, the larger zero sequence current is required. From the full-model STATCOM system simulation, zero sequence current demand is identified according to a ratio of positive and negative sequence compensating current. When only positive sequence current support voltage sag, the least zero sequence current is needed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1674-1680
• /
• 2009

This paper proposes an autonomous fault determination, fault zone isolation and fault restoration strategy based on the ethernet communication as a new attempt to solve the problem the of the existing central control method. In proposed method, The FRTU(Feeder Remote Terminal Unit)s on the feeder determines autonomously where the faulted zone is by exchanging the voltage and current information with neighbor FRTUs based on the network communication, and then separates the faulted zone in an nil-voltage status to make the protective device to reclose successively. In particular, the minimization of outage time and relational load balancing is archived by each interconnection switch which determines autonomously the load zone to be allocated among those zones after the sound outage zones was separated individually. Finally, to show effectiveness of the proposed fault restoration strategy, the several fault cases are simulated for the test distribution system, and the load balancing index of the proposed solution is compared with all of feasible solutions.