244 resultados para Network coordinator


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A person walks along a line (which could be an idealisation of a forest trail, for example), placing relays as he walks, in order to create a multihop network for connecting a sensor at a point along the line to a sink at the start of the line. The potential placement points are equally spaced along the line, and at each such location the decision to place or not to place a relay is based on link quality measurements to the previously placed relays. The location of the sensor is unknown apriori, and is discovered as the deployment agent walks. In this paper, we extend our earlier work on this class of problems to include the objective of achieving a 2-connected multihop network. We propose a network cost objective that is additive over the deployed relays, and accounts for possible alternate routing over the multiple available paths. As in our earlier work, the problem is formulated as a Markov decision process. Placement algorithms are obtained for two source location models, which yield a discounted cost MDP and an average cost MDP. In each case we obtain structural results for an optimal policy, and perform a numerical study that provides insights into the advantages and disadvantages of multi-connectivity. We validate the results obtained from numerical study experimentally in a forest-like environment.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Network theory has become an excellent method of choice through which biological data are smoothly integrated to gain insights into complex biological problems. Understanding protein structure, folding, and function has been an important problem, which is being extensively investigated by the network approach. Since the sequence uniquely determines the structure, this review focuses on the networks of non-covalently connected amino acid side chains in proteins. Questions in structural biology are addressed within the framework of such a formalism. While general applications are mentioned in this review, challenging problems which have demanded the attention of scientific community for a long time, such as allostery and protein folding, are considered in greater detail. Our aim has been to explore these important problems through the eyes of networks. Various methods of constructing protein structure networks (PSN) are consolidated. They include the methods based on geometry, edges weighted by different schemes, and also bipartite network of protein-nucleic acid complexes. A number of network metrics that elegantly capture the general features as well as specific features related to phenomena, such as allostery and protein model validation, are described. Additionally, an integration of network theory with ensembles of equilibrium structures of a single protein or that of a large number of structures from the data bank has been presented to perceive complex phenomena from network perspective. Finally, we discuss briefly the capabilities, limitations, and the scope for further explorations of protein structure networks.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Guided waves using piezo-electric wafer active sensors (PWAS) is one of the useful techniques of damage detection. Sensor network optimization with minimal network hardware footprint and maximal area of coverage remains a challenging problem. PWAS sensors are placed at discrete locations in order to inspect damages in plates and the idea has the potential to be extended to assembled structures. Various actuator-sensor configurations are possible within the network in order to identify and locate damages. In this paper we present a correlation based approach to monitor cracks emanating from rivet line using a simulated guided wave signal whose sensor is operating in pulse echo mode. Discussions regarding the identification of phase change due to reflections from the crack are also discussed in this paper.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.