• Title/Summary/Keyword: Data-rate fairness

Search Result 81, Processing Time 0.02 seconds

Power Allocation to Improve Data-Rate Fairness of Non-orthogonal Multiple Access Users (비직교 다중접속 사용자의 데이터 전송률 공정성 개선을 위한 전력 할당 기법)

  • Lee, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.9
    • /
    • pp.1117-1122
    • /
    • 2019
  • In this paper, a power allocation scheme is proposed to improve the fairness of user data rates in downlink non-orthogonal multiple access systems with one base station and two users. In particular, the power allocation scheme is presented to maximize the fairness of average user data rates assuming independent Rayleigh fading channels, where the fairness maximization is achieved when the average user data rates are equal. For the fairness evaluation, hence approximate expressions for the average user data rates and the average sum date rate of the proposed scheme are provided by using high signal-to-noise ratio approximation. Through simulation investigation, the derived approximate expressions for the average data rates are verified, and it is shown that the proposed scheme is superior to the conventional power allocation schemes in terms of the fairness of the average user data rates.

Simple Power Allocation Scheme for Data Rate Fairness in NOMA Systems (비직교 다중 접속 시스템에서 전송률 공정성을 위한 단순한 전력 할당 기법)

  • Lee, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.9
    • /
    • pp.1241-1244
    • /
    • 2020
  • In this paper, we consider a downlink non-orthogonal multiple access system with a base station and N mobile stations, where we assume that instantaneous channel state information (CSI) is available at the base station. A power allocation scheme is proposed to achieve perfect fairness, which means equal data rates for all mobile stations. However, the power allocation scheme using full CSI requires high complexity. Hence, a simple power allocation scheme with low complexity is proposed by using high signal-to-noise power ratio (SNR) approximation. The simple power allocation scheme can achieve perfect fairness only for high SNR. However, it needs only the best CSI and the simple procedure to obtain power allocation coefficients. From simulation results, we show that the simple power allocation scheme provides remarkable fairness performance at high SNR.

Power Allocation Scheme to Enhance Data-Rate Fairness for Non-orthogonal Multiple Access Systems in the Presence of Interference (간섭이 존재하는 비직교 다중접속 시스템에서 데이터 전송률 공정성 개선을 위한 전력 할당 기법)

  • Lee, In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.11
    • /
    • pp.1407-1413
    • /
    • 2019
  • In this paper, we assume that another transmitter can transmit its data signal in the same frequency band in order to maximize the frequency efficiency of non-orthogonal multiple access(NOMA) systems. We also focus on the improvement in fairness performance of receiver's data rates, not the maximization of sum data rate for NOMA systems. Thus, in this paper, we propose a power allocation scheme to enhance the fairness performance of average data rates of receivers considering the NOMA systems in the presence of interference. Assuming Rayleigh fading channels, the average data rates of receivers are defined, and the power allocation coefficients to improve the data-rate fairness are derived by using high signal-to-noise power ratio approximation. In addition, through simulations, it is shown that the proposed power allocation scheme can improve the data-rate fairness in the NOMA system with interference.

A TCP Fairness Guarantee Scheme with Dynamic Advertisement Window Adjustment for Mobile Broadband Wireless Access Networks (이동 광대역 무선 접속 네트워크에서 동적 Advertisement Window 조절을 통한 TCP Fairness 보장 기법)

  • Kim, Seong-Chul;Cho, Sung-Joon
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.2
    • /
    • pp.154-163
    • /
    • 2008
  • In a mobile broadband wireless access (MBWA) network, many users access a base station (BS), which relays data transferred from high-speed wired network to low-speed wireless network. For this difference of their data rate, a BS suffers from the lack of its buffer space when many users run multiple applications at the same time, and thus packet losses occur. TCP, which guarantees end-to-end reliability, is used as transport protocol also in wireless networks. But TCP lowers their transmission rate incorrectly and frequently whenever packet losses occur. And they increase their transmission rate differently with each other; finally TCP throughput of each TCP flow varies largely, and then TCP fairness goes worse. In this paper, a scheme that controls packet transmission rate adaptively according to TCP flows' transmission rate, that prevents buffer overflows at BS, and that guarantees TCP fairness at a certain degree is proposed. As it is analyzed by simulations, the proposed scheme enhances TCP fairness by maintaining TCP throughput of each TCP sender similarly with each other.

  • PDF

A Multi-Rate Aware Distributed Packet Scheduling in Ad-hoc Networks (에드혹 네트워크에서 다중 데이터률을 고려하는 분산 패킷 스케쥴링)

  • Roh Kwen-Mun;Chen Yong-Qian;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7B
    • /
    • pp.642-651
    • /
    • 2006
  • In ad-hoc network, the most of existing packet scheduling schemes provides throughput-based fairness. To provide throughput-based fairness, it basically supposes that the channel capacity is fixed. But, the supposing that the channel capacity is fixed is not appropriate because IEEE 802.11b and 802.11g which are normally used for organizing ad-hoc network can provide various data rate according to channel conditions. So, we define time-based fairness for each flow to consider multi-rate and suggest the MRADPS reaching the defined time-based fairness. Simulation result shows that MRADPS improves the total network throughput in ad-hoc network with providing time-based fairness to each flow.

