• Title/Summary/Keyword: resource partitioning

Search Result 56, Processing Time 0.027 seconds

Distributed Resource Partitioning Scheme for Intercell Interference in Multicellular Networks

  • Song, Jae-Su;Lee, Seung-Hwan
    • Journal of electromagnetic engineering and science
    • /
    • v.15 no.1
    • /
    • pp.14-19
    • /
    • 2015
  • In multicellular wireless networks, intercell interference limits system performance, especially cell edge user performance. One promising approach to solve this problem is the intercell interference coordination (ICIC) scheme. In this paper, we propose a new ICIC scheme based on a resource partitioning approach to enhance cell edge user performance in a wireless multicellular system. The most important feature of the proposed scheme is that the algorithm is performed at each base station in a distributed manner and therefore minimizes the required information exchange between neighboring base stations. The proposed scheme has benefits in a practical environment where the traffic load distribution is not uniform among base stations and the backhaul capacity between the base stations is limited.

Adaptive Partitioning based Downlink Call Admission Control in 3G LTE (3G LTE의 Adaptive Partitioning 기반 다운링크 호 수락제어 방식)

  • Jun, Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.565-572
    • /
    • 2007
  • 3G Long Term Evolution (3G LTE) is a next generation cellular networks system capable or providing various mobile multimedia services by using OFDMA and MIMO based radio access technology. Among many differences from existing WCDMA based systems, the facts that 3G LTE uses Physical Resource Block (PRB) as its radio resources and provides all services through the PS domain make the development of new resource management schemes necessary. This paper proposes an adaptive partitioning based downlink call admission control scheme. It separates realtime call requests from non-realtime ones, specifies maximum allowable resource amounts for each type, but if the maximum is exceeded, call requests are accepted with probability proportional to remaining resource amounts. Despite the fact that such adaptive concept has been already adopted by other call admission schemes, the contributions of our paper, which are that we are able to find an efficient way to apply the proposed scheme exploiting PRB characteristics and measure the resource usage of base stations by PRB utilization and payload ratio, are still valid. When judging from simulation results in comparison with others, our scheme is able to prioritize realtime call requests over non-realtime ones, and at the same time, overall system performance is superior.

Small-cell Resource Partitioning Allocation for Machine-Type Communications in 5G HetNets (5G 이기종 네트워크 환경에서 머신타입통신을 위한 스몰셀 자원 분리 할당 방법)

  • Ilhak Ban;Se-Jin Kim
    • Journal of Internet Computing and Services
    • /
    • v.24 no.5
    • /
    • pp.1-7
    • /
    • 2023
  • This paper proposes a small cell resource partitioning allocation method to solve interference to machine type communication devices (MTCD) and improve performance in 5G heterogeneous networks (HetNet) where macro base station (MBS) and many small cell base stations (SBS) are overlaid. In the 5G HetNet, since various types of MTCDs generate data traffic, the load on the MBS increases. Therefore, in order to reduce the MBS load, a cell range expansion (CRE) method is applied in which a bias value is added to the received signal strength from the SBS and MTCDs satisfying the condition is connected to the SBS. More MTCDs connecting to the SBS through the CRE will reduce the load on the MBS, but performance of MTCDs will degrade due to interference, so a method to solve this problem is needed. The proposed small cell resource partitioning allocation method allocates resources with less interference from the MBS to mitigate interference of MTCDs newly added in the SBS with CRE, and improve the overall MTCD performace using separating resources according to the performance of existing MTCDs in the SBS. Through simulation results, the proposed small cell resource partitioning allocation method shows performance improvement of 21% and 126% in MTCDs capacity connected to MBS and SBS respectively, compared to the existing resource allocation methods.

Reuse Partitioning for Throughput and Fairness Improvement in OFDMA Based Relay System (OFDMA기반 Relay시스템에서 Throughput과 Fairness성능 향상을 위한 Reuse Partitioning기법)

  • Shim, Min-Kyu;Choi, Ho-Young;Hong, Dae-Hyoung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.9
    • /
    • pp.17-24
    • /
    • 2007
  • In this paper, we propose the sub-cell reuse partitioning among relays as an efficient resource reuse scheme in the relay-based OFDMA systems. If the frequency resource is reused among relays aggressively, we can increase the cell throughput. However, the interferences due to the frequency reuse may cause the fairness decrease due to the SINR degradation especially at the edge of RS sub-cells. In this paper, to make the cell throughput and fairness performance improved at the same time, we propose a sub-cell reuse partitioning scheme that divides a relay sub-cell into inner zone for aggressive reuse and outer zone for sparse reuse. The performance of the proposed scheme has been analyzed by computer simulation. We also applied a scheduling algorithm that can work together with the proposed sub-cell reuse partitioning scheme. Simulation results show that the proposed scheme can improve both the throughput and the fairness performances. In particular, when the scheduling is applied for the improvement of fairness, it is shown that the throughput performance can be enhanced more efficiently by the proposed scheme.

