Change search
Link to record
Permanent link

Direct link
BETA
Alternative names
Publications (10 of 427) Show all publications
Ghauch, H., Imtiaz, S., Skoglund, M., Koudouridis, G. & Gross, J. (2018). Fairness and user assignment in cloud-RAN. In: IEEE Vehicular Technology Conference: . Paper presented at 86th IEEE Vehicular Technology Conference, VTC Fall 2017, 24 September 2017 through 27 September 2017 (pp. 1-5). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Fairness and user assignment in cloud-RAN
Show others...
2018 (English)In: IEEE Vehicular Technology Conference, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 1-5Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we extend our previous work on user assignment in Cloud-RAN, where we proposed an algorithm for user assignment (UA). We motivate the inherent fairness issue that is present in the latter UA scheme, since some users in the system will never get served. To improve the fairness, we propose that the UA scheme is preceded by a user scheduling step which aims at selecting at any time the users that should be considered by the UA algorithm for scheduling (in the next time slot). Two user scheduling approaches have been studied. The first scheme improves the minimum throughput (MT), by selecting at any time the users with the lowest throughput. The second scheme is based on round-robin (RR) scheduling, where the set of potentially scheduled users for the next slot, is done by excluding all the previously served users, in that round. Moreover, the subset of actual users to be served, is determined using the UA algorithm. We evaluate their fairness and sumrate performance, via extensive simulations. While one might have expected a tradeoff between the sum-rate performance and fairness, our results show that MT improves both metrics, when compared to the original UA algorithm (without fairness), for some choice of parameter values. This implies that both fairness and aggregate system performance can be improved, by a careful choice of the number of assigned and served users.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2018
Keywords
Cloud radio access networks, Fairness scheduling, User assignment, Communication channels (information theory), Routers, Scheduling, Choice of parameters, Extensive simulations, Round Robin, Time slots, User scheduling, Scheduling algorithms
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-227440 (URN)10.1109/VTCFall.2017.8288047 (DOI)2-s2.0-85045234015 (Scopus ID)9781509059355 (ISBN)
Conference
86th IEEE Vehicular Technology Conference, VTC Fall 2017, 24 September 2017 through 27 September 2017
Note

Conference code: 134637; Export Date: 9 May 2018; Conference Paper; CODEN: IVTCD. QC 20180528

Available from: 2018-05-28 Created: 2018-05-28 Last updated: 2018-05-28Bibliographically approved
Bassi, G., Skoglund, M. & Piantanida, P. (2018). Lossy Communication Subject to Statistical Parameter Privacy. In: 2018 IEEE International Symposium on Information Theory (ISIT) - Proceedings: . Paper presented at 2018 IEEE International Symposium on Information Theory (ISIT) (pp. 1031-1035). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8437690.
Open this publication in new window or tab >>Lossy Communication Subject to Statistical Parameter Privacy
2018 (English)In: 2018 IEEE International Symposium on Information Theory (ISIT) - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 1031-1035, article id 8437690Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the problem of sharing (communi-cating) the outcomes of a memoryless source when some of its statistical parameters must be kept private. Privacy is measured in terms of the Bayesian statistical risk according to a desired loss function while the quality of the reconstruction is measured by the average per-letter distortion. We first bound -uniformly over all possible estimators- the expected risk from below. This information-theoretic bound depends on the mutual information between the parameters and the disclosed (noisy) samples. We then present an achievable scheme that guarantees an upper bound on the average distortion while keeping the risk above a desired threshold, even when the length of the sample increases.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
National Category
Signal Processing
Identifiers
urn:nbn:se:kth:diva-234483 (URN)10.1109/ISIT.2018.8437690 (DOI)2-s2.0-85052431255 (Scopus ID)9781538647806 (ISBN)
Conference
2018 IEEE International Symposium on Information Theory (ISIT)
Note

QC 20180907

Available from: 2018-09-07 Created: 2018-09-07 Last updated: 2018-10-08Bibliographically approved
Cao, P., Oechtering, T. J. & Skoglund, M. (2018). Precoding Design for Massive MIMO Systems with Sub-connected Architecture and Per-antenna Power Constraints. In: : . Paper presented at The 22nd International ITG Workshop on Smart Antennas.
Open this publication in new window or tab >>Precoding Design for Massive MIMO Systems with Sub-connected Architecture and Per-antenna Power Constraints
2018 (English)Conference paper, Published paper (Refereed)
Abstract [en]

