CAREER: Capacity of Wireless Networks: Cooperative Communication

职业：无线网络的能力：协作通信

• 批准号: 0448181
• 负责人: Sriram Vishwanath
• 金额: --
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2005
• 资助国家: 美国
• 起止时间: 2005-01-01 至 2010-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0448181&HistoricalAwards=false
• 关键词: CAREER; Capacity; Wireless; Networks; Cooperative

Capacity of Wireless Networks: Cooperative CommunicationThe fundamental capacity limit of wireless networks is a highly pursuedyet elusive problem lying at the intersection of distinct fields ofresearch. The principle issue is the lack of appropriate tools within anyone field to tackle this problem in its entirety. This research activitybuilds an inter-disciplinary framework for the analysis of thisfundamental limit, merging networking and optimization theoretic conceptssuch as node cooperation, cooperative routing and Lagrangian duality inconjunction with sophisticated mathematical tools from information theory.A mathematical theory is developed using these diverse tools and, wherenecessary, introducing new tools to obtain 1) improved achievable ratesfor a given network configuration over those currently known 2) novelouter bounds on network sum capacity, 3) non-trivial conditions whereinner and outer bounds meet and 4) algorithms that compute thecorresponding resource allocation strategies for time-varying wirelessnetworks.Specifically, techniques such as joint source-channel coding, multi-userbinning and multiuser cooperative coding are used to develop the innerbounds on the capacity of the systems, while Lagrangian duality theory andestimation theory is used both to develop outer bounds on capacity and tocompare the inner and outer bounds.

无线网络的容量：协作通信无线网络的基本容量限制是一个位于不同研究领域的交叉点上的高度追求但又难以捉摸的问题。主要问题是在任何领域内都缺乏适当的工具来全面解决这一问题。这一研究活动建立了一个跨学科的框架，用于分析这一基本极限，融合了网络和优化理论的概念，如节点合作、合作路由和拉格朗日对偶，并结合信息论中的复杂数学工具。使用这些不同的工具，必要的是，引入新的工具来获得1)给定网络配置的可达成率比目前已知的更高的可达成率2)网络和容量的新的外界，3)内外界满足的非平凡条件和4)计算相应的时变无线网络的资源分配策略的算法。具体地说，诸如联合信源-信道编码，多用户合并和多用户协作编码被用来扩展系统容量的内界，而拉格朗日对偶理论和估计理论被用来扩展容量的外界和比较内、外界。