• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Design of Efficient Resource Allocation Algorithms for Wireless Networks: High Throughput, Small Delay, and Low Complexity.
【24h】

Design of Efficient Resource Allocation Algorithms for Wireless Networks: High Throughput, Small Delay, and Low Complexity.

机译：无线网络高效资源分配算法的设计：高吞吐量，小延迟和低复杂度。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Designing efficient resource allocation mechanisms is both a vital and challenging problem in wireless networks. In this thesis, we focus on developing resource allocation and control algorithms for wireless networks that are aimed towards jointly optimizing over three critical dimensions of network performance: throughput, delay, and complexity.;We first focus on multihop wireless networks under general interference constraints, and aim to designing efficient scheduling algorithms that jointly optimize the network performance over different dimensions among the aforementioned three dimensions. We develop frameworks that enable us to design throughput-optimal scheduling algorithms that can reduce delays and/or incur a lower complexity in the following sense: smaller amount of required information, simpler data structure, and lower communication overhead.;We then turn to a simpler setting of single-hop multi-channel systems. A practically important example of such multi-channel systems is the downlink of a single cell in 4G OFDM-based cellular networks (e.g., LTE and WiMax). Our goal is to design efficient scheduling algorithms that achieve provably high performance in terms of both throughput and delay, at a low computational complexity. To that end, we first develop new easy-to-verify sufficient conditions for rate-function delay optimality in the many-channel many-user asymptotic regime (i.e., maximizing the decay-rate of the probability that the largest packet waiting time in the system exceeds a certain fixed threshold, as system size becomes large), and for throughput optimality in non-asymptotic settings. These sufficient conditions have been designed such that an intelligent combination of algorithms that satisfy both of the sufficient conditions allows us to develop low-complexity hybrid algorithms that are both throughput-optimal and rate-function delay-optimal. Further, we propose simpler greedy policies that are throughput-optimal and rate-function near-optimal, at an even lower complexity.;Finally, we investigate the scheduling problem in multihop wireless networks with flow-level dynamics. We explore potential inefficiency and instability of the celebrated back-pressure algorithms in the presence of flow-level dynamics, and provide interesting examples that are useful for obtaining insights into developing a unified throughput-optimal solution.;Our results in this thesis shed light on how to design resource allocation and control algorithms that can simultaneously attain both high throughput and small delay in practical systems with low-complexity operations. On the other hand, our studies also reveal that when flow-level dynamics is taken into account, even optimizing a single metric of throughput becomes much more challenging, not to mention achieving high network performance over all the three dimensions.
机译：在无线网络中，设计有效的资源分配机制既是至关重要的也是具有挑战性的问题。在本文中，我们专注于开发无线网络的资源分配和控制算法，旨在共同优化网络性能的三个关键维度：吞吐量，延迟和复杂性。我们首先关注在一般干扰约束下的多跳无线网络，并且旨在设计有效的调度算法，以在上述三个维度中的不同维度上共同优化网络性能。我们开发的框架使我们能够设计吞吐量优化的调度算法，从而可以从以下方面减少延迟和/或降低复杂性：所需信息量更少，数据结构更简单，通信开销更低。单跳多通道系统的设置更简单。这种多信道系统的实践上重要的例子是基于4G OFDM的蜂窝网络（例如，LTE和WiMax）中的单个小区的下行链路。我们的目标是设计高效的调度算法，以较低的计算复杂度在吞吐量和延迟方面实现可证明的高性能。为此，我们首先为多通道多用户渐近体制中的速率函数延迟最佳化开发了新的易于验证的充分条件（即，使最大包等待时间最大的概率的衰减率最大）。当系统规模变大时，系统会超过某个固定阈值），并且在非渐近设置中，吞吐量会达到最佳。设计了这些充分条件，以使满足这两个充分条件的算法的智能组合使我们能够开发出吞吐量和延迟均最优的低复杂度混合算法。此外，我们提出了更简单的贪婪策略，即吞吐量最优且速率函数接近最优，且复杂度更低。最后，我们研究了具有流级动态特性的多跳无线网络中的调度问题。我们探索了在存在流级动力学的情况下著名的背压算法的潜在效率低下和不稳定的情况，并提供了有趣的示例，这些示例对于深入了解开发统一的吞吐量最佳解决方案很有用。如何设计在低复杂度的实际系统中可以同时实现高吞吐量和小延迟的资源分配和控制算法。另一方面，我们的研究还表明，考虑到流级动态特性，即使优化单个吞吐量指标也变得更具挑战性，更不用说在所有三个维度上都实现高网络性能了。

著录项

  • 作者

    Ji, Bo.;

  • 作者单位

    The Ohio State University.;

  • 授予单位 The Ohio State University.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2012
  • 页码 307 p.
  • 总页数 307
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号