Collaborative Communication And Storage In Energy-Synchronized Sensor Networks

In a battery-less sensor network, all the operation of sensor nodes are strictly constrained by and synchronized with the fluctuations of harvested energy, causing nodes to be disruptive from network and hence unstable network connectivity. Such wireless sensor network is named as energy-synchronized sensor networks. The unpredictable network disruptions and challenging communication environments make the traditional communication protocols inefficient and require a new paradigm-shift in design. In this thesis, I propose a set of algorithms on collaborative data communication and storage for energy-synchronized sensor networks. The solutions are based on erasure codes and probabilistic network codings. The proposed set of algorithms significantly improve the data communication throughput and persistency, and they are inherently amenable to probabilistic nature of transmission in wireless networks. The technical contributions explore collaborative communication with both no coding and network coding methods. First, I propose a collaborative data delivery protocol to exploit the optimal performance of multiple energy-synchronized paths without network coding, i.e. a new max-flow min-variance algorithm. In consort with this data delivery protocol, a localized TDMA MAC protocol is designed to synchronize nodes\u27 duty-cycles and mitigate media access contentions. However, the energy supply can change dynamically over time, making determined duty cycles synchronization difficult in practice. A probabilistic approach is investigated. Therefore, I present Opportunistic Network Erasure Coding protocol (ONEC), to collaboratively collect data. ONEC derives the probability distribution of coding degree in each node and enable opportunistic in-network recoding, and guarantee the recovery of original sensor data can be achieved with high probability upon receiving any sufficient amount of encoded packets. Next, OnCode, an opportunistic in-network data coding and delivery protocol is proposed to further improve data communication under the constraints of energy synchronization. It is resilient to packet loss and network disruptions, and does not require explicit end-to-end feedback message. Moreover, I present a network Erasure Coding with randomized Power Control (ECPC) mechanism for collaborative data storage in disruptive sensor networks. ECPC only requires each node to perform a single broadcast at each of its several randomly selected power levels. Thus it incurs very low communication overhead. Finally, I propose an integrated algorithm and middleware (Ravine Stream) to improve data delivery throughput as well as data persistency in energy-synchronized sensor network

STR-991: ENERGY HARVESTING METHODS FOR STRUCTURAL HEALTH MONITORING USING WIRELESS SENSORS: A REVIEW

Structural Health Monitoring (SHM) implies monitoring the performance of structures using sensors to get an advance warning of the loss of structural capacity or potential collapse. Wireless-sensor based monitoring system is found to be advantageous over traditional wire-based system because of their ease of implementation and maintenance. However, power supply is an important concern for wireless sensors used in monitoring of civil engineering structures. While there are different efficient power usage methods and power supply solutions available for wireless sensors, their applications to SHM systems for civil infrastructure are not standardized. Energy harvesting by means of converting energy from the surrounding environment provides a desirable solution to address the issue of finite power source for wireless sensors. There are several sources of renewable energy that can be harnessed to generate electrical energy for the sensors. This paper reviews some of these energy harvesting sources and provides their working concept, brief idea about related research and a current state-of-art of their applications for structural health monitoring of civil engineering structures. Solar and mechanical energy harvesters have the most implemented applications for monitoring structures currently

Building a green connected future: smart (Internet of) Things for smart networks

