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

검색결과 681건 처리시간 0.042초

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • 제15권1호
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

OFDMA-PON의 동적캐리어 및 대역할당 방법의 구현 타당성 (Implementation Feasibility of Dynamic carrier and bandwidth allocation method for OFDMA-PON)

  • 서상준;한만수
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2013년도 추계학술대회
    • /
    • pp.973-974
    • /
    • 2013
  • 이 논문에서는 OFDMA PON에서의 일반적인 동적 캐리어 및 동적대역할당 방법의 특성을 분석한다. 또한 이러한 방법들을 하드웨어로 구현할 때의 문제점을 분석한다.

  • PDF

A Study on Dynamic Asset Allocation Strategy for Optimal Portfolio Selection

  • Lee, Hojin
    • East Asian Economic Review
    • /
    • 제25권3호
    • /
    • pp.310-336
    • /
    • 2021
  • We use iterative numerical procedures combined with analytical methods due to Rapach and Wohar (2009) to solve for the dynamic asset allocation strategy for optimal portfolio demand. We compare different optimal portfolio demands when investors in each country have different access to overseas and domestic investment opportunities. The optimal dynamic asset allocation strategy without foreign investment opportunities leads domestic investors in Korea, Hong Kong, and Singapore to allocate more funds to domestic bonds than to domestic stocks. However, the U.S. investors allocate more wealth to domestic stocks than to domestic bonds. Investors in all countries short bills at a low level of risk aversion. Next, we investigate dynamic asset allocation strategy when domestic investors in Korea have access to foreign markets. The optimal portfolio demand leads investors in Korea to allocate most resources to domestic bonds and foreign stocks. On the other hand, the portfolio weights on foreign bonds and domestic stocks are relatively low. We also analyze dynamic asset allocation strategy for the investors in the U.S., Hong Kong, and Singapore when they have access to the Korean markets as overseas investment opportunities. Compared to the results when the investors only have access to domestic markets, the investors in the U.S. and Singapore increase the portfolio weights on domestic stocks in spite of the overseas investment opportunities in the Korean markets. The investors in the U.S., Hong Kong, and Singapore short domestic bills to invest more than initial funds in risky assets with a varying degree of relative risk aversion coefficients without exception.

IPv6에서 멀티캐스트 어드레스 할당방법 (Multicast address allocation for IPv6)

  • 최성미;김상언;홍경표
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 하계종합학술대회 논문집
    • /
    • pp.118-121
    • /
    • 1999
  • Multicast addresses cannot be permanently assigned to particular application or group combination, but need to be available for re-use. So, this requires a dynamic multicast address allocation and release mechanism. For a dynamic multicast address allocation and release mechanism, we must consider low blocking probability, low delay, low control traffic overhead. In this paper, we suggest a efficient dynamic multicast address allocation and release mechanism based on the multicast scope

  • PDF

Fairness-insured Aggressive Sub-channel Allocation and Efficient Power Allocation Algorithms to Optimize the Capacity of an IEEE 802.16e OFDMA/TDD Cellular System

  • Ko, Sang-Jun;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권4호
    • /
    • pp.385-398
    • /
    • 2009
  • This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

Performance Analysis of Dynamic Spectrum Allocation in Heterogeneous Wireless Networks

  • Ha, Jeoung-Lak;Kim, Jin-Up;Kim, Sang-Ha
    • ETRI Journal
    • /
    • 제32권2호
    • /
    • pp.292-301
    • /
    • 2010
  • Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

Dynamic Routing and Spectrum Allocation with Traffic Differentiation to Reduce Fragmentation in Multifiber Elastic Optical Networks

  • ZOUNEME, Boris Stephane;ADEPO, Joel;DIEDIE, Herve Gokou;OUMTANAGA, Souleymane
    • International Journal of Computer Science & Network Security
    • /
    • 제21권3호
    • /
    • pp.1-10
    • /
    • 2021
  • In recent decades, the heterogeneous and dynamic behavior of Internet traffic has placed new demands on the adaptive resource allocation of the optical network infrastructure. However, the advent of multifiber elastic optical networks has led to a higher degree of spectrum fragmentation than conventional flexible grid networks due to the dynamic and random establishment and removal of optical connections. In this paper, we propose heuristic routing and dynamic slot allocation algorithms to minimize spectrum fragmentation and reduce the probability of blocking future connection requests by considering the power consumption in elastic multifiber elastic optical networks.

