• Title/Summary/Keyword: adaptive allocation

Search Result 290, Processing Time 0.03 seconds

Transmit Power Allocation for Soft Frequency Reuse in Coordinated Cellular Systems (인접셀간 협력하는 셀룰라 시스템에서 소프트 주차수 재사용을 위한 송신전력할당 기법)

  • Kim, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4A
    • /
    • pp.316-323
    • /
    • 2009
  • Power allocation of soft frequency reuse(SFR) to increase cell edge user throughput by reducing inter-cell interference is proposed for coordinated cellular systems. SFR is the effective technique to increase cell edge user throughput, however, it costs the degradation of total system throughput. The cost increases when SFR operated in distributed resource controlled systems fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmit power adaptively depending on user distribution so that it minimizes the loss of system throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Through system level simulation considering neighboring two cells, evaluation result for adaptive power allocation is shown compared with static power allocation.

An Adaptive Resource Allocation Scheme in Cognitive Radio Network Assisted Satellite (무선 인지 네트워크에서 위성을 이용한 적응적인 자원 할당 기법)

  • Lee, Seon-Yeong;Sohn, Sung-Hwan;Jang, Sung-Jin;Kim, Jae-Moung
    • Journal of Satellite, Information and Communications
    • /
    • v.4 no.2
    • /
    • pp.5-11
    • /
    • 2009
  • In this paper, we propose our design of adaptive resource allocation in the cognitive radio network assisted by satellite to improve the performance of Cognitive Radio user. Most of today’s telecommunication network operates in a fixed, licensed frequency band using a specific spectrum access network. However, the spectrum is not always used all the time, all the band. It causes the inefficiency in the spectrum usage. Thus, cognitive radio network is proposed to solve these spectrum inefficiency problems. The cognitive radio users (secondary users) are coexistent with primary users (PUs) who are licensed. That cognitive radio network is considered as lower priority comparing with primary user. So, the operation of the cognitive radio network is limited to interference constraints. Especially, when the number of secondary users increases, CCI among SUs will increase as well as interference to PU. That motivates our objective to improve the performance even if cognitive radio users increase. To solve this problem, we suggest an adaptive resource allocation scheme to improve the performance of cognitive radio network assisted by satellite. Through this algorithm, we can improve the cognitive radio network performance. And the simulation results confirm the effectiveness of our proposed algorithm.

  • PDF

IPS-based Dynamic Bandwidth Allocation Algorithm with Adaptive Maximum Transmission Window to Increase Channel Utilization in EPON (EPON에서의 효율성 향상을 위한 가변 최대 전송 윈도우를 이용한 IPS 기반의 동적 대역폭 할당 알고리즘)

  • Cho, Seung-Moo;Oh, Chang-Yeong;Chung, Min-Young;Choo, Hyun-Seung;Lee, Tae-Jin
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.477-486
    • /
    • 2009
  • This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.

Adaptive Bandwidth Allocation for QoS Guaranteed VLC Based WPAN

  • Saha, Nirzhar;Mondal, Ratan Kumar;Jang, Yeong Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.8
    • /
    • pp.719-724
    • /
    • 2013
  • Visible light communication based wireless personal area network (WPAN) has recently remained in the center of attention, as it shows a lot of promise to a be a perfect replacement for the contemporary Radio frequency (RF) communication at least in the indoor environment. A commercially deployable VLC based WPAN must support diverse traffic requirement for different kinds of service. In this paper, we have proposed an innovative bandwidth allocation scheme for VLC based WPAN. We wish to allocate bandwidth adaptively for users in a network where bandwidth for each user is allocated scalably. Our aim is to allow maximum number of users in a VLC based WPAN where each user is guaranteed their required QoS. The simulation results justify that the proposed scheme is better than the conventional scheme.

