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): 26
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 Artículo científico (JournalArticle)

Enclosed mmWave wearable networks: feasibility and performance

  • George, Geordie
  • Venugopal, Kiran
  • Lozano Solsona, Angel
  • Heath, R. W., Jr.
This paper investigates the feasibility of mmWave frequencies for personal networks of wireless wearable devices in enclosed settings (e.g., commuter trains, subways, airplanes, airports, or offices). At these frequencies, specular reflections off surfaces are expected to contribute to the capture of intended signal power and, simultaneously, to aggravate the interference at the receivers. Meanwhile, blockages by obstacles and people-including the individuals wearing the devices-are expected to shield receivers from interference. With the aid of stochastic geometry and random shape theory, we assess the interplay of surface reflections and blockages for dense deployments of wearable networks equipped with directional antenna arrays in relevant indoor settings., This work was supported in part by the Intel/Verizon University Research Program 5G: Transforming the Wireless User Experience and in part by the Project MINECO/FEDER, UE under Grant TEC2015-66228-P, and in part by the European Research Council under the H2020 Framework Programme/ERC under Grant 694974.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Ergodic spectral efficiency in MIMO cellular networks

  • George, Geordie
  • Mungara, Ratheesh K.
  • Lozano Solsona, Angel
  • Haenggi, Martin
This paper shows how the application of stochastic geometry to the analysis of wireless networks is greatly facilitated by: (i) a clear separation of time scales; (ii) the abstraction of small-scale effects via ergodicity; and (iii) an interference model that reflects the receiver's lack of knowledge of how each individual interference term is faded. These procedures render the analysis both more manageable and more precise, as well as more amenable to the incorporation of subsequent features. In particular, the paper presents analytical characterizations of the ergodic spectral efficiency of cellular networks with single-user multiple-input multiple-output and sectorization. These characterizations, in the form of easy-to-evaluate expressions, encompass the coverage, the distribution of spectral efficiency over the network locations, and the average thereof., This work was supported in part by MINECO/FEDER, UE, under Project TEC2015-66228-P, in part by the European Research Council under the H2020 Framework Programme/ERC grant agreement under Grant 694974, and in part by the U.S. National Science Foundation under Award CCF 1525904.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Analysis of dynamic channel bonding in dense networks of WLANs

  • Faridi, Azadeh
  • Bellalta, Boris
  • Checco, Alessandro
Dynamic Channel Bonding (DCB) allows for the dynamic selection and use of multiple contiguous basic channels in Wireless Local Area Networks (WLANs). A WLAN operating under DCB can enjoy a larger bandwidth, when available, and therefore achieve a higher throughput. However, the use of larger bandwidths also increases the contention with adjacent WLANs, which can result in longer delays in accessing the channel and consequently, a lower throughput. In this paper, a scenario consisting of multiple WLANs using DCB and operating within carrier-sensing range of one another is considered. An analytical framework for evaluating the performance of such networks is presented. The analysis is carried out using a Markov chain model that characterizes the interactions between adjacent WLANs with overlapping channels. An algorithm is proposed for systematically constructing the Markov chain corresponding to any given scenario. The analytical model is then used to highlight and explain the key properties that differentiate DCB networks of WLANs from those operating on a single shared channel. Furthermore, the analysis is applied to networks of IEEE 802.11ac WLANs operating under DCB-which do not fully comply with some of the simplifying assumptions in our analysis-to show that the analytical model can give accurate results in more realistic scenarios., This work has been supported by projects TEC2015-66228-P and TEC2012-32354 (MINECO/FEDER, UE). Azadeh Faridi is the corresponding author.
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 Artículo científico (JournalArticle)

Full-duplex MIMO in cellular networks: system-level performance

  • Mungara, Ratheesh K.
  • Thibault, Ilaria
  • Lozano Solsona, Angel
