• 제목/요약/키워드: Allocation Problem

검색결과 1,028건 처리시간 0.024초

PSO-based Resource Allocation in Software-Defined Heterogeneous Cellular Networks

  • Gong, Wenrong;Pang, Lihua;Wang, Jing;Xia, Meng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권5호
    • /
    • pp.2243-2257
    • /
    • 2019
  • A heterogeneous cellular network (HCN) is useful to increase the spectral and energy efficiency of wireless networks and to reduce the traffic load from the macro cell. The performance of the secondary user equipment (SUE) is affected by interference from the eNodeB (eNB) in a macro cell. To decrease the interference between the macro cell and the small cell, allocating resources properly is essential to an HCN. This study considers the scenario of a software-defined heterogeneous cellular network and performs the resource allocation process. First, we show the system model of HCN and formulate the optimization problem. The optimization problem is a complex process including power and frequency resource allocation, which imposes an extremely high complexity to the HCN. Therefore, a hierarchical resource allocation scheme is proposed, which including subchannel selection and a particle swarm optimization (PSO)-based power allocation algorithm. Simulation results show that the proposed hierarchical scheme is effective in improving the system capacity and energy efficiency.

Multi-Slice Joint Task Offloading and Resource Allocation Scheme for Massive MIMO Enabled Network

  • Yin Ren;Aihuang Guo;Chunlin Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권3호
    • /
    • pp.794-815
    • /
    • 2023
  • The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

An efficient metaheuristic for multi-level reliability optimization problem in electronic systems of the ship

  • Jang, Kil-Woong;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제38권8호
    • /
    • pp.1004-1009
    • /
    • 2014
  • The redundancy allocation problem has usually considered only the component redundancy at the lowest-level for the enhancement of system reliability. A system can be functionally decomposed into system, module, and component levels. Modular redundancy can be more effective than component redundancy at the lowest-level because in modular systems, duplicating a module composed of several components can be easier, and requires less time and skill. We consider a multi-level redundancy allocation problem in which all cases of redundancy for system, module, and component levels are considered. A tabu search of memory-based mechanisms that balances intensification with diversification via the short-term and long-term memory is proposed for its solution. To the best of our knowledge, this is the first attempt to use a tabu search for this problem. Our tabu search algorithm is compared with the previous genetic algorithm for the problem on the new composed test problems as well as the benchmark problems from the literature. Computational results show that the proposed method outstandingly outperforms the genetic algorithm for almost all test problems.

A Distributed Power Allocation Scheme for Base Stations Powered by Retailers with Heterogeneous Renewable Energy Sources

  • Jeon, Seung Hyun;Lee, Joohyung;Choi, Jun Kyun
    • ETRI Journal
    • /
    • 제38권4호
    • /
    • pp.746-756
    • /
    • 2016
  • Owing to the intermittent power generation of renewable energy sources (RESs), future wireless cellular networks are required to reliably aggregate power from retailers. In this paper, we propose a distributed power allocation (DPA) scheme for base stations (BSs) powered by retailers with heterogeneous RESs in order to deal with the unreliable power supply (UPS) problem. The goal of the proposed DPA scheme is to maximize our well-defined utility, which consists of power satisfaction and unit power costs including added costs as a non-subscriber, based on linear and quadratic cost models. To determine the optimal amount of DPA, we apply dual decomposition, which separates the master problem into sub-problems. Optimal power allocation from each retailer can be obtained by iteratively coordinating between the BSs and retailers. Finally, through a mathematical analysis, we show that the proposed DPA can overcome the UPS for BSs powered from heterogeneous RESs.

Utility-based Resource Allocation with Bipartite Matching in OFDMA-based Wireless Systems

  • Zheng, Kan;Li, Wei;Liu, Fei;Xiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권8호
    • /
    • pp.1913-1925
    • /
    • 2012
  • In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

