2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献_第5页

Online Timely Status Updates with Erasures for Energy Harvesting Sensors 在线及时状态更新与擦除能量收集传感器

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636088

A. Arafa, Jing Yang, S. Ulukus, H. Poor

{"title":"Online Timely Status Updates with Erasures for Energy Harvesting Sensors","authors":"A. Arafa, Jing Yang, S. Ulukus, H. Poor","doi":"10.1109/ALLERTON.2018.8636088","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636088","url":null,"abstract":"An energy harvesting sensor that is sending status updates to a destination through an erasure channel is considered, in which transmissions are prone to being erased with some probability $q$, independently from other transmissions. The sensor, however, is unaware of erasure events due to lack of feedback from the destination. Energy expenditure is normalized in the sense that one transmission consumes one unit of energy. The sensor is equipped with a unit-sized battery to save its incoming energy, which arrives according to a Poisson process of unit rate. The setting is online, in which energy arrival times are only revealed causally after being harvested, and the goal is to design transmission times such that the long term average age of information $(AoI)$, defined as the time elapsed since the latest update has reached the destination successfully, is minimized. The optimal status update policy is first shown to have a renewal structure, in which the time instants at which the destination receives an update successfully constitute a renewal process. Then, for $ qleq frac {1}{2}$, the optimal renewal policy is shown to have a threshold structure, in which a new status update is transmitted only if the AoI grows above a certain threshold, that is shown to be a decreasing function of $q$. While for $q gt frac {1}{2}$, the optimal renewal policy is shown to be greedy, in which a new status update is transmitted whenever energy is available.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114556087","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}

引用次数: 50

Explicit optimal-length locally repairable codes of distance 5 距离为5的显式最优长度局部可修码

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636018

Allison Beemer, Ryan Coatney, V. Guruswami, Hiram H. López, Fernando L. Piñero

引用次数: 12

Opportunistic Temporal Fair Scheduling for Non-Orthogonal Multiple Access 非正交多址的机会时间公平调度

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636027

Shahram Shahsavari, Farhad Shirani, E. Erkip

引用次数: 5

Statistical Planning: Building Models of Entropy of Centralized Planning for Multi-Agent Systems 统计规划:多智能体系统集中规划熵的建立模型

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635833

Éric Jacopin

引用次数: 1

Cross-Iteration Coded Computing 交叉迭代编码计算

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635933

Farzin Haddadpour, Yaoqing Yang, V. Cadambe, P. Grover

{"title":"Cross-Iteration Coded Computing","authors":"Farzin Haddadpour, Yaoqing Yang, V. Cadambe, P. Grover","doi":"10.1109/ALLERTON.2018.8635933","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635933","url":null,"abstract":"We introduce the idea of cross-iteration coded computing, an approach to reducing communication costs for a large class of distributed iterative algorithms involving linear operations, including gradient descent and accelerated gradient descent for quadratic loss functions. The state-of-the-art approach for these iterative algorithms involves performing one iteration of the algorithm per round of communication among the nodes. In contrast, our approach performs multiple iterations of the underlying algorithm in a single round of communication by incorporating some redundancy storage and computation. Our algorithm works in the master-worker setting with the workers storing carefully constructed linear transformations of input matrices and using these matrices in an iterative algorithm, with the master node inverting the effect of these linear transformations. In addition to reduced communication costs, a trivial generalization of our algorithm also includes resilience to stragglers and failures. The degree of redundancy of our algorithm can be tuned based on the amount of communication and straggler resilience required. Finally, we also describe a variant of our algorithm that can flexibly recover the results based on the degree of straggling in the worker nodes. The variant allows for the performance to degrade gracefully as the number of successful (non-straggling) workers is lowered.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121815057","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}

引用次数: 15

The Geometric Block Model and Applications 几何块模型及其应用

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635938

Sainyam Galhotra, S. Pal, A. Mazumdar, B. Saha

引用次数: 1

Distributed Hypothesis Testing with Collaborative Detection 协同检测的分布式假设检验

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635828

Pierre Escamilla, A. Zaidi, M. Wigger

{"title":"Distributed Hypothesis Testing with Collaborative Detection","authors":"Pierre Escamilla, A. Zaidi, M. Wigger","doi":"10.1109/ALLERTON.2018.8635828","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635828","url":null,"abstract":"A detection system with a single sensor and two detectors is considered, where each of the terminals observes a memoryless source sequence, the sensor sends a message to both detectors and the first detector sends a message to the second detector. Communication of these messages is assumed to be error-free but rate-limited. The joint probability mass function (pmf) of the source sequences observed at the three terminals depends on an M-ary hypothesis $( mathrm{M}ge 2)$, and the goal of the communication is that each detector can guess the underlying hypothesis. Detector $k, k = 1,2$, aims to maximize the error exponent under hypothesis ${i}_{k}, i_{k}, in{ 1,ldots ,mathrm{M}}$, while ensuring a small probability of error under all other hypotheses. We study this problem in the case in which the detectors aim to maximize their error exponents under the same hypothesis (i.e., $i_{1},= quad i_{2})$ and in the case in which they aim to maximize their error exponents under distinct hypotheses (i.e., $i_{1}, 6 = quad i_{2})$. For the setting in which $i_{1},= quad i_{2}$, we present an achievable exponents region for the case of positive communication rates, and show that it is optimal for a specific case of testing against independence. We also characterize the optimal exponents region in the case of zero communication rates. For the setting in which $i_{1}, 6 = quad i_{2}$, we characterize the optimal exponents region in the case of zero communication rates.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128271165","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}

引用次数: 8

Age of Information with Soft Updates 软更新的信息时代

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635855

Melih Bastopcu, S. Ulukus

{"title":"Age of Information with Soft Updates","authors":"Melih Bastopcu, S. Ulukus","doi":"10.1109/ALLERTON.2018.8635855","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635855","url":null,"abstract":"We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but instantaneously in both cases, here updates start taking effect right away but gradually over time. We coin this setting soft updates. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of the age is proportional to the current age, and in the second model, the rate of decrease of the age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and the optimum durations of the updates, subject to the constraints on the number of update periods (number of meetings) and the total update duration.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631077","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}

引用次数: 16

Balanced Allocation on Graphs with Random Walk Based Sampling 基于随机漫步抽样的图的均衡分配

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635943

Dengwang Tang, V. Subramanian

引用次数: 4

Streaming Codes For Variable-Size Arrivals 可变大小到达的流代码

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635971

Michael Rudow, K. V. Rashmi

{"title":"Streaming Codes For Variable-Size Arrivals","authors":"Michael Rudow, K. V. Rashmi","doi":"10.1109/ALLERTON.2018.8635971","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635971","url":null,"abstract":"Streaming codes are a class of convolutional codes that encode a stream of source packets, which arrive sequentially with a strict decoding-delay constraint, for transmission over a packet-erasure channel. A number of recent works have proposed capacity achieving streaming code constructions for adversarial packet-erasure channels that include bursts and arbitrary erasures. The existing models for streaming codes, to the best of our knowledge, consider a setting where all the source packets are of the same, fixed size. However, live video streaming applications have source packets with highly variable sizes. Motivated by this application, in this paper, we present a generalized model for streaming codes that incorporates variable-size arrivals. The variability in the size of the source packets induces a new trade-off between the rate of the code and the minimum decoding delay when the channel introduces no erasures. We also present a simple construction of streaming codes for variable-size arrivals, which builds upon existing streaming code constructions designed for fixed-size arrivals. We theoretically characterize the rate achieved by the proposed code when arrival sizes are drawn independently from any distribution with a finite support. Furthermore, using a live video trace and several representative parameter settings, we show that proposed code construction achieves a rate of approximately 89.5% of an upper bound and achieves a significantly higher rate (10%-50%) than naively using the existing streaming codes designed for fixed-size arrivals.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129670604","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}

引用次数: 16