Decoding Delay Minimization in Inter-Session Network Coding

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients over a wireline overlay network. We propose a novel framework for efficient rate allocation in networks where intermediate network nodes have the opportunity to combine packets from different sources using randomized network coding. We formulate the problem as the minimization of the average decoding delay in the client population and solve it with a gradient-based stochastic algorithm. Our optimized inter-session network coding solution is evaluated in different network topologies and is compared with basic intra-session network coding solutions. Our results show the benefits of proper coding decisions and effective rate allocation for lowering the decoding delay when the network is used by concurrent multicast sessions.

Context-Aware Adaptive Opportunistic Routing in Mobile Ad-hoc and Sensor Networks

Mobile ad-hoc networks (MANETs) and wireless sensor networks (WSNs) have been attracting increasing attention for decades due to their broad civilian and military applications. Basically, a MANET or WSN is a network of nodes connected by wireless communication links. Due to the limited transmission range of the radio, many pairs of nodes in MANETs or WSNs may not be able to communicate directly, hence they need other intermediate nodes to forward packets for them. Routing in such types of networks is an important issue and it poses great challenges due to the dynamic nature of MANETs or WSNs. On the one hand, the open-air nature of wireless environments brings many difficulties when an efficient routing solution is required. The wireless channel is unreliable due to fading and interferences, which makes it impossible to maintain a quality path from a source node to a destination node. Additionally, node mobility aggravates network dynamics, which causes frequent topology changes and brings significant overheads for maintaining and recalculating paths. Furthermore, mobile devices and sensors are usually constrained by battery capacity, computing and communication resources, which impose limitations on the functionalities of routing protocols. On the other hand, the wireless medium possesses inherent unique characteristics, which can be exploited to enhance transmission reliability and routing performance. Opportunistic routing (OR) is one promising technique that takes advantage of the spatial diversity and broadcast nature of the wireless medium to improve packet forwarding reliability in multihop wireless communication. OR combats the unreliable wireless links by involving multiple neighboring nodes (forwarding candidates) to choose packet forwarders. In opportunistic routing, a source node does not require an end-to-end path to transmit packets. The packet forwarding decision is made hop-by-hop in a fully distributed fashion. Motivated by the deficiencies of existing opportunistic routing protocols in dynamic environments such as mobile ad-hoc networks or wireless sensor networks, this thesis proposes a novel context-aware adaptive opportunistic routing scheme. Our proposal selects packet forwarders by simultaneously exploiting multiple types of cross-layer context information of nodes and environments. Our approach significantly outperforms other routing protocols that rely solely on a single metric. The adaptivity feature of our proposal enables network nodes to adjust their behaviors at run-time according to network conditions. To accommodate the strict energy constraints in WSNs, this thesis integrates adaptive duty-cycling mechanism to opportunistic routing for wireless sensor nodes. Our approach dynamically adjusts the sleeping intervals of sensor nodes according to the monitored traffic load and the estimated energy consumption rate. Through the integration of duty cycling of sensor nodes and opportunistic routing, our protocol is able to provide a satisfactory balance between good routing performance and energy efficiency for WSNs.

TARWIS - A Testbed Management Architecture for Wireless Sensor Network Testbeds

With research on Wireless Sensor Networks (WSNs) becoming more and more mature in the past five years, researchers from universities all over the world have set up testbeds of wireless sensor networks, in most cases to test and evaluate the real-world behavior of developed WSN protocol mechanisms. Although these testbeds differ heavily in the employed sensor node types and the general architectural set up, they all have similar requirements with respect to management and scheduling functionalities: as every shared resource, a testbed requires a notion of users, resource reservation features, support for reprogramming and reconfiguration of the nodes, provisions to debug and remotely reset sensor nodes in case of node failures, as well as a solution for collecting and storing experimental data. The TARWIS management architecture presented in this paper targets at providing these functionalities independent from node type and node operating system. TARWIS has been designed as a re-usable management solution for research and/or educational oriented research testbeds of wireless sensor networks, relieving researchers intending to deploy a testbed from the burden to implement their own scheduling and testbed management solutions from scratch.

