Skip to main content

LIMITES FUNDAMENTALES DE REDES MOVILES MASIVAS

TEC2015-66228-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2015
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSITAT POMPEU FABRA CCT

Resultados relacionados

Resultados totales (Incluyendo duplicados): 12
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

A novel approach for spectral efficiency analysis in MIMO cellular networks

  • George, Geordie
  • Mungara, Ratheesh K.
  • Lozano Solsona, Angel
  • Haenggi, Martin
Comunicació presentada a la 2017 IEEE International Conference on Communications (ICC), celebrada els dies 21 a 25 de maig de 2017 a París, França., The application of stochastic geometry to the analysis of wireless networks is shown to be propelled by (i) a clean separation of time scales, (ii) abstraction of small-scale effects via ergodicity, and (iii) an interference model reflecting the receiver's lack of knowledge of how individual interference terms are faded. These steps render the analysis simpler and more precise, and more amenable to incorporating subsequent features. Specifically, the paper presents easy-to-evaluate expressions for the ergodic spectral efficiency of cellular networks with single-user multiple-input multiple-output (MIMO)., This work was supported by Project TEC2015-66228-P (MINECO/FEDER, UE) and by the U.S. NSF through award CCF 1525904.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

CONNECT: CONtextual NamE disCovery for blockchain-based services in the IoT

  • Daza, Vanesa
  • Di Pietro, Roberto
  • Klimek, Ivan
  • Signorini, Matteo
Comunicació presentada a la 2017 IEEE International Conference on Communications (ICC), celebrada els dies 21 a 25 de maig de 2017 a Paris, França., The Internet of Things is gaining momentum thanks to the provided vision of seamlessly interconnected devices. However, a unified way to discover and to interact with the surrounding smart environment is missing. As an outcome, we have been assisting to the development of heterogeneous ecosystems, where each service provider adopts its own protocol- thus preventing IoT devices from interacting when belonging to different providers. And, the same is happening again for the blockchain technology which provides a robust and trusted way to accomplish tasks -unfortunately not providing interoperability thus creating the same heterogeneous ecosystems above highlighted. In this context, the fundamental research question we address is how do we find things or services in the Internet of Things. In this paper, we propose the first IoT discovery approach which provides an answer to the above question by exploiting hierarchical and universal multi-layered blockchains. Our approach does neither define new standards nor force service providers to change their own protocol. On the contrary, it leverages the existing and publicly available information obtained from each single blockchain to have a better knowledge of the surrounding environment. The proposed approach is detailed and discussed with the support of relevant use cases., This work is partly supported by the Spanish Ministry of Economy and Competitiveness under the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502) and Project TEC2015-66228-P (MINECO/FEDER,UE).
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Designing fully secure protocols for secure two-party computation of constant-domain functions

  • Daza, Vanesa
  • Makriyannis, Nikolaos
Comunicació presentada a la TCC 2017 Theory of Cryptography. Lecture Notes in Computer Science, celebrada a Baltimore (Estats Units d'Amèrica) del 12 al 15 de novembre de 2017., In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossible, in general. Surprisingly, Gordon et al. (JACM 2011) showed that there exist interesting functions that are computable with fairness. The two results give rise to a distinction between fair functions and unfair ones. The question of characterizing these functions has been studied in a sequence of works leading to the complete characterization of (symmetric) Boolean functions by Asharov et al. (TCC 2015). In this paper, we design new fully secure protocols for functions that were previously unknown to be fair. To this end, our main technical contribution is a generic construction of a fully secure (fair) protocol, starting with a constant-round protocol satisfying limited security requirements. Our construction introduces new conceptual tools for the analysis of fairness that apply to arbitrary (constant-domain) functions. While the characterization remains open, we believe that our results lay the foundation for a deeper understanding of fairness., V. Daza—Research supported by Project TEC2015-66228-P (MINECO/FEDER, UE). N. Makriyannis—Research supported by ERC starting grant 638121.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Random vs structured pilot assignment in cell-free massive MIMO wireless networks

  • Attarifar, Masoud
  • Abbasfar, Aliazam
  • Lozano Solsona, Angel
This paper addresses the performance improvement that structured pilot assignment policies can bring about, relative to a random pilot assignment, in cell-free massive MIMO wireless networks. It is shown that structured policies can deliver a multiple-fold reduction in the pilot overhead required to keep pilot contamination at some acceptably low level. While the implementation of the structured policies considered in the paper might require some degree of centralized control, their performance also captures what distributed nonrandom pilot assignment schemes (e.g., greedy or collision-detecting algorithms) can hope to approach., The work of A. Lozano was supported by Project TEC2015-66228-P (MINECO/FEDER, UE) and by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974.
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Dual-kernel online reconstruction of power maps

  • Nikbakht Silab, Rasoul
  • Jonsson, Anders, 1973-
  • Lozano Solsona, Angel
We present a measurement-driven algorithm to map the large-scale channel losses observed between a cellular base station and any point in its coverage area. The algorithm is on-line, meaning that it operates on continuously arriving measurements. Its distinguishing features are the use of two kernel functions, suitably chosen for the problem at hand, and a simple technique to sparsify the dictionary of measurements retained in memory. Evaluations in campus and urban settings indicate that the proposed algorithm reduces, roughly in half, the prediction error of existing single-kernel and multikernel algorithms., Work supported by the Spanish Ministry of Economy and Competitiveness under the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502), TEC2015-66228-P, and the European Research Council (grant agreement 694974).
Repositorio Digital de la UPF
Publication Contribución de congreso (ConferenceOutput)