The vision of Internet of Things (IoT) promises to reshape society by creating a future where we will be surrounded by a smart environment that is constantly aware of the users and has the ability to adapt to any changes. In the IoT, a huge variety of smart devices is interconnected to form a network of distributed agents that continuously share and process information. This communication paradigm has been recognized as one of the key enablers of the rapidly emerging applications that make up the fabric of the IoT. These networks, often called wireless sensor networks (WSNs), are characterized by the low cost of their components, their pervasive connectivity, and their self-organization features, which allow them to cooperate with other IoT elements to create large-scale heterogeneous information systems. However, a number of considerable challenges is arising when considering the design of large-scale WSNs. In particular, these networks are made up by embedded devices that suffer from severe power constraints and limited resources. The advent of low-power sensor nodes coupled with intelligent software and hardware technologies has led to the era of green wireless networks. From the hardware perspective, green sensor nodes are endowed with energy scavenging capabilities to overcome energy-related limitations. They are also endowed with low-power triggering techniques, i.e., wake-up radios, to eliminate idle listening-induced communication costs. Green wireless networks are considered a fundamental vehicle for enabling all those critical IoT applications where devices, for different reasons, do not carry batteries, and that therefore only harvest energy and store it for future use. These networks are considered to have the potential of infinite lifetime since they do not depend on batteries, or on any other limited power sources. Wake-up radios, coupled with energy provisioning techniques, further assist on overcoming the physical constraints of traditional WSNs. In addition, they are particularly important in green WSNs scenarios in which it is difficult to achieve energy neutrality due to limited harvesting rates. In this PhD thesis we set to investigate how different data forwarding mechanisms can make the most of these green wireless networks-enabling technologies, namely, energy harvesting and wake-up radios. Specifically, we present a number of cross-layer routing approaches with different forwarding design choices and study their consequences on network performance. Among the most promising protocol design techniques, the past decade has shown the increasingly intensive adoption of techniques based on various forms of machine learning to increase and optimize the performance of WSNs. However, learning techniques can suffer from high computational costs as nodes drain a considerable percentage of their energy budget to run sophisticated software procedures, predict accurate information and determine optimal decision. This thesis addresses also the problem of local computational requirements of learning-based data forwarding strategies by investigating their impact on the performance of the network. Results indicate that local computation can be a major source of energy consumption; it’s impact on network performance should not be neglected

Swarm intelligence techniques for optimization and management tasks insensor networks

