1,435 research outputs found

    Wireless Throughput and Energy Efficiency under QoS Constraints

    Get PDF
    Mobile data traffic has experienced unprecedented growth recently and is predicted to grow even further over the coming years. As one of the main driving forces behind this growth, wireless transmission of multimedia content has significantly increased in volume and is expected to be the dominant traffic in data communications. Such wireless multimedia traffic requires certain quality-of-service (QoS) guarantees. With these motivations, in the first part of the thesis, throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and Markov-modulated Poisson sources are considered, and maximum average arrival rates in the presence of statistical queueing constraints are characterized. Furthermore, energy efficiency is analyzed by determining the minimum energy per bit and wideband slope in the low signal-to-noise ratio (SNR) regime. Following this analysis, energy-efficient power adaptation policies in fading channels are studied when data arrivals are modeled as Markovian processes and statistical QoS constraints are imposed. After formulating energy efficiency (EE) as maximum throughput normalized by the total power consumption, optimal power control policies that maximize EE are obtained for different source models. Next, throughput and energy efficiency of secure wireless transmission of delay sensitive data generated by random sources are investigated. A fading broadcast model in which the transmitter sends confidential and common messages to two receivers is considered. It is assumed that the common and confidential data, generated from Markovian sources, is stored in buffers prior to transmission, and the transmitter operates under constraints on buffer/delay violation probability. Under such statistical QoS constraints, the throughput is determined. In particular, secrecy capacity is used to describe the service rate of buffers containing confidential messages. Moreover, energy efficiency is studied in the low signal-to-noise (SNR) regime. In the final part of the thesis, throughput and energy efficiency are addressed considering the multiuser channel models. Five different channel models, namely, multiple access, broadcast, interference, relay and cognitive radio channels, are considered. In particular, throughput regions of multiple-access fading channels are characterized when multiple users, experiencing random data arrivals, transmit to a common receiver under statistical QoS constraints. Throughput regions of fading broadcast channels with random data arrivals in the presence of QoS requirements are studied when power control is employed at the transmitter. It is assumed that superposition coding with power control is performed at the transmitter with interference cancellation at the receivers. Optimal power control policies that maximize the weighted combination of the average arrival rates are investigated in the two-user case. Energy efficiency in two-user fading interference channels is studied when the transmitters are operating subject to QoS constraints. Specifically, energy efficiency is characterized by determining the corresponding minimum energy per bit requirements and wideband slope regions. Furthermore, transmission over a half-duplex relay channel with secrecy and QoS constraints is studied. Secrecy throughput is derived for the half duplex two-hop fading relay system operating in the presence of an eavesdropper. Fundamental limits on the energy efficiency of cognitive radio transmissions are analyzed in the presence of statistical quality of service (QoS) constraints. Minimum energy per bit and wideband slope expressions are obtained in order to identify the performance limits in terms of energy efficiency

    Learning and Management for Internet-of-Things: Accounting for Adaptivity and Scalability

    Get PDF
    Internet-of-Things (IoT) envisions an intelligent infrastructure of networked smart devices offering task-specific monitoring and control services. The unique features of IoT include extreme heterogeneity, massive number of devices, and unpredictable dynamics partially due to human interaction. These call for foundational innovations in network design and management. Ideally, it should allow efficient adaptation to changing environments, and low-cost implementation scalable to massive number of devices, subject to stringent latency constraints. To this end, the overarching goal of this paper is to outline a unified framework for online learning and management policies in IoT through joint advances in communication, networking, learning, and optimization. From the network architecture vantage point, the unified framework leverages a promising fog architecture that enables smart devices to have proximity access to cloud functionalities at the network edge, along the cloud-to-things continuum. From the algorithmic perspective, key innovations target online approaches adaptive to different degrees of nonstationarity in IoT dynamics, and their scalable model-free implementation under limited feedback that motivates blind or bandit approaches. The proposed framework aspires to offer a stepping stone that leads to systematic designs and analysis of task-specific learning and management schemes for IoT, along with a host of new research directions to build on.Comment: Submitted on June 15 to Proceeding of IEEE Special Issue on Adaptive and Scalable Communication Network

    Optimal Multiuser Scheduling Schemes for Simultaneous Wireless Information and Power Transfer

    Full text link
    In this paper, we study the downlink multiuser scheduling problem for systems with simultaneous wireless information and power transfer (SWIPT). We design optimal scheduling algorithms that maximize the long-term average system throughput under different fairness requirements, such as proportional fairness and equal throughput fairness. In particular, the algorithm designs are formulated as non-convex optimization problems which take into account the minimum required average sum harvested energy in the system. The problems are solved by using convex optimization techniques and the proposed optimization framework reveals the tradeoff between the long-term average system throughput and the sum harvested energy in multiuser systems with fairness constraints. Simulation results demonstrate that substantial performance gains can be achieved by the proposed optimization framework compared to existing suboptimal scheduling algorithms from the literature.Comment: Accepted for presentation at the European Signal Processing Conference 201
    • …
    corecore