THE APPLICATION OF GIS FOR EFFECTIVE DISTRIBUTION OF THE EMERGENCY MEDICAL SERVICE AREA

  • Yang Byung-Yun;Hwang Chul-Sue
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.61-64
    • /
    • 2005
  • The purpose of this paper is to take a closer look at an area having shorted emergence facilities and to determine optional candidate sites instead of vulnerable area by using GIS spatial analysis. Newly determined new candidate is performed by concerning spatial efficiency and spatial equity for a public service. It was determined through using the analyzing of the physical accessibility measure, the Location-Allocation, sort of classic model in spatial statistics and general network analysis. The area of this research has been used in administrative boundary of Young-Dong in Gangneung including 13 emergency, medical hospitals, 46 fire-stations and sub-fire stations. In general terms, what all this show is that the way we are approached for geographical view from using GIS spatial analyzing technique of determined location and allocation problem by the social, economical, political factor and simple administrative discrimination at the meantime. At the same time, with problem occurred in the space it is possible to make an Effective proposal or means, policy, decision for new candidate location-allocation suggesting optimum model.

  • PDF

동적 슬롯 할당기법을 통한 인천공항과 김포공항 수용량 효율화방안 (Efficient Management for the Capacity of Incheon Airport and Gimpo Airport through Dynamic Slot Allocation)

  • 김상현
    • 한국항공운항학회지
    • /
    • 제25권3호
    • /
    • pp.101-107
    • /
    • 2017
  • Demand for air transportation in Korea keeps increasing, and the number of airport operations also grows as a result. The major two airports in Korea, Incheon International Airport and Gimpo International Airport, share the metropolitan airspace, which is crowd with air traffic. As air traffic increases in the metropolitan airspace, the demand for the airport operations would outnumber the capacities of these airports. However, there is a room to efficiently manage the shortage of the airport capacity due to the different distributions of operations in these airports. This study presents a dynamic slot allocation that allows exchanging slots according to the traffic demand. The dynamic allocation mitigates the airports' capacity problem but the airspace capacity itself should be increased in order to tackle the problem fundamentally.

불균형 멀티미디어 트래픽을 갖는 CDMA/TDD 이동통신시스템을 위한 최적 타임슬롯/채널 운용체계 (Optimal Time Slot and Channel Allocation for CDMA/TDD Systems with Unbalanced Multimedia Traffic)

  • 장근녕;김동우
    • 한국경영과학회지
    • /
    • 제26권4호
    • /
    • pp.125-132
    • /
    • 2001
  • Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.

  • PDF

멀티 유저 OFDM 시스템에서 QoS 보장을 위한 서브캐리어와 파워 할당에 관한 연구 (A Sub-optimal Joint Subcarrier and Power Allocation Algorithm for Qos Supporting in Muliuser OFDM Systems)

  • 심우철;이상재;김세헌
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • pp.417-420
    • /
    • 2006
  • This paper suggests that resource allocation algorithm in multiuser orthogonal frequncy divisioin multiplexing (OFDM). The proposed algorithm considers throughput maximization with power constraint and quality of service (QoS) constraint. This problem has a optimal solution with using well known water-filling algorithm but the algorithm requires high computational complexity. Therefore the problem needs a sub-optimal algorithm for decreasing computational complexity. We propose a sub-optimal joint subcarrier and power allocation algorithm for multiuser OFDM system and compare with previous resource allocation algorithm.

  • PDF

Measurement Allocation by Shapley Value in Wireless Sensor Networks

  • Byun, Sang-Seon
    • Journal of information and communication convergence engineering
    • /
    • 제16권1호
    • /
    • pp.38-42
    • /
    • 2018
  • In this paper, we consider measurement allocation problem in a spatially correlated sensor field. Our goal is to determine the probability of each sensor's being measured based on its contribution to the estimation reliability; it is desirable that a sensor improving the estimation reliability is measured more frequently. We consider a spatial correlation model of a sensor field reflecting transmission power limit, noise in measurement and transmission channel, and channel attenuation. Then the estimation reliability is defined distortion error between event source and its estimation at sink. Motivated by the correlation nature, we model the measurement allocation problem into a cooperative game, and then quantify each sensor's contribution using Shapley value. Against the intractability in the computation of exact Shapley value, we deploy a randomized method that enables to compute the approximate Shapley value within a reasonable time. Besides, we envisage a measurement scheduling achieving the balance between network lifetime and estimation reliability.