Reduced Cerebral Blood Flow Within the Default-Mode Network and Within Total Gray Matter in Major Depression

The default-mode network (DMN) was shown to have aberrant blood oxygenation-level-dependent (BOLD) activity in major depressive disorder (MDD). While BOLD is a relative measure of neural activity, cerebral blood flow (CBF) is an absolute measure. Resting-state CBF alterations have been reported in MDD. However, the association of baseline CBF and CBF fluctuations is unclear in MDD. Therefore, the aim was to investigate the CBF within the DMN in MDD, applying a strictly data-driven approach. In 22 MDD patients and 22 matched healthy controls, CBF was acquired using arterial spin labeling (ASL) at rest. A concatenated independent component analysis was performed to identify the DMN within the ASL data. The perfusion of the DMN and its nodes was quantified and compared between groups. The DMN was identified in both groups with high spatial similarity. Absolute CBF values within the DMN were reduced in MDD patients (p<0.001). However, after controlling for whole-brain gray matter CBF and age, the group difference vanished. In patients, depression severity was correlated with reduced perfusion in the DMN in the posterior cingulate cortex and the right inferior parietal lobe. Hypoperfusion within the DMN in MDD is not specific to the DMN. Still, depression severity was linked to DMN node perfusion, supporting a role of the DMN in depression pathobiology. The finding has implications for the interpretation of BOLD functional magnetic resonance imaging data in MDD.

Quantitative measurements in 3-dimensional datasets of mouse lymph nodes resolve organ-wide functional dependencies

Deep tissue imaging has become state of the art in biology, but now the problem is to quantify spatial information in a global, organ-wide context. Although access to the raw data is no longer a limitation, the computational tools to extract biologically useful information out of these large data sets is still catching up. In many cases, to understand the mechanism behind a biological process, where molecules or cells interact with each other, it is mandatory to know their mutual positions. We illustrate this principle here with the immune system. Although the general functions of lymph nodes as immune sentinels are well described, many cellular and molecular details governing the interactions of lymphocytes and dendritic cells remain unclear to date and prevent an in-depth mechanistic understanding of the immune system. We imaged ex vivo lymph nodes isolated from both wild-type and transgenic mice lacking key factors for dendritic cell positioning and used software written in MATLAB to determine the spatial distances between the dendritic cells and the internal high endothelial vascular network. This allowed us to quantify the spatial localization of the dendritic cells in the lymph node, which is a critical parameter determining the effectiveness of an adaptive immune response.

UAVNet: A Mobile Wireless Mesh Network Using Unmanned Aerial Vehicles

We developed UAVNet, a framework for the autonomous deployment of a flying Wireless Mesh Network using small quadrocopter-based Unmanned Aerial Vehicles (UAVs). The flying wireless mesh nodes are automatically interconnected to each other and building an IEEE 802.11s wireless mesh network. The implemented UAVNet prototype is able to autonomously interconnect two end systems by setting up an airborne relay, consisting of one or several flying wireless mesh nodes. The developed software includes basic functionality to control the UAVs and to setup, deploy, manage, and monitor a wireless mesh network. Our evaluations have shown that UAVNet can significantly improve network performance.

Opportunistic Content-Centric Data Transmission During Short Network Contacts

In this paper, we investigate content-centric data transmission in the context of short opportunistic contacts and base our work on an existing content-centric networking architecture. In case of short interconnection times, file transfers may not be completed and the received information is discarded. Caches in content-centric networks are used for short-term storage and do not guarantee persistence. We implemented a mechanism to extend caching on persistent storage enabling the completion of disrupted content transfers. The mechanisms have been implemented in the CCNx framework and have been evaluated on wireless mesh nodes. Our evaluations using multicast and unicast communication show that the implementation can support content transfers in opportunistic environments without significant processing and storing overhead.

Approximate decoding approaches for network coded correlated data