The main contributions of this thesis are located in the domain of wireless sensor netorks. More in detail, we introduce energyaware algorithms and protocols in the context of the following topics: self-synchronized duty-cycling in networks with energy harvesting capabilities, distributed graph coloring and minimum energy broadcasting with realistic antennas. In the following, we review the research conducted in each case. We propose a self-synchronized duty-cycling mechanism for sensor networks. This mechanism is based on the working and resting phases of natural ant colonies, which show self-synchronized activity phases. The main goal of duty-cycling methods is to save energy by efficiently alternating between different states. In the case at hand, we considered two different states: the sleep state, where communications are not possible and energy consumption is low; and the active state, where communication result in a higher energy consumption. In order to test the model, we conducted an extensive experimentation with synchronous simulations on mobile networks and static networks, and also considering asynchronous networks. Later, we extended this work by assuming a broader point of view and including a comprehensive study of the parameters. In addition, thanks to a collaboration with the Technical University of Braunschweig, we were able to test our algorithm in the real sensor network simulator Shawn (http://shawn.sf.net). The second part of this thesis is devoted to the desynchronization of wireless sensor nodes and its application to the distributed graph coloring problem. In particular, our research is inspired by the calling behavior of Japanese tree frogs, whose males use their calls to attract females. Interestingly, as female frogs are only able to correctly localize the male frogs when their calls are not too close in time, groups of males that are located nearby each other desynchronize their calls. Based on a model of this behavior from the literature, we propose a novel algorithm with applications to the field of sensor networks. More in detail, we analyzed the ability of the algorithm to desynchronize neighboring nodes. Furthermore, we considered extensions of the original model, hereby improving its desynchronization capabilities.To illustrate the potential benefits of desynchronized networks, we then focused on distributed graph coloring. Later, we analyzed the algorithm more extensively and show its performance on a larger set of benchmark instances. The classical minimum energy broadcast (MEB) problem in wireless ad hoc networks, which is well-studied in the scientific literature, considers an antenna model that allows the adjustment of the transmission power to any desired real value from zero up to the maximum transmission power level. However, when specifically considering sensor networks, a look at the currently available hardware shows that this antenna model is not very realistic. In this work we re-formulate the MEB problem for an antenna model that is realistic for sensor networks. In this antenna model transmission power levels are chosen from a finite set of possible ones. A further contribution concerns the adaptation of an ant colony optimization algorithm --currently being the state of the art for the classical MEB problem-- to the more realistic problem version, the so-called minimum energy broadcast problem with realistic antennas (MEBRA). The obtained results show that the advantage of ant colony optimization over classical heuristics even grows when the number of possible transmission power levels decreases. Finally we build a distributed version of the algorithm, which also compares quite favorably against centralized heuristics from the literature.Las principles contribuciones de esta tesis se encuentran en el domino de las redes de sensores inalámbricas. Más en detalle, introducimos algoritmos y protocolos que intentan minimizar el consumo energético para los siguientes problemas: gestión autosincronizada de encendido y apagado de sensores con capacidad para obtener energía del ambiente, coloreado de grafos distribuido y broadcasting de consumo mínimo en entornos con antenas reales. En primer lugar, proponemos un sistema capaz de autosincronizar los ciclos de encendido y apagado de los nodos de una red de sensores. El mecanismo está basado en las fases de trabajo y reposo de las colonias de hormigas tal y como estas pueden observarse en la naturaleza, es decir, con fases de actividad autosincronizadas. El principal objectivo de este tipo de técnicas es ahorrar energía gracias a alternar estados de forma eficiente. En este caso en concreto, consideramos dos estados diferentes: el estado dormido, en el que los nodos no pueden comunicarse y el consumo energético es bajo; y el estado activo, en el que las comunicaciones propician un consumo energético elevado. Con el objetivo de probar el modelo, se ha llevado a cabo una extensa experimentación que incluye tanto simulaciones síncronas en redes móviles y estáticas, como simulaciones en redes asíncronas. Además, este trabajo se extendió asumiendo un punto de vista más amplio e incluyendo un detallado estudio de los parámetros del algoritmo. Finalmente, gracias a la colaboración con la Technical University of Braunschweig, tuvimos la oportunidad de probar el mecanismo en el simulador realista de redes de sensores, Shawn (http://shawn.sf.net). La segunda parte de esta tesis está dedicada a la desincronización de nodos en redes de sensores y a su aplicación al problema del coloreado de grafos de forma distribuida. En particular, nuestra investigación está inspirada por el canto de las ranas de árbol japonesas, cuyos machos utilizan su canto para atraer a las hembras. Resulta interesante que debido a que las hembras solo son capaces de localizar las ranas macho cuando sus cantos no están demasiado cerca en el tiempo, los grupos de machos que se hallan en una misma región desincronizan sus cantos. Basado en un modelo de este comportamiento que se encuentra en la literatura, proponemos un nuevo algoritmo con aplicaciones al campo de las redes de sensores. Más en detalle, analizamos la habilidad del algoritmo para desincronizar nodos vecinos. Además, consideramos extensiones del modelo original, mejorando su capacidad de desincronización. Para ilustrar los potenciales beneficios de las redes desincronizadas, nos centramos en el problema del coloreado de grafos distribuido que tiene relación con diferentes tareas habituales en redes de sensores. El clásico problema del broadcasting de consumo mínimo en redes ad hoc ha sido bien estudiado en la literatura. El problema considera un modelo de antena que permite transmitir a cualquier potencia elegida (hasta un máximo establecido por el dispositivo). Sin embargo, cuando se trabaja de forma específica con redes de sensores, un vistazo al hardware actualmente disponible muestra que este modelo de antena no es demasiado realista. En este trabajo reformulamos el problema para el modelo de antena más habitual en redes de sensores. En este modelo, los niveles de potencia de transmisión se eligen de un conjunto finito de posibilidades. La siguiente contribución consiste en en la adaptación de un algoritmo de optimización por colonias de hormigas a la versión más realista del problema, también conocida como broadcasting de consumo mínimo con antenas realistas. Los resultados obtenidos muestran que la ventaja de este método sobre heurísticas clásicas incluso crece cuando el número de posibles potencias de transmisión decrece. Además, se ha presentado una versión distribuida del algoritmo, que también se compara de forma bastante favorable contra las heurísticas centralizadas conocidas

High-Power Simultaneous Wireless Information and Power Transfer System Based on an Injection-Locked Magnetron Phased Array

We built a phased array system for high-power simultaneous wireless information and power transfer (SWIPT) using four 5.8-GHz injection-locked magnetrons. In the magnetron injection-locked state, the transmission efficiency was measured at different modulation rates. The fluctuation in the transmission efficiency was not more than 0.5%. We observed that dynamic beamforming does not affect communication quality. Using the magnetron phased array system, SWIPT experiments revealed that a frequency modulated (FM) signal that carries a video camera signal is transmitted and decoded during dynamic beamforming. In this SWIPT system, the main lobe transfers power, and information can be demodulated in front of the magnetron phased array from −90° to 90°. The maximum transmitted microwave power of the proposed system is 1637 W