Winter Food Resource Partitioning between Sympatric Gadus macrocephalus and G. chalcogrammus in the Northern Coast of East Sea, South Korea Inferred from Stomach Contents and Stable Isotopes Analyses (위내용물 분석과 안정동위원소 분석을 이용한 겨울철 동해 북부 연안에 출현하는 명태(Gadus chalcogrammus)와 대구(G. macrocephalus)의 먹이분할 연구)

  • Park, Joo Myun;Jung, Hae Kun;Lee, Chung Il;Park, Hyun Je
    • Korean Journal of Ichthyology
    • /
    • v.34 no.2
    • /
    • pp.102-112
    • /
    • 2022
  • This study investigated dietary habits and intra- and inter-specific food resource partitioning of co-occurring walleye pollock (Gadus chalcogrammus) and Pacific cod (G. macrocephalus) from the waters off the north-eastern coast of South Korea using stomach contents and stable isotopes (δ13C and δ15N) analyses. Both species are mesopelagic carnivores that consumed mainly benthopelagic crustaceans, but teleosts were also abundant in the diet of Pacific cod. Non-metric multidimensional scaling (nMDS) ordination and permutational multivariate analysis of variance (PERMANOVA) of dietary data revealed significant intra- and inter-specific dietary differences, i.e., food resource partitioning. Nitrogen stable isotope values (δ15N) were similar between walleye pollock and Pacific cod, but carbon stable isotope values (δ13C) were significant different, suggesting different trophic positioning. Canonical analysis of principal coordinate (CAP) ordination plot further demonstrated that differences in the type and range of prey ingested by the two species contributed such an inter-specific difference in the diet compositions. Ontogenetic changes in diet compositions were evident. As walleye pollock, they preyed more upon carid shrimps and cephalopods, but no such trend was observed in the diets of Pacific cod. While stable isotope values indicated that large-sized specimens of both species were significantly enriched in 15N relative to smaller conspecifics thus supporting these data. Consequently, in this study, both methodologies, i.e., stomach contents and stable isotope analyses, provided evidence of inter- and/or intra-specific dietary segregations and trophic niche partitioning between co-occurring walleye pollock and Pacific cod off eastern Korean waters.

Frequency and Subcarrier Reuse Partitioning for FH-OFDMA Cellular Systems

  • Lee, Yeonwoo;Kim, Kyung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.5
    • /
    • pp.601-609
    • /
    • 2013
  • One of the most serious factors constraining the next generation cellular mobile consumer communication systems will be the severe co-channel interference experienced at the cell edge. Such a capacity-degrading impairment combined with the limited available spectrum resource makes it essential to develop more spectrally efficient solutions to enhance the system performance and enrich the mobile user's application services. This paper proposes a unique hybrid method of frequency hopping (FH) and subcarrier-reuse-partitioning that can maximize the system capacity by efficiently utilizing the available spectrum while at the same time reduce the co-channel interference effect. The main feature of the proposed method is that it applies an optimal combination of different frequency reuse factors (FRF) and FH-subcarrier allocation patterns into the partitioned cell regions. From the simulation results, it is shown that the proposed method can achieve the optimum number of subcarrier subsets according to the frequency-reuse distance and results in better performance than the fixed FRF methods, for a given partitioning arrangement. The results are presented in the context of both blocking probability and BER performances. It will also be shown how the proposed scheme is well suited to FH-OFDMA based cellular systems aiming at low co-channel interference performance and optimized number of subcarriers.

