2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第7页

An entropy-based framework for dynamic clustering and coverage problems 动态聚类和覆盖问题的基于熵的框架

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394887

Puneet Sharma

引用次数: 2

Asymptotic analysis of quadratic error of consensus in large-scale random directed networks 大规模随机有向网络一致性二次误差的渐近分析

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394941

V. Preciado, A. Tahbaz-Salehi, A. Jadbabaie

引用次数: 0

Distributed MIMO network optimization based on duality and local message passing 基于对偶性和本地消息传递的分布式MIMO网络优化

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394940

An Liu, A. Sabharwal, Y. Liu, Haige Xiang, Wu Luo

{"title":"Distributed MIMO network optimization based on duality and local message passing","authors":"An Liu, A. Sabharwal, Y. Liu, Haige Xiang, Wu Luo","doi":"10.1109/ALLERTON.2009.5394940","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394940","url":null,"abstract":"In a communication network, it is often impractical for each node to learn the global channel knowledge (network connectivity and channel state information of each link). In this paper, we address distributed rate optimization for Time-Division Duplex (TDD) Multiple-Input Multiple-Output (MIMO) networks when part of the local channel knowledge is learned via message passing between each transmitter and its intended receivers. The distributed optimization algorithm is based on a rate duality and the corresponding input covariance matrix transformation between the forward and reverse links of TDD MIMO networks under the assumption of global channel knowledge. Noting that the key information required by the proposed transformation is the interference-plus-noise covariance matrix, we propose a local covariance matrix transformation such that each node can distributedly optimize its input covariance matrix by only exchanging interference-plus-noise covariance matrix locally. It is observed from the simulation that the proposed algorithm achieves a performance close to the one with global channel knowledge and outperforms the existing distributed algorithms.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123261686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Is it enough to drain the heaviest bottlenecks? 这是否足以消除最严重的瓶颈?

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394773

G. Gupta, S. Sanghavi, N. Shroff

{"title":"Is it enough to drain the heaviest bottlenecks?","authors":"G. Gupta, S. Sanghavi, N. Shroff","doi":"10.1109/ALLERTON.2009.5394773","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394773","url":null,"abstract":"This paper takes a philosophically new approach to throughput-optimal scheduling queueing systems with interference. All existing popular approaches (e.g. max-weight, greedy, ”pick-and-compare” etc.) focus on the weights of individual queues. We take an alternative approach, by focusing instead on the aggregate queues of bottlenecks. A bottleneck is a set of mutually-interfering queues; a schedule drains a bottleneck if it removes a packet from any one of its queues. We consider (the standard) switch scheduling problem, where the bottlenecks are the nodes. We establish the following phasetransition (1) ensuring only that the very heaviest nodes are drained is not enough for throughput optimality, but (2) ensuring scheduling for all nodes with weight within (1 − α) of the heaviest is enough for throughput optimality, for any α>0. The proof uses a new Lyapunov function: the weight of the critical bottleneck. Our alternate node-focused view also enables the development of new algorithms for scheduling. We show (a) how any policy can be made throughput-optimal by doing a small number of extra operations, (b) a new algorithm — Maximum Vertex-weighted Matching (MVM) — has (empirical) delay performance better than the current state of the art, and lower complexity than Max-(edge)weighted Matching, and (c) a class o f throughput-optimal policies that trade off between complexity and delay.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131556448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Can iterative decoding for erasure correlated sources be universal? 擦除相关源的迭代解码是否具有普适性?

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394794

A. Yedla, H. Pfister, K. Narayanan

引用次数: 12

Arbitrary jamming can preclude secure communication 任意干扰会妨碍安全通信

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394876

Ebrahim MolavianJazi, M. Bloch, J. N. Laneman

引用次数: 75

3 User interference channel: Degrees of freedom as a function of channel diversity 用户干扰信道:作为信道分集函数的自由度

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394806

Guy Bresler, David Tse

引用次数: 43

A training based scheme for communicating over unknown channels with feedback 一种基于训练的带反馈的未知信道通信方案

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394490

Aditya Mahajan, S. Tatikonda

{"title":"A training based scheme for communicating over unknown channels with feedback","authors":"Aditya Mahajan, S. Tatikonda","doi":"10.1109/ALLERTON.2009.5394490","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394490","url":null,"abstract":"We consider a communication system with noiseless feedback where the channel is not known to the encoder or the decoder. The channel belongs to a known family of channels and remains constant over time. Using the noiseless feedback, the encoder can learn the channel over time and communicate at a rate equal to the capacity of the actual realization of the channel. Thus, not knowing the channel does not affect capacity. However, analyzing the error exponent (for variable length coding) is more challenging. Tchamkerten and Telatar (2006) showed that for certain families of channels, not knowing the channel does not change the error exponent; for other families, not knowing the channel results in a strict decrease in the error exponent. In general, the error exponent is not known. It is also known that simple training based schemes have poor error exponent behavior. In this paper, we show that a smart training based scheme can achieve an error exponent which is a multiplicative factor less than the error exponent for known channel. This shows that contrary to popular belief, smart training based schemes preserve the main advantage of feedback — an error exponent with non-zero slope at rates close to capacity.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132560778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Sparse and low-rank matrix decompositions 稀疏和低秩矩阵分解

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.3182/20090706-3-FR-2004.00249

V. Chandrasekaran, S. Sanghavi, P. Parrilo, A. Willsky

引用次数: 157

Message quantization in belief propagation: Structural results in the low-rate regime 信念传播中的信息量化:低率状态下的结构结果

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2009-09-30 DOI: 10.1109/ALLERTON.2009.5394797

O. P. Kreidl, A. Willsky

引用次数: 0