IEEE 802.22 WRAN에서 Cognitive Radio를 위한 효율적인 Spectrum 할당 기법 (Efficient Spectrum Allocation Method for Cognitive Radio in IEEE 802.22 WRAN)

  • 김주석;김경석;박우구;김진업
    • 한국통신학회논문지
    • /
    • 제31권12B호
    • /
    • pp.1068-1075
    • /
    • 2006
  • 주파수 자원 가치는 무선통신의 발전과 함께 더욱 커지고 있다. 하지만 앞으로 정보화 사회에서는 주파수 자원의 수요가 공급에 비하여 매우 많기 때문에 주파수 부족 현상이 심각하게 대두된다. 따라서 사용되지 않고 있는 주파수 자원을 효율적으로 이용하기 위한 기술로서 최근 각광을 받고 있는 Cognitive Radio 기술이 필요한 시점이다. 본 논문에서는 CR 기반의IEEE 802.22 WRAN 환경에서 효율적인 Dynamic Spectrum Allocation 기법을 제안한다. Spectrum을 좀 더 효율적으로 공유하기 위해 Variable bandwidth, Mobility의 변수를 적용한 Dynamic Spectrum Allocation 기법을 제시하고 시뮬레이션 결과들을 통해 이를 검증하였다.

Optimal Thrust Allocation for Dynamic Positioning of Deep-sea Working Vessel

  • Zhao, Luman;Roh, Myung-Il;Hong, Jeong-Woo
    • Journal of Advanced Research in Ocean Engineering
    • /
    • 제1권2호
    • /
    • pp.94-105
    • /
    • 2015
  • In this study, a thruster allocation method of a deep-sea working vessel was proposed with the aims of producing the demanded generalized forces and moment for dynamic positioning while at the same time minimizing total power. For this, an optimization problem for thrust allocation was mathematically formulated with design variables, objective function, and constraints. The genetic algorithms (GA) was used to solve the formulated problem. The proposed method was applied to an example of finding optimal thrust allocation of the deep-sea working vessel having 5 thrusters. The result showed that the method could be used to determine better strategy for thruster allocation of the vessel as compared to existing study.

무선 ATM MAC 프로토콜에서 동적 신호 주기 할당 알고리즘 (A Dynamic Signalling Period Allocation Algorithm in Wireless ATM MAC Protocols)

  • 강상욱;신요안;최승철
    • 한국통신학회논문지
    • /
    • 제24권6B호
    • /
    • pp.1004-1014
    • /
    • 1999
  • 무선 ATM MAC 프로토콜은 시스템의 처리율 성능을 높이고 이를 안정적으로 유지시킬 수 있어야 한다. 이를 위하여, 본 논문에서는 무선 ATM의 MAC 프로토콜에 사용되는 동적 제어 알고리즘으로써 DSPA (Dynamic Signalling Period Allocation) 알고리즘을 제안하였다. 제안된 DSPA 알고리즘은, 고정된 처리율을 이용하지 않고 단말로부터 전송된 정적 및 동적 매개변수만을 이용하여 제어용 슬롯을 동적으로 발생하는 제어용 슬롯 발생 알고리즘, 시스템의 사용 상황에 따라 기지국이 매번 신호 주기를 동적으로 결정하게 하므로써 매 순간 최적의 신호주기가 할당되도록 하는 동적 신호 주기 할당 알고리즘, 그리고 슬롯이 할당될 때마다 단말의 우선 순위를 변화시키는 동적 슬롯 할당 알고리즘으로 크게 구성된다. 모의실험을 통한 성능 평가 결과, DSPA 알고리즘은 시스템의 사용 상황을 반영하여 신호 주기를 동적으로 결정하므로써 단말의 평균 대기 시간을 감소시키고 이로부터 서비스 품질을 보장할 수 있는 부하 한계를 향상하며, 안정적인 처리율 성능을 보임을 알 수 있다.

  • PDF