Physics and Applications of Laser Diode Chaos

An overview of chaos in laser diodes is provided which surveys experimental achievements in the area and explains the theory behind the phenomenon. The fundamental physics underpinning this behaviour and also the opportunities for harnessing laser diode chaos for potential applications are discussed. The availability and ease of operation of laser diodes, in a wide range of configurations, make them a convenient test-bed for exploring basic aspects of nonlinear and chaotic dynamics. It also makes them attractive for practical tasks, such as chaos-based secure communications and random number generation. Avenues for future research and development of chaotic laser diodes are also identified.Comment: Published in Nature Photonic

Feedback-based scheduling for load-balanced two-stage switches

A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unlike existing approaches, we show that the efforts made in load balancing and keeping packets in order can complement each other. Specifically, at each middle-stage port between the two switch fabrics of a load-balanced switch, only a single-packet buffer for each virtual output queueing (VOQ) is required. Although packets belonging to the same flow pass through different middle-stage VOQs, the delays they experience at different middle-stage ports will be identical. This is made possible by properly selecting and coordinating the two sequences of switch configurations to form a joint sequence with both staggered symmetry property and in-order packet delivery property. Based on the staggered symmetry property, an efficient feedback mechanism is designed to allow the right middle-stage port occupancy vector to be delivered to the right input port at the right time. As a result, the performance of load balancing as well as the switch throughput is significantly improved. We further extend this feedback mechanism to support the multicabinet implementation of a load-balanced switch, where the propagation delay between switch linecards and switch fabrics is nonnegligible. As compared to the existing load-balanced switch architectures and scheduling algorithms, our solutions impose a modest requirement on switch hardware, but consistently yield better delay-throughput performance. Last but not least, some extensions and refinements are made to address the scalability, implementation, and fairness issues of our solutions. © 2009 IEEE.published_or_final_versio

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 space time block coding and application in cooperative cognitive relay networks

The design and analysis of various distributed space time block coding schemes for cooperative relay networks is considered in this thesis. Rayleigh frequency flat and selective fading channels are assumed to model the links in the networks, and interference suppression techniques together with an orthogonal frequency division multiplexing (OFDM) type transmission approach are employed to mitigate synchronization errors at the destination node induced by the different delays through the relay nodes. Closed-loop space time block coding is first considered in the context of decode-and-forward (regenerative) networks. In particular, quasi orthogonal and extended orthogonal coding techniques are employed for transmission from four relay nodes and parallel interference cancellation detection is exploited to mitigate synchronization errors. Availability of a direct link between the source and destination nodes is studied. Outer coding is then added to gain further improvement in end-to-end performance and amplify-and-forward (non regenerative) type networks together with distributed space time coding are considered to reduce relay node complexity. A novel detection scheme is then proposed for decode-and-forward and amplify-and-forward networks with closed-loop extended orthogonal coding and closed-loop quasi-orthogonal coding which reduce the computational complexity of the parallel interference cancellation. The near-optimum detector is presented for relay nodes with single or dual antennas. End-to-end bit error rate simulations confirm the potential of the approach and its ability to mitigate synchronization errors

Distributed space-time block coding in cooperative relay networks with application in cognitive radio

Spatial diversity is an effective technique to combat the effects of severe fading in wireless environments. Recently, cooperative communications has emerged as an attractive communications paradigm that can introduce a new form of spatial diversity which is known as cooperative diversity, that can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. As such, the same diversity gains as in multi-input multi-output systems can be achieved without requiring multiple-antenna terminals. In this thesis, a new approach to cooperative communications via distributed extended orthogonal space-time block coding (D-EO-STBC) based on limited partial feedback is proposed for cooperative relay networks with three and four relay nodes and then generalized for an arbitrary number of relay nodes. This scheme can achieve full cooperative diversity and full transmission rate in addition to array gain, and it has certain properties that make it alluring for practical systems such as orthogonality, flexibility, low computational complexity and decoding delay, and high robustness to node failure. Versions of the closed-loop D-EO-STBC scheme based on cooperative orthogonal frequency division multiplexing type transmission are also proposed for both flat and frequency-selective fading channels which can overcome imperfect synchronization in the network. As such, this proposed technique can effectively cope with the effects of fading and timing errors. Moreover, to increase the end-to-end data rate, this scheme is extended for two-way relay networks through a three-time slot framework. On the other hand, to substantially reduce the feedback channel overhead, limited feedback approaches based on parameter quantization are proposed. In particular, an optimal one-bit partial feedback approach is proposed for the generalized D-O-STBC scheme to maximize the array gain. To further enhance the end-to-end bit error rate performance of the cooperative relay system, a relay selection scheme based on D-EO-STBC is then proposed. Finally, to highlight the utility of the proposed D-EO-STBC scheme, an application to cognitive radio is studied

Performance analysis and algorithm design for distributed transmit beamforming

Wireless sensor networks has been one of the major research topics in recent years because of its great potential for a wide range of applications. In some application scenarios, sensor nodes intend to report the sensing data to a far-field destination, which cannot be realized by traditional transmission techniques. Due to the energy limitations and the hardware constraints of sensor nodes, distributed transmit beamforming is considered as an attractive candidate for long-range communications in such scenarios as it can reduce energy requirement of each sensor node and extend the communication range. However, unlike conventional beamforming, which is performed by a centralized antenna array, distributed beamforming is performed by a virtual antenna array composed of randomly located sensor nodes, each of which has an independent oscillator. Sensor nodes have to coordinate with each other and adjust their transmitting signals to collaboratively act as a distributed beamformer. The most crucial problem of realizing distributed beamforming is to achieve carrier phase alignment at the destination. This thesis will investigate distributed beamforming from both theoretical and practical aspects. First, the bit error ratio performance of distributed beamforming with phase errors is analyzed, which is a key metric to measure the system performance in practice. We derive two distinct expressions to approximate the error probability over Rayleigh fading channels corresponding to small numbers of nodes and large numbers of nodes respectively. The accuracy of both expressions is demonstrated by simulation results. The impact of phase errors on the system performance is examined for various numbers of nodes and different levels of transmit power. Second, a novel iterative algorithm is proposed to achieve carrier phase alignment at the destination in static channels, which only requires one-bit feedback from the destination. This algorithm is obtained by combining two novel schemes, both of which can greatly improve the convergence speed of phase alignment. The advantages in the convergence speed are obtained by exploiting the feedback information more efficiently compared to existing solutions. Third, the proposed phase alignment algorithm is modified to track time-varying channels. The modified algorithm has the ability to detect channel amplitude and phase changes that arise over time due to motion of the sensors or the destination. The algorithm can adjust key parameters adaptively according to the changes, which makes it more robust in practical implementation