Autonomous deployment and repair of a sensor network using an unmanned aerial vehicle

We describe a sensor network deployment method using autonomous flying robots. Such networks are suitable for tasks such as large-scale environmental monitoring or for command and control in emergency situations. We describe in detail the algorithms used for deployment and for measuring network connectivity and provide experimental data we collected from field trials. A particular focus is on determining gaps in connectivity of the deployed network and generating a plan for a second, repair, pass to complete the connectivity. This project is the result of a collaboration between three robotics labs (CSIRO, USC, and Dartmouth.).

Effect of dangling chains on the structure and physical properties of a tightly crosslinked poly(ethylene glycol) network

Major imperfections in crosslinked polymers include loose or dangling chain ends that lower the crosslink d., thereby reducing elastic recovery and increasing the solvent swelling. These imperfections are hard to detect, quantify and control when the network is initiated by free radical reactions. As an alternative approach, the sol-​gel synthesis of a model poly(ethylene glycol) (PEG-​2000) network is described using controlled amts. of bis- and mono-​triethoxy silyl Pr urethane PEG precursors to give silsesquioxane (SSQ, R-​SiO1.5) structures as crosslink junctions with a controlled no. of dangling chains. The effect of the no. of dangling chains on the structure and connectivity of the dried SSQ networks has been detd. by step-​crystn. differential scanning calorimetry. The role that micelle formation plays in controlling the sol-​gel PEG network connectivity has been studied by dynamic light scattering of the bis- and mono-​triethoxy silyl precursors and the networks have been characterized by 29Si solid state NMR, sol fraction and swelling measurements. These show that the dangling chains will increase the mesh size and water uptake. Compared to other end-​linked PEG hydrogels, the SSQ-​crosslinked networks show a low sol fraction and high connectivity, which reduces solvent swelling, degree of crystallinity and the crystal transition temp. The increased degree of freedom in segment movement on the addn. of dangling chains in the SSQ-​crosslinked network facilitates the packing process in crystn. of the dry network and, in the hydrogel, helps to accommodate more water mols. before reaching equil.

Connectivity-aware Routing in Sensor Networks

Sensor network applications such as environmental monitoring demand that the data collection process be carried out for the longest possible time. Our paper addresses this problem by presenting a routing scheme that ensures that the monitoring network remains connected and hence the live sensor nodes deliver data for a longer duration. We analyze the role of relay nodes (neighbours of the base-station) in maintaining network connectivity and present a routing strategy that, for a particular class of networks, approaches the optimal as the set of relay nodes becomes larger. We then use these findings to develop an appropriate distributed routing protocol using potential-based routing. The basic idea of potential-based routing is to define a (scalar) potential value at each node in the network and forward data to the neighbor with the highest potential. We propose a potential function and evaluate its performance through simulations. The results show that our approach performs better than the well known lifetime maximization policy proposed by Chang and Tassiulas (2004), as well as AODV [Adhoc on demand distance vector routing] proposed by Perkins (1997).

Identification of prospective locations for generation expansion with least augmentation of network

With ever increasing demand for electric energy, additional generation and associated transmission facilities has to be planned and executed. In order to augment existing transmission facilities, proper planning and selective decisions are to be made whereas keeping in mind the interests of several parties who are directly or indirectly involved. Common trend is to plan optimal generation expansion over the planning period in order to meet the projected demand with minimum cost capacity addition along with a pre-specified reliability margin. Generation expansion at certain locations need new transmission network which involves serious problems such as getting right of way, environmental clearance etc. In this study, an approach to the citing of additional generation facilities in a given system with minimum or no expansion in the transmission facility is attempted using the network connectivity and the concept of electrical distance for projected load demand. The proposed approach is suitable for large interconnected systems with multiple utilities. Sample illustration on real life system is presented in order to show how this approach improves the overall performance on the operation of the system with specified performance parameters.

Synconset Waves and Chains: Spiking Onsets in Synchronous Populations Predict and Are Predicted by Network Structure

