• Title/Summary/Keyword: asymmetric traffic requirements

Search Result 7, Processing Time 0.022 seconds

Joint Relay Selection and Power Allocation for Two-way Relay Channels with Asymmetric Traffic Requirements

  • Lou, Sijia;Yang, Longxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1955-1971
    • /
    • 2013
  • This paper studies relay selection and power allocation for amplify-and-forward (AF) based two-way relay networks (TWRN) with asymmetric traffic requirements (ATR). A joint relay selection and power allocation algorithm is proposed to decrease the outage probability of TWRN with ATR. In this algorithm, two sources exchange information with the help of the relay during two time slots. We first calculate the optimal power allocation parameters based on instantaneous channel state information (CSI), and then derive a tight lower bound of outage probability. Furthermore, we propose a simplified relay selection criterion, which can be easily calculated as harmonic mean of instantaneous channel gains, according to the outage probability expressions. Simulation results verified the theoretical analyses we presented. It is shown that the outage probability of our algorithm improves 3-4dB comparing with that of other existing algorithms, and the lower bound is tight comparing with actual value for the entire signal-to-noise ratio (SNR) region.

A Bandwidth Allocation Scheme using NBS in a Multiservice Networks (멀티서비스 네트워크에서 NBS를 이용한 대역폭 할당 기법)

  • Park, Jae-Sung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.1
    • /
    • pp.66-71
    • /
    • 2012
  • In this paper, using the bargaining game theory, we propose a bandwidth management scheme that allocates bandwidth in an efficient and proportionally fair manner between the service classes with different service requirements. Since the traffic input rates of the classes are asymmetric in most of the time, the proposed scheme allocates bandwidth in proportion to the traffic input rates to increase the bandwidth utilization while protecting the quality of service of a class against the excessive traffic input of the other classes. In addition, the proposed method considers the weights of classes so that the bandwidth is allocated differentially among the classes.

The Study on the Adactive H-ARQ Technique in TD-CDMA 3G System (TD-CDMA 3G 시스템의 적응형 H-ARQ 기법들에 관한 연구)

  • Suk, Kyung-Hyu;Park, Sung-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.450-456
    • /
    • 2010
  • In the high-speed packet service, next generation mobile communication system has emerged as a major feature. If the fire of these high-speed kit services and non-continuous transmission of data due to the symmetrical nature of daeyiteo traffic for D-CDMA system has been actively studied. Small amounts of data moving in the uplink, but the real-time video downlink transmission, such as downloading large files to move data and services to those with asymmetric traffic characteristics, a system that can efficiently handle the data requirements be. Of 3GPP TDD(Time Division Duplex) scheme based on CDMA and TDMA in a way by introducing the concept through the proper allocation of time slots that can handle asymmetric traffic efficiently, has an advantage. TD-CDMA system by considering the characteristics of the frame configuration of transmission methods, such as physical channel structure and channel coding has been investigated. In addition, the HARQ scheme TD-CDMA system performance is analyzed by comparing them.

Performance Optimization of Two-Way AF Relaying in Asymmetric Fading Channels

  • Qi, Yanyan;Wang, Xiaoxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4432-4450
    • /
    • 2014
  • It is widely observed that in practical wireless cooperative communication systems, different links may experience different fading characteristics. In this paper, we investigate into the outage probability and channel capacity of two-way amplify-and-forward (TWAF) relaying systems operating over a mixed asymmetric Rician and Rayleigh fading scenario, with different amplification policies (AP) adopted at the relay, respectively. As TWAF relay network carries concurrent traffics towards two opposite directions, both end-to-end and overall performance metrics were considered. In detail, both uniform exact expressions and simplified asymptotic expressions for the end-to-end outage probability (OP) were presented, based on which the system overall OP was studied under the condition of the two source nodes having non-identical traffic requirements. Furthermore, exact expressions for tight lower bounds as well as high SNR approximations of channel capacity of the considered scenario were presented. For both OP and channel capacity, with different APs, effective power allocation (PA) schemes under different constraints were given to optimize the system performance. Extensive simulations were carried out to verify the analytical results and to demonstrate the impact of channel asymmetry on the system performance.

Concurrency Control based on Serialization Graph for Query Transactions in Broadcast Environment : CCSG/QT (방송환경에서 질의 거래를 위해 직렬화 그래프에 기반을 둔 동시성 제어 기법)

  • 이욱현;황부현
    • Journal of KIISE:Databases
    • /
    • v.30 no.1
    • /
    • pp.95-107
    • /
    • 2003
  • The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and mews updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose the efficient concurrency control for query transaction in broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also use the serialization graph scheme to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

Optimistic Concurrency Control based on TimeStamp Intervals for Broadcast Environment: OCC/TI (방송환경에서 타임스탬프 구간에 기반을 둔 낙관적 동시성 제어 기법)

  • 이욱현;황부현
    • Journal of KIISE:Databases
    • /
    • v.29 no.6
    • /
    • pp.477-491
    • /
    • 2002
  • The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

Generation and Distribution of Symmetric/Asymmetric Secret Keys for Secure Communications in Koinonia High-rate WPAN (Koinonia 고속 WPAN에서 보안을 위한 대칭/비대칭 비밀 키 교환 방법)

  • Yim Soon-Bin;Jung Ssang-Bong;Lee Tae-Jin;June Sun-Do;Lee Hyeon-Seok;Kwon Tai-Gil;Cho Jin-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6B
    • /
    • pp.551-560
    • /
    • 2006
  • Security in WPAN is one of the most fundamental issues to overcome the barrier of wireless environment. Although piconet security mechanisms have been defined in the WPAN standards, many remains open and are left for implementation. Koinonia is a high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. In Koinonia WPAN, a piconet consists of one master and more than one slave, and piconet security mechanisms is not defined at all. Therefore, we propose a robust piconet security mechanism for secure communications between slaves in a piconet. Based on security requirements analysis, our proposed protocols are shown to meet the security needs for Koinonia high-rate WPAN.