Compressive Data Gathering in Wireless Sensor Networks

The thesis focuses on collecting data from wireless sensors which are deployed randomly in a region. These sensors are widely used in applications ranging from tracking to the monitoring of environment, traffic and health among others. These energy constrained sensors, once deployed may receive little or no maintenance. Hence gathering data in the most energy efficient manner becomes critical for the longevity of wireless sensor networks (WSNs). Recently, Compressive data gathering (CDG) has emerged as a useful method for collecting sensory data in WSN; this technique is able to reduce global scale communication cost without introducing intensive computation, and is capable of extending the lifetime of the entire sensor network by balancing the forwarding load across the network. This is particularly true due to the benefits obtained from in-network data compression. With CDG, the central unit, instead of receiving data from all sensors in the network, it may receive very few compressed or weighted sums from sensors, and eventually recovers the original data. To prolong the lifetime of WSN, in this thesis, we present data gathering methods based on CDG. More specifically, we propose data gathering schemes using CDG by building up data aggregation trees from sensor nodes to a central unit (sink). Our problem aims at minimizing the number of links in the forwarding trees to minimize the number of overall transmissions. First, we mathematically formulate the problem and solve it using optimization program. Owing to its complexity, we present real-time algorithmic (centralized and decentralized) methods to efficiently solve the problem. We also explore the benefits one may obtain when jointly applying compressive data gathering with network coding in a wireless sensor network. Finally, and in the context of compressive data gathering, we study the problem of joint forwarding tree construction and scheduling under a realistic interference model, and propose some efficient distributed methods for solving it. We also present a primal dual decomposition method, using the theory of column generation, to solve this complex problem

Heuristically Driven Search Methods for Topology Control in Directional Wireless Hybrid Network

Information and Networked Communications play a vital role in the everyday operations of the United States Armed Forces. This research establishes a comparative analysis of the unique network characteristics and requirements introduced by the Topology Control Problem (also known as the Network Design Problem). Previous research has focused on the development of Mixed-Integer Linear Program (MILP) formulations, simple heuristics, and Genetic Algorithm (GA) strategies for solving this problem. Principal concerns with these techniques include runtime and solution quality. To reduce runtime, new strategies have been developed based on the concept of flow networks using the novel combination of three well-known algorithms; knapsack, greedy commodity filtering, and maximum flow. The performance of this approach and variants are compared with previous research using several network metrics including computation time, cost, network diameter, dropped commodities, and average number of hops per commodity. The results conclude that maximum flow algorithms alone are not quite as effective as previous findings, but are at least comparable and show potential for larger networks

Matrix completion and extrapolation via kernel regression

Matrix completion and extrapolation (MCEX) are dealt with here over reproducing kernel Hilbert spaces (RKHSs) in order to account for prior information present in the available data. Aiming at a faster and low-complexity solver, the task is formulated as a kernel ridge regression. The resultant MCEX algorithm can also afford online implementation, while the class of kernel functions also encompasses several existing approaches to MC with prior information. Numerical tests on synthetic and real datasets show that the novel approach performs faster than widespread methods such as alternating least squares (ALS) or stochastic gradient descent (SGD), and that the recovery error is reduced, especially when dealing with noisy data

DESIGN AND OPTIMIZATION OF SIMULTANEOUS WIRELESS INFORMATION AND POWER TRANSFER SYSTEMS

