Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission

Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes to create a virtual multiple-input/multiple-output (MIMO) system. Extending the lifetime of networks composed of battery-operated nodes is a key issue in the design and operation of wireless sensor networks. This paper considers the effects on network lifetime of allowing closely located nodes to use CB/CT to reduce the load or even to avoid packet-forwarding requests to nodes that have critical battery life. First, the effectiveness of CB/CT in improving the signal strength at a faraway destination using energy in nearby nodes is studied. Then, the performance improvement obtained by this technique is analyzed for a special 2D disk case. Further, for general networks in which information-generation rates are fixed, a new routing problem is formulated as a linear programming problem, while for other general networks, the cost for routing is dynamically adjusted according to the amount of energy remaining and the effectiveness of CB/CT. From the analysis and the simulation results, it is seen that the proposed method can reduce the payloads of energy-depleting nodes by about 90% in the special case network considered and improve the lifetimes of general networks by about 10%, compared with existing techniques.Comment: Invited paper to appear in the IEE Proceedings: Microwaves, Antennas and Propagation, Special Issue on Antenna Systems and Propagation for Future Wireless Communication

A Survey on Wireless Security: Technical Challenges, Recent Advances and Future Trends

This paper examines the security vulnerabilities and threats imposed by the inherent open nature of wireless communications and to devise efficient defense mechanisms for improving the wireless network security. We first summarize the security requirements of wireless networks, including their authenticity, confidentiality, integrity and availability issues. Next, a comprehensive overview of security attacks encountered in wireless networks is presented in view of the network protocol architecture, where the potential security threats are discussed at each protocol layer. We also provide a survey of the existing security protocols and algorithms that are adopted in the existing wireless network standards, such as the Bluetooth, Wi-Fi, WiMAX, and the long-term evolution (LTE) systems. Then, we discuss the state-of-the-art in physical-layer security, which is an emerging technique of securing the open communications environment against eavesdropping attacks at the physical layer. We also introduce the family of various jamming attacks and their counter-measures, including the constant jammer, intermittent jammer, reactive jammer, adaptive jammer and intelligent jammer. Additionally, we discuss the integration of physical-layer security into existing authentication and cryptography mechanisms for further securing wireless networks. Finally, some technical challenges which remain unresolved at the time of writing are summarized and the future trends in wireless security are discussed.Comment: 36 pages. Accepted to Appear in Proceedings of the IEEE, 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

Dynamic Radio Cooperation for Downlink Cloud-RANs with Computing Resource Sharing

A novel dynamic radio-cooperation strategy is proposed for Cloud Radio Access Networks (C-RANs) consisting of multiple Remote Radio Heads (RRHs) connected to a central Virtual Base Station (VBS) pool. In particular, the key capabilities of C-RANs in computing-resource sharing and real-time communication among the VBSs are leveraged to design a joint dynamic radio clustering and cooperative beamforming scheme that maximizes the downlink weighted sum-rate system utility (WSRSU). Due to the combinatorial nature of the radio clustering process and the non-convexity of the cooperative beamforming design, the underlying optimization problem is NP-hard, and is extremely difficult to solve for a large network. Our approach aims for a suboptimal solution by transforming the original problem into a Mixed-Integer Second-Order Cone Program (MI-SOCP), which can be solved efficiently using a proposed iterative algorithm. Numerical simulation results show that our low-complexity algorithm provides close-to-optimal performance in terms of WSRSU while significantly outperforming conventional radio clustering and beamforming schemes. Additionally, the results also demonstrate the significant improvement in computing-resource utilization of C-RANs over traditional RANs with distributed computing resources.Comment: 9 pages, 6 figures, accepted to IEEE MASS 201