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

Cost sharing with network coding in two-way relay networks 双向中继网络中网络编码的成本分担

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

E. Ciftcioglu, Y. Sagduyu, R. Berry, A. Yener

{"title":"Cost sharing with network coding in two-way relay networks","authors":"E. Ciftcioglu, Y. Sagduyu, R. Berry, A. Yener","doi":"10.1109/ALLERTON.2009.5394485","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394485","url":null,"abstract":"We consider a scenario in which two sources exchange stochastically varying traffic with the aid of a bidirectional relay that may perform network coding over the incoming packets. Each relay use incurs a unit cost, e.g., transmission energy. This cost is shared between the sources when packets from both are transmitted via network coding; if traffic from a single source is sent, the cost is passed on to only that source. We study transmission policies which trade-off the average cost with the average packet delay. First, we analyze the cost-delay trade-off for a centralized control scheme using Lyapunov stability arguments. We then consider a distributed control scheme, where each source selfishly optimizes its own cost-delay trade-off by playing a non-cooperative game. We determine the Nash equilibrium and show that it performs worse than the centralized algorithm. However, appropriate pricing at the relay achieves the centralized performance. These algorithms require full information of queue backlogs. Next, we relax this assumption and any source makes the transmission decision depending on whether the other sources queue backlog exceeds a threshold, or not. This needs only one bit information exchange and leads to asymptotically optimal cost, as the delay grows. Finally, we consider cost sharing with only local queue information at each source. The results illustrate new cost-delay trade-offs based on different levels of cooperation and queue information availability.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"29 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":"129363894","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

Secure function evaluation based on secret sharing and homomorphic encryption 基于秘密共享和同态加密的安全函数评估

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

S. Rane, Wei Sun, A. Vetro

引用次数: 5

Violating the Ingleton inequality with finite groups 有限群违反Ingleton不等式

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

W. Mao, B. Hassibi

{"title":"Violating the Ingleton inequality with finite groups","authors":"W. Mao, B. Hassibi","doi":"10.1109/ALLERTON.2009.5394878","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394878","url":null,"abstract":"It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups [1]. However, if one restricts attention to abelian groups then not all entropy vectors can be obtained. This is an explanation for the fact shown by Dougherty et al [2] that linear network codes cannot achieve capacity in general network coding problems (since linear network codes form an abelian group). All abelian group-characterizable vectors, and by fiat all entropy vectors generated by linear network codes, satisfy a linear inequality called the Ingleton inequality. In this paper, we study the problem of finding non-abelian finite groups that yield characterizable vectors which violate the Ingleton inequality. Using a refined computer search, we find the symmetric group S5 to be the smallest group that violates the Ingleton inequality. Careful study of the structure of this group, and its subgroups, reveals that it belongs to the Ingleton-violating family PGL(2, p) with primes p ≥ 5, i.e., the projective group of 2×2 nonsingular matrices with entries in Fp. This family of groups is therefore a good candidate for constructing network codes more powerful than linear network codes.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"25 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":"122141944","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}

引用次数: 17

Interference networks with local view: A distributed optimization approach 具有局部视图的干扰网络:一种分布式优化方法

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

Jun Xiao, V. Aggarwal, A. Sabharwal, Y. Liu

{"title":"Interference networks with local view: A distributed optimization approach","authors":"Jun Xiao, V. Aggarwal, A. Sabharwal, Y. Liu","doi":"10.1109/ALLERTON.2009.5394535","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394535","url":null,"abstract":"In practice, a node in a network learns the channel through local message passing and obtains a local view of the network. Pure wireless message passing as well as mixed wireless and wireline message passing are considered in this paper. We study the distributed optimization of sum-rate for a class of deterministic interference networks with local view. A connection based utility function is designed for each user to exploit the local knowledge. This utility design turns out to be a potential game with sum-rate as the potential function. For the one-to-many channel with 1.5 wireless rounds of message passing, we show that there is a unique Nash equilibrium and using this strategy, the sum capacity can be achieved. We provide a sufficient condition for which a topology does not have unique Nash equilibrium. Then we consider the scenario that the network size and the users IDs are provided to each user. For various mixed wireless and wireline message passing patterns, including wireline at transmitter/receiver side and sequential/concurrent message passing scheduling, we identify whether a three-user interference network can achieve the sum capacity in a distributed fashion. Compared with the 1.5 pure wireless rounds of message passing, the results show that 2.5 mixed wireless and wireline rounds of message passing can significantly improve the system performance of three-user interference networks. We also derive some sufficient conditions for general K-user interference networks such that the sum capacity can not be achieved based on each user's local view.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"7 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":"117152110","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

Stable and utility-maximizing scheduling for stochastic processing networks 随机处理网络的稳定与效用最大化调度

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

Libin Jiang, J. Walrand

引用次数: 38

On the sum capacity of the Gaussian multiple access channel with feedback 带反馈的高斯多址信道的和容量

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

E. Ardetsanizadeh, T. Javidi, Young-Han Kim, M. Wigger

{"title":"On the sum capacity of the Gaussian multiple access channel with feedback","authors":"E. Ardetsanizadeh, T. Javidi, Young-Han Kim, M. Wigger","doi":"10.1109/ALLERTON.2009.5394950","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394950","url":null,"abstract":"This paper studies the sum capacity C(P) of the N-sender additive white Gaussian noise (AWGN) multiple access channel (MAC), under equal power constraint P, when noiseless output feedback is available to all the N senders. The multiletter characterization of the sum capacity, in terms of directed information, is considered as an optimization problem. The main result of this paper is to solve this problem when it is restricted to Gaussian causally conditional input distributions. Also, a dependence balance bound in terms of directed information is introduced, which for the case of memoryless channels is the same as the bound introduced by Kramer and Gastpar. This bound is used to capture the causality, however, since it is in general ¿non-convex¿ makes the problem technically hard. A general upper bound is obtained by forming the Lagrange dual problem and it is then shown that this upper bound coincides with the sum-rate achieved by Kramer's Fourier-MEC scheme. This result generalizes earlier work by Kramer and Gastpar on the achievable sum rate under a ¿per-symbol¿ power constraint to the one under the standard ¿block¿ power constraint.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"25 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":"127402850","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

How do the structure and the parameters of Gaussian tree models affect structure learning? 高斯树模型的结构和参数是如何影响结构学习的?

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

V. Tan, Anima Anandkumar, A. Willsky

{"title":"How do the structure and the parameters of Gaussian tree models affect structure learning?","authors":"V. Tan, Anima Anandkumar, A. Willsky","doi":"10.1109/ALLERTON.2009.5394929","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394929","url":null,"abstract":"The problem of learning tree-structured Gaussian graphical models from i.i.d. samples is considered. The influence of the tree structure and the parameters of the Gaussian distribution on the learning rate as the number of samples increases is discussed. Specifically, the error exponent corresponding to the event that the estimated tree structure differs from the actual unknown tree structure of the distribution is analyzed. Finding the error exponent reduces to a least-squares problem in the very noisy learning regime. In this regime, it is shown that universally, the extremal tree structures which maximize and minimize the error exponent are the star and the Markov chain for any fixed set of correlation coefficients on the edges of the tree. In other words, the star and the chain graphs represent the hardest and the easiest structures to learn in the class of tree-structured Gaussian graphical models. This result can also be intuitively explained by correlation decay: pairs of nodes which are far apart, in terms of graph distance, are unlikely to be mistaken as edges by the maximum-likelihood estimator in the asymptotic regime.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"41 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":"127016686","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}

引用次数: 2

Distributed algorithm for collaborative detection in cognitive radio networks 认知无线网络协同检测的分布式算法

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

Yingbin Liang, L. Lai, John Halloran

引用次数: 5

On the existence of triangles in random key graphs 论随机键图中三角形的存在性

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

Osman Yağan, A. Makowski

引用次数: 16

Signal detection in sparse multipath channels 稀疏多径信道中的信号检测

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

Matt Malloy, A. Sayeed

{"title":"Signal detection in sparse multipath channels","authors":"Matt Malloy, A. Sayeed","doi":"10.1109/ALLERTON.2009.5394817","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394817","url":null,"abstract":"In this paper, we revisit the problem of signal detection in multipath environments. Existing results implicitly assume a rich multipath environment. Our work is motivated by physical arguments and recent experimental results that suggest physical channels encountered in practice exhibit a sparse structure, especially at high signal space dimension (i.e., large time-bandwidth product). We first present a model for sparse channels that quantifies the independent degrees of freedom (DoF) in the channel as a function of the physical propagation environment and signal space dimension. The number of DoF represents the delay-Doppler diversity afforded by the channel and, thus, critically impacts detection performance. Our focus is on two types of non-coherent detectors: the energy detector (ED) and the optimal non-coherent detector (ONCD) that assumes full knowledge of channel statistics. Results show, for a uniform distribution of paths in delay and Doppler, the channel exhibits a rich structure at low signal space dimension and then gets progressively sparser as this dimension is increased. Consequently, the performance of the detectors is identical in the rich regime. As the signal space dimension is increased and the channel becomes sparser, the ED suffers significant degradation in performance relative to the ONCD. Finally, our results show the existence of an optimal signal space dimension — one that yields the best detection performance — as a function of the physical channel characteristics and the operating signal to noise ratio (SNR).","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"6 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":"123706557","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}

引用次数: 4