This paper characterizes, through a stochastic geometry analysis, the increase in spectral efficiency that full-duplex transmission brings about in wireless networks. While, on isolated links, full-duplex promises a doubling of the spectral efficiency, in the context of a network this is weighted down by the corresponding rise in interference, and our characterization captures the balance of these effects. The analysis encompasses both the forward link (FL) and the reverse link (RL) with single-user and multiuser transmissions. And, as a complement to the analysis, Monte-Carlo simulations on a Vodafone LTE field test network are also presented. In the FL, the rise in interference is found to have minor impact and a doubling in spectral efficiency can indeed be approached, especially in microcellular networks. In the RL, however, a major difficulty arises in the form of exceedingly strong interference among base stations. This renders full-duplex transmission all but unfeasible in macrocellular networks (unless major countermeasures could be implemented) and undesirable in dense microcellular networks. Only in microcells with sufficient spacing among base stations does RL full-duplex pay off. Thus, full-duplex is seen not to blend easily with densification., This work was supported in part by the Project TEC2015-66228-P (MINECO/FEDER, UE) and in part by the European Research Council under the H2020 Framework Programme/ERC under Grant 694974.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Low-complexity MIMO precoding for finite-alphabet signals

  • Wu, Yongpeng
  • Wing Kwan Ng, Derrick
  • Wen, Chao-Kai
  • Schober, Robert
  • Lozano Solsona, Angel
This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and, in particular, for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels exhibiting line-of-sight components and rather general antenna correlations, precoding structures that decompose the general channel into a set of parallel subchannel pairs are proposed. Then, a low-complexity iterative algorithm is devised to maximize the sum mutual information of all pairs. The proposed algorithm significantly reduces the computational load of existing approaches with only minimal loss in performance. The complexity savings increase with the number of transmit antennas and with the cardinality of the signal alphabet, making it possible to support values thereof that were unmanageable with existing solutions. Most importantly, the proposed solution does not require instantaneous channel state information (CSI) at the transmitter, but only statistical CSI., The work of Y. Wu was supported by a TUM University Foundation Fellowship. The work of D. W. K. Ng was supported by the Australian Research Councils Discovery Early Career Researcher Award funding scheme under Grant DE170100137 and in part by the Linkage Project under Grant LP160100708. The work of C.-K. Wen was supported by the Ministry of Science and Technology of Taiwan under Grant MOST 103-2221-E-110-029-MY3. The work of R. Schober was supported by the German Science Foundation under Grant SCHO 831/5-1. The work of A. Lozano was supported in part by the Project TEC2015-66228-P under Grant MINECO/FEDER, UE and in part by the European Research Council under the H2020 Framework Programme/ERC under Grant 694974. Part of this paper was presented in ICC 2016. The associate editor coordinating the review of this paper and approving it for publication was M. Uysal. (Corresponding author: Yongpeng Wu.)
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Modified conjugate beamforming for cell-free massive MIMO

  • Attarifar, Masoud
  • Abbasfar, Aliazam
  • Lozano Solsona, Angel
We present a modification of conjugate beamforming for the forward link of cell-free massive MIMO networks. This modification eliminates the self-interference and yields a performance that, without forward pilots, closely approaches what would be achieved with such pilots in place. The simplicity of conjugate beamforming is preserved, with no need for matrix inversions, at the expense of fading-rate coordination among the access points., The work of A. Lozano was supported in part by MINECO/FEDER, UE under Project TEC2015-66228-P, and in part by the European Research Council through H2020 Framework Programme/ERC under Grant 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 Artículo científico (JournalArticle)

Distribution of the number of users per base station in cellular networks

  • George, Geordie
  • Lozano Solsona, Angel
  • Haenggi, Martin
We consider the number of users associating with each base station in a cellular network. Extending and unifying the characterizations for certain settings available in the literature, we derive a result that is asymptotic in the strength of the shadowing, yet otherwise universally valid: it holds for every network geometry and shadowing distribution. We then illustrate how this result provides excellent representations in various classes of networks and with realistic shadowing strengths, evidencing broad applicability., This work was supported by Project TEC2015-66228-P (MINECO/FEDER, UE), by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, and by the U.S. NSF through award CCF 1525904.
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 Artículo científico (JournalArticle)

