• Title/Summary/Keyword: Dynamic Allocation

Search Result 681, Processing Time 0.029 seconds

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

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.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.

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

  • Seo, Sang Jun;Han, Man Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.973-974
    • /
    • 2013
  • This paper analyzes a characteristic of dynamic carrier and bandwidth allocation methods of OFDMA PON. We then discuss the possible problems when we implement those methods in hardware.

  • PDF

A Study on Dynamic Asset Allocation Strategy for Optimal Portfolio Selection

  • Lee, Hojin
    • East Asian Economic Review
    • /
    • v.25 no.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.

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

  • 최성미;김상언;홍경표
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • 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)
    • /
    • v.3 no.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
    • /
    • v.32 no.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
    • /
    • v.21 no.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.

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

  • Kim, Joo-Seok;Kim, Kyung-Seok;Park, Woo-Goo;Kim, Jin-Up
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12B
    • /
    • pp.1068-1075
    • /
    • 2006
  • Frequency resource value is growing bigger more with the development of the wireless communication. But Frequency shortage phenomenon is risen seriously because the need of Frequency resource is very many compared with the supply in an information society of the future. So we need Cognitive technique Radio which is taking the attention recently to use Frequency resource not to be not using efficiently. We propose efficient Dynamic Spectrum Allocation method in IEEE a 802.22 WRAN environment of CR foundation in this paper. To share spectrum more efficiently, we presented some Dynamic Spectrum Allocation technique to apply the Variable bandwidth, Mobility and verified this through the result of the simulations.

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
    • /
    • v.1 no.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.

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

  • 강상욱;신요안;최승철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1004-1014
    • /
    • 1999
  • MAC protocols in wireless ATM has to increase and maintain the system throughput performance. To achieve these purposes, this paper proposes a dynamic control algorithm called DSPA (Dynamic Signalling Period Allocation) for wireless ATM MAC protocol. The proposed DSPA algorithm consists of the following three algorithms. First, a control slot generation algorithm which generates the control slots by utilizing static and dynamic parameters from the terminals, is proposed. Second, a dynamic signalling period allocation algorithm is proposed for a base station to dynamically determine each signalling period according to current terminal states, and thus allocates the optimal signalling periods. Finally, a dynamic slot allocation algorithm is proposed to dynamically determine priorities of the terminals whenever a slot is allocated. Simulation results indicates that DSPA algorithm decreases average packet delay of the terminals by dynamic allocation of signal periods based on the system utilization, and thus increases the limitation of allowable loads that quarantee quality of services. Also the proposed algorithm is shown to maintain stable throughput even in the case of traffic variations.

  • PDF