Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels

In this paper we propose and analyze a distributed algorithm for achieving globally optimal decisions, either estimation or detection, through a self-synchronization mechanism among linearly coupled integrators initialized with local measurements. We model the interaction among the nodes as a directed graph with weights (possibly) dependent on the radio channels and we pose special attention to the effect of the propagation delay occurring in the exchange of data among sensors, as a function of the network geometry. We derive necessary and sufficient conditions for the proposed system to reach a consensus on globally optimal decision statistics. One of the major results proved in this work is that a consensus is reached with exponential convergence speed for any bounded delay condition if and only if the directed graph is quasi-strongly connected. We provide a closed form expression for the global consensus, showing that the effect of delays is, in general, the introduction of a bias in the final decision. Finally, we exploit our closed form expression to devise a double-step consensus mechanism able to provide an unbiased estimate with minimum extra complexity, without the need to know or estimate the channel parameters.Comment: To be published on IEEE Transactions on Signal Processin

Synchronization in complex networks

Synchronization processes in populations of locally interacting elements are in the focus of intense research in physical, biological, chemical, technological and social systems. The many efforts devoted to understand synchronization phenomena in natural systems take now advantage of the recent theory of complex networks. In this review, we report the advances in the comprehension of synchronization phenomena when oscillating elements are constrained to interact in a complex network topology. We also overview the new emergent features coming out from the interplay between the structure and the function of the underlying pattern of connections. Extensive numerical work as well as analytical approaches to the problem are presented. Finally, we review several applications of synchronization in complex networks to different disciplines: biological systems and neuroscience, engineering and computer science, and economy and social sciences.Comment: Final version published in Physics Reports. More information available at http://synchronets.googlepages.com

Estudio de sincronización cooperativa en redes de sensores

En este informe se estudia cómo es posible utilizar redes de sensores inalámbricos (WSN), para la localización de determinados eventos. Se hace un estudio previo de cómo una red de sensores puede llegar a estar sincronizada de una manera cooperativa, interactuando todos los sensores de la red entre sí. Primero se realiza el estudio para la sincronización de dos sensores con frecuencias diferentes, viéndose los parámetros que intervienen para que esta sincronización se realice con éxito, y también los efectos que en ella se produce al añadirle ruido. Seguidamente, se realiza el estudio para la sincronización de redes de N sensores, de manera que interactúen entre ellos de forma cooperativa. Se observan las características de la sincronización cuando todos los sensores llegan a consenso y, después, se busca la forma para que el consenso tienda hacia un valor determinado por mutuo acuerdo de los sensores. Finalmente, a partir de las características obtenidas en el consenso de N sensores, se realiza una aplicación práctica para la localización de eventos por medio del consenso de estas redes de sensores inalámbricos.En aquest informe s'estudia com és possible utilitzar xarxes de sensors sense fils (WSN), per la localització de determinats esdeveniments. Es fa un estudi previ de com una xarxa de sensors pot arribar a estar sincronitzada de forma cooperativa, interactuant tots els sensors de la xarxa entre ells mateixos. Primer, es realitza l'estudi per la sincronització de dos sensors amb freqüències diferents, veient els paràmetres que intervenen per a que aquesta sincronització es realitzi amb èxit, i també els efectes que en ella es produeixen en afegir soroll. Posteriorment, es realitza l'estudi per a la sincronització de xarxes de N sensors, de manera que interactuïn entre ells de forma cooperativa. S'observen les característiques de la sincronització quan tots els sensors arriben a consens i, desprès, es troba la forma per que el consens tendeixi cap a un valor determinat per mutu acord dels sensors. Finalment, a partir de les característiques obtingudes en el consens de N sensors, es realitza una aplicació pràctica per a la localització de esdeveniments mitjançant el consens d'aquestes xarxes de sensors sense fils.In this report you will see the study about how it is possible to use the wireless sensor networks (WSN), to find the location of specifics events. There is a preliminary study about how a sensor network could be synchronized in a cooperative way, with all sensors network interacting between them. First of all, it will be the study to synchronize two sensors with different frequencies, looking at the parameters involved in order that this synchronization will be done with success, and to see as well the effects that will be produced after adding the noise factor. Then, the study will continue synchronizing N sensors network, in order they will interact between them in a cooperative way. We will see the characteristics of this synchronization when all sensors arrive to the consensus and, after that, it will be found the way in order the consensus trend will go to an specific value by common agreement of sensors. Finally, from the output found at the consensus of N sensors, it will be explained in a practical application how to find events by the consensus of these wireless sensors networks.Nota: Aquest document conté originàriament altre material i/o programari només consultable a la Biblioteca de Ciència i Tecnologia