Enclosed mmWave wearable networks: feasibility and performance

  • George, Geordie
  • Venugopal, Kiran
  • Lozano Solsona, Angel
  • Heath, R. W., Jr.
This paper investigates the feasibility of mmWave frequencies for personal networks of wireless wearable devices in enclosed settings (e.g., commuter trains, subways, airplanes, airports, or offices). At these frequencies, specular reflections off surfaces are expected to contribute to the capture of intended signal power and, simultaneously, to aggravate the interference at the receivers. Meanwhile, blockages by obstacles and people-including the individuals wearing the devices-are expected to shield receivers from interference. With the aid of stochastic geometry and random shape theory, we assess the interplay of surface reflections and blockages for dense deployments of wearable networks equipped with directional antenna arrays in relevant indoor settings., This work was supported in part by the Intel/Verizon University Research Program 5G: Transforming the Wireless User Experience and in part by the Project MINECO/FEDER, UE under Grant TEC2015-66228-P, and in part by the European Research Council under the H2020 Framework Programme/ERC under Grant 694974.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Modified conjugate beamforming for cell-free massive MIMO

  • Attarifar, Masoud
  • Abbasfar, Aliazam
  • Lozano Solsona, Angel
We present a modification of conjugate beamforming for the forward link of cell-free massive MIMO networks. This modification eliminates the self-interference and yields a performance that, without forward pilots, closely approaches what would be achieved with such pilots in place. The simplicity of conjugate beamforming is preserved, with no need for matrix inversions, at the expense of fading-rate coordination among the access points., The work of A. Lozano was supported in part by MINECO/FEDER, UE under Project TEC2015-66228-P, and in part by the European Research Council through H2020 Framework Programme/ERC under Grant 694974.
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 Artículo científico (JournalArticle)

Ergodic spectral efficiency in MIMO cellular networks

  • George, Geordie
  • Mungara, Ratheesh K.
  • Lozano Solsona, Angel
  • Haenggi, Martin
This paper shows how the application of stochastic geometry to the analysis of wireless networks is greatly facilitated by: (i) a clear separation of time scales; (ii) the abstraction of small-scale effects via ergodicity; and (iii) an interference model that reflects the receiver's lack of knowledge of how each individual interference term is faded. These procedures render the analysis both more manageable and more precise, as well as more amenable to the incorporation of subsequent features. In particular, the paper presents analytical characterizations of the ergodic spectral efficiency of cellular networks with single-user multiple-input multiple-output and sectorization. These characterizations, in the form of easy-to-evaluate expressions, encompass the coverage, the distribution of spectral efficiency over the network locations, and the average thereof., This work was supported in part by MINECO/FEDER, UE, under Project TEC2015-66228-P, in part by the European Research Council under the H2020 Framework Programme/ERC grant agreement under Grant 694974, and in part by the U.S. National Science Foundation under Award CCF 1525904.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Analysis of dynamic channel bonding in dense networks of WLANs

  • Faridi, Azadeh
  • Bellalta, Boris
  • Checco, Alessandro
Dynamic Channel Bonding (DCB) allows for the dynamic selection and use of multiple contiguous basic channels in Wireless Local Area Networks (WLANs). A WLAN operating under DCB can enjoy a larger bandwidth, when available, and therefore achieve a higher throughput. However, the use of larger bandwidths also increases the contention with adjacent WLANs, which can result in longer delays in accessing the channel and consequently, a lower throughput. In this paper, a scenario consisting of multiple WLANs using DCB and operating within carrier-sensing range of one another is considered. An analytical framework for evaluating the performance of such networks is presented. The analysis is carried out using a Markov chain model that characterizes the interactions between adjacent WLANs with overlapping channels. An algorithm is proposed for systematically constructing the Markov chain corresponding to any given scenario. The analytical model is then used to highlight and explain the key properties that differentiate DCB networks of WLANs from those operating on a single shared channel. Furthermore, the analysis is applied to networks of IEEE 802.11ac WLANs operating under DCB-which do not fully comply with some of the simplifying assumptions in our analysis-to show that the analytical model can give accurate results in more realistic scenarios., This work has been supported by projects TEC2015-66228-P and TEC2012-32354 (MINECO/FEDER, UE). Azadeh Faridi is the corresponding author.
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 Artículo científico (JournalArticle)

