• Title/Summary/Keyword: Throughput optimization

Search Result 240, Processing Time 0.021 seconds

Full-Duplex Operations in Wireless Powered Communication Networks

  • Ju, Hyungsik;Lee, Yuro;Kim, Tae-Joong
    • ETRI Journal
    • /
    • v.39 no.6
    • /
    • pp.794-802
    • /
    • 2017
  • In this paper, a wireless powered communication network (WPCN) consisting of a hybrid access point (H-AP) and multiple user equipment (UE), all of which operate in full-duplex (FD), is described. We first propose a transceiver structure that enables FD operation of each UE to simultaneously receive energy in the downlink (DL) and transmit information in the uplink (UL). We then provide an energy usage model in the proposed UE transceiver that accounts for the energy leakage from the transmit chain to the receive chain. It is shown that the throughput of an FD WPCN using the proposed FD UE (FD-WPCN-FD) can be maximized by optimal allocation of the UL transmission time to the UE by solving a convex optimization problem. Simulation results reveal that the use of the proposed FD UE efficiently improves the throughput of a WPCN with a practical self-interference cancellation capability at the H-AP. Compared to the WPCN with FD H-AP and half-duplex (HD) UE, FD-WPCN-FD achieved an 18% throughput gain. In addition, the throughput of FD-WPCN-FD was shown to be 25% greater than that of WPCN in which an H-AP and UE operated in HD.

Throughput-Delay Analysis of One-to-ManyWireless Multi-Hop Flows based on Random Linear Network

  • Shang, Tao;Fan, Yong;Liu, Jianwei
    • Journal of Communications and Networks
    • /
    • v.15 no.4
    • /
    • pp.430-438
    • /
    • 2013
  • This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

RRM Optimization for the Throughput Enhancement of WiFi AP (WiFi AP 성능 향상을 위한 무선 자원 관리 최적화)

  • Jeong, Kil Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.131-136
    • /
    • 2012
  • In these days, with the diffusion of mobile equipments, the number of WiFi Access Point (AP) is increasing, and the growth of WiFi AP causes the throughput degradation due to interferences between APs. This recent phenomenon demands the method able to be utilized with current WiFi network to improve the throughput of Wireless LANs. This paper studied the channel assignment method and several throughput enhancement methods to optimize Radio Resource Management (RRM) for distributed infrastructure WLANs. As a result, it was able to put AP independently, improve older allocation error, and improve execution speed.

Slotted ALOHA-based Random Access Protocol for Wireless-Powered Sensor Networks (무선전력 센서 네트워크를 위한 Slotted ALOHA 기반의 랜덤 접속 프로토콜)

  • Choi, Hyun-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.603-606
    • /
    • 2019
  • In this paper, we propose a slotted-ALOHA-based random access protocol and derive the optimal number of random slots that maximize channel throughput when multiple energy harvesting sensor devices perform random access in wireless-powered sensor networks (WPSN). Throughput numerical analysis, we prove that the throughput has a concavity with respect to the number of random slots and obtain the optimal number of slots. Simulation results show that the throughput of the proposed slotted ALOHA-based random access protocol is maximize when the derived optimal number of slots is employed in the considered WPSN.

  • PDF

Spatial Information Based Simulator for User Experience's Optimization

  • Bang, Green;Ko, Ilju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.3
    • /
    • pp.97-104
    • /
    • 2016
  • In this paper, we propose spatial information based simulator for user experience optimization and minimize real space complexity. We focus on developing simulator how to design virtual space model and to implement virtual character using real space data. Especially, we use expanded events-driven inference model for SVM based on machine learning. Our simulator is capable of feature selection by k-fold cross validation method for optimization of data learning. This strategy efficiently throughput of executing inference of user behavior feature by virtual space model. Thus, we aim to develop the user experience optimization system for people to facilitate mapping as the first step toward to daily life data inference. Methodologically, we focus on user behavior and space modeling for implement virtual space.

Distributed Transmit Power Control for Optimal End-to-End Throughput in Wireless Multihop Networks (무선 멀티홉 네트워크에서 종단간 최적 전송률을 위한 분산 송신전력제어)

  • Choi, Hyun-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.2
    • /
    • pp.92-101
    • /
    • 2012
  • In this paper, we propose a distributed transmit power control algorithm for optimal end-to-end throughput in wireless multihop networks. Considering a solidarity property of link rates consisting of a multihop link and the fact that the multihop end-to-end throughput is determined by the minimum link rate, the proposed scheme controls the transmit power to make all link rates be equal and so maximizes the end-to-end throughput of multihop link. In addition, in the proposed scheme the transmit node calculates its transmit power autonomously in a distributed manner just through the information sharing with its neighbor nodes and so decreases the information sharing overhead. Simulation results show that the proposed scheme achieves significant improvements in terms of end-to-end throughput and power consumption compared with the conventional maximum equal power allocation scheme.

Joint Relay Selection and Resource Allocation for Cooperative OFDMA Network

  • Lv, Linshu;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.11
    • /
    • pp.3008-3025
    • /
    • 2012
  • In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

Optimization of Channel Prediction Algorithm of Return Link ACM for Satellite Communication (위성통신용 적응형 전송기술 리턴링크 채널예측 알고리즘 최적화)

  • Kim, Hyun-Ho;Kim, Guk-Hyun;Ryu, Joon-Gyu;Hong, Sung-Yong
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.2
    • /
    • pp.19-23
    • /
    • 2015
  • In this paper, we present the return link ACM method to improve the link availability and system throughput for satellite communication service. Also, we describe the optimization of an algorithm for channel prediction using the LMS (Least Mean Square) adaptive filter and the MODCOD (Modulation & Code rate) decision. The simulation results show that the optimized filter taps and step-size of adaptive filter are 2 and 0.00026, respectively. And also confirms the required SNR margin for minimization of MODCOD decision error is 0.3dB.

Adaptive Binary Negative-Exponential Backoff Algorithm Based on Contention Window Optimization in IEEE 802.11 WLAN

  • Choi, Bum-Gon;Lee, Ju-Yong;Chung, Min-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.896-909
    • /
    • 2010
  • IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

Energy-Efficient Power Allocation for Cognitive Radio Networks with Joint Overlay and Underlay Spectrum Access Mechanism

  • Zuo, Jiakuo;Zhao, Li;Bao, Yongqiang;Zou, Cairong
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.471-479
    • /
    • 2015
  • Traditional designs of cognitive radio (CR) focus on maximizing system throughput. In this paper, we study the joint overlay and underlay power allocation problem for orthogonal frequency-division multiple access-based CR. Instead of maximizing system throughput, we aim to maximize system energy efficiency (EE), measured by a "bit per Joule" metric, while maintaining the minimal rate requirement of a given CR system, under the total power constraint of a secondary user and interference constraints of primary users. The formulated energy-efficient power allocation (EEPA) problem is nonconvex; to make it solvable, we first transform the original problem into a convex optimization problem via fractional programming, and then the Lagrange dual decomposition method is used to solve the equivalent convex optimization problem. Finally, an optimal EEPA allocation scheme is proposed. Numerical results show that the proposed method can achieve better EE performance.