Synfire waves are propagating spike packets in synfire chains, which are feedforward chains embedded in random networks. Although synfire waves have proved to be effective quantification for network activity with clear relations to network structure, their utilities are largely limited to feedforward networks with low background activity. To overcome these shortcomings, we describe a novel generalisation of synfire waves, and define `synconset wave' as a cascade of first spikes within a synchronisation event. Synconset waves would occur in `synconset chains', which are feedforward chains embedded in possibly heavily recurrent networks with heavy background activity. We probed the utility of synconset waves using simulation of single compartment neuron network models with biophysically realistic conductances, and demonstrated that the spread of synconset waves directly follows from the network connectivity matrix and is modulated by top-down inputs and the resultant oscillations. Such synconset profiles lend intuitive insights into network organisation in terms of connection probabilities between various network regions rather than an adjacency matrix. To test this intuition, we develop a Bayesian likelihood function that quantifies the probability that an observed synfire wave was caused by a given network. Further, we demonstrate it's utility in the inverse problem of identifying the network that caused a given synfire wave. This method was effective even in highly subsampled networks where only a small subset of neurons were accessible, thus showing it's utility in experimental estimation of connectomes in real neuronal-networks. Together, we propose synconset chains/waves as an effective framework for understanding the impact of network structure on function, and as a step towards developing physiology-driven network identification methods. Finally, as synconset chains extend the utilities of synfire chains to arbitrary networks, we suggest utilities of our framework to several aspects of network physiology including cell assemblies, population codes, and oscillatory synchrony.

Dynamic Network Mechanisms of Relational Integration

A prominent hypothesis states that specialized neural modules within the human lateral frontopolar cortices (LFPCs) support “relational integration” (RI), the solving of complex problems using inter-related rules. However, it has been proposed that LFPC activity during RI could reflect the recruitment of additional “domain-general” resources when processing more difficult problems in general as opposed to RI specifi- cally. Moreover, theoretical research with computational models has demonstrated that RI may be supported by dynamic processes that occur throughout distributed networks of brain regions as opposed to within a discrete computational module. Here, we present fMRI findings from a novel deductive reasoning paradigm that controls for general difficulty while manipulating RI demands. In accordance with the domain- general perspective, we observe an increase in frontoparietal activation during challenging problems in general as opposed to RI specifically. Nonetheless, when examining frontoparietal activity using analyses of phase synchrony and psychophysiological interactions, we observe increased network connectivity during RI alone. Moreover, dynamic causal modeling with Bayesian model selection identifies the LFPC as the effective connectivity source. Based on these results, we propose that during RI an increase in network connectivity and a decrease in network metastability allows rules that are coded throughout working memory systems to be dynamically bound. This change in connectivity state is top-down propagated via a hierarchical system of domain-general networks with the LFPC at the apex. In this manner, the functional network perspective reconciles key propositions of the globalist, modular, and computational accounts of RI within a single unified framework.

Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network

Differently from theoretical scale-free networks, most real networks present multi-scale behavior, with nodes structured in different types of functional groups and communities. While the majority of approaches for classification of nodes in a complex network has relied on local measurements of the topology/connectivity around each node, valuable information about node functionality can be obtained by concentric (or hierarchical) measurements. This paper extends previous methodologies based on concentric measurements, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities (departments of the University of Sao Paulo). Among the interesting obtained findings, we emphasize the scale-free nature of the network obtained, as well as identification of different patterns of authorship emerging from different areas (e.g. human and exact sciences). Another interesting result concerns the relatively uniform distribution of hubs along concentric levels, contrariwise to the non-uniform pattern found in theoretical scale-free networks such as the BA model. (C) 2008 Elsevier B.V. All rights reserved.

Predicting the connectivity of primate cortical networks from topological and spatial node properties

