{"title":"Effect of interference of full-duplex transmissions in underlay device-to-device communication","authors":"Samad Ali, Nandana Rajatheva, M. Latva-aho","doi":"10.1109/CWIT.2015.7255151","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255151","url":null,"abstract":"In this paper we investigate the effect of interference caused by in-band full-duplex radios in device-to-device communication (D2D). While using full-duplex radios in D2D, both users transmit, compared to half-duplex D2D in which one user transmits. This is going to cause more interference in underlay D2D communication since D2D link operates on the same radio resource blocks as cellular users. We consider uplink radio resource reuse of cellular users by D2D communication, and try to maximize the number of possible D2D links constrained to the interference on the cellular user. The number of D2D pairs that can be active in the full-duplex mode is smaller than in the half-duplex mode due to more interference from transmissions of both D2D nodes. We compare the total rate of half-duplex and full-duplex modes and evaluate the benefits of full-duplex radios.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115569696","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":"Communication of dependent messages over degraded compound channels","authors":"Zhong Cheng, Yongyi Mao, T. Chan","doi":"10.1109/CWIT.2015.7255175","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255175","url":null,"abstract":"In the communication of source-coded messages, certain dependency structures often exist among the messages, where a source model is proposed to model arbitrary dependency structure of such kind. Under a message-dependency model, the problem of communicating dependent messages subject to certain delay constraint is formulated as the problem of maximizing the average utility at the receiver. In this paper we derive the maximal achievable utilities for superposition codes and conventional channel codes over degraded compound channels. Analytic and numerical results are presented.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121558547","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 allocation for distributed estimation in sensor networks with semi-orthogonal MAC","authors":"Jian-Hao Su, Ha H. Nguyen, H. Tuan","doi":"10.1109/CWIT.2015.7255174","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255174","url":null,"abstract":"This paper is concerned with distributed estimation in a Gaussian sensor network under the semi-orthogonal multiple access channel (MAC). Under the total transmit power constraint, an improved power allocation scheme among sensors is investigated. In the semi-orthogonal MAC, since sensors are divided into groups, the issue of power allocation can be separated into two tasks: power allocation within each sensor group and power allocation among sensor groups. In this paper, both tasks are studied and solutions are provided. Simulation results show that the improved power allocation can provide much better average mean squared error (MSE) performance than equal power allocation, especially at low channel signal-to-noise ratio.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126302065","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":"Buffer-aided relaying with discrete transmission rates","authors":"Wayan Wicke, N. Zlatanov, V. Jamali, R. Schober","doi":"10.1109/CWIT.2015.7255182","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255182","url":null,"abstract":"We consider a slow fading three-node network consisting of a source, a half-duplex decode-and-forward relay, and a destination, where a direct link between the source and the destination does not exist. We assume that the half-duplex relay is equipped with a buffer and employs in each time slot adaptive scheduling of reception and transmission based on the instantaneous qualities of the source-to-relay and relay-to-destination links. Furthermore, as a practical constraint, we assume that in each time slot, the source and the relay can select transmission rates only from a discrete and finite set of available transmission rates. For this network, we design the optimal scheduling of reception and transmission at the relay and the optimal selection of the transmission rates at the source and the relay such that the throughput is maximized. Our numerical results show that the maximum throughput achieved with the proposed buffer-aided protocol for discrete transmission rates is significantly larger than the throughput achieved with conventional relaying protocols with continuous transmission rates.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131711216","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 maximal correlation, mutual information and data privacy","authors":"S. Asoodeh, F. Alajaji, T. Linder","doi":"10.1109/CWIT.2015.7255145","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255145","url":null,"abstract":"The rate-privacy function is defined in [1] as a tradeoff between privacy and utility in a distributed private data system in which both privacy and utility are measured using mutual information. Here, we use maximal correlation in lieu of mutual information in the privacy constraint. We first obtain some general properties and bounds for maximal correlation and then modify the rate-privacy function to account for the privacy-constrained estimation problem. We find a bound for the utility in this problem when the maximal correlation privacy is set to some threshold ϵ > 0 and construct an explicit privacy scheme which achieves this bound.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116643416","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":"Overlapped fountain coding for delay-constrained priority-based broadcast applications","authors":"Khaled F. Hayajneh, S. Yousefi","doi":"10.1109/CWIT.2015.7255157","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255157","url":null,"abstract":"In this paper, we propose a new rateless code based on overlapped generations. This proposed scheme works very well especially in a broadcast scenario, where channels with different characteristics are involved in the system. In the proposed scheme, we allow the adjacent generations to overlap. Our main focus is on the design of rateless codes to make any receiver able to recover all the source file with reduction in the overhead and the delay time. Indeed, we show that for several channels characteristics, our proposed scheme outperforms the regular rateless codes such as Luby transform (LT) code. The good advantage of our proposed scheme that it can be used with any kind of degree distributions in the literature and the same improvements are guaranteed.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122143736","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":"Approximate secrecy capacity region of an asymmetric MAC wiretap channel within 1/2 bits","authors":"Sanjay Karmakar, Anirban Ghosh","doi":"10.1109/CWIT.2015.7255159","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255159","url":null,"abstract":"We consider a 2-user Gaussian Multiple-Access Wiretap channel (GMAC-WT), with the Eavesdropper (E) having access to signal from only one (say, T2) of the two transmitters. We characterize the capacity region of this channel approximately within. 5 bits, where the approximation is in terms of only T1's rate or the sum-rate depending on the relative strength of the eavesdropper's channel. However, the approximation is. 5 bits independent of channel coefficients or operating Signal-to-Noise Ratios (SNR). To prove this approximate result we propose two different coding schemes, namely, the power adaptation and the time sharing coding schemes and derive their corresponding achievable rate regions. Both of them use Gaussian input distribution. To establish the approximate capacity, we first derive supersets to the capacity region and then show that corresponding to each rate pair at the boundary of these supersets there exists an achievable rate pair in one of the aforementioned achievable rate regions which are within 1/2 bits to the former pair. In comparison to a very recent result (Xie and Ulukus, ISIT 2013) on a GMAC-WT showing the requirement of interference alignment (IA) to achieve even the degrees of freedom performance, the result of this paper is surprising: our channel model is an interesting variation of the GMAC-WT for which IA is not necessary and Gaussian signalling is sufficient to achieve the entire capacity region within. 5 bits.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128059596","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":"Signal detection for ambient backscatter system with multiple receiving antennas","authors":"Zhe Ma, Tengchan Zeng, Gongpu Wang, F. Gao","doi":"10.1109/CWIT.2015.7255150","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255150","url":null,"abstract":"“Ambient backscatter” is a new communication technology that utilizes ambient radio frequency signals to enable battery-free devices to communicate with each other. In this paper, we formulate a new transmission model when the reader is equipped with multiple antennas and propose a new way for signal detection when the channel state information is unknown. We derive an approximate closed-form detection threshold to identify the transmitted symbols and also analyze the corresponding bit error rate (BER) performance. It is found that increasing number of receiving antennas will lead to lower BER, while there exists an error floor when the antenna number is above certain level. Finally, simulation results are provided to corroborate our theoretical studies.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124526885","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":"Database query privacy using homomorphic encryptions","authors":"Sudharaka Palamakumbura, Hamid Usefi","doi":"10.1109/CWIT.2015.7255155","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255155","url":null,"abstract":"Homomorphic encryption is a novel encryption method for it enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing it's content. In this paper we summarize how SQL queries can be made secure using a homomorphic encryption scheme based on the ideas of Gahi, et al [1]. Gahi's model is based on the DGHV scheme which is a homomorphic encryption scheme which acts on plaintext bits and produce corresponding ciphertext. We use Gahi's blueprint to propose an improved model which is based on the more recent Ring based homomorphic encryption scheme by Braserski, et al [2]. Our method is more general in the sense that it can be extended to use with any fully homomorphic encryption scheme rather than being restricted to the DGHV scheme as in Gahi's method.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123710090","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 a generalised typicality with respect to general probability distributions","authors":"Wuling Liu, Xiaoli Chu, Jie Zhang","doi":"10.1109/CWIT.2015.7255177","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255177","url":null,"abstract":"The method of typical sequences is a fundamental tool in asymptotic analyses of information theory. The conditional typicality lemma is one of the most commonly used lemmas in the method of typical sequences. Recent works have generalised the definition of typicality to general alphabets or general probability distributions. However, there is still a lack of the conditional typicality lemma based on the definition of typicality with respect to general distributions on the product space. In this paper, we propose a generalised joint typicality for general alphabets and with respect to general probability distributions, and obtain the counterpart of conventional conditional and joint typicality lemmas based on the generalised typicality. As applications of the typicality lemmas, we prove the packing and coverings for the proposed generalised typicality, and then recover the direct part of the capacity theorem on the general Gelfand-Pinsker coding. We also prove a mutual covering lemma for the generalised typicality, and then obtain the Marton-type inner bound to the capacity region of the general broadcast channel.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121925036","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}