This paper provides the necessary conditions to design precoding matrices for massive MIMO systems with a sub-connected architecture, RF power constraints and per-antenna power constraints. The system is configured such that each RFchain serves a group of antennas. The necessary condition to design the digital precoder is established based on a generalized water-filling and joint sum and per-antenna optimal power allocation solution, while the analog precoder is based on a per-antenna power allocation solution only. We study the analytically most interesting case where the power constraint on the RF chain is smaller than the sum of the corresponding per-antenna power constraints. For this, the optimal power is allocated based on two properties: Each RF chain uses full power and if the optimal power allocation of the unconstraint problem violates a per-antenna power constraint then it is optimal to allocate the maximal power for that antenna.

National Category
Engineering and Technology
Identifiers
urn:nbn:se:kth:diva-225420 (URN)
Conference
The 22nd International ITG Workshop on Smart Antennas
Note

QCR 20180411

Available from: 2018-04-04 Created: 2018-04-04 Last updated: 2018-04-11Bibliographically approved
Nekouei, E., Skoglund, M. & Johansson, K. H. (2018). Privacy of Information Sharing Schemes in a Cloud-based Multi-sensor Estimation Problem. In: 2018 Annual American Control Conference (ACC): . Paper presented at 2018 Annual American Control Conference, ACC 2018, Wisconsin Center / Hilton ,Milwauke City Center Milwauke, United States, 27 June 2018 through 29 June 2018 (pp. 998-1002). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8431192.
Open this publication in new window or tab >>Privacy of Information Sharing Schemes in a Cloud-based Multi-sensor Estimation Problem
2018 (English)In: 2018 Annual American Control Conference (ACC), Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 998-1002, article id 8431192Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we consider a multi-sensor estimation problem wherein each sensor collects noisy information about its local process, which is only observed by that sensor, and a common process, which is simultaneously observed by all sensors. The objective is to assess the privacy level of (the local process of) each sensor while the common process is estimated using cloud computing technology. The privacy level of a sensor is defined as the conditional entropy of its local process given the shared information with the cloud. Two information sharing schemes are considered: a local scheme, and a global scheme. Under the local scheme, each sensor estimates the common process based on its measurement and transmits its estimate to a cloud. Under the global scheme, the cloud receives the sum of the sensors' measurements. It is shown that, in the local scheme, the privacy level of each sensor is always above a certain level which is characterized using Shannon's mutual information. It is also proved that this result becomes tight as the number of sensors increases. We also show that the global scheme is asymptotically private, i.e., the privacy loss of the global scheme decreases to zero at the rate of O(1/M) where M is the number of sensors.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Series
Proceedings of the American Control Conference, ISSN 0743-1619
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-234705 (URN)10.23919/ACC.2018.8431192 (DOI)2-s2.0-85052564006 (Scopus ID)9781538654286 (ISBN)
Conference
2018 Annual American Control Conference, ACC 2018, Wisconsin Center / Hilton ,Milwauke City Center Milwauke, United States, 27 June 2018 through 29 June 2018
Note

QC 20180910

Available from: 2018-09-10 Created: 2018-09-10 Last updated: 2018-09-10Bibliographically approved
Wang, Q. & Skoglund, M. (2018). Secure Private Information Retrieval from Colluding Databases with Eavesdroppers. In: 2018 IEEE International Symposium on Information Theory (ISIT): . Paper presented at 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17 June 2018 through 22 June 2018 (pp. 2456-2460). Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>Secure Private Information Retrieval from Colluding Databases with Eavesdroppers
2018 (English)In: 2018 IEEE International Symposium on Information Theory (ISIT), Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 2456-2460Conference paper, Published paper (Refereed)
Abstract [en]

The problem of private information retrieval (PIR) is to retrieve one message out of K messages replicated at N databases, without revealing the identity of the desired message to the databases. We consider the problem of PIR with colluding databases and eavesdroppers, named ETPIR. Specifically, any T out of N databases may collude, that is, they may communicate their interactions with the user to guess the identity of the requested message. An eavesdropper is curious to know the content of the messages and can tap in on the incoming and outgoing transmissions of any E databases with the user. The databases share some common randomness unknown to the eavesdropper and the user, and use the common randomness to generate the answers, such that the eavesdropper can learn no information about the K messages. The capacity is defined as the maximum retrieval rate, i.e. the number of information bits of the desired message retrieved per downloaded bit. In our previous work [1], we found that when Egeq T, the capacity equals 1-frac E N. In this work, we focus on the case when Eleq T. We find an outer bound (converse bound) and an inner bound (achievability) on the optimal achievable rate. The gap between the derived inner and outer bounds vanishes as the number of messages K tends to infinity.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
National Category
Communication Systems
Identifiers
urn:nbn:se:kth:diva-234699 (URN)10.1109/ISIT.2018.8437848 (DOI)2-s2.0-85052432049 (Scopus ID)9781538647806 (ISBN)
Conference
2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17 June 2018 through 22 June 2018
Note