Abstract Background The organization of the connectivity between mammalian cortical areas has become a major subject of study, because of its important role in scaffolding the macroscopic aspects of animal behavior and intelligence. In this study we present a computational reconstruction approach to the problem of network organization, by considering the topological and spatial features of each area in the primate cerebral cortex as subsidy for the reconstruction of the global cortical network connectivity. Starting with all areas being disconnected, pairs of areas with similar sets of features are linked together, in an attempt to recover the original network structure. Results Inferring primate cortical connectivity from the properties of the nodes, remarkably good reconstructions of the global network organization could be obtained, with the topological features allowing slightly superior accuracy to the spatial ones. Analogous reconstruction attempts for the C. elegans neuronal network resulted in substantially poorer recovery, indicating that cortical area interconnections are relatively stronger related to the considered topological and spatial properties than neuronal projections in the nematode. Conclusion The close relationship between area-based features and global connectivity may hint on developmental rules and constraints for cortical networks. Particularly, differences between the predictions from topological and spatial properties, together with the poorer recovery resulting from spatial properties, indicate that the organization of cortical networks is not entirely determined by spatial constraints.

BRAIN ACTIVATION AND CONNECTIVITY IN NON-DISABLED MULTIPLE SCLEROSIS PATIENTS

Multiple sclerosis (MS) is the most common demyelinating disease affecting the central nervous system. There is no cure for MS and current therapies have limited efficacy. While the majority of individuals with MS develop significant clinical disability, a subset experiences a disease course with minimal impairment even in the presence of significant apparent tissue damage on magnetic resonance imaging (MRI). The current studies combined functional MRI and diffusion tensor imaging (DTI) to elucidate brain mechanisms associated with lack of clinical disability in patients with MS. Recent evidence has implicated cortical reorganization as a mechanism to limit the clinical manifestation of the disease. Functional MRI was used to test the hypothesis that non-disabled MS patients (Expanded Disability Status Scale ≤ 1.5) show increased recruitment of cognitive control regions (dorsolateral prefrontal and anterior cingulate cortex) while performing sensory, motor and cognitive tasks. Compared to matched healthy controls, patients increased activation of cognitive control brain regions when performing non-dominant hand movements and the 2-back working memory task. Using dynamic causal modeling, we tested whether increased cognitive control recruitment is associated with alterations in connectivity in the working memory functional network. Patients exhibited similar network connectivity to that of control subjects when performing working memory tasks. We subsequently investigated the integrity of major white matter tracts to assess structural connectivity and its relation to activation and functional integration of the cognitive control system. Patients showed substantial alterations in callosal, inferior and posterior white matter tracts and less pronounced involvement of the corticospinal tracts and superior longitudinal fasciculi (SLF). Decreased structural integrity within the right SLF in patients was associated with decreased performance, and decreased activation and connectivity of the cognitive control system when performing working memory tasks. These studies suggest that patient with MS without clinical disability increase cognitive control system recruitment across functional domains and rely on preserved functional and structural connectivity of brain regions associated with this network. Moreover, the current studies show the usefulness of combining brain activation data from functional MRI and structural connectivity data from DTI to improve our understanding of brain adaptation mechanisms to neurological disease.

Functional connectivity in BOLD and CBF data: similarity and reliability of resting brain networks

Resting-state functional connectivity (FC) fMRI (rs-fcMRI) offers an appealing approach to mapping the brain's intrinsic functional organization. Blood oxygen level dependent (BOLD) and arterial spin labeling (ASL) are the two main rs-fcMRI approaches to assess alterations in brain networks associated with individual differences, behavior and psychopathology. While the BOLD signal is stronger with a higher temporal resolution, ASL provides quantitative, direct measures of the physiology and metabolism of specific networks. This study systematically investigated the similarity and reliability of resting brain networks (RBNs) in BOLD and ASL. A 2×2×2 factorial design was employed where each subject underwent repeated BOLD and ASL rs-fcMRI scans on two occasions on two MRI scanners respectively. Both independent and joint FC analyses revealed common RBNs in ASL and BOLD rs-fcMRI with a moderate to high level of spatial overlap, verified by Dice Similarity Coefficients. Test-retest analyses indicated more reliable spatial network patterns in BOLD (average modal Intraclass Correlation Coefficients: 0.905±0.033 between-sessions; 0.885±0.052 between-scanners) than ASL (0.545±0.048; 0.575±0.059). Nevertheless, ASL provided highly reproducible (0.955±0.021; 0.970±0.011) network-specific CBF measurements. Moreover, we observed positive correlations between regional CBF and FC in core areas of all RBNs indicating a relationship between network connectivity and its baseline metabolism. Taken together, the combination of ASL and BOLD rs-fcMRI provides a powerful tool for characterizing the spatiotemporal and quantitative properties of RBNs. These findings pave the way for future BOLD and ASL rs-fcMRI studies in clinical populations that are carried out across time and scanners.

