{'fraction_non_alphanumeric': 0.018696069031639503, 'fraction_numerical': 0.0, 'mean_word_length': 5.031791907514451, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Power and delay trade-offs in fading channels

Energy is a constrained resource in mobile wireless networks. In such networks, communication takes place over fading channels. By varying the transmission rate and power based on the current fading level, a user in a wireless network can more efficiently utilize the available energy. For a given average transmission rate, information theoretic arguments provide the optimal power allocation. However, such an approach can lead to long delays or buffer overflows. These delays can be reduced but at the expense of higher transmission power. The trade-offs between the required power and various notions of delay are analyzed in this thesis. We consider a user communicating over a fading channel. Arriving data for this user is stored in buffer until it is transmitted. We develop several buffer control problems which fit into a common mathematical framework. In each of these problems, the goal is to both minimize the average transmission power as well as the average “buffer cost”. In two specific examples, this buffer cost corresponds to the probability of buffer overflow or the average buffer delay. These buffer control problems are analyzed using dynamic programming techniques. Several structural characteristics of optimal policies are given. The relationship of this model to the delay-limited capacity and outage capacity of fading channels is discussed. We then analyze the asymptotic performance in two cases – the probability of buffer overflow case and the average delay case. In both cases, we bound the asymptotic performance and provide simple policies which are asymptotically optimal or nearly optimal. Finally we extend this analysis to a model with multiple users communicating over a multiple-access channel to a common receiver. The single user results for the probability of buffer overflow case are generalized to this multiple user situation. Extensions to other multi-user models are also discussed. Thesis Supervisor: Robert G. Gallager Title: Professor of Electrical Engineering For Mom, Dad and Ju Chien