This paper considers a framework where data from correlated sources are transmitted with the help of network coding in ad hoc network topologies. The correlated data are encoded independently at sensors and network coding is employed in the intermediate nodes in order to improve the data delivery performance. In such settings, we focus on the problem of reconstructing the sources at decoder when perfect decoding is not possible due to losses or bandwidth variations. We show that the source data similarity can be used at decoder to permit decoding based on a novel and simple approximate decoding scheme. We analyze the influence of the network coding parameters and in particular the size of finite coding fields on the decoding performance. We further determine the optimal field size that maximizes the expected decoding performance as a trade-off between information loss incurred by limiting the resolution of the source data and the error probability in the reconstructed data. Moreover, we show that the performance of the approximate decoding improves when the accuracy of the source model increases even with simple approximate decoding techniques. We provide illustrative examples showing how the proposed algorithm can be deployed in sensor networks and distributed imaging applications.

Epileptic seizures as condensed sleep: an analysis of network dynamics from electroencephalogram signals

Both deepening sleep and evolving epileptic seizures are associated with increasing slow-wave activity. Larger-scale functional networks derived from electroencephalogram indicate that in both transitions dramatic changes of communication between brain areas occur. During seizures these changes seem to be 'condensed', because they evolve more rapidly than during deepening sleep. Here we set out to assess quantitatively functional network dynamics derived from electroencephalogram signals during seizures and normal sleep. Functional networks were derived from electroencephalogram signals from wakefulness, light and deep sleep of 12 volunteers, and from pre-seizure, seizure and post-seizure time periods of 10 patients suffering from focal onset pharmaco-resistant epilepsy. Nodes of the functional network represented electrical signals recorded by single electrodes and were linked if there was non-random cross-correlation between the two corresponding electroencephalogram signals. Network dynamics were then characterized by the evolution of global efficiency, which measures ease of information transmission. Global efficiency was compared with relative delta power. Global efficiency significantly decreased both between light and deep sleep, and between pre-seizure, seizure and post-seizure time periods. The decrease of global efficiency was due to a loss of functional links. While global efficiency decreased significantly, relative delta power increased except between the time periods wakefulness and light sleep, and pre-seizure and seizure. Our results demonstrate that both epileptic seizures and deepening sleep are characterized by dramatic fragmentation of larger-scale functional networks, and further support the similarities between sleep and seizures.

Distributed Rate Allocation in Inter-Session Network Coding

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all clients. A rate allocation problem is solved by every user, which seeks the rates that minimize the average decoding delay for its children and for itself. Since this optimization problem is a priori non-convex, we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every user needs to collect for decoding. We then decompose our original rate allocation problem into a set of convex subproblems, which are eventually combined to obtain an effective approximate solution to the delay minimization problem. The results demonstrate that the proposed scheme eliminates the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources. We validate the performance of our distributed rate allocation algorithm in different video streaming scenarios using the NS-3 network simulator. We show that our system is able to take benefit of inter-session network coding for simultaneous delivery of video sessions in networks with path diversity.

Validation of network communicability metrics for the analysis of brain structural networks.

Computational network analysis provides new methods to analyze the brain's structural organization based on diffusion imaging tractography data. Networks are characterized by global and local metrics that have recently given promising insights into diagnosis and the further understanding of psychiatric and neurologic disorders. Most of these metrics are based on the idea that information in a network flows along the shortest paths. In contrast to this notion, communicability is a broader measure of connectivity which assumes that information could flow along all possible paths between two nodes. In our work, the features of network metrics related to communicability were explored for the first time in the healthy structural brain network. In addition, the sensitivity of such metrics was analysed using simulated lesions to specific nodes and network connections. Results showed advantages of communicability over conventional metrics in detecting densely connected nodes as well as subsets of nodes vulnerable to lesions. In addition, communicability centrality was shown to be widely affected by the lesions and the changes were negatively correlated with the distance from lesion site. In summary, our analysis suggests that communicability metrics that may provide an insight into the integrative properties of the structural brain network and that these metrics may be useful for the analysis of brain networks in the presence of lesions. Nevertheless, the interpretation of communicability is not straightforward; hence these metrics should be used as a supplement to the more standard connectivity network metrics.

Assessing the function of the fronto-parietal attention network: Insights from resting-state fMRI and the attentional network test

