• Title/Summary/Keyword: asymmetric traffic

Search Result 51, Processing Time 0.024 seconds

Energy-Aware Hybrid Cooperative Relaying with Asymmetric Traffic

  • Chen, Jian;Lv, Lu;Geng, Wenjin;Kuo, Yonghong
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.717-726
    • /
    • 2015
  • In this paper, we study an asymmetric two-way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time-division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy-efficient transmission. Our scheme is based on the asymmetric level of the two source nodes' target signal-to-noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.

Dynamic Channel Allocation and Channel Access Mechanism of Multimedia Traffic in the UTRA TDD Systems (UTRA TDD 시스템에서 멀티미디어 트래픽의 동적 채널 할당 및 채널 액세스 매커니즘)

  • 주용원;윤찬영;오영환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8C
    • /
    • pp.819-827
    • /
    • 2002
  • Personal mobile communication has been developed up to IMT-2000 which is called the third generation mobile communication. The first generation of personal mobile communication was analog cellular, the second was digital cellular, and the 2.5 generation was PCS. Before the third generation had been developed, the personal mobile communication service was focused mainly on the voice-oriented service. But, we can expect that multimedia service after the third generation system will be the core of the subject. T In this thesis, we propose a dynamic resource allocation algorithm in the UTRA TDD systems which can support the asymmetric traffic propensity and multimedia traffic. The proposed algorithm consists two sub-algorithms. One is the dynamic channel allocation method that determines the amount of bandwidth assigned between uplink and downlink according to resource allocation status list through asymmetric traffic propensity. The other is the channel access mechanism that assigns RU to bearer service generated in a cell. By simulation, the proposed dynamic resource allocation algorithm is proved to support asymmetric propensity of traffic and shows a better throughput for multimedia traffic.

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.

Network-Coded Bi-Directional Relaying Over an Asymmetric Channel (비대칭 채널에서의 네트워크 코딩 기반 양방향 릴레이 전송 기법)

  • Ryu, Hyun-Seok;Lee, Jun-Seok;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.3
    • /
    • pp.172-179
    • /
    • 2013
  • In this paper, we consider network-coded bi-directional relaying (NCBR) schemes over an asymmetric channel, in which bi-directional links have the different channel quality, as well as the asymmetric traffic load. In order to deal with asymmetric nature, two different types of NCBR schemes are considered: network coding after padding (NaP) and network coding after fragmentation (NaF). Even if NaP has been known as only a useful means of dealing with the asymmetry in traffic load up to now, our analysis shows that its gain can be significantly lost by the asymmetry in channel quality, under the given bit error performance constraint. Furthermore, it is shown that NaF always outperforms NaP, as well as traditional bi-directional relaying scheme.

Bidding, Pricing, and User Subscription Dynamics in Asymmetric-Valued Korean LTE Spectrum Auction: A Hierarchical Dynamic Game Approach

  • Jung, Sang Yeob;Kim, Seong-Lyun
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.658-669
    • /
    • 2016
  • The tremendous increase in mobile data traffic coupled with fierce competition in wireless industry brings about spectrum scarcity and bandwidth fragmentation. This inevitably results in asymmetric-valued long term evolution (LTE) spectrum allocation that stems from different timing for twice improvement in capacity between competing operators, given spectrum allocations today. This motivates us to study the economic effects of asymmetric-valued LTE spectrum allocation. In this paper, we formulate the interactions between operators and users as a hierarchical dynamic game framework, where two spiteful operators simultaneously make spectrum acquisition decisions in the upper-level first-price sealed-bid auction game, and dynamic pricing decisions in the lower-level differential game, taking into account user subscription dynamics. Using backward induction, we derive the equilibrium of the entire game under mild conditions. Through analytical and numerical results, we verify our studies by comparing the latest result of LTE spectrum auction in South Korea, which serves as the benchmark of asymmetric-valued LTE spectrum auction designs.

An All-Optical Gain-Controlled Amplifier for Bidirectional Transmission

  • Choi, Bo-Hun;Hong, Kyung-Jin;Kim, Chang-Bong;Won, Yong-Hyub
    • ETRI Journal
    • /
    • v.28 no.1
    • /
    • pp.1-8
    • /
    • 2006
  • A novel all-optical gain-controlled (AOGC) bidirectional amplifier is proposed and demonstrated in a compact structure. The AOGC function using fiber Bragg grating (FBG) pairs controls both directional signals independently, and combinations of optical interleavers and isolators suppress Rayleigh backscattering (RB) noise. The amplifier achieves high and constant gain with a wide dynamic input signal range and low noise figure. The performance does not depend on the input signal conditions, whether static-state or transient signals, or whether there is symmetric or asymmetric data traffic on bidirectional transmission. Transmission comparison experiments between invariable symmetrical and random variable asymmetric bidirectional data traffic verify that the all-optical gain control and bidirectional amplification functions are successfully combined into this proposed amplifier.

  • PDF

A Fuzzy Traffic Controller with Asymmetric Membership Functions (비대칭적인 소속 함수를 갖는 퍼지 교통 제어기)

  • Kim, Jong-Wan;Choi, Seung-Kook
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2485-2492
    • /
    • 1997
  • Nowadays the traffic conditions have been getting worse due to continuous increase in the number of vehicles. So it has become more important to manage traffic signal lights efficiently. Recently fuzzy logic is introduced to control the cycle time of traffic lights adaptively. Conventional fuzzy logic controller adjusts the extension time of current green phase by using the fuzzy input variables such as the number of entering vehicles at the green light and the number of waiting vehicle during the red light. However this scheme is inadequate for an intersection with variable traffic densities. In this paper, a new FLC with asymmetric membership functions that reflects more exactly traffic flows than other FLCs with symmetric ones regardless of few control rules is propsed. The effectiveness of the proposed method was shown through simulation of a single intersection. The experimental results yielded the superior performance of the proposed FLC in terms of the average delay time, the number of passed vehicles, and the degree of saturation.

  • PDF

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.

Opportunistic Spectrum Access with Dynamic Users: Directional Graphical Game and Stochastic Learning

  • Zhang, Yuli;Xu, Yuhua;Wu, Qihui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5820-5834
    • /
    • 2017
  • This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

A Selective Control Mechanism for Fairness of DQDB in Client-Server Traffic (클라이언트-서버 트래픽에서 DQDB 공정성을 위한 선택제어 방식)

  • 김정홍;황하응
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.128-135
    • /
    • 2003
  • A fairness control method for Distributed-Queue Dual-Bus(DQDB) has been studied under specific traffic types such as equal probability traffic, symmetric traffic and asymmetric traffic. To distribute DQDB network bandwidth fairly to all stations under general traffic such as a client-server traffic that differs from specific traffic types, we propose an effective fairness control method. Based on an access limit, the proposed mechanism applies two bandwidth control mechanisms to DQDB networks. One is the mechanism that is called APS(Access Protection Scheme) for servers. And another is the mechanism that controls the allocation of bandwidth only using an access limit lot clients. Simulation results show that it outperforms other mechanisms.

  • PDF