• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1514-1531
• /
• 2014

Femtocell provides better coverage and higher spectrum efficiency in areas rarely covered by macrocells. However, serious two-tier interference emerging from randomly deploying femtocells may create dead zones where the service is unavailable for macro-users. In this paper, we present adopting cognitive radio spectrum overlay to avoid intra-tier interference and incorporating spectrum underlay and overlay to coordinate cross-tier interference. It is a novel centralized control strategy appropriate for both uplink and downlink transmission. We introduce the application of proper spectrum sharing strategy plus optimal power allocation to address the issue of OFDM-based femtocells interference-limited downlink transmission, along with, a low-complexity suboptimal solution proposed. Simulation results illustrate the proposed optimal scheme achieves the highest transmission rate on successfully avoiding two-tier interference, and outperforms the traditional spectrum underlay or spectrum overlay, via maximizing the opportunity to transmit. Moreover, the strength of our proposed schemes is further demonstrated by comparison with previous classic power allocation methods, in terms of transmission rate, computational complexity and signal peak-to-average power ratio.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.102-110
• /
• 2013

This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3134-3155
• /
• 2020

In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.75-86
• /
• 1998

We address the problem of determining the optimal processing times and pallet/fixture allocation in Flexible Manufacturing systems in order to minimize tool cost while meeting throughput targets of multiple part types. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. A numerical example reveals the potential of our approach for significant cost saving. We argue that our model can be Integrated Into the process planning system of an FMS to generate efficient process plans quickly.

• 대한안전경영과학회지
• /
• 제3권3호
• /
• pp.221-230
• /
• 2001

The assembly tolerance design methods have applied linear or nonlinear programming methods and used simulation method and search algorithms to optimize the tolerance allocation of each part in an assembly. However, those methods are only considered to the relationship between tolerance and manufacturing cost, which do not consider a quality loss cost for each part tolerance. In this paper, the integrated simulation model used genetic algorithm and the Monte-Carlo simulation method was developed for the allocation of the optimal tolerance considering the manufacturing cost and quality loss cost.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2020년도 제62차 하계학술대회논문집 28권2호
• /
• pp.387-388
• /
• 2020

As the utilization of microservice architectural style in diverse applications are increasing, the microservice deployment cost became a concern for many companies. We propose an approach to reduce the deployment cost by generating an algorithm which minimizes the cost of basic operation of a physical machine and the cost of resources assigned to a physical machine. This algorithm will produce optimal resource allocation and deployment location based on genetic algorithm process.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.302-305
• /
• 2000

The operation of a networked computing system (NCS), such as Internet, can be viewed as a resource allocation problem, and can be analyzed using the techniques of mathematical modeling. We define a general NCS and translate that setup into a model of an economy. The preferences of users are taken as primitives, and servers in the network are viewed as productive firms with priority input queues. Each sewer charges a rental price for its services by priority class. We characterize optimal system allocation, and derive formulae for supporting rental prices and priority premia such that the aggregated individual user demands do not exceed optimal levels and waiting-time expectations are correct. Our economic approach has the added benefit of providing a sound basis for evaluating NCS investment alternatives, using a process analogous to free entry and exit in free-enterprise economies.

• 한국경영과학회지
• /
• 제28권3호
• /
• pp.49-60
• /
• 2003

In this paper, we study the joint design of sampling inspections and service capacities for multi-products. Products of different defect rates which are either deterministic or random variables are supplied in batches after sampling inspection and rework. When supplied, all defective products that have not been inspected in batches are uncovered through total inspection and returned to service. We identify the optimal inspection policies and service capacities for multi-products reflecting the relationships between inspection rework costs and service provision costs. We also develope a marginal allocation algorithm for the optimal allocation of the limited total service capacity to products as well as inspection quantities.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

• 한국경영과학회지
• /
• 제36권2호
• /
• pp.33-42
• /
• 2011

Overlay multicasting has received a lot of attention as a core technology for multimedia streaming service. In this paper, we consider the discrete optimal rate allocation problem in multimedia overlay multicasting, which has been proposed by Akbari et al.[2]. The computational complexity of this problem is not known. Thus, we propose a special case which can be solved in polynomial time.