Azary Abboud, Ejder Bastug, Kenza Hamidouche, M. Debbah
{"title":"Distributed caching in 5G networks: An Alternating Direction Method of Multipliers approach","authors":"Azary Abboud, Ejder Bastug, Kenza Hamidouche, M. Debbah","doi":"10.1109/SPAWC.2015.7227022","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227022","url":null,"abstract":"We consider the problem of distributed caching in next generation mobile cellular networks (a.k.a., 5G) where densely-deployed small base stations (SBSs) are able to store and deliver users' content accordingly. In particular, we formulate the optimal cache allocation policy as a convex optimization problem where a subset of SBSs have their own i) local cost function which captures backhaul consumption aspects in terms of bandwidth and ii) a set of local network parameters and storage constraints. Given the fact that no coordination involves between SBSs, we then solve this problem distributively using the Alternating Direction Method of Multipliers (ADMM) approach. The proposed ADMM-based algorithm relies on the application of random Gauss-Seidel iterations on the Douglas-Rachford splitting operator, which results in a low-complexity and easy-to-implement solution for SBSs. We examine the convergence of our proposed algorithm via numerical simulations with different parameters of interest such as storage capacity distribution of SBSs, content catalogue size, demand intensity and demand shape. Our numerical results show that the proposed algorithm performs well in terms of convergence and requires less iterations as the number of contents in the catalogue increases.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651136","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":"Modulation and coding schemes selection for type-II HARQ in time-correlated fading channels","authors":"N. Ksairi, P. Ciblat","doi":"10.1109/SPAWC.2015.7227006","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227006","url":null,"abstract":"Assuming the use of Hybrid ARQ, we propose to find out the best modulation and coding scheme at each retransmission round when partially outdated channel state information is available at the transmitter. Our analysis and proposed algorithm are based on Markov decision processes.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116108905","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}
Christopher Boyd, Renaud-Alexandre Pitaval, O. Tirkkonen, R. Wichman
{"title":"On the time-frequency localisation of 5G candidate waveforms","authors":"Christopher Boyd, Renaud-Alexandre Pitaval, O. Tirkkonen, R. Wichman","doi":"10.1109/SPAWC.2015.7227008","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227008","url":null,"abstract":"Among the requirements of the 5th generation (5G) radio access technology (RAT) is that the associated waveform be well-localised in time and frequency. Localisation characteristics of waveforms are important when considering multiplexing and duplexing of transmissions. This paper proposes a measure of time-frequency localisation (TFL) for sets of orthogonal waveforms, based on Heisenberg's well-known Uncertainty Principle, allowing for the containment of OFDM and FBMC multicarrier signals over the entire bandwidth to be determined. A theoretical bound on TFL for sets of orthogonal waveforms sharper than the general uncertainty principle is provided. Several multicarrier waveforms generated using well-defined filters are shown by simulation to approach the derived bound as the number of subcarriers increases.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061943","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":"Make-it-real-and-anticirculating orthogonal space-time coding for MIMO OFDM/OQAM","authors":"D. P. Huy, P. Siohan, M. Hélard","doi":"10.1109/SPAWC.2015.7227000","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227000","url":null,"abstract":"We propose an orthogonal and full rate MIMO space-time coding technique for OFDM/OQAM, called `make-it-real-and-anticirculating' (MIRAAC), to perform energy efficient wireless data transmission. The equivalent MIMO channel (after space-time coding, propagation and decoding) is made real and anticirculating, so that the receiver can suppress all interference very simply: just by extracting the real part of the received signal. Our simulations show that large antenna arrays (like those being studied for the future 5th generation networks) save a great amount of energy.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125453979","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":"Network coding schemes for Device-to-Device communications based relaying for cellular coverage extension","authors":"A. Abrardo, Gábor Fodor, Besmir Tola","doi":"10.1109/SPAWC.2015.7227122","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227122","url":null,"abstract":"In this paper, we study the performance of device-to-device (D2D) based range extension in terms of sum rate and power efficiency when a relaying user equipment (UE) helps to improve the coverage for cell-edge UEs. In our design, the relaying UE has own traffic to transmit and receive to/from the cellular base station (BS) and can operate either in amplify-and-forward (AF) or decode-and-forward (DF) modes and can make use of either digital or analogue (PHY layer) network coding. In this rather general setting, we propose mode selection, resource allocation and power control schemes and study their performance by means of system simulations. We find that the performance of the DF scheme with network coding is superior both to the traditional cellular and the AF based relaying schemes, including AF with two-slot or three-slot PHY layer network coding.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128446663","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}
Yasser Fadlallah, A. Aïssa-El-Bey, K. Amis, Dominique Pastor
{"title":"Low-complexity detector for very large and massive MIMO transmission","authors":"Yasser Fadlallah, A. Aïssa-El-Bey, K. Amis, Dominique Pastor","doi":"10.1109/SPAWC.2015.7227038","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227038","url":null,"abstract":"Maximum-Likelihood (ML) joint detection has been proposed as an optimal strategy that detects simultaneously the transmitted signals. In very large multiple-input-multiple output (MIMO) systems, the ML detector becomes intractable due the computational cost that increases exponentially with the antenna dimensions. In this paper, we propose a relaxed ML detector based on an iterative decoding strategy that reduces the computational cost. We exploit the fact that the transmit constellation is discrete, and remodel the channel as a MIMO channel with sparse input belonging to the binary set {0, 1}. The sparsity property allows us to relax the ML problem as a quadratic minimization under linear and ℓ1-norm constraint. We then prove the equivalence of the relaxed problem to a convex optimization problem solvable in polynomial time. Simulation results illustrate the efficiency of the low-complexity proposed detector compared to other existing ones in very large and massive MIMO context.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129449981","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":"Separability of parallel Gaussian MIMO broadcast channels with shaping constraints","authors":"C. Hellings, W. Utschick","doi":"10.1109/SPAWC.2015.7227013","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227013","url":null,"abstract":"It is well known that separate coding on each carrier is capacity-achieving in parallel Gaussian multiple-input multiple-output (MIMO) broadcast channels in the sense that the sum rate capacity under a sum power constraint is achievable with separate coding if the noise is independent on each carrier. In this paper, we generalize this statement by proving that the optimality of separate coding also holds under per-carrier shaping constraints, i.e., a sum covariance constraint on each carrier instead of a sum power constraint. Moreover, we show that not only the sum rate optimal point, but the whole capacity region can be achieved with separate coding. Finally, we prove that the worst-case noise in a MIMO broadcast channel with shaping constraints is independent across carriers.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122123829","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":"Joint spectrum sensing and direction of arrival recovery from sub-Nyquist samples","authors":"S. Stein, Or Yair, Deborah Cohen, Yonina C. Eldar","doi":"10.1109/SPAWC.2015.7227054","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227054","url":null,"abstract":"Joint spectrum sensing and direction of arrival (DOA) estimation is often necessary in communication applications, such as Cognitive Radio (CR). In this paper, we consider joint DOA and carrier frequency recovery of several transmissions as well as signal reconstruction from sub-Nyquist samples to overcome the sampling rate bottleneck of the wideband signals a CR typically deals with. We present two joint DOA and carrier frequency recovery approaches. The first is based on compressed sensing (CS) techniques and the second adapts a 2D-DOA recovery algorithm previously proposed in the Nyquist regime, the Parallel Factor (PARAFAC) analysis algorithm, to our sub-Nyquist samples. This technique allows us to solve the well known pairing issue between the DOA and carrier frequency to be recovered for each transmission. Once these are recovered, we show how the signal itself can be reconstructed from the samples. We also provide sufficient conditions for perfect blind signal recovery in terms of the sampling rate and the number of array elements.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122849502","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":"Optimal and suboptimal routing based on partial CSI in wireless ad-hoc networks","authors":"Yiftach Richter, I. Bergel","doi":"10.1109/SPAWC.2015.7227026","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227026","url":null,"abstract":"In this paper, we analyze and optimize the performance of distributed routing schemes in multihop wireless ad-hoc networks. We assume that the nodes are distributed according to a Poisson-Point-Process (PPP) and consider routing schemes that select the next relay based on geographical locations and local knowledge of the channel state (CSI). At the first stage we define the optimization problem and give an expression for the optimal routing metric in a network that achieves the ergodic rate density (ERD) in each link. We then use a recently published bound on the ERD, and present a low complexity, suboptimal routing metric. Numerical results demonstrate that the low complexity scheme performs nearly as good as the optimal scheme.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"963 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123070094","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":"Biometrics in claim-based authentication framework","authors":"T. Ignatenko","doi":"10.1109/SPAWC.2015.7227065","DOIUrl":"https://doi.org/10.1109/SPAWC.2015.7227065","url":null,"abstract":"Nowadays biometric authentication and identification becomes a part of every-day life. As a result, many services emerge that rely on biometric-based access control. However, from a user point of view, supplying biometric information to many different service providers imposes high privacy and security risks. In this paper we focus on the use of biometrics in a claimed-based authentication framework. The frameworks allows for a limited number of identity providers, thus overcoming the need to supply biometric data to multiple untrustworthy service provides. We argue that in this case we can deploy the information-theoretic framework for privacy-preserving biometric systems for joint authentication and identification studied in Willems and Ignatenko [2010].","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340889","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}