Resource Allocation Problems in Wireless Communication Networks

无线通信网络中的资源分配问题

• 批准号: 9211417
• 负责人: Leandros Tassiulas
• 金额: $ 9.69万
• 依托单位: Polytechnic University of New York
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-08-15 至 1996-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9211417&HistoricalAwards=false
• 关键词: Resource; Allocation; Problems; Wireless; Communication

The expected service demands in wireless information networks in the near future exceed the current capabilities of these systems. Efficient allocation of the limited spectrum will be a critical factor in the design of the next generation of wireless networks in order to meet the future demands. We study two issues related to the resource allocation problem in wireless communication networks. These are the sharing of the locally common, spatially reusable radio channel and the effect of the rapidly changing topology. Regarding the first issue, we propose a queuing model that captures the channel allocation problem in radio networks. The major research goal is to characterize the system performance and to develop scheduling algorithms for sharing the resource efficiently. The throughput of the system and the average packet delay are the two performance measures of interest. In our previous research we characterized the throughput properties of the above model and we gave maximum throughput scheduling algorithms. Regarding delay, we obtained the optimal scheduling policy in a network with tandem topology. We wish to extend the above results with special emphasis on scheduling policies that are implementable in the distributed environment of a radio network. A stochastic model of time-varying topology is also proposed here. The understanding of the effect of the time-variability on the stability and throughput of the system as well as the development of transmission control algorithms that effectively take into account the topology information are the major research goals regarding changing connectivity. Preliminary results have already been obtained for a single-hop network.

不久的将来无线信息网络的预期服务需求超出了这些系统当前的能力。为了满足未来的需求，有限频谱的有效分配将是下一代无线网络设计的关键因素。我们研究与无线通信网络中的资源分配问题相关的两个问题。这些是本地公共的、空间上可重复使用的无线电信道的共享以及快速变化的拓扑的影响。关于第一个问题，我们提出了一种排队模型来捕获无线电网络中的信道分配问题。主要研究目标是表征系统性能并开发有效共享资源的调度算法。 系统的吞吐量和平均数据包延迟是两个值得关注的性能指标。在我们之前的研究中，我们描述了上述模型的吞吐量特性，并给出了最大吞吐量调度算法。关于延迟，我们获得了串联拓扑网络中的最优调度策略。我们希望扩展上述结果，特别强调可在无线电网络的分布式环境中实施的调度策略。 这里还提出了时变拓扑的随机模型。了解时变性对系统稳定性和吞吐量的影响以及开发有效考虑拓扑信息的传输控制算法是有关改变连接的主要研究目标。 单跳网络的初步结果已经获得。