Analytical handle for ZF reception in distributed massive MIMO

  • Senanayake, Rajitha
  • Lozano Solsona, Angel
  • Smith, Peter
  • Evans, Jamie
Comunicació presentada a la 50th Asilomar Conference on Signals, Systems and Computers, celebrada els dies 6 a 9 de novembre de 2016 a Pacific Grove, Califòrnia., This paper considers distributed massive MIMO networks where a large number of antennas, either collocated or geographically scattered over a region, communicate with mobile users. This communication is impaired by interference from similar transmissions in adjacent regions and by noise. Focusing on zero-forcing (ZF) reception, we derive simple expressions that very accurately approximate the instantaneous signal-to-interference-plus-noise ratio (SINR) and the ergodic spectral efficiency of an arbitrary user. These expressions enable short-cutting any assessment of the network-level performance, either analytical or simulation-based., Work supported by Project TEC2015-66228-P (MINECO/FEDER, UE).
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

CONNECT: CONtextual NamE disCovery for blockchain-based services in the IoT

  • Daza, Vanesa
  • Di Pietro, Roberto
  • Klimek, Ivan
  • Signorini, Matteo
Comunicació presentada a la 2017 IEEE International Conference on Communications (ICC), celebrada els dies 21 a 25 de maig de 2017 a Paris, França., The Internet of Things is gaining momentum thanks to the provided vision of seamlessly interconnected devices. However, a unified way to discover and to interact with the surrounding smart environment is missing. As an outcome, we have been assisting to the development of heterogeneous ecosystems, where each service provider adopts its own protocol- thus preventing IoT devices from interacting when belonging to different providers. And, the same is happening again for the blockchain technology which provides a robust and trusted way to accomplish tasks -unfortunately not providing interoperability thus creating the same heterogeneous ecosystems above highlighted. In this context, the fundamental research question we address is how do we find things or services in the Internet of Things. In this paper, we propose the first IoT discovery approach which provides an answer to the above question by exploiting hierarchical and universal multi-layered blockchains. Our approach does neither define new standards nor force service providers to change their own protocol. On the contrary, it leverages the existing and publicly available information obtained from each single blockchain to have a better knowledge of the surrounding environment. The proposed approach is detailed and discussed with the support of relevant use cases., This work is partly supported by the Spanish Ministry of Economy and Competitiveness under the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502) and Project TEC2015-66228-P (MINECO/FEDER,UE).
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

A novel approach for spectral efficiency analysis in MIMO cellular networks

  • George, Geordie
  • Mungara, Ratheesh K.
  • Lozano Solsona, Angel
  • Haenggi, Martin
