DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

A Robust Three Phase State Estimation for Distribution Networks

Electric power utilities are installing distribution automation systems (DAS) for better management and control of the distribution networks during the recent past. The success of DAS, largely depends on the availability of reliable database of the control centre and thus requires an efficient state estimation (SE) solution technique. This paper presents an efficient and robust three-phase SE algorithm for application to radial distribution networks. This method exploits the radial nature of the network and uses forward and backward propagation scheme to estimate the line flows, node voltage and loads at each node, based on the measured quantities. The SE cannot be executed without adequate number of measurements. The extension of the method to the network observability analysis and bad data detection is also discussed. The proposed method has been tested to analyze several practical distribution networks of various voltage levels and also having high R:X ratio of lines. The results for a typical network are presented for illustration purposes. © 2000 Elsevier Science S.A. All rights reserved.

Amplitude death in complex networks induced by environment

We present a mechanism for amplitude death in coupled nonlinear dynamical systems on a complex network having interactions with a common environment like external system. We develop a general stability analysis that is valid for any network topology and obtain the threshold values of coupling constants for the onset of amplitude death. An important outcome of our study is a universal relation between the critical coupling strength and the largest nonzero eigenvalue of the coupling matrix. Our results are fully supported by the detailed numerical analysis for different network topologies.

Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.

Insights into the Fold Organization of TIM Barrel from Interaction Energy Based Structure Networks

There are many well-known examples of proteins with low sequence similarity, adopting the same structural fold. This aspect of sequence-structure relationship has been extensively studied both experimentally and theoretically, however with limited success. Most of the studies consider remote homology or ``sequence conservation'' as the basis for their understanding. Recently ``interaction energy'' based network formalism (Protein Energy Networks (PENs)) was developed to understand the determinants of protein structures. In this paper we have used these PENs to investigate the common non-covalent interactions and their collective features which stabilize the TIM barrel fold. We have also developed a method of aligning PENs in order to understand the spatial conservation of interactions in the fold. We have identified key common interactions responsible for the conservation of the TIM fold, despite high sequence dissimilarity. For instance, the central beta barrel of the TIM fold is stabilized by long-range high energy electrostatic interactions and low-energy contiguous vdW interactions in certain families. The other interfaces like the helix-sheet or the helix-helix seem to be devoid of any high energy conserved interactions. Conserved interactions in the loop regions around the catalytic site of the TIM fold have also been identified, pointing out their significance in both structural and functional evolution. Based on these investigations, we have developed a novel network based phylogenetic analysis for remote homologues, which can perform better than sequence based phylogeny. Such an analysis is more meaningful from both structural and functional evolutionary perspective. We believe that the information obtained through the ``interaction conservation'' viewpoint and the subsequently developed method of structure network alignment, can shed new light in the fields of fold organization and de novo computational protein design.

Non-monotonic, distance-dependent relaxation of water in reverse micelles: Propagation of surface induced frustration along hydrogen bond networks

Layer-wise, distance-dependent orientational relaxation of water confined in reverse micelles (RM) is studied using theoretical and computational tools. We use both a newly constructed ``spins on a ring'' (SOR) Ising-type model (with Shore-Zwanzig rotational dynamics) and atomistic simulations with explicit water. Our study explores the effect of reverse micelle size and role of intermolecular correlations, compromised by the presence of a highly polar surface, on the distance (from the interface) dependence of water relaxation. The ``spins on a ring'' model can capture some aspects of distance dependence of relaxation, such as acceleration of orientational relaxation at intermediate layers. In atomistic simulations, layer-wise decomposition of hydrogen bond formation pattern clearly reveals that hydrogen bond arrangement of water at a certain distance away from the surface can remain frustrated due to the interaction with the polar surface head groups. This layer-wise analysis also reveals the presence of a non-monotonic slow relaxation component which can be attributed to this frustration effect and which is accentuated in small to intermediate size RMs. For large size RMs, the long time component decreases monotonically from the interface to the interior of the RMs with slowest relaxation observed at the interface. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4732095]

Bond Graph Modeling for Energy-Harvesting Wireless Sensor Networks

Researchers can use bond graph modeling, a tool that takes into account the energy conservation principle, to accurately assess the dynamic behavior of wireless sensor networks on a continuous basis.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

Co-evolution of content popularity and delivery in mobile P2P networks

Mobile P2P technology provides a scalable approach for content delivery to a large number of users on their mobile devices. In this work, we study the dissemination of a single item of content (e. g., an item of news, a song or a video clip) among a population of mobile nodes. Each node in the population is either a destination (interested in the content) or a potential relay (not yet interested in the content). There is an interest evolution process by which nodes not yet interested in the content (i.e., relays) can become interested (i.e., become destinations) on learning about the popularity of the content (i.e., the number of already interested nodes). In our work, the interest in the content evolves under the linear threshold model. The content is copied between nodes when they make random contact. For this we employ a controlled epidemic spread model. We model the joint evolution of the copying process and the interest evolution process, and derive joint fluid limit ordinary differential equations. We then study the selection of parameters under the content provider's control, for the optimization of various objective functions that aim at maximizing content popularity and efficient content delivery.