The recent trends in the domain of wireless communications indicate severe upcoming challenges, both in terms of infrastructure as well as design of novel techniques. On the other hand, the world population keeps witnessing or hearing about new generations of mobile/wireless technologies within every half to one decade. It is certain the wireless communication systems have enabled the exchange of information without any physical cable(s), however, the dependence of the mobile devices on the power cables still persist. Each passing year unveils several critical challenges related to the increasing capacity and performance needs, power optimization at complex hardware circuitries, mobility of the users, and demand for even better energy efficiency algorithms at the wireless devices. Moreover, an additional issue is raised in the form of continuous battery drainage at these limited-power devices for sufficing their assertive demands. In this regard, optimal performance at any device is heavily constrained by either wired, or an inductive based wireless recharging of the equipment on a continuous basis. This process is very inconvenient and such a problem is foreseen to persist in future, irrespective of the wireless communication method used. Recently, a promising idea for simultaneous wireless radio-frequency (RF) transmission of information and energy came into spotlight during the last decade. This technique does not only guarantee a more flexible recharging alternative, but also ensures its co-existence with any of the existing (RF-based) or alternatively proposed methods of wireless communications, such as visible light communications (VLC) (e.g., Light Fidelity (Li-Fi)), optical communications (e.g., LASER-equipped communication systems), and far-envisioned quantum-based communication systems. In addition, this scheme is expected to cater to the needs of many current and future technologies like wearable devices, sensors used in hazardous areas, 5G and beyond, etc. This Thesis presents a detailed investigation of several interesting scenarios in this direction, specifically concerning design and optimization of such RF-based power transfer systems. The first chapter of this Thesis provides a detailed overview of the considered topic, which serves as the foundation step. The details include the highlights about its main contributions, discussion about the adopted mathematical (optimization) tools, and further refined minutiae about its organization. Following this, a detailed survey on the wireless power transmission (WPT) techniques is provided, which includes the discussion about historical developments of WPT comprising its present forms, consideration of WPT with wireless communications, and its compatibility with the existing techniques. Moreover, a review on various types of RF energy harvesting (EH) modules is incorporated, along with a brief and general overview on the system modeling, the modeling assumptions, and recent industrial considerations. Furthermore, this Thesis work has been divided into three main research topics, as follows. Firstly, the notion of simultaneous wireless information and power transmission (SWIPT) is investigated in conjunction with the cooperative systems framework consisting of single source, multiple relays and multiple users. In this context, several interesting aspects like relay selection, multi-carrier, and resource allocation are considered, along with problem formulations dealing with either maximization of throughput, maximization of harvested energy, or both. Secondly, this Thesis builds up on the idea of transmit precoder design for wireless multigroup multicasting systems in conjunction with SWIPT. Herein, the advantages of adopting separate multicasting and energy precoder designs are illustrated, where we investigate the benefits of multiple antenna transmitters by exploiting the similarities between broadcasting information and wirelessly transferring power. The proposed design does not only facilitates the SWIPT mechanism, but may also serve as a potential candidate to complement the separate waveform designing mechanism with exclusive RF signals meant for information and power transmissions, respectively. Lastly, a novel mechanism is developed to establish a relationship between the SWIPT and cache-enabled cooperative systems. In this direction, benefits of adopting the SWIPT-caching framework are illustrated, with special emphasis on an enhanced rate-energy (R-E) trade-off in contrast to the traditional SWIPT systems. The common notion in the context of SWIPT revolves around the transmission of information, and storage of power. In this vein, the proposed work investigates the system wherein both information and power can be transmitted and stored. The Thesis finally concludes with insights on the future directions and open research challenges associated with the considered framework

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 optimization algorithms for multihop wireless networks

Recent technological advances in low-cost computing and communication hardware design have led to the feasibility of large-scale deployments of wireless ad hoc and sensor networks. Due to their wireless and decentralized nature, multihop wireless networks are attractive for a variety of applications. However, these properties also pose significant challenges to their developers and therefore require new types of algorithms. In cases where traditional wired networks usually rely on some kind of centralized entity, in multihop wireless networks nodes have to cooperate in a distributed and self-organizing manner. Additional side constraints, such as energy consumption, have to be taken into account as well. This thesis addresses practical problems from the domain of multihop wireless networks and investigates the application of mathematically justified distributed algorithms for solving them. Algorithms that are based on a mathematical model of an underlying optimization problem support a clear understanding of the assumptions and restrictions that are necessary in order to apply the algorithm to the problem at hand. Yet, the algorithms proposed in this thesis are simple enough to be formulated as a set of rules for each node to cooperate with other nodes in the network in computing optimal or approximate solutions. Nodes communicate with their neighbors by sending messages via wireless transmissions. Neither the size nor the number of messages grows rapidly with the size of the network. The thesis represents a step towards a unified understanding of the application of distributed optimization algorithms to problems from the domain of multihop wireless networks. The problems considered serve as examples for related problems and demonstrate the design methodology of obtaining distributed algorithms from mathematical optimization methods