National Library of Energy BETA

Sample records for hp network node

  1. Reconfigureable network node

    DOE Patents [OSTI]

    Vanderveen, Keith B. (Tracy, CA); Talbot, Edward B. (Livermore, CA); Mayer, Laurence E. (Davis, CA)

    2008-04-08

    Nodes in a network having a plurality of nodes establish communication links with other nodes using available transmission media, as the ability to establish such links becomes available and desirable. The nodes predict when existing communications links will fail, become overloaded or otherwise degrade network effectiveness and act to establish substitute or additional links before the node's ability to communicate with the other nodes on the network is adversely affected. A node stores network topology information and programmed link establishment rules and criteria. The node evaluates characteristics that predict existing links with other nodes becoming unavailable or degraded. The node then determines whether it can form a communication link with a substitute node, in order to maintain connectivity with the network. When changing its communication links, a node broadcasts that information to the network. Other nodes update their stored topology information and consider the updated topology when establishing new communications links for themselves.

  2. Modular sensor network node

    DOE Patents [OSTI]

    Davis, Jesse Harper Zehring (Berkeley, CA); Stark, Jr., Douglas Paul (Tracy, CA); Kershaw, Christopher Patrick (Hayward, CA); Kyker, Ronald Dean (Livermore, CA)

    2008-06-10

    A distributed wireless sensor network node is disclosed. The wireless sensor network node includes a plurality of sensor modules coupled to a system bus and configured to sense a parameter. The parameter may be an object, an event or any other parameter. The node collects data representative of the parameter. The node also includes a communication module coupled to the system bus and configured to allow the node to communicate with other nodes. The node also includes a processing module coupled to the system bus and adapted to receive the data from the sensor module and operable to analyze the data. The node also includes a power module connected to the system bus and operable to generate a regulated voltage.

  3. Infrastructure for Testing Nodes of a Wireless Sensor Network

    E-Print Network [OSTI]

    Zilic, Zeljko

    , low energy wireless sensor network (WSN) nodes is a major concern. One way to maintain a reliable. To further reduce test energy, compression algorithms compatible with WSN nodes are explored for use on test circuitry applied to a WSN node. INTRODUCTION Wireless sensor networks (WSN) have become available for use

  4. Cooperative Replication in Content Networks with Nodes under Churn

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    Cooperative Replication in Content Networks with Nodes under Churn Eva Jaho, Ioannis Koukoutsidis the access cost for all nodes. Such a network also has to deal with churn, i.e. random "join" and "leave" events of nodes in the group. Churn induces instability and has a major impact on cooperation efficiency

  5. Optimal Node Density for Detection in Energy Constrained Random Networks

    E-Print Network [OSTI]

    Anandkumar, Animashree

    1 Optimal Node Density for Detection in Energy Constrained Random Networks Animashree Anandkumar node density tends to infinity under any feasible average energy constraint. On the other hand, when of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint

  6. IEEE 342 Node Low Voltage Networked Test System

    SciTech Connect (OSTI)

    Schneider, Kevin P.; Phanivong, Phillippe K.; Lacroix, Jean-Sebastian

    2014-07-31

    The IEEE Distribution Test Feeders provide a benchmark for new algorithms to the distribution analyses community. The low voltage network test feeder represents a moderate size urban system that is unbalanced and highly networked. This is the first distribution test feeder developed by the IEEE that contains unbalanced networked components. The 342 node Low Voltage Networked Test System includes many elements that may be found in a networked system: multiple 13.2kV primary feeders, network protectors, a 120/208V grid network, and multiple 277/480V spot networks. This paper presents a brief review of the history of low voltage networks and how they evolved into the modern systems. This paper will then present a description of the 342 Node IEEE Low Voltage Network Test System and power flow results.

  7. Performance of wireless sensor networks under random node failures

    SciTech Connect (OSTI)

    Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Feng, Pan [Los Alamos National Laboratory

    2011-01-28

    Networks are essential to the function of a modern society and the consequence of damages to a network can be large. Assessing network performance of a damaged network is an important step in network recovery and network design. Connectivity, distance between nodes, and alternative routes are some of the key indicators to network performance. In this paper, random geometric graph (RGG) is used with two types of node failure, uniform failure and localized failure. Since the network performance are multi-facet and assessment can be time constrained, we introduce four measures, which can be computed in polynomial time, to estimate performance of damaged RGG. Simulation experiments are conducted to investigate the deterioration of networks through a period of time. With the empirical results, the performance measures are analyzed and compared to provide understanding of different failure scenarios in a RGG.

  8. Neural node network and model, and method of teaching same

    DOE Patents [OSTI]

    Parlos, Alexander G. (College Station, TX); Atiya, Amir F. (College Station, TX); Fernandez, Benito (Austin, TX); Tsai, Wei K. (Irvine, CA); Chong, Kil T. (College Station, TX)

    1995-01-01

    The present invention is a fully connected feed forward network that includes at least one hidden layer 16. The hidden layer 16 includes nodes 20 in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device 24 occurring in the feedback path 22 (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit 36 from all the other nodes within the same layer 16. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing.

  9. Neural node network and model, and method of teaching same

    DOE Patents [OSTI]

    Parlos, A.G.; Atiya, A.F.; Fernandez, B.; Tsai, W.K.; Chong, K.T.

    1995-12-26

    The present invention is a fully connected feed forward network that includes at least one hidden layer. The hidden layer includes nodes in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device occurring in the feedback path (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit from all the other nodes within the same layer. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing. 21 figs.

  10. Demo Abstract: Twonet -Large-Scale Wireless Sensor Network Testbed with Dual-Radio Nodes

    E-Print Network [OSTI]

    Gnawali, Omprakash

    radios. These nodes are managed by a network of 20 Raspberry Pi nodes at tier 2 and a PC server at tier 1

  11. Ranking nodes in growing networks: When PageRank fails

    E-Print Network [OSTI]

    Mariani, Manuel Sebastian; Zhang, Yi-Cheng

    2015-01-01

    PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm's efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank's performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

  12. The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

    SciTech Connect (OSTI)

    Kim, M; Leskovec, J

    2011-11-14

    Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

  13. U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities

    Broader source: Energy.gov [DOE]

    Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS).

  14. Node-level Energy Management for Sensor Networks in the Presence of Multiple Applications

    E-Print Network [OSTI]

    Athanassios Boulis; Mani Srivastava

    2004-01-01

    that solves the energy management problem at the node levelNode-level Energy Management for Sensor Networks in theto the absence of energy management, for a variety of

  15. Timing Synchronization at the Relay Node in Physical Layer Network Coding 

    E-Print Network [OSTI]

    Basireddy, Ashish

    2012-07-16

    In recent times, there has been an increased focus on the problem of information exchange between two nodes using a relay node. The introduction of physical layer network coding has improved the throughput efficiency of ...

  16. Determining a bisection bandwidth for a multi-node data communications network

    DOE Patents [OSTI]

    Faraj, Ahmad A. (Rochester, MN)

    2010-01-26

    Methods, systems, and products are disclosed for determining a bisection bandwidth for a multi-node data communications network that include: partitioning nodes in the network into a first sub-network and a second sub-network in dependence upon a topology of the network; sending, by each node in the first sub-network to a destination node in the second sub-network, a first message having a predetermined message size; receiving, by each node in the first sub-network from a source node in the second sub-network, a second message; measuring, by each node in the first sub-network, the elapsed communications time between the sending of the first message and the receiving of the second message; selecting the longest elapsed communications time; and calculating the bisection bandwidth for the network in dependence upon the number of the nodes in the first sub-network, the predetermined message size of the first test message, and the longest elapsed communications time.

  17. Handling Failures of Static Sensor Nodes in Wireless Sensor Network by Use of Mobile Sensors

    E-Print Network [OSTI]

    Wagner, Flávio Rech

    usage and applicability of Wireless Sensor Networks (WSN) [1] [2]. Nevertheless, sensor nodes can fail, and influence WSN dependability [3]. In order to face this problem, and exploring the fact that WSN use several of nodes that in general compose a WSN provides good results. Neighbor nodes can monitor each others

  18. Performance of Wireless Networks with Hidden Nodes: A Queuing-Theoretic Analysis

    E-Print Network [OSTI]

    Starobinski, David

    challenges" in fu- ture wireless architectures. Although some hid- den node mitigation techniques do exist performance. Instead, most previous works have focused on hid- den node mitigation techniques, see [7] and ref their applicability to predict the performance of IEEE 802.11 networks with hidden nodes. The simulation and analysis

  19. Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes

    E-Print Network [OSTI]

    Wiedermann, Marc; Kurths, Jürgen; Donner, Reik V

    2015-01-01

    Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their macroscopic properties. Here, we propose a hierarchy of null models to generate random surrogates from a given spatially embedded network that can preserve global and local statistics associated with the nodes' embedding in a metric space. Comparing the original network's and the resulting surrogates' global characteristics allows to quantify to what extent these characteristics are already predetermined by the spatial embedding of the nodes and links. We apply our framework to various real-world spatial networks and show that the proposed models capture macroscopic properties of the networks under study much better than standard random network models that do not account for the nodes' spatial embedding. Depending on the actual performance of the proposed null models, the networks...

  20. On the Placement of RF Energy Harvesting Node in Wireless Networks with Secrecy Considerations

    E-Print Network [OSTI]

    Zhou, Xiangyun "Sean"

    On the Placement of RF Energy Harvesting Node in Wireless Networks with Secrecy Considerations Biao of harvesting wireless energy, it is desirable to have the EH node located close to the transmitter. However approach to reduce the energy consumption and prolong the lifetime of wireless networks. Apart from

  1. Modeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks

    E-Print Network [OSTI]

    Sikdar, Biplab

    Modeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks Alireza Seyedi for energy harvesting nodes in wireless sensor networks is proposed. Using the pre- sented model, the probability of event loss due to energy run out as well as an analytical vulnerability metric, namely average

  2. Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

    Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes Vinod Sharma at that time at the node. For such networks we develop efficient energy management policies. First for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay

  3. Wireless Sensor Networks - Node Localization for Various Industry Problems

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Derr, Kurt; Manic, Milos

    2015-01-01

    Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.

  4. Wireless Sensor Networks - Node Localization for Various Industry Problems

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Derr, Kurt; Manic, Milos

    2015-06-01

    Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore »(AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

  5. Critical Node Identification of Smart Power System Using Complex Network Framework Based

    E-Print Network [OSTI]

    Pota, Himanshu Roy

    transmission networks, in which a DC power flow model and overloading of lines is embedded into the traditional or node removal can cause serious impact on normal system operation. Removal of transmission lines from characteristics and complex network theory together. Particularly, electric power networks are quite different

  6. On the Effects of Node Density and Duty Cycle on Energy Efficiency in Underwater Networks

    E-Print Network [OSTI]

    Stojanovic, Milica

    networks, with low or high traffic, call for the development of flexible networking solutions. Because in the design of underwater acoustic networks is energy efficiency, since the nodes are of- ten powered in [5], taking into account the relationship between distance, frequency, and transmission power [6

  7. Virtual Iron Network Head node (currently not being used)

    E-Print Network [OSTI]

    Miller, Russ

    . Installation of UB's version of Fedora Linux on the nodes. This is accomplished by inserting an operating this information from UBIT office. 8. You are finished installing UB's version of Fedora Linux. Virtual Iron 1

  8. Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

    DOE Patents [OSTI]

    Napolitano, L.M. Jr.

    1995-11-28

    The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.

  9. Efficient Sensor Node Authentication via 3GPP Mobile Communication Networks

    E-Print Network [OSTI]

    Kim, Kwangjo

    , 3G-WSN 1. INTRODUCTION As a de facto standard for the wireless sensor networks (WSNs), Zigbee [3 smartphone as a mobile device (MD) has GAA module and Zigbee module. The network consists of mobile network

  10. Synchronization in node of complex networks consist of complex chaotic system

    SciTech Connect (OSTI)

    Wei, Qiang, E-mail: qiangweibeihua@163.com [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, 116024 (China); Xie, Cheng-jun [Beihua University computer and technology College, BeiHua University, Jilin, 132021, Jilin (China); Digital Images Processing Institute of Beihua University, BeiHua University, Jilin, 132011, Jilin (China); Liu, Hong-jun [School of Information Engineering, Weifang Vocational College, Weifang, 261041 (China); Li, Yan-hui [The Library, Weifang Vocational College, Weifang, 261041 (China)

    2014-07-15

    A new synchronization method is investigated for node of complex networks consists of complex chaotic system. When complex networks realize synchronization, different component of complex state variable synchronize up to different scaling complex function by a designed complex feedback controller. This paper change synchronization scaling function from real field to complex field for synchronization in node of complex networks with complex chaotic system. Synchronization in constant delay and time-varying coupling delay complex networks are investigated, respectively. Numerical simulations are provided to show the effectiveness of the proposed method.

  11. Comparing Trust Mechanisms for Monitoring Aggregator Nodes in Sensor Networks

    E-Print Network [OSTI]

    Sen, Sandip

    The University of Tulsa Tulsa, OK oly-mistry@utulsa.edu Anil Gürsel The University of Tulsa Tulsa, OK anil-gursel@utulsa.edu Sandip Sen The University of Tulsa Tulsa, OK sandip@utulsa.edu ABSTRACT Sensor nodes are often used

  12. Impact of Node Heterogeneity in ZigBee Mesh Network Routing

    E-Print Network [OSTI]

    Chen, Ling-Jyh

    Impact of Node Heterogeneity in ZigBee Mesh Network Routing Nia-Chiang Liang1, Ping-Chieh Chen1-WPAN standard, the ZigBee standard has been proposed to interconnect simple, low rate, and battery powered wireless devices. The deploy- ment of ZigBee networks is expected to facilitate numerous applications

  13. On Cooperation in Energy Efficient Wireless Networks: The Role of Altruistic Nodes

    E-Print Network [OSTI]

    El-Gamal, Hesham

    1 On Cooperation in Energy Efficient Wireless Networks: The Role of Altruistic Nodes Lifeng Lai valuable energy in forwarding packets for other users. To analyze this problem, a non-cooperative game at the application layer. Keywords: cooperation, energy efficiency, ad-hoc networks, selfish and altruistic users

  14. Manipulation of Nodes in a Connected Car Network Henry Hexmoor1

    E-Print Network [OSTI]

    Hexmoor, Henry

    Manipulation of Nodes in a Connected Car Network Henry Hexmoor1 , Guy Fraker2 1 Computer Science and communicate on motorways. The technology cars maintain connections and communicate via Wi-Fi. The Connected cars initiative envisions cars that form a dynamic social network. Each car exchanges local information

  15. Malicious Node Detection in Wireless Sensor Networks using Weighted Trust Evaluation

    E-Print Network [OSTI]

    Chen, Yu

    network. Another concern is about energy efficiency. In a WSN, each sensor node may need to support battery lifetime, security mechanisms for sensor networks must be energy efficient [19]. Especially such as limited battery lifetime, memory space and computing capability. It is critical to detect and isolate

  16. Cluster synchronization induced by one-node clusters in networks with asymmetric negative couplings

    SciTech Connect (OSTI)

    Zhang, Jianbao [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China)] [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China); Ma, Zhongjun, E-mail: mzj1234402@163.com [School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China)] [School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China); Zhang, Gang [College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024 (China)] [College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024 (China)

    2013-12-15

    This paper deals with the problem of cluster synchronization in networks with asymmetric negative couplings. By decomposing the coupling matrix into three matrices, and employing Lyapunov function method, sufficient conditions are derived for cluster synchronization. The conditions show that the couplings of multi-node clusters from one-node clusters have beneficial effects on cluster synchronization. Based on the effects of the one-node clusters, an effective and universal control scheme is put forward for the first time. The obtained results may help us better understand the relation between cluster synchronization and cluster structures of the networks. The validity of the control scheme is confirmed through two numerical simulations, in a network with no cluster structure and in a scale-free network.

  17. Transmission Capacity of Wireless Ad Hoc Networks with Energy Harvesting Nodes

    E-Print Network [OSTI]

    Vaze, Rahul

    2012-01-01

    Transmission capacity of an ad hoc wireless network is analyzed when each node of the network harvests energy from nature, e.g. solar, wind, vibration etc. Transmission capacity is the maximum allowable density of nodes, satisfying a per transmitter-receiver rate, and an outage probability constraint. Energy arrivals at each node are assumed to follow a Bernoulli distribution, and each node stores energy using an energy buffer/battery. For ALOHA medium access protocol (MAP), optimal transmission probability that maximizes the transmission capacity is derived as a function of the energy arrival distribution. Game theoretic analysis is also presented for ALOHA MAP, where each transmitter tries to maximize its own throughput, and symmetric Nash equilibrium is derived. For CSMA MAP, back-off probability and outage probability are derived in terms of input energy distribution, thereby characterizing the transmission capacity.

  18. Self-Organizing Relay Network Supporting Remotely Deployed Sensor Nodes in Military Operations

    E-Print Network [OSTI]

    Eliassen, Frank

    Self-Organizing Relay Network Supporting Remotely Deployed Sensor Nodes in Military Operations Dalimir Orfanus, Frank Eliassen Department of Informatics University of Oslo Oslo, Norway dalimir.orfanus@no.abb. Thus, alternative communications approaches have to be used, such as relay links via unmanned aerial

  19. PAN: A High-Performance Active Network Node Supporting Multiple Mobile Code Systems

    E-Print Network [OSTI]

    , not specialized hardware Page 4 #12;Obtaining High Performance Approach: Look at the active processing critical copies (bring capsule data into cache) Code interpretation, loading, or translation in critical path UserPAN: A High-Performance Active Network Node Supporting Multiple Mobile Code Systems Erik Nygren

  20. A PERIOD-BASED GROUP MEMBERSHIP STRATEGY FOR NODES OF TDMA NETWORKS

    E-Print Network [OSTI]

    Koopman, Philip

    In automotive embedded systems, all nodes are not created equal. Automotive embedded systems generally have different periods. Current automotive buses such as the Controller Area Network (CAN) use a priority in order to provide a more predictable platform for safety assurance. Time Division Multiple Access (TDMA

  1. Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Faraj, Ahmad A.; Inglett, Todd A.; Ratterman, Joseph D.

    2012-10-23

    Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

  2. hp calculators HP 50g Confidence Intervals Real Estate

    E-Print Network [OSTI]

    Vetter, Frederick J.

    hp calculators HP 50g Confidence Intervals ­ Real Estate The STAT menu Confidence Intervals Practice finding confidence intervals ­ Real Estate #12;hp calculators HP 50g Confidence Intervals ­ Real Estate hp calculators - 2 - HP 50g Confidence Intervals ­ Real Estate The STAT menu The Statistics menu

  3. hp calculators HP 50g Hypothesis tests Real Estate

    E-Print Network [OSTI]

    Vetter, Frederick J.

    hp calculators HP 50g Hypothesis tests ­ Real Estate The STAT menu Hypothesis tests Practice evaluating hypothesis tests ­ Real Estate #12;hp calculators HP 50g Hypothesis tests ­ Real Estate hp calculators - 2 - HP 50g Hypothesis tests ­ Real Estate The STAT menu The Statistics menu is accessed from

  4. Information-based self-organization of sensor nodes of a sensor network

    DOE Patents [OSTI]

    Ko, Teresa H. (Castro Valley, CA); Berry, Nina M. (Tracy, CA)

    2011-09-20

    A sensor node detects a plurality of information-based events. The sensor node determines whether at least one other sensor node is an information neighbor of the sensor node based on at least a portion of the plurality of information-based events. The information neighbor has an overlapping field of view with the sensor node. The sensor node sends at least one communication to the at least one other sensor node that is an information neighbor of the sensor node in response to at least one information-based event of the plurality of information-based events.

  5. Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Inglett, Todd A. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2010-03-02

    Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.

  6. A Robust and Flexible Design for GCEP Unattended Online Enrichment Monitoring: An OLEM Collection Node Network

    SciTech Connect (OSTI)

    Younkin, James R; March-Leuba, Jose A; Garner, James R

    2013-01-01

    Oak Ridge National Laoratory (ORNL) has engineered an on-line enrichment monitor (OLEM) to continuously measure U-235 emissions from the UF6 gas flowing through a unit header pipe of a gas centrifuge enrichment plant (GCEP) as a component of the International Atomic Energy Agency s (IAEA) new generation of technology to support enrichment plant safeguards1. In contrast to other enrichment monitoring approaches, OLEM calibrates and corrects for the pressure and temperature dependent UF6 gas-density without external radiation sources by using the inherent unit header pipe pressure dynamics and combining U-235 gamma-ray spectrometery using a shielded NaI detector with gas pressure and temperature data near the spectrum measurement point to obtain the enrichment of the gas as a function of time. From a safeguards perspective, OLEM can provide early detection of a GCEP being misused for production of highly enriched uranium, but would not detect directly the isolation and use of a cascade within the production unit to produce HEU. OLEM may also reduce the number of samples collected for destructive assay and, if coupled with load cell monitoring, could support isotope mass balance verification and unattended cylinder verification. The earlier paper presented OLEM as one component along with shared load cells and unattended cylinder verification, in the IAEA emering toolbox for unattended instruments at GCEPs1 and described the OLEM concept and how previous modeling studies and field measurements helped confirm the viability of a passive on-line enrichment monitor for meeting IAEA objectives and to support the development of performance targets. Phase I of the United States Support Program (USSP) OLEM project completed a preliminary hardware, software and communications design; phase II will build and test field prototypes in controlled laboratory settings and then at an operational facility. That paper also discussed many of the OLEM collection node commercial off the shelf (COTS) components and summarized the OLEM collection node data security provisions. This paper will discuss a secure and redundant network of OLEM collection nodes, auxiliary detection units and supporting junction boxes distributed throughout a facility for monitoring enrichment on product, feed and tails unit header pipes; the purpose and capability of the built-in Electronic Optical Sealing System (EOSS) network gateway; and a network approach for obtaining reliable and authenticated pressure measurements.

  7. Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Guiling Wang, Wensheng Zhang, and Chuang Wang

    E-Print Network [OSTI]

    Zhang, Wensheng

    @njit.edu Abstract--When deployed for long-term tasks, the energy required to support sensor nodes' activities is far is conserved, once the energy is used up, the network life terminates. Therefore, guaranteeing long- term of WSNs for long-term tasks such as structural health monitoring for bridges and tunnels, border

  8. 3640 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 7, SEPTEMBER 2009 Network Lifetime Maximization With Node

    E-Print Network [OSTI]

    Jiang, Hai

    the traffic load of the network, which apparently affects the resource management as well. In this paper, the no and timely delivery. On one hand, similar to the case in traditional WSNs, resource management protocols as many potential sensor nodes as possible arises in addition to the aforementioned resource management

  9. System and method for merging clusters of wireless nodes in a wireless network

    DOE Patents [OSTI]

    Budampati, Ramakrishna S. (Maple Grove, MN); Gonia, Patrick S. (Maplewood, MN); Kolavennu, Soumitri N. (Blaine, MN); Mahasenan, Arun V. (Kerala, IN)

    2012-05-29

    A system includes a first cluster having multiple first wireless nodes. One first node is configured to act as a first cluster master, and other first nodes are configured to receive time synchronization information provided by the first cluster master. The system also includes a second cluster having one or more second wireless nodes. One second node is configured to act as a second cluster master, and any other second nodes configured to receive time synchronization information provided by the second cluster master. The system further includes a manager configured to merge the clusters into a combined cluster. One of the nodes is configured to act as a single cluster master for the combined cluster, and the other nodes are configured to receive time synchronization information provided by the single cluster master.

  10. Tera-node Network Technology (TASK 4) Network Infrastructure Activities (NIA) final report

    SciTech Connect (OSTI)

    Postel, John; Bannister, Joe

    2000-03-15

    The TNT project developed software technologies in scalable personal telecommunications (SPT), Reservation Protocol 2 (RSVP2), Scalable Computing Infrastructure (SCOPE), and Network Infrastructure Activities (NIA). SPT = developed many innovative protocols to support the use of videoconferencing applications on the Internet. RSVP2 = developed a new reference model and further standardization of RSVP. SCOPE = developed dynamic resource discovery techniques and distributed directory services in support of resource allocation for large distributed systems and computations. NIA = provided policy, operational, and support to the transitioning Internet.

  11. Protecting Neighbor Discovery Against Node Compromises in Sensor Networks Donggang Liu

    E-Print Network [OSTI]

    Liu, Donggang

    communicate. In most protocols and algorithms, a critical piece of information for every sensor node each other's radio range. This often implies that every pair of neighboring nodes are physically close. For example, a sensor node will fail to route packets if the next hop on the routing path is not its neighbor

  12. HP Steam Trap Monitoring 

    E-Print Network [OSTI]

    Pascone, S.

    2011-01-01

    stream_source_info ESL-IC-11-10-61.pdf.txt stream_content_type text/plain stream_size 2024 Content-Encoding ISO-8859-1 stream_name ESL-IC-11-10-61.pdf.txt Content-Type text/plain; charset=ISO-8859-1 STEAM MONITORING HP... Steam Trap Monitoring HP Steam Trap Monitoring ? 12-18 months payback! ? 3-5% permanent reduction in consumption ? LEED Pt.? Innovation in Operations EB O&M ? Saved clients over $1,000,000 Annual consumption Steam Trap Monitoring ? Real...

  13. Embedding global barrier and collective in torus network with each node combining input from receivers according to class map for output to senders

    DOE Patents [OSTI]

    Chen, Dong; Coteus, Paul W; Eisley, Noel A; Gara, Alan; Heidelberger, Philip; Senger, Robert M; Salapura, Valentina; Steinmacher-Burow, Burkhard; Sugawara, Yutaka; Takken, Todd E

    2013-08-27

    Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.

  14. Secure-TWS: Authenticating Node to Multi-user Communication in Shared Sensor Networks

    E-Print Network [OSTI]

    Zhao, Feng

    Internet router supplied by the home owner. The utility company trusts only the sen- sor node and application layer protocols that connect low power sen- sor nodes directly to multiple applications and users. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific

  15. Bargain-based Stimulation Mechanism for Selfish Mobile Nodes in Participatory Sensing Network

    E-Print Network [OSTI]

    Wu, Hongyi

    applications. A wide range of devices and communication systems (such as Bluetooth, Zigbee, Wifi, WiMAX, cell. Low power radio (such as Bluetooth and Zigbee) is employed for communication among the nodes. Due

  16. Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and

    E-Print Network [OSTI]

    Misra, Satyajayant

    (RNs) whose main function is to communicate with the SNs and other RNs [2, 5, 11, 12, 15, 21, 22, 30 relay node placement, we place a small number of RNs to ensure that the SNs and BSs are connected, Bozeman, MT 59717. Email: tang@cs.montana.edu. placement, we place a small number of RNs to ensure

  17. Are Classes of Nodes with Different Power Amplifiers Good for Wireless Multi-hop Networks?

    E-Print Network [OSTI]

    Wolisz, Adam

    . FT 5-2, Einsteinufer 25 10587 Berlin, Germany {kubisch,karl,wolisz}@ee.tu-berlin.de Abstract. It has on global knowledge. The obtained results demonstrate an appealing potential of a reduction in energy setups however, the distances between communicating nodes are variable. Thus, the usage of the highest

  18. Detecting essential nodes in complex networks from measured noisy time series

    E-Print Network [OSTI]

    and functional importance. Moreover, such a method has been demonstrated being robust against the effect be observed in neural systems, food web networks, epidemiological systems, social networks and so on. From

  19. 644 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 3, JUNE 2007 On Lifetime-Based Node Failure and Stochastic

    E-Print Network [OSTI]

    Yao, Zhongmei

    networks that are commonly faced with high rates of churn and random departure decisions by end nodes and derive a simple model for the probability that a P2P system partitions under churn. Index simultaneous failure in practice. Additional P2P resilience studies examine the required rate of neighbor

  20. Extra-Large Memory Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    qsub -I -X -q regxlmem -l nodes1:ppn1 -l walltime01:00:00 -l mem16GB Use of NX X-windows forwarding is normally slow due to the network latency. NERSC provide the NX...

  1. Compute Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room News PublicationsAuditsCluster Compatibilitydefault Changes TheCompute Nodes Compute Nodes

  2. On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-lived Sensor Networks

    E-Print Network [OSTI]

    Zhang, Wensheng

    applica- tion in long-term tasks such as structural health monitoring for bridges and tunnels, border and efficient way to guarantee long-term energy supply has persisted as a big challenge. Recently, Tong et alOn-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-lived Sensor

  3. Crystal Structure of the HP1-EMSY Complex Reveals an Unusual Mode of HP1 Binding

    SciTech Connect (OSTI)

    Huang,Y.; Myers, M.; Xu, R.

    2006-01-01

    Heterochromatin protein-1 (HP1) plays an essential role in both the assembly of higher-order chromatin structure and epigenetic inheritance. The C-terminal chromo shadow domain (CSD) of HP1 is responsible for homodimerization and interaction with a number of chromatin-associated nonhistone proteins, including EMSY, which is a BRCA2-interacting protein that has been implicated in the development of breast and ovarian cancer. We have determined the crystal structure of the HP1{beta} CSD in complex with the N-terminal domain of EMSY at 1.8 Angstroms resolution. Surprisingly, the structure reveals that EMSY is bound by two HP1 CSD homodimers, and the binding sequences differ from the consensus HP1 binding motif PXVXL. This structural information expands our understanding of HP1 binding specificity and provides insights into interactions between HP1 homodimers that are likely to be important for heterochromatin formation.

  4. Support Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired Solar Fuel Production 1: TotalofSupply StoresSupport Nodes Support

  5. Compute nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room News PublicationsAuditsCluster Compatibilitydefault Changes TheCompute Nodes ComputeCompute

  6. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies...

  7. Using the PALS Architecture to Verify a Distributed Topology Control Protocol for Wireless Multi-Hop Networks in the Presence of Node Failures

    E-Print Network [OSTI]

    Katelman, Michael; 10.4204/EPTCS.36.6

    2010-01-01

    The PALS architecture reduces distributed, real-time asynchronous system design to the design of a synchronous system under reasonable requirements. Assuming logical synchrony leads to fewer system behaviors and provides a conceptually simpler paradigm for engineering purposes. One of the current limitations of the framework is that from a set of independent "synchronous machines", one must compose the entire synchronous system by hand, which is tedious and error-prone. We use Maude's meta-level to automatically generate a synchronous composition from user-provided component machines and a description of how the machines communicate with each other. We then use the new capabilities to verify the correctness of a distributed topology control protocol for wireless networks in the presence of nodes that may fail.

  8. Adjacent Channel Interference in Dual-radio 802.11a Nodes and Its Impact on Multi-hop Networking

    E-Print Network [OSTI]

    Kung, H. T.

    -mask requirements set by the IEEE 802.11 standard, the multi-hop performance is still significantly affected by ACI evaluate the performance impact of adjacent chan- nel interference (ACI) in multi-hop wireless networks a spectrum analyzer with a signal combiner to quantify ACI under various conditions and propose solutions

  9. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

    Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

    2014-12-30

    Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

  10. Active Diesel Emission Control Technology for Sub-50 HP Engines...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Sub-50 HP Engines with Low Exhaust Temperature Profiles Active Diesel Emission Control Technology for Sub-50 HP Engines with Low Exhaust Temperature Profiles A new type of emission...

  11. Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Hardwick, Camesha R. (Fayetteville, NC); McCarthy, Patrick J. (Rochester, MN); Wallenfelt, Brian P. (Eden Prairie, MN)

    2009-06-23

    Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependence upon the values read from the counters at each node; and determining for all nodes whether the current node value for each node is the same as a previously calculated node value for each node. If the current node is the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is complete and if the current node is not the same as the previously calculated node value for all nodes of the torus data communications network, embodiments include determining that messaging is currently incomplete.

  12. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

    DOE Patents [OSTI]

    Archer, Charles Jens (Rochester, MN); Musselman, Roy Glenn (Rochester, MN); Peters, Amanda (Rochester, MN); Pinnow, Kurt Walter (Rochester, MN); Swartz, Brent Allen (Chippewa Falls, WI); Wallenfelt, Brian Paul (Eden Prairie, MN)

    2010-11-16

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

  13. Overhearing in 802.11 mesh networks

    E-Print Network [OSTI]

    Afanasyev, Mikhail

    2009-01-01

    through a port on an HP 2626-PWR switch. There are sevenuplink, but no neighbors in the mesh. ) CDF of nodes Pwr5 Pwr 10 Pwr 15 Pwr 20 Pwr 30 Pwr 40 Pwr 50 Pwr 60

  14. Density of States for HP Lattice Proteins

    E-Print Network [OSTI]

    Michael Bachmann; Wolfhard Janke

    2007-10-22

    The density of states contains all informations on energetic quantities of a statistical system, such as the mean energy, free energy, entropy, and specific heat. As a specific application, we consider in this work a simple lattice model for heteropolymers that is widely used for studying statistical properties of proteins. For short chains, we have derived exact results from conformational enumeration, while for longer ones we developed a multicanonical Monte Carlo variant of the nPERM-based chain growth method in order to directly simulate the density of states. For simplification, only two types of monomers with respective hydrophobic (H) and polar (P) residues are regarded and only the next-neighbour interaction between hydrophobic monomers, being nonadjacent along the chain, is taken into account. This is known as the HP model for the folding of lattice proteins.

  15. Topology-Independent Distributed Adaptive Node-Specific Signal Estimation in Wireless Sensor

    E-Print Network [OSTI]

    -DANSE) algorithm is presented where each node of a wireless sensor network (WSN) is tasked with estimating a node in the WSN. The TI-DANSE algorithm is first introduced in a fully connected WSN and then shown, in fact. The WSN can accomplish this estimation by cooperation between the nodes, where each node performs sensing

  16. SiNode Systems

    Broader source: Energy.gov [DOE]

    SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process.

  17. Robust Clock Synchronization in Wireless Sensor Networks 

    E-Print Network [OSTI]

    Saibua, Sawin

    2010-10-12

    Clock synchronization between any two nodes in a Wireless Sensor Network (WSNs) is generally accomplished through exchanging messages and adjusting clock offset and skew parameters of each node’s clock. To cope with unknown network message delays...

  18. Simulating a Semantic Network in LMS

    E-Print Network [OSTI]

    Koton, Phyllis A.

    1980-09-29

    A semantic network is a collection of nodes and the links between them. The nodes represent concepts, functions and entities, and the links represent relationships between varoius nodes. Any semantic network must be supplied ...

  19. A robust window-based multi-node minimization technique using Boolean relations 

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2008-10-10

    Multi-node optimization using Boolean relations is a powerful approach for network minimization. The approach has been studied in theory, and so far its superiority over single node optimization techniques has only been ...

  20. A robust window-based multi-node minimization technique using Boolean relations 

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2009-05-15

    Multi-node optimization using Boolean relations is a powerful approach for network minimization. The approach has been studied in theory, and so far its superiority over single node optimization techniques has only been ...

  1. Hopper Login Nodes

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    can be CPU and memory intensive and are popular applications on the login nodes: IDL Matlab NCL python Launching any of the above applications for a short time (< 1 hour) on a...

  2. Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

    DOE Patents [OSTI]

    Almasi, Gheorghe (Ardsley, NY) [Ardsley, NY; Blumrich, Matthias Augustin (Ridgefield, CT) [Ridgefield, CT; Chen, Dong (Croton-On-Hudson, NY) [Croton-On-Hudson, NY; Coteus, Paul (Yorktown, NY) [Yorktown, NY; Gara, Alan (Mount Kisco, NY) [Mount Kisco, NY; Giampapa, Mark E. (Irvington, NY) [Irvington, NY; Heidelberger, Philip (Cortlandt Manor, NY) [Cortlandt Manor, NY; Hoenicke, Dirk I. (Ossining, NY) [Ossining, NY; Singh, Sarabjeet (Mississauga, CA) [Mississauga, CA; Steinmacher-Burow, Burkhard D. (Wernau, DE) [Wernau, DE; Takken, Todd (Brewster, NY) [Brewster, NY; Vranas, Pavlos (Bedford Hills, NY) [Bedford Hills, NY

    2008-06-03

    Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored in memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.

  3. Distributed Node Selection for Sequential Estimation over Noisy Communication Channels

    E-Print Network [OSTI]

    Jayaweera, Sudharman K.

    Wimalajeewa and Sudharman K. Jayaweera Dept. of Electrical and Computer Engineering University of New Mexico corrupted estimator from the previous node. Since all nodes in the network may not carry useful information estimation problem, the required parameter is to be estimated based on noise corrupted observations at local

  4. Wireless Sensor Node Localization By Akos Ledeczi and Miklos Maroti

    E-Print Network [OSTI]

    Maróti, Miklós

    University of Szeged Szeged, Hungary mmaroti@math.u-szeged.hu For most wireless sensor network (WSN) applications, the positions of the sensor nodes need to be known. GPS has not fit into WSN very well due to its brought about a large number of proposed methods for WSN node localization. They show tremendous variation

  5. Master thesis Modular mechanical engineering design tool (30hp) Background

    E-Print Network [OSTI]

    Zhao, Yuxiao

    Master thesis ­ Modular mechanical engineering design tool (30hp. Thesis description In this thesis, the students have the opportunity to develop-time. The thesis will be run in parallel with a customer order on a customized version

  6. HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers...

    Broader source: Energy.gov (indexed) [DOE]

    Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us....

  7. Distributed downhole drilling network

    DOE Patents [OSTI]

    Hall, David R.; Hall, Jr., H. Tracy; Fox, Joe; Pixton, David S.

    2006-11-21

    A high-speed downhole network providing real-time data from downhole components of a drilling strings includes a bottom-hole node interfacing to a bottom-hole assembly located proximate the bottom end of a drill string. A top-hole node is connected proximate the top end of the drill string. One or several intermediate nodes are located along the drill string between the bottom-hole node and the top-hole node. The intermediate nodes are configured to receive and transmit data packets transmitted between the bottom-hole node and the top-hole node. A communications link, integrated into the drill string, is used to operably connect the bottom-hole node, the intermediate nodes, and the top-hole node. In selected embodiments, a personal or other computer may be connected to the top-hole node, to analyze data received from the intermediate and bottom-hole nodes.

  8. Vulnerability of critical infrastructures : identifying critical nodes.

    SciTech Connect (OSTI)

    Cox, Roger Gary; Robinson, David Gerald

    2004-06-01

    The objective of this research was the development of tools and techniques for the identification of critical nodes within critical infrastructures. These are nodes that, if disrupted through natural events or terrorist action, would cause the most widespread, immediate damage. This research focuses on one particular element of the national infrastructure: the bulk power system. Through the identification of critical elements and the quantification of the consequences of their failure, site-specific vulnerability analyses can be focused at those locations where additional security measures could be effectively implemented. In particular, with appropriate sizing and placement within the grid, distributed generation in the form of regional power parks may reduce or even prevent the impact of widespread network power outages. Even without additional security measures, increased awareness of sensitive power grid locations can provide a basis for more effective national, state and local emergency planning. A number of methods for identifying critical nodes were investigated: small-world (or network theory), polyhedral dynamics, and an artificial intelligence-based search method - particle swarm optimization. PSO was found to be the only viable approach and was applied to a variety of industry accepted test networks to validate the ability of the approach to identify sets of critical nodes. The approach was coded in a software package called Buzzard and integrated with a traditional power flow code. A number of industry accepted test networks were employed to validate the approach. The techniques (and software) are not unique to power grid network, but could be applied to a variety of complex, interacting infrastructures.

  9. The Energy Endoscope: Real-time Detailed Energy Accounting for Wireless Sensor Nodes

    E-Print Network [OSTI]

    Stathopoulos, Thanos; McIntire, Dustin; Kaiser, W J

    2007-01-01

    appear ahead for optimization of WSN systems. References [1]Wireless Sensor Network (WSN) systems. Most recently, the32-bit processor-based WSN nodes that meet new application

  10. Efficient flooding for wireless mesh networks

    E-Print Network [OSTI]

    Subramanian, Jayashree, Ph. D. Massachusetts Institute of Technology

    2012-01-01

    Flooding in wireless mesh networks involves distributing some data from one node to rest of the nodes in the network. This dissertation proposes UFlood, a flooding protocol for wireless mesh networks that targets large ...

  11. Parallel HSL port Control Network

    E-Print Network [OSTI]

    Glück, Olivier

    Parallel HSL port FastHSL board HSL links Ethernet Control Network Node 1 PC mother board PCI Bus PCI-DDC Rcube PC mother board Node 3 PCI-DDC Rcube Node 2 PC mother board PCI-DDC Rcube THE MPC is the HSL network router, and PCI-DDC the network controller implementing the Direct Deposit State Less

  12. Molecular Cell HP1 Proteins Form Distinct Complexes

    E-Print Network [OSTI]

    , two HP1 homologs, Swi6 and Chp2, function in heterochromatic gene silencing, but their relative contribution to silencing remains unknown. Here we show that Swi6 and Chp2 exist in nonoverlapping complexes and make distinct contributions to silencing. Chp2 associates with the SHREC histone deacetylase complex

  13. ME2804 Social Innovation and Entrepreneurship 7,5 hp

    E-Print Network [OSTI]

    Arvestad, Lars

    ME2804 Social Innovation and Entrepreneurship 7,5 hp Social Innovation and Entrepreneurship to the context of social innovation and social entrepreneurship. Through project work students will increase-oriented skills required for developing and implementing a social innovation and/or creating the social

  14. When Network Coding improves the Performances of Clustered Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    When Network Coding improves the Performances of Clustered Wireless Networks that significantly increases the performances of clustering algorithms in wireless multi-hop networks-XOR coding; wireless multi-hop networks; clustering I. INTRODUCTION Partitioning nodes

  15. U-017: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information

    Broader source: Energy.gov [DOE]

    A vulnerability was reported in HP MFP Digital Sending Software. A local user can obtain potentially sensitive information.

  16. U-208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code

    Broader source: Energy.gov [DOE]

    Two vulnerabilities were reported in HP Operations Agent. A remote user can execute arbitrary code on the target system

  17. An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem

    E-Print Network [OSTI]

    Hoos, Holger H.

    An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem Alena hydrophobic-polar (2D HP) protein folding problem. We present an improved version of our recently proposed Ant search. Overall, the results presented here establish our new ACO algorithm for 2D HP protein folding

  18. An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem

    E-Print Network [OSTI]

    Hoos, Holger H.

    An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem Alena Shmygelska, Rosal, the two dimensional hydrophobic-polar (2D HP) protein folding problem. We introduce an ant colony algorithm closely approaches that of specialised, state-of-the methods for 2D HP protein folding. 1

  19. A New Algorithm for Protein Folding in the HP Model Alantha Newman

    E-Print Network [OSTI]

    Newman, Alantha

    A New Algorithm for Protein Folding in the HP Model Alantha Newman #3; Abstract We consider the problem of protein folding in the HP model on the two-dimensional square lattice. This problem but not in the string) are present. The protein folding problem in the hydrophobic-hydrophilic (HP) model on the 2D

  20. Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete

    E-Print Network [OSTI]

    Istrail, Sorin

    Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete Bonnie Berger* Tom Leightont Abstract One of the simplest and most popular biophysical mod- els of protein folding is the hydrophobic-hydrophilic (HP) model. The HP model abstracts the hydrophobic in- teraction in protein folding

  1. Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks

    E-Print Network [OSTI]

    Tan, Choo Chin

    2013-01-01

    classes: regular nodes (RNs) and backbone capable nodes (that consists solely of RNs. We note that for the specialits associated BCNs and RNs will form an access network (

  2. Semantic associative network for text analysis (SANTA) 

    E-Print Network [OSTI]

    Airhart, Robert William

    2000-01-01

    Based on theories of associations, the Semantic Associative Network for Text Analysis (SANTA) has been developed. Nodes in the network represent words and links between nodes represent the association strengths between ...

  3. Efficient network camouflaging in wireless networks 

    E-Print Network [OSTI]

    Jiang, Shu

    2006-04-12

    (e.g. broadcast, node mobility) that traditional wired networks do not possess. This necessitates developing new techniques that take account of properties of wireless networks and are able to achieve a good balance between performance and security...

  4. Optimum Transmission Policies for Battery Limited Energy Harvesting Nodes

    E-Print Network [OSTI]

    Tutuncuoglu, Kaya

    2010-01-01

    Wireless networks with energy harvesting battery powered nodes are quickly emerging as a viable option for future wireless networks with extended lifetime. Equally important to their counterpart in the design of energy harvesting radios are the design principles that this new networking paradigm calls for. In particular, unlike wireless networks considered up to date, the energy replenishment process and the storage constraints of the rechargeable batteries need to be taken into account in designing efficient transmission strategies. In this work, we consider such transmission policies for rechargeable nodes, and identify the optimum solution for two related problems. Specifically, the transmission policy that maximizes the short term throughput, i.e., the amount of data transmitted in a finite time horizon is found. In addition, we show the relation of this optimization problem to another, namely, the minimization of the transmission completion time for a given amount of data, and solve that as well. The tra...

  5. Identifying Proxy Nodes in a Tor Anonymization Circuit Sambuddho Chakravarty

    E-Print Network [OSTI]

    Keromytis, Angelos D.

    Identifying Proxy Nodes in a Tor Anonymization Circuit Sambuddho Chakravarty Columbia University, and effective mechanism that exposes the identity of Tor relays participating in a given circuit. Such an attack), we create observable fluctuations that propagate through the Tor network and the Internet to the end

  6. CENDA: Camouflage Event Based Malicious Node Detection Architecture

    E-Print Network [OSTI]

    Liu, Alex X.

    and segregating such compromised nodes while identifying the type of attack with a certain confidence is critical of malicious activity and is flexible to be configured to include other attack types in future. I. INTRODUCTION Sensor network finds application in different disciplines ranging from academic research to practical

  7. Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes

    E-Print Network [OSTI]

    Turau, Volker

    with a prediction of future incoming energy, e.g., obtained from a solar cell. II. RELATED WORK Several approachesLifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes Christian Renner, J research direction for wireless sensor networks. It depends on accurate models for lifetime prediction

  8. Automatic Clustering of Grid Nodes Department of Electrical and

    E-Print Network [OSTI]

    Subhlok, Jaspal

    Automatic Clustering of Grid Nodes Qiang Xu Department of Electrical and Computer Engineering systems such as the Network Weather Service (NWS) [15] are commonly employed by Grid middleware systems Science University of Houston Houston, Texas 77204 Email: jaspal@uh.edu Abstract-- In a grid

  9. Parallel-aware, dedicated job co-scheduling within/across symmetric multiprocessing nodes

    DOE Patents [OSTI]

    Jones, Terry R. (Livermore, CA); Watson, Pythagoras C. (Livermore, CA); Tuel, William (Kingston, NY); Brenner, Larry (Austin, TX); ,Caffrey, Patrick (Saugerties, NY); Fier, Jeffrey (Livermore, CA)

    2010-10-05

    In a parallel computing environment comprising a network of SMP nodes each having at least one processor, a parallel-aware co-scheduling method and system for improving the performance and scalability of a dedicated parallel job having synchronizing collective operations. The method and system uses a global co-scheduler and an operating system kernel dispatcher adapted to coordinate interfering system and daemon activities on a node and across nodes to promote intra-node and inter-node overlap of said interfering system and daemon activities as well as intra-node and inter-node overlap of said synchronizing collective operations. In this manner, the impact of random short-lived interruptions, such as timer-decrement processing and periodic daemon activity, on synchronizing collective operations is minimized on large processor-count SPMD bulk-synchronous programming styles.

  10. T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified in HP Virtual Server Environment for Windows. The vulnerability could be exploited remotely to elevate privileges.

  11. V-146: HP Service Manager Bugs Permit Cross-Site Scripting and...

    Broader source: Energy.gov (indexed) [DOE]

    Cross-Site Scripting and Information Disclosure Attacks PLATFORM: Service Manager v9.31 Web Tier ABSTRACT: Two vulnerabilities were reported in HP Service Manager REFERENCE LINKS:...

  12. Transmission Costs, Selfish Nodes, and Protocol Design Peter Marbach and Ran Pang

    E-Print Network [OSTI]

    Marbach, Peter

    Transmission Costs, Selfish Nodes, and Protocol Design Peter Marbach and Ran Pang Department of Computer Science University of Toronto Abstract-- We study the influence of transmission costs on the behavior of selfish nodes in wireless local area networks. Intu- itively, it seems that transmission costs

  13. Transmission Costs, Selfish Nodes, and Protocol Design Peter Marbach and Ran Pang

    E-Print Network [OSTI]

    Marbach, Peter

    Transmission Costs, Selfish Nodes, and Protocol Design Peter Marbach and Ran Pang Department of Computer Science University of Toronto Abstract--- We study how selfish nodes react to transmission costs in wireless networks. Intuitively, it seems that transmission costs should have a stabilizing effect

  14. An Energy Efficient Wireless Communication Mechanism for Sensor Node Cluster Heads

    E-Print Network [OSTI]

    Simunic, Tajana

    An Energy Efficient Wireless Communication Mechanism for Sensor Node Cluster Heads Edoardo Regini mechanism to achieve significant energy savings in heterogeneous wireless sensor networks such as HPWREN the backbone. The routing is done by battery-powered nodes using license free radios such as 802

  15. ASH: Tackling Node Mobility in Large-Scale Andrei Pruteanu, Stefan Dulman, Koen Langendoen

    E-Print Network [OSTI]

    Langendoen, Koen

    ASH: Tackling Node Mobility in Large-Scale Networks Andrei Pruteanu, Stefan Dulman, Koen Langendoen of a novel mechanism (called ASH) for the creation of a quasi-static overlay on top of a mobile topology. A preliminary evaluation by means of simulation shows that ASH succeeds in tackling node mobility, while

  16. Multimode-Interference Waveguide Crossing Coupled Microring-Resonator-Based Switch Nodes for Photonic

    E-Print Network [OSTI]

    Poon, Andrew Wing On

    -dimensional nonblocking low-power photonic switch nodes for networks-on-chip using multimode-interference-based waveguide. Our photonic crossbar design offers low-power dissipation, scalability, and small device foot (e.g. nodes 1 and 3) consume no switching power. Assuming a microring resonance Q of ~104 , we see

  17. Collaborative Firewalling in Wireless Networks Mahmoud Taghizadeh

    E-Print Network [OSTI]

    Liu, Alex X.

    Collaborative Firewalling in Wireless Networks Mahmoud Taghizadeh Department of ECE Michigan State elements to enforce access policies in computer networks. Open network architecture, shared wireless medium for wireless networks in which nodes collaboratively perform packet filtering to address resource squandering

  18. Network coding for speedup in switches

    E-Print Network [OSTI]

    Kim, MinJi, M. Eng. Massachusetts Institute of Technology

    2007-01-01

    Network coding, which allows mixing of data at intermediate network nodes, is known to increase the throughput of networks. In particular, it is known that linear network coding in a crossbar switch can sustain traffic ...

  19. Energy Modeling of Wireless Sensor Nodes Based on Petri Nets Ali Shareef, Yifeng Zhu

    E-Print Network [OSTI]

    Zhu, Yifeng

    energy- saving strategies in wireless sensor networks. Keywords-Wireless Sensor Networks, Petri NetsEnergy Modeling of Wireless Sensor Nodes Based on Petri Nets Ali Shareef, Yifeng Zhu Department}@eece.maine.edu Abstract--Energy minimization is of great importance in wire- less sensor networks in extending the battery

  20. Failure Inferencing based Fast Rerouting for Handling Transient Link and Node Failures

    E-Print Network [OSTI]

    Nelakuditi, Srihari

    generation, propagation, and processing mechanisms. MPLS based approaches [5] handle transient failures1 Failure Inferencing based Fast Rerouting for Handling Transient Link and Node Failures Zifei network with high service availability. Unfortunately, in today's Internet, transient failures occur

  1. T-570: HP Security Bulletin- HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass

    Broader source: Energy.gov [DOE]

    A potential security vulnerability has been identified with HP-UX OpenSSL. This vulnerability could be exploited remotely to execute arbitrary code or create a Denial of Service (DoS) or an authentication bypass.

  2. Dynamic resource allocation in WDM networks with optical bypass and waveband switching

    E-Print Network [OSTI]

    Chen, Li-Wei, Ph. D. Massachusetts Institute of Technology

    2005-01-01

    In this thesis, we investigate network architecture from the twin perspectives of link resource allocation and node complexity in WDM optical networks Chapter 2 considers networks where the nodes have full wavelength ...

  3. Efficient Strategyproof Multicast in Selfish Wireless Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

    since wireless nodes are energy-constraint and it is often not in the interest of a node to always relayChapter 1 Efficient Strategyproof Multicast in Selfish Wireless Networks In this chapter, we study how to perform routing when each wireless node is selfish, i.e., a wireless node will always maximize

  4. Genetic Algorithm for Predicting Protein Folding in the 2D HP Model

    E-Print Network [OSTI]

    Emmerich, Michael

    Genetic Algorithm for Predicting Protein Folding in the 2D HP Model A Parameter Tuning Case Study of a protein, predicting its tertiary structure is known as the protein folding problem. This problem has been. The protein folding problem in the HP model is to find a conformation (a folded sequence) with the lowest

  5. A New Algorithm for Protein Folding in the HP Model Alantha Newman *

    E-Print Network [OSTI]

    Istrail, Sorin

    876 A New Algorithm for Protein Folding in the HP Model Alantha Newman * Abstract We consider the problem of protein folding in the HP model ozt the two-dimensional square lattice. This problem.e.pairsof H's that are adjacent in the folding but not in the string) are present. The protein folding problem

  6. A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model

    E-Print Network [OSTI]

    Istrail, Sorin

    Article A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model Mao tool for the protein folding problem. Key words: protein folding, HP model, branch and bound, lattice Introduction The protein folding problem, or the protein struc- ture prediction problem, is one of the most

  7. An Efficient Genetic Algorithm for Predicting Protein Tertiary Structures in the 2D HP Model

    E-Print Network [OSTI]

    Istrail, Sorin

    , predicting its tertiary structure is known as the protein folding problem. This problem has been widely genetic algo- rithm for the protein folding problem under the HP model in the two-dimensional square Genetic Algorithm, Protein Folding Problem, 2D HP Model 1. INTRODUCTION Amino acids are the building

  8. Community consistency determines the stability transition window of power-grid nodes

    E-Print Network [OSTI]

    Kim, Heetae; Holme, Petter

    2015-01-01

    The synchrony of electric power systems is important in order to maintain stable electricity supply. Recently, the measure basin stability was introduced to quantify a node's ability to recover its synchronization when perturbed. In this work, we focus on how basin stability depends on the coupling strength between nodes. We use the Chilean power grid as a case study. In general, the basin stability goes from zero to one as the coupling strength increases. However, this transition does happen for the same values for different nodes. By understanding the transition for individual nodes, we can further characterize their role in the power-transmission dynamics. We find that nodes with an exceptionally large transition window also have a low community consistency. In other words, they are hard to classify into one community when applying a community detection algorithm to the network. This also gives an efficient way to identify nodes with a long transition window (which is a computationally time-consuming task)...

  9. Trust and Independence Aware Decision Fusion in Distributed Networks

    E-Print Network [OSTI]

    California at Davis, University of

    -hop network scenario: a set of mobile or stationary nodes trying to monitor certain targets (objects, people

  10. Optimal Distributed P2P Streaming under Node Degree Bounds

    E-Print Network [OSTI]

    Zhang, Shaoquan; Chen, Minghua

    2010-01-01

    We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under \\emph{node degree bounds}, i.e., the number of neighbors a node can simultaneously connect to is upper-bounded. The problem is critical for supporting high-quality video streaming in P2P systems, and is challenging due to its combinatorial nature. In this paper, we address this problem by providing the first distributed solution that achieves near-optimal broadcast rate under arbitrary node degree bounds, and over arbitrary overlay graph. It runs on individual nodes and utilizes only the measurement from their one-hop neighbors, making the solution easy to implement and adaptable to peer churn and network dynamics. Our solution consists of two distributed algorithms proposed in this paper that can be of independent interests: a network-coding based broadcasting algorithm that optimizes the broadcast rate given a topology, and a Markov-chain guided topology hopping algorithm that optimizes the topology. Our distributed br...

  11. Controlling data transfers from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2011-06-21

    Methods, apparatus, and products are disclosed for controlling data transfers from an origin compute node to a target compute node that include: receiving, by an application messaging module on the target compute node, an indication of a data transfer from an origin compute node to the target compute node; and administering, by the application messaging module on the target compute node, the data transfer using one or more messaging primitives of a system messaging module in dependence upon the indication.

  12. U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users...

    Broader source: Energy.gov (indexed) [DOE]

    Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-120: EMC Smarts Network Configuration Manager Java RMI Access Control Flaw Lets Remote Users Gain Full Control...

  13. Global tree network for computing structures enabling global processing operations

    DOE Patents [OSTI]

    Blumrich; Matthias A. (Ridgefield, CT); Chen, Dong (Croton-On-Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

    2010-01-19

    A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

  14. Clock synchronization for mobile ad hoc networks 

    E-Print Network [OSTI]

    Chandra, Rajan

    2013-02-22

    synchronization uses MANet specific communication primitives with Minimum Connected Dominating Set (MCDS) approximation algorithms. This involves using a subset of nodes in the network to broadcast clock information to neighboring nodes. Several MCDS approximation...

  15. MIXIT: The Network Meets the Wireless Channel

    E-Print Network [OSTI]

    Katti, Sachin

    2007-09-04

    The traditional contract between the network and the lower layers states that the network does routing and the lower layers deliver correct packets. In a wireless network, however, different nodes may hear most bits in a ...

  16. Enhancing video transmission in MANETs utilizing multiple interfaces and multiple channels per node

    E-Print Network [OSTI]

    Bouras, Christos

    . Simulation results indicate that the mechanism improves the networks capacity for video transmissionEnhancing video transmission in MANETs utilizing multiple interfaces and multiple channels per node}@cti.gr, gkamas@aeavellas.gr {politaki, tsanai}@ceid.upatras.gr Abstract. Mobile Ad hoc NETworks (MANETs

  17. Higher-Order Spectral/HP Finite Element Technology for Structures and Fluid Flows 

    E-Print Network [OSTI]

    Vallala, Venkat Pradeep

    2013-06-20

    This study deals with the use of high-order spectral/hp approximation functions in the ?nite element models of various nonlinear boundary-value and initial-value problems arising in the ?elds of structural mechanics and ...

  18. time algorithm for d-dimensional protein folding in the HP-model

    E-Print Network [OSTI]

    Istrail, Sorin

    A 2O(n 1-1 d log n) time algorithm for d-dimensional protein folding in the HP-model Bin Fu Wei Wang Abstract The protein folding problem in the HP-model is NP-hard in both 2D and 3D [4, 6 structure. By studying how proteins fold, their functions can be better understood. The study of protein

  19. Dedicated heterogeneous node scheduling including backfill scheduling

    DOE Patents [OSTI]

    Wood, Robert R. (Livermore, CA); Eckert, Philip D. (Livermore, CA); Hommes, Gregg (Pleasanton, CA)

    2006-07-25

    A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

  20. Green Networks: Energy Efficient Design for Optical Networks Balagangadhar G. Bathula, Jaafar M. H. Elmirghani

    E-Print Network [OSTI]

    Bathula, Balagangadhar G

    Green Networks: Energy Efficient Design for Optical Networks Balagangadhar G. Bathula, Jaafar M. H in backbone networks such as optical networks increase. Energy consumption of optical networks is an important the energy consumption of optical networks. We propose sleep cycle protocols for use in the network nodes

  1. r-shrink: A Heuristic for Improving Minimum Power Broadcast Trees in Wireless Networks

    E-Print Network [OSTI]

    Arabshahi, Payman

    network with an identified source node, the minimum power broad- cast (MPB) problem in wireless networks to better accommodate the nodes, which have been disconnected from the tree as a result of the shrinkage

  2. Robust Power Allocation for Energy-Efficient Location-Aware Networks

    E-Print Network [OSTI]

    Li, William Wei-Liang

    In wireless location-aware networks, mobile nodes (agents) typically obtain their positions using the range measurements to the nodes with known positions. Transmit power allocation not only affects network lifetime and ...

  3. Organization of growing random networks

    SciTech Connect (OSTI)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.

  4. Systematic wireless network coding

    E-Print Network [OSTI]

    Shrader, Brooke E.

    We present a systematic network coding strategy for cooperative communication, in which some nodes may replicate-and-forward packets in addition to sending random linear combinations of the packets. We argue that if this ...

  5. Microfluidic ultrasonic particle separators with engineered node...

    Office of Scientific and Technical Information (OSTI)

    fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure...

  6. Efficient implementation of a multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    DOE Patents [OSTI]

    Bhanot, Gyan V. (Princeton, NJ); Chen, Dong (Croton-On-Hudson, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

    2008-01-01

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  7. Efficient implementation of multidimensional fast fourier transform on a distributed-memory parallel multi-node computer

    DOE Patents [OSTI]

    Bhanot, Gyan V. (Princeton, NJ); Chen, Dong (Croton-On-Hudson, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

    2012-01-10

    The present in invention is directed to a method, system and program storage device for efficiently implementing a multidimensional Fast Fourier Transform (FFT) of a multidimensional array comprising a plurality of elements initially distributed in a multi-node computer system comprising a plurality of nodes in communication over a network, comprising: distributing the plurality of elements of the array in a first dimension across the plurality of nodes of the computer system over the network to facilitate a first one-dimensional FFT; performing the first one-dimensional FFT on the elements of the array distributed at each node in the first dimension; re-distributing the one-dimensional FFT-transformed elements at each node in a second dimension via "all-to-all" distribution in random order across other nodes of the computer system over the network; and performing a second one-dimensional FFT on elements of the array re-distributed at each node in the second dimension, wherein the random order facilitates efficient utilization of the network thereby efficiently implementing the multidimensional FFT. The "all-to-all" re-distribution of array elements is further efficiently implemented in applications other than the multidimensional FFT on the distributed-memory parallel supercomputer.

  8. Phys 597A, CMPS 497E Graphs and Networks in Systems Biology

    E-Print Network [OSTI]

    Albert, Réka

    clustering Sink nodes, Leaf nodes #12;Food webs describe the energy flow within species Nodes: species Edges network in a high-school Blue: boys Pink: girls Q: does it surprise you that the network is connected in the illustration #12;Word co-usage network in PNAS publications Only words whose usage significantly increased

  9. Comparative Study of Price-based Resource Allocation Algorithms for Ad Hoc Networks

    E-Print Network [OSTI]

    be an ample alterna- tive. 1. Introduction Mobile ad hoc networks are formed by wireless nodes that move freely and have no fixed infrastructure. Each node in the network may act as a router for other nodes a serious threat to critical infrastructures of the future. Due to the nature of ad hoc wireless networks

  10. A bidding algorithm for optimized utility-based resource allocation in ad hoc networks

    E-Print Network [OSTI]

    for bandwidth allo- cation in wireless ad hoc networks. The quality of service (QoS) levels for each end ad hoc networks are formed by wireless nodes that move freely and have no fixed infrastructure. Each node in the network may act as a router for other nodes, and flows follow a multi-hop path from source

  11. Network coding for distributed quantum computation over cluster and butterfly networks

    E-Print Network [OSTI]

    Seiseki Akibue; Mio Murao

    2015-03-26

    To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider a setting of networks where quantum communication between nodes is restricted to sending just a qubit, but classical communication is unrestricted. We analyze which N-qubit unitary operations are implementable over cluster networks by investigating transformations of a given cluster network into quantum circuits. We show that any two-qubit unitary operation is implementable over the butterfly network and the grail network, which are fundamental primitive networks for classical network coding. We also analyze probabilistic implementations of unitary operations over cluster networks.

  12. Community Detection from Location-Tagged Networks

    E-Print Network [OSTI]

    Liu, Zhi

    2015-01-01

    Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections between nodes. However in many real world networks, the locations of nodes have great influence on the community structure. For example, in a social network, more connections are established between geographically proximate users. The impact of locations on community has not been fully investigated by the research literature. In this paper, we propose a community detection method which takes locations of nodes into consideration. The goal is to detect communities with both geographic proximity and network closeness. We analyze the distribution of the distances between connected and unconnected nodes to measure the influence of location on the network structure on two real location-tagged social networks. We propose a method to determine if a location-based community detection...

  13. Resetting Bounding Nodes in Acquiring Spanish

    E-Print Network [OSTI]

    Cebreiros, Ramiro

    1996-01-01

    This paper addresses the issue of whether L2 learners can reset parameters, by testing English speakers learning Spanish on their ability to reset the bounding node parameter. The bounding nodes are : IP and NP in English, CP and NP in Spanish...

  14. Opportunistic scheduling in large-scale wireless networks

    E-Print Network [OSTI]

    Modiano, Eytan H.

    In this paper, we consider a distributed one-hop wireless network with n pairs of transmitters and receivers. It is assumed that each transmitter/receiver node is only connected to k receiver/transmitter nodes which are ...

  15. Mitigating cascading failures in interdependent power grids and communication networks

    E-Print Network [OSTI]

    Parandehgheibi, Marzieh

    We study the interdependency between the power grid and the communication network used to control the grid. A communication node depends on the power grid in order to receive power for operation, and a power node depends ...

  16. Capacity and scale-free dynamics of evolving wireless networks 

    E-Print Network [OSTI]

    Iyer, Bharat Vishwanathan

    2005-02-17

    Many large-scale random graphs (e.g., the Internet) exhibit complex topology, nonhomogeneous spatial node distribution, and preferential attachment of new nodes. Current topology models for ad-hoc networks mostly consider a uniform spatial...

  17. Mobilized ad-hoc networks: A reinforcement learning approach

    E-Print Network [OSTI]

    Chang, Yu-Han

    2003-12-04

    Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over their movements. ...

  18. Stable Throughput in a Cognitive Wireless Network

    E-Print Network [OSTI]

    Fanous, Anthony

    2012-01-01

    We study, from a network layer perspective, the effect of an Ad-Hoc secondary network with N nodes randomly accessing the spectrum licensed to a primary node during the idle slots of the primary user. If the sensing is perfect, then the secondary nodes do not interfere with the primary node and hence do not affect its stable throughput. In case of imperfect sensing, it is shown that if the primary user's arrival rate is less than some calculated finite value, cognitive nodes can employ any transmission power or probabilities without affecting the primary user's stability; otherwise, the secondary nodes should control their transmission parameters to reduce the interference on the primary. It is also shown that in contrast with the primary's maximum stable throughput which strictly decreases with increased sensing errors, the throughput of the secondary nodes might increase with sensing errors as more transmission opportunities become available to them. Finally, we explore the use of the secondary nodes as rel...

  19. Design and Analysis of Low Complexity Network Coding Schemes 

    E-Print Network [OSTI]

    Tabatabaei-Yazdi, Seyed

    2012-02-20

    In classical network information theory, information packets are treated as commodities, and the nodes of the network are only allowed to duplicate and forward the packets. The new paradigm of network coding, which was ...

  20. Energy Consumption in Wireless Sensor Networks is a fundamental issue in terms of functionality and network lifetime. Minimization

    E-Print Network [OSTI]

    Vouyioukas, Demosthenes

    ABSTRACT Energy Consumption in Wireless Sensor Networks is a fundamental issue in terms, wireless sensor networks, energy model, biomedical applications 1. INTRODUCTION The concept of ubiquitous capacities and low energy consumption electronics. Wireless sensor network node functions such as sensing

  1. Fast Dynamics of HP35 for Folded and Urea-Unfolded Conditions Jean K. Chung, Megan C. Thielges,

    E-Print Network [OSTI]

    Fayer, Michael D.

    Fast Dynamics of HP35 for Folded and Urea-Unfolded Conditions Jean K. Chung, Megan C. Thielges 94305, United States *S Supporting Information ABSTRACT: The changes in fast dynamics of HP35 it folds so fast, it is a convenient system for detailed computational studies. The 35- amino-acid peptide

  2. A self-adaptive goal-oriented hp finite element method with electromagnetic applications. Part II: Electrodynamics

    E-Print Network [OSTI]

    Torres-Verdín, Carlos

    : Electrodynamics D. Pardo a,b,*, L. Demkowicz a , C. Torres-Verdi´n a,b , M. Paszynski a,1 a Institute singularities. The goal-oriented refinement strategy is an extension of a fully automatic, energy-norm based, hp and Sciences (ICES) of The University of Texas at Austin. The strategy produces automatically a sequence of hp

  3. Election in complete asynchronous networks with intermittent link failures 

    E-Print Network [OSTI]

    Lokre, Jahnavi V.

    1991-01-01

    , where ( 1 & f & [" s'J ). CHAPTER II THE MODEL This chapter discusses the model of the distributed network under investigation. Our model follows Goldreich and Shrira's model [13]. Consider a network of n processors. We model the network as a graph.... Initially, no node knows the identifier of any other node. Each node u knows the number of nodes n in the distributed system, the maximum number f of faulty links incident on u, and that the network is complete. A distributed algorithm on a network is a...

  4. AN hp FINITE ELEMENT METHOD TO SOLVE A FLUID-SOLID VIBRATION PROBLEM

    E-Print Network [OSTI]

    Rodríguez, Rodolfo

    AN hp FINITE ELEMENT METHOD TO SOLVE A FLUID-SOLID VIBRATION PROBLEM CLAUDIO PADRA, RODOLFO RODR´IGUEZ , AND MARIO SCHEBLE § Abstract. This paper deals with a two-dimensional fluid-solid vibration problem arising from nuclear engineering: the vibration of elastically mounted tubes immersed in a cavity filled

  5. BNL Irradiation and Characterization Studies Summary Report on HP Accelerator Material Research

    E-Print Network [OSTI]

    McDonald, Kirk

    BNL Irradiation and Characterization Studies Summary Report on HP Accelerator Material Research Reporting on (ONLY): · Irradiation and micro- macro-characterization of Beryllium · Irradiation Damage and Assessment of Graphite · Irradiation and Characterization of Ti-alloys (Ti6Al4V and Gum Metal) · Irradiation

  6. An hp adaptive strategy to compute the vibration modes of a fluid-solid coupled system

    E-Print Network [OSTI]

    Rodríguez, Rodolfo

    )], for the operational state, the fuel assembly in nuclear plants should be designed so that they cannot be unacceptablyAn hp adaptive strategy to compute the vibration modes of a fluid-solid coupled system M element method to solve a two- dimensional fluid-structure vibration problem. This problem arises from

  7. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

    SciTech Connect (OSTI)

    Agarwala, R. [National Institutes of Health, Bethesda, MD (United States); Batzoglou, S. [MIT, Cambridge, MA (United States); Dancik, V. [Univ. of Southern California, Los Angeles, CA (United States)] [and others

    1997-06-01

    We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill, which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding. Hart and Istrail gave approximation algorithms for folding proteins on the cubic lattice under HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that triangular lattice is a more reasonable choice. We present a set of folding rules for a triangular lattice and analyze the approximation ratio which they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.

  8. ME2800 Ideation -Creating a Business Idea 7,5 hp

    E-Print Network [OSTI]

    Arvestad, Lars

    models for customer, market and competitor analysis - Develop a basic business model Kursens huvudsakligaME2800 Ideation - Creating a Business Idea 7,5 hp Ideation - Creating a Business Idea Kursplan för a business opportunity - Develop and explain a business idea - Use creativity-techniques to extend

  9. GEON01 Quaternary geology, 15 hp Glacial sedimentology -processes, sediments and land systems, 15 credits

    E-Print Network [OSTI]

    1 Fall 2015 GEON01 Quaternary geology, 15 hp Glacial sedimentology - processes, sediments and land of glacigenic sediments Part 1. Glaciology, glacial sedimentology: processes and sediment products, 6 credits) fall, 2015 Glacial sedimentology: processes, sediments and land systems Teachers: PM = Per Möller

  10. Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model

    E-Print Network [OSTI]

    Istrail, Sorin

    of Sydney Sydney 2006, NSW Australia Abstract The Protein Folding Problem studies the way in which a protein proteins fold can be fundamental in developing treatments of diseases such as Alzeihmers and Systic of solving the HP protein folding problem in both two and three dimensions using Ant Colony Opti- mizations

  11. Physical layer model design for wireless networks 

    E-Print Network [OSTI]

    Yu, Yi

    2009-06-02

    Wireless network analysis and simulations rely on accurate physical layer models. The increased interest in wireless network design and cross-layer design require an accurate and efficient physical layer model especially when a large number of nodes...

  12. Epidemic Propagation In Overlaid Wireless Networks

    SciTech Connect (OSTI)

    Yanmaz, Evsen [Los Alamos National Laboratory

    2008-01-01

    Witb tbe emergence of computer worms tbat can spread over air interfaces, wireless ad boc and sensor networks can be vulnerable to node compromises even if the deployed network is not connected to the backbone. Depending on the physical topology of the wireless network, even a single infected node can compromise the whole network. In this work, epidemic (e.g., worm) propagation in a static wireless network is studied, where a number of inCected mobile nodes are injected over the existing network. It is shown that the epidemic spread threshold and size depend on the physical topology of the underlying static wireless network as well as the mobility model employed by the infected mobile nodes. More specifically, results show that in a Cully-connected static wirelessnctwork targeted attacks are more effective, wbereas Cor a random topology random attacks can be sufficient to compromise the whole network.

  13. Collective network for computer structures

    DOE Patents [OSTI]

    Blumrich, Matthias A; Coteus, Paul W; Chen, Dong; Gara, Alan; Giampapa, Mark E; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd E; Steinmacher-Burow, Burkhard D; Vranas, Pavlos M

    2014-01-07

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to the needs of a processing algorithm.

  14. Collective network for computer structures

    DOE Patents [OSTI]

    Blumrich, Matthias A. (Ridgefield, CT); Coteus, Paul W. (Yorktown Heights, NY); Chen, Dong (Croton On Hudson, NY); Gara, Alan (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Takken, Todd E. (Brewster, NY); Steinmacher-Burow, Burkhard D. (Wernau, DE); Vranas, Pavlos M. (Bedford Hills, NY)

    2011-08-16

    A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

  15. EXPERIMENTAL EVALUATION OF SIMULTANEOUS 3D LOCALIZATION OF SENSOR NODES AND TRACKING MOVING TARGETS

    E-Print Network [OSTI]

    Instituto de Sistemas e Robotica

    EXPERIMENTAL EVALUATION OF SIMULTANEOUS 3D LOCALIZATION OF SENSOR NODES AND TRACKING MOVING TARGETS sensor/target localization) which rely on infrared (IR), radio frequency/received signal strength (RF of a simultaneous localization and track- ing (SLAT) algorithm for sensor networks, whose aim is to determine

  16. SNIP: A Sensor Node-Initiated Probing Mechanism for Opportunistic Data Collection in Sparse

    E-Print Network [OSTI]

    Sreenan, Cormac J.

    energy consumption. I. INTRODUCTION As wireless sensor networks mature, we expect to see long- term deployments for applications such as environmental mon- itoring, house water/gas/electricity meter reading nodes could be specific devices carried by objects (animals, employees, etc.) who move around

  17. Queuing Theoretic and Information Theoretic Capacity of Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

    devices are solar cells, wind turbines and piezo-electric cells, which extract energy from the environmentQueuing Theoretic and Information Theoretic Capacity of Energy Harvesting Sensor Nodes Vinod Sharma, DRDO Bangalore, India Email: rajesh81r@gmail.com Abstract--Energy harvesting sensor networks provide

  18. Distributed services for mobile ad hoc networks 

    E-Print Network [OSTI]

    Cao, Guangtong

    2005-11-01

    by equipping each node with a device like a GPS receiver, a GPS receiver?s functionality is limited due to its geographical constraints, high energy consumption and cost. Therefore, studying clock synchronization algorithms for mobile ad hoc networks has 7... Network Lifetime vs. Number of Nodes : : : : : : : : : : : : : : : : : 61 24 Standard Deviation of Remaining Energy vs. Number of Nodes : : : 63 25 The k-Mutual Exclusion System Architecture : : : : : : : : : : : : : 71 26 Operation of KRL Algorithm on a...

  19. Global interrupt and barrier networks

    DOE Patents [OSTI]

    Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton-On-Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Kopcsay, Gerard V. (Yorktown Heights, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY)

    2008-10-28

    A system and method for generating global asynchronous signals in a computing structure. Particularly, a global interrupt and barrier network is implemented that implements logic for generating global interrupt and barrier signals for controlling global asynchronous operations performed by processing elements at selected processing nodes of a computing structure in accordance with a processing algorithm; and includes the physical interconnecting of the processing nodes for communicating the global interrupt and barrier signals to the elements via low-latency paths. The global asynchronous signals respectively initiate interrupt and barrier operations at the processing nodes at times selected for optimizing performance of the processing algorithms. In one embodiment, the global interrupt and barrier network is implemented in a scalable, massively parallel supercomputing device structure comprising a plurality of processing nodes interconnected by multiple independent networks, with each node including one or more processing elements for performing computation or communication activity as required when performing parallel algorithm operations. One multiple independent network includes a global tree network for enabling high-speed global tree communications among global tree network nodes or sub-trees thereof. The global interrupt and barrier network may operate in parallel with the global tree network for providing global asynchronous sideband signals.

  20. Cooperative Diversity in Interference Limited Wireless Networks

    E-Print Network [OSTI]

    Liang, Ben

    -rate and energy efficiency, based on network size, relay availability, node decoding threshold, and destination environments, using the resources of other peer nodes can help improve the network performance. In this context channel first introduced by van der Meulen leads to a communica- tion scheme where instead of point

  1. Parameters affecting the resilience of scale-free networks to random failures.

    SciTech Connect (OSTI)

    Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran (University of New Mexico, Albuquerque, NM); Saia, Jared (University of New Mexico, Albuquerque, NM)

    2005-09-01

    It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

  2. Signaling completion of a message transfer from an origin compute node to a target compute node

    DOE Patents [OSTI]

    Blocksome, Michael A. (Rochester, MN); Parker, Jeffrey J. (Rochester, MN)

    2011-05-24

    Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local direct put transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by the completion notification descriptor; transferring, by the origin DMA engine to the target node, the message in dependence upon the data descriptor; and notifying, by the origin DMA engine, the application that transfer of the message is complete in dependence upon the completion notification descriptor.

  3. Modeling Heterogeneity in Networks using Uncertainty Quantification Tools

    E-Print Network [OSTI]

    Rajendran, Karthikeyan; Siettos, Constantinos I; Laing, Carlo R; Kevrekidis, Ioannis G

    2015-01-01

    Using the dynamics of information propagation on a network as our illustrative example, we present and discuss a systematic approach to quantifying heterogeneity and its propagation that borrows established tools from Uncertainty Quantification. The crucial assumption underlying this mathematical and computational "technology transfer" is that the evolving states of the nodes in a network quickly become correlated with the corresponding node "identities": features of the nodes imparted by the network structure (e.g. the node degree, the node clustering coefficient). The node dynamics thus depend on heterogeneous (rather than uncertain) parameters, whose distribution over the network results from the network structure. Knowing these distributions allows us to obtain an efficient coarse-grained representation of the network state in terms of the expansion coefficients in suitable orthogonal polynomials. This representation is closely related to mathematical/computational tools for uncertainty quantification (th...

  4. Locating hardware faults in a data communications network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Megerian, Mark G. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2010-01-12

    Hardware faults location in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

  5. Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job

    DOE Patents [OSTI]

    Budnik, Thomas A. (Rochester, MN); Knudson, Brant L. (Rochester, MN); Megerian, Mark G. (Rochester, MN); Miller, Samuel J. (Rochester, MN); Stockdell, William M. (Byron, MN)

    2012-03-20

    Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of compute nodes running the re-launched job.

  6. Co-Simulation Tools for Networked Control Systems

    E-Print Network [OSTI]

    Branicky, Michael S.

    /Plant Extension ! NSCSPlant, NSCSController Extensions ! Modelica/ns-2 Integration [BPZ'02 NCS Co medium (wire/wireless link) Network node (data source) Network node (data sink) From Modelica to ns-2 From ns-2 to Modelica [Al-Hammouri, Agrawal, Liberatore, Branicky] Network View Example Reference Speed

  7. Network Flow Optimization under Uncertainty

    E-Print Network [OSTI]

    Tesfatsion, Leigh

    , production, generation, transportation, trade, storage injections and withdrawals of coal, gas?) xij is flow along arc (i, j), from node i to node j cij is cost per unit of flow along (i, j Network model in words Minimize the cost of satisfying demands for electric energy By: imports, exports

  8. Citation/Reference-Joseph'Szurley'and'Alexander'Bertrand'and'Marc'Moonen' Distributed-Adaptive-Node7Specific-Signal-Estimation-in-

    E-Print Network [OSTI]

    -3001 Leuven, Belgium Abstract A wireless sensor network (WSN) is considered where each node estimates estimation (DANSE) algorithm. It is assumed that the topology of the WSN is constructed based on one of two approaches, either a top-down approach where the WSN is composed of heterogeneous nodes, or a bottom

  9. Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory ofDid you notHeatMaRIEdioxide capture CSNationalNational UserNaval TheNetwork

  10. Maximizing Static Network Lifetime of Wireless Broadcast Adhoc Networks

    E-Print Network [OSTI]

    Poovendran, Radha

    of the important applications of wireless static adhoc net- works includes wireless sensor networks. The technology- cast routing over wireless static adhoc network where host mobility is not involved. We define the lifetime of a network as the dura- tion of time until the first node failure due to battery depletion. We

  11. Community consistency determines the stability transition window of power-grid nodes

    E-Print Network [OSTI]

    Heetae Kim; Sang Hoon Lee; Petter Holme

    2015-04-28

    The synchrony of electric power systems is important in order to maintain stable electricity supply. Recently, the measure basin stability was introduced to quantify a node's ability to recover its synchronization when perturbed. In this work, we focus on how basin stability depends on the coupling strength between nodes. We use the Chilean power grid as a case study. In general, basin stability goes from zero to one as coupling strength increases. However, this transition does not happen at the same value for different nodes. By understanding the transition for individual nodes, we can further characterize their role in the power-transmission dynamics. We find that nodes with an exceptionally large transition window also have a low community consistency. In other words, they are hard to classify to one community when applying a community detection algorithm. This also gives an efficient way to identify nodes with a long transition window (which is computationally time consuming). Finally, to corroborate these results, we present a stylized example network with prescribed community structures that captures the mentioned characteristics of basin stability transition and recreates our observations.

  12. On the Throughput Capacity of Heterogeneous Wireless Networks

    E-Print Network [OSTI]

    Latchman, Haniph A.

    On the Throughput Capacity of Heterogeneous Wireless Networks Pan Li, Member, IEEE, and Yuguang of wireless networks. However, it is commonly assumed that all nodes in the network are identical. The issue of heterogeneous wireless networks with general network settings. Specifically, we consider an extended network

  13. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, D.B.

    1994-07-19

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination. 9 figs.

  14. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, Dario B. (DeSoto, TX)

    1994-01-01

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination.

  15. Effect of surface attractive strength on structural transitions of a confined HP lattice protein

    SciTech Connect (OSTI)

    Pattanasiri, Busara; Li, Ying Wai; Wuest, Thomas; Landau, David P

    2015-01-01

    We investigate the influence of surface attractive strength on structural transitions of a hydrophobic-polar (HP) lattice protein confined in a slit formed by two parallel, attractive walls. We apply Wang-Landau sampling together with efficient Monte Carlo updates to estimate the density of states of the system. The conformational transitions, namely, the debridging process and hydrophobic core formation, can be identified by analyzing the specific heat together with several structural observables, such as the numbers of surface contacts, the number of hydrophobic pairs, and radii of gyration in different directions. As temperature decreases, we find that the occurrence of the debridging process is conditional depending on the surface attractive strength. This, in turn, affects the nature of the hydrophobic core formation that takes place at a lower temperature. We illustrate these observations with the aid of a HP protein chain with 48 monomers.

  16. hp-Cloud Approximation Of The Dirac Eigenvalue Problem: The Way Of Stability

    E-Print Network [OSTI]

    Hasan Almanasreh

    2013-04-05

    We apply $hp$-cloud method to the radial Dirac eigenvalue problem. The difficulty of occurrence of spurious eigenvalues among the genuine ones in the computation is resolved. The method of treatment is based on assuming $hp$-cloud Petrov-Galerkin scheme to construct the weak formulation of the problem which adds a consistent diffusivity to the variational formulation. The size of the artificially added diffusion term is controlled by a stability parameter ($\\tau$). The derivation of $\\tau$ assumes the limit behavior of the eigenvalues at infinity. The parameter $\\tau$ is applicable for generic basis functions. This is combined with the choice of appropriate intrinsic enrichments in the construction of the cloud shape functions.

  17. Magic of Numbers in Networks of Wireless Image Sensors

    E-Print Network [OSTI]

    Rahimi, Mohammed; Ahmadian, Shaun; Zats, David; Laufer, Rafael; Estrin, D

    2006-01-01

    are solved on the battery- operated image sensor nodes andwith wireless battery-operated image sensors, we havedepicts a network of battery- operated image sensors placed

  18. hp-finite-elements for simulating electromagnetic fields in optical devices with rough textures

    E-Print Network [OSTI]

    Burger, S; Hammerschmidt, M; Herrmann, S; Pomplun, J; Schmidt, F; Wohlfeil, B; Zschiedrich, L

    2015-01-01

    The finite-element method is a preferred numerical method when electromagnetic fields at high accuracy are to be computed in nano-optics design. Here, we demonstrate a finite-element method using hp-adaptivity on tetrahedral meshes for computation of electromagnetic fields in a device with rough textures. The method allows for efficient computations on meshes with strong variations in element sizes. This enables to use precise geometry resolution of the rough textures. Convergence to highly accurate results is observed.

  19. Analysis of Energy Conservation in Sensor Networks , K.J.Blow1

    E-Print Network [OSTI]

    Kent, University of

    profile for various levels of sensor network activity and derive an optimum energy saving curve the information to the user or, in general, a data sink. Due to the node's limited transmission range, this forwarding mostly involves using multi-hop paths through other nodes [3]. A node in the network has

  20. AN ASYMPTOTICALLY OPTIMAL APPROACH TO THE DISTRIBUTED ADAPTIVE TRANSMIT BEAMFORMING IN WIRELESS SENSOR NETWORKS

    E-Print Network [OSTI]

    Beigl, Michael

    the plants on a field. As the transmission power of each single node is too weak to reach the distant]. A solution to synchronize carrier signals of distributed wireless nodes is virtual/cooperative MIMO for wireless sen- sor networks [1, 2, 3]. In virtual MIMO for wireless sensor networks, single antenna nodes

  1. Maximizing the Number of Broadcast Operations in Random Geometric Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Calamoneri, Tiziana

    of a node depends, in turn, on the energy power supplied to the node. In particular, the power Pv required by a node v to correctly transmit data to another station w must satisfy the inequality (see [24]): Pv dist, in some network models (like sensor networks), the adopted technology allows to have only few possible

  2. Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

    E-Print Network [OSTI]

    Li, Xiaolin "Andy"

    Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications data measured by source nodes are collected at the fusion node, in-network data aggregation is further among all fusion nodes. Closed-form solutions to the problem of task scheduling are derived. Finally, nu

  3. A Mesh-based Robust Topology Discovery Algorithm for Hybrid Wireless Networks

    E-Print Network [OSTI]

    Birman, Kenneth P.

    A Mesh-based Robust Topology Discovery Algorithm for Hybrid Wireless Networks Ranveer CHANDRA¢ @research.att.com Abstract Wireless networks in home, office and sensor applications consist of nodes by a wireline network. Topology information of the wireless network at these powerful nodes can be used

  4. Fault-tolerant Sensor Network based on Fault Evaluation Matrix and Compensation for Intermittent Observation

    E-Print Network [OSTI]

    Fault-tolerant Sensor Network based on Fault Evaluation Matrix and Compensation for Intermittent-tolerant sensor network configuration problem for a target navigation. A sensor network system consists of many sensor nodes and its network connections. Each sensor node can exchange information by wireless

  5. Eradicating Computer Viruses on Networks

    E-Print Network [OSTI]

    Huang, Jinyu

    2012-01-01

    Spread of computer viruses can be modeled as the SIS (susceptible-infected-susceptible) epidemic propagation. We show that in order to ensure the random immunization or the targeted immunization effectively prevent computer viruses propagation on homogeneous networks, we should install antivirus programs in every computer node and frequently update those programs. This may produce large work and cost to install and update antivirus programs. Then we propose a new policy called "network monitors" to tackle this problem. In this policy, we only install and update antivirus programs for small number of computer nodes, namely the "network monitors". Further, the "network monitors" can monitor their neighboring nodes' behavior. This mechanism incur relative small cost to install and update antivirus programs.We also indicate that the policy of the "network monitors" is efficient to protect the network's safety. Numerical simulations confirm our analysis.

  6. Wang-Landau sampling of the interplay between surface adsorption and folding of HP lattice proteins

    SciTech Connect (OSTI)

    Li, Ying Wai [ORNL] [ORNL; Wuest, Thomas [Swiss Federal Research Institute, Switzerland] [Swiss Federal Research Institute, Switzerland; Landau, David P [University of Georgia, Athens, GA] [University of Georgia, Athens, GA

    2014-01-01

    Generic features associated with the adsorption of proteins on solid surfaces are reviewed within the framework of the hydrophobic-polar (HP) lattice protein model. The thermodynamic behavior and structural properties of various HP protein sequences interacting with attractive surfaces have been studied using extensive Wang-Landau sampling with different types of surfaces, each of which attracts either: all monomers, only hydrophobic (H) monomers, or only polar (P) monomers, respectively. Consequently, different types of folding behavior occur for varied surface strengths. Analysis of the combined patterns of various structural observables, e.g., the derivatives of the numbers of interaction contacts, together with the specific heat, leads to the identification of fundamental categories of folding and transition hierarchies. We also inferred a connection between the transition categories and the relative surface strengths, i.e., the ratios of the surface attractive strengths to the intra-chain attraction among H monomers. We thus believe that the folding hierarchies and identification scheme are generic for different HP sequences interacting with attractive surfaces, regardless of the chain length, sequence, or surface attraction.

  7. Communication: Fixed-node errors in quantum Monte Carlo: Interplay of electron density and node nonlinearities

    SciTech Connect (OSTI)

    Rasch, Kevin M.; Hu, Shuming; Mitas, Lubos [Center for High Performance Simulation and Department of Physics, North Carolina State University, Raleigh, North Carolina 27695 (United States)] [Center for High Performance Simulation and Department of Physics, North Carolina State University, Raleigh, North Carolina 27695 (United States)

    2014-01-28

    We elucidate the origin of large differences (two-fold or more) in the fixed-node errors between the first- vs second-row systems for single-configuration trial wave functions in quantum Monte Carlo calculations. This significant difference in the valence fixed-node biases is studied across a set of atoms, molecules, and also Si, C solid crystals. We show that the key features which affect the fixed-node errors are the differences in electron density and the degree of node nonlinearity. The findings reveal how the accuracy of the quantum Monte Carlo varies across a variety of systems, provide new perspectives on the origins of the fixed-node biases in calculations of molecular and condensed systems, and carry implications for pseudopotential constructions for heavy elements.

  8. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    2014-04-30

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  9. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  10. Parallel processing data network of master and slave transputers controlled by a serial control network

    DOE Patents [OSTI]

    Crosetto, D.B.

    1996-12-31

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor to a plurality of slave processors to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor`s status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer, a digital signal processor, a parallel transfer controller, and two three-port memory devices. A communication switch within each node connects it to a fast parallel hardware channel through which all high density data arrives or leaves the node. 6 figs.

  11. Parallel processing data network of master and slave transputers controlled by a serial control network

    DOE Patents [OSTI]

    Crosetto, Dario B. (DeSoto, TX)

    1996-01-01

    The present device provides for a dynamically configurable communication network having a multi-processor parallel processing system having a serial communication network and a high speed parallel communication network. The serial communication network is used to disseminate commands from a master processor (100) to a plurality of slave processors (200) to effect communication protocol, to control transmission of high density data among nodes and to monitor each slave processor's status. The high speed parallel processing network is used to effect the transmission of high density data among nodes in the parallel processing system. Each node comprises a transputer (104), a digital signal processor (114), a parallel transfer controller (106), and two three-port memory devices. A communication switch (108) within each node (100) connects it to a fast parallel hardware channel (70) through which all high density data arrives or leaves the node.

  12. Dynamic Networks: Recent Results and Applications

    E-Print Network [OSTI]

    Nagurney, Anna

    #12;Energy Networks provide the energy for our homes, schools, and businesses, and to run our vehicles-Making Characterized by: · complex interactions among decision-makers in organizations; · alternative and at times. #12;Duke Energy Gas Pipeline Network #12;Components of Common Physical Networks Network System Nodes

  13. Power-Adaptive Routing Topology for Remote Sensor Networks

    E-Print Network [OSTI]

    Mishra, Prabhat

    has the same critical limitations including computation and transmission capabilities, and limited-node is not in transmission range of a sending node, the network must have the capability to route a message from the sending be handled. The routing of messages causes a large energy burden on each node along a routing path, as each

  14. Information Survival Threshold in Sensor and P2P Networks

    E-Print Network [OSTI]

    Pratt, Vaughan

    between nodes is subject to loss (link failures), and nodes may go down (battery failure, shut down and where links and nodes can go up or down. Consider also a `datum', that is, a piece of information, like a report of an emergency condition in a sensor network, a national traditional song, or a mobile phone

  15. Gossip-based density estimation in dynamic heterogeneous sensor networks

    E-Print Network [OSTI]

    Langendoen, Koen

    , introduce new challenges. Moreover, churn makes the problem even more complicated. In this paper we networks. The devised method supports node mobility and churn, as well as redeployment of new nodes/exit a cluster and they do not have fixed neighbors. One of the other challenges is churn caused by either nodes

  16. Zone routing in a torus network

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  17. Optimized Node Selection for Compressive Sleeping Wireless Sensor Networks

    E-Print Network [OSTI]

    Chen, Wei; Wassell, Ian J.

    2015-02-05

    of the data is exploited. The asymmetric characteristics of WSNs, which typically comprise a smart fusion center (FC) with high power and computational capability and many SNs with limited energy storage and computing capability, motivates the usage of CS [9... -selection algorithm to select a subset of camera sensors for estimating the location of a target while minimizing the energy cost [5]; Fasolo et al. provide different Wei Chen is with the State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong...

  18. Optimal buffer control during congestion in an ATM network node *

    E-Print Network [OSTI]

    Panwar, Shivendra S.

    scheme which creates cells with different priorit.ies[G]. When a cell finds the buffer full upon itr the number of cells to be st,ored in the buffer exceeds the available buffer space, ccriaiii cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By a

  19. The normalization of meshes and nodes in electrical networks 

    E-Print Network [OSTI]

    Johnson, Allen Forrest

    1951-01-01

    , electric logs, drill stem tests, dip logs, and seismic records. Five granite wash fields have been discovered adjacent to the Bravo Dome in Oldham County, Texas; the Lambert 'I, Hryhor, Sundance, Pond, and Brandi. The section at Lambert 1, Hryhor... reservoirs in the Texas Panhandle. This thesis fol'iows the style and format of the American Association of Petroleum Geolo fsts Bulletin. Regional Structure The major positive structural features of the Texas Panhandle consist of the Amarillo Uplift...

  20. Creation and maintenance of a communication tree in wireless sensor networks 

    E-Print Network [OSTI]

    Jung, Eun Jae

    2009-05-15

    A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, ...

  1. Information Capacity of Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

    Information Capacity of Energy Harvesting Sensor Nodes R Rajesh CABS, DRDO Bangalore, India Email by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related

  2. Adjacency Matrix Based Energy Efficient Scheduling using S-MAC Protocol in Wireless Sensor Networks

    E-Print Network [OSTI]

    Singh, Shweta

    2012-01-01

    Communication is the main motive in any Networks whether it is Wireless Sensor Network, Ad-Hoc networks, Mobile Networks, Wired Networks, Local Area Network, Metropolitan Area Network, Wireless Area Network etc, hence it must be energy efficient. The main parameters for energy efficient communication are maximizing network lifetime, saving energy at the different nodes, sending the packets in minimum time delay, higher throughput etc. This paper focuses mainly on the energy efficient communication with the help of Adjacency Matrix in the Wireless Sensor Networks. The energy efficient scheduling can be done by putting the idle node in to sleep node so energy at the idle node can be saved. The proposed model in this paper first forms the adjacency matrix and broadcasts the information about the total number of existing nodes with depths to the other nodes in the same cluster from controller node. When every node receives the node information about the other nodes for same cluster they communicate based on the s...

  3. ODU Sensor Network Research Group 11 Information assuranceInformation assurance

    E-Print Network [OSTI]

    Goddard, Wayne

    network (WSN)Wireless sensor network (WSN) Massive number of sensors densely deployed in the area Network Research Group 1111 Our view of a WSN system sensorssensors local sink nodelocal sink node (in

  4. Catching Paul Revere, An Example Of The Analysis Of A Social Network.

    E-Print Network [OSTI]

    Borchers, Brian

    of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.edu #12;Social Network Analysis A social network of interactions on the internet. For example, the Facebook social network has billions of nodes and edges. #12

  5. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks 

    E-Print Network [OSTI]

    Oh, Eunseuk

    2004-11-15

    As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network fault tolerance, the strong fault tolerance (or ...

  6. Complex networks vulnerability to module-based attacks

    E-Print Network [OSTI]

    da Cunha, Bruno Requião; Gonçalves, Sebastián

    2015-01-01

    In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from practical points of view. In this contribution we present a module-based method to efficiently break complex networks. The procedure first identifies the communities in which the network can be represented, then it deletes the nodes (edges) that connect different modules by its order in the betweenness centrality ranking list. We illustrate the method by applying it to various well known examples of social, infrastructure, and biological networks. We show that the proposed method always outperforms vertex (edge) attacks which are based on the ranking of node (edge) degree or centrality, with a huge gain in efficiency for some examples. Remarkably, for the US power grid, the present method breaks the original network of 4941 nodes to many fragments smaller than 197 nodes (4% of the original size) by removing mere 164 nodes (~3%) identified by the procedure. B...

  7. Performing a scatterv operation on a hierarchical tree network optimized for collective operations

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2013-10-22

    Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.

  8. Minimizing Energy and Maximizing Network Lifetime Multicasting in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Minimizing Energy and Maximizing Network Lifetime Multicasting in Wireless Ad Hoc Networks Weifa Abstract-- Most mobile nodes in a wireless ad hoc network are powered by energy limited batteries, the limited battery lifetime imposes a constraint on the network performance. Therefore, energy efficiency

  9. Network-Aware Overlays with Network Coordinates Peter Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, Margo Seltzer

    E-Print Network [OSTI]

    Mitzenmacher, Michael

    Network-Aware Overlays with Network Coordinates Peter Pietzuch, Jonathan Ledlie, Michael coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for rout- ing table updates in overlay networks. Their power has far

  10. On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks

    E-Print Network [OSTI]

    Lui, John C.S.

    1 On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks Ray K. Lam Dah. This paper studies the use of pricing as an incentive mechanism to stimulate participation and collaboration in public wireless mesh networks. Our focus is on the "economic behavior" of the network nodes-- the pricing

  11. Identifying failure in a tree network of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Pinnow, Kurt W. (Rochester, MN); Wallenfelt, Brian P. (Eden Prairie, MN)

    2010-08-24

    Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

  12. Dynamic sensor tasking in heterogeneous, mobile sensor networks

    E-Print Network [OSTI]

    Jones, Peter B. (Peter B.), S.M., Massachusetts Institute of Technology

    2005-01-01

    Modern sensor environments often attempt to combine several sensors into a single sensor network. The nodes of this network are generally heterogeneous and may vary with respect to sensor complexity, sensor operational ...

  13. Truthful resource management in wireless ad hoc networks 

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01

    In wireless mobile ad hoc networks (MANETs), cooperation cannot be an im- plicit assumption anymore. Each profit-oriented network node has the intention to be selfish due to limited resource possession. In this dissertation, we investigate...

  14. An energy efficient RF transceiver for wireless microsensor networks

    E-Print Network [OSTI]

    Daly, Denis Clarke

    2005-01-01

    A wireless microsensor network consists of a group of sensor nodes that are deployed remotely and used to relay sensing data to the end-user. Due to their remote deployment, large scale wireless sensor networks require a ...

  15. Monte Carlo simulations of the HP model (the "Ising model" of protein folding)

    E-Print Network [OSTI]

    Li, Ying Wai; Landau, David P; 10.1016/j.cpc.2010.12.049

    2011-01-01

    Using Wang-Landau sampling with suitable Monte Carlo trial moves (pull moves and bond-rebridging moves combined) we have determined the density of states and thermodynamic properties for a short sequence of the HP protein model. For free chains these proteins are known to first undergo a collapse "transition" to a globule state followed by a second "transition" into a native state. When placed in the proximity of an attractive surface, there is a competition between surface adsorption and folding that leads to an intriguing sequence of "transitions". These transitions depend upon the relative interaction strengths and are largely inaccessible to "standard" Monte Carlo methods.

  16. Visual Matrix Clustering of Social Networks

    SciTech Connect (OSTI)

    Wong, Pak C.; Mackey, Patrick S.; Foote, Harlan P.; May, Richard A.

    2013-07-01

    The prevailing choices to graphically represent a social network in today’s literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.

  17. Mobile Zigbee Sensor Networks

    E-Print Network [OSTI]

    Anantdeep, Er; Kaur, Er Balpreet

    2010-01-01

    OPNET Modeler accelerates network R&D and improves product quality through high-fidelity modeling and scalable simulation. It provides a virtual environment for designing protocols and devices, and for testing and demonstrating designs in realistic scenarios prior to production. OPNET Modeler supports 802.15.4 standard and has been used to make a model of PAN. Iterations have been performed by changing the Power of the transmitter and the throughput will has been analyzed to arrive at optimal values.An energy-efficient wireless home network based on IEEE 802.15.4, a novel architecture has been proposed. In this architecture, all nodes are classified into stationary nodes and mobile nodes according to the functionality of each node. Mobile nodes are usually battery-powered, and therefore need low-power operation. In order to improve power consumption of mobile nodes, effective handover sequence based on MAC broadcast and transmission power control based on LQ (link quality) are employed. Experimental resul...

  18. Advanced mobile networking, sensing, and controls.

    SciTech Connect (OSTI)

    Feddema, John Todd; Kilman, Dominique Marie; Byrne, Raymond Harry; Young, Joseph G.; Lewis, Christopher L.; Van Leeuwen, Brian P.; Robinett, Rush D. III; Harrington, John J.

    2005-03-01

    This report describes an integrated approach for designing communication, sensing, and control systems for mobile distributed systems. Graph theoretic methods are used to analyze the input/output reachability and structural controllability and observability of a decentralized system. Embedded in each network node, this analysis will automatically reconfigure an ad hoc communication network for the sensing and control task at hand. The graph analysis can also be used to create the optimal communication flow control based upon the spatial distribution of the network nodes. Edge coloring algorithms tell us that the minimum number of time slots in a planar network is equal to either the maximum number of adjacent nodes (or degree) of the undirected graph plus some small number. Therefore, the more spread out that the nodes are, the fewer number of time slots are needed for communication, and the smaller the latency between nodes. In a coupled system, this results in a more responsive sensor network and control system. Network protocols are developed to propagate this information, and distributed algorithms are developed to automatically adjust the number of time slots available for communication. These protocols and algorithms must be extremely efficient and only updated as network nodes move. In addition, queuing theory is used to analyze the delay characteristics of Carrier Sense Multiple Access (CSMA) networks. This report documents the analysis, simulation, and implementation of these algorithms performed under this Laboratory Directed Research and Development (LDRD) effort.

  19. An Extended Network Coding Opportunity Discovery Scheme in Wireless Networks

    E-Print Network [OSTI]

    Zhao, Yunlong; Iwai, Masayuki; Sezaki, Kaoru; Tobe, Yoshito; 10.5121/ijcnc.2012.4106

    2012-01-01

    Network coding is known as a promising approach to improve wireless network performance. How to discover the coding opportunity in relay nodes is really important for it. There are more coding chances, there are more times it can improve network throughput by network coding operation. In this paper, an extended network coding opportunity discovery scheme (ExCODE) is proposed, which is realized by appending the current node ID and all its 1-hop neighbors' IDs to the packet. ExCODE enables the next hop relay node to know which nodes else have already overheard the packet, so it can discover the potential coding opportunities as much as possible. ExCODE expands the region of discovering coding chance to n-hops, and have more opportunities to execute network coding operation in each relay node. At last, we implement ExCODE over the AODV protocol, and efficiency of the proposed mechanism is demonstrated with NS2 simulations, compared to the existing coding opportunity discovery scheme.

  20. Optimum Transmission Range for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Deng, Jing

    Optimum Transmission Range for Wireless Ad Hoc Networks Jing Deng Dept. of EECS Syracuse Univ-- The transmission range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By as- suming the knowledge of node location, we first proposed a transmission

  1. Lifeline: Emergency Ad hoc Network Se-Hang Cheong1

    E-Print Network [OSTI]

    Si, Yain Whar "Lawrence"

    propagation techniques. Lifeline also has the ability to recover from partial crash of network and nodes lost be disrupted during natural disasters, such as earthquakes, hurricane, tsunami, etc. In such situations, mobile from partial crash of network and nodes lost. In this paper, we show how commonly available mobile

  2. DIFS: A Distributed Index for Features in Sensor Networks

    E-Print Network [OSTI]

    Govindan, Ramesh

    of nodes in such networks is energy. Nodes are expected to be long­lived (deployed not for hours minimize energy use. The primary energy consumer in such systems is radio transmission. For one scenario and amount of data produced increase. Consequently, in energy­constrained sensor networks it may be necessary

  3. Monitoring Churn in Wireless Networks Stephan Holzer1

    E-Print Network [OSTI]

    Monitoring Churn in Wireless Networks Stephan Holzer1 , Yvonne Anne Pignolet2 , Jasmin Smula1 a significant amount of churn, the arrival and departure of nodes. In this paper we propose a distributed algorithm for single-hop networks that detects churn and is resilient to a worst-case adversary. The nodes

  4. GPS, Network Analysis, Electric Circuits, Balancing Chemical equations, polynomial interpolations

    E-Print Network [OSTI]

    Choi, Suhyoung

    . Example 3 (Liberty park traffic light) #12; Battery: pumps electrons : flow from + pole Volts: electric One directional flow at a branch Flow conservation at a node: the flow into the node equals the flow out. Flow conservation of the network: The flow into the network equals the flow out. See Example 2

  5. Optimal redundancy against disjoint vulnerabilities in networks

    E-Print Network [OSTI]

    Krause, Sebastian M; Zlati?, Vinko

    2015-01-01

    Redundancy is commonly used to guarantee continued functionality in networked systems. However, often many nodes are vulnerable to the same failure or adversary. A "backup" path is not sufficient if both paths depend on nodes which share a vulnerability.For example, if two nodes of the Internet cannot be connected without using routers belonging to a given untrusted entity, then all of their communication-regardless of the specific paths utilized-will be intercepted by the controlling entity.In this and many other cases, the vulnerabilities affecting the network are disjoint: each node has exactly one vulnerability but the same vulnerability can affect many nodes. To discover optimal redundancy in this scenario, we describe each vulnerability as a color and develop a "color-avoiding percolation" which uncovers a hidden color-avoiding connectivity. We present algorithms for color-avoiding percolation of general networks and an analytic theory for random graphs with uniformly distributed colors including critic...

  6. Class network routing

    DOE Patents [OSTI]

    Bhanot, Gyan (Princeton, NJ); Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton On Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  7. Resource Management for Fading Wireless Channels with Energy Harvesting Nodes

    E-Print Network [OSTI]

    Ulukus, Sennur

    Resource Management for Fading Wireless Channels with Energy Harvesting Nodes Omur Ozel1 , Kaya of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nodes need to adapt to these harvested energy arrivals

  8. Improving Control Performance across AWGN Channels using a Relay Node

    E-Print Network [OSTI]

    Laneman, J. Nicholas

    to a controller across an additive white Gaussian noise channel. The designer can optionally utilize a relay node to assist the controller; however the total transmission power consumed by the sensor and the relay node for the stabilizability of the plant through such schemes. The analysis suggests that it is useful to provide a relay node

  9. PRECLINICAL STUDY Prediction of lymph node involvement in breast cancer

    E-Print Network [OSTI]

    PRECLINICAL STUDY Prediction of lymph node involvement in breast cancer from primary tumor tissue- ther lymph node involvement in breast cancer is influenced by gene or miRNA expression of the primary tissue from a group of 96 breast cancer patients balanced for lymph node involvement using Affymetrix

  10. Computationally Simple Battery Management Techniques for Wireless Nodes

    E-Print Network [OSTI]

    Sarkar, Saswati

    Computationally Simple Battery Management Techniques for Wireless Nodes Maria Adamou 1 and Saswati In this paper, we investigate di#11;erent battery management policies for a wireless node. The goal is to increase the lifetime of a node by exploiting its battery characteristics. We have presented a framework

  11. GEM: Graph EMbedding for Routing and DataCentric Storage in Sensor Networks Without

    E-Print Network [OSTI]

    GEM: Graph EMbedding for Routing and Data­Centric Storage in Sensor Networks Without Geographic), an infrastructure for node­to­node routing and data­centric storage and information processing in sensor networks, or the U.S. Government or any of its agencies. #12; Keywords: Sensor networks, routing, data­centric

  12. GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without

    E-Print Network [OSTI]

    GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic), an infrastructure for node-to-node routing and data-centric storage and information processing in sensor networks University, or the U.S. Government or any of its agencies. #12;Keywords: Sensor networks, routing, data-centric

  13. Name Service in IPv6 Mobile Ad-hoc Network connected to the Internet

    E-Print Network [OSTI]

    Jeong, Jaehoon "Paul"

    Name Service in IPv6 Mobile Ad-hoc Network connected to the Internet Jaehoon Jeong, Jungsoo Park-hoc network connected to the Internet. The DNS resolution of DNS names of mobile nodes within mobile ad-hoc network is performed by multicast DNS and that of DNS names of nodes in the Internet is performed through

  14. PHYSICAL REVIEW E 85, 011138 (2012) Impact of boundaries on fully connected random geometric networks

    E-Print Network [OSTI]

    Dettmann, Carl

    2012-01-01

    including in nanoscience [3], epidemiology [4,5], forest fires [6], social networks [7,8], and wireless of reliable wireless mesh networks. These consist of communication devices (the nodes) that pass messages to each other via other nodes rather than a central router. This allows the network to operate seamlessly

  15. 5232 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 10, OCTOBER 2008 Optimal Node Density for Detection in

    E-Print Network [OSTI]

    Tong, Lang

    to determine the underlying hypothesis. We impose a constraint on the energy consumption of the fusion process for Detection in Energy-Constrained Random Networks Animashree Anandkumar, Student Member, IEEE, Lang Tong the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption

  16. LogP Quantified: The Case for LowOverhead Local Area Networks 16 Workstation

    E-Print Network [OSTI]

    Anderson, Tom

    2000 4000 6000 8000 10000 Average UDP Round­trip Time (usec) User Data Payload Size (bytes) SS Sw. Enet HP Sw. Enet (a) (b) FIGURE 4. Round­trip overheads for actual networks. (a) High­speed networks. (b

  17. Mitigation of Flooding Disruption Attacks in Hierarchical OLSR Networks Gimer Cervera, Michel Barbeau, Joaquin Garcia-Alfaro and Evangelos Kranakis

    E-Print Network [OSTI]

    Kranakis, Evangelos

    Mitigation of Flooding Disruption Attacks in Hierarchical OLSR Networks Gimer Cervera, Michel (MPR) nodes as a flooding mechanism for distributing control information. Unlike OLSR, nodes affect the topol- ogy map acquisition process by interrupting the flooding of control information

  18. Phys 597A CMPS 497EPhys 597A, CMPS 497E Graphs and Networks in Systems Biology

    E-Print Network [OSTI]

    Albert, Réka

    an underlying network topologynetwork topology Internet, router level · nodes: routers, hosts · edges: wires, cables, wireless Q: Which edges are static andQ: Which edges are static and which change? · nodes

  19. Bayesian networks: maths problems March 31, 2009

    E-Print Network [OSTI]

    Barker, Jon

    that the patient smokes, but have not carried out any genetic tests. Symptoms of the disease are coughing (node C) and high temperature (node T). The patient is coughing but does not have a high temperature. Draw coughing. Draw a modified Bayesian network to model this, and discuss qualitatively how your belief about

  20. Improved Connectivity using Hybrid Uni/Omni-Directional Antennas in Sensor Networks 

    E-Print Network [OSTI]

    Kwon, Ji Heon

    2008-05-27

    node deployment densities and transmission radii and the levels of connectivity they guarantee. These results have significant impact on secure routing protocol design for wireless sensor networks and planning network deployments. I also present....2……………………………………………………………… 22 1 CHAPTER I INTRODUCTION 1 Wireless sensor networks (WSNs) consist of small, low-cost, low-power, multifunctional sensor nodes which can communication in short distances. Each sensor nodes consists of sensing, data processing...

  1. Capacitated Node Routing Problems (Preliminary Progress Report)

    E-Print Network [OSTI]

    Ralphs, Ted

    and telecommunications networks under capacity constraints. The CTP [104] models the problem of digging trenches of these problems. Because of the intense effort devoted to solving the well-studied Traveling Salesman Problem (TSP The CNRP is a variant of the well-known fixed-charge network flow problem (FCNFP), in which we have only

  2. Multiresolution Storage and Search in Sensor Networks

    E-Print Network [OSTI]

    Heidemann, John

    battery-operated nodes. Constructing a storage and search system that satisfies the requirements of dataMultiresolution Storage and Search in Sensor Networks DEEPAK GANESAN University of Massachusetts in wireless sensor networks: in-network storage and distributed search. The need for these techniques arises

  3. Caching in wireless networks

    E-Print Network [OSTI]

    Niesen, Urs

    We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. In the most general form, this can be analyzed by considering the 2[superscript n] timesn-dimensional ...

  4. System and method for time synchronization in a wireless network

    DOE Patents [OSTI]

    Gonia, Patrick S. (Maplewood, MN); Kolavennu, Soumitri N. (Blaine, MN); Mahasenan, Arun V. (Kerala, IN); Budampati, Ramakrishna S. (Maple Grove, MN)

    2010-03-30

    A system includes multiple wireless nodes forming a cluster in a wireless network, where each wireless node is configured to communicate and exchange data wirelessly based on a clock. One of the wireless nodes is configured to operate as a cluster master. Each of the other wireless nodes is configured to (i) receive time synchronization information from a parent node, (ii) adjust its clock based on the received time synchronization information, and (iii) broadcast time synchronization information based on the time synchronization information received by that wireless node. The time synchronization information received by each of the other wireless nodes is based on time synchronization information provided by the cluster master so that the other wireless nodes substantially synchronize their clocks with the clock of the cluster master.

  5. Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model

    SciTech Connect (OSTI)

    Agarwala, R. [National Institutes of Health, Bethesda, MD (United States); Batzoglou, S. [MIT Lab. for Computer Science, Cambridge, MA (United States); Dancik, V. [Univ. of Southern California, Los Angeles, CA (United States)] [and others

    1997-12-01

    A long standing problem in molecular biology is to determine the three-dimensional structure of a protein, given its amino acid sequence. A variety of simplifying models have been proposed abstracting only the {open_quotes}essential physical properties{close_quotes} of real proteins. In these models, the three dimensional space is often represented by a lattice. Residues which are adjacent in the primary sequence (i.e. covalently linked) must be placed at adjacent points in the lattice. A conformation of a protein is simply a self-avoiding walk along the lattice. The protein folding problem STRING-FOLD is that of finding a conformation of the protein sequence on the lattice such that the overall energy is minimized, for some reasonable definition of energy. This formulation leaves open the choices of a lattice and an energy function. Once these choices are made, one may then address the algorithmic complexity of optimizing the energy function for the lattice. For a variety of such simple models, this minimization problem is in fact NP-hard. In this paper, we consider the Hydrophobic-Polar (HP) Model introduced by Dill. The HP model abstracts the problem by grouping the 20 amino acids into two classes: hydrophobic (or non-polar) residues and hydrophilic (or polar) residues. For concreteness, we will take our input to be a string from (H,P){sup +}, where P represents polar residues, and H represents hydrophobic residues. Dill et.al. survey the literature analyzing this model. 8 refs., 2 figs., 1 tab.

  6. Downhole drilling network using burst modulation techniques

    DOE Patents [OSTI]

    Hall; David R. (Provo, UT), Fox; Joe (Spanish Fork, UT)

    2007-04-03

    A downhole drilling system is disclosed in one aspect of the present invention as including a drill string and a transmission line integrated into the drill string. Multiple network nodes are installed at selected intervals along the drill string and are adapted to communicate with one another through the transmission line. In order to efficiently allocate the available bandwidth, the network nodes are configured to use any of numerous burst modulation techniques to transmit data.

  7. Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Zhang, Yang; Chong, Edwin K. P.; Hannig, Jan; Estep, Donald

    2013-01-01

    We introduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by N , the number of nodes in the network. As N goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, andmore »possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations. « less

  8. Dispatching packets on a global combining network of a parallel computer

    DOE Patents [OSTI]

    Almasi, Gheorghe (Ardsley, NY); Archer, Charles J. (Rochester, MN)

    2011-07-19

    Methods, apparatus, and products are disclosed for dispatching packets on a global combining network of a parallel computer comprising a plurality of nodes connected for data communications using the network capable of performing collective operations and point to point operations that include: receiving, by an origin system messaging module on an origin node from an origin application messaging module on the origin node, a storage identifier and an operation identifier, the storage identifier specifying storage containing an application message for transmission to a target node, and the operation identifier specifying a message passing operation; packetizing, by the origin system messaging module, the application message into network packets for transmission to the target node, each network packet specifying the operation identifier and an operation type for the message passing operation specified by the operation identifier; and transmitting, by the origin system messaging module, the network packets to the target node.

  9. Address: 125252, Russia, Moscow, Zorge Street, 9, www.farmina.ru The status and development trends of the Russian HP market

    E-Print Network [OSTI]

    Oak Ridge National Laboratory

    of the Russian HP market The experience of STIEBEL ELTRON in HP application can be taken as an example: - more - 180 kW); - object Hypercube , an innovation center Skolkovo, Moscow. STIEBEL ELTRON: - ( 140 the administration offices of the Fund and the first residents. The building is heated by Commodity Stiebel Eltron

  10. A Framework for the Capacity Evaluation of Multihop Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A Framework for the Capacity Evaluation of Multihop Wireless Networks Herv´e Rivano CNRS - INRIA and localized CDS. Index Terms--network capacity, multihop wireless networks, upper and lower bounds, linear programing I. INTRODUCTION Ad hoc networks are spontaneous multihop topologies of wireless nodes

  11. LEARNING-BASED ROUTE MANAGEMENT IN WIRELESS AD HOC NETWORKS

    E-Print Network [OSTI]

    Littman, Michael L.

    and Wade Trappe The nodes in a wireless ad hoc network must act as routers in a self-configuring network to shortest-path routing protocols for managing router congestion and noise in wireless ad hoc networks. iiLEARNING-BASED ROUTE MANAGEMENT IN WIRELESS AD HOC NETWORKS BY BRIAN RUSSELL A dissertation

  12. Comparing the memory system performance of DSS commercial workload in HP V-class and SGI Origin 2000 multiprocessors 

    E-Print Network [OSTI]

    Yu, Rong

    2000-01-01

    in the public domain due to their complexity and high cost. In this thesis, we present a detailed and in-depth memory system performance analysis and comparison of TPC-H benchmark characteristics on SGI Origin 2000 and HP V-Class multiprocessors. The DSS...

  13. Spectrum Leasing via Cooperative Opportunistic Routing in Distributed Ad Hoc Networks: Optimal and Heuristic Policies

    E-Print Network [OSTI]

    Rossi, Michele

    and a set of unlicensed nodes. The primary network consists of a source, a destination and a set Department of Information Engineering, University of Padova, Italy CWCSPR, New Jersey Institute of Technology of additional primary nodes that can act as relays. In addition, the secondary nodes can be used as extra relays

  14. PRO 06 Tenet Architecture for Tiered Embedded Networks PRO 06.1 Overview

    E-Print Network [OSTI]

    Soatto, Stefano

    of energy and network constraints, the tiny nodes themselves would collaboratively process data in continuous data acquisition, and incorporate little or no on-mote multi-node data fusion. We believe that two-based multi-node data fusion makes implementing such functionality a bad tradeoff. By not optimizing

  15. An Efficient Local Strategy to Control Information Spreading in Network

    E-Print Network [OSTI]

    Mehta, Anoop

    2015-01-01

    In social networks, control of rumor spread is an active area of research. SIR model is generally used to study the rumor dynamics in network while considering the rumor as an epidemic. In disease spreading model, epidemic is controlled by removing central nodes in the network. Full network information is needed for such removal. To have the information of complete network is difficult proposition. As a consequence, the search of an algorithm that may control epidemic without needing global information is a matter of great interest. In this paper, an immunization strategy is proposed that uses only local information available at a node, viz. degree of the node and average degree of its neighbour nodes. Proposed algorithm has been evaluated for scale-free network using SIR model. Numerical results show that proposed method has less complexity and gives significantly better results in comparison with other strategies while using only local information.

  16. Abstract--Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks technology. It is

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Abstract-- Wireless Sensor Network (WSN) is an emerging special type of ad-hoc wireless networks that differentiate it from other types of wireless networks. These differences raise new challenges to be overcome are wireless networks where nodes can communicate wirelessly with each other without the need for a fixed

  17. Flexible network wireless transceiver and flexible network telemetry transceiver

    DOE Patents [OSTI]

    Brown, Kenneth D. (Grain Valley, MO)

    2008-08-05

    A transceiver for facilitating two-way wireless communication between a baseband application and other nodes in a wireless network, wherein the transceiver provides baseband communication networking and necessary configuration and control functions along with transmitter, receiver, and antenna functions to enable the wireless communication. More specifically, the transceiver provides a long-range wireless duplex communication node or channel between the baseband application, which is associated with a mobile or fixed space, air, water, or ground vehicle or other platform, and other nodes in the wireless network or grid. The transceiver broadly comprises a communication processor; a flexible telemetry transceiver including a receiver and a transmitter; a power conversion and regulation mechanism; a diplexer; and a phased array antenna system, wherein these various components and certain subcomponents thereof may be separately enclosed and distributable relative to the other components and subcomponents.

  18. Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    repetition-forward and progressive network coding are analyzed with respect to different transmit power. This paper considers the multi-hop transmission prob- lem in wireless ad-hoc networks. In a three-node sce of multi- hop transmission. The new framework, exploiting the technology of progressive network coding

  19. An All-Optical PCI-Express Network Interface for Optical Packet Switched Networks

    E-Print Network [OSTI]

    Bergman, Keren

    An All-Optical PCI-Express Network Interface for Optical Packet Switched Networks Odile Liboiron-latency edge node PCI-Express interface to a WDM optical packet switched network. Scalability is examined under the limits set by PCI-Express jitter specification on the packet propagation. ©2005 Optical Society

  20. Energy savings in wireless ad hoc sensor networks as a result of network synchronisation

    E-Print Network [OSTI]

    Haddadi, Hamed

    Energy savings in wireless ad hoc sensor networks as a result of network synchronisation Antonio of oceanographic monitoring using a collegiate-managed autonomous network of energy-conscious wireless sensors. We-to-node synchronised transmissions in order to reduce overhearing and therefore reduce energy expenses. SSSNP (Self

  1. Method and computer product to increase accuracy of time-based software verification for sensor networks

    DOE Patents [OSTI]

    Foo Kune, Denis (Saint Paul, MN); Mahadevan, Karthikeyan (Mountain View, CA)

    2011-01-25

    A recursive verification protocol to reduce the time variance due to delays in the network by putting the subject node at most one hop from the verifier node provides for an efficient manner to test wireless sensor nodes. Since the software signatures are time based, recursive testing will give a much cleaner signal for positive verification of the software running on any one node in the sensor network. In this protocol, the main verifier checks its neighbor, who in turn checks its neighbor, and continuing this process until all nodes have been verified. This ensures minimum time delays for the software verification. Should a node fail the test, the software verification downstream is halted until an alternative path (one not including the failed node) is found. Utilizing techniques well known in the art, having a node tested twice, or not at all, can be avoided.

  2. ALCF Systems 1: On-Node Goals of This Presentation:

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    And compare with that found in commodity HPC hardware. Highlight aspects of the architecture relevant to code optimization. A BGQ node looks like this: Not this: Data Motion,...

  3. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-01-01

    A method is presented for reducing the number of elements required in a thermal network representation of a building. The method is based on matching the actual building response at two frequencies, the diurnal response and 3-day response. The procedure provides a straightforward methodology for combining all the various materials inside a discrete building zone into a few nodes while retaining a high degree of accuracy in the dynamic response. An example is given showing a comparison between a large network and the reduced network.

  4. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-06-01

    A method is presented for reducing the number of elements required in a thermal network representation of a building. The method is based on matching the actual building response at two frequencies, the diurnal response and 3-day response. The procedure provides a straightforward methodology for combining all the various materials inside a discrete building zone into a few nodes while retaining a high degree of accuracy in the dynamic response. An example is given showing a comparison between a large network and the reduced network.

  5. An Ultra LowPower Processor for Sensor Networks Virantha Ekanayake, Clinton Kelly, IV, and Rajit Manohar

    E-Print Network [OSTI]

    Manohar, Rajit

    node also contains a power source, which can consist of a conventional battery, a renewable source' batteries. Conventional wisdom in sensor network design typically focuses on minimizing communication

  6. An Ultra Low-Power Processor for Sensor Networks Virantha Ekanayake, Clinton Kelly, IV, and Rajit Manohar

    E-Print Network [OSTI]

    Manohar, Rajit

    node also contains a power source, which can consist of a conventional battery, a renewable source' batteries. Conventional wisdom in sensor network design typically focuses on minimizing communication

  7. Sprinkler: A reliable and energy efficient data dissemination service for extreme scale wireless networks of embedded devices

    E-Print Network [OSTI]

    Naik, Vinayak; Arora, Anish; Sinha, Prasun; Zhang, Hongwei

    2007-01-01

    to all the nodes in a wireless network of energy constrainedand Energy Efficient Data Dissemination Service for Wirelessand energy efficient data dissemination service for wireless

  8. Sprinkler: A reliable and energy efficient data dissemination service for extreme scale wireless networks of embedded devices

    E-Print Network [OSTI]

    Naik, Vinayak; Arora, Anish; Sinha, Prasun; Zhang, Hongwei

    2007-01-01

    to all the nodes in a wireless network of energy constrainedand Energy Efficient Data Dissemination Service for Wirelesswireless devices which are constrained in energy and

  9. Exploring a Centralized/Distributed Hybrid Routing Protocol for Low Power Wireless Networks and Large-Scale Datacenters

    E-Print Network [OSTI]

    Tavakoli, Arsalan

    2009-01-01

    we have modified a Meraki Mini wireless router to serve as awireless networks (L2Ns) are composed of a subnet of embedded net- working devices (Node Routers,

  10. Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

    DOE Patents [OSTI]

    Chen, Dong; Eisley, Noel A.; Steinmacher-Burow, Burkhard; Heidelberger, Philip

    2013-01-29

    A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

  11. Sensor Wars: Detecting and Defending Against Spam Attacks in Wireless Sensor Networks

    E-Print Network [OSTI]

    Levi, Albert

    network are discussed in [7]. Security, network bandwidth and power consumption in sensor networksSensor Wars: Detecting and Defending Against Spam Attacks in Wireless Sensor Networks Serdar Sancak@sabanciuniv.edu Abstract--Anti-nodes deployed inside a wireless sensor network can frequently generate dummy data packets

  12. Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Xu, Wenyuan

    operations, military or police networks, and safety-critical business operations such as oil drilling channel. The main advantage of such networks is low cost of deployment and maintenance, since the nodes

  13. The Energy Cost of Cryptographic Key Establishment in Wireless Sensor Networks #

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

    The Energy Cost of Cryptographic Key Establishment in Wireless Sensor Networks # Johann Großsch, Security. Keywords Wireless networking, security protocols, cryptography, key establishment, energy Inffeldgasse 16a, A--8010 Graz, Austria ABSTRACT Wireless sensor nodes generally face serious limitations

  14. Constant Price of Anarchy in Network Creation Games via Public Service Advertising

    E-Print Network [OSTI]

    Demaine, Erik D.

    Network creation games have been studied in many different settings recently. These games are motivated by social networks in which selfish agents want to construct a connection graph among themselves. Each node wants to ...

  15. New approach for calibration the efficiency of HpGe detectors

    SciTech Connect (OSTI)

    Alnour, I. A. [Department of Physics, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia and Department of Physics, Faculty of Pure and Applied Science, International University of Africa, 12223 Khartoum (Sudan); Wagiran, H. [Department of Physics, Faculty of Science, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor (Malaysia); Ibrahim, N. [Faculty of Defence Science and Technology, National Defence University of Malaysia, Kem Sungai Besi, 57000 Kuala Lumpur (Malaysia); Hamzah, S.; Siong, W. B.; Elias, M. S. [Malaysia Nuclear Agency (MNA), Bangi, 43000 Kajang, Selangor (Malaysia)

    2014-02-12

    This work evaluates the efficiency calibrating of HpGe detector coupled with Canberra GC3018 with Genie 2000 software and Ortec GEM25-76-XLB-C with Gamma Vision software; available at Neutron activation analysis laboratory in Malaysian Nuclear Agency (NM). The efficiency calibration curve was constructed from measurement of an IAEA, standard gamma–point sources set composed by {sup 214}Am, {sup 57}Co, {sup 133}Ba, {sup 152}Eu, {sup 137}Cs and {sup 60}Co. The efficiency calibrations were performed for three different geometries: 5, 10 and 15 cm distances from the end cap detector. The polynomial parameters functions were simulated through a computer program, MATLAB in order to find an accurate fit to the experimental data points. The efficiency equation was established from the known fitted parameters which allow for the efficiency evaluation at particular energy of interest. The study shows that significant deviations in the efficiency, depending on the source-detector distance and photon energy.

  16. A quantum access network

    E-Print Network [OSTI]

    Bernd Fröhlich; James F. Dynes; Marco Lucamarini; Andrew W. Sharpe; Zhiliang Yuan; Andrew J. Shields

    2014-09-02

    The theoretically proven security of quantum key distribution (QKD) could revolutionise how information exchange is protected in the future. Several field tests of QKD have proven it to be a reliable technology for cryptographic key exchange and have demonstrated nodal networks of point-to-point links. However, so far no convincing answer has been given to the question of how to extend the scope of QKD beyond niche applications in dedicated high security networks. Here we show that adopting simple and cost-effective telecommunication technologies to form a quantum access network can greatly expand the number of users in quantum networks and therefore vastly broaden their appeal. We are able to demonstrate that a high-speed single-photon detector positioned at a network node can be shared between up to 64 users for exchanging secret keys with the node, thereby significantly reducing the hardware requirements for each user added to the network. This point-to-multipoint architecture removes one of the main obstacles restricting the widespread application of QKD. It presents a viable method for realising multi-user QKD networks with resource efficiency and brings QKD closer to becoming the first widespread technology based on quantum physics.

  17. The extreme vulnerability of interdependent spatially embedded networks

    E-Print Network [OSTI]

    Bashan, Amir; Buldyrev, Sergey V; Havlin, Shlomo

    2015-01-01

    Recent studies show that in interdependent networks a very small failure in one network may lead to catastrophic consequences. Above a critical fraction of interdependent nodes, even a single node failure can invoke cascading failures that may abruptly fragment the system, while below this "critical dependency" (CD) a failure of few nodes leads only to small damage to the system. So far, the research has been focused on interdependent random networks without space limitations. However, many real systems, such as power grids and the Internet, are not random but are spatially embedded. Here we analytically and numerically analyze the stability of systems consisting of interdependent spatially embedded networks modeled as lattice networks. Surprisingly, we find that in lattice systems, in contrast to non-embedded systems, there is no CD and \\textit{any} small fraction of interdependent nodes leads to an abrupt collapse. We show that this extreme vulnerability of very weakly coupled lattices is a consequence of t...

  18. Exploring the Graph of Graphs: Network Evolution and Centrality Distances

    E-Print Network [OSTI]

    Pignolet, Yvonne Anne; Schmid, Stefan; Tredan, Gilles

    2015-01-01

    The topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks. However, surprisingly little is known today about models to compare complex graphs, and quantitatively measure their similarity and dynamics. In the past a variety of node centralities, i.e., functions which assign values to nodes to represent their importance in the graph. Based on such centralities we propose a natural similarity measure for complex networks: the centrality distance $d_C$, the difference between two graphs with respect to a given node centrality $C$. Centrality distances can take the specific roles of the different nodes in the network into account, and have many interesting applications. As a case study, we investigate the evolution of networks with respect to centrality distances and their approximations based on closeness, betweenness, pagerank, clustering and degree cen...

  19. Generating Synthetic RDF Data with Connected Blank Nodes for Benchmarking

    E-Print Network [OSTI]

    Analyti, Anastasia

    of the various techniques for carrying out these tasks, in this paper we present the design and implementation the browsers). In [10] the authors survey the treatment of blank nodes in RDF data and prove the relatively that the inability to match blank nodes increases the delta size (the number of triples that need to be deleted

  20. Everlast: Long-life, Supercapacitor-operated Wireless Sensor Node

    E-Print Network [OSTI]

    Shinozuka, Masanobu

    will demand lower cost per node. Among the ultra low-power, low-cost radios with 1kbps data rate and a range,phchou}@uci.edu ABSTRACT This paper describes a supercapacitor-operated, solar-powered wire- less sensor node called-circuit solar voltage method for maximum power point tracking, enabling the solar cell to efficiently charge

  1. Bridge-Node Selection and Loss Recovery in Island Multicast

    E-Print Network [OSTI]

    Chan, Shueng-Han Gary

    Bridge-Node Selection and Loss Recovery in Island Multicast W.-P. Ken Yiu K.-F. Simon Wong S multicast-capable domains (the so-called islands) while overlay connections are used to bridge islands. In the previously proposed scheme, the number of ping measurements to find good bridge-nodes is at least

  2. Information Capacity of an Energy Harvesting Sensor Node

    E-Print Network [OSTI]

    Viswanath, Pramod

    to electrical energy. Common energy harvesting devices are solar cells, wind turbines and piezo-electric cellsInformation Capacity of an Energy Harvesting Sensor Node R Rajesh, Vinod Sharma and Pramod Viswanath Abstract Energy harvesting sensor nodes are gaining popularity due to their ability to improve

  3. Power Grid Verification Using Node and Branch Nahi Abdul Ghani

    E-Print Network [OSTI]

    Najm, Farid N.

    conservative and tight LP. Results show a dramatic reduction in the number of LPs thus making vectorless grid-case voltage drops which, in turn, entails the solution of as many linear programs (LPs) as there are nodes among node voltage drops and among branch currents. This allows us to replace a group of LPs by one

  4. TRANSPORTATION NODES, REAL ESTATE AND URBAN DEVELOPMENT The Metamorphosis Project

    E-Print Network [OSTI]

    Tufto, Jarle

    1 TRANSPORTATION NODES, REAL ESTATE AND URBAN DEVELOPMENT The Metamorphosis Project Norwegian POTENTIALS FOR PROJECT- AND URBAN DEVELOPMENT AT TRANSPORTATION NODES · TO QUICKLY DEVELOP AN ARCHITECTURAL? · DEVELOP AN URBAN AND ARCHITECTURAL CONCEPT AND PROGRAM · DESIGN AND PRESENT THE PROJECT #12;6 PHOENICIAN

  5. Efficiently Operating Wireless Nodes Powered by Renewable Energy Sources

    E-Print Network [OSTI]

    Gautam, Natarajan

    1 Efficiently Operating Wireless Nodes Powered by Renewable Energy Sources Natarajan Gautam Senior. The node uses energy harvesting in the sense that it is powered by batteries that are charged by renewable that is responsible for transmitting messages in a timely manner while being prudent about energy consumption

  6. Degree distribution of position-dependent ball-passing networks in football games

    E-Print Network [OSTI]

    Narizuka, Takuma; Yamazaki, Yoshihiro

    2015-01-01

    We propose a simple stochastic model describing the position-dependent ball-passing network in football games. In this network, a player on a certain area in the divided fields is a node, and a pass between two nodes corresponds to an edge. Our model is characterized by the consecutive choice of a node dependent on its intrinsic fitness. We derive the explicit expression of the degree distribution, and find that the derived distribution reproduces the real data quit well.

  7. Exploiting Trust Relations for Nash Equilibrium Efficiency in Ad Hoc Networks

    E-Print Network [OSTI]

    Baras, John S.

    Exploiting Trust Relations for Nash Equilibrium Efficiency in Ad Hoc Networks Shanshan Zheng, Tao where the nodes' payoffs are affected by their trust relations. We characterize the Nash equilibrium the interactions among nodes as a game, the Nash equilibria are used to study the operating points of the network

  8. GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic

    E-Print Network [OSTI]

    Song, Dawn

    GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks Without Geographic- ularly data-centric storage and information aggregation, rely on efficient routing from one node-to-node routing and data-centric storage and information processing in sensor networks. Un- like previous

  9. Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search

    E-Print Network [OSTI]

    Santoro, Nicola

    Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search Stefan@scs.carleton.ca Abstract In this paper we consider a dangerous process located at a node of a network (called Black Hole ) and a team of mobile agents deployed to locate that node. The nature of the danger is such that when an agent

  10. Map Construction and Exploration by Mobile Agents Scattered in a Dangerous Network

    E-Print Network [OSTI]

    Santoro, Nicola

    Map Construction and Exploration by Mobile Agents Scattered in a Dangerous Network Paola Flocchini throughout the graph. The problem is further complicated by dangerous elements, nodes and links, in the graph of the network, nodes and links, are unsafe [5­8, 11­19, 23, 24]. The danger is considerable: any agent arriving

  11. Wireless Sensor Networks : the hardware challenge and the cross-layering opportunity

    E-Print Network [OSTI]

    Ingrand, François

    #12;Target applications for wireless sensor networks Flight test instrumentation Pilot ­ crew;Target applications for wireless sensor networks Wireless flight test instrumentation Long term Low or medium data rate, low power nodes High number of nodes, different kind of sensors

  12. SecSens -Security Architecture for Wireless Sensor Networks Faruk Bagci, Theo Ungerer

    E-Print Network [OSTI]

    Ungerer, Theo

    of sensor boards. Keywords: wireless sensor network, security architec- ture, energy efficiency, multi between nodes enhances communication flexibility. Generally, sensor nodes have limited energy and re not be transferred to sensor networks. In recent years, the research was mainly focused on issues related to energy

  13. Calculation of Ambient (H*(10)) and Personal (Hp(10)) Dose Equivalent from a 252Cf Neutron Source

    SciTech Connect (OSTI)

    Traub, Richard J.

    2010-03-26

    The purpose of this calculation is to calculate the neutron dose factors for the Sr-Cf-3000 neutron source that is located in the 318 low scatter room (LSR). The dose factors were based on the dose conversion factors published in ICRP-21 Appendix 6, and the Ambient dose equivalent (H*(10)) and Personal dose equivalent (Hp(10)) dose factors published in ICRP Publication 74.

  14. Multiscale wireless sensor node for impedance-based SHM and low-frequency vibration data acquisition

    SciTech Connect (OSTI)

    Taylor, Stuart G; Farinholt, Kevin M; Park, Gyuhae; Farrar, Charles R; Todd, Michael D

    2009-01-01

    This paper presents recent developments in an extremely compact, wireless impedance sensor node (WID3, Wireless Impedance Device) at Los Alamos National Laboratory for use in impedance-based structural health monitoring (SHM), Sensor diagnostics and low-frequency vibrational data acquisition. The current generation WID3 is equipped with an Analog Devices AD5933 impedance chip that can resolve measurements up to 100 kHz, a frequency range ideal for many SHM applications. An integrated set of multiplexers allows the end user to monitor seven piezoelectric sensors from a single sensor node. The WID3 combines on-board processing using an Atmega1281 microcontroller, data storage using flash memory, wireless communications capabilities, and a series of internal and external triggering options into a single package to realize a truly comprehensive, self-contained wireless active-sensor node for SHM applications. Furthermore, we recently extended the capability of this device by implementing low-frequency analog to digital and digital and analog converters so that the same device can measure structural vibration data. The WID3 requires less than 70 mW of power to operate, and it can operate in various wireless network paradigms. The performance of this miniaturized and portable device is compared to our previous results and its broader capabilities are demonstrated.

  15. The structure of cellular networksThe structure of cellular networks To be able to construct and analyze a cellular network, we need

    E-Print Network [OSTI]

    Albert, Réka

    The structure of cellular networksThe structure of cellular networks To be able to construct and analyze a cellular network, we need to clearly define what we identify as a node and what we represent of cellular component (protein, chemical) or the same type of interaction (mass transfer, regulation). We can

  16. Optimize Storage Placement in Sensor Networks

    E-Print Network [OSTI]

    Li, Qun

    of limited storage, communication capacity, and battery power is ameliorated. Placing storage nodesOptimize Storage Placement in Sensor Networks Bo Sheng, Member, IEEE, Qun Li, Member, IEEE, and Weizhen Mao Abstract--Data storage has become an important issue in sensor networks as a large amount

  17. A Retasking Framework For Wireless Sensor Networks

    E-Print Network [OSTI]

    Weigle, Michele

    used in scientific research, industrial manufacturing, and environmental monitoring over the past-effective. In this paper, we present Alert, a software framework for retasking wireless sensor networks, enabling, built upon Deluge [1], is a wireless network code distribution protocol enabling node group management

  18. Observability of Neuronal Network Motifs (Invited Paper)

    E-Print Network [OSTI]

    Brennan, Sean

    Observability of Neuronal Network Motifs (Invited Paper) Andrew J. Whalen*t, Sean N. Brennan Engineering, + Engineering Science and Mechanics, Neurosurgery, and Physics, Penn State University, University) neuronal networks as a function of 1) the connection topology and sym metry, 2) the measured nodes, and 3

  19. Fractional Immunization in Networks B. Aditya Prakash

    E-Print Network [OSTI]

    Faloutsos, Christos

    § Christos Faloutsos¶ Abstract Preventing contagion in networks is an important prob- lem in public health, the assumption that selected nodes can be rendered completely immune does not hold for infections for which network datasets including US-MEDICARE and state-level interhospital patient transfer data. We find

  20. Optimal Topology Design in Wireless Personal Area Networks

    E-Print Network [OSTI]

    that are typically battery-powered, i.e., that have limited energy resources, and have a limited transmission range a crucial impact on the traffic load distribution within the WPAN, and on the nodes energy consumption. For instance, un- der the assumption that the offered traffic is uniformly distributed among the network nodes

  1. Fault Tolerant Deployment and Topology Control in Wireless Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

    region. Given n wireless nodes V , each with transmission range rn, the wireless networks are often rn. We first consider how the transmission range is related with the number of nodes in a fixed area, the length of the shortest path connecting them in H is no more than a small constant factor of the length

  2. Minimum Energy Coding for Wireless NanoSensor Networks

    E-Print Network [OSTI]

    Shihada, Basem

    Minimum Energy Coding for Wireless NanoSensor Networks Murat Kocaoglu Ozgur B. Akan Next-generation nodes. With their extremely small size, nanosensor nodes can only provide limited energy. Hence, power for their realization. Authors in [1] provide a detailed survey on the state-of-the-art in nanosensors and emphasize

  3. Key Distribution Mechanisms for Wireless Sensor Networks: a Survey

    E-Print Network [OSTI]

    Bystroff, Chris

    . A wireless sensor network (WSN) is composed of large number of sensor nodes with limited power, computation of the nodes increases. If the environment is uncontrolled or the WSN is very large, deployment has to be per] and [Zou and Chakrabarty 2003], this may not be possible for a large scale WSN. Security in WSN has six

  4. An In-Field-Maintenance Framework for Wireless Sensor Networks

    E-Print Network [OSTI]

    Stankovic, John A.

    applications [5] in wireless sensor networks (WSN) typically initialize themselves by self-organizing after deployment. At the conclusion of the self- organizing stage it is common for the nodes of the WSN to know must re-occur, this principle is much more general. For example, even in static WSN some nodes may

  5. Resource Allocation in Sensor Networks with Renewable Energy

    E-Print Network [OSTI]

    Koksal, Can Emre

    Resource Allocation in Sensor Networks with Renewable Energy (Invited Paper) Zhoujia Mao Department@ece.osu.edu Abstract--Renewable energy sources can be attached to sensor nodes to provide energy replenishment of the deployment challenges. These renewable sources of energy could be attached to the nodes and would typically

  6. Degree project 30hp, (20 weeks) at Q-linea AB, Uppsala. The project is aimed to test and evaluate image analysis algorithms for analysis of images obtained

    E-Print Network [OSTI]

    Uppsala Universitet

    Degree project 30hp, (20 weeks) at Q-linea AB, Uppsala. The project is aimed to test and evaluate-lineas sepsis project. Based on a novel and proprietary molecular platform, Q-linea develops fully automated

  7. Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

    SciTech Connect (OSTI)

    Lin, Ying; Wu, Qishi; Zhu, Mengxia; Rao, Nageswara S

    2009-04-01

    Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

  8. Deterministic Scale-Free Networks

    E-Print Network [OSTI]

    Albert-Laszlo Barabasi; Erzsebet Ravasz; Tamas Vicsek

    2002-02-06

    Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other. Here we propose a simple model that generates scale-free networks in a deterministic fashion. We solve exactly the model, showing that the tail of the degree distribution follows a power law.

  9. SCANDEX: Service Centric Networking for Challenged Decentralised Networks

    E-Print Network [OSTI]

    Sathiaseelan, Arjuna; Wang, Liang; Aucinas, Andrius; Tyson, Gareth; Crowcroft, Jon

    2015-05-18

    emerged, operating using ad hoc wireless links. The regional authorities have invested in a Unmanned Aerial Vehicle (UAV) that flies along predeter- mined paths over the disaster zone. When the UAV comes into wireless contact with a DIY network, it can... temporar- ily communicate. The UAV may, or may not, have back- haul Internet connectivity. The UAV and the DIY networks all operate SCNx. For simplicity, all nodes on an intrado- main level utilise the same communications technologies; we assume a...

  10. 1928 IEEE COMMUNICATIONS LETTERS, VOL. 17, NO. 10, OCTOBER 2013 A Small World Network Model for Energy Efficient Wireless Networks

    E-Print Network [OSTI]

    Elkashlan, Maged

    for Energy Efficient Wireless Networks Tiankui Zhang, Jinlong Cao, Yue Chen, Laurie Cuthbert, and Maged considers the battery energy of the wireless nodes, the multi-hop transmission distance and the geographical dis- tance between wireless nodes. In order to quantify the energy efficiency of the proposed model

  11. On the Capacity of Hybrid Wireless Networks Benyuan Liu

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    On the Capacity of Hybrid Wireless Networks Benyuan Liu , Zhen Liu + , Don Towsley Department 704 Yorktown Heights, NY 10598 Abstract-- We study the throughput capacity of hybrid wireless networks stations are assumed to be connected by a high-bandwidth wired network and act as relays for wireless nodes

  12. Assessment and Event Based Analysis of Dynamic Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Assessment and Event Based Analysis of Dynamic Wireless Networks Denis Carvin1,2, Guillaume Kremer1 of mobile nodes in networks is significantly changing the way they are managed. Indeed, these wireless-estimation algorithm for wireless mobile networks. We then provide events' collection and distributed mining methods

  13. Datacenter-Scale Network Research on FPGAs Zhangxi Tan

    E-Print Network [OSTI]

    Asanovi?, Krste

    Datacenter-Scale Network Research on FPGAs Zhangxi Tan Computer Science Division UC Berkeley, CA an FPGA-based datacenter network simulator to allow researchers to rapidly experiment with O(10, 000) node datacenter network architectures. We configure the FPGA hardware to implement abstract models of key dat

  14. An FPGA-based Simulator for Datacenter Networks Zhangxi Tan

    E-Print Network [OSTI]

    Asanovic, Krste

    An FPGA-based Simulator for Datacenter Networks Zhangxi Tan Computer Science Division UC Berkeley an FPGA-based datacenter network simulator for researchers to rapidly experiment with O(10,000) node datacenter network architectures. Our simulation approach configures the FPGA hardware to implement abstract

  15. Effective algorithms and protocols for wireless networking: a topological approach 

    E-Print Network [OSTI]

    Zhang, Fenghui

    2008-10-10

    . . . . . . . . . . . . . . . . . 37 a. Stretch factor vs. node degree . . . . . . . . . . . 38 b. Stretch factor vs. vertex density, network size, and face sampling rate . . . . . . . . . . . . . . . 39 4. Packet overhead . . . . . . . . . . . . . . . . . . . . . 42 5. Adaptivity.... Building a shortest path tree . . . . . . . . . . . . . . 85 3. Planarizing the network layer by layer . . . . . . . . . 85 4. Building a second tree and planarizing the network . . 87 5. Refining the planar graph . . . . . . . . . . . . . . . . 88 C...

  16. A Study of Approximate Data Management Techniques for Sensor Networks

    E-Print Network [OSTI]

    Martin, Ralph R.

    the monitoring operation of sensor nodes by efficiently using their limited energy, bandwidth and computation. The network can therefore be treated as a distributed sensor data management system. Sensor networks differA Study of Approximate Data Management Techniques for Sensor Networks Adonis Skordylis, Niki

  17. On the Endogenous Formation of Energy Efficient Cooperative Wireless Networks

    E-Print Network [OSTI]

    Brown III, Donald R.

    On the Endogenous Formation of Energy Efficient Cooperative Wireless Networks Fatemeh Fazel and D nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks

  18. Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks Weifa Liang, Senior Member, IEEE Abstract--A wireless ad hoc network consists of mobile nodes that are equipped with energy on energy conservation in wireless ad hoc networks have been conducted. For example, energy efficient

  19. Algorithms for Determining Network Robustness Heath J. LeBlanc

    E-Print Network [OSTI]

    Koutsoukos, Xenofon D.

    Algorithms for Determining Network Robustness Heath J. LeBlanc Department of Electrical & Computer.koutsoukos@vanderbilt.edu ABSTRACT In this paper, we study algorithms for determining the robustness of a network. Network robustness algorithms that use purely local strategies are able to succeed in the presence of adversary nodes. Therefore

  20. Prospector: Multiscale Energy Measurement of Networked Embedded Systems with Wideband

    E-Print Network [OSTI]

    of networked, distributed systems, and usually energy-constrained. Moreover, in wirelessly-networked devices, the technological and human cost of energy and replenishment of energy supplies are dominant. Wireless sensor embedded systems. With respect to energy efficiency, wireless sensor network (WSN) nodes are at the leading

  1. Duty-Cycle-Aware Broadcast in Wireless Sensor Networks

    E-Print Network [OSTI]

    Liu, Jiangchuan (JC)

    active and dormant states, so as to conserve energy and extend the network lifetime. Unfortunately fails to capture the uniqueness of energy-constrained wireless sensor networks. The sensor nodesDuty-Cycle-Aware Broadcast in Wireless Sensor Networks Feng Wang Jiangchuan Liu School of Computing

  2. EBRP: Energy Band based Routing Protocol for Wireless Sensor Networks

    E-Print Network [OSTI]

    Durresi, Arjan

    EBRP: Energy Band based Routing Protocol for Wireless Sensor Networks Sasanka Madiraju Cariappa in an intelligent manner. We study the concept of energy fairness in routing in Sensor Networks so as to increase to route data based on the residual energy of the nodes. This algorithm divides the network into different

  3. Enhancing Fairness in Wireless Multi-Hop Networks (Invited Paper)

    E-Print Network [OSTI]

    Vouyioukas, Demosthenes

    as a router and forwards packets for other nodes. Wireless multi-hop networks have many applicationsEnhancing Fairness in Wireless Multi-Hop Networks (Invited Paper) Dimitrios D. Vergados University, Greece +302273082237 janag@aegean.gr ABSTRACT Wireless multi-hop networks have recently been conceived

  4. Network growth by copying P. L. Krapivsky1,

    E-Print Network [OSTI]

    Redner, Sidney

    for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USA Received 18 October networks where the node degree also grows slowly with time--the Internet and the citation network of all remains finite as N . However, in other examples of real sparse networks, such as the Internet

  5. Profit-based Routing for Centralized Wireless Networks

    E-Print Network [OSTI]

    Bahk, Saewoong

    costs the power consumption of the reIaying users, which is a serious obstaclefor the multi-hop network compensates the relaying users for their power consumption cost. In this strategy, each mobile node can fiod of central control - ad hoc and infrastructure. The ad hoc network has a self-organizing network structure

  6. Maximizing Battery Life Routing in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

    Maximizing Battery Life Routing in Wireless Ad Hoc Networks Weifa Liang Department of Computer Abstract--Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power con, for an ad hoc network consisting of the same type of battery mobile nodes, two approximation algorithms

  7. Multi-Node Thermal System Model for Lithium-Ion Battery Packs: Preprint

    SciTech Connect (OSTI)

    Shi, Ying; Smith, Kandler; Wood, Eric; Pesaran, Ahmad

    2015-09-14

    Temperature is one of the main factors that controls the degradation in lithium ion batteries. Accurate knowledge and control of cell temperatures in a pack helps the battery management system (BMS) to maximize cell utilization and ensure pack safety and service life. In a pack with arrays of cells, a cells temperature is not only affected by its own thermal characteristics but also by its neighbors, the cooling system and pack configuration, which increase the noise level and the complexity of cell temperatures prediction. This work proposes to model lithium ion packs thermal behavior using a multi-node thermal network model, which predicts the cell temperatures by zones. The model was parametrized and validated using commercial lithium-ion battery packs. neighbors, the cooling system and pack configuration, which increase the noise level and the complexity of cell temperatures prediction. This work proposes to model lithium ion packs thermal behavior using a multi-node thermal network model, which predicts the cell temperatures by zones. The model was parametrized and validated using commercial lithium-ion battery packs.

  8. The CitiSense Air Quality Monitoring Mobile Sensor Node Piero Zappi, Elizabeth Bales, Jing Hong Park, William Griswold and Tajana Simuni Rosing

    E-Print Network [OSTI]

    Simunic, Tajana

    conditions than the national ambient air quality standard [1]. Current air pollutant measurement networks. For example, The San Diego Air Pollution Control District (SDAPCD) maintains only five air pollutant samplingThe CitiSense Air Quality Monitoring Mobile Sensor Node Piero Zappi, Elizabeth Bales, Jing Hong

  9. The multicast capacity region of large wireless networks

    E-Print Network [OSTI]

    Shah, Devavrat

    We study the problem of determining the multicast capacity region of a wireless network of n nodes randomly located in an extended area and communicating with each other over Gaussian fading channels. We obtain an explicit ...

  10. Computing the Capacity Region of a Wireless Network

    E-Print Network [OSTI]

    Gummadi, Ramakrishna

    We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient and distributed algorithm to determine the ...

  11. ESF/PESC Exploratory Workshop on Wireless Sensor Networks

    E-Print Network [OSTI]

    on the bathymetry of the ocean ground beneath a wind farm using sensor networks. Philippe Bonnet outlined a newly allow the construction of so-called sensor nodes ­ small autonomous devices that combine sensing

  12. An Evaluation of Sensing Platforms Used for Sensor Network Research

    E-Print Network [OSTI]

    Kansas, University of

    An Evaluation of Sensing Platforms Used for Sensor Network Research Daniel T. Fokum, Dr. Victor S to complex sensor nodes; which include fully configured computers. Several of these platforms were evaluated ................................................................................................................. 2 3 Evaluation of Sensor Platforms

  13. Industrial Applications of Networked Control Karl H. Johansson

    E-Print Network [OSTI]

    Johansson, Karl Henrik

    fuel efficiency using networked sensing · Disaster relief support using mobile relay nodes demonstration integrating ABBSiemensSAP systems 1718 Jun 2008 Supervisory Web services ABB 800xA OPC

  14. Dynamic Resource Allocation for Multi Source-Destination Relay Networks

    E-Print Network [OSTI]

    Erkip, Elza

    Electrical and Computer Engineering, Polytechnic University, Brooklyn, New York, USA Email: osahin01@utopia architecture, in which some of the nodes in the network are more capable than the others in terms of signal

  15. The flux measure of influence in engineering networks

    E-Print Network [OSTI]

    Schwing, Kyle Michael

    2009-01-01

    The objective of this project is to characterize the influence of individual nodes in complex networks. The flux metric developed here achieves this goal by considering the difference between the weighted outdegree and ...

  16. Challenges and Solutions for Intrusion Detection in Wireless Mesh Networks 

    E-Print Network [OSTI]

    Hassanzadeh, Amin

    2014-05-03

    The problem of intrusion detection in wireless mesh networks (WMN) is challenging, primarily because of lack of single vantage points where traffic can be analyzed and the limited resources available to participating nodes. Although the problem has...

  17. Direct Information Exchange in Wireless Networks: A Coding Perspective 

    E-Print Network [OSTI]

    Ozgul, Damla

    2011-10-21

    The rise in the popularity of smartphones such as Blackberry and iPhone creates a strain on the world's mobile networks. The extensive use of these mobile devices leads to increasing congestion and higher rate of node ...

  18. Worst-Case Analysis of Network Design Problem Heuristics

    E-Print Network [OSTI]

    Wong, Richard T.

    The Optimal Network problem (as defined by Scott [16]) consists of selecting a subset of arcs that minimizes the sum of the shortest paths between all nodes subject to a budget constraint. This paper considers the worst-case ...

  19. Decentralized detection in resource-limited sensor network architectures

    E-Print Network [OSTI]

    Tay, Wee Peng

    2008-01-01

    We consider the problem of decentralized binary detection in a network consisting of a large number of nodes arranged as a tree of bounded height. We show that the error probability decays exponentially fast with the number ...

  20. Decentralized TDOA Sensor Pairing in Multihop Wireless Sensor Networks

    E-Print Network [OSTI]

    Meng, Wei; Lihua, Xie; Wendong, Xiao

    2013-01-01

    a wireless sensor network (WSN). Most of the existing worksWe consider a multihop WSN. Given a team of nodes per-us represent a multihop WSN as a graph defined by , where is

  1. Interference management techniques in large-scale wireless networks 

    E-Print Network [OSTI]

    Luo, Yi

    2015-06-29

    In this thesis, advanced interference management techniques are designed and evaluated for large-scale wireless networks with realistic assumptions, such as signal propagation loss, random node distribution and ...

  2. Phys 597A: Graphs and Networks in Systems Biology

    E-Print Network [OSTI]

    Albert, Réka

    systems have an underlying network topology · nodes: routers, hosts · edges: wires, cables, wireless Q Q: What is the nature of edges? Internet, router level Internet, domain level #12;Map

  3. Inspiration from genetics to promote recognition and protection within ad hoc sensor networks

    E-Print Network [OSTI]

    Korsnes, Reinert

    2009-01-01

    This work illustrates potentials for recognition within {\\em ad hoc} sensor networks if their nodes possess individual inter-related biologically inspired genetic codes. The work takes ideas from natural immune systems protecting organisms from infection. Nodes in the present proposal have individual gene sets fitting into a self organised phylogenetic tree. Members of this population are genetically ''relatives''. Outsiders cannot easily copy or introduce a new node in the network without going through a process of conception between two nodes in the population. Related nodes can locally decide to check each other for their genetic relation without directly revealing their gene sets. A copy/clone of a gene sequence or a random gene set will appear as alien. Nodes go through a cycle of introduction (conception or ''birth'') with parents in the network and later exit from it (''death''). Hence the phylogenetic tree is dynamic or possesses a genetic drift. Typical lifetimes of gene sets and number of offspring ...

  4. Transmission Policies for Asymmetric Interference Channels with Energy Harvesting Nodes

    E-Print Network [OSTI]

    Yener, Aylin

    Transmission Policies for Asymmetric Interference Channels with Energy Harvesting Nodes Kaya power policies to maximize sum capacity in an energy harvesting setting. It is shown derive optimal power allocation policies for interference channels comprised of energy harvesting

  5. Distributed Gradient Methods with Variable Number of Working Nodes

    E-Print Network [OSTI]

    2015-04-15

    cost function fi : Rd ?? R known only by i, and the nodes want to solve the ...... programing,” Journal of Computational and Applied Mathematics, vol. 217, no. 2. [28] R. ... optimization and statistical learning via the alternating direction method.

  6. A Regularized Graph Layout Framework for Dynamic Network Visualization

    E-Print Network [OSTI]

    Xu, Kevin S; Hero, Alfred O

    2012-01-01

    Many real-world networks, including social and information networks, are dynamic structures that evolve over time. Such dynamic networks are typically visualized using a sequence of static graph layouts. In addition to providing a visual representation of the network topology at each time step, the sequence should preserve the mental map between layouts of consecutive time steps to allow a human to interpret the temporal evolution of the network. In this paper, we propose a framework for dynamic network visualization using regularized graph layouts. Regularization encourages stability of the layouts over time, thus preserving the mental map. The proposed framework involves optimizing a modified cost function that augments the cost function of a static graph layout algorithm with a grouping penalty, which encourages nodes to stay close to other nodes belonging to the same group, and a temporal penalty, which encourages smooth movements of the nodes over time. We introduce two dynamic layout algorithms under th...

  7. Structure-Preserving Sparsification of Social Networks

    E-Print Network [OSTI]

    Lindner, Gerd; Hamann, Michael; Meyerhenke, Henning; Wagner, Dorothea

    2015-01-01

    Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different contexts. We contribute the first systematic conceptual and experimental comparison of \\textit{edge sparsification} methods on a diverse set of network properties. It is shown that they can be understood as methods for rating edges by importance and then filtering globally by these scores. In addition, we propose a new sparsification method (\\textit{Local Degree}) which preserves edges leading to local hub nodes. All methods are evaluated on a set of 100 Facebook social networks with respect to network properties including diameter, connected components, community structure, and multiple node centrality measures. Experiments with our implementations of the sparsification methods (using the open-source network analysis tool suite NetworKit) show that many network properties can be preserved down to about 20\\% of the original set of edges....

  8. Network support for system initiated checkpoints

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip

    2013-01-29

    A system, method and computer program product for supporting system initiated checkpoints in parallel computing systems. The system and method generates selective control signals to perform checkpointing of system related data in presence of messaging activity associated with a user application running at the node. The checkpointing is initiated by the system such that checkpoint data of a plurality of network nodes may be obtained even in the presence of user applications running on highly parallel computers that include ongoing user messaging activity.

  9. Maximizing Network Lifetime Via 3G Gateway Assignment in Dual-Radio Sensor Networks

    E-Print Network [OSTI]

    Liang, Weifa

    - ments, such as temperature, humidity, wind, solar radiation, etc. [3]. Sensor nodes are typically as well as in the idling cost [5]. If all sensors are gateways, they will run out of energy within a shortMaximizing Network Lifetime Via 3G Gateway Assignment in Dual-Radio Sensor Networks Xu Xu, Weifa

  10. Nondestructive Monitoring of a Pipe Network using a MEMS-Based Wireless Network

    E-Print Network [OSTI]

    Shinozuka, Masanobu

    , MEMS sensors, ruptures, wireless sensor network 1. INTRODUCTION Pressurized pipeline systems-electro-mechanical systems (MEMS)-based wireless sensor network (WSN). It is composed of sensing nodes, each of which for data uplink. A sensor board is equipped with MEMS accelerometers for measuring vibration

  11. LHAP: A Lightweight Network Access Control Protocol for Ad-Hoc Networks

    E-Print Network [OSTI]

    Xu, Shouhuai

    , One-way Key Chain, TESLA I. INTRODUCTION In ad hoc wireless networks, no base stations exist and every of the nodes relaying the packets. For example, since mobile hosts are usually battery powered, they are susceptible to battery exhaustion attacks [36]. Clearly, a network access control capability is essential

  12. Network Management Network Management

    E-Print Network [OSTI]

    Giaccone, Paolo

    Network Management Pag. 1 Network Management Network management and QoS provisioning - 1Andrea of this license visit: http://creativecommons.org/licenses/by-nc- /3 0/ Network management and QoS provisioning ­ Chapter 9, Network Management, of the book Jim Kurose, Keith Ross, Computer Networking, A Top Down

  13. An Approximation Algorithm for Data Storage Placement in Sensor Networks Bo Sheng, Chiu C. Tan, Qun Li, and Weizhen Mao

    E-Print Network [OSTI]

    Mao, Weizhen

    .g., flash memory) and more battery power. In such a hybrid sensor network, these storage nodes collect nodes, the concerns of limited storage, communication capacity, and battery power are amelioratedAn Approximation Algorithm for Data Storage Placement in Sensor Networks Bo Sheng, Chiu C. Tan, Qun

  14. Broadcast Capacity in Multihop Wireless Networks Alireza Keshavarz-Haddad Vinay Ribeiro Rudolf Riedi

    E-Print Network [OSTI]

    Riedi, Rudolf H.

    Broadcast Capacity in Multihop Wireless Networks Alireza Keshavarz-Haddad Vinay Ribeiro Rudolf of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated of source nodes or the dimension of the network. 1. INTRODUCTION In wireless networks, broadcast plays

  15. Local Solutions for Global Problems in Wireless Networks May 1, 2006

    E-Print Network [OSTI]

    Urrutia, Jorge

    Local Solutions for Global Problems in Wireless Networks J. Urrutia May 1, 2006 Abstract wireless networks by means of local algorithms. A local algorithm is one in which any node of a network a unit distance wireless network N, we want to obtain a planar subnetwork of N by means of an algorithm

  16. Distributed Information Storage and Retrieval in 3D Sensor Networks with General Topologies

    E-Print Network [OSTI]

    Jin, Miao

    Yang, Miao Jin, Yao Zhao, and Hongyi Wu Abstract--Distributed in-network data-centric processing aims of the individual network nodes. Double-ruling based schemes support efficient in-network data-centric information distributed in-network data-centric processing schemes. In this research we propose a geographic location free

  17. Impact of Social Relation and Group Size in Multicast Ad Hoc Networks

    E-Print Network [OSTI]

    Wang, Xinbing

    1 Impact of Social Relation and Group Size in Multicast Ad Hoc Networks Yi Qin, Riheng Jia, Jinbei wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled as power

  18. Motif analysis in directed ordered networks and applications to food webs

    E-Print Network [OSTI]

    Paulau, Pavel V; Blasius, Bernd

    2015-01-01

    The analysis of small recurrent substructures, so called network motifs, has become a standard tool of complex network science to unveil the design principles underlying the structure of empirical networks. In many natural systems network nodes are associated with an intrinsic property according to which they can be ordered and compared against each other. Here, we expand standard motif analysis to be able to capture the hierarchical structure in such ordered networks. Our new approach is based on the identification of all ordered 3-node substructures and the visualization of their significance profile. We present a technique to calculate the fine grained motif spectrum by resolving the individual members of isomorphism classes (sets of substructures formed by permuting node-order). We apply this technique to computer generated ensembles of ordered networks and to empirical food web data, demonstrating the importance of considering node order for food-web analysis. Our approach may not only be helpful to iden...

  19. DOEIEV-0005/33 ANL-OHS/HP-82-104 FORMERLY UTILIZED MED/AEC SITES

    Office of Legacy Management (LM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield Municipal Gas &SCE-SessionsSouth DakotaRobbins and700, 1.Reports1 Rev. 033 ANL-OHS/HP-82-104

  20. Topology management protocols in ad hoc wireless sensor networks 

    E-Print Network [OSTI]

    Kim, Hogil

    2009-05-15

    and destination. The multiple paths discovered are maintained in a memory, i.e., route cache, and can be used either as a backup route for a broken path or to balance network tra c. However, the decision procedure to nd an optimal path to balance network tra c... in this work. From the set S of all sensor nodes, All sensor nodes 1st-layer 2nd-layer Kth -layer Fig. 1. K-Layer Coverage we select only a small number of nodes to form 1-coverage and repeat this process K times to form K-coverage. A set Si, which is ith...

  1. Improving energy efficiency in wireless sensor networks through scheduling and routing

    E-Print Network [OSTI]

    R, Rathna; 10.5121/ijassn.2012.2103

    2012-01-01

    This paper is about the wireless sensor network in environmental monitoring applications. A Wireless Sensor Network consists of many sensor nodes and a base station. The number and type of sensor nodes and the design protocols for any wireless sensor network is application specific. The sensor data in this application may be light intensity, temperature, pressure, humidity and their variations .Clustering and routing are the two areas which are given more attention in this paper.

  2. A Data Gathering Scheme in Wireless Sensor Networks Based on Synchronization of Chaotic Spiking Oscillator Networks

    SciTech Connect (OSTI)

    Nakano, Hidehiro; Utani, Akihide; Miyauchi, Arata; Yamamoto, Hisao [Tokyo City University (Japan)

    2011-04-19

    This paper studies chaos-based data gathering scheme in multiple sink wireless sensor networks. In the proposed scheme, each wireless sensor node has a simple chaotic oscillator. The oscillators generate spike signals with chaotic interspike intervals, and are impulsively coupled by the signals via wireless communication. Each wireless sensor node transmits and receives sensor information only in the timing of the couplings. The proposed scheme can exhibit various chaos synchronous phenomena and their breakdown phenomena, and can effectively gather sensor information with the significantly small number of transmissions and receptions compared with the conventional scheme. Also, the proposed scheme can flexibly adapt various wireless sensor networks not only with a single sink node but also with multiple sink nodes. This paper introduces our previous works. Through simulation experiments, we show effectiveness of the proposed scheme and discuss its development potential.

  3. Axillary lymph node dose with tangential breast irradiation

    SciTech Connect (OSTI)

    Reed, Daniel R. . E-mail: drreed@u.washington.edu; Lindsley, Skyler Karen; Mann, Gary N.; Austin-Seymour, Mary; Korssjoen, Tammy; Anderson, Benjamin O.; Moe, Roger

    2005-02-01

    Purpose: The advent of sentinel lymph node mapping and biopsy in the staging of breast cancer has resulted in a significant decrease in the extent of axillary nodal surgery. As the extent of axillary surgery decreases, the radiation dose and distribution within the axilla becomes increasingly important for current therapy planning and future analysis of results. This analysis examined the radiation dose distribution delivered to the anatomically defined axillary level I and II lymph node volume and surgically placed axillary clips with conventional tangential breast fields and CT-based three-dimensional (3D) planning. Methods and materials: Fifty consecutive patients with early-stage breast cancer undergoing breast conservation therapy were evaluated. All patients underwent 3D CT-based planning with conventional breast tangential fields designed to encompass the entire breast parenchyma. Using CT-based 3D planning, the dose distribution of the standard tangential breast irradiation fields was examined in relationship to the axillary level I and II lymph node volumes. Axillary level I and II lymph node anatomic volumes were defined by CT and surgical clips placed during complete level I-II lymph node dissection. Axillary level I-II lymph node volume doses were examined on the basis of the prescribed breast radiation dose and 3D dose distribution. Results: All defined breast volumes received {>=}95% of the prescribed dose. By contrast, the 95% isodose line encompassed only an average of 55% (range, 23-87%) of the axillary level I-II lymph node anatomic volume. No patient had complete coverage of the axillary level I-II lymph node region by the 95% isodose line. The mean anatomic axillary level I-II volume was 146.3 cm{sup 3} (range, 83.1-313.0 cm{sup 3}). The mean anatomic axillary level I-II volume encompassed by the 95% isodose line was 84.9 cm{sup 3} (range, 25.1-219.0 cm{sup 3}). The mean 95% isodose coverage of the surgical clip volume was 80%, and the median value was 81% (range, 58-98%). The mean volume deficit between the axillary level I-II volume and the surgical clip volume was 41.7 cm{sup 3} (median, 30.0 cc). Conclusion: In this study, standard tangential breast radiation fields failed to deliver a therapeutic dose adequately to the axillary level I-II lymph node anatomic volume. No patient received complete coverage of the axillary level I-II lymph node volume. Surgically placed axillary clips also failed to delineate the level I-II axilla adequately. Definitive irradiation of the level I and II axillary lymph node region requires significant modification of standard tangential fields, best accomplished with 3D treatment planning, with specific targeting of anatomically defined axillary lymph node volumes as described, in addition to the breast parenchymal volumes.

  4. Application Independent Energy Efficient Data Aggregation in Wireless Sensor Networks

    E-Print Network [OSTI]

    Virmani, Deepali; Ghanshyam,; Ahlawat, Khyati; Noble,

    2012-01-01

    Wireless Sensor networks are dense networks of small, low-cost sensors, which collect and disseminate environmental data and thus facilitate monitoring and controlling of physical environment from remote locations with better accuracy. The major challenge is to achieve energy efficiency during the communication among the nodes. This paper aims at proposing a solution to schedule the node's activities to reduce the energy consumption. We propose the construction of a decentralized lifetime maximizing tree within clusters. We aim at minimizing the distance of transmission with minimization of energy consumption. The sensor network is distributed into clusters based on the close proximity of the nodes. Data transfer among the nodes is done with a hybrid technique of both TDMA/ FDMA which leads to efficient utilization of bandwidth and maximizing throughput.

  5. On computer vision in wireless sensor networks.

    SciTech Connect (OSTI)

    Berry, Nina M.; Ko, Teresa H.

    2004-09-01

    Wireless sensor networks allow detailed sensing of otherwise unknown and inaccessible environments. While it would be beneficial to include cameras in a wireless sensor network because images are so rich in information, the power cost of transmitting an image across the wireless network can dramatically shorten the lifespan of the sensor nodes. This paper describe a new paradigm for the incorporation of imaging into wireless networks. Rather than focusing on transmitting images across the network, we show how an image can be processed locally for key features using simple detectors. Contrasted with traditional event detection systems that trigger an image capture, this enables a new class of sensors which uses a low power imaging sensor to detect a variety of visual cues. Sharing these features among relevant nodes cues specific actions to better provide information about the environment. We report on various existing techniques developed for traditional computer vision research which can aid in this work.

  6. Statistical Analysis of Bus Networks in India

    E-Print Network [OSTI]

    Chatterjee, Atanu; Ramadurai, Gitakrishnan

    2015-01-01

    Through the past decade the field of network science has established itself as a common ground for the cross-fertilization of exciting inter-disciplinary studies which has motivated researchers to model almost every physical system as an interacting network consisting of nodes and links. Although public transport networks such as airline and railway networks have been extensively studied, the status of bus networks still remains in obscurity. In developing countries like India, where bus networks play an important role in day-to-day commutation, it is of significant interest to analyze its topological structure and answer some of the basic questions on its evolution, growth, robustness and resiliency. In this paper, we model the bus networks of major Indian cities as graphs in \\textit{L}-space, and evaluate their various statistical properties using concepts from network science. Our analysis reveals a wide spectrum of network topology with the common underlying feature of small-world property. We observe tha...

  7. The Cost of Attack in Competing Networks

    E-Print Network [OSTI]

    Podobnik, B; Lipic, T; Perc, M; Buldu, J M; Stanley, H E

    2015-01-01

    Real-world attacks can be interpreted as the result of competitive interactions between networks, ranging from predator-prey networks to networks of countries under economic sanctions. Although the purpose of an attack is to damage a target network, it also curtails the ability of the attacker, which must choose the duration and magnitude of an attack to avoid negative impacts on its own functioning. Nevertheless, despite the large number of studies on interconnected networks, the consequences of initiating an attack have never been studied. Here, we address this issue by introducing a model of network competition where a resilient network is willing to partially weaken its own resilience in order to more severely damage a less resilient competitor. The attacking network can take over the competitor nodes after their long inactivity. However, due to a feedback mechanism the takeovers weaken the resilience of the attacking network. We define a conservation law that relates the feedback mechanism to the resilie...

  8. Performing an allreduce operation on a plurality of compute nodes of a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-07-09

    Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

  9. Microfluidic ultrasonic particle separators with engineered node locations and geometries

    DOE Patents [OSTI]

    Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christoppher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

    2014-05-20

    An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

  10. Structure and inference in annotated networks

    E-Print Network [OSTI]

    Newman, M E J

    2015-01-01

    For many networks of scientific interest we know both the connections of the network and information about the network nodes, such as the age or gender of individuals in a social network, geographic location of nodes in the Internet, or cellular function of nodes in a gene regulatory network. Here we demonstrate how this "metadata" can be used to improve our analysis and understanding of network structure. We focus in particular on the problem of community detection in networks and develop a mathematically principled approach that combines a network and its metadata to detect communities more accurately than can be done with either alone. Crucially, the method does not assume that the metadata are correlated with the communities we are trying to find. Instead the method learns whether a correlation exists and correctly uses or ignores the metadata depending on whether they contain useful information. The learned correlations are also of interest in their own right, allowing us to make predictions about the co...

  11. Flow Distances on Open Flow Networks

    E-Print Network [OSTI]

    Guo, Liangzhu; Shi, Peiteng; Wang, Jun; Huang, Xiaohan; Zhang, Jiang

    2015-01-01

    Open flow network is a weighted directed graph with a source and a sink, depicting flux distributions on networks in the steady state of an open flow system. Energetic food webs, economic input-output networks, and international trade networks, are open flow network models of energy flows between species, money or value flows between industrial sectors, and goods flows between countries, respectively. Flow distances (first-passage or total) between any given two nodes $i$ and $j$ are defined as the average number of transition steps of a random walker along the network from $i$ to $j$ under some conditions. They apparently deviate from the conventional random walk distance on a closed directed graph because they consider the openness of the flow network. Flow distances are explicitly expressed by underlying Markov matrix of a flow system in this paper. With this novel theoretical conception, we can visualize open flow networks, calculating centrality of each node, and clustering nodes into groups. We apply fl...

  12. Minimal paths between communities induced by geographical networks

    E-Print Network [OSTI]

    de Arruda, Henrique Ferraz; Costa, Luciano da Fontoura

    2015-01-01

    In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that nodes with large betweenness define what we call characteristic betweenness paths in both modeled and real-world geographical networks. We define a geographical network model that possess a simple topology while still being able to present such betweenness paths. Using this model, we show that such paths represent pathways between entry and exit points of highly connected regions, or communities, of geographical networks. By defining a new network, containing information about community adjacencies in the original network, we describe a means to characterize the mesoscale connectivity provided by such characteristic betweenness paths.

  13. Complex network synchronization of chaotic systems with delay coupling

    SciTech Connect (OSTI)

    Theesar, S. Jeeva Sathya, E-mail: sjstheesar@gmail.com; Ratnavelu, K., E-mail: sjstheesar@gmail.com [Network Science Research Group, Institute of Mathematical Sciences, University of Malaya, 50603, Kuala Lumpur (Malaysia)

    2014-03-05

    The study of complex networks enables us to understand the collective behavior of the interconnected elements and provides vast real time applications from biology to laser dynamics. In this paper, synchronization of complex network of chaotic systems has been studied. Every identical node in the complex network is assumed to be in Lur’e system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology.

  14. Open Rigging Through XML: Character Setup Utilizing Metadata and Node Based Editing 

    E-Print Network [OSTI]

    Kelly, Logan Scott

    2014-02-19

    Editor. . . . . . . . . . . . . . . . . . . . 15 5 An example MetaDataManagerNode connected to two MetaRootNodes in Maya. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 6 The drop down menu provided for accessing the Rig... for a rig. . . . . . . . . . . . . 31 16 Attributes of a MetaDataManagerNode listed in Maya. . . . . . . . . . 41 17 Attributes of a MetaRootNode listed in Maya. . . . . . . . . . . . . . 42 18 Attributes of a MDGlobalNode listed in Maya...

  15. On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks

    E-Print Network [OSTI]

    Liu, Xiaodong; Li, Shanshan; Zhang, Jingying; Shao, Lisong; Huang, Chenlin; Xiao, Liquan

    2015-01-01

    Identifying the most influential individuals can provide invaluable help in developing and deploying effective viral marketing strategies. Previous studies mainly focus on designing efficient algorithms or heuristics to find top-K influential nodes on a given static social network. While, as a matter of fact, real-world social networks keep evolving over time and a recalculation upon the changed network inevitably leads to a long running time, significantly affecting the efficiency. In this paper, we observe from real-world traces that the evolution of social network follows the preferential attachment rule and the influential nodes are mainly selected from high-degree nodes. Such observations shed light on the design of IncInf, an incremental approach that can efficiently locate the top-K influential individuals in evolving social networks based on previous information instead of calculation from scratch. In particular, IncInf quantitatively analyzes the influence spread changes of nodes by localizing the im...

  16. Prediction and Management in Energy Harvested Wireless Sensor Nodes

    E-Print Network [OSTI]

    Simunic, Tajana

    present a fast, efficient and reliable solar prediction algorithm, namely, Weather-Conditioned Moving-Conditioned Moving Average (WCMA), a novel accurate yet very low overhead, solar energy prediction algorithm basedPrediction and Management in Energy Harvested Wireless Sensor Nodes Joaqu´in Recas Piorno, Carlo

  17. Multi-node Coordinated Jamming for Location Privacy Protection

    E-Print Network [OSTI]

    Gruteser, Marco

    precisely locate the target nodes. Although basic anti-localization techniques based on power control's localization systems. However, such a jamming technique has the problem of interfering with the communication such interference problems, those techniques generally induce co- ordination problems or require encryption

  18. Analysis and Application of Node Layout Algorithms for Intrusion Detection

    E-Print Network [OSTI]

    Erbacher, Robert F.

    monitoring environment aids system administrators in keeping track of the activities on such systems for complete analysis and monitoring of the environment. Developing an effective organization of the nodes or inconsequential. Our intrusion detection monitoring environment [6, 7] is geared towards aiding in this analysis

  19. Capacity of a Gaussian MAC with Energy Harvesting Transmit Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

    Capacity of a Gaussian MAC with Energy Harvesting Transmit Nodes R Rajesh CABS, DRDO Bangalore buffer to store the harvested energy. First, we find the capacity region of a GMAC powered by transmit. Keywords: Energy harvesting, Gaussian multiple access chan- nel, Finite Buffer, Shannon capacity. I

  20. Resource Management for Fading Wireless Channels with Energy Harvesting Nodes

    E-Print Network [OSTI]

    Ulukus, Sennur

    Resource Management for Fading Wireless Channels with Energy Harvesting Nodes Omur Ozel1 , Kaya This paper considers wireless communication using energy harvesting transmitters. In such a scenario, Pennsylvania State University, University Park, PA 16802 Abstract--Wireless systems comprised of rechargeable

  1. AN ENERGY BENCHMARK FOR SOFTWARE UPDATES ON WIRELESS SENSOR NODES

    E-Print Network [OSTI]

    Sreenan, Cormac J.

    AN ENERGY BENCHMARK FOR SOFTWARE UPDATES ON WIRELESS SENSOR NODES S. Brown*, C.J. Sreenan *Dept, Modelling, Energy, Benchmark. Abstract Energy consumption is arguably the key factor in the design not consume a significant fraction of a WSN's energy reserve; also, the required consumption must be known

  2. Design Considerations for Ultra-Low Energy Wireless Microsensor Nodes

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    Design Considerations for Ultra-Low Energy Wireless Microsensor Nodes Benton H. Calhoun, Student of an energy harvesting source. These requirements place demands on all levels of the design. We propose an architecture for achieving the required ultra-low energy operation and discuss the circuit techniques necessary

  3. Efficient RC Power Grid Verification Using Node Elimination

    E-Print Network [OSTI]

    Najm, Farid N.

    Efficient RC Power Grid Verification Using Node Elimination Ankit Goyal Department of ECE to reduce the size of power grids but their fo- cus is more on simulation. In verification, we are concerned. This paper pro- poses a novel approach to systematically reduce the power grid and accurately compute

  4. PHYSICAL REVIEW E 85, 066134 (2012) Robustness of a network formed by n interdependent networks with a one-to-one

    E-Print Network [OSTI]

    Buldyrev, Sergey

    2012-01-01

    of the cascades of failures in such a network of networks (NON) caused by a random initial attack on one of the NON and express it in terms of generating functions of the degree distributions of the network. Our nodes which exist in an ER NON and enhance the cascading failures, but do not exist in a RR NON. DOI: 10

  5. Management of Large-Scale Wireless Sensor Networks Utilizing Multi-Parent Recursive Area Hierarchies

    SciTech Connect (OSTI)

    Cree, Johnathan V.; Delgado-Frias, Jose

    2013-04-19

    Autonomously configuring and self-healing a largescale wireless sensor network requires a light-weight maintenance protocol that is scalable. Further, in a battery powered wireless sensor network duty-cycling a node’s radio can reduce the power consumption of a device and extend the lifetime of a network. With duty-cycled nodes the power consumption of a node’s radio depends on the amount of communication is must perform and by reducing the communication the power consumption can also be reduced. Multi-parent hierarchies can be used to reduce the communication cost when constructing a recursive area clustering hierarchy when compared to singleparent solutions that utilize inefficient communication methods such as flooding and information propagation via single-hop broadcasts. The multi-parent hierarchies remain scalable and provides a level of redundancy for the hierarchy.

  6. First search for double beta decay of platinum by ultra-low background HP Ge gamma spectrometry

    E-Print Network [OSTI]

    P. Belli; R. Bernabei; F. Cappella; R. Cerulli; F. A. Danevich; A. Di Marco; A. Incicchitti; M. Laubenstein; S. S. Nagorny; S. Nisi; O. G. Polischuk; V. I. Tretyak

    2011-04-29

    A search for double beta processes in 190Pt and 198Pt was realized with the help of ultra-low background HP Ge 468 cm^3 gamma spectrometer in the underground Gran Sasso National Laboratories of the INFN (Italy). After 1815 h of data taking with 42.5 g platinum sample, T_{1/2} limits on 2beta processes in 190Pt (\\epsilon\\beta^+ and 2\\epsilon) have been established on the level of 10^{14}-10^{16} yr, 3 to 4 orders of magnitude higher than those known previously. In particular, a possible resonant double electron capture in 190Pt was restricted on the level of 2.9 \\times 10^{16} yr at 90% C.L. In addition, T_{1/2} limit on 2 beta^- decay of 198Pt (2\

  7. Analysis and testing of the HP-R-214 dome monitor cable from Three Mile Island Unit 2

    SciTech Connect (OSTI)

    Richards, E.H.; Dandini, V.J.

    1986-03-01

    After the accident at Three Mile Island, Unit 2, two sections of a cable connected to the HP-R-214 dome monitor were removed for testing. One section had been directly exposed to the accident environment: the other had been installed in conduit. In addition, an unused section of cable, which was from the same reel as the dome monitor cable, was available as a control sample. These three sections were subjected to material tests, including density profiling, tensile-strength and elongation tests, and chemical analyses, to assess the effect of the accident on the cable and to identify whether any differences existed between the in-conduit and out-of-conduit sections.

  8. Implementing asyncronous collective operations in a multi-node processing system

    DOE Patents [OSTI]

    Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Kumar, Sameer; Salapura, Valentina; Steinmacher-Burow, Burkhard

    2014-07-08

    A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memory buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.

  9. Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Peters, Amanda A. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2012-01-10

    Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

  10. Reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Peters, Amanda E. (Cambridge, MA); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2012-04-17

    Methods, apparatus, and products are disclosed for reducing power consumption while synchronizing a plurality of compute nodes during execution of a parallel application that include: beginning, by each compute node, performance of a blocking operation specified by the parallel application, each compute node beginning the blocking operation asynchronously with respect to the other compute nodes; reducing, for each compute node, power to one or more hardware components of that compute node in response to that compute node beginning the performance of the blocking operation; and restoring, for each compute node, the power to the hardware components having power reduced in response to all of the compute nodes beginning the performance of the blocking operation.

  11. Statistical Analysis of the Road Network of India

    E-Print Network [OSTI]

    Mukherjee, Satyam

    2012-01-01

    In this paper we study the Indian Highway Network as a complex network where the junction points are considered as nodes, and the links are formed by an existing connection. We explore the topological properties and community structure of the network. We observe that the Indian Highway Network displays small world properties and is assortative in nature. We also identify the most important road-junctions (or cities) in the highway network based on the betweenness centrality of the node. This could help in identifying the potential congestion points in the network. Our study is of practical importance and could provide a novel approach to reduce congestion and improve the performance of the highway network

  12. Scaling in topological properties of brain networks

    E-Print Network [OSTI]

    Singh, Soibam Shyamchand; Ishrat, Romana; Sharma, B Indrajit; Singh, R K Brojen

    2015-01-01

    The organization in brain networks shows highly modular features with weak inter-modular interaction. The topology of the networks involves emergence of modules and sub-modules at different levels of constitution governed by fractal laws. The modular organization, in terms of modular mass, inter-modular, and intra-modular interaction, also obeys fractal nature. The parameters which characterize topological properties of brain networks follow one parameter scaling theory in all levels of network structure which reveals the self-similar rules governing the network structure. The calculated fractal dimensions of brain networks of different species are found to decrease when one goes from lower to higher level species which implicates the more ordered and self-organized topography at higher level species. The sparsely distributed hubs in brain networks may be most influencing nodes but their absence may not cause network breakdown, and centrality parameters characterizing them also follow one parameter scaling la...

  13. Field test of the wavelength-saving quantum key distribution network

    E-Print Network [OSTI]

    Shuang Wang; Wei Chen; Zhen-Qiang Yin; Yang Zhang; Tao Zhang; Hong-Wei Li; Fang-Xing Xu; Zheng Zhou; Yang Yang; Da-Jun Huang; Li-Jun Zhang; Fang-Yi Li; Dong Liu; Yong-Gang Wang; Guang-Can Guo; Zheng-Fu Han

    2012-03-20

    We propose a wavelength-saving topology of quantum key distribution(QKD) network based on passive optical elements, and report the field test of this network on the commercial telecom optical fiber. In this network, 5 nodes are supported with 2 wavelengths, and every two nodes can share secure keys directly at the same time. All QKD links in the network operate at the frequency of 20 MHz. We also characterized the insertion loss and crosstalk effects on the point-to-point QKD system after introducing this QKD network.

  14. Hierarchical Organization in Complex Networks

    E-Print Network [OSTI]

    Erzsebet Ravasz; Albert-Laszlo Barabasi

    2002-09-01

    Many real networks in nature and society share two generic properties: they are scale-free and they display a high degree of clustering. We show that these two features are the consequence of a hierarchical organization, implying that small groups of nodes organize in a hierarchical manner into increasingly large groups, while maintaining a scale-free topology. In hierarchical networks the degree of clustering characterizing the different groups follows a strict scaling law, which can be used to identify the presence of a hierarchical organization in real networks. We find that several real networks, such as the World Wide Web, actor network, the Internet at the domain level and the semantic web obey this scaling law, indicating that hierarchy is a fundamental characteristic of many complex systems.

  15. Network Management Network Management

    E-Print Network [OSTI]

    Giaccone, Paolo

    Network Management Pag. 1 Network Management Andrea Bianco Telecommunication Network Group Network management and QoS provisioning - 1Andrea Bianco ­ TNG group - Politecnico di Torino Telecommunication management and QoS provisioning - 2Andrea Bianco ­ TNG group - Politecnico di Torino Stanford, California

  16. Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Grosu, Radu

    devices that communicate over wireless links. Mobile devices are typically powered by batteries applications [3] [4] [5] [6] need sensor nodes to be mobile making such networks similar to MANETS. However, embedded devices and impracticality of recharging batteries. Thus, mobile sensor networks make

  17. PHYS 497B, BIOL 497K Systems Biology and Networks

    E-Print Network [OSTI]

    Albert, Réka

    be augmented by additional node and edge information. #12;Food webs describe the energy flow within species & movie or author & paper information? #12;Part of a dating network in a high school Blue: boys Pink in the illustration #12;Word co-usage network in PNAS publications Only words whose usage significantly increased

  18. A Distributed Public Key Caching Scheme in Large Wireless Networks

    E-Print Network [OSTI]

    Deng, Jing

    -constrained, in terms of computational power, battery energy, and on-board memory space. For example, the prototypeA Distributed Public Key Caching Scheme in Large Wireless Networks Yuan Kong Jing Deng Stephen R in wireless networks, the public keys of the nodes need to be widely available and signed by a Certificate

  19. Symmetric Clock Synchronization in Sensor Networks Philipp Sommer

    E-Print Network [OSTI]

    Efficiency 1 Introduction Clock synchronization is a major building block in wire- less sensor networks, and maybe even more importantly, clock synchronization plays a major role in energy efficiency. State-of-the art energy-efficient sen- sor network protocols, e.g. [2], have advanced duty cycling schemes. Nodes

  20. Query Processing in Mobile Sensor Networks Wang-Chien Lee

    E-Print Network [OSTI]

    Lee, Wang-Chien

    , a sensor network for air pollution test, where all sensors are scattered in the air and transported to collect the data from the sensors about air pollution and traffic conditions. In comparison, vehicles, animals, air, and water). With self-propelling sensor nodes, a mobile sensor network is self

  1. DATAFLOW NETWORKS FOR EVENT STREAM PROCESSING Rajit Manohar

    E-Print Network [OSTI]

    Manohar, Rajit

    . Sensors generate event streams, event pro­ cessors consume event streams and generate value­added event­ portunities in areas such as logistics, finance, and public health. Examples of such applications;­dataflow networks because nodes in the network propagate only changes in data values. We show how ultra low

  2. -DATAFLOW NETWORKS FOR EVENT STREAM PROCESSING Rajit Manohar

    E-Print Network [OSTI]

    Manohar, Rajit

    . Sensors generate event streams, event pro- cessors consume event streams and generate value-added event- portunities in areas such as logistics, finance, and public health. Examples of such applications -dataflow networks because nodes in the network propagate only changes in data values. We show how ultra low

  3. Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks ?

    E-Print Network [OSTI]

    Texas at Dallas, University of

    powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the move, more computational power, etc.). These special nodes, henceforth referred to as mobile base stations. In cellular networks powerful stationary base stations are tied to a wired backbone network and com­ municate

  4. Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks

    E-Print Network [OSTI]

    Lee, Wang-Chien

    , to collect metadata from sensor nodes to the query optimizer (i.e. the AP) requires an energy overhead1 Optimizing Energy-Efficient Query Processing in Wireless Sensor Networks Ross Rosemark Wang of energy-efficient query optimization for wireless sensor networks. Different from existing query

  5. Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks

    E-Print Network [OSTI]

    Srikant, Rayadurgam

    . The network has a special node called the fusion center whose goal is to compute a symmetric function of these measurements. The problem studied is to minimize the total transmission energy used by the network when, and that each sensor uses r units of energy to transmit each bit, where r is the transmission range

  6. Energy-Efficient Design and Optimization of Wireline Access Networks

    E-Print Network [OSTI]

    Wilfong, Gordon

    to 50% of the energy consumed by DSLAM nodes [8]. Therefore, remote DSLAM units (placed closer the energy consumption as well as increase the reach of the access network. This paper attempts to formalize network and introducing remote DSLAM units. I. INTRODUCTION Energy-related expenses have become a major

  7. Robust Target Localization from Binary Decisions in Wireless Sensor Networks

    E-Print Network [OSTI]

    Levina, Liza

    Wireless sensor networks (WSN) are becoming an important tool in a variety of tasks, including mon- itoring on Wireless Sensor Networks (WSN) Detection, identification and tracking of spatial phenomena are important, computing and storage capabilities. In a WSN, the nodes are linked by a wireless medium ­ radio, infrared

  8. Performance Analysis of Multi-Channel Wireless Infrastructure Networks

    E-Print Network [OSTI]

    Ramasubramanian, Srinivasan

    between channels with some tuning delay. A node is a stationary wireless router which is mounted usuallyPerformance Analysis of Multi-Channel Wireless Infrastructure Networks Sangman Cho, Srinivasan, Washington, DC 20052 Abstract--Wireless infrastructure networks that provide ubiq- uitous connectivity

  9. Self-Triggered Control over Wireless Sensor and Actuator Networks

    E-Print Network [OSTI]

    Johansson, Karl Henrik

    Self-Triggered Control over Wireless Sensor and Actuator Networks Jos´e Ara´ujo, Adolfo Anta for the sensor and control nodes, thereby reducing energy consumption and increasing network lifetime, without- oped to reduce power consumption in WSNs. Unfortunately, the situation is much less favorable

  10. Dynamic Computations in Ever-Changing Networks Invited Talk Abstract

    E-Print Network [OSTI]

    Keidar, Idit

    . For example, sensor networks are subject to churn (dynamic changes in the set of nodes) as Supported exhibit high churn rates because data center operators constantly bring online new servers and virtual"eventually static"paradigm has begun to crack with the advent of churn-resistant peer-to-peer networks. Indeed

  11. DAG-based Multipath Routing for Mobile Sensor Networks

    E-Print Network [OSTI]

    Choi, Lynn

    DAG-based Multipath Routing for Mobile Sensor Networks Ki-Sup Hong and Lynn Choi School of Electrical Engineering Korea University Seoul, Korea {mastaks, lchoi@korea.ac.kr} Abstract--We propose a new multipath routing protocol called DMR for mobile sensor networks, where any node can move anytime. DMR

  12. Sensor Network Lifetime Maximization Via Sensor Energy Balancing: Construction and Optimal Scheduling of Sensor Trees

    E-Print Network [OSTI]

    Johansson, Karl Henrik

    in such a way that the total energy usage of the active sensor nodes in the tree is minimized. However whenSensor Network Lifetime Maximization Via Sensor Energy Balancing: Construction and Optimal, node energy, etc), the collected data are transmitted to their final destination, usually a fusion

  13. Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis

    E-Print Network [OSTI]

    Hone, James

    node has a battery of capacity B. At time t a node i's battery level is bi,t, it harvests ei,t units conditions that a network should satisfy are: (i) balanced data acquisition over all the parts of the net

  14. PERFORMANCE ANALYSIS OF POWER-AWARE ROUTE SELECTION PROTOCOLS IN MOBILE AD HOC NETWORKS

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    , a hybrid protocol like the CMMBCR (Conditional Max-Min Battery Capacity Routing) mechanism has been devised-Max Battery Cost Routing) scheme tries to consider the remaining battery power of nodes to prolong- gardless of the remaining battery power of nodes. Since the transmission network2002: submitted to World

  15. Current and Future Trends in Sensor Networks: A Survey Mokhtar Aboelaze*

    E-Print Network [OSTI]

    Aloul, Fadi

    are used in monitoring hazardous chemicals. They are also used in monitoring the environment and in early that are deployed in some geographical area. The purpose of the network is to sense the environment and report what of very small nodes are scattered across some environment in order to sense and report to a central node

  16. DEEJAM: Defeating Energy-Efficient Jamming in IEEE 802.15.4-based Wireless Networks

    E-Print Network [OSTI]

    Zhou, Gang

    that renders most higher-layer security mechanisms moot--yet it is often ignored in WSN design. We show of jamming on common WSN hardware with solutions that are shown empirically to en- able continued with the limited resources available to most ad hoc and wireless sensor network (WSN) nodes [1]. Nodes may

  17. A Distributed Scheduling Algorithm with QoS Provisions in Multi-Hop Wireless Mesh Networks

    E-Print Network [OSTI]

    Leung, Kin K.

    in urban, suburban, and rural environments. A WMN is usually composed of static wireless nodes/mesh routers/Internet gateway to the internet but also as a wireless router able to relay packets from other nodes withoutA Distributed Scheduling Algorithm with QoS Provisions in Multi-Hop Wireless Mesh Networks Chi

  18. Mobile Data Collection Networks for Wireless Sensor Kai Li Kien A. Hua

    E-Print Network [OSTI]

    Hua, Kien A.

    .S.A. kailee.cs@knights.ucf.edu, kienhua@eecs.ucf.edu Abstract. Energy consumption is a major limitation individual sensor energy consumption, they suffer from longer latency and low data delivery ratio. In face applications. MDCNet is a fully self-deployed mesh network with virtual mesh nodes (mobile relay nodes

  19. Energy-Efficient Task-Mapping for Data-Driven Sensor Network Macroprogramming

    E-Print Network [OSTI]

    Flener, Pierre

    representing the flow of data among tasks assists the application developer in specifying the features of a WSN, and a battery. It is of great concern to reduce the energy consumption at each node before deploying the network in cases where the battery cannot be charged once it is drained [4]. In a WSN, a node is assigned

  20. New Technique for Proposing Network's Topology using GPS and GIS

    E-Print Network [OSTI]

    Ismaeel, Ayad Ghany

    2012-01-01

    The problem of proposed topology for network comes when using Prim's algorithm with default distance (unrealistic distances) between network's nodes and don't care about the lakes, high hills, buildings, etc. This problem will cause incorrect estimations for cost (budget) of requirements like the media (optic fibre) and the number or type of Access-points, regenerator, Optic Amplifier, etc. This paper proposed a new technique of implementing Prim's algorithm to obtain realistic topology using realistic distances between network's nodes via Global Positioning System GPS and Geographic Information Systems GIS packages. Applying the new technique on academic institutes network of Erbil city from view of media (optic fibre) shows that there is disability in cost (budget) of the media which is needed (nearly) 4 times if implement default Prim's algorithm (don't using GPS & GIS) base on unrealistic distances between the nodes.

  1. Annual Mass Balance Of Blue Glacier, U.S.A.: 1955-97 H. CONWAY, L. A. RASMUSSEN, and H.-P. MARSHALL

    E-Print Network [OSTI]

    Rasmussen, L.A.

    Annual Mass Balance Of Blue Glacier, U.S.A.: 1955-97 H. CONWAY, L. A. RASMUSSEN, and H.-P. MARSHALL with other glaciers in the region and elsewhere in the world. Glacier-average annual mass balances, beginning balance. Two alternative time series of mass balance consistent with the long-term mass changes

  2. Long Proteins with Unique Optimal Foldings in the H-P Model Oswin Aichholzer David Bremner y Erik D. Demaine z Henk Meijer x

    E-Print Network [OSTI]

    results about bonds in the H-P model. 1 Introduction Protein folding is a central problem such as drug de- sign. One of the most popular models of protein folding is the hydrophilic-hydrophobic (H of protein folding such as the tendency for the hydrophobic components to fold to the center of a globular

  3. BioPS'06, October 24-25, III.19-III.26 3D HP Protein Folding Problem using Ant Algorithm

    E-Print Network [OSTI]

    Fidanova, Stefka

    BioPS ® BioPS'06, October 24-25, III.19-III.26 3D HP Protein Folding Problem using Ant Algorithm for the correct structure in the huge conformation space. Due to the complexity of the protein folding problem protein folding problem. It is based on very simple design choices in particular with respect

  4. Using Satellite Ocean Color Data to Derive an Empirical Model for the Penetration Depth of Solar Radiation (Hp) in the Tropical Pacific Ocean

    E-Print Network [OSTI]

    Chen, .Dake

    the climate through the penetration depth of solar radiation in the upper ocean (Hp), a primary parameter on penetrative solar radiation in the tropical Pacific, demonstrating the dynamical implication of remotely in which incident solar radiation is absorbed in the mixed layer and the verti- cal penetration down

  5. Heterogeneous Force Chains in Cellularized Biopolymer Network

    E-Print Network [OSTI]

    Liang, Long; Sun, Bo; Jiao, Yang

    2015-01-01

    Biopolymer Networks play an important role in coordinating and regulating collective cellular dynamics via a number of signaling pathways. Here, we investigate the mechanical response of a model biopolymer network due to the active contraction of embedded cells. Specifically, a graph (bond-node) model derived from confocal microscopy data is used to represent the network microstructure, and cell contraction is modeled by applying correlated displacements at specific nodes, representing the focal adhesion sites. A force-based stochastic relaxation method is employed to obtain force-balanced network under cell contraction. We find that the majority of the forces are carried by a small number of heterogeneous force chains emitted from the contracting cells. The force chains consist of fiber segments that either possess a high degree of alignment before cell contraction or are aligned due to the reorientation induced by cell contraction. Large fluctuations of the forces along different force chains are observed. ...

  6. Synchronization in networks of spatially extended systems

    SciTech Connect (OSTI)

    Filatova, Anastasiya E.; Hramov, Alexander E.; Koronovskii, Alexey A.; Boccaletti, Stefano

    2008-06-15

    Synchronization processes in networks of spatially extended dynamical systems are analytically and numerically studied. We focus on the relevant case of networks whose elements (or nodes) are spatially extended dynamical systems, with the nodes being connected with each other by scalar signals. The stability of the synchronous spatio-temporal state for a generic network is analytically assessed by means of an extension of the master stability function approach. We find an excellent agreement between the theoretical predictions and the data obtained by means of numerical calculations. The efficiency and reliability of this method is illustrated numerically with networks of beam-plasma chaotic systems (Pierce diodes). We discuss also how the revealed regularities are expected to take place in other relevant physical and biological circumstances.

  7. Beamforming-Based Broadcast Scheme for Multihop Wireless Networks with Transmission

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Beamforming-Based Broadcast Scheme for Multihop Wireless Networks with Transmission Range transmission power for a beamforming-based broadcast scheme in multihop wireless networks? To address wireless network, and demonstrated in terms of implicated nodes'ratio, power transmission gain

  8. Flash Flooding: Exploiting the Capture Effect for Rapid Flooding in Wireless Sensor Networks

    E-Print Network [OSTI]

    Whitehouse, Kamin

    Flash Flooding: Exploiting the Capture Effect for Rapid Flooding in Wireless Sensor Networks,whitehouse}@cs.virginia.edu Abstract--We present the Flash flooding protocol for rapid network flooding in wireless sensor networks. Traditional flooding protocols can be very slow because of neighborhood contention: nodes cannot propagate

  9. American Institute of Aeronautics and Astronautics Ad Hoc UAV Ground Network (AUGNet)

    E-Print Network [OSTI]

    Brown, Timothy X.

    American Institute of Aeronautics and Astronautics 1 Ad Hoc UAV Ground Network (AUGNet) Timothy X network with radio nodes mounted at fixed sites, on ground vehicles, and in small (10kg) UAVs. The ad hoc which act as relays. We envision two scenarios for this type of network. In the first, the UAV acts

  10. Supplementary Web material for Milo RE 1073478, sched. for 25 October issue Network Databases

    E-Print Network [OSTI]

    Timmer, Jens

    Supplementary Web material for Milo RE 1073478, sched. for 25 October issue Methods Network is represented by a single node. This network is available at www.weizmann.ac.il/mcb/UriAlon. Food webs. The database of seven ecosystem food webs, provided by N. Martinez, was described (S3, S4). Neuronal network

  11. Wireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale

    E-Print Network [OSTI]

    Gao, Jie

    are not flexible. ­ Vulnerable to attacks. · Ad hoc networks· Ad hoc networks ­ Flexible, easy to deploy, cheaper · Optimal power assignment /transmission range · Optimal scheduling & multi-hop routing · Node are staticWireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale #12

  12. Structuring Measurements for Modeling and the Deployment of Industrial Wireless Networks

    E-Print Network [OSTI]

    Zilic, Zeljko

    . Replacing wired units with wireless sensor network (WSN) nodes offers more flexibility, and ultimately coverage during its deployment. Wireless networking devices are inherently power-limited, which limits1 Structuring Measurements for Modeling and the Deployment of Industrial Wireless Networks Rong

  13. Combining LT codes and XOR network coding for reliable and energy efficient transmissions in

    E-Print Network [OSTI]

    Jaffrès-Runser, Katia

    Combining LT codes and XOR network coding for reliable and energy efficient transmissions the problem of providing end to end reliable transmissions in a randomly deployed wireless sensor network or several sink nodes. Due to the large scale of such networks, the transmission is multi-hop between

  14. Are Arti cial Neural Networks White Boxes? Eyal Kolman and Michael Margaliot y

    E-Print Network [OSTI]

    Margaliot, Michael

    networks, knowledge-based networks, rule ex- traction, rule generation, rule re#12;nement. #3; This work compute membership function values, whereas nodes in the second layer perform T-norm operations. Jang a similar equivalence to develop a transformation of a feedforward neural network with Logistic activation

  15. Synchronous Ultra-Wide Band Wireless Sensors Networks for oil and gas exploration

    E-Print Network [OSTI]

    Savazzi, Stefano

    Synchronous Ultra-Wide Band Wireless Sensors Networks for oil and gas exploration Stefano Savazzi1 of new oil and gas reservoir. Seismic exploration requires a large number (500 ÷ 2000 nodes, MAC and network layer to develop wireless sensors networks tailored for oil (and gas) exploration

  16. Energy Conserving Routing in Wireless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassiulas

    E-Print Network [OSTI]

    Wang, Bing

    Energy Conserving Routing in Wireless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassiulas-- energy-sensitive routing, wireless ad-hoc networks, sensor networks I. INTRODUCTION CONSIDER a group of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system

  17. Utility Optimal Scheduling in Energy Harvesting Networks Longbo Huang, Michael J. Neely

    E-Print Network [OSTI]

    Huang, Longbo

    Utility Optimal Scheduling in Energy Harvesting Networks Longbo Huang, Michael J. Neely ABSTRACT In this paper, we show how to achieve close-to-optimal util- ity performance in energy harvesting networks with only fi- nite capacity energy storage devices. In these networks, nodes are capable of harvesting

  18. Decentralizing Query Processing in Sensor Networks Ross Rosemark, Wang-Chien Lee

    E-Print Network [OSTI]

    Lee, Wang-Chien

    this approach, the access point must first collect metadata from all nodes within the sensor network requir- 1 by utilizing the metadata collected from the sensor network. Such a centralized approach disallows two setsDecentralizing Query Processing in Sensor Networks Ross Rosemark, Wang-Chien Lee Department

  19. Non-Uniform Entropy Compression for Uniform Energy Distribution in Wireless Sensor Networks

    E-Print Network [OSTI]

    California at Davis, University of

    -non-homogeneity in the network. Bottleneck nodes trade computation energy for transmission energy, which extends and normalizesNon-Uniform Entropy Compression for Uniform Energy Distribution in Wireless Sensor Networks to increase the network's lifetime and to normalize the energy use per unit time, but they each have

  20. A Scalable Model for Energy Load Balancing in Large-scale Sensor Networks

    E-Print Network [OSTI]

    de Veciana, Gustavo

    A Scalable Model for Energy Load Balancing in Large-scale Sensor Networks Seung Jun Baek we consider how one might achieve more balanced energy burdens across the network by spreading sinks change their locations to balance the energy burdens incurred accross the network nodes [1

  1. Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links

    E-Print Network [OSTI]

    Minnesota, University of

    . Combined with unreliable links, flooding in low-duty-cycle networks is a new challenging issueOpportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links Shuo Guo, little work has yet been done on low-duty-cycle wireless sensor networks in which nodes stay asleep most

  2. Network growth by copying P. L. Krapivsky 1, * and S. Redner 2,+

    E-Print Network [OSTI]

    Redner, Sidney

    for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USA #Received 18 October networks where the node degree also grows slowly with time---the Internet and the citation network of all remains finite as N##. However, in other examples of real sparse networks, such as the Internet

  3. Efficient Aggregation of Delay-Constrained Data in Wireless Sensor Networks Kemal Akkaya and Mohamed Younis

    E-Print Network [OSTI]

    Younis, Mohamed

    energy saving mechanism for sensor nodes is to exploit in-network data aggregation. In wireless sensor of in-network data aggregation is to eliminate unnecessary packet transmission by filtering out conditions data are routed in a best- effort manner with flexible latency bounds. Contemporary in-network

  4. Engineering Weyl nodes in Dirac semimetals by a magnetic field

    E-Print Network [OSTI]

    E. V. Gorbar; V. A. Miransky; I. A. Shovkovy

    2013-10-07

    We study the phase diagram of a Dirac semimetal in a magnetic field at a nonzero charge density. It is shown that there exists a critical value of the chemical potential at which a first-order phase transition takes place. At subcritical values of the chemical potential the ground state is a gapped state with a dynamically generated Dirac mass and a broken chiral symmetry. The supercritical phase is the normal (gapless) phase with a nontrivial chiral structure: it is a Weyl semimetal with a pair of Weyl nodes for each of the original Dirac points. The nodes are separated by a dynamically induced chiral shift. The direction of the chiral shift coincides with that of the magnetic field and its magnitude is determined by the quasiparticle charge density, the strength of the magnetic field, and the strength of the interaction. The rearrangement of the Fermi surface accompanying this phase transition is described.

  5. Pervasive UWB Sensor Networks for Oil exploration

    E-Print Network [OSTI]

    Savazzi, Stefano

    network applications. One of these applications is represented by land seismic exploration for oil and gas reservior. Seismic exploration requires a large number (2000 nodes/sqkm) of sensors to be deployed applications [1]. Land seismic exploration for oil reservoir requires a large number of sensors (geophones

  6. Anonymous Networks: Randomization = 2-Hop Coloring

    E-Print Network [OSTI]

    the computational power of anonymous message passing algorithms (henceforth, anonymous algo- rithms), i- ity), where the processors are represented as nodes in a graph and the task is to produce an output, the extensively studied maximal independent set (MIS) problem [34, 3] is solvable in an anonymous network only

  7. Proportionally Fair Selective Cooperation for Cellular Networks

    E-Print Network [OSTI]

    Leung, Kin K.

    Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis, a node and a cooperative relay are selected in a proportionally fair (PF) manner to transmit to the base cooperative transmissions, and is called proportionally fair selective cooperation (PFSC). This tech- nique

  8. Network Layer Routing -I Yatindra Nath Singh

    E-Print Network [OSTI]

    Singh Yatindra Nath

    are connected by point-to-point links. Fig.1 Network is build using layered architectures Each layer uses Another abstraction layer over Physical layer Provides reliable transport of information over point-to-point the packet forwarding, each node has a forwarding table. Each forwarding table entry has Destination address

  9. The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks

    E-Print Network [OSTI]

    Niesen, Urs

    We consider the question of determining the scaling of the n[superscript n] -dimensional balanced unicast and the n 2[superscript n]-dimensional balanced multicast capacity regions of a wireless network with n nodes placed ...

  10. Distributed Clustering for Robust Aggregation in Large Networks Ittay Eyal Idit Keidar Raphael Rom

    E-Print Network [OSTI]

    Keidar, Idit

    sensor networks with thousands of light-weight nodes monitoring conditions like seismic activity there are irregu- lar shakes, such as a moving truck, but ignore a shake com- mon to all sensors like a mild

  11. XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger

    E-Print Network [OSTI]

    over several small (energy-efficient) hops. For this purpose each node in the ad-hoc network chooses buildings. In this paper we present the XTC1 topology control algorithm that works i) without GPS and ii

  12. Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition

    E-Print Network [OSTI]

    Edinburgh, University of

    of packets in the network (e.g., avoiding sensor nodes with low energy level), or navigation of users/vehicles identify saddle points with increasing and decreasing neighbor values in an alternating fashion, specially

  13. Tree Based Broadcast in Ad Hoc Networks Alpar Juttner1,2

    E-Print Network [OSTI]

    Jüttner, Alpár

    , Broadcast, Multicast, Routing algorithms, Wireless LANs. 1 #12;1 Introduction Mobile ad hoc networks (MANETs infrastructure in such a way, that each communi- cating device (hereafter node) can serve as a router

  14. Towards Realizing the Performance and Availability Benefits of a Global Overlay Network

    E-Print Network [OSTI]

    Rahul, Hariharan

    2005-11-01

    Prior analyses of the benefits of routing overlays are based onplatforms consisting of nodes located primarily in North America, onthe academic Internet, and at the edge of the network. This paper isthe first global study ...

  15. Scalable fault management architecture for dynamic optical networks : an information-theoretic approach

    E-Print Network [OSTI]

    Wen, Yonggang

    2008-01-01

    All-optical switching, in place of electronic switching, of high data-rate lightpaths at intermediate nodes is one of the key enabling technologies for economically scalable future data networks. This replacement of ...

  16. TDROP: A routing protocol for physically hierarchical ad hoc mobile networks 

    E-Print Network [OSTI]

    Ahmed, Zaheer

    2000-01-01

    Many protocols for routing in mobile ad hoc networks have been proposed. None of these protocols differentiates mobile nodes based on their physical characteristics and also there is only one proposal for connecting ad hoc ...

  17. Optimization of the BEOL Interconnect Stack for Advanced Semiconductor Technology Nodes

    E-Print Network [OSTI]

    Shah, Pooja Pradeep

    2015-01-01

    seen in the pure-play foundry “node” taxonomy. For example,pitch for the pure-play foundry 14nm technology node islayer are de- fined by the foundry, while designers can vary

  18. Hardware demonstration of high-speed networks for satellite applications.

    SciTech Connect (OSTI)

    Donaldson, Jonathon W.; Lee, David S.

    2008-09-01

    This report documents the implementation results of a hardware demonstration utilizing the Serial RapidIO{trademark} and SpaceWire protocols that was funded by Sandia National Laboratories (SNL's) Laboratory Directed Research and Development (LDRD) office. This demonstration was one of the activities in the Modeling and Design of High-Speed Networks for Satellite Applications LDRD. This effort has demonstrated the transport of application layer packets across both RapidIO and SpaceWire networks to a common downlink destination using small topologies comprised of commercial-off-the-shelf and custom devices. The RapidFET and NEX-SRIO debug and verification tools were instrumental in the successful implementation of the RapidIO hardware demonstration. The SpaceWire hardware demonstration successfully demonstrated the transfer and routing of application data packets between multiple nodes and also was able reprogram remote nodes using configuration bitfiles transmitted over the network, a key feature proposed in node-based architectures (NBAs). Although a much larger network (at least 18 to 27 nodes) would be required to fully verify the design for use in a real-world application, this demonstration has shown that both RapidIO and SpaceWire are capable of routing application packets across a network to a common downlink node, illustrating their potential use in real-world NBAs.

  19. Perturbation centrality: a novel centrality measure obtained by the general network dynamics tool, Turbine

    E-Print Network [OSTI]

    Szalay, Kristof Z

    2013-01-01

    Analysis of network dynamics became increasingly important to understand the mechanisms and consequences of changes in biological systems from macromolecules to cells and organisms. Currently available network dynamics tools are mostly tailored for specific tasks such as calculation of molecular or neural dynamics. Our Turbine software offers a generic framework enabling the simulation of any algorithmically definable dynamics of any network. Turbine is also optimized for handling very large networks in the range of millions of nodes and edges. Using a perturbation transmission model inspired by communicating vessels, here we introduce a novel centrality measure termed as perturbation centrality. Perturbation centrality is the reciprocal of the time needed to dissipate a starting perturbation in the network. Hubs and inter-modular nodes proved to be highly efficient in perturbation propagation. High perturbation centrality nodes of the Met-tRNA synthetase protein structure network were identified as amino aci...

  20. Empirical comparison of network sampling techniques

    E-Print Network [OSTI]

    Blagus, Neli; Bahec, Marko

    2015-01-01

    In the past few years, the storage and analysis of large-scale and fast evolving networks present a great challenge. Therefore, a number of different techniques have been proposed for sampling large networks. In general, network exploration techniques approximate the original networks more accurately than random node and link selection. Yet, link selection with additional subgraph induction step outperforms most other techniques. In this paper, we apply subgraph induction also to random walk and forest-fire sampling. We analyze different real-world networks and the changes of their properties introduced by sampling. We compare several sampling techniques based on the match between the original networks and their sampled variants. The results reveal that the techniques with subgraph induction underestimate the degree and clustering distribution, while overestimate average degree and density of the original networks. Techniques without subgraph induction step exhibit exactly the opposite behavior. Hence, the pe...

  1. Robust Reconstruction of Complex Networks from Sparse Data

    E-Print Network [OSTI]

    Han, Xiao; Wang, Wen-Xu; Di, Zengru

    2015-01-01

    Reconstructing complex networks from measurable data is a fundamental problem for understanding and controlling collective dynamics of complex networked systems. However, a significant challenge arises when we attempt to decode structural information hidden in limited amounts of data accompanied by noise and in the presence of inaccessible nodes. Here, we develop a general framework for robust reconstruction of complex networks from sparse and noisy data. Specifically, we decompose the task of reconstructing the whole network into recovering local structures centered at each node. Thus, the natural sparsity of complex networks ensures a conversion from the local structure reconstruction into a sparse signal reconstruction problem that can be addressed by using the lasso, a convex optimization method. We apply our method to evolutionary games, transportation and communication processes taking place in a variety of model and real complex networks, finding that universal high reconstruction accuracy can be achie...

  2. A congestion control scheme for wireless sensor networks 

    E-Print Network [OSTI]

    Xiong, Yunli

    2005-08-29

    - gestion. For wired networks like INTERNET, there are mixed links with di erent bandwidths. The node with the lowest bandwidth along a path from the source to the destination is called the bottleneck. Usually, congestion occurs in the bottleneck since..., packet loss cannot be used to detect con- gestion. In WSN, corruption and collision will cause packets to be dropped. Besides, node failure due to energy depletion could also result in packet loss. Combining information on packet loss and latency can...

  3. Performance Characterization of Mobile-Class Nodes: Why Fewer Bits is Better

    E-Print Network [OSTI]

    Hazelwood, Kim

    Performance Characterization of Mobile-Class Nodes: Why Fewer Bits is Better Michelle McDaniel and Kim Hazelwood Department of Computer Science University of Virginia I. INTRODUCTION Mobile-class nodes. As is the trend in the computing market, the processors in these mobile-class nodes moving from 32 bits to 64 bits

  4. Optimal Deployment and Efficient Movement of Mobile Sensor Nodes for Long Belt Coverage

    E-Print Network [OSTI]

    Optimal Deployment and Efficient Movement of Mobile Sensor Nodes for Long Belt Coverage Han Xu is a triangle lattice placement. However, what is the optimal placement in a long belt scenario has not been with shifted node strips for complete belt coverage. We prove its optimality in terms of the lowest node

  5. Deterministic knowledge about nearby nodes in a mobile one dimensional environment 

    E-Print Network [OSTI]

    Subramanian, Sivaramakrishnan

    2009-05-15

    also consider the case when multiple clusters merge together. Our algorithm is space efficient in that the nodes do not include information about all the nodes they know in their broadcast message at all times. Nodes also store only the information...

  6. Minimizing Node Churn in Peer-to-Peer Streaming Constantinos Vassilakis

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    Minimizing Node Churn in Peer-to-Peer Streaming Constantinos Vassilakis Greek Research & Technology experience to the end users. In this paper we explore node churn which independently of the distribution quality. We argue that node churn is service specific and that churn in a P2P streaming service is highly

  7. Distributed Selfish Replication under Node Churn Eva Jaho, Ina Jaho and Ioannis Stavrakakis

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    Distributed Selfish Replication under Node Churn Eva Jaho, Ina Jaho and Ioannis Stavrakakis of node churn on the effec- tiveness of a distributed selfish replication group is investigated than that in isolation. In this paper it is shown that node churn can introduce mistreatment

  8. Towards A Network-of-Networks Framework for Cyber Security

    SciTech Connect (OSTI)

    Halappanavar, Mahantesh; Choudhury, Sutanay; Hogan, Emilie A.; Hui, Peter SY; Johnson, John R.; Ray, Indrajit; Holder, Lawrence B.

    2013-06-07

    Networks-of-networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, in this paper we build towards a three-layer NoN model for an enterprise cyber system. Each layer captures a different facet of a cyber system. We then discuss the potential benefits of graph-theoretic analysis enabled from such a model. Our goal is to provide a novel and powerful tool for modeling and analyzing problems in cyber security.

  9. Network for minimizing current imbalances in a faradaic battery

    DOE Patents [OSTI]

    Wozniak, Walter (Dearborn, MI); Haskins, Harold J. (Ann Arbor, MI)

    1994-01-01

    A circuit for connecting a faradaic battery with circuitry for monitoring the condition of the battery includes a plurality of voltage divider networks providing battery voltage monitoring nodes and includes compensating resistors connected with the networks to maintain uniform discharge currents through the cells of the battery. The circuit also provides a reduced common mode voltage requirement for the monitoring circuitry by referencing the divider networks to one-half the battery voltage.

  10. SRC burn test in 700-hp oil-designed boiler. Volume 1. Integrated report. Final technical report

    SciTech Connect (OSTI)

    Not Available

    1983-09-01

    This burn test program was conducted during the period of August 1982 to February 1983 to demonstrate that Solvent Refined Coal (SRC) products can displace petroleum as a boiler fuel in oil- and gas-designed boilers. The test program was performed at the U.S. Department of Energy's Pittsburgh Energy Technology Center (PETC). Three forms of SRC (pulverized SRC, a solution of SRC dissolved in process-derived distillates, and a slurry of SRC and water) and No. 6 Fuel Oil were evaluated in the 700-hp (30 x 10/sup 6/ Btu/hour) watertube, oil-designed boiler facility at PETC. The test program was managed by the International Coal Refining Company (ICRC) and sponsored by the Department of Energy. Other organizations were involved as necessary to provide the expertise required to execute the test program. This final report represents an integrated overview of the test program conducted at PETC. More detailed information with preliminary data can be obtained from separate reports prepared by PETC, Southern Research Institute, Wheelabrator-Frye, Babcock and Wilcox, and Combustion Engineering. These are presented as Annex Volumes A-F. 25 references, 41 figures, 15 tables.

  11. Reducing power consumption during execution of an application on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Peters, Amanda E. (Rochester, MN); Ratterman, Joseph D. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2012-06-05

    Methods, apparatus, and products are disclosed for reducing power consumption during execution of an application on a plurality of compute nodes that include: executing, by each compute node, an application, the application including power consumption directives corresponding to one or more portions of the application; identifying, by each compute node, the power consumption directives included within the application during execution of the portions of the application corresponding to those identified power consumption directives; and reducing power, by each compute node, to one or more components of that compute node according to the identified power consumption directives during execution of the portions of the application corresponding to those identified power consumption directives.

  12. Profiling an application for power consumption during execution on a compute node

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Peters, Amanda E; Ratterman, Joseph D; Smith, Brian E

    2013-09-17

    Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

  13. Profiling an application for power consumption during execution on a plurality of compute nodes

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Peters, Amanda E.; Ratterman, Joseph D.; Smith, Brian E.

    2012-08-21

    Methods, apparatus, and products are disclosed for profiling an application for power consumption during execution on a compute node that include: receiving an application for execution on a compute node; identifying a hardware power consumption profile for the compute node, the hardware power consumption profile specifying power consumption for compute node hardware during performance of various processing operations; determining a power consumption profile for the application in dependence upon the application and the hardware power consumption profile for the compute node; and reporting the power consumption profile for the application.

  14. Anomaly Detection in Dynamic Networks

    SciTech Connect (OSTI)

    Turcotte, Melissa

    2014-10-14

    Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

  15. Protein folding on rugged energy landscapes: Conformational diffusion on fractal networks

    E-Print Network [OSTI]

    Gregg Lois; J. Blawzdziewicz; Corey S. O'Hern

    2009-06-24

    We employ simulations of model proteins to study folding on rugged energy landscapes. We construct ``first-passage'' networks as the system transitions from unfolded to native states. The nodes and bonds in these networks correspond to basins and transitions between them in the energy landscape. We find power-laws between the folding time and number of nodes and bonds. We show that these scalings are determined by the fractal properties of first-passage networks. Reliable folding is possible in systems with rugged energy landscapes because first passage networks have small fractal dimension.

  16. XT Node Architecture Let's Review: Dual Core v. Quad Core

    E-Print Network [OSTI]

    DDR2 · 10GB/s peak @ 667MHz · 8GB/s nominal STREAMs Quad Core · Core · 2.1Ghz clock frequency · SSE to L1,L2,L3 · Memory · Dual Channel DDR2 · 12GB/s peak @ 800MHz · 10GB/s nominal STREAMs #12;Cray XT4 Node 9.6 GB/sec 9.6GB/sec 9.6 GB/sec 9.6GB/sec 2 ­ 8 GB 12.8 GB/sec direct connect memory (DDR 800) 6

  17. Mould expansions for the saddle-node and resurgence monomials

    E-Print Network [OSTI]

    Sauzin, David

    2007-01-01

    This article is an introduction to some aspects of \\'Ecalle's mould calculus, a powerful combinatorial tool which yields surprisingly explicit formulas for the normalising series attached to an analytic germ of singular vector field or of map. This is illustrated on the case of the saddle-node, a two-dimensional vector field which is formally conjugate to Euler's vector field $x^2\\frac{\\pa}{\\pa x}+(x+y)\\frac{\\pa}{\\pa y}$, and for which the formal normalisation is shown to be resurgent in $1/x$. Resurgence monomials adapted to alien calculus are also described as another application of mould calculus.

  18. Blind node in peach: environmental and genetic parameters 

    E-Print Network [OSTI]

    Boonprakob, Unaroj

    1991-01-01

    . 61 4. 2 The regression between the section parameter and the percentage of blind nodes of the selected peach genotypes . 62 5. 1 The procedure of Safranin-Fast Green staining used in the anatomical study. . 79 5. 2 Transverse section of 'Earli... for the observation in 1989. These cultivars were at Texas A&M University farm, College Station (CS); and at Texas Agricultural Experiment Station, Yoakum (YM). Two cultivars: 'Flordaprince' and 'EarliGrande, ' at a private orchard in Weslaco (WS) were also...

  19. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-01

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.

  20. Low latency, high bandwidth data communications between compute nodes in a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-22

    Methods, systems, and products are disclosed for data transfers between nodes in a parallel computer that include: receiving, by an origin DMA on an origin node, a buffer identifier for a buffer containing data for transfer to a target node; sending, by the origin DMA to the target node, a RTS message; transferring, by the origin DMA, a data portion to the target node using a memory FIFO operation that specifies one end of the buffer from which to begin transferring the data; receiving, by the origin DMA, an acknowledgement of the RTS message from the target node; and transferring, by the origin DMA in response to receiving the acknowledgement, any remaining data portion to the target node using a direct put operation that specifies the other end of the buffer from which to begin transferring the data, including initiating the direct put operation without invoking an origin processing core.