2008 46th Annual Allerton Conference on Communication, Control, and Computing最新文献_第4页

P2P streaming capacity for heterogeneous users with degree bounds 具有度界的异构用户P2P流容量

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797663

Shao Liu, M. Chiang, S. Sengupta, Jin Li, P. Chou

{"title":"P2P streaming capacity for heterogeneous users with degree bounds","authors":"Shao Liu, M. Chiang, S. Sengupta, Jin Li, P. Chou","doi":"10.1109/ALLERTON.2008.4797663","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797663","url":null,"abstract":"Peer-to-peer live streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. The fundamental problem in peer-to-peer streaming is its capacity problem, or the maximum supported stream rate for a given network with a given peer selection constraint. This problem has been widely studied for small networks where the number of downloading peers is unlimited. For a large networks, however, the number of downloading peers must be limited, which adds an outgoing degree bound for each overlay multicast tree. The streaming capacity problem under uniform degree bound has been first studied in, which solves the problem for homogeneous users, and derives an upper bound for streaming capacity for heterogeneous users. In this paper, we first design an algorithm to construct trees that actually achieve the upper bound for streaming capacity under the case of heterogeneous users with uniform degree bound, and next solve the streaming capacity problem for nonuniform degree bound case also. From our study of the nonuniform degree bound case, we see that the degree bounds do not affect the streaming capacity if the degree bound of each peer is proportional to its uplink capacity.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130481485","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}

引用次数: 5

Power-delay analysis of consensus algorithms on wireless networks with interference 有干扰无线网络中一致性算法的功率延迟分析

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797734

S. Vanka, V. Gupta, M. Haenggi

引用次数: 24

Diversity-multiplexing tradeoff in multiple-relay network-part I: Proposed scheme and single-antenna networks 多中继网络中的分集-复用权衡。第一部分:建议方案和单天线网络

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797540

S. O. Gharan, A. Bayesteh, A. Khandani

{"title":"Diversity-multiplexing tradeoff in multiple-relay network-part I: Proposed scheme and single-antenna networks","authors":"S. O. Gharan, A. Bayesteh, A. Khandani","doi":"10.1109/ALLERTON.2008.4797540","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797540","url":null,"abstract":"This paper studies the setup of a multiple-relay network in which K half-duplex multiple-antenna relays assist in the transmission between a/several multiple-antenna source(s) and a multiple-antenna destination. Each two nodes are assumed to be either connected through a quasi-static Rayleigh fading channel, or disconnected. This paper is comprised of two parts. In this part of the paper, we propose a new scheme, which we call random sequential (RS), based on the amplify-and-forward relaying. We derive diversity-multiplexing tradeoff (DMT) of the proposed RS scheme for general single-antenna multiple-relay networks. As a result, we show that for single-antenna two-hop multiple-access multiple-relay (K > 1) networks (without direct link between the source(s) and the destination), the proposed RS scheme achieves the optimum DMT. However, for the case of multiple access single relay setup, we show that the RS scheme reduces to the naive amplify-and-forward relaying and is not optimum in terms of DMT, while the dynamic decode-and-forward scheme is shown to be optimum for this scenario.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114234015","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}

引用次数: 3

Large deviations for many server networks with long range dependent and batch arrivals 对于具有长距离依赖和批量到达的许多服务器网络来说，偏差很大

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797622

S. Kar, J. Moura, K. Ramanan

引用次数: 1

Relay networks with orthogonal components 具有正交分量的中继网络

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797631

Wooseok Nam, Sae-Young Chung

引用次数: 9

Minimization of transceiver energy consumption in wireless sensor networks with AWGN channels 带AWGN信道的无线传感器网络中收发器能耗最小化

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797536

Tianqi Wang, W. Heinzelman, Alireza Seyedi

引用次数: 33

Oblivious equilibrium for stochastic games with concave utility 具有凹效用的随机对策的遗忘均衡

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797711

S. Adlakha, Ramesh Johari, G. Weintraub, A. Goldsmith

{"title":"Oblivious equilibrium for stochastic games with concave utility","authors":"S. Adlakha, Ramesh Johari, G. Weintraub, A. Goldsmith","doi":"10.1109/ALLERTON.2008.4797711","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797711","url":null,"abstract":"We study stochastic games with a large number of players, where players are coupled via their payoff functions. A standard solution concept for stochastic games is Markov perfect equilibrium (MPE). In MPE, each player's strategy is a function of its own state as well as the state of other players. This makes MPE computationally prohibitive as the number of players becomes large. An approximate solution concept called oblivious equilibrium (OE) was introduced by Weintraub et al., where each player's decision depends only on its own state and the ldquolong-run averagerdquo state of other players. This makes OE computationally more tractable than MPE. It was shown that under a set of assumptions, as the number of players becomes large, OE closely approximates MPE. However, these assumptions require the computation of OE and verifying that the resulting stationary distribution satisfies a certain light-tail condition. In this paper, we derive exogenous conditions on the state dynamics and the payoff function under which the light-tail condition holds. A key condition is that the agents' payoffs are concave in their own state and actions. These exogenous conditions enable us to characterize a family of stochastic games in which OE is a good approximation for MPE.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131463508","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

Privacy leakage in biometric secrecy systems 生物识别保密系统中的隐私泄露

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797646

T. Ignatenko, F. Willems

{"title":"Privacy leakage in biometric secrecy systems","authors":"T. Ignatenko, F. Willems","doi":"10.1109/ALLERTON.2008.4797646","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797646","url":null,"abstract":"Motivated by Maurer [1993], Ahlswede and Csiszar [1993] introduced the concept of secret sharing. In their source model two terminals observe two correlated sequences. It is the objective of both terminals to form a common secret by interchanging a public message (helper data), that should contain only a negligible amount of information about the secret. Ahlswede and Csiszar showed that the maximum secret key rate that can be achieved in this way is equal to the mutual information between the two source outputs. In a biometric setting, where the sequences correspond to the enrollment and authentication data, it is crucial that the public message leaks as little information as possible about the biometric data, since compromised biometric data cannot be replaced. We investigate the fundamental trade-offs for four biometric settings. The first one is the standard (Ahlswede-Csiszar) secret generation setting, for which we determine the secret key rate - privacy leakage region. Here leakage corresponds to the mutual information between helper data and biometric enrollment sequence conditional on the secret. In the second setting the secret is not generated by the terminals but independently chosen, and transmitted using a public message. Again we determine the region of achievable rate - leakage pairs. In setting three and four we consider zero-leakage, i.e. the public message contains only a negligible amount of information about the secret and the biometric enrollment sequence. To achieve this a private key is needed which can be observed only by the terminals. We consider again both secret generation and secret transmission and determine for both cases the region of achievable secret key rate - private key rate pairs.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131762893","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}

引用次数: 25

Design and analysis of ISP-friendly file distribution protocols isp友好型文件分发协议的设计与分析

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797661

Minghong Lin, John C.S. Lui, D. Chiu

引用次数: 5

Medium access control for multicast traffic in ad-hoc networks ad-hoc网络中多播流量的介质访问控制

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI: 10.1109/ALLERTON.2008.4797637

M. Andrews, B. Shrader

{"title":"Medium access control for multicast traffic in ad-hoc networks","authors":"M. Andrews, B. Shrader","doi":"10.1109/ALLERTON.2008.4797637","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797637","url":null,"abstract":"We study a variety of problems related to scheduling and medium access control for multicast traffic in wireless networks. Understanding this type of traffic is important because the broadcast nature of the wireless medium means that it is particularly suited to multicast applications. However, most work on contention-based and random-access scheduling focuses on the case of unicast traffic. In earlier work we looked at what types of multicast throughput are obtainable in networks that purely use random access. In this paper we examine the following issues.(i) Does it make sense to employ fanout-splitting when scheduling multicast traffic in a wireless network, i.e. does it makes sense to try and transmit to different receivers at different times? (ii) How much capacity is lost when we use random access as opposed to more coordinated schedules. (iii) Is it possible to do a Bianchi-style Markov chain analysis of multicast throughput in contention-based medium access control? What does this type of analysis tell us about the relative benefits of fanout-splitting vs non-fanout-splitting. Our results show that there are situations where fanout-splitting can increase throughput and that in networks of general topology the capacity loss due to random access scheduling can be unbounded. We also provide a Bianchi-style analysis for multicast traffic and examine the difference in throughput for the fanout-splitting case and the non-fanout-splitting case.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132775106","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