In the recent past, various intrinsic connectivity networks (ICN) have been identified in the resting brain. It has been hypothesized that the fronto-parietal ICN is involved in attentional processes. Evidence for this claim stems from task-related activation studies that show a joint activation of the implicated brain regions during tasks that require sustained attention. In this study, we used functional magnetic resonance imaging (fMRI) to demonstrate that functional connectivity within the fronto-parietal network at rest directly relates to attention. We applied graph theory to functional connectivity data from multiple regions of interest and tested for associations with behavioral measures of attention as provided by the attentional network test (ANT), which we acquired in a separate session outside the MRI environment. We found robust statistical associations with centrality measures of global and local connectivity of nodes within the network with the alerting and executive control subfunctions of attention. The results provide further evidence for the functional significance of ICN and the hypothesized role of the fronto-parietal attention network. Hum Brain Mapp , 2013. © 2013 Wiley Periodicals, Inc.

Content-Aware Delivery of Scalable Video in Network Coding Enabled Named Data Networks

In this work, we propose a novel network coding enabled NDN architecture for the delivery of scalable video. Our scheme utilizes network coding in order to address the problem that arises in the original NDN protocol, where optimal use of the bandwidth and caching resources necessitates the coordination of the forwarding decisions. To optimize the performance of the proposed network coding based NDN protocol and render it appropriate for transmission of scalable video, we devise a novel rate allocation algorithm that decides on the optimal rates of Interest messages sent by clients and intermediate nodes. This algorithm guarantees that the achieved flow of Data objects will maximize the average quality of the video delivered to the client population. To support the handling of Interest messages and Data objects when intermediate nodes perform network coding, we modify the standard NDN protocol and introduce the use of Bloom filters, which store efficiently additional information about the Interest messages and Data objects. The proposed architecture is evaluated for transmission of scalable video over PlanetLab topologies. The evaluation shows that the proposed scheme performs very close to the optimal performance

An Application-Layer RESTful Sleepy Nodes Implementation For Internet of Things Systems

Two of the main issues in wireless industrial Internet of Things applications are interoperability and network lifetime. In this work we extend a semantic interoperability platform and introduce an application-layer sleepy nodes protocol that can leverage on information stored in semantic repositories. We propose an integration platform for managing the sleep states and an application layer protocol based upon the Constraint Application Layer protocol. We evaluate our system on windowing based task allocation strategies, aiming for lower overall energy consumption that results in higher network lifetime.

A Thalamic-Fronto-Parietal Structural Covariance Network Emerging in the Course of Recovery from Hand Paresis after Ischemic Stroke.

AIM To describe structural covariance networks of gray matter volume (GMV) change in 28 patients with first-ever stroke to the primary sensorimotor cortices, and to investigate their relationship to hand function recovery and local GMV change. METHODS Tensor-based morphometry maps derived from high-resolution structural images were subject to principal component analyses to identify the networks. We calculated correlations between network expression and local GMV change, sensorimotor hand function and lesion volume. To verify which of the structural covariance networks of GMV change have a significant relationship to hand function, we performed an additional multivariate regression approach. RESULTS Expression of the second network, explaining 9.1% of variance, correlated with GMV increase in the medio-dorsal (md) thalamus and hand motor skill. Patients with positive expression coefficients were distinguished by significantly higher GMV increase of this structure during stroke recovery. Significant nodes of this network were located in md thalamus, dorsolateral prefrontal cortex, and higher order sensorimotor cortices. Parameter of hand function had a unique relationship to the network and depended on an interaction between network expression and lesion volume. Inversely, network expression is limited in patients with large lesion volumes. CONCLUSION Chronic phase of sensorimotor cortical stroke has been characterized by a large scale co-varying structural network in the ipsilesional hemisphere associated specifically with sensorimotor hand skill. Its expression is related to GMV increase of md thalamus, one constituent of the network, and correlated with the cortico-striato-thalamic loop involved in control of motor execution and higher order sensorimotor cortices. A close relation between expression of this network with degree of recovery might indicate reduced compensatory resources in the impaired subgroup.