Firefly-Inspired Synchronization in Swarms of Mobile Agents

Synchronization can be a necessary prerequisite to perform coordinated actions or reach consensus in decentralized multi-agent systems, such as robotic swarms and sensor networks. One of the simplest distributed synchronization algorithms is firefly synchronization, also known as pulse-coupled oscillator synchronization. In this framework, each agent possesses an internal oscillator and the completion of oscillation cycles is signaled by means of short pulses, which can be detected by other neighboring agents. This thesis focuses on a realistic mode of interaction for practical implementations, in which agents have a restricted field of view used to detect pulses emitted by other agents. The effect of agent speed on the time required to achieve synchronization is studied. Simulations reveal that synchronization can be fostered or inhibited by tuning the agent (robot) speed, leading to distinct dynamical regimes. These findings are further validated in physical robotic experiments. In addition, an analysis is presented on the effect that the involved system parameters have on the time it takes for the ensemble to synchronize. To assess the effect of noise, the propagation of perturbations over the system is analyzed. The reported findings reveal the conditions for the control of clock or activity synchronization in swarms of mobile agents

Neural dynamics of social behavior : An evolutionary and mechanistic perspective on communication, cooperation, and competition among situated agents

Social behavior can be found on almost every level of life, ranging from microorganisms to human societies. However, explaining the evolutionary emergence of cooperation, communication, or competition still challenges modern biology. The most common approaches to this problem are based on game-theoretic models. The problem is that these models often assume fixed and limited rules and actions that individual agents can choose from, which excludes the dynamical nature of the mechanisms that underlie the behavior of living systems. So far, there exists a lack of convincing modeling approaches to investigate the emergence of social behavior from a mechanistic and evolutionary perspective. Instead of studying animals, the methodology employed in this thesis combines several aspects from alternative approaches to study behavior in a rather novel way. Robotic models are considered as individual agents which are controlled by recurrent neural networks representing non-linear dynamical system. The topology and parameters of these networks are evolved following an open-ended evolution approach, that is, individuals are not evaluated on high-level goals or optimized for specific functions. Instead, agents compete for limited resources to enhance their chance of survival. Further, there is no restriction with respect to how individuals interact with their environment or with each other. As its main objective, this thesis aims at a complementary approach for studying not only the evolution, but also the mechanisms of basic forms of communication. For this purpose it can be shown that a robot does not necessarily have to be as complex as a human, not even as complex as a bacterium. The strength of this approach is that it deals with rather simple, yet complete and situated systems, facing similar real world problems as animals do, such as sensory noise or dynamically changing environments. The experimental part of this thesis is substantiated in a five-part examination. First, self-organized aggregation patterns are discussed. Second, the advantages of evolving decentralized control with respect to behavioral robustness and flexibility is demonstrated. Third, it is shown that only minimalistic local acoustic communication is required to coordinate the behavior of large groups. This is followed by investigations of the evolutionary emergence of communication. Finally, it is shown how already evolved communicative behavior changes during further evolution when a population is confronted with competition about limited environmental resources. All presented experiments entail thorough analysis of the dynamical mechanisms that underlie evolved communication systems, which has not been done so far in the context of cooperative behavior. This framework leads to a better understanding of the relation between intrinsic neurodynamics and observable agent-environment interactions. The results discussed here provide a new perspective on the evolution of cooperation because they deal with aspects largely neglected in traditional approaches, aspects such as embodiment, situatedness, and the dynamical nature of the mechanisms that underlie behavior. For the first time, it can be demonstrated how noise influences specific signaling strategies and that versatile dynamics of very small-scale neural networks embedded in sensory-motor feedback loops give rise to sophisticated forms of communication such as signal coordination, cooperative intraspecific communication, and, most intriguingly, aggressive interspecific signaling. Further, the results demonstrate the development of counteractive niche construction based on a modification of communication strategies which generates an evolutionary feedback resulting in an active reduction of selection pressure, which has not been shown so far. Thus, the novel findings presented here strongly support the complementary nature of robotic experiments to study the evolution and mechanisms of communication and cooperation.</p