Achievable Power Allocation Interval of Rate-lossless non-SIC NOMA for Asymmetric 2PAM

  • Chung, Kyuhyuk
    • International journal of advanced smart convergence
    • /
    • v.10 no.2
    • /
    • pp.1-9
    • /
    • 2021
  • In the Internet-of-Things (IoT) and artificial intelligence (AI), complete implementations are dependent largely on the speed of the fifth generation (5G) networks. However, successive interference cancellation (SIC) in non-orthogonal multiple access (NOMA) of the 5G mobile networks can be still decoding latency and receiver complexity in the conventional SIC NOMA scheme. Thus, in order to reduce latency and complexity of inherent SIC in conventional SIC NOMA schemes, we propose a rate-lossless non-SIC NOMA scheme. First, we derive the closed-form expression for the achievable data rate of the asymmetric 2PAM non-SIC NOMA, i.e., without SIC. Second, the exact achievable power allocation interval of this rate-lossless non-SIC NOMA scheme is also derived. Then it is shown that over the derived achievable power allocation interval of user-fairness, rate-lossless non-SIC NOMA can be implemented. As a result, the asymmetric 2PAM could be a promising modulation scheme for rate-lossless non-SIC NOMA of 5G networks, under user-fairness.

Additional Transmission Protocol for Fairness Enhancement in IEEE 802.11 Wireless LANs (IEEE 802.11 무선 랜에서 공평성 향상을 위한 추가 전송 프로토콜)

  • Kang, Tae-Uk;Kim, Sunmyeng
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2262-2269
    • /
    • 2016
  • In IEEE 802.11 wireless LANs, when a source node with low data rate occupies the channel resource for a long time, network performance degrades. In order to improve performance, the cooperative communication has been proposed. In the previous cooperative communication protocols, relay nodes deliver data packets only for a source node. In this paper, we propose an additional transmission scheme in which relay nodes select an additional source node based on several information and deliver data packets for the original source node and the selected additional source node. The proposed scheme improves performance and provides fairness among source nodes. Performance of the proposed scheme is investigated by simulation. Our results show that the proposed scheme outperforms the previous protocol in terms of fairness index and throughput.

Temporal Fairness Provisioning in Wirless LANs Considering Transport Layer Protocols (전송계층을 고려한 무선랜의 시간 공정성 보장)

  • Kang, Ji-Myung;Cho, Seong-Ho;Choi, Sun-Woong;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.374-383
    • /
    • 2008
  • IEEE 802.11 WLANs support various data rates in order to adapt to wireless channel condition. It is known that when some WLAN stations use a lower data rate than the others, total throughput is considerably degraded. The concept of temporal fairness which provides equal time to all stations has been introduced to alleviate this performance anomaly problem. However, most previous mechanisms assume that stations have infinite backlogs in the MAC layer and do not consider transport layer. In this paper, we first examine and analyze the performance of previous methods considering transport layer protocols. We then propose two new temporal fairness guarantee methods: AP priority and dynamic CWmin adjustment. We carried out extensive performance study via ns-2 computer simulations. The results show that the proposed methods provide temporal fairness and improve the throughput of WLANs in various environments.

Opportunistic Scheduling Schemes for Elastic Services in OFDMA Systems (OFDMA 시스템에서 Elastic 서비스를 위한 Opportunistic 스케줄링 기법)

  • Kwon, Jeong-Ahn;Lee, Jang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1A
    • /
    • pp.76-83
    • /
    • 2009
  • In this paper, we provide opportunistic scheduling schemes for elastic services in OFDMA systems with fairness constraints for each user. We adopt the network utility maximization framework in which a utility function is defined for each user to represent its level of satisfaction to the service. Since we consider elastic services whose degree of satisfaction depends on its average data rate, we define the utility function of each user as a function of its average data rate. In addition, for fair resource allocation among users, we define fairness requirements of each user by using utility functions. We first formulate an optimization problem for each fairness requirement that aim at maximizing network utility, which is defined as the sum of utilities of users. We then develop an opportunistic scheduling scheme for each fairness requirement by solving the problem using a dual approach and a stochastic sub-gradient algorithm.

A Fair Multicast Congestion Control Mechanism based on the Designated Server (지정된 서버를 이용한 공정한 멀티캐스트 혼잡제어 메커니즘)

  • Oh, Jae-Hwan;Kum, Jung-Hyun;Chung, Kwang-Sue;Kim, Hwa-Sung
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.233-241
    • /
    • 2002
  • In this paper, we proposed a new mechanism that solves the fairness problem between unicast traffic using the TCP and multicast traffic using the UDP, and satisfies the requirement of various receivers fairly in the Internet. The proposed mechanism decentralizes the load of blanket transmission rate control from sender to designated server, and uses the method that talc designated server intercepts the sender's data and controls the transmission rate suitable for it's local network. Therefore, the proposed mechanism not only provides multicast service by accurate estimation of the network status of each receiver, but also realizes both the inter-session fairness and the intra-session fairness problem.