Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks

Soaring capacity and coverage demands dictate that future cellular networks need to soon migrate towards ultra-dense networks. However, network densification comes with a host of challenges that include compromised energy efficiency, complex interference management, cumbersome mobility management, burdensome signaling overheads and higher backhaul costs. Interestingly, most of the problems, that beleaguer network densification, stem from legacy networks' one common feature i.e., tight coupling between the control and data planes regardless of their degree of heterogeneity and cell density. Consequently, in wake of 5G, control and data planes separation architecture (SARC) has recently been conceived as a promising paradigm that has potential to address most of aforementioned challenges. In this article, we review various proposals that have been presented in literature so far to enable SARC. More specifically, we analyze how and to what degree various SARC proposals address the four main challenges in network densification namely: energy efficiency, system level capacity maximization, interference management and mobility management. We then focus on two salient features of future cellular networks that have not yet been adapted in legacy networks at wide scale and thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and device-to-device (D2D) communications. After providing necessary background on CoMP and D2D, we analyze how SARC can particularly act as a major enabler for CoMP and D2D in context of 5G. This article thus serves as both a tutorial as well as an up to date survey on SARC, CoMP and D2D. Most importantly, the article provides an extensive outlook of challenges and opportunities that lie at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201

Collaborative beamforming schemes for wireless sensor networks with energy harvesting capabilities

In recent years, wireless sensor networks have attracted considerable attention in the research community. Their development, induced by technological advances in microelectronics, wireless networking and battery fabrication, is mainly motivated by a large number of possible applications such as environmental monitoring, industrial process control, goods tracking, healthcare applications, to name a few. Due to the unattended nature of wireless sensor networks, battery replacement can be either too costly or simply not feasible. In order to cope with this problem and prolong the network lifetime, energy efficient data transmission protocols have to be designed. Motivated by this ultimate goal, this PhD dissertation focuses on the design of collaborative beamforming schemes for wireless sensor networks with energy harvesting capabilities. On the one hand, by resorting to collaborative beamforming, sensors are able to convey a common message to a distant base station, in an energy efficient fashion. On the other, sensor nodes with energy harvesting capabilities promise virtually infinite network lifetime. Nevertheless, in order to realize collaborative beamforming, it is necessary that sensors align their transmitted signals so that they are coherently combined at the destination. Moreover, sensor nodes have to adapt their transmissions according to the amounts of harvested energy over time. First, this dissertation addresses the scenario where two sensor nodes (one of them capable of harvesting ambient energy) collaboratively transmit a common message to a distant base station. In this setting, we show that the optimal power allocation policy at the energy harvesting sensor can be computed independently (i.e., without the knowledge of the optimal policy at the battery operated one). Furthermore, we propose an iterative algorithm that allows us to compute the optimal policy at the battery operated sensor, as well. The insights gained by the aforementioned scenario allow us to generalize the analysis to a system with multiple energy harvesting sensors. In particular, we develop an iterative algorithm which sequentially optimizes the policies for all the sensors until some convergence criterion is satisfied. For the previous scenarios, this PhD dissertation evaluates the impact of total energy harvested, number of sensors and limited energy storage capacity on the system performance. Finally, we consider some practical schemes for carrier synchronization, required in order to implement collaborative beamforming in wireless sensor networks. To that end, we analyze two algorithms for decentralized phase synchronization: (i) the one bit of feedback algorithm previously proposed in the literature; and (ii) a decentralized phase synchronization algorithm that we propose. As for the former, we analyze the impact of additive noise on the beamforming gain and algorithm’s convergence properties, and, subsequently, we propose a variation that performs sidelobe control. As for the latter, the sensors are allowed to choose their respective training timeslots randomly, relieving the base station of the burden associated with centralized coordination. In this context, this PhD dissertation addresses the impact of number of timeslots and additive noise on the achieved received signal strength and throughputEn los últimos años, las redes de sensores inalámbricas han atraído considerable atención en la comunidad investigadora. Su desarrollo, impulsado por recientes avances tecnológicos en microelectrónica y radio comunicaciones, está motivado principalmente por un gran abanico de aplicaciones, tales como: Monitorización ambiental, control de procesos industriales, seguimiento de mercancías, telemedicina, entre otras. En las redes de sensores inalámbricas, es primordial el diseño de protocolos de transmisión energéticamente eficientes ya que no se contempla el reemplazo de baterías debido a su coste y/o complejidad. Motivados por esta problemática, esta tesis doctoral se centra en el diseño de esquemas de conformación de haz distribuidos para redes de sensores, en el que los nodos son capaces de almacenar energía del entorno, lo que en inglés se denomina energy harvesting. En primer lugar, esta tesis doctoral aborda el escenario en el que dos sensores (uno de ellos capaz de almacenar energía del ambiente) transmiten conjuntamente un mensaje a una estación base. En este contexto, se demuestra que la política de asignación de potencia óptima en el sensor con energy harvesting puede ser calculada de forma independiente (es decir, sin el conocimiento de la política óptima del otro sensor). A continuación, se propone un algoritmo iterativo que permite calcular la política óptima en el sensor que funciona con baterías. Este esquema es posteriormente generalizado para el caso de múltiples sensores. En particular, se desarrolla un algoritmo iterativo que optimiza las políticas de todos los sensores secuencialmente. Para los escenarios anteriormente mencionados, esta tesis evalúa el impacto de la energía total cosechada, número de sensores y la capacidad de la batería. Por último, se aborda el problema de sincronización de fase en los sensores con el fin de poder realizar la conformación de haz de forma distribuida. Para ello, se analizan dos algoritmos para la sincronización de fase descentralizados: (i) el algoritmo "one bit of feedback" previamente propuesto en la literatura, y (ii) un algoritmo de sincronización de fase descentralizado que se propone en esta tesis. En el primer caso, se analiza el impacto del ruido aditivo en la ganancia y la convergencia del algoritmo. Además, se propone una variación que realiza el control de lóbulos secundarios. En el segundo esquema, los sensores eligen intervalos de tiempo de forma aleatoria para transmitir y posteriormente reciben información de la estación base para ajustar sus osciladores. En este escenario, esta tesis doctoral aborda el impacto del número de intervalos de tiempo y el ruido aditivo sobre la ganancia de conformación