An Efficient Resource-constrained Scheduling Algorithm (효율적 자원제한 스케줄링 알고리즘)

  • 송호정;정회균;황인재;송기용
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.73-76
    • /
    • 2001
  • High-level synthesis generates a structural design that implements the given behavior and satisfies design constraints for area, performance, power consumption, packaging, testing and other criteria. Thus, high-level synthesis generates that register-transfer(RT) level structure from algorithm level description. High-level synthesis consist of compiling, partitioning, scheduling. In this paper, we proposed the efficient scheduling algorithm that find the number of the functional unit and scheduling into the minimum control step with silicon area resource constrained.

  • PDF

Dietary composition of two coexisting bat species, Myotis ikonnikovi and Plecotus ognevi, in the Mt. Jumbong forests, South Korea

  • Sungbae Joo;Injung An;Sun-Sook Kim
    • Journal of Ecology and Environment
    • /
    • v.47 no.4
    • /
    • pp.168-176
    • /
    • 2023
  • Background: Many insectivorous bats have flexible diets, and the difference in prey item consumption among species is one of the key mechanisms that allows for the avoidance of interspecies competition and promotes coexistence within a microhabitat. In Korea, of the 24 bat species that are known to be distributed, eight insectivorous bats use forest areas as both roosting and foraging sites. Here, we aimed to understand the resource partitioning and coexistence strategies between two bat species, Myotis ikonnikovi and Plecotus ognevi, cohabiting the Mt. Jumbong forests, by comparing the differences in dietary consumption based on habitat utilization. Results: Upon examining their dietary composition using the DNA meta-barcoding approach, we identified 403 prey items (amplicon sequence variants). A greater prey diversity including Lepidoptera, Diptera, Coleoptera, and Ephemeroptera, was detected from M. ikonnikovi, whereas most prey items identified from P. ognevi belonged to Lepidoptera. The diversity index of prey items was higher for M. ikonnikovi (H': 5.67, D: 0.995) than that for P. ognevi (H': 4.31, D: 0.985). Pianka's index value was 0.207, indicating little overlap in the dietary composition of these bat species. Our results suggest that M. ikonnikovi has a wider diet composition than P. ognevi. Conclusions: Based on the dietary analysis results, our results suggests the possibility of differences in foraging site preferences or microhabitat utilization between two bat species cohabiting the Mt. Jumbong. In addition, these differences may represent one of the important mechanism in reducing interspecific competition and enabling coexistence between the two bat species. We expected that our results will be valuable for understanding resource partitioning and the coexistence of bats inhabiting the Korean forests.

A Hand-off Algorithm for Performance Improvement in the Reuse Partitioning Systems (재사용 분할 시스템에서 성능 개선을 위한 핸드오프 알고리즘)

  • Lee, Young-Chul;Kim, Min-Hong;Lim, Jae-Sung;Kimn, Ha-Jine
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.437-445
    • /
    • 2000
  • The reuse partitioning system in microcellular networks are dropped performance of system because of increase hand-off of high-speed terminal. In this paper, we propose hand-off algorithm to improve the performance of reuse partitioning system using microcell according to the ratio of traffic distribution between innercell and outercell from resource management of high-speed and slowspeed terminal. Also, we compare to RPS and evaluate the teletraffic performance analysis of high-speed and slow-speed terminal through computer simulations that we derive the hand-off probability, call dropping probability.

  • PDF

Adaptive Application Component Mapping for Parallel Computation Offloading in Variable Environments

  • Fan, Wenhao;Liu, Yuan'an;Tang, Bihua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4347-4366
    • /
    • 2015
  • Distinguished with traditional strategies which offload an application's computation to a single server, parallel computation offloading can promote the performance by simultaneously delivering the computation to multiple computing resources around the mobile terminal. However, due to the variability of communication and computation environments, static application component multi-partitioning algorithms are difficult to maintain the optimality of their solutions in time-varying scenarios, whereas, over-frequent algorithm executions triggered by changes of environments may bring excessive algorithm costs. To this end, an adaptive application component mapping algorithm for parallel computation offloading in variable environments is proposed in this paper, which aims at minimizing computation costs and inter-resource communication costs. It can provide the terminal a suitable solution for the current environment with a low incremental algorithm cost. We represent the application component multi-partitioning problem as a graph mapping model, then convert it into a pathfinding problem. A genetic algorithm enhanced by an elite-based immigrants mechanism is designed to obtain the solution adaptively, which can dynamically adjust the precision of the solution and boost the searching speed as transmission and processing speeds change. Simulation results demonstrate that our algorithm can promote the performance efficiently, and it is superior to the traditional approaches under variable environments to a large extent.