Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Visual pattern recognition network: Its training algorithm and its optoelectronic architecture

A visual pattern recognition network and its training algorithm are proposed. The network constructed of a one-layer morphology network and a two-layer modified Hamming net. This visual network can implement invariant pattern recognition with respect to image translation and size projection. After supervised learning takes place, the visual network extracts image features and classifies patterns much the same as living beings do. Moreover we set up its optoelectronic architecture for real-time pattern recognition. (C) 1996 Optical Society of America

Optical two-dimensional SW-banyan network: Optical implementation, routing control, and determination of permissible permutations

A 2-D SW-banyan network is introduced by properly folding the 1-D SW-banyan network, and its corresponding optical setup is proposed by means of polarizing beamsplitters and 2-D phase spatial light modulators. Then, based on the characteristics and the proposed optical setup, the control for the routing path between any source-destination pair is given, and the method to determine whether a given permutation is permissible or not is discussed. Because the proposed optical setup consists of only optical polarization elements, it is compact in structure, its corresponding energy loss and crosstalk are low, and its corresponding available number of channels is high. (C) 1996 Society of Photo-Optical Instrumentation Engineers.

Routing scheme, permutation properties, and optical implementation of a four-shuffle-exchange-based Omega network

The routing scheme and some permutation properties of a four-shuffle-exchange-based Omega network are discussed. The corresponding optical setup, which is composed of 2-D phase spatial light modulators and calcite plates, is proposed and demonstrated through mapping the inputs to a 2-D array. Instead of one shuffle-exchange followed by one switching operation as in ordinary Omega networks, in our presented system, the shuffle interconnection embraced in the switches is accomplished simply by varying the switching structure of each stage. For the proposed polarization-optical modules, the system is compact in structure, efficient in performance, and insensitive to the environment. (C) 1997 Society of Photo-Optical Instrumentation Engineers.

A Unifying model of strategic network formation

Documento de trabajo

Efficiency vs. Stability in a Mixed Network Formation Model

Documentos de Trabajo

Antikörper: Diseño e implementación de un sistema de detección de intrusos inalámbrico basado en Network IDS

[ES]Este proyecto, fruto de mi Trabajo Fin de Grado, pretende describir los aspectos más relevantes de los Wireless Intrusion Detection System (WIDS), tales como su historia, funcionamiento, arquitecturas, implementación o futuro. Tras esto, se expondrá el objetivo principal del proyecto. Proponer una arquitectura genérica para los WIDS y crear Antikörper, un WIDS basado en Network IDS completamente funcional, que cubra totalmente las necesidades de seguridad actuales en las redes Wireless LAN y sea adaptable a futuras revisiones.

The impact of liberalizing cost-saharing on basic models of network formation

This paper studies the impact of "liberalizing " the cost-sharing of links on some basic models of network formation. This is done in a setting where both doubly supported and singly supported links are possible, and which includes the two seminal models of network formation by Jackson and Wolinsky and Bala and Goyal as extreme cases. In this setting, the notion of pairwise stability is extended and it is proved that liberalizing cost-sharing for doubly supported links widens the range of values of the parameters where the efficient networks formed by such type of links are pairwise stable, while the range of values of the parameters where the efficient networks formed by singly supported links are pairwise stable shrinks, but the region where the latter are e¢ cient and pairwise stable remains the same.

Landscape Genetics for the Empirical Assessment of Resistance Surfaces: The European Pine Marten (Martes martes) as a Target-Species of a Regional Ecological Network

Coherent ecological networks (EN) composed of core areas linked by ecological corridors are being developed worldwide with the goal of promoting landscape connectivity and biodiversity conservation. However, empirical assessment of the performance of EN designs is critical to evaluate the utility of these networks to mitigate effects of habitat loss and fragmentation. Landscape genetics provides a particularly valuable framework to address the question of functional connectivity by providing a direct means to investigate the effects of landscape structure on gene flow. The goals of this study are (1) to evaluate the landscape features that drive gene flow of an EN target species (European pine marten), and (2) evaluate the optimality of a regional EN design in providing connectivity for this species within the Basque Country (North Spain). Using partial Mantel tests in a reciprocal causal modeling framework we competed 59 alternative models, including isolation by distance and the regional EN. Our analysis indicated that the regional EN was among the most supported resistance models for the pine marten, but was not the best supported model. Gene flow of pine marten in northern Spain is facilitated by natural vegetation, and is resisted by anthropogenic landcover types and roads. Our results suggest that the regional EN design being implemented in the Basque Country will effectively facilitate gene flow of forest dwelling species at regional scale.