QC 20180910

Available from: 2018-09-10 Created: 2018-09-10 Last updated: 2018-09-10Bibliographically approved
Vu, M. T., Oechtering, T. J., Skoglund, M. & Boche, H. (2018). Uncertainty in Identification Systems. In: IEEE International Symposium on Information Theory - Proceedings: . Paper presented at 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17 June 2018 through 22 June 2018 (pp. 2386-2390). Institute of Electrical and Electronics Engineers (IEEE), Article ID 8437760.
Open this publication in new window or tab >>Uncertainty in Identification Systems
2018 (English)In: IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 2386-2390, article id 8437760Conference paper, Published paper (Refereed)
Abstract [en]

We study the high-dimensional identification systems under the presence of statistical uncertainties. The task is to design mappings for enrollment and identification purposes. The identification mapping compresses users' information then stores the index in the corresponding position in a database. The identification mapping combines the information in the database and the observation which originates randomly from an enrolled user to produce an estimate of the underlying user index. We study two scenarios. Users' data are generated from the same unknown distribution while the observation channel is also subjected to uncertainty. Each user's data are generated iid from the distribution corresponding to its own state, while the observation channel is known. We provide an achievable compression-identification trade-off for the first and second settings considering both discrete and continuous cases. In the discrete scenario, the described regions are also the correspondingly complete characterizations.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
National Category
Signal Processing
Identifiers
urn:nbn:se:kth:diva-234484 (URN)10.1109/ISIT.2018.8437760 (DOI)2-s2.0-85052442070 (Scopus ID)9781538647806 (ISBN)
Conference
2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17 June 2018 through 22 June 2018
Note

QC 20180907

Available from: 2018-09-07 Created: 2018-09-07 Last updated: 2018-09-07Bibliographically approved
Do, H. T., Oechtering, T. J., Skoglund, M. & Vu, M. (2017). Interfering Relay Channels. Entropy, 19(9), Article ID 441.
Open this publication in new window or tab >>Interfering Relay Channels
2017 (English)In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 19, no 9, article id 441Article in journal (Refereed) Published
Abstract [en]

This paper introduces and studies a model in which two relay channels interfere with each other. Motivated by practical scenarios in heterogeneous wireless access networks, each relay is assumed to be connected to its intended receiver through a digital link with finite capacity. Inner and outer bounds for achievable rates are derived and shown to be tight for new discrete memoryless classes, which generalize and unify several known cases involving interference and relay channels. Capacity region and sum capacity for multiple Gaussian scenarios are also characterized to within a constant gap. The results show the optimality or near-optimality of the quantize-bin-and-forward coding scheme for practically relevant relay-interference networks, which brings important engineering insight into the design of wireless communications systems.

Place, publisher, year, edition, pages
MDPI AG, 2017
Keywords
interference channel, relay channel, interference channel with two relays, interference relay channel, deterministic relay channel, quantize-forward, quantize-bin-and-forward, hash-forward, interference management
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-215829 (URN)10.3390/e19090441 (DOI)000411527100013 ()2-s2.0-85029153177 (Scopus ID)
Note

QC 20171017

Available from: 2017-10-17 Created: 2017-10-17 Last updated: 2017-11-29Bibliographically approved
Do, T. T., Ngo, H. Q., Duong, T. Q., Oechtering, T. & Skoglund, M. (2017). Massive MIMO Pilot Retransmission Strategies for Robustification Against Jamming. IEEE Wireless Communications Letters, 6(1), 58-61
Open this publication in new window or tab >>Massive MIMO Pilot Retransmission Strategies for Robustification Against Jamming
Show others...
2017 (English)In: IEEE Wireless Communications Letters, ISSN 2162-2337, E-ISSN 2162-2345, Vol. 6, no 1, p. 58-61Article in journal (Refereed) Published
Abstract [en]

