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

{"title":"Minimal error certificates for detection of faulty sensors using convex optimization","authors":"C. Claudel, Matthieu Nahoum, A. Bayen","doi":"10.1109/ALLERTON.2009.5394554","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394554","url":null,"abstract":"This article proposes a new method for sensor fault detection, applicable to systems modeled by conservation laws. The state of the system is modeled by a Hamilton-Jacobi equation, in which the Hamiltonian is uncertain. Using a LaxHopf formula, we show that any local measurement of the state of the system restricts the allowed set of possible values of other local measurements. We derive these constraints explicitly for arbitrary Hamilton-Jacobi equations. We apply this framework to sensor fault detection, and pose the problem finding the minimal possible sensor error (minimal error certificate) as a set of convex programs. We illustrate the performance of the resulting algorithms for a highway traffic flow monitoring sensor network in the San-Francisco Bay Area.","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":"131311341","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":"Trapping set ontology","authors":"B. Vasic, S. K. Chilappagari, D. V. Nguyen, S. Planjery","doi":"10.1109/ALLERTON.2009.5394825","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394825","url":null,"abstract":"The failures of iterative decoders for low-density parity-check (LDPC) codes on the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC) can be understood in terms of combinatorial objects known as trapping sets. In this paper, we derive a systematic method to identify the most relevant trapping sets for decoding over the BSC in the error floor region. We elaborate on the notion of the critical number of a trapping set and derive a classification of trapping sets. We then develop the trapping set ontology, a database of trapping sets that summarizes the topological relations among trapping sets. We elucidate the usefulness of the trapping set ontology in predicting the error floor as well as in designing better codes.","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":"131326426","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 lossy one-helper conjecture is false","authors":"A. Wagner, B. Kelly, Y. Altug","doi":"10.1109/ALLERTON.2009.5394933","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394933","url":null,"abstract":"We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This resolves in the negative an open question regarding whether independent quantization followed by independent binning is optimal for the two-encoder problem with a distortion constraint on one source. We also show that independent quantization and binning is suboptimal for the three-encoder problem in which the goal is to reproduce one of the sources losslessly. This provides a counterexample that is fundamentally different from one provided earlier by Ko¿rner and Marton. The proofs rely on the binary analogue of the entropy power inequality and the existence of a rate loss for the binary symmetric Wyner-Ziv problem.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"2 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":"130013002","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":"Novel burst error correcting algorithms for Reed-Solomon codes","authors":"Yingquan Wu","doi":"10.1109/ALLERTON.2009.5394877","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394877","url":null,"abstract":"In this paper, we present three novel burst error correcting algorithms for an (n,k,r = n − k) Reed-Solomon code. The algorithmic complexities are of the same order for erasure-and-error decoding, O(rn), moreover, their hardware implementation shares the elements of the Blahut erasure-and-error decoding. In contrast, all existing single-burst error correcting algorithms, which are equivalent to the proposed first algorithm, have cubic complexity, O(r²n). The first algorithm corrects the shortest single-burst with length f <r. The algorithm follows the key characterization that the starting locations of all candidate bursts can be purely determined by the roots of a polynomial which is a linear function of syndromes, and moreover, the shortest burst is associated with the longest sequence of consecutive roots. The algorithmic miscorrection rate is bounded by nq^f-r, where q denotes the field size. The second algorithm extends the first one to correct the shortest burst with length f < r-2 with up to a random error. The algorithmic miscorrection rate is bounded by n²q^f+1-r. The third algorithm aims to correct the shortest burst with length f < r −2δ with up to δ random errors, where δ is a given small number. The algorithmic miscorrection rate is bounded by n^δ+1q^-(r-f-δ) while its defect rate is bounded by nq^-(r-2δ-f)δ (whereas no defect occurs to the proposed first and second algorithms).","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":"128677396","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":"An achievable rate region for the Gaussian Z-interference channel with conferencing","authors":"Hieu T. Do, T. Oechtering, M. Skoglund","doi":"10.1109/ALLERTON.2009.5394841","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394841","url":null,"abstract":"This paper presents an achievable rate region for a 2-user Gaussian Z-interference channel with a noiseless and bidirectional digital communication link between the receivers. The region is achieved by utilizing the rate-splitting encoding technique, and the decode-and-forward and compress-and-forward strategies. In the very strong interference regime, the capacity region is achieved. In the weak interference regime, the asymptotic sum rate is characterized and shown to be possibly unbounded, which is in contrast to a recent result by Yu and Zhou for a similar scenario, however, with a unidirectional communication link between the receivers.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"34 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":"128873019","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":"Distributed detection and localization of events in large ad hoc wireless sensor networks","authors":"K. Premkumar, Anurag Kumar, J. Kuri","doi":"10.1109/ALLERTON.2009.5394901","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394901","url":null,"abstract":"We consider the problem of event detection in wireless sensor networks (WSNs) that are large in the sense that an event affects the statistics of the observations of a small number of sensors in the vicinity of where it occurs. An event occurs at a random time at a random location in the region (called the region of interest, ROI) covered by the WSN. We consider a distance based sensing model in which the physical signal sensed by a sensor at a distance d from the event is attenuated by a factor ρ(d). We formulate the problem of detecting an event as early as possible and locating it to a subregion of the ROI under the constraints that the average time to false alarm (TFA) and the average time to false isolation (TFI) are bounded by γ. This formulation is motivated by the change detection/isolation framework introduced by Nikiforov [6]. We extend the decentralized detection procedures MAX [11] and ALL [9], [5], which are designed for colocated networks, to the case of a large WSN where the event localization is also a critical issue. The extended MAX and ALL detect the change and identify a subregion where the event is located. Sensor noise can make the local decisions of ALL toggle rapidly. Motivated by this fact, we propose a distributed change detection/isolation procedure, HALL (Hysteresis modified ALL). We study the supremum average detection delay (SADD) performance of the change detection/isolation procedures MAX, ALL and HALL for a required min{TFA,TFI} ≳ γ. We show that as γ → ∞, the (asymptotic) SADD(ALL) ≤ ln γ ÷ ω0M I, SADD(HALL) ≤ ln (γ + 1) ÷ ω0(1 − 1/β)M I + C, and SADD(MAX) ≤ ln γ ÷ ω0I, where ω0, C, β and M are constants that depend on the sensor deployment, the postchange and the prechange distributions of sensor measurements, and I is the Kullback-Leibler divergence between a worst-case postchange distribution and the prechange distribution of sensor measurements. We also compare the SADD of the distributed procedures with that of the asymptotically optimal centralized procedure given by Nikiforov [6] for a Boolean sensing model. We show that the SADD performance of ALL and HALL is of the same order as that of Nikiforov's. We also provide numerical comparison of SADD and TFA for the centralized asymptotically optimal scheme [6], and the distributed schemes MAX, ALL and HALL.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"368 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":"126707151","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":"Distributed transmission of functions of correlated sources over a fading multiple access channel","authors":"R. Rajesh, V. Sharma","doi":"10.1109/ALLERTON.2009.5394495","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394495","url":null,"abstract":"In this paper we address the problem of distributed transmission of functions of correlated sources over a fast fading multiple access channel (MAC). This is a basic building block in a hierarchical sensor network used in estimating a random field where the cluster head is interested only in estimating a function of the observations. The observations are transmitted to the cluster head through a fast fading MAC. We provide sufficient conditions for lossy transmission when the encoders and decoders are provided with partial information about the channel state. Furthermore signal side information maybe available at the encoders and the decoder. Various previous studies are shown as special cases. Efficient joint-source channel coding schemes are discussed for transmission of discrete and continuous alphabet sources to recover function values.","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":"127748849","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":"Interference alignment at finite SNR: General message sets","authors":"B. Nazer, Michael Gastpart, S. Jafar, S. Vishwanath","doi":"10.1109/ALLERTON.2009.5394946","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394946","url":null,"abstract":"Interference alignment has proven to be a powerful tool in characterizing the high SNR behavior of wireless networks. Using this technique, Cadambe and Jafar showed that the sum degrees-of-freedom for the K-user interference channel is K/2 rather than 1 as was originally expected. In recent work, we showed that these gains are not limited to the high SNR regime. In fact, for the interference channel, each user can achieve at least half its interference-free capacity at any SNR. The key to this result was a new achievability technique called ergodic interference alignment. In this paper, we extend this technique to include more general message sets. Specifically, we consider the multicast case where each transmitter has a message destined for more than one receiver. We also look at the X channel configuration for 2 receivers where each transmitter has an independent message for each receiver.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"39 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":"127949589","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":"Power savings from half-duplex relaying in downlink cellular systems","authors":"C. Raman, G. Foschini, R. Valenzuela, R. Yates, N. Mandayam","doi":"10.1109/ALLERTON.2009.5394937","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394937","url":null,"abstract":"We evaluate the peak and average power savings due to relay deployments in cellular systems via a simulation study. The peak power savings translate to cost reduction in power amplifiers. The average power savings lead to savings in electricity bills. Half-duplex relays are placed one per sector in a 19-cell, 57-sector cellular network. In the baseline case, the base stations control their transmit powers to achieve a common rate among users. When relays are present in the system, optimal powers are found when the relays get the complete message to be relayed to the user. The codebooks at the relays are chosen such that the users obtain a rate corresponding to the sum of the received powers from the base station and the relay. We observe that when power control is employed, the peak power saving is 2.6 dB and the average total power in the system can be reduced by 3 dB.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"23 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":"116953220","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":"Secrecy capacity region of the degraded compound multi-receiver wiretap channel","authors":"E. Ekrem, S. Ulukus","doi":"10.1109/ALLERTON.2009.5394526","DOIUrl":"https://doi.org/10.1109/ALLERTON.2009.5394526","url":null,"abstract":"We study the degraded compound multi-receiver wiretap channel, which consists of two groups of users and a group of eavesdroppers. We consider two different communication scenarios. In both scenarios, the transmitter sends two confidential messages, one for each group of users. In the first scenario, both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multi-input multi-output (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario, the message sent to the first group of users needs to be kept confidential from both the second group of users and eavesdroppers, whereas the message sent to the second group of users needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. We find the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we obtain the secrecy capacity region when there is only one user in the second group.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"153 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":"122858954","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}