Techniques for Decentralized and Dynamic Resource Allocation

abstract: This thesis investigates three different resource allocation problems, aiming to achieve two common goals: i) adaptivity to a fast-changing environment, ii) distribution of the computation tasks to achieve a favorable solution. The motivation for this work relies on the modern-era proliferation of sensors and devices, in the Data Acquisition Systems (DAS) layer of the Internet of Things (IoT) architecture. To avoid congestion and enable low-latency services, limits have to be imposed on the amount of decisions that can be centralized (i.e. solved in the ``cloud") and/or amount of control information that devices can exchange. This has been the motivation to develop i) a lightweight PHY Layer protocol for time synchronization and scheduling in Wireless Sensor Networks (WSNs), ii) an adaptive receiver that enables Sub-Nyquist sampling, for efficient spectrum sensing at high frequencies, and iii) an SDN-scheme for resource-sharing across different technologies and operators, to harmoniously and holistically respond to fluctuations in demands at the eNodeB' s layer. The proposed solution for time synchronization and scheduling is a new protocol, called PulseSS, which is completely event-driven and is inspired by biological networks. The results on convergence and accuracy for locally connected networks, presented in this thesis, constitute the theoretical foundation for the protocol in terms of performance guarantee. The derived limits provided guidelines for ad-hoc solutions in the actual implementation of the protocol. The proposed receiver for Compressive Spectrum Sensing (CSS) aims at tackling the noise folding phenomenon, e.g., the accumulation of noise from different sub-bands that are folded, prior to sampling and baseband processing, when an analog front-end aliasing mixer is utilized. The sensing phase design has been conducted via a utility maximization approach, thus the scheme derived has been called Cognitive Utility Maximization Multiple Access (CUMMA). The framework described in the last part of the thesis is inspired by stochastic network optimization tools and dynamics. While convergence of the proposed approach remains an open problem, the numerical results here presented suggest the capability of the algorithm to handle traffic fluctuations across operators, while respecting different time and economic constraints. The scheme has been named Decomposition of Infrastructure-based Dynamic Resource Allocation (DIDRA).Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

Localization and Optimization Problems for Camera Networks

In the framework of networked control systems, we focus on networks of autonomous PTZ cameras. A large set of cameras communicating each other through a network is a widely used architecture in application areas like video surveillance, tracking and motion. First, we consider relative localization in sensor networks, and we tackle the issue of investigating the error propagation, in terms of the mean error on each component of the optimal estimator of the position vector. The relative error is computed as a function of the eigenvalues of the network: using this formula and focusing on an exemplary class of networks (the Abelian Cayley networks), we study the role of the network topology and the dimension of the networks in the error characterization. Second, in a network of cameras one of the most crucial problems is calibration. For each camera this consists in understanding what is its position and orientation with respect to a global common reference frame. Well-known methods in computer vision permit to obtain relative positions and orientations of pairs of cameras whose sensing regions overlap. The aim is to propose an algorithm that, from these noisy input data makes the cameras complete the calibration task autonomously, in a distributed fashion. We focus on the planar case, formulating an optimization problem over the manifold SO(2). We propose synchronous deterministic and distributed algorithms that calibrate planar networks exploiting the cycle structure of the underlying communication graph. Performance analysis and numerical experiments are shown. Third, we propose a gossip-like randomized calibration algorithm, whose probabilistic convergence and numerical studies are provided. Forth and finally, we design surveillance trajectories for a network of calibrated autonomous cameras to detect intruders in an environment, through a continuous graph partitioning problem

Low-power epidemic communication in wireless ad hoc networks

Steen, M.R. van [Promotor]Voulgaris, S. [Copromotor

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