Comunicació presentada a la 2017 IEEE International Conference on Communications (ICC), celebrada els dies 21 a 25 de maig de 2017 a París, França., The application of stochastic geometry to the analysis of wireless networks is shown to be propelled by (i) a clean separation of time scales, (ii) abstraction of small-scale effects via ergodicity, and (iii) an interference model reflecting the receiver's lack of knowledge of how individual interference terms are faded. These steps render the analysis simpler and more precise, and more amenable to incorporating subsequent features. Specifically, the paper presents easy-to-evaluate expressions for the ergodic spectral efficiency of cellular networks with single-user multiple-input multiple-output (MIMO)., This work was supported by Project TEC2015-66228-P (MINECO/FEDER, UE) and by the U.S. NSF through award CCF 1525904.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Dual-kernel online reconstruction of power maps

  • Nikbakht Silab, Rasoul
  • Jonsson, Anders, 1973-
  • Lozano Solsona, Angel
We present a measurement-driven algorithm to map the large-scale channel losses observed between a cellular base station and any point in its coverage area. The algorithm is on-line, meaning that it operates on continuously arriving measurements. Its distinguishing features are the use of two kernel functions, suitably chosen for the problem at hand, and a simple technique to sparsify the dictionary of measurements retained in memory. Evaluations in campus and urban settings indicate that the proposed algorithm reduces, roughly in half, the prediction error of existing single-kernel and multikernel algorithms., Work supported by the Spanish Ministry of Economy and Competitiveness under the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502), TEC2015-66228-P, and the European Research Council (grant agreement 694974).
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Designing fully secure protocols for secure two-party computation of constant-domain functions

  • Daza, Vanesa
  • Makriyannis, Nikolaos
Comunicació presentada a la TCC 2017 Theory of Cryptography. Lecture Notes in Computer Science, celebrada a Baltimore (Estats Units d'Amèrica) del 12 al 15 de novembre de 2017., In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossible, in general. Surprisingly, Gordon et al. (JACM 2011) showed that there exist interesting functions that are computable with fairness. The two results give rise to a distinction between fair functions and unfair ones. The question of characterizing these functions has been studied in a sequence of works leading to the complete characterization of (symmetric) Boolean functions by Asharov et al. (TCC 2015). In this paper, we design new fully secure protocols for functions that were previously unknown to be fair. To this end, our main technical contribution is a generic construction of a fully secure (fair) protocol, starting with a constant-round protocol satisfying limited security requirements. Our construction introduces new conceptual tools for the analysis of fairness that apply to arbitrary (constant-domain) functions. While the characterization remains open, we believe that our results lay the foundation for a deeper understanding of fairness., V. Daza—Research supported by Project TEC2015-66228-P (MINECO/FEDER, UE). N. Makriyannis—Research supported by ERC starting grant 638121.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Random vs structured pilot assignment in cell-free massive MIMO wireless networks

  • Attarifar, Masoud
  • Abbasfar, Aliazam
  • Lozano Solsona, Angel
This paper addresses the performance improvement that structured pilot assignment policies can bring about, relative to a random pilot assignment, in cell-free massive MIMO wireless networks. It is shown that structured policies can deliver a multiple-fold reduction in the pilot overhead required to keep pilot contamination at some acceptably low level. While the implementation of the structured policies considered in the paper might require some degree of centralized control, their performance also captures what distributed nonrandom pilot assignment schemes (e.g., greedy or collision-detecting algorithms) can hope to approach., The work of A. Lozano was supported by Project TEC2015-66228-P (MINECO/FEDER, UE) and by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Analytical handle for ZF reception in distributed massive MIMO

  • Senanayake, Rajitha
  • Lozano Solsona, Angel
  • Smith, Peter
  • Evans, Jamie
Comunicació presentada a la 50th Asilomar Conference on Signals, Systems and Computers, celebrada els dies 6 a 9 de novembre de 2016 a Pacific Grove, Califòrnia., This paper considers distributed massive MIMO networks where a large number of antennas, either collocated or geographically scattered over a region, communicate with mobile users. This communication is impaired by interference from similar transmissions in adjacent regions and by noise. Focusing on zero-forcing (ZF) reception, we derive simple expressions that very accurately approximate the instantaneous signal-to-interference-plus-noise ratio (SINR) and the ergodic spectral efficiency of an arbitrary user. These expressions enable short-cutting any assessment of the network-level performance, either analytical or simulation-based., Work supported by Project TEC2015-66228-P (MINECO/FEDER, UE).