Altered resting-state EEG source functional connectivity in schizophrenia:the effect of illness duration

Despite the increasing body of evidence supporting the hypothesis of schizophrenia as a disconnection syndrome, studies of resting-state EEG Source Functional Connectivity (EEG-SFC) in people affected by schizophrenia are sparse. The aim of the present study was to investigate resting-state EEG-SFC in 77 stable, medicated patients with schizophrenia (SCZ) compared to 78 healthy volunteers (HV). In order to study the effect of illness duration, SCZ were divided in those with a short duration of disease (SDD; n = 25) and those with a long duration of disease (LDD; n = 52). Resting-state EEG recordings in eyes closed condition were analyzed and lagged phase synchronization (LPS) indices were calculated for each ROI pair in the source-space EEG data. In delta and theta bands, SCZ had greater EEG-SFC than HV; a higher theta band connectivity in frontal regions was observed in LDD compared with SDD. In the alpha band, SCZ showed lower frontal EEG-SFC compared with HV whereas no differences were found between LDD and SDD. In the beta1 band, SCZ had greater EEG-SFC compared with HVs and in the beta2 band, LDD presented lower frontal and parieto-temporal EEG-SFC compared with HV. In the gamma band, SDD had greater connectivity values compared with LDD and HV. This study suggests that resting state brain network connectivity is abnormally organized in schizophrenia, with different patterns for the different EEG frequency components and that EEG can be a powerful tool to further elucidate the complexity of such disordered connectivity.

Cooperative Proxying: An Approach to Reduce Network Energy Waste

A network connected host is expected to generate/respond to applications and protocols specific messages. Billions of Euro of electricity is wasted to keep idle hosts powered up 24/7 just to maintain network presence. This short paper describes the design of our cooperative Network Connectivity Proxy (NCP) that can impersonate sleeping hosts and responds to packets on their behalf as they were connected and fully operational. Thus, NCP is in fact an efficient approach to reduce network energy waste.

A secure authentication and key management scheme for Wireless Sensors Network

In recent years, the adaptation of Wireless Sensor Networks (WSNs) to application areas requiring mobility increased the security threats against confidentiality, integrity and privacy of the information as well as against their connectivity. Since, key management plays an important role in securing both information and connectivity, a proper authentication and key management scheme is required in mobility enabled applications where the authentication of a node with the network is a critical issue. In this paper, we present an authentication and key management scheme supporting node mobility in a heterogeneous WSN that consists of several low capabilities sensor nodes and few high capabilities sensor nodes. We analyze our proposed solution by using MATLAB (analytically) and by simulation (OMNET++ simulator) to show that it has less memory requirement and has good network connectivity and resilience against attacks compared to some existing schemes. We also propose two levels of secure authentication methods for the mobile sensor nodes for secure authentication and key establishment.

Bumps, breathers, and waves in a neural network with spike frequency adaptation

In this Letter we introduce a continuum model of neural tissue that include the effects of so-called spike frequency adaptation (SFA). The basic model is an integral equation for synaptic activity that depends upon the non-local network connectivity, synaptic response, and firing rate of a single neuron. A phenomenological model of SFA is examined whereby the firing rate is taken to be a simple state-dependent threshold function. As in the case without SFA classical Mexican-Hat connectivity is shown to allow for the existence of spatially localized states (bumps). Importantly an analysis of bump stability using recent Evans function techniques shows that bumps may undergo instabilities leading to the emergence of both breathers and traveling waves. Moreover, a similar analysis for traveling pulses leads to the conditions necessary to observe a stable traveling breather. Direct numerical simulations both confirm our theoretical predictions and illustrate the rich dynamic behavior of this model, including the appearance of self-replicating bumps.