• Title/Summary/Keyword: Dynamic Access

Search Result 864, Processing Time 0.024 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.

Dynamic Access Control for Personalized Environment in Ubiquitous Computing

  • Kim, Yuna;Shin, IlShik;Hong, Sung Je;Kim, Jong
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.4
    • /
    • pp.233-241
    • /
    • 2007
  • In an ubiquitous environment, for controlling user access according to environment of users, a number of access control models enforcing dynamic environment of users have been proposed. However, they do not support personalized environments of each user and have a run-time overhead of searching active roles. In this paper, we propose a new model, PE-RBAC, that extends the RBAC architecture by addition of a personalized environment component as a constraint to accommodate dynamic and mobile users. In this model, a dynamic role activation is presented by using a new role-to-environment structure instead of the conventional role hierarchy, which makes it efficient to find the active roles according to a user's personalized environment.

  • PDF

Context-based Dynamic Access Control Model for u-healthcare and its Application (u-헬스케어를 위한 상황기반 동적접근 제어 모델 및 응용)

  • Jeong, Chang-Won;Kim, Dong-Ho;Joo, Su-Chong
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.493-506
    • /
    • 2008
  • In this paper we suggest dynamic access control model based on context satisfied with requirement of u-healthcare environment through researching the role based access control model. For the dynamic security domain management, we used a distributed object group framework and context information for dynamic access control used the constructed database. We defined decision rule by knowledge reduction in decision making table, and applied this rule in our model as a rough set theory. We showed the executed results of context based dynamic security service through u-healthcare application which is based on distributed object group framework. As a result, our dynamic access control model provides an appropriate security service according to security domain, more flexible access control in u-healthcare environment.

PERFORMANCE OF MYOPIC POLICY FOR MULTI-CHANNEL DYNAMIC SPECTRUM ACCESS NETWORKS

  • Lee, Yutae
    • East Asian mathematical journal
    • /
    • v.30 no.1
    • /
    • pp.23-29
    • /
    • 2014
  • To solve inefficient spectrum usage problem under current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy, which maximizes immediate throughput, is a simple and robust strategy with reduced complexity. In this paper, we present a simple mathematical model to evaluate the saturation throughput and medium access delay of a myopic policy in the presence of multiple channels.

PERIODIC SENSING AND GREEDY ACCESS POLICY USING CHANNEL MODELS WITH GENERALLY DISTRIBUTED ON AND OFF PERIODS IN COGNITIVE NETWORKS

  • Lee, Yutae
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.129-136
    • /
    • 2014
  • One of the fundamental issues in the design of dynamic spectrum access policy is the modeling of the dynamic behavior of channel occupancy by primary users. Under a Markovian modeling of channel occupancy, a periodic sensing and greedy access policy is known as one of the simple and practical dynamic spectrum access policies in cognitive radio networks. In this paper, the primary occupancy of each channel is modeled as a discrete-time alternating renewal process with generally distributed on- and off-periods. A periodic sensing and greedy access policy is constructed based on the general channel occupancy model. Simulation results show that the proposed policy has better throughput than the policies using channel models with exponentially distributed on- or off-periods.

Performance Evaluation of Myopic Policy for Dynamic Spectrum Access (동적 스펙트럼 접속을 위한 myopic 방식의 성능 분석)

  • Lee, Yutae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1101-1105
    • /
    • 2013
  • Due to underutilization of spectrum under the current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy is a simple policy with reduced complexity that maximizes the immediate throughput. In this paper, the distribution of its medium access delay is evaluated under saturation traffic conditions. Using the distribution of the medium access delay, we also evaluate its system delay under non-saturated traffic conditions.

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.

A Generalized Markovian Based Framework for Dynamic Spectrum Access in Cognitive Radios

  • Muthumeenakshi, K.;Radha, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1532-1553
    • /
    • 2014
  • Radio spectrum is a precious resource and characterized by fixed allocation policy. However, a large portion of the allocated radio spectrum is underutilized. Conversely, the rapid development of ubiquitous wireless technologies increases the demand for radio spectrum. Cognitive Radio (CR) methodologies have been introduced as a promising approach in detecting the white spaces, allowing the unlicensed users to use the licensed spectrum thus realizing Dynamic Spectrum Access (DSA) in an effective manner. This paper proposes a generalized framework for DSA between the licensed (primary) and unlicensed (secondary) users based on Continuous Time Markov Chain (CTMC) model. We present a spectrum access scheme in the presence of sensing errors based on CTMC which aims to attain optimum spectrum access probabilities for the secondary users. The primary user occupancy is identified by spectrum sensing algorithms and the sensing errors are captured in the form of false alarm and mis-detection. Simulation results show the effectiveness of the proposed spectrum access scheme in terms of the throughput attained by the secondary users, throughput optimization using optimum access probabilities, probability of interference with increasing number of secondary users. The efficacy of the algorithm is analyzed for both imperfect spectrum sensing and perfect spectrum sensing.

Implicit Scheduling Algorithm for Dynamic Slot Assignment in Wireless ATM Networks (무선 ATM 네트워크에서의 동적 대역 할당을 위한 묵시적 스케쥴링 알고리즘)

  • 황민재;강충구;김용진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1229-1238
    • /
    • 1999
  • To maximize the statistical multiplexing gain in wireless ATM MAC, a centralized scheduling function must be provided for the dynamic slot assignment in the wireless ATM access point. Exploiting the dynamic parameters received in the wireless ATM access point, the centralized scheduler will execute a dynamic slot assignment to determine bandwidth required for individual wireless terminal. In this paper, we propose a new scheduling algorithm, which can effectively reduce a burden of the explicit signaling requirement of transmitting the dynamic parameters in a timely manner. We have demonstrated that the proposed approach outperforms the existing schemes in terms of the timeliness of transmitting the dynamic parameters, which is a critical factor to the performance of delay-sensitive service classes, and works as an effective means of dynamic slot assignment without heavily relying on the dynamic parameters in the wireless ATM networks.

  • PDF

Dynamic Spectrum Access Using Belief Vector Tracking Method for Other Competing Secondary Users (다른 이차사용자의 신뢰 벡터를 추적하여 이차사용자 사이의 충돌을 줄이기 위한 동적 스펙트럼 접속 방식)

  • Lee, Yutae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2547-2552
    • /
    • 2013
  • To achieve better performance in dynamic spectrum access networks, each secondary user tracks channels and chooses a good channel to transmit its packet. When all secondary users adopt the same dynamic spectrum access policy, they have similar channel information, which leads secondary users to choose the same channel and more collisions among them. To relieve this problem, we propose an access policy using belief vector tracking method for other competing secondary users. Simulation results are provided to show that the proposed policy yields better performance than the existing policies which do not take into account what other secondary users are doing.