2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第8页

Scaling laws for reliable data dissemination in shared loss multicast trees 共享损失组播树中可靠数据传播的尺度规律

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447101

Ron Yadgar, A. Cohen, Omer Gurewitz

引用次数: 0

Optimizing large-scale MIMO cellular downlink: Multiplexing, diversity, or interference nulling? 优化大规模MIMO蜂窝下行链路:多路复用，多样性，或干扰消除?

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447014

Kianoush Hosseini, Wei Yu, R. Adve

{"title":"Optimizing large-scale MIMO cellular downlink: Multiplexing, diversity, or interference nulling?","authors":"Kianoush Hosseini, Wei Yu, R. Adve","doi":"10.1109/ALLERTON.2015.7447014","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447014","url":null,"abstract":"A base-station (BS) equipped with multiple antennas can use its spatial dimensions in three ways: (1) serve multiple users to achieve a multiplexing gain, (2) provide diversity to its users, and/or (3) null interference at a chosen subset of out-of-cell users. The main contribution of this paper is to answer the following question: what is the optimal balance between the three competing benefits of multiplexing, diversity and interference nulling? We answer this question in the context of the downlink of a cellular network in which each user chooses its best serving BS, and requests nearby interfering BSs for interference nulling. BSs are equipped with a large number of antennas, serve multiple single-antenna users using zero-forcing beamforming and equal power assignment, and null interference at a subset of out-of-cell users. The remaining spatial dimensions provide transmit diversity. We assume perfect channel state information at the BSs and users. Utilizing tools from stochastic geometry, we show that, surprisingly, to maximize the per-BS ergodic sum rate, at the optimal allocation of spatial resources, interference nulling does not bring tangible benefit. A close-to-optimal strategy is to use none of the spatial resources for interference nulling, while reserving 60% of spatial resources for achieving multiplexing and the rest for providing diversity.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120997736","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}

引用次数: 6

On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes 开关通信信道下的Eschenauer-Gligor密钥预分发方案:无孤立节点

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447186

A. Makowski, Osman Yağan

引用次数: 4

Optimal scheduling of real-time traffic in wireless networks with delayed feedback 具有延迟反馈的无线网络实时流量的最优调度

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447137

Kyu Seob Kim, Chih-Ping Li, I. Kadota, E. Modiano

引用次数: 9

Performance analysis for multi-user systems under distributed opportunistic scheduling 分布式机会调度下的多用户系统性能分析

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447184

O. Shmuel, A. Cohen, Omer Gurewitz

{"title":"Performance analysis for multi-user systems under distributed opportunistic scheduling","authors":"O. Shmuel, A. Cohen, Omer Gurewitz","doi":"10.1109/ALLERTON.2015.7447184","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447184","url":null,"abstract":"Consider a multiple access channel with a large number of users. In most practical scenarios, due to decoding complexity, users are not scheduled together, and only one user may transmit at any given time. In this work, we analyze the delay and QoS of such systems under a specific, opportunistic and distributed scheduling algorithm, in which each user, at the beginning of each slot, estimates its channel gain and transmits only if it is greater than a given threshold. Specifically, we analyze the performance while assuming the users are not necessarily fully backlogged, focusing on the queueing problem and, especially, on the strong dependence between the queues. We first adopt the celebrated model of Ephremides and Zhu to give new results on the convergence of the probability of collision to its average value (as the number of users grows), and hence for the ensuing system performance metrics, such as throughput and delay. We then utilize this finding to suggest a much simpler approximate model, which accurately describes the system behaviour when the number of users is large. The system performance as predicted by the approximate models shows excellent agreement with simulation results.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129813200","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}

引用次数: 0

Variable-length channel codes with probabilistic delay guarantees 具有概率延迟保证的变长信道码

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447065

Y. Altug, H. Poor, S. Verdú

引用次数: 3

On the communication complexity of greater-than 论通信的复杂性大于

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447037

Sivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha

引用次数: 7

Linear approximations to AC power flow in rectangular coordinates 在直角坐标下交流功率流的线性近似

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447006

S. Dhople, Swaroop S. Guggilam, Y. Chen

引用次数: 88

Single letter characterization of average-case strong redundancy of compressing memoryless sequences 压缩无记忆序列的平均大小写强冗余的单字母表征

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447108

Maryam Hosseini, N. Santhanam

引用次数: 2

Exploring connections between Sparse Fourier Transform computation and decoding of product codes 探索稀疏傅里叶变换计算与产品编码解码之间的联系

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2015-09-01 DOI: 10.1109/ALLERTON.2015.7447167

N. Janakiraman, Santosh K. Emmadi, K. Narayanan, K. Ramchandran

引用次数: 2