This letter proposes anti-jamming strategies based on pilot retransmission for a single user uplink massive MIMO under jamming attack. A jammer is assumed to attack the system both in the training and data transmission phases. We first derive an achievable rate which enables us to analyze the effect of jamming attacks on the system performance. Counter-attack strategies are then proposed to mitigate this effect under two different scenarios: random and deterministic jamming attacks. Numerical results illustrate our analysis and benefit of the proposed schemes.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2017
Keywords
Massive MIMO, jamming, pilot retransmission
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-205139 (URN)10.1109/LWC.2016.2631163 (DOI)000395868700015 ()2-s2.0-85013651383 (Scopus ID)
Note

QC 20170412

Available from: 2017-04-12 Created: 2017-04-12 Last updated: 2017-11-29Bibliographically approved
Huang, S. & Skoglund, M. (2017). On linear coding over finite rings and applications to computing. Entropy, 19(5), Article ID 233.
Open this publication in new window or tab >>On linear coding over finite rings and applications to computing
2017 (English)In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 19, no 5, article id 233Article in journal (Refereed) Published
Abstract [en]

This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian-Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37-46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585-592) for linear coding over finite fields as special cases. In addition, it is shown that, for any set of finite correlated discrete memoryless sources, there always exists a sequence of linear encoders over some finite non-field rings which achieves the data compression limit, the Slepian-Wolf region. Hence, the optimality problem regarding linear coding over finite non-field rings for data compression is closed with positive confirmation with respect to existence. For application, we address the problem of source coding for computing, where the decoder is interested in recovering a discrete function of the data generated and independently encoded by several correlated i.i.d. random sources. We propose linear coding over finite rings as an alternative solution to this problem. Results in Körner-Marton (IEEE Trans. Inf. Theory 1979, 25, 219-221) and Ahlswede-Han (IEEE Trans. Inf. Theory 1983, 29, 396-411, Theorem 10) are generalized to cases for encoding (pseudo) nomographic functions (over rings). Since a discrete function with a finite domain always admits a nomographic presentation, we conclude that both generalizations universally apply for encoding all discrete functions of finite domains. Based on these, we demonstrate that linear coding over finite rings strictly outperforms its field counterpart in terms of achieving better coding rates and reducing the required alphabet sizes of the encoders for encoding infinitely many discrete functions.

Place, publisher, year, edition, pages
MDPI AG, 2017
Keywords
Field, Linear coding, Ring, Source coding, Source coding for computing
National Category
Physical Sciences
Identifiers
urn:nbn:se:kth:diva-216497 (URN)10.3390/e19050233 (DOI)000404453700050 ()2-s2.0-85024833883 (Scopus ID)
Note

QC 20171201

Available from: 2017-12-01 Created: 2017-12-01 Last updated: 2017-12-01Bibliographically approved
Tanaka, T., Skoglund, M. & Ugrinovskii, V. (2017). Optimal Sensor Design and Zero-Delay Source Coding for Continuous-Time Vector Gauss-Markov Processes. In: 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC): . Paper presented at IEEE 56th Annual Conference on Decision and Control (CDC), DEC 12-15, 2017, Melbourne, AUSTRALIA. IEEE
Open this publication in new window or tab >>Optimal Sensor Design and Zero-Delay Source Coding for Continuous-Time Vector Gauss-Markov Processes
2017 (English)In: 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), IEEE , 2017Conference paper, Published paper (Refereed)
Abstract [en]

We consider the situation in which a continuoustime vector Gauss-Markov process is observed through a vector Gaussian channel (sensor) and estimated by the Kalman-Bucy filter. Unlike in standard filtering problems where a sensor model is given a priori, we are concerned with the optimal sensor design by which (i) the mutual information between the source random process and the reproduction (estimation) process is minimized, and (ii) the minimum mean-square estimation error meets a given distortion constraint. We show that such a sensor design problem is tractable by semidefinite programming. The connection to zero-delay source-coding is also discussed.

Place, publisher, year, edition, pages
IEEE, 2017
Series
IEEE Conference on Decision and Control, ISSN 0743-1546
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-223871 (URN)000424696903137 ()978-1-5090-2873-3 (ISBN)
Conference
IEEE 56th Annual Conference on Decision and Control (CDC), DEC 12-15, 2017, Melbourne, AUSTRALIA
Note

QC 20180305

Available from: 2018-03-05 Created: 2018-03-05 Last updated: 2018-03-05Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-7926-5081

Search in DiVA

Show all publications