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

{"title":"M-Perf: An available bandwidth estimation tool for multicast applications","authors":"N. Sundaram, P. Ramanathan","doi":"10.1109/ALLERTON.2008.4797551","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797551","url":null,"abstract":"In this paper, we present M-Perf, a tool to estimate the total available bandwidth to each receiver in a multicast session where total available bandwidth is defined as the maximum flow rate from the source to the receiver in a given directed acyclic graph. M-Perf achieves this objective using a technique called network coding. Therefore, unlike end-to-end bandwidth estimation tools, M-Perf requires support from forwarding nodes. Such support is easily available for application layer multicasts in overlay networks. It may also become available in the future for network layer multicast through lower layer support for network coding. We show that M-Perf accurately estimates the available bandwidth using two overlay networks: local-area overlay at University of Wisconsin and wide-area overlay on Planetlab [1]. We also integrate M-Perf into a multimedia streaming application to demonstrate a usage case scenario and further evaluate its effectiveness.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 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":"132808031","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}

{"title":"On the secure degrees of freedom of wireless X networks","authors":"Tiangao Gou, S. Jafar","doi":"10.1109/ALLERTON.2008.4797643","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797643","url":null,"abstract":"Previous work showed that the X network with M transmitters, N receivers has MN/M+N-1 degrees of freedom. In this work we study the degrees of freedom of the X network with secrecy constraints, i.e. the X network where some/all messages are confidential. We consider the M times N network where all messages are secured and show that N(M-1)/M+N-1 degrees of freedom can be achieved. Secondly, we show that if messages from only M - 1 transmitters are confidential, then MN/M+N-1 degrees of freedom can be achieved meaning that there is no loss of degrees of freedom because of secrecy constraints. We also consider the achievable secure degrees of freedom under a more conservative secrecy constraint. We require that messages from any subset of transmitters are secure even if other transmitters are compromised, i.e., messages from the compromised transmitter are revealed to the unintended receivers. We also study the achievable secure degrees of freedom of the K user Gaussian interference channel under two different secrecy constraints where 1/2 secure degrees of freedom per message can be achieved. The achievable scheme in all cases is based on random binning combined with interference alignment.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"322 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":"134183089","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}

{"title":"Efficient energy management policies for networks with energy harvesting sensor nodes","authors":"V. Sharma, U. Mukherji, V. Joseph","doi":"10.1109/ALLERTON.2008.4797582","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797582","url":null,"abstract":"We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop efficient energy management policies. First, for a single node, we obtain policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable sub-optimal policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay. Next using the results for a single node, we develop efficient MAC policies.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"06 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":"130601564","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}

{"title":"Compressed sensing over the Grassmann manifold: A unified analytical framework","authors":"Weiyu Xu, B. Hassibi","doi":"10.1109/ALLERTON.2008.4797608","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797608","url":null,"abstract":"It is well known that compressed sensing problems reduce to finding the sparse solutions for large under-determined systems of equations. Although finding the sparse solutions in general may be computationally difficult, starting with the seminal work of [2], it has been shown that linear programming techniques, obtained from an l1-norm relaxation of the original non-convex problem, can provably find the unknown vector in certain instances. In particular, using a certain restricted isometry property, [2] shows that for measurement matrices chosen from a random Gaussian ensemble, l1 optimization can find the correct solution with overwhelming probability even when the support size of the unknown vector is proportional to its dimension. The paper [1] uses results on neighborly polytopes from [6] to give a ldquosharprdquo bound on what this proportionality should be in the Gaussian measurement ensemble. In this paper we shall focus on finding sharp bounds on the recovery of ldquoapproximately sparserdquo signals (also possibly under noisy measurements). While the restricted isometry property can be used to study the recovery of approximately sparse signals (and also in the presence of noisy measurements), the obtained bounds can be quite loose. On the other hand, the neighborly polytopes technique which yields sharp bounds for ideally sparse signals cannot be generalized to approximately sparse signals. In this paper, starting from a necessary and sufficient condition for achieving a certain signal recovery accuracy, using high-dimensional geometry, we give a unified null-space Grassmannian angle-based analytical framework for compressive sensing. This new framework gives sharp quantitative tradeoffs between the signal sparsity and the recovery accuracy of the l1 optimization for approximately sparse signals. As it will turn out, the neighborly polytopes result of [1] for ideally sparse signals can be viewed as a special case of ours. Our result concerns fundamental properties of linear subspaces and so may be of independent mathematical interest.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"124 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":"133437116","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}

{"title":"Compound Gaussian multiple access channels with noisy feedback","authors":"A. Sabharwal, D. Dash, S. Diggavi","doi":"10.1109/ALLERTON.2008.4797651","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797651","url":null,"abstract":"In this paper, we study the role of noisy feedback in compound Gaussian multiple access channels, where both the set of active users and their respective channels are unknown a priori. The system is modeled as a special form of two-way network, where transmitters and receivers can interact with each other to improve the overall communication efficiency, but the information flow is not bi-directional. We first characterize the compound channel capacity when there is no feedback in the system, which turns out to be simply an intersection of several capacity regions. Next, we analyze a polling, channel estimation and feedback protocol, which achieves a rate region to within log(K) bits/use of a K-user system with perfect feedback.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"26 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":"132379797","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}

{"title":"On the secrecy capacity of arbitrary wiretap channels","authors":"Matthieu Bloch, J. Nicholas Laneman","doi":"10.1109/ALLERTON.2008.4797642","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797642","url":null,"abstract":"We investigate the fundamental secrecy limits of arbitrary wiretap channels using the information-spectrum approach and we provide a random coding theorem for the secrecy capacity under various secrecy metrics. We show how our result specializes to several recent results, e.g., compound channels, parallel channels, and fading channels. As a side benefit, our analysis shows that earlier results hold under more stringent secrecy metrics than previously established.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 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":"129319953","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}

{"title":"Exact low-rank matrix completion via convex optimization","authors":"Emmanuel J. Candès, Benjamin Recht","doi":"10.1109/ALLERTON.2008.4797640","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797640","url":null,"abstract":"Suppose that one observes an incomplete subset of entries selected uniformly at random from a low-rank matrix. When is it possible to complete the matrix and recover the entries that have not been seen? We show that in very general settings, one can perfectly recover all of the missing entries from a sufficiently large random subset by solving a convex programming problem. This program finds the matrix with the minimum nuclear norm agreeing with the observed entries. The techniques used in this analysis draw upon parallels in the field of compressed sensing, demonstrating that objects other than signals and images can be perfectly reconstructed from very limited information.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 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":"122298420","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}

{"title":"The shapley value: Its use and implications on internet economics","authors":"Richard T. B. Ma, John C.S. Lui, D. Chiu, V. Misra, D. Rubenstein","doi":"10.1109/ALLERTON.2008.4797681","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797681","url":null,"abstract":"The Internet is composed of thousand of autonomous Internet Service Providers (ISPs). On the one hand, they cooperate with one another to provide services for their customers; on the other hand, they compete with each other by using selfish routing and interconnecting strategies to maximize their own profits. Currently, ISPs use bilateral settlements to decide the financial compensation one ISP pays to another. However, without an appropriate settlement model, ISPs disputes might lead to disgraceful consequences. For example, Level 3 unilaterally terminated its ldquosettlement freerdquo peering relationship with Cogent on October 5, 2005. This disruption resulted in at least 15% of the Internet to be unreachable for the users who utilized either Level 3 or Cogent for Internet access. Although both companies restored peering connections several days later with a new ongoing negotiation, Level 3's move against Cogent exhibited an escalation of the tension that necessitates a new settlement for ISPs.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"20 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":"124671154","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}

{"title":"Efficient maximum-likelihood noncoherent orthogonal STBC detection","authors":"D. Papailiopoulos, G. N. Karystinos","doi":"10.1109/ALLERTON.2008.4797570","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797570","url":null,"abstract":"Orthogonal space-time block coding (STBC) offers linear-complexity one-shot maximum-likelihood (ML) reception when the channel coefficients are known to the receiver. However, when the channel coefficients are unknown, the optimal receiver takes the form of sequence detection. In this work, we prove that ML noncoherent sequence detection can always be performed in polynomial time with respect to the block length for orthogonal STBC and Rayleigh distributed channel coefficients. Using recent results on efficient maximization of reduced-rank quadratic forms over finite alphabets, we develop a novel algorithm that performs ML noncoherent orthogonal STBC detection with polynomial complexity in the block length. The order of the polynomial complexity of the proposed receiver is determined by the number of transmit and receive antennas.","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":"124996674","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}

{"title":"Adversarial error correction for network coding: Models and metrics","authors":"Danilo Silva, F. Kschischang","doi":"10.1109/ALLERTON.2008.4797703","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797703","url":null,"abstract":"The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and destination nodes, the error correction capability of an (outer) code is succinctly described by the rank metric; as a consequence, it is shown that universal network error correcting codes achieving the Singleton bound can be easily constructed and efficiently decoded. For noncoherent network coding, where knowledge of the network topology and network code is not assumed, the error correction capability of a (subspace) code is given exactly by a modified subspace metric, which is closely related to, but different than, the subspace metric of Kotter and Kschischang. In particular, in the case of a non-constantdimension code, the decoder associated with the modified metric is shown to correct more errors then a minimum subspace distance decoder.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 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":"125952511","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}