Distributed Multicell Beamforming Design Approaching Pareto Boundary with Max-Min Fairness

This paper addresses coordinated downlink beamforming optimization in multicell time-division duplex (TDD) systems where a small number of parameters are exchanged between cells but with no data sharing. With the goal to reach the point on the Pareto boundary with max-min rate fairness, we first develop a two-step centralized optimization algorithm to design the joint beamforming vectors. This algorithm can achieve a further sum-rate improvement over the max-min optimal performance, and is shown to guarantee max-min Pareto optimality for scenarios with two base stations (BSs) each serving a single user. To realize a distributed solution with limited intercell communication, we then propose an iterative algorithm by exploiting an approximate uplink-downlink duality, in which only a small number of positive scalars are shared between cells in each iteration. Simulation results show that the proposed distributed solution achieves a fairness rate performance close to the centralized algorithm while it has a better sum-rate performance, and demonstrates a better tradeoff between sum-rate and fairness than the Nash Bargaining solution especially at high signal-to-noise ratio.Comment: 8 figures. To Appear in IEEE Trans. Wireless Communications, 201

Architectures and synchronization techniques for distributed satellite systems: a survey

Cohesive Distributed Satellite Systems (CDSSs) is a key enabling technology for the future of remote sensing and communication missions. However, they have to meet strict synchronization requirements before their use is generalized. When clock or local oscillator signals are generated locally at each of the distributed nodes, achieving exact synchronization in absolute phase, frequency, and time is a complex problem. In addition, satellite systems have significant resource constraints, especially for small satellites, which are envisioned to be part of the future CDSSs. Thus, the development of precise, robust, and resource-efficient synchronization techniques is essential for the advancement of future CDSSs. In this context, this survey aims to summarize and categorize the most relevant results on synchronization techniques for Distributed Satellite Systems (DSSs). First, some important architecture and system concepts are defined. Then, the synchronization methods reported in the literature are reviewed and categorized. This article also provides an extensive list of applications and examples of synchronization techniques for DSSs in addition to the most significant advances in other operations closely related to synchronization, such as inter-satellite ranging and relative position. The survey also provides a discussion on emerging data-driven synchronization techniques based on Machine Learning (ML). Finally, a compilation of current research activities and potential research topics is proposed, identifying problems and open challenges that can be useful for researchers in the field.This work was supported by the Luxembourg National Research Fund (FNR), through the CORE Project COHEsive SATellite (COHESAT): Cognitive Cohesive Networks of Distributed Units for Active and Passive Space Applications, under Grant FNR11689919.Award-winningPostprint (published version