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

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

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

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

Robust regularized ZF in decentralized Broadcast Channel with correlated CSI noise 具有相关CSI噪声的分散广播信道鲁棒正则化ZF

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

Qianrui Li, Paul de Kerret, D. Gesbert, N. Gresset

{"title":"Robust regularized ZF in decentralized Broadcast Channel with correlated CSI noise","authors":"Qianrui Li, Paul de Kerret, D. Gesbert, N. Gresset","doi":"10.1109/ALLERTON.2015.7447023","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447023","url":null,"abstract":"We consider in this work the Distributed Channel State Information (DCSI) Broadcast Channel (BC) setting, in which the various Transmitters (TXs) compute elements of the precoder based on their individual estimates of the global multiuser channel matrix. Previous works relative to the DCSI setting assume the estimation errors at different TXs to be uncorrelated, while we consider in contrast in this work that the CSI noises can be correlated. This generalization bridges the gap between the fully distributed and the centralized setting, and offers an avenue to analyze partially centralized networks. In addition, we generalize the regularized Zero Forcing (ZF) precoding by letting each TX use a different regularization coefficient. Building upon random matrix theory tools, we obtain a deterministic equivalent for the rate achieved in the large system limit from which we can optimize the regularization coefficients at different TXs. This extended precoding scheme in which each TX applies the optimal regularization coefficient is denoted as “DCSI Regularized ZF” and we show by numerical simulations that it allows to significantly reduce the negative impact of the distributed CSI configuration and is robust to the distribution of CSI quality level across all TXs.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"143 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":"117334191","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}

引用次数: 10

Near-optimal multi-version codes 近乎最佳的多版本代码

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

M. Khabbazian

{"title":"Near-optimal multi-version codes","authors":"M. Khabbazian","doi":"10.1109/ALLERTON.2015.7447076","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447076","url":null,"abstract":"Motivated by applications to distributed storage and computing, the multi-version coding problem was formulated by Wang and Cadambe in [4]. In this problem, a client sequently over time stores v independent versions of a message in a storage system with n server nodes. It is assumed that, a message version may not reach some servers, and that each server is unaware of what has been stored in other servers. The problem requires that any c servers must be able to reconstruct their latest common version. An extended multi-version problem introduced in [5] relaxes the above requirement by requiring any c servers to be able to reconstruct their latest common version or any version later than that. The objective in both the original and extended multi-version problem is to minimize the worst case storage cost. In this work, we propose codes for both the multi-version problem and its extension. For the original multi-version coding problem, we show that the storage cost of our proposed codes are near-optimal. For the extended multi-version coding problem, we show that the storage cost of our first algorithm is optimal when v|c - 1. Our second proposed extended multi-version code shows that storage cost of strictly less than one is achievable even when v is 50% larger than c. This is interesting, as the storage cost of existing codes becomes one as soon as v becomes larger than c.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"16 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":"121134255","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

Inferning trees Inferning树

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

Mina Karzand, Guy Bresler

引用次数: 1

Design of linear & nonlinear observers for a turning process with implicit State-Dependent Delay 具有隐式状态相关延迟的车削过程线性和非线性观测器的设计

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

Aftab Ahmed, Erik I. Verriest

{"title":"Design of linear & nonlinear observers for a turning process with implicit State-Dependent Delay","authors":"Aftab Ahmed, Erik I. Verriest","doi":"10.1109/ALLERTON.2015.7447052","DOIUrl":"https://doi.org/10.1109/ALLERTON.2015.7447052","url":null,"abstract":"Analysis and design of present machining methods used in mechanical engineering are based on Taylor series approximations and linearizations which cause erroneous and anomalous results. High precision machining cannot tolerate such errors. We consider and analyze an exact mathematical model of the turning process without performing any kind of linearization of the model. We give a strategic design of an estimator for the position of a machining tool based on first principles. The system's dynamics are characterized by a nonlinear State-Dependent Delay Differential Equation (SD-DDE). This delay is extremely convoluted with the state by an implicit relation. The central tenet is to use inversion of the delay model and to extract the state vector given the delay. We use our recently developed observation technique referred to as Delay Injection. Both linear asymptotic and nonlinear observers with different architectures are designed for the state estimation of a machine tool based on state-dependent delay measurement. Simulation results are depicted at the end which portray the effectiveness, validity and usefulness of the proposed observer schemes.","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":"121883845","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

Memoryless sampling rate distortion 无记忆采样率失真

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

Vinay Praneeth Boda, P. Narayan

引用次数: 2

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

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