A Bit Allocation Algorithm Using Adaptive Bandwidth for DMT (적응적인 대역폭을 이용한 DMT에서의 비트 할당 알고리듬)

  • 최현우;신봉식;정정화
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.372-375
    • /
    • 1999
  • This paper proposes a bit allocation algorithm using adaptive bandwidth for ADSL that uses the DMT technology. In certain cases for high attenuation loops the conventional algorithms are unable to assign data bits to the higher frequency tones, due to the power spectrum mask limitation recommended by ANSI Standard, even if the total power budget is not expended. In the proposed bit allocation algorithm, adjacent empty tones that would not be used merge into single tone, then additional bits is assigned to the merged empty tones. Because additional bits is allocated, most of the available power is used. The proposed algorithm show that total bit increase in about 2~9% bits more than about conventional "water-filling" and "bit removal" algorithms and that is able to use about 93% of the available budget Power

  • PDF

An Adaptive Rate Allocation to Source-Channel Coding for Internet Video

  • Kwon, Jae-Cheol;Kim, Jae-Kyoon
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1915-1919
    • /
    • 2003
  • A practical method of adaptive rate allocation to source and channel codings for an independent loss channel is proposed for Internet video. It is based on the observations that the values of residual loss probabilities at the optimal code rates for different packet loss probabilities are closely clustered to the average residual loss probability for a transmission frame size n in RS(n,k) code and for a total bit rate R. These observations aye then exploited to find the code rate for maximum PSNR. Simulation results demonstrate that the proposed method achieves a near-optimal bit-rate allocation in the joint source-channel coding of H.263 and RS(n,k) codings.

  • PDF

Adaptive Resource Allocation for Traffic Flow Control in Hybrid Networks

  • Son, Sangwoo;Rhee, Byungho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.1
    • /
    • pp.38-55
    • /
    • 2013
  • Wireless network systems provide fast data transmission rates and various services to users of mobile devices such as smartphones and smart pads. Because many people use high-performance mobile devices, the use of real-time multimedia services is increasing rapidly. However, the preoccupation of resources by real-time traffic users is causing harm to other services-for example, frequent call interference, lowered service quality, and poor network performance. This paper suggests a resource allocation algorithm for effective traffic service support in a hybrid network. The main objective is to obtain an optimum value of data rates by comparing user requirements with the amount of resources that can be allocated. A new mechanism based on Adaptive-Quality of Service (QoS) and a monitoring system based on Queue-Aware are proposed. Adaptive-QoS supports effective resource control according to the type of traffic service, and the monitoring system based on Queue-Aware measures the amount of resources in order to calculate the maximum that can be allocated. We apply our algorithm to a test system and use Qualnet 4.5.1 to evaluate its performance.

Cross-layer Dynamic Subcarrier Allocation with Adaptive Service Rate Control in SC-FDMA System

  • Ye, Fang;Su, Chunxia;Li, Yibing;Zhang, Xu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4823-4843
    • /
    • 2017
  • In this paper, an improved utility-based cross-layer dynamic subcarrier allocation (DSA) algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system, which adopts adaptive service rate control (ASRC) to eliminate the service rate waste and improve the spectral efficiency in heterogeneous network including non-real-time traffic and real-time traffic. In this algorithm, furthermore, a first in first out (FIFO) queuing model with finite space is established on the cross-layer scheduling framework. Simulation results indicate that by taking the service rate constraint as the necessary condition for optimality, the ASRC algorithm can effectively eliminate the service rate waste without compromising the scheduling performance. Moreover, the ASRC algorithm is able to further improve the quality of service (QoS) performance and transmission throughput by contributing an attractive performance trade-off between real-time and non-real-time applications.

Call Admission Control Based on Adaptive Bandwidth Allocation for Wireless Networks

  • Chowdhury, Mostafa Zaman;Jang, Yeong Min;Haas, Zygmunt J.
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.15-24
    • /
    • 2013
  • Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

User-Information based Adaptive Service Management Algorithm (사용자 정보기반의 적응적인 서비스관리 알고리즘)

  • Park, Hea-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.8
    • /
    • pp.81-88
    • /
    • 2009
  • Many studies and policies are suggested for customer satisfaction to survive in multimedia content service markets. there are policies like a segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM. The problem of this policy is fixed allocation of media server resources. It is inefficient for costly media server resource. To resolve the problem and enhance the utilization of media server resource, the ACRFA (Adaptive Client Request Filtering Algorithm) was suggested per cluster to allocate media server resources by flexible resource allocation method.