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

Impact of region-based faults on the connectivity of wireless networks 区域故障对无线网络连通性的影响

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2011-06-05 DOI: 10.1109/icc.2011.5962991

Sujogya Banerjee, Arunabha Sen

{"title":"Impact of region-based faults on the connectivity of wireless networks","authors":"Sujogya Banerjee, Arunabha Sen","doi":"10.1109/icc.2011.5962991","DOIUrl":"https://doi.org/10.1109/icc.2011.5962991","url":null,"abstract":"The last few years have seen considerable interest in the wireless networking research community in analyzing the connectivity of wireless ad-hoc networks formed by a set of nodes distributed in a two dimensional plane (deployment area) with a (i) uniform probability density function and (ii) uniform transmission range. Although several important and interesting results are known in this domain, most of the connectivity studies consider a fault-free scenario where all nodes are available for network formation and do not consider failures among nodes caused by one reason or another. In very few studies where faults are considered, they are usually considered to be random in nature, i.e., the probability of a node failing is independent of its location in the deployment area. However, such fault scenario is inadequate to capture many realistic situations where the faulty nodes are spatially correlated. This is particularly true in combat environment where an enemy bomb can destroy a subset of nodes confined to a region. In this paper we investigate the impact of region-based faults on the connectivity of wireless networks. Through analysis and simulation, we provide results relating the probability of a network being connected as transmission range and the size of fault-region are varied. If dmin(G) denotes the minimum node degree of the network, we provide the analytical expression for P(dmin(G) ≥ k), which represents the probability of the minimum node degree being at least k, for k = 1. Moreover, we compute P(κ(G) ≥ k), where κ(G) represents the connectivity of the graph G formed by the distribution of nodes in the deployment area and examine the relationship between P(dmin(G) ≥ k) and P(κ(G) ≥ k) when k = 1.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130009531","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

Approximation guarantees for fictitious play 虚拟游戏的近似保证

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

Vincent Conitzer

{"title":"Approximation guarantees for fictitious play","authors":"Vincent Conitzer","doi":"10.1109/ALLERTON.2009.5394918","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394918","url":null,"abstract":"Fictitious play is a simple, well-known, and often-used algorithm for playing (and, especially, learning to play) games. However, in general it does not converge to equilibrium; even when it does, we may not be able to run it to convergence. Still, we may obtain an approximate equilibrium. In this paper, we study the approximation properties that fictitious play obtains when it is run for a limited number of rounds. We show that if both players randomize uniformly over their actions in the first r rounds of fictitious play, then the result is an e-equilibrium, where ∊ = (r + l)/(2r). (Since we are examining only a constant number of pure strategies, we know that ∊ ≤ 1/2 is impossible, due to a result of Feder et al.) We show that this bound is tight in the worst case; however, with an experiment on random games, we illustrate that fictitious play usually obtains a much better approximation. We then consider the possibility that the players fail to choose the same r. We show how to obtain the optimal approximation guarantee when both the opponent's r and the game are adversarially chosen (but there is an upper bound R on the opponent's r), using a linear program formulation. We show that if the action played in the ith round of fictitious play is chosen with probability proportional to: 1 for i = 1 and l/(i − 1) for all 2 ≤ i ≤ R + l, this gives an approximation guarantee of 1 − 1/(2 + lnÄ). We also obtain a lower bound of 1 − 4/ In R. This provides an actionable prescription for how long to run fictitious play.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"9 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":"121833292","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}

引用次数: 19

Joint compression and data protection 联合压缩和数据保护

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

João Almeida, Joao Barros

引用次数: 2

Distributed agreement in the presence of noise 在噪声存在下的分布式协议

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

Jing Wang, N. Elia

引用次数: 10

Data movement in flash memories 闪存中的数据移动

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

Anxiao Jiang, M. Langberg, R. Mateescu, Jehoshua Bruck

引用次数: 5

Optimization and analysis of distributed averaging with memory 内存分布式平均算法的优化与分析

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

Boris N. Oreshkin, M. Coates, M. Rabbat

{"title":"Optimization and analysis of distributed averaging with memory","authors":"Boris N. Oreshkin, M. Coates, M. Rabbat","doi":"10.1109/ALLERTON.2009.5394786","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394786","url":null,"abstract":"This paper analyzes the rate of convergence of a distributed averaging scheme making use of memory at each node. In conventional distributed averaging, each node computes an update based on its current state and the current states of their neighbours. Previous work observed the trajectories at each node converge smoothly and demonstrated via simulation that a predictive framework can lead to faster rates of convergence. This paper provides theoretical guarantees for a distributed averaging algorithm with memory. We analyze a scheme where updates are computed as a convex combination of two terms: (i) the usual update using only current states, and (ii) a local linear predictor term that makes use of a node's current and previous states. Although this scheme only requires one additional memory register, we prove that this approach can lead to dramatic improvements in the rate of convergence. For example, on the N-node chain topology, our approach leads to a factor of N improvement over the standard approach, and on the two-dimensional grid, our approach achieves a factor of √N improvement. Our analysis is direct and involves relating the eigenvalues of a conventional (memoryless) averaging matrix to the eigenvalues of the averaging matrix implementing the proposed scheme via a standard linearization of the quadratic eigenvalue problem. The success of our approach relies on each node using the optimal parameter for combining the two update terms. We derive a closed form expression for the optimal parameter as a function of the second largest eigenvalue of a memoryless averaging matrix, which can easily be computed in a decentralized fashion using existing methods, making our approach amenable to a practical implementation.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"18 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":"122428786","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

Optimizing the decision to expel attackers from an information system 优化将攻击者驱逐出信息系统的决策

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

Ning Bao, J. Musacchio

{"title":"Optimizing the decision to expel attackers from an information system","authors":"Ning Bao, J. Musacchio","doi":"10.1109/ALLERTON.2009.5394923","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394923","url":null,"abstract":"The conventional reaction after detecting an attacker in an information system is to expel the attacker immediately. However the attacker is likely to attempt to reenter the system, and if the attacker succeeds in reentering, it might take some time for the defender's intrusion detection system (IDS) to re-detect the attacker's presence. In this interaction, both the attacker and defender are learning about each other — their vulnerabilities, intentions, and methods. Moreover, during periods when the attacker has reentered the system undetected, he is likely learning faster than the defender. The more the attacker learns, the greater the chance that he succeeds in his objective — whether it be stealing information, inserting malware, or some other objective. Conversely, the greater the defender's knowledge, the more likely that the defender can prevent the attacker from succeeding. In this setting, we study the defender's optimal strategy for expelling or not expelling an intruder. We find that the policy of always expelling the attacker can be far from optimal. Furthermore, by formulating the problem as a Markov decision process (MDP), we find how the optimal decision depends on the state variables and model parameters that characterize the IDS's detection rate and the attacker's persistence.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"47 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":"128708962","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

Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsity 高维回归在q球稀疏性下的极大极小收敛率

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

Garvesh Raskutti, M. Wainwright, Bin Yu

{"title":"Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsity","authors":"Garvesh Raskutti, M. Wainwright, Bin Yu","doi":"10.1109/ALLERTON.2009.5394804","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394804","url":null,"abstract":"Consider the standard linear regression model y = Xß∗ + w, where y ∊ Rn is an observation vector, X ∊ Rn×d is a measurement matrix, ß∗ ∊ Rd is the unknown regression vector, and w ~ N (0, σ2Ι) is additive Gaussian noise. This paper determines sharp minimax rates of convergence for estimation of ß∗ in l<inf>2</inf> norm, assuming that β∗ belongs to a weak l<inf>b</inf>-ball B<inf>q</inf>(ñ<inf>q</inf>) for some q ∊ [0,1]. We show that under suitable regularity conditions on the design matrix X, the minimax error in squared l<inf>2</inf>-norm scales as R<inf>q</inf>(log d ÷ n)1 −q÷2. In addition, we provide lower bounds on rates of convergence for general l<inf>p</inf> norm (for all p ∊ [l,+∞], p ≠ q). Our proofs of the lower bounds are information-theoretic in nature, based on Fano's inequality and results on the metric entropy of the balls B<inf>q</inf>(R<inf>q</inf>). Matching upper bounds are derived by direct analysis of the solution to an optimization algorithm over B<inf>q</inf>(R<inf>q</inf>). We prove that the conditions on X required by optimal algorithms are satisfied with high probability by broad classes of non-i.i.d. Gaussian random matrices, for which RIP or other sparse eigenvalue conditions are violated. For q = 0, t<inf>1</inf>-based methods (Lasso and Dantzig selector) achieve the minimax optimal rates in t<inf>2</inf> error, but require stronger regularity conditions on the design than the non-convex optimization algorithm used to determine the minimax upper bounds.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"1 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":"129647635","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

Sharing information in time-division duplexing channels: A network coding approach 分时双工信道中的信息共享:一种网络编码方法

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

D. Lucani, M. Médard, M. Stojanovic, David R Karger

{"title":"Sharing information in time-division duplexing channels: A network coding approach","authors":"D. Lucani, M. Médard, M. Stojanovic, David R Karger","doi":"10.1109/ALLERTON.2009.5394510","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394510","url":null,"abstract":"We study random linear network coding for time-division duplexing channels for sharing information between nodes. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. Each node will act as both a sender of its own information and a receiver for the information of the other nodes. When a node acts as the sender, it transmits coded data packets back-to-back before stopping to wait for the receivers to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. This acknowledgment comes in the header of the coded packets that are sent by the other nodes. We study the mean time to complete the sharing process between the nodes. We provide a simple algorithm to compute the number of coded packets to be sent back-to-back depending on the state of the system. We present numerical results for the case of two nodes sharing data and show that the mean completion time of our scheme is close to the performance of a full duplex network coding scheme and can outperform full duplex schemes with no coding.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"114 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":"124078719","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

Low-rank matrix completion with noisy observations: A quantitative comparison 带噪声观测的低秩矩阵补全:定量比较

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

Raghunandan H. Keshavan, A. Montanari, Sewoong Oh

引用次数: 40