Full-duplex MIMO in cellular networks: system-level performance

  • Mungara, Ratheesh K.
  • Thibault, Ilaria
  • Lozano Solsona, Angel
This paper characterizes, through a stochastic geometry analysis, the increase in spectral efficiency that full-duplex transmission brings about in wireless networks. While, on isolated links, full-duplex promises a doubling of the spectral efficiency, in the context of a network this is weighted down by the corresponding rise in interference, and our characterization captures the balance of these effects. The analysis encompasses both the forward link (FL) and the reverse link (RL) with single-user and multiuser transmissions. And, as a complement to the analysis, Monte-Carlo simulations on a Vodafone LTE field test network are also presented. In the FL, the rise in interference is found to have minor impact and a doubling in spectral efficiency can indeed be approached, especially in microcellular networks. In the RL, however, a major difficulty arises in the form of exceedingly strong interference among base stations. This renders full-duplex transmission all but unfeasible in macrocellular networks (unless major countermeasures could be implemented) and undesirable in dense microcellular networks. Only in microcells with sufficient spacing among base stations does RL full-duplex pay off. Thus, full-duplex is seen not to blend easily with densification., This work was supported in part by the Project TEC2015-66228-P (MINECO/FEDER, UE) and in part by the European Research Council under the H2020 Framework Programme/ERC under Grant 694974.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Distribution of the number of users per base station in cellular networks

  • George, Geordie
  • Lozano Solsona, Angel
  • Haenggi, Martin
We consider the number of users associating with each base station in a cellular network. Extending and unifying the characterizations for certain settings available in the literature, we derive a result that is asymptotic in the strength of the shadowing, yet otherwise universally valid: it holds for every network geometry and shadowing distribution. We then illustrate how this result provides excellent representations in various classes of networks and with realistic shadowing strengths, evidencing broad applicability., This work was supported by Project TEC2015-66228-P (MINECO/FEDER, UE), by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, and by the U.S. NSF through award CCF 1525904.
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).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Low-complexity MIMO precoding for finite-alphabet signals

  • Wu, Yongpeng
  • Wing Kwan Ng, Derrick
  • Wen, Chao-Kai
  • Schober, Robert
  • Lozano Solsona, Angel
This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and, in particular, for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels exhibiting line-of-sight components and rather general antenna correlations, precoding structures that decompose the general channel into a set of parallel subchannel pairs are proposed. Then, a low-complexity iterative algorithm is devised to maximize the sum mutual information of all pairs. The proposed algorithm significantly reduces the computational load of existing approaches with only minimal loss in performance. The complexity savings increase with the number of transmit antennas and with the cardinality of the signal alphabet, making it possible to support values thereof that were unmanageable with existing solutions. Most importantly, the proposed solution does not require instantaneous channel state information (CSI) at the transmitter, but only statistical CSI., The work of Y. Wu was supported by a TUM University Foundation Fellowship. The work of D. W. K. Ng was supported by the Australian Research Councils Discovery Early Career Researcher Award funding scheme under Grant DE170100137 and in part by the Linkage Project under Grant LP160100708. The work of C.-K. Wen was supported by the Ministry of Science and Technology of Taiwan under Grant MOST 103-2221-E-110-029-MY3. The work of R. Schober was supported by the German Science Foundation under Grant SCHO 831/5-1. The work of A. Lozano was supported in part by the Project TEC2015-66228-P under Grant MINECO/FEDER, UE and in part by the European Research Council under the H2020 Framework Programme/ERC under Grant 694974. Part of this paper was presented in ICC 2016. The associate editor coordinating the review of this paper and approving it for publication was M. Uysal. (Corresponding author: Yongpeng Wu.)