CIF: Small: Fundamental Limits of Wireless Communications with Stochastic Information Flows and Queueing Constraints

CIF：小：具有随机信息流和排队约束的无线通信的基本限制

• 批准号: 1618615
• 负责人: Mustafa Gursoy
• 金额: $ 44.23万
• 依托单位: Syracuse University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2016
• 资助国家: 美国
• 起止时间: 2016-07-01 至 2021-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1618615&HistoricalAwards=false
• 关键词: CIF; Small; Fundamental; Limits; Wireless

Mobile data traffic has experienced unprecedented growth recently and is predicted to grow further over the coming years. This exponential growth in the flow of mobile data and multimedia content has significant implications on wireless networks. For one, such wireless multimedia traffic requires certain quality of service guarantees. Another consequence is heterogeneity in network traffic. Wireless networks now carry heterogeneous stochastic traffic in diverse environments, and successful design of networks and effective quality of service provisioning for mobile multimedia communications critically depend on the appropriate choice of source traffic models. Motivated by these factors, this project addresses the important and timely topic of wireless communication with service guarantees. The outcomes of this research will significantly contribute to the design of next generation wireless networks supporting multimedia traffic with service guarantees, and are poised to have significant impact on the society due to extremely fast growth in mobile video traffic.The methodology of this project is centered around combining tools from information theory and stochastic network calculus to establish a strong analytical framework by rigorously determining the fundamental limits of wireless communication under queuing constraints. In particular, this project investigates the maximum throughput in single- and multi-user wireless channels in the presence of random data arrivals and statistical queuing constraints. First, an idealistic setup with Gaussian codebooks and reliable communication with no bounds on the code lengths and no errors is addressed. Subsequently, wireless throughput is characterized in the more practical regimes of finite block-length coding and of finite-alphabet inputs with arbitrary distributions.

移动数据流量最近经历了前所未有的增长，预计未来几年将进一步增长。移动数据流和多媒体内容的指数级增长对无线网络具有重要影响。首先，这种无线多媒体通信需要一定的服务质量保证。另一个后果是网络流量的异构性。无线网络在不同的环境中承载着异构随机业务，移动多媒体通信网络的成功设计和有效的服务质量提供关键取决于源业务模型的选择。在这些因素的推动下，本项目解决了具有服务保障的无线通信这一重要而及时的主题。本研究成果将对下一代无线网络的设计做出重大贡献，支持具有服务保障的多媒体流量，并且由于移动视频流量的快速增长，将对社会产生重大影响。这个项目的方法论集中在信息论和随机网络演算的结合上，通过严格确定排队约束下无线通信的基本限制来建立一个强大的分析框架。特别地，本项目研究了随机数据到达和统计排队约束下单用户和多用户无线信道的最大吞吐量。首先，解决了一个理想的高斯码本设置和可靠的通信，没有对代码长度的限制，没有错误。随后，无线吞吐量在有限块长度编码和任意分布的有限字母输入的更实用的制度下被表征。