• ETRI Journal
• /
• v.34 no.2
• /
• pp.159-167
• /
• 2012

In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross-tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non-cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two-hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross-tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.193-214
• /
• 2014

Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.410-421
• /
• 2019

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.213-214
• /
• 2011

This paper presents a distributed relay selection algorithm for cooperative communication. The algorithm separates the decision making into two simple steps, decision making for employing cooperative communication and decision making for relay selection.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1982-1985
• /
• 2003

Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

• 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 Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.446-452
• /
• 2008

To design a spiral inductor a genetic algorithm is applied with fast computing technique. For the inductance extraction of the given geometry the fast multipole method is used, also the distributed computing technique using 10 personal computers is introduced for the massive computation of the genetic algorithm. A few important design parameters are used as genes for the optimization in the genetic algorithm. The target function is chosen as mean square error of the inductance at several sampling frequency points. A large-scaled inductor is fabricated and compared with the simulated data.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.866-870
• /
• 2010

This paper presents a application of Harmony Search (HS) algorithm for optimal placement of distributed generations(DGs) in distribution systems. In optimization procedure, the HS algorithm denotes the searching ability for the global optimal solution with simple coding of the iteration procedure, and shows the fast convergence characteristics for getting solutions. The HS algorithm is tested on 9 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate placement points of DGs and reducing amount of active power without the occurrence of any mis-determination in selection of its capacity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.53-60
• /
• 2012

In this paper, an improved algorithm of distributed QoS is proposed for real-time networks. This algorithm like a delay-constrained unicast routing(DCUR) algorithm uses either least-cost(LC) path or least-delay(LD) path of an active node, but when there is a loop, this algorithm is quite different from DCUR in choosing the link between the active node and the previous node to replace the original loop path. And this algorithm makes the construction of the paths more efficiently.