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

Masking trapped charge in flash memories 掩盖被困在闪存中的电荷

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

A. Wachter-Zeh, Eitan Yaakobi

引用次数: 0

Interference-aware routing and spectrum allocation for millimeter wave backhaul in urban picocells 城市微蜂窝毫米波回程干扰感知路由与频谱分配

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

M. Rasekh, Dongning Guo, Upamanyu Madhow

{"title":"Interference-aware routing and spectrum allocation for millimeter wave backhaul in urban picocells","authors":"M. Rasekh, Dongning Guo, Upamanyu Madhow","doi":"10.1109/ALLERTON.2015.7557347","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7557347","url":null,"abstract":"The exponential growth in demand for mobile data requires significant increases in spatial reuse, motivating an evolution towards picocellular architectures with densely deployed base stations. Providing backhaul for such a network is a key challenge, because of the high access link rates, and the cost and difficulty of running optical fiber to base stations that might be opportunistically placed on lampposts and rooftops. Wireless backhaul using millimeter (mm) wave spectrum is therefore an attractive and flexible approach, given the plentiful availability of spectrum and the possibility of synthesizing highly directive, steerable links. In this paper, we formulate and investigate the problem of joint resource allocation and routing on such a mm wave backhaul network, providing a linear programming formulation that accounts for mutual interference across simultaneously active links. While the number of variables grows exponentially in network size, it is possible to prune the problem size so that it is manageable for moderately sized networks. Numerical results and design implications are briefly discussed.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"10 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":"127936415","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}

引用次数: 13

Finite-SNR regime analysis of the Gaussian wiretap multiple-access channel 高斯窃听多址信道的有限信噪比谱分析

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

P. Babaheidarian, Somayeh Salimi, Panos Papadimitratos

{"title":"Finite-SNR regime analysis of the Gaussian wiretap multiple-access channel","authors":"P. Babaheidarian, Somayeh Salimi, Panos Papadimitratos","doi":"10.1109/ALLERTON.2015.7447020","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447020","url":null,"abstract":"In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the communications. The goal is to transmit the messages reliably while keeping them confidential from the eavesdropper. To accomplish this goal, two different approaches have been proposed in prior works, namely, i.i.d. Gaussian random coding and real alignment. However, the former approach fails at moderate and high SNR regimes as its achievable result does not grow with SNR. On the other hand, while the latter approach gives a promising result at the infinite SNR regime, its extension to the finite-SNR regime is a challenging task. To fill the gap between the performance of the existing approaches, in this work, we establish a new scheme in which, at the receiver's side, it utilizes an extension of the compute-and-forward decoding strategy and at the transmitters' side it exploits lattice alignment, cooperative jamming, and i.i.d. random codes. For the proposed scheme, we derive a new achievable bound on sum secure rate which scales with log(SNR) and hence it outperforms the i.i.d. Gaussian codes in moderate and high SNR regimes. We evaluate the performance of our scheme, both theoretically and numerically. Furthermore, we show that our sum secure rate achieves the optimal sum secure degrees of freedom in the infinite-SNR regime.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"95 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":"127319777","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}

引用次数: 11

Coded caching for reducing CSIT-feedback in wireless communications 用于减少无线通信中csit反馈的编码缓存

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

Jingjing Zhang, Felix Engelmann, P. Elia

{"title":"Coded caching for reducing CSIT-feedback in wireless communications","authors":"Jingjing Zhang, Felix Engelmann, P. Elia","doi":"10.1109/ALLERTON.2015.7447131","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447131","url":null,"abstract":"The work explores the role of caching content at receiving users for the purpose of reducing the need for feedback in wireless communications. In the K-user broadcast channel (BC), we show how caching, when combined with a rate-splitting broadcast approach, can not only improve performance, but can also reduce the need for channel state information at the transmitter (CSIT), in the sense that the identified cache-aided optimal degrees-of-freedom performance, can in fact be achieved with reduced-quality CSIT. These CSIT savings can be traced back to an inherent relationship between caching, performance, and CSIT; caching improves performance by leveraging multicasting of common information, which automatically reduces the need for CSIT, by virtue of the fact that common information is not a cause of interference. At the same time though, too much multicasting of common information can be detrimental, as it does not utilize existing CSIT. Our caching method builds on the Maddah-Ali and Niesen coded caching scheme, by properly balancing multicast and broadcast opportunities, and by combing caching with rate-splitting communication schemes that are specifically designed to operate under imperfect-quality CSIT. The observed achievable CSIT savings here, are more pronounced for smaller values of K users and N files.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"130600626","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}

引用次数: 39

Active learning from noisy and abstention feedback 从嘈杂和弃权反馈中主动学习

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

Songbai Yan, Kamalika Chaudhuri, T. Javidi

引用次数: 12

Car-following models with delayed feedback: Local stability and Hopf bifurcation 时滞反馈汽车跟随模型:局部稳定性和Hopf分岔

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

G. Kamath, K. Jagannathan, G. Raina

引用次数: 15

Erasure adversarial wiretap channels 消除对抗性窃听渠道

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

P. Wang, R. Safavi-Naini, Fuchun Lin

引用次数: 6

Adaptive CSMA under the SINR model: Fast convergence through local gibbs optimization SINR模型下的自适应CSMA:通过局部吉布斯优化快速收敛

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

Subrahmanya Swamy Peruru, R. Ganti, K. Jagannathan

{"title":"Adaptive CSMA under the SINR model: Fast convergence through local gibbs optimization","authors":"Subrahmanya Swamy Peruru, R. Ganti, K. Jagannathan","doi":"10.1109/ALLERTON.2015.7447015","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447015","url":null,"abstract":"In this paper, we consider an adaptive CSMA based scheduling algorithm for a single-hop wireless network under a realistic SINR (signal-to-interference-plus-noise ratio) model for the interference, and propose an efficient local optimization based algorithm to estimate certain parameters of the algorithm called fugacities. It is known that adaptive CSMA based algorithms can achieve throughput optimality, by sampling feasible schedules from a Gibbs distribution with appropriate fugacities. Unfortunately, estimating the optimal fugacities for a desired service rate vector is an NP-hard problem. Further, the existing adaptive CSMA algorithms use a stochastic gradient descent based method, which usually entails an impractically slow (exponential in the size of the network) convergence to the optimal fugacities. In contrast, the convergence rate and the complexity of our algorithm is independent of the network size, and depends only on the neighborhood size of a link. In particular, in spatial networks where the neighborhood size does not scale with the network size, our algorithm is order optimal. We show that the proposed algorithm corresponds exactly to performing the well-known Bethe approximation to the underlying Gibbs distribution. We also consider two special cases of the SINR interference model and obtain the corresponding fugacities in closed form. Numerical results indicate that the proposed method achieves extremely fast convergence to near-optimal fugacities, and often outperforms the convergence rate of the stochastic gradient descent by a few orders of magnitude.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"351 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":"134408900","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}

引用次数: 7

A consensus algorithm for networks with process noise and quantization error 带有过程噪声和量化误差的网络一致性算法

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

F. Rego, Ye Pu, A. Alessandretti, Antonio Pedro Aguiar, C. Jones

引用次数: 6

On pathwise convergence of particle & grid based nonlinear filters: Feller vs conditional regularity 基于粒子和网格的非线性滤波器的路径收敛:Feller与条件正则性

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

Dionysios S. Kalogerias, A. Petropulu

{"title":"On pathwise convergence of particle & grid based nonlinear filters: Feller vs conditional regularity","authors":"Dionysios S. Kalogerias, A. Petropulu","doi":"10.1109/ALLERTON.2015.7447147","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447147","url":null,"abstract":"We present a theoretical comparison of the state-of-the-art sufficient conditions required for pathwise (almost sure type of) convergence between grid based and particle approximate filters, as well as discuss the implications of these conditions on the specific mode of convergence achieved. Focusing on general Markov processes observed in conditionally Gaussian noise, we have recently shown that a sufficient condition for pathwise convergence of grid based filters is conditional regularity of stochastic kernels. The respective condition for almost sure convergence of particle filters is the well known Feller property. While our analysis shows that the comparison between the afore-mentioned conditions may be indeed inconclusive, we identify a large class of systems for which conditional regularity may hold true, whereas the Feller property cannot. This is achieved through a structural analysis of both sufficient conditions. This work can be summarized in that there provably exist system classes supported by either grid based or particle filtering approximations, but not necessarily by both; for systems supported by both, grid based filters exhibit a theoretical advantage in terms of convergence robustness.","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":"128628738","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