Powered by Deep Web Technologies
Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and...

2

U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, 4: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information October 4, 2012 - 6:00am Addthis PROBLEM: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information PLATFORM: HP Network Node Manager I (NNMi) v9.20 for HP-UX, Linux, Solaris, and Windows. ABSTRACT: Vulnerabilities can be exploited by malicious people to cause a DoS (Denial of Service) and potentially compromise a vulnerable system. reference LINKS: HP Security Bulletin: c03507708 SecurityTracker Alert ID: 1027605 Security Focus: 524302 CVE-2012-3267 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified with HP Network Node

3

U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

9: HP Network Node Manager i Input Validation Flaw Permits 9: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks August 7, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: HP Network Node Manager I (NNMi) v8.x, v9.0x, v9.1x, v9.20 for HP-UX, Linux, Solaris, and Windows ABSTRACT: Potential security vulnerabilities have been identified with HP Network Node Manager i (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS). Reference LINKS: HP Document ID: c03405705 SecurityTracker Alert ID: 1027345 Bugtraq ID: 54815 CVE-2012-2022 IMPACT ASSESSMENT:

4

U-025: HP OpenView Network Node Manager Bugs Let Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-025: HP OpenView Network Node Manager Bugs Let Remote Users U-025: HP OpenView Network Node Manager Bugs Let Remote Users Execute Arbitrary Code U-025: HP OpenView Network Node Manager Bugs Let Remote Users Execute Arbitrary Code November 2, 2011 - 8:00am Addthis PROBLEM: HP OpenView Network Node Manager Bugs Let Remote Users Execute Arbitrary Code. PLATFORM: HP OpenView Network Node Manager (OV NNM) v7.51, v7.53 running on HP-UX, Linux, Solaris, and Windows ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Support Center Document ID: c03054052 SecurityTracker Alert ID: 1026260 CVE-2011-1365 CVE-2011-1366 CVE-2011-1367 IMPACT ASSESSMENT: Medium Discussion: Several vulnerabilities were reported in HP OpenView Network Node Manager. A remote user can execute arbitrary code on the target system.

5

U-229: HP Network Node Manager i Input Validation Flaw Permits...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Network Node Manager I (NNMi) v8.x, v9.0x, v9.1x, v9.20 for HP-UX, Linux, Solaris, and Windows ABSTRACT: Potential security vulnerabilities have been identified with HP Network...

6

U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

204: HP Network Node Manager i Input Validation Hole Permits 204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks July 3, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 8.x, 9.0x, 9.1x ABSTRACT: Potential security vulnerabilities have been identified with HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS). reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027215 CVE-2012-2018 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP Network Node Manager i. The software does not properly filter HTML code from user-supplied input before

7

U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager i Input Validation Hole Permits 4: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks July 3, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 8.x, 9.0x, 9.1x ABSTRACT: Potential security vulnerabilities have been identified with HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS). reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027215 CVE-2012-2018 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP Network Node Manager i. The software does not properly filter HTML code from user-supplied input before

8

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-214: HP Network Node Manager Java JDK / JRE Multiple U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities July 17, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities PLATFORM: The vulnerabilities are reported in version 9.0x running on HP-UX, Linux, Solaris, and Windows. ABSTRACT: Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS). reference LINKS: HP Support document ID: c03405642 Secunia Advisory SA49966 IMPACT ASSESSMENT: High Discussion: HP has acknowledged some vulnerabilities in HP Network Node Manager, which can be exploited by malicious, local users to disclose potentially sensitive information and by malicious people to disclose potentially

9

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager Java JDK / JRE Multiple 4: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities July 17, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities PLATFORM: The vulnerabilities are reported in version 9.0x running on HP-UX, Linux, Solaris, and Windows. ABSTRACT: Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS). reference LINKS: HP Support document ID: c03405642 Secunia Advisory SA49966 IMPACT ASSESSMENT: High Discussion: HP has acknowledged some vulnerabilities in HP Network Node Manager, which can be exploited by malicious, local users to disclose potentially sensitive information and by malicious people to disclose potentially

10

Random walk based node sampling in self-organizing networks  

Science Conference Proceedings (OSTI)

Random walk is a means of network node sampling that requires little index maintenance and can function on almost all connected network topologies. With careful guidance, node samples following a desired probability distribution can be generated with ...

Ming Zhong; Kai Shen

2006-07-01T23:59:59.000Z

11

Underwater Acoustic Sensor Network with Energy Harvesting Nodes.  

E-Print Network (OSTI)

??This thesis explores the possibility of a self sustained and service free Underwater Acoustic Sensor Network (UASN). The network nodes are installed along a subsea… (more)

Huseby, Morten

2011-01-01T23:59:59.000Z

12

Permanent oscillations in a 3-node recurrent neural network model  

Science Conference Proceedings (OSTI)

In this paper we discuss the existence of oscillations in a specific recurrent neural network: the 3-node network with two weight parameters and one time delay. Simple and practical criteria for fixing the range of the parameters in this network model ... Keywords: 3-node networks, Recurrent neural networks, Time delays

Chunhua Feng; Christian O'Reilly; Réjean Plamondon

2010-12-01T23:59:59.000Z

13

Optimized relay node placement for connecting disjoint wireless sensor networks  

Science Conference Proceedings (OSTI)

Wireless sensor networks (WSNs) often operate in a harsh environment such as battlefield and may suffer simultaneous failure of multiple sensors that cause the network to become partitioned into disjoint segments. In order to prevent the application ... Keywords: Connectivity restoration, Network partitioning, Relay node placement, Wireless sensor networks

Sookyoung Lee; Mohamed Younis

2012-08-01T23:59:59.000Z

14

Energy efficient networking via dynamic relay node selection in wireless networks  

Science Conference Proceedings (OSTI)

Mobile wireless ad hoc networks need to maximize their network lifetime (defined as the time until the first node runs out of energy). In the broadcast network lifetime problem, all nodes are sending broadcast traffic, and one asks for an assignment ... Keywords: Ad hoc networks, Average case analysis, Network lifetime, Random graphs

Maurits De Graaf

2013-05-01T23:59:59.000Z

15

Performance of wireless sensor networks under random node failures  

SciTech Connect

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.

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

2011-01-28T23:59:59.000Z

16

Network lifetime analytical model for node-disjoint multipath routing in wireless sensor networks  

Science Conference Proceedings (OSTI)

The objective of every sensor node in a sensor network is to send the sensed data in the phenomena to a sink node. The network lifetime is maximal, when the energy consumption of each node is uniform. Many routing protocols select an optimal path to ...

Shiva G. Murthy; R. J. D. Souza; G. Varaprasad

2013-02-01T23:59:59.000Z

17

Neural node network and model, and method of teaching same  

DOE Patents (OSTI)

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.

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-01T23:59:59.000Z

18

Neural node network and model, and method of teaching same  

DOE Patents (OSTI)

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.

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

1995-12-26T23:59:59.000Z

19

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

SciTech Connect

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.

Kim, M; Leskovec, J

2011-11-14T23:59:59.000Z

20

Distributed detection of mobile malicious node attacks in wireless sensor networks  

Science Conference Proceedings (OSTI)

In wireless sensor networks, sensor nodes are usually fixed to their locations after deployment. However, an attacker who compromises a subset of the nodes does not need to abide by the same limitation. If the attacker moves his compromised nodes to ... Keywords: Intrusion detection, Mobile malicious node, Sequential hypothesis testing

Jun-Won Ho; Matthew Wright; Sajal K. Das

2012-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation  

Science Conference Proceedings (OSTI)

Wireless sensor networks (WSNs) have many applications which operate in hostile environments. Due to the harsh surroundings, WSNs may suffer from a large scale damage that causes many nodes to fail simultaneously and the network to get partitioned into ... Keywords: Fault-tolerance, Network segmentation, Relay node placement, Wireless sensor networks

Fatih Senel; Mohamed Younis

2011-10-01T23:59:59.000Z

22

Evaluating the impact of network density, hidden nodes and capture effect for throughput guarantee in multi-hop wireless networks  

Science Conference Proceedings (OSTI)

To optimize the performance of wireless networks, one needs to consider the impact of key factors such as interference from hidden nodes, the capture effect, the network density and network conditions (saturated versus non-saturated). In this research, ... Keywords: Capture effect, Hidden nodes, Multi-hop wireless networks, Throughput guarantee

Haitao Zhao; Emiliano Garcia-Palacios; Shan Wang; Jibo Wei; Dongtang Ma

2013-01-01T23:59:59.000Z

23

Avoiding energy holes in wireless sensor networks with nonuniform node distribution  

E-Print Network (OSTI)

Abstract—In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy used to mitigate the energy hole problem in wireless sensor networks (WSNs). We conclude that in a circular multihop sensor network (modeled as concentric coronas) with nonuniform node distribution and constant data reporting, the unbalanced energy depletion among all the nodes in the network is unavoidable. Even if the nodes in the inner coronas of the network have used up their energy simultaneously, the ones in the outermost corona may still have unused energy. This is due to the intrinsic many-to-one traffic pattern of WSNs. Nevertheless, nearly balanced energy depletion in the network is possible if the number of nodes increases in geometric progression from the outer coronas to the inner ones except the outermost one. Based on the analysis, we propose a novel nonuniform node distribution strategy to achieve nearly balanced energy depletion in the network. We regulate the number of nodes in each corona and derive the ratio between the node densities in the adjacent đi ţ 1Ţth and ith coronas by the strategy. Finally, we propose q-Switch Routing, a distributed shortest path routing algorithm tailored for the proposed nonuniform node distribution strategy. Extensive simulations have been performed to validate the analysis. Index Terms—Wireless sensor networks, nonuniform node distribution, energy hole problem, energy-efficient routing. 1

Xiaobing Wu; Guihai Chen; Ieee Computer Society; Sajal K. Das

2008-01-01T23:59:59.000Z

24

A virtual square grid-based coverage algorithm of redundant node for wireless sensor network  

Science Conference Proceedings (OSTI)

A virtual square grid-based coverage algorithm (VSGCA) is proposed in this paper. Each sensor node divides its sensing range into virtual square grids, if all the grids are covered by neighbors, the target node is redundant node. Compared with some previous ... Keywords: Coverage, Energy conservation, Square grid, Wireless sensor network (WSN)

Yanheng Liu; Longxiang Suo; Dayang Sun; Aimin Wang

2013-03-01T23:59:59.000Z

25

Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach  

Science Conference Proceedings (OSTI)

This paper presents a biobjective genetic algorithm (GA) to design reliable two-node connected telecommunication networks. Because the exact calculation of the reliability of a network is NP-hard, network designers have been reluctant to use network ... Keywords: decision theory, genetic algorithms, heuristics, multiple criteria, networks, reliability, simulation

Abdullah Konak; Alice E. Smith

2011-07-01T23:59:59.000Z

26

On the energy hole problem of nonuniform node distribution in wireless sensor networks  

E-Print Network (OSTI)

Abstract — In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy in wireless sensor networks, which aims to avoid the energy hole around the sink. We find that in a circular sensor network with a nonuniform node distribution and constant data reporting, the unbalanced energy depletion among the nodes in the whole network is unavoidable. This is because although all the inner nodes have used up their energy simultaneously, the outmost part of the network may still have energy left. In spite of this fact, a suboptimal energy efficiency among the inner parts of the network is possible if the number of nodes increases with geometric proportion from the outer parts to the inner ones. In our proposed nonuniform node distribution strategy, the ratio between the node densities of the adjacent (i+1)th corona and the ith corona is equal to (2i ? 1)/q(2i +1), where q is the geometric proportion mentioned above. We also present a routing algorithm with this node distribution strategy. Simulation experiments demonstrate that when the network lifetime has ended, the nodes in the inner parts of the network achieve nearly balanced energy depletion, and only less than 10 % of the total energy is wasted. I.

Xiaobing Wu; Guihai Chen

2006-01-01T23:59:59.000Z

27

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes  

E-Print Network (OSTI)

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

Sharma, Vinod

28

An Energy-Efficient Cooperative Node Selction Scheme in Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

In this paper, we propose a novel cooperative node selection scheme in wireless sensor networks that operate in energy-constrained environment. This scheme can obtain higher energy efficiency than the traditional cooperative transmission, which only ... Keywords: cooperative node selection, energy effiency, wireless sensor networks

Yu Zhang; Yueming Cai; Wendong Yang; Youyun Xu

2009-02-01T23:59:59.000Z

29

Community detection algorithm based on centrality and node distance in scale-free networks  

Science Conference Proceedings (OSTI)

In this paper, we present a method for detecting community structures based on centrality value and node distance. Many real world networks possess a scale-free property and this property makes community detection difficult especially on algorithms that ... Keywords: centrality value, community detection, node distance, scale-free network

Sorn Jarukasemratana; Tsuyoshi Murata; Xin Liu

2013-05-01T23:59:59.000Z

30

A two-objective evolutionary approach based on topological constraints for node localization in wireless sensor networks  

Science Conference Proceedings (OSTI)

Abstract: To know the location of nodes plays an important role in many current and envisioned wireless sensor network applications. In this framework, we consider the problem of estimating the locations of all the nodes of a network, based on noisy ... Keywords: Multiobjective evolutionary algorithms, Node localization, Range measurements, Stochastic optimization, Wireless sensor networks

Massimo Vecchio; Roberto López-Valcarce; Francesco Marcelloni

2012-07-01T23:59:59.000Z

31

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes  

E-Print Network (OSTI)

We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop efficient energy management policies. First, for a single node, we obtain policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable suboptimal policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay. Next using the results for a single node, we develop efficient MAC policies.

Sharma, Vinod; Joseph, Vinay

2008-01-01T23:59:59.000Z

32

Architecture of Wireless Multimedia Mesh Network Nodes for Longwall Coal Mine Automation  

Science Conference Proceedings (OSTI)

Wireless multimedia mesh network is used for longwall coal mine face to transmit signal of data, voice and video in real time with the development of modern coal mine. The performance of the backhaul network especially it’s throughput is the essential ... Keywords: architecturet, mesh network nodes, longwall coal mine, 3-radio

Xiaolong Feng; Jiansheng Qian

2010-06-01T23:59:59.000Z

33

The development of a wireless sensor network sensing node utilising adaptive self-diagnostics  

Science Conference Proceedings (OSTI)

In Wireless Sensor Network (WSN) applications, sensor nodes are often deployed in harsh environments. Routine maintenance, fault detection and correction is difficult, infrequent and expensive. Furthermore, for long-term deployments in excess of a year, ...

Hai Li; Mark C. Price; Jonathan Stott; Ian W. Marshall

2007-09-01T23:59:59.000Z

34

The design of sustainable wireless sensor network node using solar energy and phase change memory  

Science Conference Proceedings (OSTI)

Sustainability of wireless sensor network (WSN) is crucial to its economy and efficiency. While previous works have focused on solving the energy source limitation through solar energy harvesting, we reveal in this paper that sensor node's lifespan could ...

Ping Zhou, Youtao Zhang, Jun Yang

2013-03-01T23:59:59.000Z

35

Fast recovery from dual-link or single-node failures in IP networks using tunneling  

Science Conference Proceedings (OSTI)

This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and Internet Protocol (IP) tunneling. The primary scheme provides resilience for up to two link failures along a path. The highlight ... Keywords: IP fast reroute, failure recovery, independent trees, multiple-link failure, network protection, node failure

Shrinivasa Kini; Srinivasan Ramasubramanian; Amund Kvalbein; Audun Fosselie Hansen

2010-12-01T23:59:59.000Z

36

TinyNode: a comprehensive platform for wireless sensor network applications  

Science Conference Proceedings (OSTI)

We introduce the TinyNode platform for wireless sensor networks. Supporting both research and industrial deployments, the platform offers communication ranges that exceed current platforms by a factor of 3 to 5, while consuming similar energy. It comes ... Keywords: embedded systems, wireless sensor networks

Henri Dubois-Ferričre; Laurent Fabre; Roger Meier; Pierre Metrailler

2006-04-01T23:59:59.000Z

37

SECTOR: secure tracking of node encounters in multi-hop wireless networks  

Science Conference Proceedings (OSTI)

In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchronization), ... Keywords: mobile networks, mobility, positioning, security, security associations

Srdjan ?apkun; Levente Buttyán; Jean-Pierre Hubaux

2003-10-01T23:59:59.000Z

38

Transmission Capacity of Wireless Ad Hoc Networks with Energy Harvesting Nodes  

E-Print Network (OSTI)

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.

Vaze, Rahul

2012-01-01T23:59:59.000Z

39

Survey Paper: A survey of MAC layer solutions to the hidden node problem in ad-hoc networks  

Science Conference Proceedings (OSTI)

Ad-hoc networks suffer from the problem of hidden nodes (terminals), which leads to severe degradation of network throughput. This survey gives a comprehensive overview of Medium Access Control (MAC) protocols which directly or indirectly address this ... Keywords: Hidden node problem, MAC layer, Protocol classification, Protocol comparison

Katarzyna Kosek-Szott

2012-05-01T23:59:59.000Z

40

Problems with providing QoS in EDCA ad-hoc networks with hidden and exposed nodes  

Science Conference Proceedings (OSTI)

In this paper we investigate the problem of providing QoS within IEEE 802.11 EDCA ad-hoc networks. Our study shows that a strong unfairness in medium access between certain nodes may appear. It also shows that the possible unfairness is dependent on ... Keywords: EDCA, QoS, ad-hoc, hidden and exposed nodes

Katarzyna Kosek

2009-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

HP-CAT  

NLE Websites -- All DOE Office Websites (Extended Search)

Home Advanced Photon Source Advanced Photon Source User Activity Report HP-CAT, High Pressure Science Sector Collaborative Access Team This CAT is currently in a...

42

Timing Synchronization and Node Localization in Wireless Sensor Networks: Efficient Estimation Approaches and Performance Bounds  

E-Print Network (OSTI)

Wireless sensor networks (WSNs) consist of a large number of sensor nodes, capable of on-board sensing and data processing, that are employed to observe some phenomenon of interest. With their desirable properties of flexible deployment, resistance to harsh environment and lower implementation cost, WSNs envisage a plethora of applications in diverse areas such as industrial process control, battle- field surveillance, health monitoring, and target localization and tracking. Much of the sensing and communication paradigm in WSNs involves ensuring power efficient transmission and finding scalable algorithms that can deliver the desired performance objectives while minimizing overall energy utilization. Since power is primarily consumed in radio transmissions delivering timing information, clock synchronization represents an indispensable requirement to boost network lifetime. This dissertation focuses on deriving efficient estimators and performance bounds for the clock parameters in a classical frequentist inference approach as well as in a Bayesian estimation framework. A unified approach to the maximum likelihood (ML) estimation of clock offset is presented for different network delay distributions. This constitutes an analytical alternative to prior works which rely on a graphical maximization of the likelihood function. In order to capture the imperfections in node oscillators, which may render a time-varying nature to the clock offset, a novel Bayesian approach to the clock offset estimation is proposed by using factor graphs. Message passing using the max-product algorithm yields an exact expression for the Bayesian inference problem. This extends the current literature to cases where the clock offset is not deterministic, but is in fact a random process. A natural extension of pairwise synchronization is to develop algorithms for the more challenging case of network-wide synchronization. Assuming exponentially distributed random delays, a network-wide clock synchronization algorithm is proposed using a factor graph representation of the network. Message passing using the max- product algorithm is adopted to derive the update rules for the proposed iterative procedure. A closed form solution is obtained for each node's belief about its clock offset at each iteration. Identifying the close connections between the problems of node localization and clock synchronization, we also address in this dissertation the problem of joint estimation of an unknown node's location and clock parameters by incorporating the effect of imperfections in node oscillators. In order to alleviate the computational complexity associated with the optimal maximum a-posteriori estimator, two iterative approaches are proposed as simpler alternatives. The first approach utilizes an Expectation-Maximization (EM) based algorithm which iteratively estimates the clock parameters and the location of the unknown node. The EM algorithm is further simplified by a non-linear processing of the data to obtain a closed form solution of the location estimation problem using the least squares (LS) approach. The performance of the estimation algorithms is benchmarked by deriving the Hybrid Cramer-Rao lower bound (HCRB) on the mean square error (MSE) of the estimators. We also derive theoretical lower bounds on the MSE of an estimator in a classical frequentist inference approach as well as in a Bayesian estimation framework when the likelihood function is an arbitrary member of the exponential family. The lower bounds not only serve to compare various estimators in our work, but can also be useful in their own right in parameter estimation theory.

Ahmad, Aitzaz 1984-

2012-12-01T23:59:59.000Z

43

HP Hands Fergie  

Science Conference Proceedings (OSTI)

In the most recent installment of HP's "Hands" campaign, the Digital Dutchess herself takes fans on a glamorous tour of her personal computer. Motion Theory teamed with Goodby, Silverstein & Partners to bring Fergie's many ideas to life.

Jodie Schell

2010-07-01T23:59:59.000Z

44

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

DOE Patents (OSTI)

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.

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

2011-09-20T23:59:59.000Z

45

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

SciTech Connect

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.

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

2013-01-01T23:59:59.000Z

46

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

SciTech Connect

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.

Postel, John; Bannister, Joe

2000-03-15T23:59:59.000Z

47

Special Issue "Underwater Sensor Nodes and Underwater Sensor Networks" A special issue of Sensors (ISSN 1424-8220)  

E-Print Network (OSTI)

Special Issue "Underwater Sensor Nodes and Underwater Sensor Networks" A special issue of Sensors (ISSN 1424-8220) Website: http://www.mdpi.com/journal/sensors/special_issues/underwater_sens Journal prediction, oil monitoring and so on. This special issue tries to collect the recent advances on underwater

Chen, Min

48

A new busy signal-based MAC protocol supporting QoS for ad-hoc networks with hidden nodes  

Science Conference Proceedings (OSTI)

This article presents three versions of a novel MAC protocol for IEEE 802.11 ad-hoc networks called Busy Signal-based Mechanism turned On (BusySiMOn) (This is an extended version of our conference paper: [15]). The key idea of the proposed solution is ... Keywords: EDCA, Hidden nodes, MAC protocol, QoS, Wireless communications

Katarzyna Kosek-Szott; Marek Natkaniec; Andrzej R. Pach

2013-08-01T23:59:59.000Z

49

HP scalable computing architecture  

Science Conference Proceedings (OSTI)

The HP V-Class server family provides up to 32 processors and 32 GB of memory in a single cabinet. Scalable Computing Architecture technology allows multiple V-Class cabinets to be interconnected, forming a single cache coherent non-uniform memory architecture ...

Randy Wright; Arun Kumar

2000-10-01T23:59:59.000Z

50

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

E-Print Network (OSTI)

that solves the energy management problem at the node levelpredominately in energy saving problems. The energy sourcefor two sub-problems of our energy managing mechanism in

Athanassios Boulis; Mani Srivastava

2004-01-01T23:59:59.000Z

51

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)

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.

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-27T23:59:59.000Z

52

The placement-configuration problem for intrusion detection nodes in wireless sensor networks  

Science Conference Proceedings (OSTI)

The deployment and configuration of a distributed network intrusion detection system (NIDS) in a large Wireless Sensor Network (WSN) is an enormous challenge. A reduced number of devices equipped with detection capabilities have to be placed on strategic ...

Juan E. Tapiador, John A. Clark

2013-10-01T23:59:59.000Z

53

HP Angle Light 4x3 Blue  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Hewlett-Packard Development Company, L.P. Hewlett-Packard Development Company, L.P. 1 © Copyright 2010 Hewlett-Packard Development Company, L.P. Garett Montgomery DVLabs, TippingPoint 18May2010 SCADA: THREAT LANDSCAPE © Copyright 2010 Hewlett-Packard Development Company, L.P. 2 GARETT MONTGOMERY - US Navy: Electronics Technician (Communications) - Network Security at Naval Postgraduate School - Masters Degree in Information Assurance * CISSP, CWSP, GSNA, SnortCP, C|EH, etc. - Security Researcher at TippingPoint DVLabs * Focusing on SCADA * TippingPoint is a leading provider of Intrusion Prevention Systems (IPS). * www.tippingpoint.com * HP purchased TippingPoint as part of 3com acquisition, April 2010. * http://www.hp.com/hpinfo/newsroom/press/2009/091111xa.html © Copyright 2010 Hewlett-Packard Development Company, L.P.

54

Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks  

Science Conference Proceedings (OSTI)

The wireless mesh network is a new emerging broadband technology providing the last-mile Internet access for mobile users by exploiting the advantage of multiple radios and multiple channels. The throughput improvement of the network relies heavily on ... Keywords: Channel assignment, Multiple channels, Multiple radios, Particle swarm optimization algorithm, Wireless mesh networks

Hongju Cheng; Naixue Xiong; Athanasios V. Vasilakos; Laurence Tianruo Yang; Guolong Chen; Xiaofang Zhuang

2012-07-01T23:59:59.000Z

55

Distributed MAC protocol for networks with multipacket reception capability and spatially distributed nodes  

E-Print Network (OSTI)

The physical layer of future wireless networks will be based on novel radio technologies such as Ultra-Wideband (UWB) and Multiple-Input Multiple-Output (MIMO). One of the important capabilities of such technologies is the ...

Celik, Guner Dincer

2007-01-01T23:59:59.000Z

56

Optimal SISO and MIMO Spectral Efficiency to Minimize Hidden-Node Network Interference  

E-Print Network (OSTI)

In this letter, the optimal spectral efficiency for a given message size that minimizes the probability of causing disruptive interference for ad hoc wireless networks or cognitive radios is investigated. Implicitly, the ...

Lincoln Laboratory; Bliss, Daniel W.; Bliss, Daniel W.

57

Wireless sensor network node with asynchronous architecture and vibration harvesting micro power generator  

Science Conference Proceedings (OSTI)

This paper presents recent advances in the development of a microsystem designed to be part of a wireless sensor network. This microsystem is developed with two particular technologies: asynchronous circuits and ambient energy harvesting power generator. ...

Yasser Ammar; Aurélien Buhrig; Marcin Marzencki; Benoît Charlot; Skandar Basrour; Karine Matou; Marc Renaudin

2005-10-01T23:59:59.000Z

58

A new two level hierarchy structuring for node partitioning in ad hoc networks  

Science Conference Proceedings (OSTI)

A big challenge in designing a distributed application is the partitioning which consists of optimizing the system component inter-communication. In this paper we introduce a new approach of Ad Hoc network group formation based on two level hierarchy ... Keywords: communication, distributed system, graph partitioning, group formation, partitioning

Benaouda Nacéra; Guyennet Hervé; Hammad Ahmed; Mostefai Mohammed

2010-03-01T23:59:59.000Z

59

Problems with Correct Traffic Differentiation in Line Topology IEEE 802.11 EDCA Networks in the Presence of Hidden and Exposed Nodes  

Science Conference Proceedings (OSTI)

The problem of content delivery with a required QoS is currently one of the most important. In ad-hoc networks it is IEEE 802.11 EDCA which tries to face this problem. This paper describes several EDCA line topology configurations with mixed priorities ... Keywords: EDCA, QoS, hidden and exposed nodes, simulations

Katarzyna Kosek; Marek Natkaniec; Luca Vollero

2009-07-01T23:59:59.000Z

60

NERSC's Data Transfer Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Data Transfer Nodes Data Transfer Nodes Data Transfer Nodes Overview The data transfer nodes are NERSC servers dedicated to performing transfers between NERSC data storage resources such as HPSS and the NERSC Global Filesystem (NGF), and storage resources at other sites including the Leadership Computing Facility at ORNL (Oak Ridge National Laboratory). These nodes are being managed (and monitored for performance) as part of a collaborative effort between ESnet, NERSC, and ORNL to enable high performance data movement over the high-bandwidth 10Gb ESnet wide-area network (WAN). Restrictions In order to keep the data transfer nodes performing optimally for data transfers, we request that users restrict interactive use of these systems to tasks that are related to preparing data for transfer or are directly

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Service Manager Unspecified Flaw Lets Remote Users Gain 8: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access August 15, 2013 - 1:30am Addthis PROBLEM: A potential security vulnerability has been identified with HP Service Manager. The vulnerability could be exploited to allow remote unauthenticated access and elevation of privilege. PLATFORM: HP Service Manager v9.31, v9.30, v9.21, v7.11, v6.2.8 ABSTRACT: The vulnerabilities are reported in versions 9.31 and prior. REFERENCE LINKS: SecurityTracker Alert ID: 1028912 CVE-2013-4808 IMPACT ASSESSMENT: High DISCUSSION: A vulnerability was reported in HP Service Manager. A remote user can gain unauthorized access on the target system. IMPACT: User access via network

62

V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Service Manager Unspecified Flaw Lets Remote Users Gain 8: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access August 15, 2013 - 1:30am Addthis PROBLEM: A potential security vulnerability has been identified with HP Service Manager. The vulnerability could be exploited to allow remote unauthenticated access and elevation of privilege. PLATFORM: HP Service Manager v9.31, v9.30, v9.21, v7.11, v6.2.8 ABSTRACT: The vulnerabilities are reported in versions 9.31 and prior. REFERENCE LINKS: SecurityTracker Alert ID: 1028912 CVE-2013-4808 IMPACT ASSESSMENT: High DISCUSSION: A vulnerability was reported in HP Service Manager. A remote user can gain unauthorized access on the target system. IMPACT: User access via network

63

ElementNodeIterator  

Science Conference Proceedings (OSTI)

... iter=element->node_iterator(); !iter.end(); ++iter) { Node *node = iter.node(); // do something ... node returns a pointer to the iterator's current Node . ...

2013-08-23T23:59:59.000Z

64

Hewlett Packard Company HP | Open Energy Information  

Open Energy Info (EERE)

Hewlett Packard Company HP Hewlett Packard Company HP Jump to: navigation, search Name Hewlett-Packard Company (HP) Place Palo Alto, California Zip 94304 Sector Solar Product US-based personal and corporate computer manufacturer, software developer, and IT infrastructure company and owner of SunPower Corporation; designer, manufacturer and installer of solar powered electricity systems. References Hewlett-Packard Company (HP)[1] LinkedIn Connections CrunchBase Profile No CrunchBase profile. Create one now! This article is a stub. You can help OpenEI by expanding it. Hewlett-Packard Company (HP) is a company located in Palo Alto, California . References ↑ "Hewlett-Packard Company (HP)" Retrieved from "http://en.openei.org/w/index.php?title=Hewlett_Packard_Company_HP&oldid=346506

65

Energy efficient sensor node implementations  

Science Conference Proceedings (OSTI)

In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. ... Keywords: acoustic, distributed sensor network (dsn), dsp, fpga, seismic, vehicle classification, video

Jan R. Frigo; Eric Y. Raby; Sean M. Brennan; Christophe Wolinski; Charles Wagner; Francois Charot; Edward Rosten; Vinod K. Kulathumani

2010-02-01T23:59:59.000Z

66

Sinoatrial node  

NLE Websites -- All DOE Office Websites (Extended Search)

NA Date: NA Question: What is the force that acts upon the sinoatrial node in the heart that makes the sinoatrial node send out the electrical charge that causes the heart to...

67

T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP Security Bulletin - HP-UX Running OpenSSL, Remote 0: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass March 4, 2011 - 3:05pm Addthis PROBLEM: Potential Security Impact: Remote execution of arbitrary code, Denial of Service (DoS), authentication bypass. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31 running OpenSSL before vA.00.09.08q. ABSTRACT: 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. reference LINKS: Net-Security Advisory: HPSBUX02638

68

T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

70: HP Security Bulletin - HP-UX Running OpenSSL, Remote 70: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass March 4, 2011 - 3:05pm Addthis PROBLEM: Potential Security Impact: Remote execution of arbitrary code, Denial of Service (DoS), authentication bypass. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31 running OpenSSL before vA.00.09.08q. ABSTRACT: 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. reference LINKS: Net-Security Advisory: HPSBUX02638

69

Node-Capacitated Ring Routing  

Science Conference Proceedings (OSTI)

We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas' lemma provides a characterization for general ... Keywords: half-integral flow, multicommodity flow, ring routing

AndrÁs Frank; Bruce Shepherd; Vivek Tandon; Zoltán Végh

2002-05-01T23:59:59.000Z

70

Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?  

E-Print Network (OSTI)

Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters blindly broadcast without knowledge of the surrounding nodes, two fundamental design parameters are the node transmission probability and the transmission spectral efficiency. In this paper these parameters are selected to maximize end-to-end performance, characterized by the product of transmitter density, hop distance and rate. Due to the intractability of the problem as stated, an approximation function is examined which proves reasonably accurate. Our results show how the above design parameters should be selected based on inherent system parameters such as the path loss exponent and the noise level.

Blomer, Joseph

2010-01-01T23:59:59.000Z

71

T-608: HP Virtual Server Environment Lets Remote Authenticated...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

72

T-623: HP Business Availability Center Input Validation Hole...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP Business Availability Center Input Validation Hole Permits Cross-Site Scripting Attacks T-623: HP Business Availability Center Input Validation Hole Permits Cross-Site...

73

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Other Agencies You are here Home HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for...

74

U-013: HP Data Protector Multiple Unspecified Vulnerabilities | Department  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP Data Protector Multiple Unspecified Vulnerabilities 3: HP Data Protector Multiple Unspecified Vulnerabilities U-013: HP Data Protector Multiple Unspecified Vulnerabilities October 18, 2011 - 9:00am Addthis PROBLEM: HP Data Protector Multiple Unspecified Vulnerabilities. PLATFORM: HP Data Protector Notebook Extension 6.20; HP Data Protector for Personal Computers 7.0 ABSTRACT: Multiple vulnerabilities were reported in HP Data Protector. A remote user can execute arbitrary code on the target system. reference LINKS: HP Security Document ID: c03054543 SecurityTracker Alert ID: 1026195 Secunia Advisory: SA46468 CVE-2011-3156 CVE-2011-3157 CVE-2011-3158 CVE-2011-3159 CVE-2011-3160 CVE-2011-3161 CVE-2011-3162 IMPACT ASSESSMENT: High Discussion: Potential security vulnerabilities has been identified with HP Data Protector Notebook Extension. These vulnerabilities could be remotely

75

1-HP clueweb09-en0003-31-18762 0 0 1-HP clueweb09 ...  

Science Conference Proceedings (OSTI)

... 73-30313 0 0 4-HP clueweb09-en0000-99-23325 0 0 4-NAME Altoona_Curve 2 1 4-NAME american_hockey_league 2 2 4-NAME Amtrak 2 3 4 ...

2009-10-25T23:59:59.000Z

76

Compute Node MD3000 Storage Array  

E-Print Network (OSTI)

Compute Node MD3000 Storage Array Dell 2950 Head Node 24-Port Switch Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node Compute Node 24-Port Switch Dell 2950

Weber, David J.

77

Hopper Login Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Login Nodes Login Nodes Login Nodes Login Node Quick Facts When you ssh to hopper.nersc.gov, you are connecting to a "login node." Login nodes are used to edit files, compile codes, and submit job scripts to the batch system to run on the "compute nodes." Hopper has 12 login nodes (this is largely transparent to users). 4 quad-core AMD 2.4 GHz Opteron processers (16 cores total) on 8 of the login nodes 4 8-core AMD 2.0 GHz Opteron processors (32 cores total) on 4 of the login nodes. Each login node has 128 GB of memory. The login nodes sit behind a load balancer. New connections are assigned to a login node on a round robin fashion with the exception that if you've connected to Hopper recently, the load balancer will attempt to put you on the same login node as your previous connection.

78

T-623: HP Business Availability Center Input Validation Hole Permits  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP Business Availability Center Input Validation Hole 3: HP Business Availability Center Input Validation Hole Permits Cross-Site Scripting Attacks T-623: HP Business Availability Center Input Validation Hole Permits Cross-Site Scripting Attacks May 16, 2011 - 3:05pm Addthis PROBLEM: A vulnerability was reported in HP Business Availability Center. A remote user can conduct cross-site scripting attacks. PLATFORM: HP Business Availability Center software 8.06 and prior versions ABSTRACT: The software does not properly filter HTML code from user-supplied input before displaying the input. reference LINKS: SecurityTracker Alert ID:1025535 HP Knowledge Base CVE-2011-1856 Secunia ID: SA44569 HP Document ID:c02823184 | ESB-2011.0525 IMPACT ASSESSMENT: High Discussion: A remote user can cause arbitrary scripting code to be executed by the

79

Design and test of nodes for field information acquisition based on WUSN  

Science Conference Proceedings (OSTI)

The wireless sensor network technology was researched. Some wireless underground sensor network nodes and a sink node based on embedded technology and RF technology were designed innovatively. WUSN node consists of sensor, the processor, wireless communication ... Keywords: MSP430, WUSN, depth, field information acquisition, frequency, sink node

Xiaoqing Yu; Pute Wu; Zenglin Zhang

2011-10-01T23:59:59.000Z

80

Energy harvesting sensor nodes: Survey and implications  

E-Print Network (OSTI)

Sensor networks with battery-powered nodes can seldom simultaneously meet the design goals of lifetime, cost, sensing reliability and sensing and transmission coverage. Energy-harvesting, converting ambient energy to electrical energy, has emerged as an alternative to power sensor nodes. By exploiting recharge opportunities and tuning performance parameters based on current and expected energy levels, energy harvesting sensor nodes have the potential to address the conflicting design goals of lifetime and performance. This paper surveys various aspects of energy harvesting sensor systems — architecture, energy sources and storage technologies and examples of harvesting-based nodes and applications. The study also discusses the implications of recharge opportunities on sensor node operation and design of sensor network solutions. 1

Sujesha Sudevalayam; Purushottam Kulkarni

2008-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

U-052: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: HP Protect Tools Device Access Manager Unspecified Bug Lets 2: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code U-052: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code December 6, 2011 - 7:00am Addthis PROBLEM: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code. PLATFORM: HP Protect Tools Device Access Manager for Windows earlier than v.6.1.0.1 running on the following HP PCs: HP EliteBook 2560p Notebook PC HP EliteBook 2760p Notebook PC HP EliteBook 8460p Notebook PC HP EliteBook 8460w Mobile Workstation HP EliteBook 8560p Notebook PC HP EliteBook 8560w Mobile Workstation HP EliteBook 8760w Mobile Workstation HP ProBook 4230s Notebook PC

82

U-052: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: HP Protect Tools Device Access Manager Unspecified Bug Lets 2: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code U-052: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code December 6, 2011 - 7:00am Addthis PROBLEM: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code. PLATFORM: HP Protect Tools Device Access Manager for Windows earlier than v.6.1.0.1 running on the following HP PCs: HP EliteBook 2560p Notebook PC HP EliteBook 2760p Notebook PC HP EliteBook 8460p Notebook PC HP EliteBook 8460w Mobile Workstation HP EliteBook 8560p Notebook PC HP EliteBook 8560w Mobile Workstation HP EliteBook 8760w Mobile Workstation HP ProBook 4230s Notebook PC

83

Wireless Sensor Node Placement Using Hybrid Genetic Programming and Genetic Algorithms  

Science Conference Proceedings (OSTI)

The ease of use and re-configuration in a wireless network has played a key role in their widespread growth. The node deployment problem deals with an optimal placement strategy of the wireless nodes. This paper models a wireless sensor network, consisting ... Keywords: Genetic Algorithms, Genetic Programming, Hierarchical Genetic Algorithms, Node Deployment, Wireless Sensor Networks Optimization

Arpit Tripathi; Pulkit Gupta; Aditya Trivedi; Rahul Kala

2011-04-01T23:59:59.000Z

84

Data Transfer Nodes Yield Results!  

NLE Websites -- All DOE Office Websites (Extended Search)

DTN DTN Data Transfer Nodes Yield Results August 1, 2011 | Tags: Accelerator Science, Data Transfer, ESnet Linda Vu, +1 510 495 2402, lvu@lbl.gov The ability to reliably move and share data around the globe is essential to scientific collaboration, that's why three Department of Energy (DOE) Scientific Computing Centers-Argonne and Oak Ridge Leadership Computing Facilities, and the National Energy Research Scientific Computing Center (NERSC)-have teamed up to focus on optimizing wide area network (WAN) transfers. This ongoing effort began several years ago when each site deployed dedicated transfer nodes (DTNs), optimized for carrying data between the DOE facilities. Today, engineers from each site continue to meet regularly with DOE's Energy Sciences Network staff (ESnet) to develop strategies

85

HP Angle Light 4x3 Blue  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8. UNAUTHORIZED OR INAPPROPRIATE APPLICATIONS OR DEVICES ON CONTROL SYSTEMS NETWORKS - Iran, Summer 2009, Classified electronics data on US president's helicopter (MarineOne)...

86

Hopper Compute Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Compute Nodes Compute Nodes Compute Nodes MC-proc.png Compute Node Configuration 6,384 nodes 2 twelve-core AMD 'MagnyCours' 2.1-GHz processors per node (see die image to the right and schematic below) 24 cores per node (153,216 total cores) 32 GB DDR3 1333-MHz memory per node (6,000 nodes) 64 GB DDR3 1333-MHz memory per node (384 nodes) Peak Gflop/s rate: 8.4 Gflops/core 201.6 Gflops/node 1.28 Peta-flops for the entire machine Each core has its own L1 and L2 caches, with 64 KB and 512KB respectively One 6-MB L3 cache shared between 6 cores on the Magny-Cours processor Four DDR3 1333-MHz memory channels per twelve-core 'MagnyCours' processor Compute Node Software By default the compute nodes run a restricted low-overhead operating system optimized for high performance computing called "Cray Linux Environment"

87

U-238: HP Service Manager Input Validation Flaw Permits Cross...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers...

88

From: Mulveny, Jennifer [mailto:jennifer.mulveny@hp.com]  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Friday, April 13, 2012 11:33 AM Friday, April 13, 2012 11:33 AM To: Exparte Communications Cc: Watt, Steve Subject: HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies This following notes summarize the discussion that HP held via teleconference with the Department of Energy on April 10, 2012. Hewlett-Packard 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. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY STAR, are the most effective mechanism for improving energy efficiency of IT products, but we understand the approach of regulating mandatory minimum efficiencies to address poor performing products. HP is a

89

From: Mulveny, Jennifer [mailto:jennifer.mulveny@hp.com]  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Tuesday, April 17, 2012 4:04 PM Tuesday, April 17, 2012 4:04 PM To: Mulveny, Jennifer; Exparte Communications Cc: Watt, Steve; Kido, Michael Subject: RE: HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies This following notes summarize the discussion that HP held via teleconference with the Department of Energy on April 10, 2012. Hewlett-Packard 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. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY STAR, are the most effective mechanism for improving energy efficiency of IT products, but we understand the approach of regulating mandatory minimum efficiencies to address poor performing products. HP is a

90

Multisensor Module for Networked Infomechanical Systems  

E-Print Network (OSTI)

Wireless networks links also include interfaces to distributed mote networks. • Energy for MultiSensor node operation

Jason Gordon; Kris Porter; Lisa Shirachi; Rachel Scollans; Victor Chen; William Kaiser

2005-01-01T23:59:59.000Z

91

PDSF Interactive Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Interactive (login) Nodes Interactive (login) Nodes Interactive (login) Nodes There are 4 interactive nodes at PDSF, pdsf[1-4].nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the gateways to accessing the rest of PDSF. Users can submit batch jobs as well as view and manipulate their files and directories from the interactive nodes. The configuration of the interactive nodes is shown in the table below. Processor Clock Speed (GHz) Architecture Cores Total Memory (GB) Scratch Space (GB) Intel Xeon X5650 2.67 x86_64 12 47 184 Because these nodes are shared by many users anything disruptive you might do affects not only your work but their work, too. Please take a look at the Best Practices page for guidance about what you should and should not do on the interactive nodes.

92

PDSF Compute Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Compute Nodes Compute Nodes Compute Nodes There are currently 2632 nodes available on PDSF. The compute (batch) nodes at PDSF are heterogenous, reflecting the periodic procurement of new nodes (and the eventual retirement of old nodes). From the user's perspective they are essentially all equivalent except that some have more memory per job slot. If your jobs have memory requirements beyond the default maximum of 1.1GB you should specify that in your job submission and the batch system will run your job on an appropriate node. See Submitting jobs for more information. Processor Clock Speed (GHz) Architecture Cores Available Memory (GB) Scratch (GB/core) Job Slots Quad Intel 2.2 lx24-amd64 8 23.4 10 8 QuadCore AMD/Intel 2.1 lx24-amd64 8 15.6 10 8 6 Core Intel 2.3 lx24-amd64 12 47.0 10 12

93

Perlick: ENERGY STAR Referral (HP72ROO-S) | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

HP72ROO-S) Perlick: ENERGY STAR Referral (HP72ROO-S) February 8, 2011 DOE referred Perlick refrigerator HP72ROO-S to EPA, brand manager of the ENERGY STAR program, for appropriate...

94

Perlick: ENERGY STAR Referral (HP48RO-S) | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

HP48RO-S) Perlick: ENERGY STAR Referral (HP48RO-S) February 8, 2011 DOE referred Perlick refrigerator HP48RO-S to EPA, brand manager of the ENERGY STAR program, for appropriate...

95

U-095: HP Data Protector Media Operations Lets Remote Users Execute...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code U-095: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code February 3, 2012 -...

96

V-144: HP Printers Let Remote Users Access Files on the Printer |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Printers Let Remote Users Access Files on the Printer 4: HP Printers Let Remote Users Access Files on the Printer V-144: HP Printers Let Remote Users Access Files on the Printer April 29, 2013 - 12:27am Addthis PROBLEM: HP Printers Let Remote Users Access Files on the Printer PLATFORM: HP Color LaserJet 3000 Q7534A HP Color LaserJet 3800 Q5981A HP Color LaserJet 4700 Q7492A HP Color LaserJet 4730 Multifunction Printer CB480A HP Color LaserJet 4730 Multifunction Printer CB480A HP Color LaserJet 5550 Q3714A HP Color LaserJet 9500 Multifunction Printer C8549A HP Color LaserJet CM6030 Multifunction Printer CE664A HP Color LaserJet CM6040 Multifunction Printer Q3939A HP Color LaserJet CP3505 CB442A HP Color LaserJet CP3525 CC469A HP Color LaserJet CP4005 CB503A HP Color LaserJet CP6015 Q3932A HP Color LaserJet Enterprise CP4025 CC490A

97

Applying physical-layer network coding in wireless networks  

Science Conference Proceedings (OSTI)

A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. ...

Shengli Zhang; Soung Chang Liew

2010-01-01T23:59:59.000Z

98

HydroNode: an underwater sensor node prototype for monitoring hydroelectric reservoirs  

Science Conference Proceedings (OSTI)

The research of underwater sensor networks (UWSNs) is gaining attention due to its possible applications in many scenarios, such as ecosystem preservation, disaster prevention, oil and gas exploration and freshwater reservoirs management. The main elements ... Keywords: hydroelectric, monitoring, reservoirs, underwater sensor networks, underwater sensor node

Luiz F. M. Vieira; Marcos A. M. Vieira; David Pinto; José Augusto M. Nacif; Sadraque S. Viana; Alex B. Vieira

2012-11-01T23:59:59.000Z

99

Bounds on coverage time and node density for multi-modality sensing  

Science Conference Proceedings (OSTI)

In wireless sensor networks, nodes may employ multiple sensing modalities to improve the robustness of covering a region. Multi-modality coverage requires that every point in the region be covered by at least one node for each sensing modality. In this ... Keywords: Coverage, Multi-modality sensing, Network lifetime, Node density

Sandeep Kour Ahuja; Shrinivasa Kini; Srinivasan Ramasubramanian

2009-09-01T23:59:59.000Z

100

U-203: HP Photosmart Bug Lets Remote Users Deny Service | Department of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

03: HP Photosmart Bug Lets Remote Users Deny Service 03: HP Photosmart Bug Lets Remote Users Deny Service U-203: HP Photosmart Bug Lets Remote Users Deny Service July 2, 2012 - 8:00am Addthis PROBLEM: HP Photosmart Bug Lets Remote Users Deny Service PLATFORM: HP Photosmart Wireless e-All-in-One Printer series - B110 HP Photosmart e-All-in-One Printer series - D110 HP Photosmart Plus e-All-in-One Printer series - B210 HP Photosmart eStation All-in-One Printer series - C510 HP Photosmart Ink Advantage e-All-in-One Printer series - K510 HP Photosmart Premium Fax e-All-in-One Printer series - C410 ABSTRACT: A vulnerability was reported in HP Photosmart. A remote user can cause denial of service conditions. Reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027213 CVE-2012-2017 IMPACT ASSESSMENT: High Discussion:

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Reliable networks with unreliable sensors  

Science Conference Proceedings (OSTI)

Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network connectivity. We provide a formal analysis that establishes the relationship between node ...

Srikanth Sastry; Tsvetomira Radeva; Jianer Chen; Jennifer L. Welch

2011-01-01T23:59:59.000Z

102

Power/energy estimator for designing WSN nodes with ambient energy harvesting feature  

Science Conference Proceedings (OSTI)

Wireless Sensor Networks (WSNs) consist of spatially distributed autonomous sensors to cooperatively monitor physical conditions. Thus, the node battery autonomy is critical. To outperform it, most WSNs rely on the harvesting capability. As nodes can ...

Nicolas Ferry; Sylvain Ducloyer; Nathalie Julien; Dominique Jutel

2011-01-01T23:59:59.000Z

103

Secure localization with phantom node detection  

Science Conference Proceedings (OSTI)

In an adversarial environment, various kinds of attacks become possible if malicious nodes could claim fake locations that are different from their physical locations. In this paper, we propose a secure localization mechanism that detects existence of ... Keywords: Decentralized algorithm, Localization, Location verification, Secure localization, Sensor networks, Speculative algorithm

Joengmin Hwang; Tian He; Yongdae Kim

2008-09-01T23:59:59.000Z

104

Network  

NLE Websites -- All DOE Office Websites (Extended Search)

network - launched in November 2012. The network was built in collaboration with Internet2, an advanced network, which connects the nation's research universities. Leveraging...

105

Criticality condition for information floating with random walk of nodes  

Science Conference Proceedings (OSTI)

In an opportunistic content sharing system referred to as floating content, information is copied between mobile nodes upon node encounters inside an area which is called the anchor zone. We study the conditions under which information can be sustained ... Keywords: Opportunistic networking, Random walk, Transport equation

Jorma Virtamo; Esa Hyytiä; Pasi Lassila

2013-02-01T23:59:59.000Z

106

Network coding: an instant primer  

Science Conference Proceedings (OSTI)

Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two ... Keywords: network coding

Christina Fragouli; Jean-Yves Le Boudec; Jörg Widmer

2006-01-01T23:59:59.000Z

107

U-137: HP Performance Manager Unspecified Bug Lets Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: HP Performance Manager Unspecified Bug Lets Remote Users 7: HP Performance Manager Unspecified Bug Lets Remote Users Execute Arbitrary Codes U-137: HP Performance Manager Unspecified Bug Lets Remote Users Execute Arbitrary Codes March 30, 2012 - 9:15am Addthis PROBLEM: HP Performance Manager Unspecified Bug Lets Remote Users Execute Arbitrary Codes PLATFORM: HP-UX B.11.31 HP-UX B.11.23 ABSTRACT: A remote user can execute arbitrary code on the target system. REFERENCE LINKS: HP Support Document ID: c03255321 SecurityTracker Alert ID: 1026869 CVE-2012-0127 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified with HP Performance Manager running on HP-UX, Linux, Solaris, and Windows. The vulnerability could be exploited remotely to execute arbitrary code and to create a Denial of Service (DoS).

108

T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Virtual Server Environment Lets Remote Authenticated 8: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges April 22, 2011 - 7:47am Addthis PROBLEM: A vulnerability was reported in HP Virtual Server Environment. A remote authenticated user can obtain elevated privileges on the target system. PLATFORM: HP Virtual Server Environment prior to v6.3 ABSTRACT: A potential security vulnerability has been identified in HP Virtual Server Environment for Windows. The vulnerability could be exploited remotely to elevate privileges. reference LINKS: HP Document ID: c02749050 SecurityTracker Alert ID: 1025429 CVE-2011-1724 HP Insight Software media set 6.3 HP Technical Knowledge Base Discussion: System management and security procedures must be reviewed frequently to

109

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary 208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code U-208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code July 10, 2012 - 7:00am Addthis PROBLEM: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Operations Agent for AIX, HP-UX, Linux, Solaris, and Windows prior to v11.03.12. ABSTRACT: Two vulnerabilities were reported in HP Operations Agent. A remote user can execute arbitrary code on the target system reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027225 CVE-2012-2019 CVE-2012-2020 IMPACT ASSESSMENT: High Discussion: Potential security vulnerabilities have been identified with HP Operations Agent for AIX, HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in the execution of arbitrary code.

110

Information Capacity of Energy Harvesting Sensor Nodes  

E-Print Network (OSTI)

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting 'green communication'. We study such a sensor node with an energy harvesting source and compare various architectures 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 policy is the same as the throughput optimal policy. We also obtain the capacity for the system with energy inefficiencies in storage and an achievable rate when energy conserving sleep-wake modes are supported.

Rajesh, R

2010-01-01T23:59:59.000Z

111

Flexible Network Attached Storage using Remote DMA  

E-Print Network (OSTI)

We propose to make nodes in a cluster double as compute nodes and network attached storage (NAS) nodes. This allows for a flexible and customizable storage system as the NAS control software is handled by regular workstations. The nodes can still be efficient compute nodes if networks with remote DMA capabilities are used, as such networks remove the processor from the data forwarding loop. We demonstrate this through measurements of a prototype implementation.

Jřrgen S. Hansen

2001-01-01T23:59:59.000Z

112

Secure multidimensional range queries in sensor networks  

Science Conference Proceedings (OSTI)

Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Sensor nodes submit data to nearby master nodes which ... Keywords: multidimensional range query, security, sensor networks,

Rui Zhang; Jing Shi; Yanchao Zhang

2009-05-01T23:59:59.000Z

113

Solar Energy Harvesting for Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

The commercially available sensor nodes are battery-driven devices. A number of nodes together constitute a network. As days proceed, the batteries used in the nodes lose their charge and subsequently get isolated from the network. Many energy harvesting ... Keywords: Energy Harvest, Recharging Circuitry, Batteries, Low Power Design, MICAz sensor nodes

P. T. V. Bhuvaneswari; R. Balakumar; V. Vaidehi; P. Balamuralidhar

2009-07-01T23:59:59.000Z

114

NodeMD: diagnosing node-level faults in remote wireless sensor systems  

Science Conference Proceedings (OSTI)

Software failures in wireless sensor systems are notoriously difficult to debug. Resource constraints in wireless deployments substantially restrict visibility into the root causes of node-level system and application faults. At the same time, the high ... Keywords: deployment, diagnosis, software fault, wireless sensor networks

Veljko Krunic; Eric Trumpler; Richard Han

2007-06-01T23:59:59.000Z

115

Design of reliable SONET feeder networks  

Science Conference Proceedings (OSTI)

We address the physical SONET network design problem of selecting stackable, unidirectional rings connecting central office nodes (COs) and remote nodes (RNs). This problem frequently arises in designing feeder transport networks to support centralized ... Keywords: Communications, Heuristic, Integer Programming

June S. Park; Byung Ha Lim; Larry J. Leblanc

2007-03-01T23:59:59.000Z

116

Mutual Exclusion on Multihop, Mobile Wireless Networks  

Science Conference Proceedings (OSTI)

The system considered in this paper is a mobile wireless network, commonly known as an ad hoc network. Mobile nodes in this dynamic topology function both as processors and routers to provide communication between nodes which are not within wireless ...

Jennifer Walter; Savita Kini

1997-12-01T23:59:59.000Z

117

T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP Diagnostics Input Validation Hole Permits Cross-Site 0: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks March 29, 2011 - 3:05pm Addthis PROBLEM: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks in ActiveSync Lets Remote Users Execute Arbitrary Code. PLATFORM: HP Diagnostics software: version(s) 7.5, 8.0 prior to 8.05.54.225 ABSTRACT: A potential security vulnerability has been identified in HP Diagnostics. The vulnerability could be exploited remotely resulting in cross site scripting (XSS). reference LINKS: HP Document ID: c02770512 SecurityTracker Alert ID: 1025255 CVE-2011-0892 Security Focus Document ID: c02770512 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP Diagnostics. A remote user can conduct

118

U-087: HP-UX update for Java | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: HP-UX update for Java 7: HP-UX update for Java U-087: HP-UX update for Java January 24, 2012 - 7:00am Addthis PROBLEM: HP issued an update for Java in HP-UX to address multiple vulnerabilities. PLATFORM: HP-UX 11.x ABSTRACT: Multiple vulnerabilities can be exploited by malicious users to disclose certain information and by malicious people to disclose potentially sensitive information. reference LINKS: Secunia Advisory 47709 Secunia Advisory 46512 HP Support Document IMPACT ASSESSMENT: High Discussion: The vulnerabilities are reported in versions B.11.11, B.11.23, and B.11.31 running HP JDK and JRE 6.0.12 and prior. Vulnerabilities inlcude the ability to hijack a user's session, conduct DNS cache poisoning attacks, manipulate certain data, cause a DoS (Denial of Service), and compromise a

119

U-044: HP Operations Agent and Performance Agent Lets Local Users Access a  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

44: HP Operations Agent and Performance Agent Lets Local Users 44: HP Operations Agent and Performance Agent Lets Local Users Access a Restricted Directory U-044: HP Operations Agent and Performance Agent Lets Local Users Access a Restricted Directory November 23, 2011 - 8:00am Addthis PROBLEM: HP Operations Agent and Performance Agent Lets Local Users Access a Restricted Directory. PLATFORM: HP Operations Agent v11.00 and Performance Agent v4.73, v5.0 for AIX, HP-UX, Linux, and Solaris ABSTRACT: A local user can access a directory on the target system. reference LINKS: HP Security Bulletin Document ID: c03091656 CVE-2011-4160 SecurityTracker Alert ID: 1026345 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP Operations Agent and Performance Agent. A local user can access data on the target system. A local user can gain

120

V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP Performance Insight Bugs with Sybase Database Let Remote 6: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System November 5, 2012 - 6:00am Addthis PROBLEM: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System PLATFORM: HP Performance Insight v5.31, v5.40 and v5.41 running on HP-UX, Solaris, Linux, and Windows and using Sybase as the database ABSTRACT: Two vulnerabilities were reported in HP Performance Insight. REFERENCE LINKS: HP Support Document ID: c03555488 SecurityTracker Alert ID: 1027719 CVE-2012-3269 CVE-2012-3270 IMPACT ASSESSMENT: High DISCUSSION:

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

T-643: HP OpenView Storage Data Protector Unspecified Code Execution  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

643: HP OpenView Storage Data Protector Unspecified Code 643: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability T-643: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability June 9, 2011 - 3:45pm Addthis PROBLEM: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability PLATFORM: Versions 6.0, 6.10, and 6.11 running on HP-UX, Solaris, Linux and Windows. ABSTRACT: A vulnerability has been reported in HP OpenView Storage Data Protector, which can be exploited by malicious people to compromise a vulnerable system. reference LINKS: Secunia Advisory SA44884 CVE-2011-1864 SecurityTracker Alert ID: 1025620 HP Document ID: c02712867 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP OpenView Storage Data Protector. A remote user can execute arbitrary code on the target system.

122

U-048: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update  

NLE Websites -- All DOE Office Websites (Extended Search)

8: HP LaserJet Printers Unspecified Flaw Lets Remote Users 8: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update Firmware with Arbitrary Code U-048: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update Firmware with Arbitrary Code November 30, 2011 - 8:15am Addthis PROBLEM: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update Firmware with Arbitrary Code . PLATFORM: HP LaserJet Printers manufactured prior to 2009 ABSTRACT A remote user can upgrade the printer's firmware with arbitrary code. reference LINKS: SecurityTracker Alert ID:1026357 HP Security for Imaging and Printing HP Clarifies on Printer Security IMPACT ASSESSMENT: Low Discussion: A vulnerability was reported in some HP LaserJet Printers. A remote user can update the firmware with arbitrary code. A remote user can send a specially crafted print job or specially crafted data to the

123

U-158: HP NonStop Server Java Multiple Vulnerabilities | Department of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP NonStop Server Java Multiple Vulnerabilities 8: HP NonStop Server Java Multiple Vulnerabilities U-158: HP NonStop Server Java Multiple Vulnerabilities April 30, 2012 - 7:00am Addthis PROBLEM: HP NonStop Server Java Multiple Vulnerabilities PLATFORM: HP NonStop Server 6.x ABSTRACT: Multiple vulnerabilities have been reported in HP NonStop Server Reference links: Secunia Advisory SA48977 CVE-2011-3547 CVE-2011-3551 CVE-2011-3553 IMPACT ASSESSMENT: High Discussion: HP has acknowledged multiple vulnerabilities in HP NonStop Server, which can be exploited by malicious users to disclose sensitive information and by malicious people to disclose sensitive information, manipulate certain data, cause a DoS (Denial of Service), and compromise a vulnerable system. Impact: Successful exploitation of this vulnerability may allow remote manipulation

124

U-238: HP Service Manager Input Validation Flaw Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Service Manager Input Validation Flaw Permits Cross-Site 8: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks August 17, 2012 - 7:00am Addthis PROBLEM: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 7.11, 9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers to inject arbitrary web script or HTML via unspecified vectors. REFERENCE LINKS: www2.hp.com http://www.securitytracker.com/id/1027399 CVE-2012-3251 IMPACT ASSESSMENT: Moderate Discussion: A vulnerability was reported in HP Service Manager. A remote user can conduct cross-site scripting attacks. The software does not properly filter

125

U-095: HP Data Protector Media Operations Lets Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP Data Protector Media Operations Lets Remote Users Execute 5: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code U-095: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code February 3, 2012 - 1:33am Addthis PROBLEM: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code PLATFORM: Windows (2003, XP, 2008), HP Data Protector Media Operations version 6.11 and earlier ABSTRACT: Remote execution of arbitrary code reference LINKS: SecurityTracker Alert ID: 1026626 HP Support Center Document ID: c03179046 CVE-2011-4791 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP Data Protector Media Operations. A remote user can execute arbitrary code on the target system. Information on CVSS is documented in HP Customer Notice: HPSN-2008-002. Impact:

126

T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP Diagnostics Input Validation Hole Permits Cross-Site 0: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks March 29, 2011 - 3:05pm Addthis PROBLEM: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks in ActiveSync Lets Remote Users Execute Arbitrary Code. PLATFORM: HP Diagnostics software: version(s) 7.5, 8.0 prior to 8.05.54.225 ABSTRACT: A potential security vulnerability has been identified in HP Diagnostics. The vulnerability could be exploited remotely resulting in cross site scripting (XSS). reference LINKS: HP Document ID: c02770512 SecurityTracker Alert ID: 1025255 CVE-2011-0892 Security Focus Document ID: c02770512 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP Diagnostics. A remote user can conduct

127

U-017: HP MFP Digital Sending Software Lets Local Users Obtain Potentially  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: HP MFP Digital Sending Software Lets Local Users Obtain 7: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information U-017: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information October 24, 2011 - 12:30pm Addthis PROBLEM: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information . PLATFORM: HP MFP Digital Sending Software v4.91.21 and all previous 4.9x versions ABSTRACT: A vulnerability was reported in HP MFP Digital Sending Software. A local user can obtain potentially sensitive information. reference LINKS: HP Advisory ID: c03052686 SecurityTracker Alert ID: 1026228 CVE-2011-3163 IMPACT ASSESSMENT: Medium Discussion: A potential security vulnerability has been identified with HP MFP Digital Sending Software running on Windows. The vulnerability could result in

128

T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

T-538: HP OpenView Storage Data Protector Bug Lets Remote Users T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code January 20, 2011 - 6:39am Addthis PROBLEM: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code. PLATFORM: HP OpenView Storage Data Protector v6.11 ABSTRACT: A vulnerability was reported in HP OpenView Storage Data Protector. A remote user can execute arbitrary code on the target system. reference LINKS: HP Security Bulletin SecurityTracker Alert ID: 1024983 CVE-2011-0273 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified with HP OpenView Storage Data Protector. The vulnerability could be remotely exploited to execute arbitrary code.

129

U-238: HP Service Manager Input Validation Flaw Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

38: HP Service Manager Input Validation Flaw Permits Cross-Site 38: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks August 17, 2012 - 7:00am Addthis PROBLEM: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 7.11, 9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers to inject arbitrary web script or HTML via unspecified vectors. REFERENCE LINKS: www2.hp.com http://www.securitytracker.com/id/1027399 CVE-2012-3251 IMPACT ASSESSMENT: Moderate Discussion: A vulnerability was reported in HP Service Manager. A remote user can conduct cross-site scripting attacks. The software does not properly filter

130

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

Energy.gov (U.S. Department of Energy (DOE))

Hewlett-Packard  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.  HP...

131

Delay of intrusion detection in wireless sensor networks  

Science Conference Proceedings (OSTI)

In this paper we consider sensor networks for intrusion detection, such that node deployment, node failures and node behavior result in coverage gaps and a fraction of disconnected nodes in an otherwise dense and well-connected network. We focus on the ... Keywords: delay, intrusion detection, percolation, sensor networks

Olivier Dousse; Christina Tavoularis; Patrick Thiran

2006-05-01T23:59:59.000Z

132

Mao of HP-CAT Awarded Aminoff Prize in Crystallography  

NLE Websites -- All DOE Office Websites (Extended Search)

Mao of HP-CAT Awarded Aminoff Prize in Crystallography Mao of HP-CAT Awarded Aminoff Prize in Crystallography The Royal Swedish Academy of Sciences has awarded David H. Mao of the Geophysical Laboratory the Gregori Aminoff Prize in Crystallography 2005 "for pioneering research of materials at ultrahigh pressures and temperatures." Dr. Mao is the Director of the High Pressure Collaborative Access Team, which manages the beamlines at Advanced Photon Source (APS) sector 16. Named after Gregori Aminoff, the pioneering Swedish crystallographer, the prize is given annually to recognized scientists, or to a group of no more than three persons of international distinction, who have made a major contribution to crystallography. David H. Mao showing a panoramic high-pressure diamond-anvil cell to Murray Gibson

133

High-pressure synthesis and crystal structure of the lithium borate HP-LiB{sub 3}O{sub 5}  

Science Conference Proceedings (OSTI)

The new lithium borate HP-LiB{sub 3}O{sub 5} was synthesized under high-pressure/high-temperature conditions of 6 GPa and 1050 deg. C in a multianvil press with a Walker-type module. The compound crystallizes in the space group Pnma (no. 62) with the lattice parameters a=829.7(2), b=759.6(2), and c=1726.8(4) pm (Z=16). The high-pressure compound HP-LiB{sub 3}O{sub 5} is built up from a three-dimensional network of BO{sub 4} tetrahedra and BO{sub 3} groups, which incorporates Li{sup +} ions in channels along the b-axis. Band assignments of measured IR- and Raman spectra were done via quantum-mechanical calculations. Additionally, the thermal behavior of HP-LiB{sub 3}O{sub 5} was investigated. - Graphical abstract: The new high-pressure compound HP-LiB{sub 3}O{sub 5} is built up from a three-dimensional network of BO4 tetrahedra and BO{sub 3} groups, which incorporates Li{sup +} ions in channels along the b-axis. In this paper, the synthesis, the crystal structure, and the properties of HP-LiB{sub 3}O{sub 5} are described. Highlights: > Synthesis of a new lithium borate with the composition HP-LiB{sub 3}O{sub 5} at high pressure. > In contrast to the non-centrosymmetric phase LiB{sub 3}O{sub 5}, this high-pressure phase is centrosymmetric. > First example of ternary alkali borates exhibiting threefold bridging oxygen atoms.

Neumair, Stephanie C.; Vanicek, Stefan [Institut fuer Allgemeine, Anorganische und Theoretische Chemie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52a, A-6020 Innsbruck (Austria); Kaindl, Reinhard; Toebbens, Daniel M. [Institut fuer Mineralogie und Petrographie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52, A-6020 Innsbruck (Austria); Wurst, Klaus [Institut fuer Allgemeine, Anorganische und Theoretische Chemie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52a, A-6020 Innsbruck (Austria); Huppertz, Hubert, E-mail: Hubert.Huppertz@uibk.ac.at [Institut fuer Allgemeine, Anorganische und Theoretische Chemie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52a, A-6020 Innsbruck (Austria)

2011-09-15T23:59:59.000Z

134

The n-hop multilateration primitive for node localization problems  

Science Conference Proceedings (OSTI)

The recent advances in MEMS, embedded systems and wireless communication technologies are making the realization and deployment of networked wireless microsensors a tangible task. In this paper we study node localization, a component technology that ... Keywords: ad-hoc localization, distributed localization, sensor networks

Andreas Savvides; Heemin Park; Mani B. Srivastava

2003-08-01T23:59:59.000Z

135

Power Management in Disruption Tolerant Networks .  

E-Print Network (OSTI)

??Disruption Tolerant Networks (DTNs) are mobile wireless networks that are designed to work in highly-challenged environments where the density of nodes is insufficient to support… (more)

Jun, Hyewon

2007-01-01T23:59:59.000Z

136

China: A Rising Scientific (Super-)Power & a Node Embedded in the Global Scientific  

E-Print Network (OSTI)

China: A Rising Scientific (Super-)Power & a Node Embedded in the Global Scientific Network Cong Cao, Ph.D. University of Nottingham Cong.cao@nottingham.ac.uk #12;· China as a Rising Scientific) #12;The Global Scientific Network (25 nations, 2004) #12;· China as a Node Embedded in the Global

Rambaut, Andrew

137

Sensor network configuration under physical attacks  

Science Conference Proceedings (OSTI)

Sensor networks will typically operate in hostile environments, where they are susceptible to physical attacks resulting in physical node destructions. In this paper, we study impacts of physical attacks on network configuration w.r.t. lifetime. While ... Keywords: deployment, network configuration, network lifetime, physical attacks, physical node destruction, sensor networks

Xun Wang; Wenjun Gu; Kurt Schosek; Sriram Chellappan; Dong Xuan

2009-04-01T23:59:59.000Z

138

Sinoatrial Node of the Heart  

NLE Websites -- All DOE Office Websites (Extended Search)

Sinoatrial Node of the Heart Name: Lance Status: student Age: 12 Location: NA Country: NA Date: NA Question: What is sinoatrial node and how does it affect the heart? Replies:...

139

SA Node of the Heart  

NLE Websites -- All DOE Office Websites (Extended Search)

SA Node of the Heart Name: Amy Location: NA Country: NA Date: NA Question: How does the SA node of the heart produce charges and how do the charges develop? Also what ions are...

140

U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

42: HP Onboard Administrator Bugs Let Remote Users Gain Access, 42: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks April 6, 2012 - 7:00am Addthis PROBLEM: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks PLATFORM: HP Onboard Administrator (OA) up to and including v3.32 ABSTRACT: A remote user can obtain potentially sensitive information. reference LINKS: HP Support Document ID: c03263573 SecurityTracker Alert ID: 1026889 CVE-2012-0128, CVE-2012-0129, CVE-2012-0130 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Onboard Administrator. A remote

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: HP Onboard Administrator Bugs Let Remote Users Gain Access, 2: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks April 6, 2012 - 7:00am Addthis PROBLEM: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks PLATFORM: HP Onboard Administrator (OA) up to and including v3.32 ABSTRACT: A remote user can obtain potentially sensitive information. reference LINKS: HP Support Document ID: c03263573 SecurityTracker Alert ID: 1026889 CVE-2012-0128, CVE-2012-0129, CVE-2012-0130 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Onboard Administrator. A remote

142

U-071:HP Database Archiving Software Bugs Let Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1:HP Database Archiving Software Bugs Let Remote Users Execute 1:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code U-071:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code December 29, 2011 - 8:15am Addthis PROBLEM: HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Database Archiving Software v6.31 ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Database Document ID: c03128302 SecurityTracker Alert ID: 1026467 CVE-2011-4163 CVE-2011-4164 CVE-2011-4165 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Database Archiving Software. A remote user can execute arbitrary code on the target system. Impact: A remote user can execute arbitrary code on the target system. Solution:

143

U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP StorageWorks File Migration Agent Buffer Overflows Let 6: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code July 19, 2012 - 7:14am Addthis PROBLEM: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code PLATFORM: HP StorageWorks File Migration Agent ABSTRACT: Two vulnerabilities were reported in HP StorageWorks File Migration Agent. reference LINKS: SecurityTracker Alert ID: 1027281 ZDI-12-127 ZDI-12-126 IMPACT ASSESSMENT: High Discussion: The vulnerability allows remote attackers to execute arbitrary code on vulnerable installations of HP StorageWorks File Migration Agent. Authentication is not required to exploit this vulnerability. 1. (ZDI-12-127) The specific flaw exists within the HsmCfgSvc.exe service

144

U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-216: HP StorageWorks File Migration Agent Buffer Overflows Let U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code July 19, 2012 - 7:14am Addthis PROBLEM: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code PLATFORM: HP StorageWorks File Migration Agent ABSTRACT: Two vulnerabilities were reported in HP StorageWorks File Migration Agent. reference LINKS: SecurityTracker Alert ID: 1027281 ZDI-12-127 ZDI-12-126 IMPACT ASSESSMENT: High Discussion: The vulnerability allows remote attackers to execute arbitrary code on vulnerable installations of HP StorageWorks File Migration Agent. Authentication is not required to exploit this vulnerability.

145

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

NLE Websites -- All DOE Office Websites (Extended Search)

HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and 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 Hewlett-Packard 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. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY STAR, are the most effective mechanism for improving energy efficiency of IT products, but we understand the approach of regulating mandatory minimum efficiencies to address poor performing products. HP_Ex_Parte_Memo.pdf More Documents & Publications HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External

146

U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP-UX System Administration Manager Lets Local Users Gain 0: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges November 17, 2011 - 8:00am Addthis PROBLEM: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31; running Enterprise Mobility Suite (EMS) prior to A.04.20.11.04_01 ABSTRACT: A local user can obtain elevated privileges on the target system. reference LINKS: HP Support Center Document ID: c03089106 CVE-2011-4159 SecurityTracker Alert ID: 1026331 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP-UX System Administration Manager. A local user can obtain elevated privileges on the target system. A local user can gain full control of the target system.

147

U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

40: HP-UX System Administration Manager Lets Local Users Gain 40: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges November 17, 2011 - 8:00am Addthis PROBLEM: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31; running Enterprise Mobility Suite (EMS) prior to A.04.20.11.04_01 ABSTRACT: A local user can obtain elevated privileges on the target system. reference LINKS: HP Support Center Document ID: c03089106 CVE-2011-4159 SecurityTracker Alert ID: 1026331 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP-UX System Administration Manager. A local user can obtain elevated privileges on the target system. A local user can gain full control of the target system.

148

U-071:HP Database Archiving Software Bugs Let Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1:HP Database Archiving Software Bugs Let Remote Users Execute 1:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code U-071:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code December 29, 2011 - 8:15am Addthis PROBLEM: HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Database Archiving Software v6.31 ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Database Document ID: c03128302 SecurityTracker Alert ID: 1026467 CVE-2011-4163 CVE-2011-4164 CVE-2011-4165 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Database Archiving Software. A remote user can execute arbitrary code on the target system. Impact: A remote user can execute arbitrary code on the target system. Solution:

149

Securing network access in wireless sensor networks  

Science Conference Proceedings (OSTI)

In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In this paper, we present the design, implementation, and evaluation of a secure ... Keywords: elliptic curve cryptography, security, sensor networks

Kun Sun; An Liu; Roger Xu; Peng Ning; Douglas Maughan

2009-03-01T23:59:59.000Z

150

Vehicle Detection by Sensor Network Nodes  

E-Print Network (OSTI)

frequency. Table 4.2: ? and ? Ground truth (# of vehicles)truth (# of vehicles) Detection result (# of vehicles) Tabletruth ( of vehicles) Detection result ( of vehicles) Table

Ding, Jiagen; Cheung, Sing-Yiu; Tan, Chin-woo; Varaiya, Pravin

2004-01-01T23:59:59.000Z

151

Architecture Exploration Based on Tasks Partitioning Between Hardware, Software and Locality for a Wireless Vision Sensor Node  

Science Conference Proceedings (OSTI)

Wireless Vision Sensor Networks WVSNs is an emerging field which consists of a number of Visual Sensor Nodes VSNs. Compared to traditional sensor networks, WVSNs operates on two dimensional data, which requires high bandwidth and high energy consumption. ... Keywords: Hardware/Software Partitioning, Image Processing, Reconfigurable Architecture, Vision Sensor Node, Wireless Vision Sensor Networks

Muhammad Imran; Khursheed Khursheed; Abdul Waheed Malik; Naeem Ahmad; Mattias O'Nils; Najeem Lawal; Benny Thörnberg

2012-04-01T23:59:59.000Z

152

Deploying a Wireless Sensor Network on an Active Volcano  

Science Conference Proceedings (OSTI)

Augmenting heavy and power-hungry data collection equipment with lighter, smaller wireless sensor network nodes leads to faster, larger deployments. Arrays comprising dozens of wireless sensor nodes are now possible, allowing scientific studies that ... Keywords: wireless sensor networks, sensor network applications, sensor network nodes, volcano research

Geoffrey Werner-Allen; Konrad Lorincz; Matt Welsh; Omar Marcillo; Jeff Johnson; Mario Ruiz; Jonathan Lees

2006-03-01T23:59:59.000Z

153

V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data August 3, 2013 - 2:37am Addthis PROBLEM: A vulnerability was reported in HP Printers. A remote user can obtain potentially sensitive information. PLATFORM: HP LaserJet Pro products ABSTRACT: A potential security vulnerability has been identified with certain HP LaserJet Pro printers. The vulnerability could be exploited remotely to gain unauthorized access to data. REFERENCE LINKS: SecurityTracker Alert ID 1028869 CVE-2013-4807 Vendor URL IMPACT ASSESSMENT: Medium DISCUSSION: The following models are affected: HP LaserJet Pro P1102w CE657A/CE658A HP LaserJet Pro P1606dn CE749A HP LaserJet Pro M1212nf MFP CE841A HP LaserJet Pro M1213nf MFP CE845A

154

U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

35: HP WBEM Discloses Diagnostic Data to Remote and Local Users 35: HP WBEM Discloses Diagnostic Data to Remote and Local Users U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users March 28, 2012 - 7:00am Addthis PROBLEM: HP WBEM Discloses Diagnostic Data to Remote and Local Users PLATFORM: HP-UX 11.11, 11.23, and 11.31 ABSTRACT: Two vulnerabilities were reported in HP WBEM. A remote or local user can gain access to diagnostic data. REFERENCE LINKS: SecurityTracker Alert ID: 1026849 CVE-2012-0125 CVE-2012-0126 iIMPACT ASSESSMENT Medium Discussion: A potential security vulnerability has been identified with certain HP-UX WBEM components. The vulnerability could be exploited remotely in HP-UX 11.11 and HP-UX 11.23 to gain unauthorized access to diagnostic data. The vulnerability could be exploited locally in HP-UX 11.31 to gain

155

U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP WBEM Discloses Diagnostic Data to Remote and Local Users 5: HP WBEM Discloses Diagnostic Data to Remote and Local Users U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users March 28, 2012 - 7:00am Addthis PROBLEM: HP WBEM Discloses Diagnostic Data to Remote and Local Users PLATFORM: HP-UX 11.11, 11.23, and 11.31 ABSTRACT: Two vulnerabilities were reported in HP WBEM. A remote or local user can gain access to diagnostic data. REFERENCE LINKS: SecurityTracker Alert ID: 1026849 CVE-2012-0125 CVE-2012-0126 iIMPACT ASSESSMENT Medium Discussion: A potential security vulnerability has been identified with certain HP-UX WBEM components. The vulnerability could be exploited remotely in HP-UX 11.11 and HP-UX 11.23 to gain unauthorized access to diagnostic data. The vulnerability could be exploited locally in HP-UX 11.31 to gain

156

Spatial Networks  

E-Print Network (OSTI)

Complex systems are very often organized under the form of networks where nodes and edges are embedded in space. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks, neural networks, are all examples where space is relevant and where topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields ranging from urbanism to epidemiology. An important consequence of space on networks is that there is a cost associated to the length of edges which in turn has dramatic effects on the topological structure of these networks. We will expose thoroughly the current state of our understanding of how the spatial constraints affect the structure and properties of these networks. We will review the most recent empirical observations and the most important models of spatial networks. We will also discuss various processes which take place on these spa...

Barthelemy, Marc

2010-01-01T23:59:59.000Z

157

V-010: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

10: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote 10: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take Administrative Actions V-010: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take Administrative Actions October 25, 2012 - 6:00am Addthis PROBLEM: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take Administrative Actions PLATFORM: 3COM, and H3C Routers & Switches Specific products and model numbers is provided in the vendor's advisory. ABSTRACT: A vulnerability was reported in 3Com, HP, and H3C Switches. REFERENCE LINKS: HP Support document ID: c03515685 SecurityTracker Alert ID: 1027694 CVE-2012-3268 IMPACT ASSESSMENT: High DISCUSSION: A remote user with knowledge of the SNMP public community string can access potentially sensitive data (e.g., user names, passwords) in the

158

U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP IBRIX X9000 Storage Discloses Information to Remote Users 5: HP IBRIX X9000 Storage Discloses Information to Remote Users U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users October 5, 2012 - 6:00am Addthis PROBLEM: HP IBRIX X9000 Storage Discloses Information to Remote Users PLATFORM: Version(s): IBRIX X9000; 6.1.196, 6.1.210, 6.1.228, 6.1.243, 6.1.247, 6.1.249, 6.1.251 ABSTRACT: A potential security vulnerability has been identified with HP IBRIX X9000 Storage. The vulnerability could be remotely exploited to allow disclosure of information. reference LINKS: HP Security Bulletin: c03510876 SecurityTracker Alert ID: 1027590 CVE-2012-3266 IMPACT ASSESSMENT: Medium Discussion: A remote user can create a specially crafted JLS-compressed image file that, when loaded by the target user, will trigger a heap overflow in the

159

V-166: HP-UX Directory Server Discloses Passwords to Remote Authenticated  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP-UX Directory Server Discloses Passwords to Remote 6: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users V-166: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users May 29, 2013 - 12:32am Addthis PROBLEM: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users PLATFORM: Directory Server B.08.10.04 ABSTRACT: Two vulnerabilities were reported in HP-UX Directory Server. REFERENCE LINKS: HP Document ID: c03772083 SecurityTracker Alert ID: 1028593 CVE-2012-2678 CVE-2012-2746 IMPACT ASSESSMENT: High DISCUSSION: A local user can access the plaintext password in certain cases [CVE-2012-2678]. A remote authenticated user can can view the password for a target LDAP user when audit logging is enabled by reading the audit log [CVE-2012-2678].

160

T-588: HP Virtual SAN Appliance Stack Overflow | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

T-588: HP Virtual SAN Appliance Stack Overflow T-588: HP Virtual SAN Appliance Stack Overflow T-588: HP Virtual SAN Appliance Stack Overflow March 25, 2011 - 5:05pm Addthis PROBLEM: HP Virtual SAN Appliance Stack Overflow in 'hydra.exe' Lets Remote Users Execute Arbitrary Code. PLATFORM: HP StorageWorks P4000 Virtual SAN Appliance Software ABSTRACT: A vulnerability has been reported in HP StorageWorks P4000 Virtual SAN Appliance Software, which can be exploited by malicious people to compromise a vulnerable system. reference LINKS: Secunia advisory 34782 SecurityTracker Alert ID: 1025249 ZDI-11-111 Bugtraq ID: 47005 IMPACT ASSESSMENT: High Discussion: Hewlett-Packard Virtual SAN Appliance is prone to a remote buffer-overflow vulnerability. Attackers may exploit this issue to execute arbitrary code within the context of the affected application. Failed exploit attempts may result in

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP Service Manager Bugs Permit Cross-Site Scripting and 6: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks V-146: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks May 1, 2013 - 12:43am Addthis PROBLEM: HP Service Manager Bugs Permit 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: HP Document ID: c03748875 SecurityTracker Alert ID: 1028496 CVE-2012-5222 CVE-2013-2321 IMPACT ASSESSMENT: Medium DISCUSSION: A remote user can obtain potentially sensitive information [CVE-2012-5222]. Service Manager Web Tier does not properly filter HTML code from user-supplied input before displaying the input [CVE-2013-2321]. A remote

162

V-203: HP LoadRunner Multiple Bugs Let Remote Users Deny Service and  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP LoadRunner Multiple Bugs Let Remote Users Deny Service 3: HP LoadRunner Multiple Bugs Let Remote Users Deny Service and Execute Arbitrary Code V-203: HP LoadRunner Multiple Bugs Let Remote Users Deny Service and Execute Arbitrary Code July 26, 2013 - 3:31am Addthis PROBLEM: A remote user can execute arbitrary code on the target system. A remote user can cause denial of service conditions. PLATFORM: HP LoadRunner prior to 11.52 ABSTRACT: Multiple vulnerabilities were reported in HP LoadRunner. REFERENCE LINKS: Security Tracker Alert ID: 1028833 CVE-2013-2368 CVE-2013-2369 CVE-2013-2370 CVE-2013-4797 CVE-2013-4798 CVE-2013-4799 CVE-2013-4800 CVE-2013-4801 IMPACT ASSESSMENT: Medium DISCUSSION: Potential security vulnerabilities have been identified with HP LoadRunner. The vulnerabilities could be remotely exploited to allow execution of code

163

U-117: Potential security vulnerability has been identified with certain HP  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: Potential security vulnerability has been identified with 7: Potential security vulnerability has been identified with certain HP printers and HP digital senders U-117: Potential security vulnerability has been identified with certain HP printers and HP digital senders March 5, 2012 - 7:00am Addthis PROBLEM: The vulnerability could be exploited remotely to install unauthorized printer firmware. PLATFORM: Select HP printers and Digital Senders ABSTRACT: Remote attackers could execute arbitrary code by using a session on TCP port 9100 to upload a crafted firmware update. reference LINKS: Vendor Advisory CVE-2011-4161 Previous JC3 Advisory Bulletin IMPACT ASSESSMENT: High Discussion: The default configuration of the HP CM8060 Color MFP with Edgeline; Color LaserJet 3xxx, 4xxx, 5550, 9500, CMxxxx, CPxxxx, and Enterprise CPxxxx;

164

U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP IBRIX X9000 Storage Discloses Information to Remote Users 5: HP IBRIX X9000 Storage Discloses Information to Remote Users U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users October 5, 2012 - 6:00am Addthis PROBLEM: HP IBRIX X9000 Storage Discloses Information to Remote Users PLATFORM: Version(s): IBRIX X9000; 6.1.196, 6.1.210, 6.1.228, 6.1.243, 6.1.247, 6.1.249, 6.1.251 ABSTRACT: A potential security vulnerability has been identified with HP IBRIX X9000 Storage. The vulnerability could be remotely exploited to allow disclosure of information. reference LINKS: HP Security Bulletin: c03510876 SecurityTracker Alert ID: 1027590 CVE-2012-3266 IMPACT ASSESSMENT: Medium Discussion: A remote user can create a specially crafted JLS-compressed image file that, when loaded by the target user, will trigger a heap overflow in the

165

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0:HP Onboard Administrator Unspecified Flaw Lets Remote Users 0:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access October 13, 2011 - 8:15am Addthis PROBLEM: HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access PLATFORM: Onboard Administrator (OA) 3.21 through 3.31 ABSTRACT: A remote user can gain access to the target system reference LINKS: HP Support document ID: c03048779 SecurityTracker Alert ID: 1026158 CVE-2011-3155 IMPACT ASSESSMENT: Medium Discussion: A potential security vulnerability has been identified with HP Onboard Administrator (OA). The vulnerability could be exploited remotely to gain unauthorized access. Impact: A remote user can gain access to the target system. Solution: Onboard Administrator (OA) v3.32 is available.

166

SENDROM: sensor networks for disaster relief operations management  

Science Conference Proceedings (OSTI)

SENDROM is a new sensor network architecture to manage the rescue operations after large scale disasters. This architecture mainly consists of sensor nodes deployed prior to a disaster and central nodes that can query sensor nodes. Central nodes are ... Keywords: data dissemination, disaster relief operations, sesnor networks, task dissemination

Erdal Cayirci; Tolga Coplu

2007-06-01T23:59:59.000Z

167

Two from HP-CAT win Balzan Prize  

NLE Websites -- All DOE Office Websites (Extended Search)

HPCAT HPCAT Two from HP-CAT win Balzan Prize Russell J. Hemley and Ho-kwang (David) Mao (both Carnegie Institution of Washington/Carnegie/DOE Alliance Center and the High-Pressure Collaborative Access Team, APS sector 16) are recipients of the 2005 International Balzan Foundation Prize for Mineral Physics. The foundation, which is based in Milan, Italy, made the award "For the impressive impact of their joint work leading to fundamental breakthroughs, theoretical and experimental, in the field of minerals submitted to extreme physical conditions. They have operated as a highly effective team, characterized by twenty years of research contributions at the highest level. They have developed techniques which allow them to study the behaviour of a wide range of materials, such as hydrogen, the most abundant "mineral" in

168

Failure Analysis of Two 80 HP Multiport Boilers - Programmaster.org  

Science Conference Proceedings (OSTI)

Presentation Title, Failure Analysis of Two 80 HP Multiport Boilers ... microstructure and the scale collected suggested overheating of the boiler during service.

169

A virtual ad hoc network testbed  

Science Conference Proceedings (OSTI)

Testing of applications for ad hoc networks poses a special technical challenge due to the difficulty of conducting experiments in an ad hoc network environment at a scale larger than a few nodes. One approach is to conduct experiments in a testbed that ... Keywords: MANETs, SITL, VAN, emulation, hybrid testbed, mobile ad hoc networks, mobile networks, network management, shadow nodes, simulation, software-in-, the-loop, virtual ad hoc networks, virtual machines, virtual networks, virtualisation

Alex Poylisher; Constantin Serban; John Lee; Tai-Chuan Lu; Ritu Chadha; Cho-Yu Jason Chiang; Robert Orlando; Kimberly Jakubowski

2010-07-01T23:59:59.000Z

170

Distributed energy-efficient hierarchical clustering for wireless sensor networks  

Science Conference Proceedings (OSTI)

Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed weight-based energy-efficient hierarchical clustering protocol (DWEHC). Each node ...

Ping Ding; JoAnne Holliday; Aslihan Celik

2005-06-01T23:59:59.000Z

171

Thorough Analysis of IEEE 802.11 EDCA in Ring Topology Scenarios with Hidden and Exposed Nodes  

Science Conference Proceedings (OSTI)

In this paper the authors present a simulation study of five different ring networks with hidden and exposed nodes in which the IEEE 802.11 EDCA function is used as the MAC protocol. The presented analysis is crucial for understanding how the theoretically ... Keywords: Ad-hoc, QoS provisioning, exposed nodes, hidden nodes

Katarzyna Kosek; Marek Natkaniec; Luca Vollero

2009-07-01T23:59:59.000Z

172

Clustering strategies for improving the lifetime of two-tiered sensor networks  

Science Conference Proceedings (OSTI)

In hierarchical sensor networks, sensor nodes are arranged in clusters, and higher-powered relay nodes can be used as cluster heads. Due to the limited transmission range and battery power of the nodes, it is important to develop techniques that minimize ... Keywords: Clustering, Energy-efficient, Relay nodes, Sensor networks, Two-tiered sensor networks

Ataul Bari; Arunita Jaekel; Subir Bandyopadhyay

2008-09-01T23:59:59.000Z

173

Optimum Transmission Policies for Battery Limited Energy Harvesting Nodes  

E-Print Network (OSTI)

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...

Tutuncuoglu, Kaya

2010-01-01T23:59:59.000Z

174

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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...

175

Network load-aware content distribution in overlay networks  

Science Conference Proceedings (OSTI)

Massive content distribution on overlay networks stresses both the server and the network resources because of the large volumes of data, relatively high bandwidth requirement, and many concurrent clients. While the server limitation can be circumvented ... Keywords: Content distribution networks, Hypercube, Node selection, Overlay networks, Peer-to-peer networks, Server selection

Seung Chul Han; Ye Xia

2009-01-01T23:59:59.000Z

176

On the structure of elimination trees for Bayesian network inference  

Science Conference Proceedings (OSTI)

We present an optimization to elimination tree inference in Bayesian networks through the use of unlabeled nodes, or nodes that are not labeled with a variable from the Bayesian network. Through the use of these unlabeled nodes, we are able to restructure ... Keywords: Bayesian networks, inference, offline computation

Kevin Grant; Keilan Scholten

2010-11-01T23:59:59.000Z

177

Neighbor Selection Game in Wireless Ad Hoc Networks  

Science Conference Proceedings (OSTI)

In wireless ad hoc networks, there is no infrastructure to enforce cooperation between nodes. As a result, nodes may act selfishly when running network protocols to conserve their energy resources as much as possible. In this paper, we consider the "neighbor ... Keywords: Energy efficiency, Game theory, Neighbor selection, Selfish nodes, Wireless ad hoc networks

Sajjad Zarifzadeh; Nasser Yazdani

2013-05-01T23:59:59.000Z

178

Computer Networking Group | Stanford Synchrotron Radiation Lightsource  

NLE Websites -- All DOE Office Websites (Extended Search)

Networking Group Networking Group Do you need help? For assistance please submit a CNG Help Request ticket. CNG Logo Chris Ramirez SSRL Computer and Networking Group Manager (650) 926-2901 | email Jerry Camuso SSRL Computer and Networking (650) 926-2994 | email Networking Support The Networking group provides connectivity and communications services for SSRL. The services provided by the Networking Support Group include: Local Area Network support for cable and wireless connectivity. Installation and maintenance of network printers and queues. Telephony installations and support. Printing Support The Networking group provides printer maintenance and support for SSRL Beamline Printers and plotters. The following models are supported: HP - Designjet large format plotters HP - Color and B/W Laserjet, Inkjet, Deskjet, Officejet

179

U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute Arbitrary  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute Arbitrary Code U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute Arbitrary Code April 4, 2012 - 7:15am Addthis PROBLEM: A vulnerability was reported in HP-UX PLATFORM: Version(s): 11.11, 11.23; running DCE ABSTRACT: A remote user can execute arbitrary code on the target system. A remote user can send specially crafted data to execute arbitrary code on the target system. The code will run with the privileges of the target service. Reference LINKS: Vendor Advisory Security Tracker ID 1026885 CVE-2012-0131 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified in HP-UX running DCE. The vulnerability could be exploited remotely to create a Denial of Service (DoS).

180

U-201: HP System Management Homepage Bugs Let Remote Users Deny Service |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1: HP System Management Homepage Bugs Let Remote Users Deny 1: HP System Management Homepage Bugs Let Remote Users Deny Service U-201: HP System Management Homepage Bugs Let Remote Users Deny Service June 28, 2012 - 7:00am Addthis PROBLEM: A vulnerability was reported in HP System Management Homepage. PLATFORM: Version(s): prior to 7.1.1 ABSTRACT: The vulnerabilities could be exploited remotely resulting in unauthorized access, disclosure of information, data modification, Denial of Service (DoS), and execution of arbitrary code. Reference links: Original Advisory Security Tracker ID 1027209 CVE-2012-2012, CVE-2012-2013, CVE-2012-2014 CVE-2012-2015, CVE-2012-2016 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP System Management Homepage. A remote authenticated user can gain elevated privileges. A remote authenticated

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Decentralized, adaptive resource allocation for sensor networks  

Science Conference Proceedings (OSTI)

This paper addresses the problem of resource allocation in sensor networks. We are concerned with how to allocate limited energy, radio bandwidth, and other resources to maximize the value of each node's contribution to the network. Sensor networks present ...

Geoffrey Mainland; David C. Parkes; Matt Welsh

2005-05-01T23:59:59.000Z

182

Seven health physics calculator programs for the HP-41CV  

Science Conference Proceedings (OSTI)

Several user-oriented programs for the Hewlett-Packard HP-41CV are explained. The first program builds, stores, alters, and ages a list of radionuclides. This program only handles single- and double-decay chains. The second program performs convenient conversions for the six nuclides of concern in plutonium handling. The conversions are between mass, activity, and weight percents of the isotopes. The source can be aged and/or neutron generation rates can be computed. The third program is a timekeeping program that improves the process of manually estimating and tracking personnel exposure during high dose rate tasks by replacing the pencil, paper, and stopwatch method. This program requires a time module. The remaining four programs deal with computations of time-integrated air concentrations at various distances from an airborne release. Building wake effects, source depletion by ground deposition, and sector averaging can all be included in the final printout of the X/Q - Hanford and X/Q - Pasquill programs. The shorter versions of these, H/Q and P/Q, compute centerline or sector-averaged values and include a subroutine to facilitate dose estimation by entering dose factors and quantities released. The horizontal and vertical dispersion parameters in the Pasquill-Gifford programs were modeled with simple, two-parameter functions that agreed very well with the usual textbook graphs. 8 references, 7 appendices.

Rittmann, P.D.

1984-08-01T23:59:59.000Z

183

Mobility-assisted minimum connected cover in a wireless sensor network  

Science Conference Proceedings (OSTI)

All properties of mobile wireless sensor networks (MWSNs) are inherited from static wireless sensor networks (WSNs) and meanwhile have their own uniqueness and node mobility. Sensor nodes in these networks monitor different regions of an area of interest ... Keywords: Energy-aware selection method, Minimum connected sensor cover set, Mobile wireless sensor networks, Redundant node, Relocation

Ahmed M. Khedr; Walid Osamy

2012-07-01T23:59:59.000Z

184

V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to 1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems April 24, 2013 - 1:06am Addthis PROBLEM: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems PLATFORM: HP ElitePad 900 with BIOS version vF.00 ABSTRACT: A vulnerability was reported in HP ElitePad 900 REFERENCE LINKS: HP Document ID: c03727435 SecurityTracker Alert ID: 1028461 CVE-2012-5218 IMPACT ASSESSMENT: Medium DISCUSSION: The BIOS secure boot feature of the BIOS may not be enabled. A local user may be able to bypass the secure boot feature and boot an alternate operating system. IMPACT: A local user can may be able to boot to an alternate operating system. SOLUTION:

185

V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to 1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems April 24, 2013 - 1:06am Addthis PROBLEM: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems PLATFORM: HP ElitePad 900 with BIOS version vF.00 ABSTRACT: A vulnerability was reported in HP ElitePad 900 REFERENCE LINKS: HP Document ID: c03727435 SecurityTracker Alert ID: 1028461 CVE-2012-5218 IMPACT ASSESSMENT: Medium DISCUSSION: The BIOS secure boot feature of the BIOS may not be enabled. A local user may be able to bypass the secure boot feature and boot an alternate operating system. IMPACT: A local user can may be able to boot to an alternate operating system. SOLUTION:

186

V-226: HP StoreOnce D2D Backup Systems Denial of Service Vulnerability |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP StoreOnce D2D Backup Systems Denial of Service 6: HP StoreOnce D2D Backup Systems Denial of Service Vulnerability V-226: HP StoreOnce D2D Backup Systems Denial of Service Vulnerability August 24, 2013 - 3:45am Addthis PROBLEM: A vulnerability has been reported in HP StoreOnce D2D Backup Systems, which can be exploited by malicious people to cause a DoS (Denial of Service). PLATFORM: HP StoreOnce D2D Backup Systems 1.x, HP StoreOnce D2D Backup Systems 2.x ABSTRACT: The vulnerability is reported in versions 2.2.18 and prior and 1.2.18 and prior. REFERENCE LINKS: Secunia Advisory SA54598 CVE-2013-2353 IMPACT ASSESSMENT: Moderate DISCUSSION: A vulnerability has been reported in HP StoreOnce D2D Backup Systems, which can be exploited by malicious people to cause a DoS (Denial of Service). The vulnerability is caused due to an unspecified error. No further

187

Network regression with predictive clustering trees  

Science Conference Proceedings (OSTI)

Network data describe entities represented by nodes, which may be connected with (related to) each other by edges. Many network datasets are characterized by a form of autocorrelation, where the value of a variable at a given node depends on the values ... Keywords: Autocorrelation, Network data, Predictive clustering trees, Regression inference

Daniela Stojanova; Michelangelo Ceci; Annalisa Appice; Sašo DžEroski

2012-09-01T23:59:59.000Z

188

V-016: HP Performance Insight Bugs with Sybase Database Let Remote...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System V-016: HP Performance Insight Bugs with Sybase Database Let...

189

Energy Adaptation Techniques to Optimize Data Delivery in Store-and-Forward Sensor Networks  

E-Print Network (OSTI)

nodes in a sensor network often have widely varying energy profiles due to the amount of data that nodes will have different energy profiles. Due to variations in the hard- ware, manufacturing processes, node placement, and node data requirements, the energy profile of two nodes can vary drastically

Martonosi, Margaret

190

Natural networks  

E-Print Network (OSTI)

Scale-free and non-computable characteristics of natural networks are found to result from the least-time dispersal of energy. To consider a network as a thermodynamic system is motivated since ultimately everything that exists can be expressed in terms of energy. According to the variational principle, the network will grow and restructure when flows of energy diminish energy differences between nodes as well as relative to nodes in surrounding systems. The natural process will yield scale-free characteristics because the nodes that contribute to the least-time consumption of free energy preferably attach to each other. Network evolution is a path-dependent and non-deterministic process when there are two or more paths to consume a common source of energy. Although evolutionary courses of these non-Hamiltonian systems cannot be predicted, many mathematical functions, models and measures that characterize networks can be recognized as appropriate approximations of the thermodynamic equation of motion that has been derived from statistical physics of open systems.

Tuomo Hartonen; Arto Annila

2011-06-21T23:59:59.000Z

191

Model-based compression in wireless ad hoc networks  

Science Conference Proceedings (OSTI)

We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes determines network topology. As opposed to encoding individual node locations, ... Keywords: compression, modeling, routing protocols, routing tables, sensor networks, trajectory

Milenko Drinic; Darko Kirovski; Miodrag Potkonjak

2003-11-01T23:59:59.000Z

192

Analysis of IEEE 802.11e Line Topology Scenarios in the Presence of Hidden Nodes  

Science Conference Proceedings (OSTI)

In this paper an innovative simulation study of five IEEE 802.11e network configurations is presented. The conducted analysis is crucial for understanding how a theoretically simple and, most of all, popular line topology network can be degraded by the ... Keywords: IEEE 802.11e, ad-hoc, hidden and exposed nodes

Katarzyna Kosek; Marek Natkaniec; Andrzej R. Pach

2008-09-01T23:59:59.000Z

193

Thorough analysis of 802.11e star topology scenarios in the presence of hidden nodes  

Science Conference Proceedings (OSTI)

In this paper the authors present a simulation study of two 802.11e network scenarios. The presented analysis is not only novel but most of all crucial for understanding how a theoretically simple star topology network can be degraded by the presence ... Keywords: IEEE 802.11e, QoS, hidden nodes

Katarzyna Kosek; Marek Natkaniec; Luca Vollero

2008-05-01T23:59:59.000Z

194

Energy-aware network coding circuit and system design  

E-Print Network (OSTI)

Network Coding (NC) has been shown to provide several advantages in communication networks in terms of throughput, data robustness and security. However, its applicability to networks with resource constrained nodes, like ...

Angelopoulos, Georgios, S.M. Massachusetts Institute of Technology

2011-01-01T23:59:59.000Z

195

Localization and sensing applications in the Pushpin Computer Network  

E-Print Network (OSTI)

The utility and purpose of a node in a wireless sensor network is intimately tied to the physical space in which it is distributed. As such, it is advantageous under most circumstances for a sensor node to know its position. ...

Broxton, Michael Joseph

2005-01-01T23:59:59.000Z

196

Probabilistic data collection protocols for energy harvesting wireless sensor networks  

Science Conference Proceedings (OSTI)

Energy harvesting from ambient energy sources including solar and vibration has been studied as a candidate for powering next generation wireless sensor networks. However, energy harvesting is unstable to supply a sensor node with energy, and a node ...

Masaya Yoshida; Tomoya Kitani; Masaki Bandai; Takashi Watanabe; Pai H. Chou; Winston K. G. Seah

2012-11-01T23:59:59.000Z

197

Network Security for Substation Automation Systems  

Science Conference Proceedings (OSTI)

The protection of critical infrastructure against electronic and communication network based attacks becomes more and more important. This work investigates the threat of network-based attacks on substations, the nodes of the electric power grid. Three ...

Martin Naedele; Dacfey Dzung; Michael Stanimirov

2001-09-01T23:59:59.000Z

198

Epidemic Propagation In Overlaid Wireless Networks  

SciTech Connect

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.

Yanmaz, Evsen [Los Alamos National Laboratory

2008-01-01T23:59:59.000Z

199

Bootstrapping a hop-optimal network in the weak sensor model  

Science Conference Proceedings (OSTI)

Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research thus has three parts: One must model the restrictions on sensor nodes; ... Keywords: Ad hoc network, contention resolution, maximal independent set, radio network, random geometric graphs, sensor network, weak sensor model

Martin Farach-Colton; Rohan J. Fernandes; Miguel A. Mosteiro

2009-10-01T23:59:59.000Z

200

Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy  

NLE Websites -- All DOE Office Websites (Extended Search)

Complexed Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy Research Scientific Computing Center 2011 Annual Report Ernest Orlando Lawrence Berkeley National Laboratory 1 Cyclotron Road, Berkeley, CA 94720-8148 This work was supported by the Director, Office of Science, Office of Advanced Scientific Computing Research of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. National Energy Research Scientific Computing Center 2011 Annual Report The Year in Perspective Research News New Mathematical Method Reveals Where Genes Switch On or Off Small Particles Have Big Impact Detailed Model Changes View of Ancient Climate Change A Better Way to Find Extreme Weather Events in Climate Modeling Data Turning Grass into Gas for Less Bubbles Help Break Energy Storage Record for Lithium-Air Batteries

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

SiNode Systems | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

SiNode Systems SiNode Systems National Clean Energy Business Plan Competition 2013 31 likes SiNode Systems Northwestern University 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. SiNode seeks to change the landscape for lithium-ion batteries so they can meet the demands of a wide range of industries, from consumer electronics to electric vehicles. SiNode technology uses a composite of silicon nano-particles and porous graphene, developed by Dr. Harold H. Kung at Northwestern University. SiNode's anodes offer dramatic energy capacity increases (3200 mAh/g vs.

202

SiNode Systems | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

SiNode Systems SiNode Systems National Clean Energy Business Plan Competition 2013 31 likes SiNode Systems Northwestern University 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. SiNode seeks to change the landscape for lithium-ion batteries so they can meet the demands of a wide range of industries, from consumer electronics to electric vehicles. SiNode technology uses a composite of silicon nano-particles and porous graphene, developed by Dr. Harold H. Kung at Northwestern University. SiNode's anodes offer dramatic energy capacity increases (3200 mAh/g vs.

203

SiNode Systems | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

SiNode Systems SiNode Systems National Clean Energy Business Plan Competition 2013 31 likes SiNode Systems Northwestern University 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. SiNode seeks to change the landscape for lithium-ion batteries so they can meet the demands of a wide range of industries, from consumer electronics to electric vehicles. SiNode technology uses a composite of silicon nano-particles and porous graphene, developed by Dr. Harold H. Kung at Northwestern University. SiNode's anodes offer dramatic energy capacity increases (3200 mAh/g vs.

204

Clustering incorporating shortest paths identifies relevant modules in functional interaction networks  

Science Conference Proceedings (OSTI)

Many biological systems can be modeled as networks. Hence, network analysis is of increasing importance to systems biology. We describe an evolutionary algorithm for selecting clusters of nodes within a large network based upon network topology together ...

Jennifer Hallinan; Matthew Pocock; Stephen Addinall; David A. Lydall; Anil Wipat

2009-03-01T23:59:59.000Z

205

Attacking the Kad network  

Science Conference Proceedings (OSTI)

The Kad network, an implementation of the Kademlia DHT protocol, supports the popular eDonkey peer-to-peer file sharing network and has over 1 million concurrent nodes. We describe several attacks that exploit critical design weaknesses in Kad to allow ... Keywords: Kad, P2P, attack, security

Peng Wang; James Tyra; Eric Chan-Tin; Tyson Malchow; Denis Foo Kune; Nicholas Hopper; Yongdae Kim

2008-09-01T23:59:59.000Z

206

Networked Aquatic Sampling System  

E-Print Network (OSTI)

system for field operation • Wireless 802.11b based networkOperation • Continuous real time data acquisition and logging of pertinent environmental parameters • WirelessOperation • Network of 10 static nodes and 1 robotic boat • AODV based ad-hoc 802.11b wireless

2005-01-01T23:59:59.000Z

207

Page not found | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

could be remotely exploited resulting in cross site scripting (XSS). http:energy.govcioarticlesu-204-hp-network-node-manager-i-input-validation-hole-permits-cross-site-scri...

208

Exploiting network-based approaches for understanding gene regulation and function  

E-Print Network (OSTI)

to their target genes, controlled by their cis-regulatory elements, form a complex and directional network of interactions. In contrast, functional linkage networks constructed in function prediction pipelines typically comprise of undirected networks where all... in the network that pass through a node of interest – the higher the number of paths that pass through a node, the more important it is. Average path length Average length of the shortest paths between all pairs of nodes in the network. Closeness Closeness...

Janga, Sarath Chandra

2010-07-06T23:59:59.000Z

209

Technology Diffusion in Communication Networks  

E-Print Network (OSTI)

In the rich and growing literature on diffusion and cascade effects in social networks, it is assumed that a node's actions are influenced only by its immediate neighbors in the social network. However, there are other contexts in which this highly-local view of influence is not applicable. The diffusion of technologies in communication networks is one important example; here, a node's actions should also be influenced by remote nodes that it can communicate with using the new technology. We propose a new model of technology diffusion inspired by the networking literature on this topic. Given the communication network $G(V,E)$, we assume that node $u$ activates (i.e. deploys the new technology) when it is adjacent to a connected component of active nodes in $G$ of size exceeding node $u$'s threshold $\\theta(u)$. We focus on an algorithmic problem that is well understood in the context of social networks, but thus far has only heuristic solutions in the context of communication networks: determining the smalle...

Goldberg, Sharon

2012-01-01T23:59:59.000Z

210

Dedicated heterogeneous node scheduling including backfill scheduling  

DOE Patents (OSTI)

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.

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

2006-07-25T23:59:59.000Z

211

Data sampling control, compression and query in sensor networks  

Science Conference Proceedings (OSTI)

Nodes in wireless sensor networks have very limited storage capacity, computing ability and battery power. Node failure and communication link disconnection occur frequently, which means weak services of the network layer. Sensed data is inaccurate which ... Keywords: data accuracy, data compression, data sampling, energy efficiency, power limitation, query, sampling frequency control, sensor networks

Jinbao Li; Jianzhong Li

2007-04-01T23:59:59.000Z

212

Map: medial axis based geometric routing in sensor networks  

Science Conference Proceedings (OSTI)

One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, quality of communication ... Keywords: medial axis, routing, sensor networks, system design

Jehoshua Bruck; Jie Gao; Anxiao Jiang

2007-12-01T23:59:59.000Z

213

Forward correction and fountain codes in delay-tolerant networks  

Science Conference Proceedings (OSTI)

Delay-tolerant ad hoc networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information to be delivered ... Keywords: delay-tolerant networks (DTNs), forward correction, fountain codes, mobile ad hoc networks

Eitan Altman; Francesco De Pellegrini

2011-02-01T23:59:59.000Z

214

Fast track article: Reliable networks with unreliable sensors  

Science Conference Proceedings (OSTI)

Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network connectivity. We provide a formal analysis that establishes the relationship between node ... Keywords: Connectivity, Fault tolerance, Sensor network

Srikanth Sastry; Tsvetomira Radeva; Jianer Chen; Jennifer L. Welch

2013-04-01T23:59:59.000Z

215

Connectivity problem in wireless networks  

Science Conference Proceedings (OSTI)

We study the complexity of the following connectivity problem in wireless networks: for a given placement of n nodes in the plane, the goal is to compute a channel and power assignment that forms strongly connected communication structure spanning ...

Dariusz R. Kowalski; Mariusz A. Rokicki

2010-09-01T23:59:59.000Z

216

U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users 5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code September 21, 2012 - 6:00am Addthis PROBLEM: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code PLATFORM: HP SiteScope v11.10, v11.11, v11.12 for Windows, Linux and Solaris ABSTRACT: A vulnerability was reported in HP SiteScope. reference LINKS: HP Security Bulletin Document ID: c03489683 SecurityTracker Alert ID: 1027547 CVE-2012-3259 CVE-2012-3260 CVE-2012-3261 CVE-2012-3262 CVE-2012-3263 CVE-2012-3264 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP SiteScope. A remote user can execute

217

U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users 5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code September 21, 2012 - 6:00am Addthis PROBLEM: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code PLATFORM: HP SiteScope v11.10, v11.11, v11.12 for Windows, Linux and Solaris ABSTRACT: A vulnerability was reported in HP SiteScope. reference LINKS: HP Security Bulletin Document ID: c03489683 SecurityTracker Alert ID: 1027547 CVE-2012-3259 CVE-2012-3260 CVE-2012-3261 CVE-2012-3262 CVE-2012-3263 CVE-2012-3264 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP SiteScope. A remote user can execute

218

Evaluation of 2 Percent CrMoWV HP/LP Rotor Gap Forging for Single Cylinder Steam Turbine Use  

Science Conference Proceedings (OSTI)

There has been considerable industry interest in developing a single shaft rotor configuration that uses the same rotor in the high-pressure (HP) as well as the Low Pressure (LP) sections of a steam turbine. This report evaluates an HP/LP rotor forging for single cylinder steam turbines.

1998-11-24T23:59:59.000Z

219

Switch for serial or parallel communication networks  

DOE Patents (OSTI)

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.

Crosette, Dario B. (DeSoto, TX)

1994-01-01T23:59:59.000Z

220

Switch for serial or parallel communication networks  

DOE Patents (OSTI)

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.

Crosette, D.B.

1994-07-19T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

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

DOE Patents (OSTI)

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.

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-01T23:59:59.000Z

222

Maximizing network lifetime based on transmission range adjustment in wireless sensor networks  

Science Conference Proceedings (OSTI)

In a wireless sensor network (WSN), the unbalanced distribution of communication loads often causes the problem of energy hole, which means the energy of the nodes in the hole region will be exhausted sooner than the nodes in other regions. This is a ... Keywords: Energy hole problem, Multi-objective optimization problem, NP hard, Wireless sensor networks

Chao Song; Ming Liu; Jiannong Cao; Yuan Zheng; Haigang Gong; Guihai Chen

2009-07-01T23:59:59.000Z

223

Wireless sensor networks for habitat monitoring  

Science Conference Proceedings (OSTI)

We provide an in-depth study of applying wireless sensor networks to real-world habitat monitoring. A set of system design requirements are developed that cover the hardware design of the nodes, the design of the sensor network, and the capabilities ... Keywords: environmental monitoring, habitat monitoring, low power systems, sensor network architecture, wireless sensor networks

Alan Mainwaring; David Culler; Joseph Polastre; Robert Szewczyk; John Anderson

2002-09-01T23:59:59.000Z

224

Zonal Rumor Routing for Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

Routing algorithms for wireless sensor networks are constrained by power, memory and computational resources. Rumor Routing algorithm for sensor networks spreads theinformation of an event to other nodes in the network, thus enabling queries to discover ... Keywords: Sensor Network, Routing, Wireless, Rumor Routing

Tarun Banka; Gagan Tandon; Anura P. Jayasumana

2005-04-01T23:59:59.000Z

225

Integrating Correlated Bayesian Networks Using Maximum Entropy  

Science Conference Proceedings (OSTI)

We consider the problem of generating a joint distribution for a pair of Bayesian networks that preserves the multivariate marginal distribution of each network and satisfies prescribed correlation between pairs of nodes taken from both networks. We derive the maximum entropy distribution for any pair of multivariate random vectors and prescribed correlations and demonstrate numerical results for an example integration of Bayesian networks.

Jarman, Kenneth D.; Whitney, Paul D.

2011-08-30T23:59:59.000Z

226

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

DOE Patents (OSTI)

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.

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

2010-01-12T23:59:59.000Z

227

Networks in Cognitive Science  

E-Print Network (OSTI)

Networks of interconnected nodes have long played a key role in cognitive science, from artificial neural networks to spreading activation models of semantic memory. Recently, however, a new Network Science has been developed, providing insights into the emergence of global, system-scale properties in contexts as diverse as the Internet, metabolic reactions or collaborations among scientists. Today, the inclusion of network theory into cognitive sciences, and the expansion of complex systems science, promises to significantly change the way in which the organization and dynamics of cognitive and behavioral processes are understood. In this paper, we review recent contributions of network theory at different levels and domains within the cognitive sciences.

Baronchelli, Andrea; Pastor-Satorras, Romualdo; Chater, Nick; Christiansen, Morten H

2013-01-01T23:59:59.000Z

228

Enabling Long-Lived Sensor Networks Through Solar Energy Harvesting  

E-Print Network (OSTI)

Networks through Solar Energy Harvesting Jason Hsu, SadafPer formance Energy Harvesting Technologies System life andProblem Description: Energy harvesting enabled sensor nodes

Jason Hsu; Sadaf Zahedi; Jonathan Friedman; Aman Kansal; Vijay Raghunathan; Mani Srivastava

2005-01-01T23:59:59.000Z

229

Information sharing in Quantum Complex Networks  

E-Print Network (OSTI)

We introduce the use of entanglement entropy as a tool for studying the amount of information shared between the nodes of quantum complex networks. By considering the ground state of a network of coupled quantum harmonic oscillators, we compute the information that each node has on the rest of the system. We show that the nodes storing the largest amount of information are not the ones with the highest connectivity, but those with intermediate connectivity thus breaking down the usual hierarchical picture of classical networks. We show both numerically and analytically that the mutual information characterizes the network topology. As a byproduct, our results point out that the amount of information available for an external node connecting to a quantum network allows to determine the network topology.

Cardillo, Alessio; Zueco, David; Gómez-Gardeńes, Jesús

2013-01-01T23:59:59.000Z

230

On the interdependence of routing and data compression in multi-hop sensor networks  

Science Conference Proceedings (OSTI)

We consider a problem of broadcast communication in a multi-hop sensor network, in which samples of a random field are collected at each node of the network, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed ... Keywords: cross-layer interactions, multi-hop networks, routing, sensor networks, source coding

Anna Scaglione; Sergio D. Servetto

2002-09-01T23:59:59.000Z

231

Round complexity of leader election and gossiping in bidirectional radio networks  

Science Conference Proceedings (OSTI)

We consider the setting of ad hoc radio networks when the underlying network is bidirectional, the number of nodes in the network n is known and nodes can be assigned labels which are polynomially large in n. For this setting we present a protocol for ... Keywords: Bidirectional radio networks, Distributed computing, Gossiping, Leader election, Polynomially large labels

Shailesh Vaya

2013-05-01T23:59:59.000Z

232

Implications of link range and (In)stability on sensor network architecture  

Science Conference Proceedings (OSTI)

In this work, we consider sensor networks used for scientific instrumentation, where we have a set of nodes collecting data and relaying the same to a central base node. From the point of view of deploying such networks,we re-look at the design choices ... Keywords: 802.15.4 link range, link characteristics, network architecture, wireless sensor networks

Bhaskaran Raman; Kameswari Chebrolu; Naveen Madabhushi; Dattatraya Y. Gokhale; Phani K. Valiveti; Dheeraj Jain

2006-09-01T23:59:59.000Z

233

A hardware/software simulation environment for energy harvesting wireless sensor networks  

Science Conference Proceedings (OSTI)

Wireless sensor networks (WSNs) consist of wirelessly communicating nodes with an autarkic power supply for each node. Typically, the consumable energy of these nodes is very limited. Energy harvesting systems (EHSs) can be used to extend the lifetime ... Keywords: energy harvesting, simulation environment, wireless sensor networks

Leander B. Hörmann; Philipp M. Glatz; Karima B. Hein; Christian Steger; Reinhold Weiss

2012-10-01T23:59:59.000Z

234

Line-plane broadcasting in a data communications network of a parallel computer  

DOE Patents (OSTI)

Methods, apparatus, and products are disclosed for line-plane broadcasting in a data communications network of a parallel computer, the parallel computer comprising a plurality of compute nodes connected together through the network, the network optimized for point to point data communications and characterized by at least a first dimension, a second dimension, and a third dimension, that include: initiating, by a broadcasting compute node, a broadcast operation, including sending a message to all of the compute nodes along an axis of the first dimension for the network; sending, by each compute node along the axis of the first dimension, the message to all of the compute nodes along an axis of the second dimension for the network; and sending, by each compute node along the axis of the second dimension, the message to all of the compute nodes along an axis of the third dimension for the network.

Archer, Charles J. (Rochester, MN); Berg, Jeremy E. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Smith, Brian E. (Rochester, MN)

2010-11-23T23:59:59.000Z

235

HP-CAT to Lead the Way in New Research under NNSA Grante  

NLE Websites -- All DOE Office Websites (Extended Search)

4th, 2003 4th, 2003 HP-CAT to Lead the Way in New Research under NNSA Grant The High Pressure Collaborative Access Team (HP-CAT) at APS sector 16 will be a primary location for research carried our under a new grant from the National Nuclear Security Administration (NNSA). The $5.9-million, 2.75-year NNSA grant to the Geophysical Laboratory of the Carnegie Institution in Washington, D.C., under the Stewardship Science Academic Alliances program, will fund research into the behavior of materials under extreme pressure conditions at the Carnegie/Department of Energy Alliance Center (CDAC). The NNSA selected CDAC because of the leadership of its team in the development of new techniques and capabilities in high-pressure and high-temperature materials research. As principal investigator for the

236

ANL=OHS/HP=83=102 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM  

Office of Legacy Management (LM)

' DO E/EV=0005/40 ' DO E/EV=0005/40 ANL=OHS/HP=83=102 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE ALBANY METALLURGICAL RESEARCH CENTER UNITED STATES BUREAU OF MINES ALBANY, OREGON Q\OLO G/C G- 4& G HP-83-102 ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Argonne, Illinois 60439 FORMERLY UTILIZED MED/AEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE ALBANY METALLURGICAL RESEARCH CENTER

237

Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks  

Science Conference Proceedings (OSTI)

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward ... Keywords: Cross-layer adaptation design, Delay-tolerant network, Mobile ad hoc network, Opportunistic routing, Vehicular ad hoc network

Liang Dong

2012-11-01T23:59:59.000Z

238

Phase response characteristics of sinoatrial node cells  

Science Conference Proceedings (OSTI)

In this work, the dynamic response of the sinoatrial node (SAN), the natural pacemaker of the heart, to short external stimuli is investigated using the Zhang et al. model. The model equations are solved twice for the central cell and for the peripheral ... Keywords: Cardiac models, Heart, Mathematical models, Phase resetting, Regional differences, Sinoatrial node, Three-dimensional phase transition curves

D. G. Tsalikakis; H. G. Zhang; D. I. Fotiadis; G. P. Kremmydas; ?. K. Michalis

2007-01-01T23:59:59.000Z

239

Sharing information for Q-learning-based network bandwidth estimation and network failure detection  

Science Conference Proceedings (OSTI)

Distributed bandwidth (bw) estimation for effective routing and network failure detection are essential in several networked applications. However, they are hard problems since the individual nodes (agents) do not have global knowledge about the network ... Keywords: Q-learning, bandwidth estimation, network failures

Partha S. Dutta; Nicholas R. Jennings; R. Jennings; Luc Moreau

2005-07-01T23:59:59.000Z

240

On the statistical detection of clusters in undirected networks  

Science Conference Proceedings (OSTI)

The goal of network clustering algorithms is to assign each node in a network to one of several mutually exclusive groups based upon the observed edge set. Of the network clustering algorithms widely available, most make the effort to maximize the modularity ... Keywords: Community structure detection, Hypothesis testing, Log-likelihood, Log-likelihood ratio, Network clustering, Undirected networks

Marcus B. Perry, Gregory V. Michaelson, M. Alan Ballard

2013-12-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

A compressive sensing-based reconstruction approach to network traffic  

Science Conference Proceedings (OSTI)

Traffic matrix in a network describes the end-to-end network traffic which embodies the network-level status of communication networks from origin to destination nodes. It is an important input parameter of network traffic engineering and is very crucial ...

Laisen Nie, Dingde Jiang, Zhengzheng Xu

2013-07-01T23:59:59.000Z

242

Energy-Efficient Cooperative Routing in BER Constrained Multihop Networks  

E-Print Network (OSTI)

Abstract — Due to the limited energy supplies of nodes, in many applications like wireless sensor networks energy-efficiency is crucial for extending the lifetime of these networks. We study the routing problem for multihop wireless ad hoc networks based on cooperative transmission. The source node wants to transmit messages to a single destination. Other nodes in the network may operate as relay nodes. In this paper, we propose a cooperative multihop routing for the purpose of power savings, constrained on a required bit error rate (BER) at the destination. We derive analytical results for line and grid network topologies. It is shown that energy savings of 100 % are achievable in line and grid networks with a large number of nodes for BER =10 ?4 constraint at the destination. I.

Behrouz Maham; Mérouane Debbah; Are Hjřrungnes

2010-01-01T23:59:59.000Z

243

Information extraction with network centralities : finding rumor sources, measuring influence, and learning community structure  

E-Print Network (OSTI)

Network centrality is a function that takes a network graph as input and assigns a score to each node. In this thesis, we investigate the potential of network centralities for addressing inference questions arising in the ...

Zaman, Tauhid R

2011-01-01T23:59:59.000Z

244

Sharing information in time-division duplexing channels: a network coding approach  

E-Print Network (OSTI)

We study random linear network coding for time-division duplexing channels for sharing information between nodes. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. ...

Lucani, Daniel Enrique

245

Trimming the tree: tailoring adaptive huffman coding to wireless sensor networks  

Science Conference Proceedings (OSTI)

Nodes in wireless sensor networks are generally designed to operate on a limited energy budget, and must consciously use the available charge to allow for long lifetimes. As the radio transceiver is the predominant power consumer on current node platforms, ...

Andreas Reinhardt; Delphine Christin; Matthias Hollick; Johannes Schmitt; Parag S. Mogre; Ralf Steinmetz

2010-02-01T23:59:59.000Z

246

S4: small state and small stretch routing protocol for large wireless sensor networks  

Science Conference Proceedings (OSTI)

Routing protocols for wireless sensor networks must address the challenges of reliable packet delivery at increasingly large scale and highly constrained node resources. Attempts to limit node state can result in undesirable worst-case routing performance, ...

Yun Mao; Feng Wang; Lili Qiu; Simon S. Lam; Jonathan M. Smith

2007-04-01T23:59:59.000Z

247

On the diversity-multiplexing tradeoff of multiuser amplify & forward multihop networks  

Science Conference Proceedings (OSTI)

We consider an amplify & forward multihop network with n single-antenna nodes in the source and destination stage each, as well as nR(l), l ? {1, . . . , L}, single-antenna relay nodes in the ...

Jörg Wagner; Armin Wittneben

2009-11-01T23:59:59.000Z

248

Dynamic sensor tasking in heterogeneous, mobile sensor networks  

E-Print Network (OSTI)

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 ...

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

2005-01-01T23:59:59.000Z

249

An energy efficient RF transceiver for wireless microsensor networks  

E-Print Network (OSTI)

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 ...

Daly, Denis Clarke

2005-01-01T23:59:59.000Z

250

Broadcasting and transmission coordination for ad hoc and sensor networks  

Science Conference Proceedings (OSTI)

This thesis studies the performance benefit of coordination in wireless sensor networks (WSNs) and ad hoc networks (AHNs). WSNs are often comprised of a large number of inexpensive nodes with short battery life and limited communication and processing ...

Ananth V. Kini / Steven P. Weber

2008-01-01T23:59:59.000Z

251

Joint energy management and resource allocation in rechargeable sensor networks  

Science Conference Proceedings (OSTI)

Energy harvesting sensor platforms have opened up a new dimension to the design of network protocols. In order to sustain the network operation, the energy consumption rate cannot be higher than the energy harvesting rate, otherwise, sensor nodes will ...

Ren-Shiou Liu; Prasun Sinha; Can Emre Koksal

2010-03-01T23:59:59.000Z

252

Network Coded Transmission of Fountain Codes over Cooperative Relay Networks  

E-Print Network (OSTI)

In this paper, a transmission strategy of fountain codes over cooperative relay networks is proposed. When more than one relay nodes are available, we apply network coding to fountain-coded packets. By doing this, partial information is made available to the destination node about the upcoming message block. It is therefore able to reduce the required number of transmissions over erasure channels, hence increasing the effective throughput. Its application to wireless channels with Rayleigh fading and AWGN noise is also analysed, whereby the role of analogue network coding and optimal weight selection is demonstrated.

Kurniawan, E; Yen, K; Chong, K F E

2010-01-01T23:59:59.000Z

253

Advanced mobile networking, sensing, and controls.  

SciTech Connect

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.

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-01T23:59:59.000Z

254

Battery discharge characteristics of wireless sensor nodes: An experimental analysis  

E-Print Network (OSTI)

Abstract — Battery life extension is the principal driver for energy-efficient wireless sensor network (WSN) design. However, there is growing awareness that in order to truly maximize the operating life of battery-powered systems such as sensor nodes, it is important to discharge the battery in a manner that maximizes the amount of charge extracted from it. In spite of this, there is little published data that quantitatively analyzes the effectiveness with which modern wireless sensor nodes discharge their batteries, under different operating conditions. In this paper, we report on systematic experiments that we conducted to quantify the impact of key wireless sensor network design and environmental parameters on battery performance. Our testbed consists of MICA2DOT Motes, a commercial lithiumcoin battery, and a suite of techniques for measuring battery performance. We evaluate the extent to which known electrochemical phenomena, such as rate-capacity characteristics, charge recovery and thermal effects, can play a role in governing the selection of key WSN design parameters such as power levels, packet sizes, etc. We demonstrate that battery characteristics significantly alter and complicate otherwise well-understood trade-offs in WSN design. In particular, we analyze the non-trivial implications of battery characteristics on WSN power control strategies, and find that a battery-aware approach to power level selection leads to a 52 % increase in battery efficiency. We expect our results to serve as a quantitative basis for future research in designing battery-efficient sensing applications and protocols. I.

Chulsung Park; Kanishka Lahiri

2005-01-01T23:59:59.000Z

255

Packet-Switched Optical Networks  

Science Conference Proceedings (OSTI)

In this article, we present a platform design for packet-switched OTDM networks operating at ultrafast bit-rates for modern multiprocessor interconnects. The design is implemented in a prototype 8-node transparent shuffle network. The flow control in ... Keywords: Communication system interfaces, signalling, synchronization, clock and data recovery, PLLs

Ben Y. Yu; Paul Toliver; Robert J. Runser; Kung-Li Deng; Deyu Zhou; Ivan Glesk; Paul R. Prucnal

1998-01-01T23:59:59.000Z

256

Navigation protocols in sensor networks  

Science Conference Proceedings (OSTI)

We develop distributed algorithms for adaptive sensor networks that respond to directing a target through a region of space. We model this problem as an online distributed motion planning problem. Each sensor node senses values in its perception space ... Keywords: Sensor networks, motes, navigation, potential field, robotics

Qun Li; Daniela Rus

2005-08-01T23:59:59.000Z

257

Centrality scaling in large networks  

E-Print Network (OSTI)

Betweenness centrality lies at the core of both transport and structural vulnerability properties of complex networks, however, it is computationally costly, and its measurement for networks with millions of nodes is near impossible. By introducing a multiscale decomposition of shortest paths, we show that the contributions to betweenness coming from geodesics not longer than L obey a characteristic scaling vs L, which can be used to predict the distribution of the full centralities. The method is also illustrated on a real-world social network of 5.5*10^6 nodes and 2.7*10^7 links.

Ercsey-Ravasz, Maria

2010-01-01T23:59:59.000Z

258

Modeling spatio-temporal network computations: a summary of results  

Science Conference Proceedings (OSTI)

Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of domains ranging from transportation science to sensor data analysis. Given ...

Betsy George; Shashi Shekhar

2007-11-01T23:59:59.000Z

259

Feature extraction for pulmonary crackle representation via wavelet networks  

Science Conference Proceedings (OSTI)

In this study, wavelet networks have been used to parameterize and quantify pulmonary crackles with an aim to depict the waveform with a small set of meaningful parameters. Complex Morlet wavelets are used at the nodes of both single and double-node ... Keywords: Crackle parameters, EM clustering, Lung sounds, Pulmonary crackles, Robustness to noise, Wavelet networks

Mete Yeginer; Yasemin P. Kahya

2009-08-01T23:59:59.000Z

260

An Underwater Sensor Network with Dual Communications, Sensing, and  

E-Print Network (OSTI)

An Underwater Sensor Network with Dual Communications, Sensing, and Mobility Carrick Detweiller an underwater sensor network with dual communication and sup- port for sensing and mobility. The nodes developed. We describe the hardware details of the underwater sensor node and the communication

Farritor, Shane

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

A NETWORK PROCESSING NODE FOR LIGHT UNMANNED AIRCRAFT.  

E-Print Network (OSTI)

??Over the last decade, research into unmanned and autonomous vehicles has greatly increased. With applications ranging from science and exploration to humanitarian and military efforts,… (more)

Arrowsmith, Timothy William

2007-01-01T23:59:59.000Z

262

Network topology analysis.  

SciTech Connect

Emerging high-bandwidth, low-latency network technology has made network-based architectures both feasible and potentially desirable for use in satellite payload architectures. The selection of network topology is a critical component when developing these multi-node or multi-point architectures. This study examines network topologies and their effect on overall network performance. Numerous topologies were reviewed against a number of performance, reliability, and cost metrics. This document identifies a handful of good network topologies for satellite applications and the metrics used to justify them as such. Since often multiple topologies will meet the requirements of the satellite payload architecture under development, the choice of network topology is not easy, and in the end the choice of topology is influenced by both the design characteristics and requirements of the overall system and the experience of the developer.

Kalb, Jeffrey L.; Lee, David S.

2008-01-01T23:59:59.000Z

263

Identifying failure in a tree network of a parallel computer  

DOE Patents (OSTI)

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.

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

2010-08-24T23:59:59.000Z

264

Reliable and efficient reprogramming in sensor networks  

Science Conference Proceedings (OSTI)

Retasking and remote programming of sensor networks is an essential functionality to make these networks practical and effective. As the availability of more capable sensor nodes increases and new functional implementations continue to be proposed, these ... Keywords: Broadcast, energy efficiency, minimum energy broadcast, reliable distribution, reprogramming, retasking, sensor networks

Chris Miller; Christian Poellabauer

2010-08-01T23:59:59.000Z

265

A new algorithm for gas network simulation  

Science Conference Proceedings (OSTI)

The simulation of natural gas networks has a growing importance for operators of networks. In this paper a new simulation algorithm based on the node potential analysis is presented. The approach is to evaluate analogies between electrical circuits and ... Keywords: algorithms, gas, modeling, networks, nonlinearities, simulation

Jens Rüdiger; Jurij Schiebelbein; Rainhart Lunderstädt; Joachim Horn

2006-02-01T23:59:59.000Z

266

Utility optimal scheduling in energy harvesting networks  

Science Conference Proceedings (OSTI)

In this paper, we show how to achieve close-to-optimal utility performance in energy harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount ... Keywords: Lyapunov analysis, energy harvesting, queueing, stochastic network

Longbo Huang; Michael J. Neely

2011-05-01T23:59:59.000Z

267

Scale-Free Growing Networks and Gravity  

E-Print Network (OSTI)

We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us to carry geometric mathematical structures, which are considered in gravitational theories, to probabilistic aspects studied in the framework of complex networks and vice versa.

J. A. Nieto

2011-12-08T23:59:59.000Z

268

Active time scheduling for rechargeable sensor networks  

Science Conference Proceedings (OSTI)

Recent progress in energy harvesting technologies made it possible to build sensor networks with rechargeable nodes which target an indefinitely long operation. In these networks, the goal of energy management is to allocate the available energy such ... Keywords: Energy harvesting, Rechargeable, Sensor network

Volodymyr Pryyma; Damla Turgut; Ladislau Bölöni

2010-03-01T23:59:59.000Z

269

Building programmable routing service for sensor networks  

Science Conference Proceedings (OSTI)

Current routing services for sensor networks are application-specific. They are pre-configured into nodes, and thus have difficulty in adapting to different applications and network conditions. This paper describes a framework to build programmable routing ... Keywords: Energy saving, Parameterization, Programmable, Routing, Sensor networks

Yu He; Cauligi S. Raghavendra

2005-04-01T23:59:59.000Z

270

LUSTER: wireless sensor network for environmental research  

Science Conference Proceedings (OSTI)

Environmental wireless sensor network (EWSN) systems are deployed in potentially harsh and remote environments where inevitable node and communication failures must be tolerated. LUSTER---Light Under Shrub Thicket for Environmental Research---is a system ... Keywords: LiteTDMA, architecture, environmental science, implementation, mote, network protocol, storage, validation, wireless sensor network

L. Selavo; A. Wood; Q. Cao; T. Sookoor; H. Liu; A. Srinivasan; Y. Wu; W. Kang; J. Stankovic; D. Young; J. Porter

2007-11-01T23:59:59.000Z

271

Monitoring Energy Consumption In Wireless Sensor Networks  

E-Print Network (OSTI)

sequences of temperature maps. It is used to compare and evaluate beacon-less geographic routing algorithms information to divide the network into fixed square grids and nodes in each grid alternate between sleeping between dominating and dominated. ­ Transmission power control: The transmission power of the nodes

Turau, Volker

272

Internal leakage detection for feedwater heaters in power plants using neural networks  

Science Conference Proceedings (OSTI)

As interest in safety and performance of power plants becomes more serious and wide-ranging, the significance of research on turbine cycles has attracted more attention. This paper particularly focuses on thermal performance analysis under the conditions ... Keywords: CBM, COP, DCA, DP, Diagnosis, FWBP, FWH, FWP, Feedwater heater, HP FWH, HP TBN, Internal leakage, LP FWH, LP TBN, Neural network, PEPSE, SG, TD, TTD, Thermal performance, Turbine cycle, VWO

Gyunyoung Heo; Song Kyu Lee

2012-04-01T23:59:59.000Z

273

A new approach for integrated coverage and connectivity in wireless sensor networks  

Science Conference Proceedings (OSTI)

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operates successfully, the active ... Keywords: Connectivity, Coverage, Deployment, Sensor network

Seyed Hossein Khasteh; Saeed Bagheri Shouraki; Nima Hajiabdorahim; Ehsan Dadashnialehi

2012-12-01T23:59:59.000Z

274

A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks  

Science Conference Proceedings (OSTI)

The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as few sensor nodes as possible. One way to deal with this problem is to schedule sensor nodes in such a way that a ... Keywords: Dynamic point coverage, Learning automata, Scheduling, Wireless sensor network

M. Esnaashari; M. R. Meybodi

2010-10-01T23:59:59.000Z

275

Asynchronous group key distribution on top of the cc2420 security mechanisms for sensor networks  

Science Conference Proceedings (OSTI)

A sensor network is a network consisting of small, inexpensive, low-powered sensor nodes that communicate to complete a common task. Sensor nodes are characterized by having limited communication and computation capabilities, energy, and storage. They ... Keywords: cc2420 security, group key distribution, sensor network security

Morten Tranberg Hansen

2009-03-01T23:59:59.000Z

276

Energy-aware Gateway Selection for Increasing the Lifetime of Wireless Body Area Sensor Networks  

Science Conference Proceedings (OSTI)

A Wireless Body Area Sensor Network (WBASN) is composed of a set of sensor nodes, placed on, near or within a human body. WBASNs opt to continuously monitor the health conditions of individuals under medical risk, e.g., elders and chronically ill people, ... Keywords: Energy harvesting, Gateway selection algorithm, Network lifetime, Selective engagement of nodes, Wireless Body Area Sensor Networks (WBASN)

Cuneyt Bayilmis; Mohamed Younis

2012-06-01T23:59:59.000Z

277

Measuring air quality in city areas by vehicular wireless sensor networks  

Science Conference Proceedings (OSTI)

This paper considers a micro-climate monitoring scenario, which usually requires deploying a large number of sensor nodes to capture environmental information. By exploiting vehicular sensor networks (VSNs), it is possible to equip fewer nodes on cars ... Keywords: Micro-climate monitoring, Opportunistic communication, Pervasive computing, Vehicular sensor network, Wireless sensor network

Shu-Chiung Hu; You-Chiun Wang; Chiuan-Yu Huang; Yu-Chee Tseng

2011-11-01T23:59:59.000Z

278

A framework for energy consumption based design space exploration for wireless sensor nodes  

E-Print Network (OSTI)

In wireless sensor networks due to the small transmission distances involved, the computation energy along with the radio energy determines the battery life. Energy consumption of error control codes (ECCs) is a complex function of the energy consumption in computing encoding-decoding, transmitting “redundant ” bits and energy saved by coding gain. This paper presents a methodology, which integrates computation and radio energy for searching an energy optimal ECC. Based on this methodology, a design space exploration framework and the energy model of sensor node have been developed. Exploration results show that the energy optimal ECC saves 15–58 % node energy for given parameters.

Sonali Chouhan; M. Balakrishnan; Ranjan Bose

2008-01-01T23:59:59.000Z

279

Mobile sensor network localization in harsh environments  

Science Conference Proceedings (OSTI)

The node localization problem in mobile sensor networks has recently received significant attention. Particle filters, adapted from robotics, have produced good localization accuracies in conventional settings, but suffer significantly when used in challenging ...

Harsha Chenji; Radu Stoleru

2010-06-01T23:59:59.000Z

280

Quantum network coding for quantum repeaters  

E-Print Network (OSTI)

This paper considers quantum network coding, which is a recent technique that enables quantum information to be sent on complex networks at higher rates than by using straightforward routing strategies. Kobayashi et al. have recently showed the potential of this technique by demonstrating how any classical network coding protocol gives rise to a quantum network coding protocol. They nevertheless primarily focused on an abstract model, in which quantum resource such as quantum registers can be freely introduced at each node. In this work, we present a protocol for quantum network coding under weaker (and more practical) assumptions: our new protocol works even for quantum networks where adjacent nodes initially share one EPR-pair but cannot add any quantum registers or send any quantum information. A typically example of networks satisfying this assumption is {\\emph{quantum repeater networks}}, which are promising candidates for the implementation of large scale quantum networks. Our results thus show, for the...

Satoh, Takahiko; Imai, Hiroshi

2012-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Multicasting in Large Wireless Networks: Bounds on the Minimum Energy per Bit  

E-Print Network (OSTI)

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regularity in node placement affects energy consumption. We first establish an information-theoretic lower bound on the minimum energy per bit for multicasting in arbitrary wireless networks when the channel state information is not available at the transmitters. Upper bounds are obtained by constructing a simple flooding scheme that requires no information at the receivers about the channel states or the locations and identities of the nodes. The gap between the upper and lower bounds is only a constant factor for dense random networks and regular networks, and differs by a poly-logarithmic factor for extended random networks. Further...

Jain, Aman; Verdu, Sergio

2009-01-01T23:59:59.000Z

282

Downhole drilling network using burst modulation techniques  

DOE Patents (OSTI)

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.

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

2007-04-03T23:59:59.000Z

283

for distributed wireless sensor networks  

E-Print Network (OSTI)

MEMS technology is enabling the development of inexpensive, autonomous wireless sensor nodes with volumes ranging from cubic mm to several cubic cm. These tiny sensor nodes can form rapidly deployed, massive distributed networks to allow unobtrusive, spatially dense, sensing and communication. MEMS enable these devices by reducing both the volume and energy consumption of various components. This paper will review some of the wireless sensor nodes under development and applicable MEMS devices for small and efficient optical communication, micropower generation, and sensing. In addition, CMOS post-process micromachining will be discussed as a method of achieving low cost and high integration. 1.

Brett A. Warneke; Kristofer S. J. Pister

2002-01-01T23:59:59.000Z

284

Flexible network wireless transceiver and flexible network telemetry transceiver  

DOE Patents (OSTI)

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.

Brown, Kenneth D. (Grain Valley, MO)

2008-08-05T23:59:59.000Z

285

Capturing Actor-level Dynamics of Longitudinal Networks  

Science Conference Proceedings (OSTI)

Study of the dynamics of longitudinal networks has already attracted enormous research interest. Although dynamics of networks can be captured both at network-level and node / actor-level, the latter has gained less attention in current literature. By ... Keywords: actor-level dynamics, static toopology, dynamic topology, topological analysis, longitudinal networks

Shahadat Uddin; Kon Shing Kenneth Chung; Mahendra Piraveenan

2012-08-01T23:59:59.000Z

286

WSN-inspired sleep protocols for heterogeneous LTE networks  

Science Conference Proceedings (OSTI)

The tremendous increase of the traffic demand in cellular networks imposes a massive densification of the traditional cellular infrastructure. The network architecture becomes heterogenous, in particular 4G networks where LTE micro eNodeBs are deployed ... Keywords: cellular network, energy optimization, switch off mechanisms, topology control

Iulia Tunaru, Hervé Rivano, Fabrice Valois

2013-11-01T23:59:59.000Z

287

A New Commissioning and Deployment Method for Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

Sensor networks are deployed on various environments in order to collect sensing information in many cases. It is not easy to optimize program codes of all nodes due to the environmental variety of deployment of sensor networks. Therefore, commissioning ... Keywords: sensor network, commissioning, ZigBee, network deployment

Bong Wan Kim; Seong-Soon Joo

2009-10-01T23:59:59.000Z

288

A virtual infrastructure for large-scale wireless sensor networks  

Science Conference Proceedings (OSTI)

The primary goal of a wireless sensor network is to collect useful information from the network. Most wireless sensor networks are assumed that the number of nodes are very large and they should operate with confined resources. Consequently it is important ... Keywords: Data collection, Railroad, Topology, Wireless sensor networks

Jeong-Hun Shin; Daeyeon Park

2007-10-01T23:59:59.000Z

289

Open transport switch: a software defined networking architecture for transport networks  

Science Conference Proceedings (OSTI)

There have been a lot of proposals to unify the control and management of packet and circuit networks but none have been deployed widely. In this paper, we propose a simple programmable architecture that abstracts a core transport node into a programmable ... Keywords: optical networks, otn, sdn, transport networks, virtualization

Abhinava Sadasivarao, Sharfuddin Syed, Ping Pan, Chris Liou, Andrew Lake, Chin Guok, Inder Monga

2013-08-01T23:59:59.000Z

290

Network Upgrade for the SLC: PEP II Network  

SciTech Connect

The PEP-II control system required a new network to support the system functions. This network, called CTLnet, is an FDDI/Ethernet based network using only TCP/IP protocols. An upgrade of the SLC Control System micro communications to use TCP/IP and SLCNET would allow all PEP-II control system nodes to use TCP/IP. CTLnet is private and separate from the SLAC public network. Access to nodes and control system functions is provided by multi-homed application servers with connections to both the private CTLnet and the SLAC public network. Monitoring and diagnostics are provided using a dedicated system. Future plans and current status information is included.

Crane, M.; Call, M.; Clark, S.; Coffman, F.; Himel, T.; Lahey, T.; Miller, E.; Sass, R.; /SLAC

2011-09-09T23:59:59.000Z

291

DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES  

Office of Legacy Management (LM)

//, .<.' //, .<.' I ' 1 TL\ t+, -- DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE FORMER WATERTOWN ARSENAL PROPERTY SITE 34 AND SITE 41 WATERTOWN, MASSACHUSETTS o\o\-0 G /Q e-+ a+ -? q+ mii ' ( . % QL G+ OCCUPATIONAL HEALTH AND SAFETY INViSiON Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Operated by THE UNIVERSITY O F CHICAGO for the U. S. DEPARTMENT O F ENERGY under Contract W=314 09.Eng-38 Argonne National Laboratory, with facilities in the states of Illinois and Idaho, is owned by the United States government, and operated by The University of Chicago under the provisions of a contract with the Department of Energy. r----- DISCLAIMER I This report was prepared as an account of work sponsored by an

292

DOE/EV-0005/26 ANL-OHS/HP-82-100  

Office of Legacy Management (LM)

J-L.f!~: J-L.f!~: r*' c;,:i &3&j DOE/EV-0005/26 ANL-OHS/HP-82-100 i$; ' ,\ : -ed - *' J&&&g y FORMERLY UTILIZED MED/AEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE GEORGE HERBERT JONES CHEMICAL LABORATORY THE UNIVERSITY OF CHICAGO CHICAGO, ILLINOIS June 1347, 1977 OCCUPATIONAL HEALTH AND SAFETY DIVISION Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Prepared for the U. S. DEPARTMENT OF ENERGY under Contract W -31409-Eng=38 The facilities of Argonne National Laboratory are owned by the United States Government. Under the terms of a contract (W-31-109-Eng-38) among the U. S. Department of Energy, Argonne Universities Association and The University of Chicago, the University employs the staff and operates the Laboratory in

293

Test report for run-in acceptance testing of Project W-151 300 HP mixing pumps  

SciTech Connect

This report documents the results of a performance demonstration and operational checkout of three 300 HP mixer pumps in accordance with WHC-SD-WI51-TS-001 ``Mixer Pump Test Specification for Project W-151`` and Statement of Work 8K520-EMN-95-004 ``Mixer Pump Performance Demonstration at MASF`` in the 400 Area Maintenance and Storage Facility (MASF) building. Testing of the pumps was performed by Fast Flux Test Facility (FFTF) Engineering and funded by the Tank Waste Remediation System (TWRS) Project W-151. Testing began with the first pump on 04-01-95 and ended with the third pump on 11-01-96. Prior to testing, the MASF was modified and prepared to meet the pump testing requirements set forth by the Test Specification and the Statement of Work.

Berglin, B.G.

1998-01-29T23:59:59.000Z

294

GEOGRAPHICALLY STATIC QUORUMS IN AD-HOC NETWORKS AND THEIR PERFORMANCE AS LOCATION SERVERS  

E-Print Network (OSTI)

other without being in transmission range by relaying their messages through intermediate nodes. Routing a function that maps a node's ID to its location, but whilst this is ideal when networks are static into grid-squares of different orders. Starting with the grid-square that the node currently occupies

Kent, University of

295

LARS: a locally aware reputation system for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Mobile ad hoc networks (MANETs) have nodes that are dynamically and arbitrarily located. The nodes are often battery powered and may behave selfishly to preserve power. A promising mechanism to deal with node selfishness is to use reputation methods. ... Keywords: MANET, reputation systems, selfishness, trust, virtual currency schemes

Jiangyi Hu; Mike Burmester

2006-03-01T23:59:59.000Z

296

FAWN: a fast array of wimpy nodes  

Science Conference Proceedings (OSTI)

This paper presents a fast array of wimpy nodes---FAWN---an approach for achieving low-power data-intensive data-center computing. FAWN couples low-power processors to small amounts of local flash storage, balancing computation and I/O capabilities. ...

David G. Andersen; Jason Franklin; Michael Kaminsky; Amar Phanishayee; Lawrence Tan; Vijay Vasudevan

2011-07-01T23:59:59.000Z

297

DiffServ node with join minimum cost queue policy and multiclass traffic  

Science Conference Proceedings (OSTI)

DiffServ, the vehicle for providing relative QoS in the Internet is also easily amenable to simple and effective pricing mechanisms. By pricing access to a relative QoS, we can model a DiffServ node as a 'Join Minimum Cost Queue' in which an arriving ... Keywords: diffServ, finite buffer queues, join minimum cost queue, join shortest queue, network pricing, quasi-birth--death processes, queue control

Rahul Tandra; N. Hemachandra; D. Manjunath

2004-01-01T23:59:59.000Z

298

Towards robustness and energy efficiency of cut detection in wireless sensor networks  

Science Conference Proceedings (OSTI)

Reliable, full network connectivity in wireless sensor networks (WSN) is difficult to maintain. Awareness of the state of network connectivity is similarly challenging. Harsh, unattended, low-security environments and resource-constrained nodes exacerbate ... Keywords: Network cut detection, Topology control, Wireless sensor networks

Myounggyu Won; Stephen M. George; Radu Stoleru

2011-05-01T23:59:59.000Z

299

Review: Unicast routing protocols for vehicular ad hoc networks: A critical comparison and classification  

Science Conference Proceedings (OSTI)

Vehicular Ad hoc NETworks (VANETs) allow vehicles to form a self-organized network without the need for a permanent infrastructure. As a prerequisite to communication, an efficient route between network nodes must be established, and it must adapt to ... Keywords: Inter-vehicle communication, Mobile ad hoc network, Routing, VANET, Vehicular ad hoc networks

James Bernsen; D. Manivannan

2009-02-01T23:59:59.000Z

300

Latency-sensitive power control for wireless ad-hoc networks  

Science Conference Proceedings (OSTI)

We investigate the impact of power control on latency in wireless ad-hoc networks. If transmission power is increased, interference increases, thus reducing network capacity. A node sending/relaying delay-sensitive real-time application traffic can, ... Keywords: ad-hoc networks, latency, medium access control, network connectivity, power control, wireless networks

Mohamed R. Fouad; Sonia Fahmy; Gopal Pandurangan

2005-10-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

An efficient cluster-based self-organisation algorithm for wireless sensor networks  

Science Conference Proceedings (OSTI)

The paper proposes an Efficient Cluster-based Self-organisation Algorithm (ECSA) for partitioning Wireless Sensor Networks (WSNs) into clusters, thus giving at the network a hierarchical organisation. Each sensor uses its weight ... Keywords: WSNs, cluster head, clustering algorithms, energy dissipation, homogeneous clusters, k-density, network lifetime, node weight, residual energy, self-organisation, wireless networks, wireless sensor networks

Mohamed Lehsaini; Herve Guyennet; Mohammed Feham

2010-02-01T23:59:59.000Z

302

Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network  

Science Conference Proceedings (OSTI)

The demand for maximum network lifetime in many mission-critical applications of wireless sensor networks motivates the great significance to deploy as few sensors as possible to achieve the expected network performance. In this paper, we first characterize ... Keywords: Adjustable transmission range, Energy-hole, Network lifetime, Node deployment, Wireless sensor network

Anfeng Liu; Xin Jin; Guohua Cui; Zhigang Chen

2013-05-01T23:59:59.000Z

303

No. 7 Signaling Network Configuration for Interworking Between B-ISDN and N-ISDN  

Science Conference Proceedings (OSTI)

Abstract: No.7 Signaling is used to transfer signaling and control information between network nodes in ISDN, Intelligent Network and Mobile Network. It is also used ATM-based B-ISDN signaling network. In the beginning of B-ISDN, broadband network services ...

Hwa-Suk Kim; Yun-Young An; Woo-Seop Rhee

1998-01-01T23:59:59.000Z

304

A new architectural approach for optical burst switching networks based on a common control channel  

Science Conference Proceedings (OSTI)

The new architectural approach to Optical Burst Switching networks presented here features a common control channel and a node locally maintained network model. The Common Control Channel allows for a fast and efficient broadcast of the network Control ... Keywords: Optical burst switched networks, Optical network architecture

Nuno M. Garcia; Paulo P. Monteiro; MáRio M. Freire; José R. Santos; Przemyslaw Lenkiewicz

2007-11-01T23:59:59.000Z

305

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

E-Print Network (OSTI)

for Computational Engineering and Sciences (ICES), The University of Texas at Austin, Austin, TX 78712, United States b Department of Petroleum and Geosystems Engineering, The University of Texas at Austin, Austin singularities. The goal-oriented refinement strategy is an extension of a fully automatic, energy-norm based, hp

Torres-VerdĂ­n, Carlos

306

An algorithm for transferring 2D arbitrary hp-refined finite element axially symmetric meshes to three dimensions  

E-Print Network (OSTI)

of Petroleum Engineering, The University of Texas in Austin (3) Institute for Computational Engineering and Sciences, ICES, The University of Texas in Austin Abstract The 2D and 3D fully automatic hp adaptive Finite is solved on the coarse and on the fine mesh. The energy norm (H1 Sobolev space norm) difference between

Torres-VerdĂ­n, Carlos

307

Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version)  

Science Conference Proceedings (OSTI)

We consider a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing. This type of routing takes advantage of the mobility and the storage capacity of the nodes, called the relay ... Keywords: Delay tolerant network, Limited packet lifetime, Mobile ad hoc network, Mobility model, Performance analysis, Two-hop relay protocol

Ahmad Al Hanbali; Philippe Nain; Eitan Altman

2008-06-01T23:59:59.000Z

308

Routing Technique Based on Clustering for Data Duplication Prevention in Wireless Sensor Network  

E-Print Network (OSTI)

Wireless Sensor Networks is important to nodes energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes, sensor networks routing technique is divided by flat routing and hierarchical routing technique. Specially, hierarchical routing technique is energy efficient routing protocol to pare down energy consumption of whole sensor nodes and to scatter energy consumption of sensor nodes by forming cluster and communicating with cluster head. but though hierarchical routing technique based on clustering is advantage more than flat routing technique, this is not used for reason that is not realistic. The reason that is not realistic is because hierarchical routing technique does not consider data transmission radius of sensor node in actually. so this paper propose realistic routing technique base on clustering.

Kim, Boseung; Shin, Yongtae

2009-01-01T23:59:59.000Z

309

Capacity of Fading Gaussian Channel with an Energy Harvesting Sensor Node  

E-Print Network (OSTI)

Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over a fading AWGN channel with perfect/no channel state information provided at the transmitter. We also obtain the capacity with a finite energy buffer via Markov decision theory.

Rajesh, R

2010-01-01T23:59:59.000Z

310

Energy-efficient space-time coded cooperative routing in multihop wireless networks  

Science Conference Proceedings (OSTI)

Due to the limited energy supplies of nodes in many applications like wireless sensor networks, energy efficiency is crucial for extending the lifetime of these networks. This paper addresses the routing problem for outage-restricted multihop wireless ...

Behrouz Maham; Ravi Narasimhan; Are Hjřrungnes

2009-11-01T23:59:59.000Z

311

Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas  

E-Print Network (OSTI)

Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, nodes with multiple radios, and point-to-point ...

Dutta, Partha

312

Scheduling algorithms for throughput maximization in time-varying networks with reconfiguration delays  

E-Print Network (OSTI)

We consider the control of possibly time-varying wireless networks under reconfiguration delays. Reconfiguration delay is the time it takes to switch network resources from one subset of nodes to another and it is a ...

Celik, Guner Dincer

2012-01-01T23:59:59.000Z

313

Hypothesizing about causal networks with positive and negative effects by meta-level abduction  

Science Conference Proceedings (OSTI)

Meta-level abduction discovers missing links and unknown nodes from incomplete networks to complete paths for observations. In this work, we extend applicability of meta-level abduction to deal with networks containing both positive and negative causal ...

Katsumi Inoue; Andrei Doncescu; Hidetomo Nabeshima

2010-06-01T23:59:59.000Z

314

Multi-hop routing is order-optimal in underwater extended networks  

E-Print Network (OSTI)

Capacity scaling laws are analyzed in an underwater acoustic network with n regularly located nodes. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we ...

Shin, Won-Yong

315

Achieving True Video-on-Demand Service in Multi-Hop WiMax Mesh Networks  

E-Print Network (OSTI)

Mesh Network Configuration (MSH-NCFG) messages. Each MSH-NCFG message contains a Network Descriptor by listening to MSH-NCFG messages. From all the possible neighboring nodes that advertise MSH-NCFG messages

Hua, Kien A.

316

Energy efficient sensor network implementations  

Science Conference Proceedings (OSTI)

In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, sleep(wake-up), data acquisition, data processing modes using low power, high performance embedded technology such as specialized embedded DSP processors and a low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm) as a case study. We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.

Frigo, Janette R [Los Alamos National Laboratory; Raby, Eric Y [Los Alamos National Laboratory; Brennan, Sean M [Los Alamos National Laboratory; Kulathumani, Vinod [WEST VIRGINIA UNIV.; Rosten, Ed [CAMBRIDGE UNIV.; Wolinski, Christophe [IRISA; Wagner, Charles [IRISA; Charot, Francois [IRISA

2009-01-01T23:59:59.000Z

317

Throughput and delay analysis for hybrid radio-frequency and free-space-optical (RF/FSO) networks  

Science Conference Proceedings (OSTI)

In this paper the per-node throughput and end-to-end delay of randomly deployed (i.e. ad-hoc) hybrid radio frequency - free space optics (RF/FSO) networks are studied. The hybrid RF/FSO network consists of an RF ad hoc network of n nodes, f(n) ... Keywords: Ad hoc networks, Delay, Free space optics, Hybrid networks, Throughput capacity

Di Wang; Alhussein A. Abouzeid

2011-05-01T23:59:59.000Z

318

Efficient code distribution in wireless sensor networks  

Science Conference Proceedings (OSTI)

The need to reprogramme a wireless sensor network may arise from changing application requirements, bug fixes, or during the application development cycle. Once deployed, it will be impractical at best to reach each individual node. Thus, a scheme is ... Keywords: code distribution, compression, reprogramming, sensor networks, string distance, wireless

Niels Reijers; Koen Langendoen

2003-09-01T23:59:59.000Z

319

A virtual environment for network testing  

Science Conference Proceedings (OSTI)

The testing of network-based solutions demands a series of tedious tasks such as the deployment of the solution at different nodes and the configuration of different topologies. The manual execution of these tasks is very time consuming and a configurable ... Keywords: Re-configuration, Software testing, Virtual network

Wade A. Fagen; Joăo W. Cangussu; Ram Dantu

2009-01-01T23:59:59.000Z

320

Dual wakeup design for wireless sensor networks  

Science Conference Proceedings (OSTI)

Energy is often identified as the single most important resource in wireless battery-powered sensor networks. While current wakeup schemes in the literature promise to conserve energy in such networks, they apply several assumptions that may not be always ... Keywords: Cyclic block design, Dual wakeup design, Energy conservation, Lonely node, Time-tolerance sensing

Y. F. Wong; L. H. Ngoh; Winston K. G. Seah; Wai-Choong Wong

2009-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

Deterministic Secure Positioning in Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

Position verification problem is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location information in ... Keywords: Distributed Protocol, Secure Positioning, Wireless Sensor Network

Sylvie Delaët; Partha Sarathi Mandal; Mariusz A. Rokicki; Sébastien Tixeuil

2008-06-01T23:59:59.000Z

322

ACT4: Networked Aquatic Sampling System  

E-Print Network (OSTI)

system for field operation • Wireless 802.11b based networkOperation • Continuous real time data acquisition and logging of pertinent environmental parameters • WirelessOperation • Network of 10 static nodes and 1 robotic boat • AODV based ad-hoc 802.11b wireless

2005-01-01T23:59:59.000Z

323

FLOP Counts for Single-Node Tests  

NLE Websites -- All DOE Office Websites (Extended Search)

FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests These data, obtained using the NERSC Hopper system, are provided for reference. Code MPI Tasks Threads Reference TFLOP Count Benchmark Time (seconds) # of iterations miniFE 144 1 5.05435E+12 130.2 (total program time) miniGhost 96 1 6.55500E+12 76.5 AMG 96 1 1.30418E+12 66.95 18 UMT 96 1 1.30211E+13 416.99 49 SNAP 96 1 5.84246E+11 15.37 3059 miniDFT 40 1 2.32379E+13 153.97 GTC 64 1 6.63670E+13 1839.4 MILC 24 1 1.45971E+13 744.3 CORRECTION (02 August 2013): The values given for the reference counts are FLOPs, not TFLOPs. Last edited: 2013-08-02 09:40:18

324

OBSERVATIONS AND ANALYSES OF THE ECCENTRIC ORBIT ECLIPSING BINARY HP DRACONIS  

Science Conference Proceedings (OSTI)

We present results of an analysis of all available data of the double-lined spectroscopic and eclipsing binary HP Draconis. The analyses make use of unpublished radial velocity (RV) and extensive photoelectric photometry data as well as published Hipparcos photometric observations and RV data from Asiago Observatory. The system is eccentric and the current analyses suggest apsidal motion to be present only weakly, but a significant amount of third light is found in all three passbands, B, V, and hip. Relatively high precision has been achieved for the mass and radius among the absolute parameters with fractional error of 0.95% or better: M{sub 1,2} = 1.133 {+-} 0.005, 1.094 {+-} 0.007 M{sub sun}; R{sub 1,2} = 1.371 {+-} 0.012, 1.052 {+-} 0.010 R{sub sun}. Other derived parameters are P = 10.76152 {+-} 0.00019 days, a = 26.79 {+-} 0.04 R{sub sun}, e = 0.0367 {+-} 0.0009, {omega} = 0.693 {+-} 0.037, q = 0.966 {+-} 004, and {Delta}T = 105 {+-} 5 K. We derive a distance to the system of 77 {+-} 3 pc. Comparison with Padova theoretical models for different chemical compositions suggests that the components may be of solar age and roughly solar composition, with the primary component less than half as dense as the secondary component and slightly evolved off the zero-age main sequence.

Milone, E. F. [Physics and Astronomy Department, University of Calgary, Calgary, AB T2N 1N4 (Canada); Kurpinska-Winiarska, M. [Cracow Astronomical Observatory, Cracow (Poland); Oblak, E., E-mail: milone@ucalgary.c, E-mail: kurpin@oa.uj.edu.p, E-mail: ed.oblak@sfr.f [Observatoire de Besancon, UTINAM Institut-UMR CNRS 6213, Besancon (France)

2010-07-15T23:59:59.000Z

325

Evaluation of body sensor network platforms: a design space and benchmarking analysis  

Science Conference Proceedings (OSTI)

Body Sensor Networks (BSNs) consist of sensor nodes deployed on the human body for health monitoring. Each sensor node is implemented by interfacing a physiological sensor with a sensor platform consisting of components such as microcontroller, radio ... Keywords: benchmark, body sensor networks, design space, hardware systems, system performance, wearable BSNs

Sidharth Nabar; Ayan Banerjee; Sandeep K. S. Gupta; Radha Poovendran

2010-10-01T23:59:59.000Z

326

Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems  

Science Conference Proceedings (OSTI)

Network problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of node-node pair demands. Benders decomposition methods, based on the idea of partitioning of the initial ... Keywords: Benders decomposition, Fixed-charge network problem, Mixed integer programming, Refinery, Scheduling of crude oil, Valid inequalities

Georgios K. D. Saharidis; Maria Boile; Sotiris Theofanis

2011-06-01T23:59:59.000Z

327

A zone-based clustering method for ubiquitous robots based on wireless sensor networks  

Science Conference Proceedings (OSTI)

In this paper, we propose a topology configuration method for wireless sensor networks with an objective of well balancing energy consumption over all sensor nodes without generating any isolated sensor nodes. Our scheme has some attractive features: ... Keywords: clustering, routing, ubiquitous robots, wireless sensor network

Kyungmi Kim; Hyunsook Kim; Young Choi; Sukgyu Lee; Kijun Han

2006-10-01T23:59:59.000Z

328

Flow Allocation Model and Algorithm Based on Multi-target Coal Transportation Network  

Science Conference Proceedings (OSTI)

Coal transportation network consists of multiple logistics nodes and transportation paths. As the node capacity and cost factors is limited, its flow distribution is a multi-target and multi-constraint problem. Through the use of multi-target planning ... Keywords: flow allocation, model, algorithm, multi-target, coal transportation network

Tingting Zhu; Tianjun Hu; Xifu Wang; Yalong Zhao

2012-04-01T23:59:59.000Z

329

SmartGossip: an improved randomized broadcast protocol for sensor networks  

Science Conference Proceedings (OSTI)

We investigate four performance metrics for randomized broadcast protocols on sensor networks: the fraction of nodes that receive the message (coverage), the number of first-time receivers per transmission (energy efficiency), the node-average normalized ... Keywords: SmartGossip, performance analysis, randomized protocols, sensor networks

Ananth V. Kini; Vilas Veeraraghavan; Nikhil Singhal; Steven Weber

2006-04-01T23:59:59.000Z

330

A scalable load-balancing scheme for advanced metering infrastructure network  

Science Conference Proceedings (OSTI)

The advanced metering infrastructure (AMI) network based on wireless mesh network (WMN) is composed of smart meters (SMs), relay nodes, and data aggregation points (DAPs). Relay nodes deliver metering data sent by SMs to DAPs that forwards the data to ... Keywords: advanced metering infrastructure (AMI), load balancing, route flap problem

Jeasung Park; Yujin Lim; Seung-Jin Moon; Hong-Kyu Kim

2012-10-01T23:59:59.000Z

331

Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

We consider large-scale networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy ...

Salah A. Aly; Zhenning Kong; Emina Soljanin

2008-04-01T23:59:59.000Z

332

On improving the representation of a region achieved by a sensor network  

Science Conference Proceedings (OSTI)

This paper considers the class of applications of sensor networks in which each sensor node makes measurements, such as temperature or humidity, at the precise location of the node. Such spot-sensing applications approximate the physical condition of ... Keywords: Coverage, Lifetime, Representation error, Sensor networks, Spatial uniformity

Xiaoyu Chu; Harish Sethu

2012-05-01T23:59:59.000Z

333

Prefix-based node numbering for temporal XML  

Science Conference Proceedings (OSTI)

Prefix-based numbering (also called Dewey numbering, Dewey level order, or dynamic level numbering) is a popular method for numbering nodes in an XML data model instance. The nodes are numbered so that spatial relationships (e.g., is a node a descendant ... Keywords: Dewey numbering, XML, prefix-based numbering, temporal, versioning

Curtis E. Dyreson; Kalyan G. Mekala

2011-10-01T23:59:59.000Z

334

Computationally Simple Battery Management Techniques for Wireless Nodes  

E-Print Network (OSTI)

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

Sarkar, Saswati

335

Minimum power allocation for cooperative routing in multihop wireless networks  

Science Conference Proceedings (OSTI)

Due to the limited energy supplies of nodes, in many applications like wireless sensor networks, energy-efficiency is crucial for extending the lifetime of these networks. We study the routing problem for multihop wireless ad hoc networks based on cooperative ...

Behrouz Maham; Are Hjřrungnes

2009-03-01T23:59:59.000Z

336

Improving broadcast efficiency in wireless sensor network time synchronization protocols  

Science Conference Proceedings (OSTI)

In this work we proposed an algorithm to allow nodes in a wireless sensor network to interconnect in a way such that time stamp information can be efficiently distributed for network wide synchronization. The algorithm works by first establishing a level ... Keywords: broadcast optimization, sensor networks, time synchronization

Wenxun Huang; Yujuan Quan; Deming Chen

2012-06-01T23:59:59.000Z

337

Energy-efficient broadcasting in all-wireless networks  

Science Conference Proceedings (OSTI)

In all-wireless networks, minimizing energy consumption is crucial as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of radio transmissions can be ... Keywords: approximation algorithms, complexity theory, energy efficiency, minimum-energy networks, wireless ad hoc networks

Mario ?agalj; Jean-Pierre Hubaux; Christian C. Enz

2005-01-01T23:59:59.000Z

338

A new characterization of probabilities in Bayesian networks  

Science Conference Proceedings (OSTI)

We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-NOT networks, and viewing the subnetworks that lead to a node as arguments ...

Lenhart K. Schubert

2004-07-01T23:59:59.000Z

339

Maximizing Battery Life Routing in Wireless Ad Hoc Networks  

E-Print Network (OSTI)

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

Liang, Weifa

340

Lossy Data Aggregation in Multihop Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

In wireless sensor networks, in-network data aggregation is an efficient way to reduce energy consumption in network. However, most of the existing data aggregation scheduling methods try to aggregate the data from all the nodes at all time-instances. ... Keywords: Data Loss, Data Sampling, Energy Efficiency, Lossy Data Aggregation

Guojun Dai; Jianhui Zhang; Shaojie Tang; Xingfa Shen; Changping Lv

2009-12-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

Hybrid trust and reputation management for sensor networks  

Science Conference Proceedings (OSTI)

Wireless sensor networks are characterised by the distributed nature of their operation and the resource constraints on the nodes. Trust management schemes that are targeted at sensor networks need to be lightweight in terms of computational and communication ... Keywords: Reputation management, Sensor networks, Trust establishment

Efthimia Aivaloglou; Stefanos Gritzalis

2010-07-01T23:59:59.000Z

342

Data aggregation in wireless sensor networks using ant colony algorithm  

Science Conference Proceedings (OSTI)

Data aggregation is important in energy constraint wireless sensor networks which exploits correlated sensing data and aggregates at the intermediate nodes to reduce the number of messages exchanged network. This paper considers the problem of constructing ... Keywords: Ant colony, Data aggregation, Wireless sensor networks

Wen-Hwa Liao; Yucheng Kao; Chien-Ming Fan

2008-11-01T23:59:59.000Z

343

An efficient and secure protocol for sensor network time synchronization  

Science Conference Proceedings (OSTI)

The emerging field of wireless sensor networks offers countless possibilities for achieving large scale monitoring in a distributed environment. These networks of resource constrained nodes require time synchronization for various distributed operations, ... Keywords: cross-layer control, passive participation, sensor networks, tempest, time synchronization

Emerson Farrugia; Robert Simon

2006-02-01T23:59:59.000Z

344

Analyzing localization errors in one-dimensional sensor networks  

Science Conference Proceedings (OSTI)

One-dimensional sensor networks can be found in many fields and demand node location information for various applications. Developing localization algorithms in one-dimensional sensor networks is trivial, due to the fact that existing localization algorithms ... Keywords: Cramér-Rao lower bound, Error propagation, Estimation errors, Localization, One-dimensional sensor networks

Baoqi Huang; Changbin Yu; Brian D. O. Anderson

2012-02-01T23:59:59.000Z

345

Routing in sparse splitting optical networks with multicast traffic  

Science Conference Proceedings (OSTI)

In this paper, we investigate the problem of Multicast Routing in Sparse Splitting Networks (MR-SSN). Given a network topology with the multicast capable nodes distributed uniformly throughout the network, and a multicast session, the MR-SSN problem ... Keywords: Steiner tree, Tabu search, light splitting, multicast, power issues

Shuguang Yan; Jitender S. Deogun; Maher Ali

2003-01-01T23:59:59.000Z

346

Task-oriented Distributed Information Fusion in Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

A wireless sensor network may form a part of the base for cloud computing through Internet. We present a framework of task-oriented distributed data fusion, and investigate the assignments of heterogeneous sensors on nodes in the network for a specified ... Keywords: Distributed Decision Making, Linguistic Decision Trees, Network Hierarchy, Optimal sensor assignments

Hongmei He; Zhenhuan Zhu; Erkki Makinen

2012-08-01T23:59:59.000Z

347

A new clustering scheme for wireless sensor networks  

Science Conference Proceedings (OSTI)

Energy consumption has always been the most serious issue to consider while deploying Wireless Sensor Networks (WSNs). Sensor nodes are limited in power, computational capacities and memory so reporting the occurring of specific events, such as fire ... Keywords: Opnet simulator, PMM, WSNs, cluster, event, mobile sink, sensor node model

Hajar Mousannif; Said Rakrak; Hassan Al Moatassime

2010-11-01T23:59:59.000Z

348

FAIR: Fee Arbitrated Incentive Architecture in Wireless Ad Hoc Networks  

E-Print Network (OSTI)

the average price in the estimation table for all destinations. It periodically calculates the trend mechanisms to configure itself to the changing demands of the nodes, users, and network conditions. Price, leading to potentially selfish behavior. In fact, given that node's resources (energy, processor

Li, Baochun

349

Lymph node clearance of plutonium from subcutaneous wounds in beagles  

SciTech Connect

The lymph node clearance of /sup 239/Pu O/sub 2/ administered as insoluble particles from subcutaneous implants was studied in adult beagles to simulate accidental contamination of hand wounds. External scintillation data were collected from the popliteal lymph nodes of each dog after 9.2 to 39.4 mu Ci of plutonium oxide was subcutaneously implanted into the left or right hind paws. The left hind paw was armputated 4 weeks after implantation to prevent continued deposition of plutonium oxide particles in the left popliteal lymph node. Groups of 3 dogs were sacrificed 4, 8, 16, and 32 weeks after plutonium implantation for histopathologic, electron microscopic, and radiochemical analysis of regional lymph nodes. An additional group of dogs received treatment with the chelating agent diethyenetriaminepentaacetic acid (DTPA). Plutonium rapidly accumulated in the popliteal lymph nodes after subcutaneous injection into the hind paw, and 1 to 10% of the implant dose was present in the popliteal lymph nodes at the time of necropsy. Histopathologic changes in the popliteal lymph nodes with plutonium particles were characterized primarily by reticular cell hyperplasia, increased numbers of macrophages, necrosis, and fibroplasia. Eventually, the plutonium particles became sequestered by scar tissue that often replaced the entire architecture of the lymph node. Light microscopic autoradiographs of the popliteal lymph nodes showed a time-related increase in number of alpha tracks per plutonium source. Electron microscopy showed that the plutonium particles were aggregated in phagolysosomes of macrophages. There was slight clearance of plutonium from the popliteal lymph nodes of dogs monitored for 32 weeks. The clearance of plutonium particles from the popliteal lymph nodes was associated with necrosis of macrophages. The external iliac lymph nodes contained fewer plutonium particles than the popliteal lymph nodes and histopathologic changes were less severe. The superficial inguinal lymph nodes of one dog contained appreciable amounts of plutonium. Treatment with diethylenetriaminepentaacetic acid (DTPA) did not have a measurable effect on the clearance of plutonium from the popliteal lymph nodes. (60 references) (auth)

Dagle, G.E.

1973-08-01T23:59:59.000Z

350

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks  

Science Conference Proceedings (OSTI)

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.

Lin, Ying [University of Tennessee, Knoxville (UTK); Wu, Qishi [ORNL; Zhu, Mengxia [ORNL; Rao, Nageswara S [ORNL

2009-04-01T23:59:59.000Z

351

On the design of a novel two-objective harmony search approach for distance- and connectivity-based localization in wireless sensor networks  

Science Conference Proceedings (OSTI)

In several wireless sensor network applications the availability of accurate nodes' location information is essential to make collected data meaningful. In this context, estimating the positions of all unknown-located nodes of the network based on noisy ... Keywords: Flip ambiguity, Harmony Search, Localization, Multi-objective, Wireless Sensor Networks

Diana Manjarres; Javier Del Ser; Sergio Gil-Lopez; Massimo Vecchio; Itziar Landa-Torres; Sancho Salcedo-Sanz; Roberto Lopez-Valcarce

2013-02-01T23:59:59.000Z

352

Candidate sets for alternative routes in road networks  

Science Conference Proceedings (OSTI)

We present a fast algorithm with preprocessing for computing multiple good alternative routes in road networks. Our approach is based on single via node routing on top of Contraction Hierarchies and achieves superior quality and efficiency compared to ...

Dennis Luxen; Dennis Schieferdecker

2012-06-01T23:59:59.000Z

353

Cooperative game-based routing approach for wireless sensor network  

Science Conference Proceedings (OSTI)

Aiming at the security and limited energy issues in wireless sensor network, this paper introduces a secure and energy-saving routing protocol based on cooperative game strategy. A novel incentive mechanism is proposed: all the nodes including the selfish ...

Fengyun Li; Guiran Chang; Lan Yao; Fuxiang Gao

2012-08-01T23:59:59.000Z

354

Opportunistic routing in multi-hop wireless networks  

E-Print Network (OSTI)

This thesis describes ExOR, an integrated routing and MAC protocol for bulk transfers in multi-hop wireless networks. ExOR exploits the broadcast nature of radios by making forwarding decisions based on which nodes receive ...

Biswas, Sanjit Zubin

2005-01-01T23:59:59.000Z

355

Typhoon: a reliable data dissemination protocol for wireless sensor networks  

Science Conference Proceedings (OSTI)

We present Typhoon, a protocol designed to reliably deliver large objects to all the nodes of a wireless sensor network (WSN). Typhoon uses a combination of spatially-tuned timers, prompt retransmissions, and frequency diversity to reduce contention ...

Chieh-Jan Mike Liang; R?zvan Mus?loiu-E.; Andreas Terzis

2008-01-01T23:59:59.000Z

356

ESF: an efficient security framework for wireless sensor network  

Science Conference Proceedings (OSTI)

A wireless sensor network WSN consists of a large number of resource constrained sensor nodes, usually deployed in hostile environments, where they face a variety of malicious attacks. To address the security vulnerabilities in WSN, this paper proposes ...

Somanath Tripathy

2013-02-01T23:59:59.000Z

357

Information-theoretic limits of dense underwater networks  

E-Print Network (OSTI)

Information-theoretic throughput scaling laws are analyzed in an underwater acoustic network with n regularly located nodes on a unit square, in which both bandwidth and received signal power can be severely limited. A ...

Shin, Won-Yong

358

Lifetime benefits through load balancing in homogeneous sensor networks  

Science Conference Proceedings (OSTI)

In routing protocols for wireless sensor networks energy efficiency is of paramount importance. Reliability-oriented protocols discard lossy links to avoid the significant energy cost of packet loss. The downside is that nodes with a particularly favorable ...

Daniele Puccinelli; Martin Haenggi

2009-04-01T23:59:59.000Z

359

Wireless sensor networks for structural and environmental monitoring  

Science Conference Proceedings (OSTI)

The article discusses various applications of Wireless Sensor Networks (WNS) in environment and civil engineering constructions monitoring with a particular emphasis on the evaluation of the influence of individual node failures on the operation of the ...

Igor Dunajewski

2008-01-01T23:59:59.000Z

360

ROPE: robust position estimation in wireless sensor networks  

Science Conference Proceedings (OSTI)

We address the problem of secure location determination, known as Secure Localization, and the problem of verifying the location claim of a node, known as Location Verification, in Wireless Sensor Networks (WSN). We propose a robust positioning ...

Loukas Lazos; Radha Poovendran; Srdjan ?apkun

2005-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Network support for system initiated checkpoints  

SciTech Connect

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.

Chen, Dong; Heidelberger, Philip

2013-01-29T23:59:59.000Z

362

Transmitting and gathering streaming data in wireless multimedia sensor networks within expected network lifetime  

Science Conference Proceedings (OSTI)

Using multimedia sensor nodes in wireless sensor networks (WSNs) can significantly enhance the capability of WSNs for event description. Different kinds of holes can easily appear in WSNs. How to efficiently transmit multi-media streaming data and bypass ... Keywords: cross layer design, geographical multipath routing, wireless multimedia sensor networks

Lei Shu; Yan Zhang; Zhangbing Zhou; Manfred Hauswirth; Zhiwen Yu; Gearoid Hynes

2008-08-01T23:59:59.000Z

363

Author manuscript, published in "ChinaCom2008, Chine (2008)" Energy-Efficient Cooperative Routing in BER Constrained Multihop Networks  

E-Print Network (OSTI)

Abstract — Due to the limited energy supplies of nodes, in many applications like wireless sensor networks energy-efficiency is crucial for extending the lifetime of these networks. We study the routing problem for multihop wireless ad hoc networks based on cooperative transmission. The source node wants to transmit messages to a single destination. Other nodes in the network may operate as relay nodes. In this paper, we propose a cooperative multihop routing for the purpose of power savings, constrained on a required bit error rate (BER) at the destination. We derive analytical results for line network topology. It is shown that energy savings of 100 % are achievable in line networks with a large number of nodes for BER = 10 ?4 constraint at the destination. I.

Behrouz Maham; Mérouane Debbah; Are Hjřrungnes

2009-01-01T23:59:59.000Z

364

Social network support for data delivery infrastructures  

E-Print Network (OSTI)

if communication between such nodes represents the common case usage of a given PSN, it is less interesting because nodes which need to communicate often could likely organise their contacts to meet directly. The need for PSN support is greater when the nodes... its effect on the pathway. 1.2.3 Case Studies Chapter 3 and Chapter 4 give a detailed and self-contained account of how social network support can address the problems posed in §1.1. Here we give a brief overview of the two case studies in the light...

Sastry, Nishanth Ramakrishna

2011-10-11T23:59:59.000Z

365

Design and simulation on data-forwarding security in sensor networks  

Science Conference Proceedings (OSTI)

Wireless sensor networks are the emerging information technology for monitoring equipment and ambient conditions of production lines in modern factories. A salient feature of wireless sensor networks is that nodes can relay sensing data to a factory ... Keywords: SQF, WSNs, energy consumption, industrial security, modelling, network security, packet delivery latency, reliability, routing, secure quasimultipath forwarding, wireless sensor networks

Men Long; Chwan-Hwa 'John' Wu

2009-10-01T23:59:59.000Z

366

Implementation of end-to-end abstractions in a network service architecture  

Science Conference Proceedings (OSTI)

To support the increasing diversity of systems and protocols in the Internet, modern routers offer a variety of data path processing functions. Such "network services" are easy to implement on a single node, but a network-wide deployment is difficult. ... Keywords: data path service, network architecture, network socket, next-generation internet

Shashank Shanbhag; Tilman Wolf

2008-12-01T23:59:59.000Z

367

An optimization framework for the energy management of carrier ethernet networks with Multiple Spanning Trees  

Science Conference Proceedings (OSTI)

We propose an energy management framework to optimize the energy consumption of networks using the Multiple Spanning Tree Protocol such as Carrier Grade Ethernet networks. The objective is to minimize the energy consumption of nodes and links while considering ... Keywords: Carrier Grade Ethernet, Green networking, Network design, Routing optimization, Spanning Trees, Traffic engineering

Antonio Capone; Daniele Corti; Luca Gianoli; Brunilde Sansó

2012-11-01T23:59:59.000Z

368

GPSDTN: Predictive Velocity-Enabled Delay-Tolerant Networks for Arctic Research and Sustainability  

Science Conference Proceedings (OSTI)

A Delay-Tolerant Network (DTN) is a necessity for communication nodes that may need to wait for long periods to form networks. The IETF Delay Tolerant Network Research Group is developing protocols to enable such networks for a broad variety of Earth ...

R. Beck; K. Hinkel; W. Eisner; L. Liu; Jacob Norda; Ngoc Hoang; Kevin Fall; Jiang Li; Moses Garuba; Richard Machida; Steve Smith; S. Burleigh; L. Torgerson; A. Hooke; Robert Bulger; Glenn Sheehan; Ben Ellis; Robert Durst; Avri Doria; Maria Uden; James Ferl; D. Pleva; W. Ivancic; P. Paulsen; Ward Bathrick; G. Parr; C. Peoples; B. Scotney; A. Moore; Charles Lambert; Steven Groves; Christopher Small; Lawrence Freudinger; Jason LeBrun; Marc Seibert; Andrew Maffei

2007-07-01T23:59:59.000Z

369

Position-based cluster routing protocol for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Some of the proposed mobile ad hoc network routing algorithms require maintaining a global network state at each node. The global state is always an approximation of the current network state due to the non-negligible delay of propagating local state. ... Keywords: GPS, QoS, mobile ad hoc network, multicasting, position-based routing protocol

Chao-Cheng Shih; Tzay-Farn Shih

2006-07-01T23:59:59.000Z

370

Networks, smart grids: new model for synchronization  

NLE Websites -- All DOE Office Websites (Extended Search)

Stories » Stories » Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Researchers developed a surprisingly simple mathematical model that accurately predicts synchronization as a function of the parameters and the topology of the underlying network. May 21, 2013 High voltage transmission lines carry electrical power. High voltage transmission lines carry electrical power. The researchers envision that their method could be applied to assess synchronization and robustness quickly in electrical grids under volatile operating conditions. Networks of individual oscillating nodes often spontaneously synchronize and begin to oscillate at a coherent frequency. From heart cells to flashing fireflies to electric power grids, coupled oscillator networks are

371

Performance Analysis of Potassium Heat Pipes Radiator for HP-STMCs Space Reactor Power System  

SciTech Connect

A detailed design and performance results of C-C finned, and armored potassium heat pipes radiator for a 110 kWe Heat Pipes-Segmented Thermoelectric Module Converters (HP-STMCs) Space Reactor Power system (SRPS) are presented. The radiator consists of two sections; each serves an equal number of STMCs and has 162 longitudinal potassium heat pipes with 0.508 mm thick C-C fins. The width of the C-C fins at the minor diameter of the radiator is almost zero, but increases with distance along the radiator to reach 3.7 cm at the radiator's major diameter. The radiator's heat pipes (OD = 2.42 cm in front and 3.03 cm in rear) have thin titanium (0.0762 mm thick) liners and wicks (0.20 mm thick with an effective pore radius of 12-16 {mu}m) and a 1.016 mm thick C-C wall. The wick is separated from the titanium liner by a 0.4 mm annulus filled with liquid potassium to increase the capillary limit. The outer surfaces of the heat pipes in the front and rear sections of the radiator are protected with a C-C armor that is 2.17 mm and 1.70 mm thick, respectively. The inside surface of the heat pipes in the front radiator is thermally insulated while the C-C finned condensers of the rear heat pipes are exposed, radiating into space through the rear opening of the radiator cavity. The heat pipes in both the front and the rear radiators have a 1.5 m long evaporator section and each dissipates 4.47 kW while operating at 43.6% of the prevailing sonic limit. The front and rear radiator sections are 5.29 m and 2.61 m long with outer surface area and mass of 47.1 m2 and 314.3 kg, and 39.9 m2 and 243.2 kg, respectively. The total radiator is 7.63 m long and has minor and major diameters of 1.48 m and 5.57 m, respectively, and a total surface area of 87 m2; however, the effective radiator area, after accounting for heat rejection through the rear of the radiator cavity, is 98.8 m2. The radiator's total mass including the C-C armor is 557.5 kg and the specific area and specific mass are 6.41 kg/m2 and 5.07 kg/kWe, respectively.

El-Genk, Mohamed S.; Tournier, Jean-Michel [Institute for Space and Nuclear Power Studies, University of New Mexico, Albuquerque, NM, 87131 (United States); Chemical and Nuclear Engineering Dept., University of New Mexico, Albuquerque, NM, 87131 (United States)

2004-02-04T23:59:59.000Z

372

Next Generation Natural Gas Vehicle Program Phase I: Clean Air Partners 0.5 g/hp-h NOx Engine Concept; Final Report  

DOE Green Energy (OSTI)

Subcontractor report details work done by Clean Air Partners to develop 0.5 g/hp-h NOx natural gas engine exhaust gas recirculation (EGR) technology for the Next Generation Natural Gas Vehicle Program.

Wong, H. C.

2003-07-01T23:59:59.000Z

373

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

E-Print Network (OSTI)

Connectivity in sensor networks is an important metric that describes the capability of networks to be able to report sensed information. The ability of member nodes to communicate with each other and collectively report data largely depends on connectivity. Density of node deployment, the transmission radius of the antenna and the communication paradigm employed has a significant effect on connectivity. A network deployment is said to be connected when every node within the network is capable of communicating, either via multi-hops or direct links to every other node in the network. This is a very strict connectivity requirement called 100% connectivity. This work deals with analyzing connectivity in various randomly deployed sensor network deployments and comparing metrics between omni and hybrid uni/omni-directional sensor networks. Specific results will be presented with varying 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 results on k-connectivity, which is a metric that represents network availability, along with the dependence on transmission radii, node densities and uni-directional antenna beam width.

Kwon, Ji Heon

2008-05-27T23:59:59.000Z

374

Interference-Aware Fair Rate Control in Wireless Sensor Networks  

E-Print Network (OSTI)

In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dynamically allocate fair and efficient transmission rates to each node? Our interference-aware fair rate control (IFRC) detects incipient congestion at a node by monitoring the average queue length, communicates congestion state to exactly the set of potential interferers using a novel low-overhead congestion sharing mechanism, and converges to a fair and efficient rate using an AIMD control law. We evaluate IFRC extensively on a 40-node wireless sensor network testbed. IFRC achieves a fair and efficient rate allocation that is within 20- 40% of the optimal fair rate allocation on some network topologies. Its rate adaptation mechanism is highly effective: we did not observe a single instance of queue overflow in our many experiments. Finally, IFRC can be extended easily to support situations where only a subset of the nodes transmit, where the network has multiple base stations, or where nodes are assigned different transmission weights.In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dynamically allocate fair and efficient transmission rates to each node? Our interference-aware fair rate control (IFRC) detects incipient congestion at a node by monitoring the average queue length, communicates congestion state to exactly the set of potential interferers using a novel low-overhead congestion sharing mechanism, and converges to a fair and efficient rate using an AIMD control law. We evaluate IFRC extensively on a 40-node wireless sensor network testbed. IFRC achieves a fair and efficient rate allocation that is within 20- 40% of the optimal fair rate allocation on some network topologies. Its rate adaptation mechanism is highly effective: we did not observe a single instance of queue overflow in our many experiments. Finally, IFRC can be extended easily to support situations where only a subset of the nodes transmit, where the network has multiple base stations, or where nodes are assigned different transmission weights.

Sumit Rangwala; Ramakrishna Gummadi; Ramesh Govindan; Konstantinos Psounis

2006-01-01T23:59:59.000Z

375

Coherent transport on Apollonian networks and continuous-time quantum walks  

E-Print Network (OSTI)

We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of the networks. We find that the transport depends on the initial nodes of the excitation. For networks less than the second generation the coherent transport shows perfect revivals when the initial excitation starts at the central node. For networks of higher generation, the transport only shows partial revivals. Moreover, we find that the excitation is most likely to be found at the initial nodes while the coherent transport to other nodes has a very low probability. In the long time limit, the transition probabilities show characteristic patterns with identical values of limiting probabilities. Finally, the dynamics of quantum transport are compared with the classical transport modeled by continuous-time random walks.

Xinping Xu; Wei Li; Feng Liu

2008-10-06T23:59:59.000Z

376

Distributed services for mobile ad hoc networks  

E-Print Network (OSTI)

A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form and disappear as nodes come into and go out of each other's communica- tion range. Mobile ad hoc networks are particularly useful in situations like disaster recovery and search, military operations, etc. Research on mobile ad hoc networks has drawn a huge amount of attention recently. The main challenges for mobile ad hoc networks are the sparse resources and frequent mobility. Most of the research work has been focused on the MAC and routing layer. In this work, we focus on distributed services for mobile ad hoc networks. These services will provide some fundamental functions in developing various applications for mobile ad hoc networks. In particular, we focus on the clock synchronization, connected dominating set, and k-mutual exclusion problems in mobile ad hoc networks.

Cao, Guangtong

2005-08-01T23:59:59.000Z

377

Complexity of the Critical Node Problem over trees  

E-Print Network (OSTI)

Feb 12, 2010 ... Citation: [1] Arulselvan A., Commander C.W., Elefteriadou L., Pardalos P.M., Detecting critical nodes in sparse graphs, Computers & Operations ...

378

Data collection, storage, and retrieval with an underwater sensor network  

E-Print Network (OSTI)

In this paper we present a novel platform for underwater sensor networks to be used for long-term monitoring of coral reefs and fisheries. The sensor network consists of static and mobile underwater sensor nodes. The nodes communicate point-to-point using a novel high-speed optical communication system integrated into the TinyOS stack, and they broadcast using an acoustic protocol integrated in the TinyOS stack. The nodes have a variety of sensing capabilities, including cameras, water temperature, and pressure. The mobile nodes can locate and hover above the static nodes for data muling, and they can perform network maintenance functions such as deployment, relocation, and recovery. In this paper we describe the hardware and software architecture of this underwater sensor network. We then describe the optical and acoustic networking protocols and present experimental networking and data collected in a pool, in rivers, and in the ocean. Finally, we describe our experiments with mobility for data muling in this network.

I. Vasilescu; K. Kotay; D. Rus; M. Dunbabin; P. Corke

2005-01-01T23:59:59.000Z

379

Rapidly Deployable Radio Networks Network Architecture  

E-Print Network (OSTI)

­P LINK & SEND NEWSWITCH PACKET NODES HANDLE REMOTE Figure 14: State Diagram for Master. START PACKET DONE NODES REMOTE HANDLE EDGE NODE ACTIVE Figure 15: State Diagram for EN not serving as Master. Each EDGE NODE ­ REMOTE NODE LINK Figure 17: Flow Diagram for processes during Handle RN State. possible

Kansas, University of

380

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

Science Conference Proceedings (OSTI)

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.

Taylor, Stuart G [Los Alamos National Laboratory; Farinholt, Kevin M [Los Alamos National Laboratory; Park, Gyuhae [Los Alamos National Laboratory; Farrar, Charles R [Los Alamos National Laboratory; Todd, Michael D [UCSD

2009-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Nonlinear Krylov and moving nodes in the method of lines  

Science Conference Proceedings (OSTI)

We report on some successes and problem areas in the Method of Lines from our work with moving node finite element methods. First, we report on our ''nonlinear Krylov accelerator'' for the modified Newton's method on the nonlinear equations of our stiff ... Keywords: Iterative linear solver, Method of lines, Moving finite elements, Moving node finite elements, Nonlinear Krylov method

Keith Miller

2005-11-01T23:59:59.000Z

382

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

E-Print Network (OSTI)

Everlast: Long-life, Supercapacitor-operated Wireless Sensor Node Farhan Simjee and Pai H. Chou,phchou}@uci.edu ABSTRACT This paper describes a supercapacitor-operated, solar-powered wire- less sensor node called, Design Keywords Maximum power point tracking, MPPT, supercapacitor, solar power, long life, wireless

Shinozuka, Masanobu

383

Computer-aided diagnosis of cervical lymph nodes on ultrasonography  

Science Conference Proceedings (OSTI)

A computerized system differentiating cervical lymph nodes on ultrasonography as malignant or benign was developed from a database of 210 cases. Ten quantitative features representing sonographic features of size, margin, nodal border, shape, medulla ... Keywords: Cervical lymph node, Computer-aided diagnosis (CAD), Snake model, Sonographic image, Support vector machine (SVM)

Junhua Zhang; Yuanyuan Wang; Yi Dong; Yi Wang

2008-02-01T23:59:59.000Z

384

Range-free mobile node localization using static anchor  

Science Conference Proceedings (OSTI)

In this paper we have proposed a deterministic, range-free, distributed localization algorithm for mobile sensor nodes with static anchors. Mobile node calculates its approximate line of movement and corresponding position based on received beacons from ... Keywords: beacon point, line of movement, mobile sensor localization, range-free

Kaushik Mondal, Partha Sarathi Mandal

2013-08-01T23:59:59.000Z

385

On wormhole attacks in underwater sensor networks: A two-tier localization approach  

E-Print Network (OSTI)

Under-Water Sensor Network (UWSN) is a novel networking paradigm to explore the uninhabited oceans. However, the characteristics of this new network, such as huge propagation delay, floating node mobility, and limited acoustic link capacity, are significantly different from land-based sensor networks. In this paper we show that underwater denial-of-service attack imposes great threats to any UWSN. Without proper countermeasures, underwater sensor networking is a mission impossible. We propose a localization based approach to answer the challenge. In our design, DUB and DDB, a pair of efficient single-round distance measuring schemes, are critical building blocks to realize our approach inspite of constrained node capability and floating node mobility. In addition, to cope with low/medium node mobiltiy, we propose a two-tier localization scheme to identify short-range wormholes instantly, and long-haul wormholes within a limited latency. Our simulation and implementation confirm the effectiveness of our design. I.

Jiejun Kong; Zhengrong Ji; Weichao Wang; Mario Gerla; Rajive Bagrodia

2004-01-01T23:59:59.000Z

386

Bayesian networks  

E-Print Network (OSTI)

g causal independence in Bayesian network inference. Journalworld ap- plications of Bayesian networks. Communications ofJensen. An Introduction to Bayesian Networks. Springer, New

Judea Pearl

2011-01-01T23:59:59.000Z

387

Distributed sensor networks with collective computation  

Science Conference Proceedings (OSTI)

Simulations of a network of N sensors have been performed. The simulation space contains a number of sound sources and a large number of sensors. Each sensor is equipped with an omni-directional microphone and is capable of measuring only the time of arrival of a signal. Sensors are able to wirelessly transmit and receive packets of information, and have some computing power. The sensors were programmed to merge all information (received packets as well as local measurements) into a 'world view' for that node. This world view is then transmitted. In this way, information can slowly diffuse across the network. One node was monitored in the network as a proxy for when information had diffused across the network. Simulations demonstrated that the energy expended per sensor per time step was approximately independent of N.

Lanman, D. R. (Douglas R.)

2001-01-01T23:59:59.000Z

388

Minimum-outage broadcast in wireless networks with fading channels  

Science Conference Proceedings (OSTI)

We consider the problem of cooperative broadcasting for minimum outage in wireless networks. We consider wireless multihop broadcast as a set of transmitters that transmit in a certain order. The receiving nodes are able to combine all the previous transmissions ... Keywords: broadcast, multicast, outage, wireless networks

Tolga Girici; Gulizar Duygu Kurt

2010-07-01T23:59:59.000Z

389

Fair Coalitions for Power-Aware Routing in Wireless Networks  

Science Conference Proceedings (OSTI)

Several power-aware routing schemes have been developed for wireless networks under the assumption that nodes are willing to sacrifice their power reserves in the interest of the network as a whole. But, in several applications of practical utility, ... Keywords: Wireless communication, algorithm design and analysis, energy-aware systems and routing.

Ratul K. Guha; Carl A. Gunter; Saswati Sarkar

2007-02-01T23:59:59.000Z

390

Trio: enabling sustainable and scalable outdoor wireless sensor network deployments  

Science Conference Proceedings (OSTI)

We present the philosophy, design, and initial evaluation of the Trio Testbed, a new outdoor sensor network deployment that consists of 557 solar-powered motes, seven gateway nodes, and a root server. The testbed covers an area of approximately 50,000 ... Keywords: detection, large-scale, long-life, sensor networks, surveillance, target tracking, testbed

Prabal Dutta; Jonathan Hui; Jaein Jeong; Sukun Kim; Cory Sharp; Jay Taneja; Gilman Tolle; Kamin Whitehouse; David Culler

2006-04-01T23:59:59.000Z

391

Electricity generation with looped transmission networks: Bidding to an ISO  

E-Print Network (OSTI)

Electricity generation with looped transmission networks: Bidding to an ISO Xinmin Hu Daniel Ralph to model markets for delivery of electrical power on looped transmission networks. It analyzes in transmission capacity mean the ISO potentially sets a different electricity price at each node of the trans

Ferris, Michael C.

392

Information fusion for wireless sensor networks: Methods, models, and classifications  

Science Conference Proceedings (OSTI)

Wireless sensor networks produce a large amount of data that needs to be processed, delivered, and assessed according to the application objectives. The way these data are manipulated by the sensor nodes is a fundamental issue. Information fusion arises ... Keywords: Information fusion, architectures and models, data aggregation, data fusion, wireless sensor networks

Eduardo F. Nakamura; Antonio A. F. Loureiro; Alejandro C. Frery

2007-09-01T23:59:59.000Z

393

Latency of wireless sensor networks with uncoordinated power saving mechanisms  

Science Conference Proceedings (OSTI)

We consider a wireless sensor network, where nodes switch between an active (on) and a sleeping (off) mode, to save energy. The basic assumptions are that the on/off schedules are completely uncoordinated and that the sensors are distributed according ... Keywords: continuum percolation, first passage percolation, sensor networks

Olivier Dousse; Petteri Mannersalo; Patrick Thiran

2004-05-01T23:59:59.000Z

394

Resource Allocation in Sensor Networks with Renewable Energy  

E-Print Network (OSTI)

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 the wide-scale deployment of such networks. However, new and exciting developments in the area of renewable

Koksal, Can Emre

395

A cooperative coevolutionary genetic algorithm for learning bayesian network structures  

Science Conference Proceedings (OSTI)

We propose a cooperative coevolutionary genetic algorithm for learning Bayesian network structures from fully observable data sets. Since this problem can be decomposed into two dependent subproblems, that is to find an ordering of the nodes and an optimal ... Keywords: bayesian networks, cooperative coevolutionary genetic algorithms, structure learning

Arthur Carvalho

2011-07-01T23:59:59.000Z

396

A secure alternate path routing in sensor networks  

Science Conference Proceedings (OSTI)

This paper presents a secure alternate path routing in sensor networks. Our alternate path scheme makes the routing protocol resilient in the presence of malicious nodes that launch selective forwarding attacks. SeRINS (a Secure alternate path Routing ... Keywords: Secure routing, Sensor network security

Suk-Bok Lee; Yoon-Hwa Choi

2006-12-01T23:59:59.000Z

397

IDEA: integrated distributed energy awareness for wireless sensor networks  

Science Conference Proceedings (OSTI)

Energy in sensor networks is a distributed, non-transferable resource. Over time, differences in energy availability are likely to arise. Protocols like routing trees may concentrate energy usage at certain nodes. Differences in energy harvesting arising ... Keywords: optimization, resource distribution, resource management, wireless sensor networks

Geoffrey Werner Challen; Jason Waterman; Matt Welsh

2010-06-01T23:59:59.000Z

398

Scale-free, self-organizing very large sensor networks  

Science Conference Proceedings (OSTI)

In this paper we introduce SFSN, an algorithm for self-organization of Very Large Sensor Networks (VLSN). The 10^6 or more tiny and inexpensive sensors of a VLSN are indistinguishable from one another; they do not have either a physical or a logical ... Keywords: Anonymous nodes, Collision resolution algorithm, Event, Multiple access, Self-organization, Sensor networks

Dan C. Marinescu; Chen Yu; Gabriela M. Marinescu

2010-05-01T23:59:59.000Z

399

A hybrid method for solving ARWA problem on WDM network  

Science Conference Proceedings (OSTI)

Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. In WDM network, the anycast requests can be used as an optimization tool to ensure survivability. If the anycast requests ... Keywords: Anycast, Genetic algorithm, NP-hard, Routing and wavelength assignment, Simulated annealing, WDM

Der-Rong Din

2007-01-01T23:59:59.000Z

400

Network-theoretic classification of parallel computation patterns  

Science Conference Proceedings (OSTI)

Parallel computation in a high-performance computing environment can be characterized by the distributed memory access patterns of the underlying algorithm. During execution, networks of compute nodes exchange messages that indirectly exhibit these access ... Keywords: communication patterns, computational dwarves, graph theory, network theory, pattern recognition

Sean Whalen; Sophie Engle; Sean Peisert; Matt Bishop

2012-05-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Optimized query routing trees for wireless sensor networks  

Science Conference Proceedings (OSTI)

In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be transmitted to the querying node. ... Keywords: Critical path method, Query routing trees, Sensor networks

Panayiotis Andreou; Demetrios Zeinalipour-Yazti; Andreas Pamboris; Panos K. Chrysanthis; George Samaras

2011-04-01T23:59:59.000Z

402

Secure position verification for wireless sensor networks in noisy channels  

Science Conference Proceedings (OSTI)

Position verification in wireless sensor networks (WSNs) is quite tricky in presence of attackers (malicious sensor nodes), who try to break the verification protocol by reporting their incorrect positions (locations) during the verification stage. In ... Keywords: 3? limit, distance estimation, distributed protocol, location verification, quantiles, wireless networks

Partha Sarathi Mandal; Anil K. Ghosh

2011-07-01T23:59:59.000Z

403

Energy conservation in wireless sensor networks: A survey  

Science Conference Proceedings (OSTI)

In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy ... Keywords: Energy efficiency, Power management, Survey, Wireless sensor networks

Giuseppe Anastasi; Marco Conti; Mario Di Francesco; Andrea Passarella

2009-05-01T23:59:59.000Z

404

Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks  

E-Print Network (OSTI)

Optimal Routing and Scheduling in Multihop Wireless Renewable Energy Networks MHR. Khouzani-constrained wireless ad-hoc networks where nodes are powered by renewable energy sources. We take into account the fact that renewable energy harvesting processes are unpredictable and stochastic in nature ­ typically depending

Sarkar, Saswati

405

Multiple crossbar network: A switched high-speed local network  

SciTech Connect

The Multiple Crossbar Network (MCN) is a prototype High-Speed Local Network at the Los Alamos National Laboratory. It will interconnect supercomputers, network servers and workstations from various commercial vendors. The MCN can also serve as a backbone for message traffic between local area networks. The MCN is a switched local network of switching nodes called Cross-Point Stars (CPs). Hosts and CPs are connected by 800-Mbit/s (100-Mbyte/s) point-to-point ANSI High-Speed Channels. CPs include RISC-based network protocol processors called Crossbar Interfaces and a switching core called the Crossbar Switch. Protocols include physical, data link, intranet, and network access functionality. Various internet and transport protocols are intended to run above the MCN protocol suite. A network management and simple naming service is also included within the Los Alamos Network Architecture. Immediate applications include visualization. The MCN is intended to also serve as a framework for multicomputer applications. 36 refs., 10 figs.

Hoebelheinrich, R.; Thomsen, R.

1989-01-01T23:59:59.000Z

406

New Technique for Proposing Network's Topology using GPS and GIS  

E-Print Network (OSTI)

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.

Ismaeel, Ayad Ghany

2012-01-01T23:59:59.000Z

407

Towards A Network-of-Networks Framework for Cyber Security  

Science Conference Proceedings (OSTI)

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.

Halappanavar, Mahantesh; Choudhury, Sutanay; Hogan, Emilie A.; Hui, Peter SY; Johnson, John R.; Ray, Indrajit; Holder, Lawrence B.

2013-06-07T23:59:59.000Z

408

Resilient Networked Control of Distributed Energy Resources  

E-Print Network (OSTI)

://www.nik.no/ Open Source Software for the Smartgrid: Challenges for Software Safety and Evolution Tosin Daniel, Trondheim, Norway. Abstract The growing Smartgrid behind today's electricity supply introduces many domains (generation, transmission, distribution and consumption) and nodes of the Smartgrid network

Hadjicostis, Christoforos

409

Jumping ant routing algorithm for sensor networks  

Science Conference Proceedings (OSTI)

Enterprises that may rely on critical equipments which are constantly moving around, for example, hospitals - need to ensure they can know the current location of vital but mobile assets. Besides, the sensor node on each device should inform us whether ... Keywords: ARAMA (Ant Routing Algorithm for Mobile Ad-hoc Networks), Ad-hoc, JARA (Jumping Ant Routing Algorithm), MANET

Wei-Ming Chen; Chung-Sheng Li; Fu-Yu Chiang; Han-Chieh Chao

2007-10-01T23:59:59.000Z

410

Dimensioning optical networks under traffic growth models  

Science Conference Proceedings (OSTI)

In this paper, we consider the problem of dimensioning a large optical wavelength-division multiplexing (WDM) network assuming the traffic is growing over time. Traffic between pairs of nodes is carried through lightpaths which are high-bandwidth end-to-end ... Keywords: capacity allocation, capacity exhaustion probability, stochastic modeling, traffic growth model

Tapan Kumar Nayak; Kumar N. Sivarajan

2003-12-01T23:59:59.000Z

411

Design and development of Stirling engines for stationary-power-generation applications in the 500- to 3000-hp range. Phase I final report  

SciTech Connect

The first phase of the design and development of Stirling engines for stationary power generation applications in the 373 kW (500 hp) to 2237 kW (3000 hp) range was completed. The tasks in Phase I include conceptual designs of large Stirling cycle stationary engines and program plan for implementing Phases II through V. Four different heater head designs and five different machine designs were prepared in sufficient detail to select a design recommended for development in the near future. A second order analysis was developed for examining the various loss mechanisms in the Stirling engine and for predicting the thermodynamic performance of these engines. The predicted engine thermal brake efficiency excluding combustion efficiency is approximately 42% which exceeds the design objective of 40%. The combustion system designs were prepared for both a clean fuel combustion system and a two-stage atmospheric fluidized bed combustion system. The calculated combustion efficiency of the former is 90% and of the latter is 80%. Heat transport systems, i.e., a heat exchanger for the clean fuel combustion system and a sodium heat pipe system for coal and other nonclean fuel combustion systems were selected. The cost analysis showed that for clean fuels combustion the proposed 2237 kW (3000 hp) system production cost is $478,242 or $214/kW ($159/hp) which is approximately 1.86 times the cost of a comparable size diesel engine. For solid coal combustion the proposed 2237 kW (3000 hp) system production cost is approximately $2,246,242 which corresponds to a cost to power capacity ratio of $1004/kW ($749/hp). The two-stage atmospheric fluidized bed combustion system represents 81% of the total cost; the engine represents 14% depending on the future price differential between coal and conventional clean fuels, a short payback period of the proposed Stirling cycle engine/FBC system may justify the initial cost. (LCL)

1980-10-01T23:59:59.000Z

412

Cross-Layer Design for Relay Selection and Power Allocation Strategies in Cooperative Networks  

Science Conference Proceedings (OSTI)

In mobile relay networks, relay nodes in mobility generally have variable channel conditions and limited residual energy, which may affect the network performance. In this paper, we proposed a cross-layer design jointly incorporating best relay selection ... Keywords: Cooperative diversity, cross-layer, relay selection, power allocation, network lifetime

Qiu Lin; Zhang Yong; Dai Chao; Song Mei; Wang Danzhi

2009-05-01T23:59:59.000Z

413

Energy-efficient neighbor discovery protocol for mobile wireless sensor networks  

Science Conference Proceedings (OSTI)

Low energy consumption is a critical design requirement for most wireless sensor network (WSN) applications. Due to minimal transmission power levels, time-varying environmental factors and mobility of nodes, network neighborhood changes frequently. ... Keywords: Algorithm/protocol design and analysis, Low power design, Mobile computing, Wireless sensor networks

Mikko Kohvakka; Jukka Suhonen; Mauri Kuorilehto; Ville Kaseva; Marko Hännikäinen; Timo D. Hämäläinen

2009-01-01T23:59:59.000Z

414

A wireless sensor network design tool to support building energy management  

Science Conference Proceedings (OSTI)

The physical location of sensor nodes strongly influences the performance of the network from the perspective of accurate data sensing and reliable communication. Therefore deployment planning can be regarded as an essential stepping stone to producing ... Keywords: building management system, heterogeneous wireless network infrastructure, industry foundation classes, wireless sensor network design

Antony Guinard; Alan McGibney; Dirk Pesch

2009-11-01T23:59:59.000Z

415

Performance evaluation of low energy adaptive clustering hierarchy protocol for wireless sensor networks  

Science Conference Proceedings (OSTI)

Clustering of sensor nodes is an effective technique for achieving prolonged network lifetime, scalability, and load balancing. This paper focuses on the performance evaluation of the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol that can ... Keywords: clustering, energy consumption, network lifetime, wireless sensor networks

D. A. Vidhate; A. K. Patil; S. S. Pophale

2010-02-01T23:59:59.000Z

416

Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones  

Science Conference Proceedings (OSTI)

In a wireless sensor network (WSN), nodes are power constrained. As a consequence, protocols must be energy efficient to prolong the network lifetime while keeping some quality-of-service (QoS) requirements. In WSNs, most protocols resort to the broadcast ... Keywords: Battery capacity recovery, Battery model, Dynamic power management, Multi-coverage backbones, Topology control, Wireless sensor networks

Paulo Sérgio Sausen; Marco Aurélio Spohn; Angelo Perkusich

2010-03-01T23:59:59.000Z

417

EECHE: energy-efficient cluster head election protocol for heterogeneous wireless sensor networks  

Science Conference Proceedings (OSTI)

A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor network is developing an energy-efficient routing protocol which ... Keywords: clustering, energy efficient, heterogeneous, lifetime, sensor networks

Dilip Kumar; T. C. Aseri; R. B Patel

2009-01-01T23:59:59.000Z

418

Knowledge-based duty cycle estimation in wireless sensor networks: Application for sound pressure monitoring  

Science Conference Proceedings (OSTI)

Wireless sensor networks comprise an important research area and a near future for industry and communications. Wireless sensor networks contain resource-constrained sensor nodes that are powered by small batteries, limited process and memory and wireless ... Keywords: Constrained device, Fuzzy rule based system, Multi-agent system, Sound pressure, Wireless sensor network

J. C. Cuevas-Martinez; J. Canada-Bago; J. A. Fernandez-Prieto; M. A. Gadeo-Martos

2013-02-01T23:59:59.000Z

419

Network location of a reliable center using the most reliable route policy  

Science Conference Proceedings (OSTI)

This paper considers a single location on an undirected network with unreliable edges that maximizes the lowest performance level of the network service with respect to all nodes. The problem is termed the reliable 1-center problem and finds applications ... Keywords: 1-Center, Location theory, Network reliability, Stochastic optimization

José Santiváńez; Emanuel Melachrinoudis; Mary E. Helander

2009-05-01T23:59:59.000Z

420

On improving temporal and spatial mobility metrics for wireless ad hoc networks  

Science Conference Proceedings (OSTI)

This work shows that two well-known spatial and temporal mobility metrics for wireless multi-hop networks have limitations, possibly resulting in misleading results. Based on the concept of spatial dependence among nodes including transient periods of ... Keywords: Mobile ad hoc network, Mobility metric, Mobility model, Network simulation, Spatial dependence, Temporal dependence

Elmano Ramalho Cavalcanti; Marco Aurélio Spohn

2012-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks  

Science Conference Proceedings (OSTI)

Primitive routing protocols for ad-hoc networks are ''power hungry'' and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous ... Keywords: Ad-hoc networks, Ant colony optimization, Energy-efficiency, Performance evaluation, Routing, Simulation

Sudip Misra; Sanjay K. Dhurandher; Mohammad S. Obaidat; Pushkar Gupta; Karan Verma; Prayag Narula

2010-11-01T23:59:59.000Z

422

Achieving dependability in sensor networks through automated requirements-based programming  

Science Conference Proceedings (OSTI)

A sensor network can be viewed as a distributed system consisting of many nodes (processes) that communicate and exchange data. Such a system, including an application running on top of the sensor network, is inherently difficult to model and validate. ... Keywords: Automatic code generation, Formal methods, Sensor networks

Michael G. Hinchey; James L. Rash; Christopher A. Rouff; Denis Gra?anin

2006-01-01T23:59:59.000Z

423

CafNet : a carry-and-forward delay-tolerant network  

E-Print Network (OSTI)

In this thesis, I designed and implemented a delay-tolerant network stack that allows applications to send messages to other network nodes when no end-to-end connectivity is present. CafNet, the Carry-and-Forward Network, ...

Chen, Kevin W. (Kevin William)

2007-01-01T23:59:59.000Z

424

Integration of false data detection with data aggregation and confidential transmission in wireless sensor networks  

Science Conference Proceedings (OSTI)

In wireless sensor networks, compromised sensor nodes can inject false data during both data aggregation and data forwarding. The existing false data detection techniques consider false data injections during data forwarding only and do not allow any ... Keywords: data aggregation, data integrity, network-level security, sensor networks

Suat Ozdemir; Hasan Çam

2010-06-01T23:59:59.000Z

425

Stability Problems of Transport of Event Data in Realistic Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

In general, wireless sensor networks have a certain degree of spatial redundancy, which means that a high number of nodes can sense the same event at the same time. This redundancy permits to simplify both MAC protocol and the transport of sensed data. ... Keywords: Data Transport, Distortion, Event Detection, Multi-hop Networks, Path stability, Shadowing, Stability, Wireless Sensor Networks, ns-2 Simulations

Giuseppe De Marco; Leonard Barolli

2008-04-01T23:59:59.000Z

426

In-network data estimation for sensor-driven scientific applications  

Science Conference Proceedings (OSTI)

Sensor networks employed by scientific applications oftenneed to support localized collaboration of sensor nodes to perform in-network data processing. This includes new quantitative synthesis andhypothesis testing in near real time, as data streaming ... Keywords: in-network data estimation, sensor system programming, sensor-driven scientific applications

Nanyan Jiang; Manish Parashar

2008-12-01T23:59:59.000Z

427

Synchronous Ultra-Wide Band Wireless Sensors Networks for oil and gas exploration  

E-Print Network (OSTI)

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

Savazzi, Stefano

428

HP’s Adaptive Enterprise Strategy and Utility Data Center Solution Management Summary  

E-Print Network (OSTI)

That enterprise server utilization is low should come as no surprise. Enterprises upgraded their environments to address Y2K issues, and added more capacity in anticipation of endless growth. Supporting alternative approaches was seen as a way to hedge bets in a time of rapidly evolving enterprise technology. This added more equipment. Then the economy plummeted. Of course, these seemingly prudent excesses became an obvious source of waste in an era of constraint and outright shrinkage. Enterprises stopped buying, but unless they abandoned an application or closed a web site, they usually did not dispose of any of their IT assets early. Instead, most enterprises have turned their attention to getting more use out of existing hardware and software assets – to the point of sharing what was traditionally owned. So how do you convert the mansions of yesteryear into the efficiency of multi-tenancy? You architect a robust system of halls and doors, redesign rooms for multi-use and – oh yes – add more sound insulation. You do the same in IT environments. In the past few years, networks (halls) have become more pervasive, and switches (doors) have grown more intelligent (soundproof and secure). IT devices have become more reliable and self-healing. Partitioning and virtual machines have made server assets divisible. Encryption, precipitated security schemes, policy-based automation, and a myriad of point

Analyst Anne Macfarland

1993-01-01T23:59:59.000Z

429

SELF-ORGANISING QUORUM SYSTEMS FOR AD HOC NETWORKS Gareth Owen and Mo Adda  

E-Print Network (OSTI)

-hop ad-hoc networks allow nodes to communicate with each other without being in transmission range for the destination. Many routing protocols propose a function that maps a node's ID to its location, but whilst this information. Li [2] divides the area into grid- squares of different orders. Starting with the grid

Augusto, Juan Carlos

430

Energy-efficient geographic multicast routing for Sensor and Actuator Networks  

Science Conference Proceedings (OSTI)

The case in which the same information or events need to be sent from a single sensor node to multiple actuator nodes, is very common in many applications of Sensor and Actuator Networks (SANET). Sensors have very limited resources in terms of energy, ... Keywords: Energy efficient, Multicast, SANET, WSN

Juan A. Sanchez; Pedro M. Ruiz; Ivan Stojmenovic

2007-09-01T23:59:59.000Z

431

Too Much Mobility Limits the Capacity of Wireless Ad-hoc Networks  

E-Print Network (OSTI)

is that communication between distant nodes causes too much interference. Therefore most of the communication must happen between only nearest neighbors and multiple hops are required to carry a message to a distant node and channel estimation is harder. In this paper, we explore the capacity of highly mobile ad-hoc networks

Jafar, Syed A.

432

Message-driven based energy-efficient routing in heterogeneous delay-tolerant networks  

Science Conference Proceedings (OSTI)

Delay-Tolerant Network (DTN) nodes are mostly energy-limited devices that run on battery power. DTN routing strategies on such resource-constrained nodes therefore need to be energy efficient. Contemporary routing protocols such as Two-Hop Routing (2HR) ... Keywords: dtn, energy efficiency, heterogeneity, performance modeling, routing

V. K. Chaithanya Manam; V. Mahendran; C. Siva Ram Murthy

2012-10-01T23:59:59.000Z

433

ASR: anonymous and secure reporting of traffic forwarding activity in mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Nodes forward data on behalf of each other in mobile ad hoc networks. In a civilian application, nodes are assumed to be selfish and rational, i.e., they pursue their own self-interest. Hence, the ability to accurately measure traffic forwarding is critical ... Keywords: Anonymity, MANET, Monitoring, Packet forwarding, Secure link layer acknowledgment, Secure reporting protocol, Security

Heesook Choi; William Enck; Jaesheung Shin; Patrick D. Mcdaniel; Thomas F. Porta

2009-05-01T23:59:59.000Z

434

Benefits of Inter-Flow Bandwidth Sharing in Broadband Wireless Infrastructure Networks  

E-Print Network (OSTI)

Ahuja, Abishek Gopalan, and Srinivasan Ramasubramanian Department of Electrical and Computer Engineering bandwidth usage, the nodes in such networks employ directional transmissions over multiple orthogonal. The interference at node z due to the transmission from x to y results in signal- to-noise ratio that is lower than

Ramasubramanian, Srinivasan

435

Performance evaluation of wireless sensor networks for mobile event and mobile sink  

Science Conference Proceedings (OSTI)

Extending lifetime and energy efficiency are important objectives and challenges in-Wireless Sensor Networks (WSNs). In large scale WSNs, when the nodes are near to the sink they consume much more energy than the nodes far from the sink. In our previous ... Keywords: WSNs, depletion, goodput, mobile event, mobile sink

Tao Yang; Makoto Ikeda; Leonard Barolli; Fatos Xhafa; Arjan Durresi

2010-12-01T23:59:59.000Z

436

Transmission Policies for Asymmetric Interference Channels with Energy Harvesting Nodes  

E-Print Network (OSTI)

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

Yener, Aylin

437

Protection of Public Transportation Nodes Against Chem/Bio Terrorism  

NLE Websites -- All DOE Office Websites (Extended Search)

Protection of Public Transportation Nodes Against ChemBio Terrorism Speaker(s): Susanna Gordon Date: November 16, 2001 - 12:00pm Location: 90-3122 Seminar HostPoint of Contact:...

438

Information Theoretic Adaptive Tracking of Epidemics in Complex Networks  

E-Print Network (OSTI)

Adaptively monitoring the states of nodes in a large complex network is of interest in domains such as national security, public health, and energy grid management. Here, we present an information theoretic adaptive tracking and sampling framework that recursively selects measurements using the feedback from performing inference on a dynamic Bayesian Network. We also present conditions for the existence of a network specific, observation dependent, phase transition in the updated posterior of hidden node states resulting from actively monitoring the network. Since traditional epidemic thresholds are derived using observation independent Markov chains, the threshold of the posterior should more accurately model the true phase transition of a network. The adaptive tracking framework and epidemic threshold should provide insight into modeling the dynamic response of the updated posterior to active intervention and control policies while monitoring modern complex networks.

Harrington, Patrick L

2013-01-01T23:59:59.000Z

439

Rapidly Deployable Radio Networks Network Architecture  

E-Print Network (OSTI)

Quality Radio Link Setup and Control Figure 2: Remote Node Components. 2 #12;passing the cells of handling failure of the master node versus maintaining a hot backup for the master node is to be studied & SEND NEWSWITCH PACKET NODES HANDLE REMOTE Figure 14: State Diagram for Master. START PACKET NEWSWITCH

Bush, Stephen F.

440

Quantum Google in a Complex Network  

E-Print Network (OSTI)

We investigate the behavior of the recently proposed quantum Google algorithm, or quantum PageRank, in large complex networks. Applying the quantum algorithm to a part of the real World Wide Web, we find that the algorithm is able to univocally reveal the underlying scale-free topology of the network and to clearly identify and order the most relevant nodes (hubs) of the graph according to their importance in the network structure. Moreover, our results show that the quantum PageRank algorithm generically leads to changes in the hierarchy of nodes. In addition, as compared to its classical counterpart, the quantum algorithm is capable to clearly highlight the structure of secondary hubs of the network, and to partially resolve the degeneracy in importance of the low lying part of the list of rankings, which represents a typical shortcoming of the classical PageRank algorithm. Complementary to this study, our analysis shows that the algorithm is able to clearly distinguish scale-free networks from other widespread and important classes of complex networks, such as Erd\\H{o}s-R\\'enyi networks and hierarchical graphs. We show that the ranking capabilities of the quantum PageRank algorithm are related to an increased stability with respect to a variation of the damping parameter $\\alpha$ that appears in the Google algorithm, and to a more clearly pronounced power-law behavior in the distribution of importance among the nodes, as compared to the classical algorithm. Finally, we study to which extent the increased sensitivity of the quantum algorithm persists under coordinated attacks of the most important nodes in scale-free and Erd\\H{o}s-R\\'enyi random graphs.

G. D. Paparo; M. Mueller; F. Comellas; M. A. Martin-Delgado

2013-03-15T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Design, Modeling, and Capacity Planning for Micro-solar Power Sensor Networks  

Science Conference Proceedings (OSTI)

This paper describes a systematic approach to building micro-solar power subsystems for wireless sensor network nodes. Our approach composes models of the basic pieces - solar panels, regulators, energy storage elements, and application loads - to appropriately ...

Jay Taneja; Jaein Jeong; David Culler

2008-04-01T23:59:59.000Z

442

Towards Realizing the Performance and Availability Benefits of a Global Overlay Network  

E-Print Network (OSTI)

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 ...

Rahul, Hariharan

2005-11-01T23:59:59.000Z

443

Underwater acoustic sensor networks: research challenges Ian F. Akyildiz *, Dario Pompili, Tommaso Melodia  

E-Print Network (OSTI)

Underwater acoustic sensor networks: research challenges Ian F. Akyildiz *, Dario Pompili, Tommaso September 2004; accepted 21 January 2005 Abstract Underwater sensor nodes will find applications navigation and tactical surveillance applications. Moreover, unmanned or autonomous underwater vehicles (UUVs

Baykal, Buyurman

444

Energy-efficient reservation-based medium access control protocol for wireless sensor networks  

Science Conference Proceedings (OSTI)

In Wireless Sensor Networks (WSNs), a robust and energy-efficient Medium Access Control (MAC) protocol is required for high energy efficiency in harsh operating conditions, where node and link failures are common. This paper presents the design of a ...

Mikko Kohvakka; Jukka Suhonen; Timo D. Hämäläinen; Marko Hännikäinen

2010-04-01T23:59:59.000Z

445

Energy-aware sparse approximation technique (EAST) for rechargeable wireless sensor networks  

Science Conference Proceedings (OSTI)

Due to non-homogeneous spread of sunlight, sensing nodes typically have non-uniform energy profiles in rechargeable Wireless Sensor Networks (WSNs). An energy-aware work load distribution is therefore necessary for good data accuracy while ensuring an ...

Rajib Rana; Wen Hu; Chun Tung Chou

2010-02-01T23:59:59.000Z

446

Secure and energy-efficient data aggregation for wireless sensor networks  

Science Conference Proceedings (OSTI)

Wireless sensor networks are now in widespread use to monitor regions, detect events and acquire information. Since the deployed nodes are separated, they need to cooperatively communicate sensed data to the base station. To maximise WSN lifetime, it ...

Sofiene Ben Othman; Abdelbasset Trad; Hani Alzaid; Habib Youssef

2013-10-01T23:59:59.000Z

447

ACOS: a precise energy-aware coverage control protocol for wireless sensor networks  

Science Conference Proceedings (OSTI)

A surveillance application requires sufficient coverage of the protected region while minimizing the energy consumption and extending the lifetime of sensor networks. This can be achieved by putting redundant sensor nodes to sleep. In this paper, we ...

Yanli Cai; Minglu Li; Wei Shu; Min-You Wu

2005-12-01T23:59:59.000Z

448

High performance power flow algorithm for symmetrical distribution networks with unbalanced loading  

Science Conference Proceedings (OSTI)

Size of the distribution and transmission networks to be planned or to be monitored in online systems is increasing significantly. The number of nodes of a complete distribution system exceeds several hundred thousand. As a consequence, efficient methods ...

Izudin Dzafic; Hans-Theo Neisius; Priyanka Mohapatra

2012-03-01T23:59:59.000Z

449

Area temperature system monitoring and computing based on adaptive fuzzy logic in wireless sensor networks  

Science Conference Proceedings (OSTI)

The many subfields in the wireless sensor networking literature include data fusion, data aggregation, remote environmental monitoring, sensing (temperature, pressure speed) and various military applications. The distance between sensor nodes can be ... Keywords: Fuzzy logic, Monitoring, RSSI, Temperature, WSN

Ing-Jiunn Su; Chia-Chih Tsai; Wen-Tsai Sung

2012-05-01T23:59:59.000Z

450

A Reputation Model Based on Behavior Trust in Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

Trust management has an important significance on the reliable operation and safety guarantee in Wireless Sensor Networks(WSNs). Previous works were implemented by exchanging key among neighboring sensors. Considering that in many cases, the sensor nodes’ ...

Ming-Zheng Zhou; Yi Zhang; Jun Wang; Sen-Yan Zhao

2009-09-01T23:59:59.000Z

451

Approximate consensus in the dynamic stochastic network with incomplete information and measurement delays  

Science Conference Proceedings (OSTI)

Consideration was given to the problem of achieving an approximate consensus in the decentralized stochastic dynamic network under incomplete information about the current states of the nodes, measurement delay, and variable structure of links. Solution ...

N. O. Amelina; A. L. Fradkov

2012-11-01T23:59:59.000Z

452

Branch and cut algorithms for detecting critical nodes in undirected ...  

E-Print Network (OSTI)

instances derived from the Ohio's state highway network. Dinh et al. [6] focus on telecommunication networks; they propose algorithms for detecting in a directed  ...

453

Network for minimizing current imbalances in a faradaic battery  

SciTech Connect

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.

Wozniak, Walter (Dearborn, MI); Haskins, Harold J. (Ann Arbor, MI)

1994-01-01T23:59:59.000Z

454

Energy efficient prediction clustering algorithm for multilevel heterogeneous wireless sensor networks  

E-Print Network (OSTI)

In designing wireless sensor networks, it is important to reduce energy dissipation and prolong network lifetime. In this paper, a new model with energy and monitored objects heterogeneity is proposed for heterogeneous wireless sensor networks. We put forward an energy-efficient prediction clustering algorithm, which is adaptive to the heterogeneous model. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residual energy, so that the network energy can be dissipated uniformly. In order to reduce energy consumption when broadcasting in clustering phase and prolong network lifetime, an energy consumption prediction model is established for regular data acquisition nodes. Simulation results show that compared with current clustering algorithms, this algorithm can achieve longer sensor network lifetime, higher energy efficiency and ...

Liu, Tang; Yang, Jin; Wang, Chunli

2011-01-01T23:59:59.000Z

455

Perturbation centrality: a novel centrality measure obtained by the general network dynamics tool, Turbine  

E-Print Network (OSTI)

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...

Szalay, Kristof Z

2013-01-01T23:59:59.000Z

456

Eliminating livelock in flushable routing networks  

DOE Patents (OSTI)

This invention is comprised of a method for livelock-free message routing is provided in a network of interconnected nodes that is flushable in time T. An input message processor generates sequences of at least N time intervals, each of duration T. An input register provides for receiving and holding each input message, where the message is assigned a priority state p during an nth one of the N time intervals. At each of the network nodes a message processor reads the assigned priority state and awards priority to messages with priority state (p-1) during an nth time interval and to messages with priority state p during an (n + 1)th time interval. The messages that are awarded priority are output on an output path toward the addressed output message processor. Thus, no message remains in the network for a time longer than T.

Faber, V.

1992-12-31T23:59:59.000Z

457

Networks, smart grids: new model for synchronization  

NLE Websites -- All DOE Office Websites (Extended Search)

Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Researchers developed a surprisingly simple mathematical model that accurately predicts synchronization as a function of the parameters and the topology of the underlying network. May 21, 2013 High voltage transmission lines carry electrical power. High voltage transmission lines carry electrical power. The researchers envision that their method could be applied to assess synchronization and robustness quickly in electrical grids under volatile operating conditions. Networks of individual oscillating nodes often spontaneously synchronize and begin to oscillate at a coherent frequency. From heart cells to flashing fireflies to electric power grids, coupled oscillator networks are

458

Basic Tradeoffs for Energy Management in Rechargeable Sensor Networks  

E-Print Network (OSTI)

As many sensor network applications require deployment in remote and hard-to-reach areas, it is critical to ensure that such networks are capable of operating unattended for long durations. Consequently, the concept of using nodes with energy replenishment capabilities has been gaining popularity. However, new techniques and protocols must be developed to maximize the performance of sensor networks with energy replenishment. Here, we analyze limits of the performance of sensor nodes with limited energy, being replenished at a variable rate. We provide a simple localized energy management scheme that achieves a performance close to that with an unlimited energy source, and at the same time keeps the probability of complete battery discharge low. Based on the insights developed, we address the problem of energy management for energy-replenishing nodes with finite battery and finite data buffer capacities. To this end, we give an energy management scheme that achieves the optimal utility asymptotically while kee...

Srivastava, Rahul

2010-01-01T23:59:59.000Z

459

Transmission with energy harvesting nodes in fading wireless channels: Optimal policies  

E-Print Network (OSTI)

Abstract—Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic 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. In this paper, we consider optimization of point-to-point data transmission with an energy harvesting transmitter which has a limited battery capacity, communicating in a wireless fading channel. We consider two objectives: maximizing the throughput by a deadline, and minimizing the transmission completion time of the communication session. We optimize these objectives by controlling the time sequence of transmit powers subject to energy storage capacity and causality constraints. We, first, study optimal offline policies. We introduce a directional water-filling algorithm which provides a simple and concise interpretation of the necessary optimality conditions. We show the optimality of an adaptive directional water-filling algorithm for the throughput maximization problem. We solve the transmission completion time minimization problem by utilizing its equivalence to its throughput maximization counterpart. Next, we consider online policies. We use stochastic dynamic programming to solve for the optimal online policy that maximizes the average number of bits delivered by a deadline under stochastic fading and energy arrival processes with causal channel state feedback. We also propose near-optimal policies with reduced complexity, and numerically study their performances along with the performances of the offline and online optimal policies under various different configurations. Index Terms—Energy harvesting, rechargeable wireless networks, throughput maximization, transmission completion time minimization, directional water-filling, dynamic programming. I.

Omur Ozel; Student Member; Kaya Tutuncuoglu; Student Member; Jing Yang; Student Member; Sennur Ulukus; Aylin Yener

2011-01-01T23:59:59.000Z

460

Routing algorithms for large scale wireless sensor networks  

E-Print Network (OSTI)

Routing in sensor networks is a challenging issue due to inherent constraints such as power, memory, and CPU processing capabilities. In this thesis, we assume an All to All communication mode in an N × N grid sensor network. We explore routing algorithms which load balance the network without compromising the shortest paths constrain. We analyzed the Servetto method and studied two routing strategies, namely Horizontal-Vertical routing and Zigzag routing. The problem is divided into two scenarios, one being the static case (without failed nodes), and the other being the dynamic case (with failed nodes). In static network case, we derived mathematical formulae representing the maximum and minimum loads on a sensor grid, when specific routing strategies are employed. We show improvement in performance in load balancing of the grid by using Horizontal-Vertical method instead of the existing Servetto method. In the dynamic network scenario, we compare the performance of routing strategies with respect to probability of failure of nodes in the grid network. We derived the formulae for the success-ratio, in specific strategies, when nodes fail with a probability of p in a predefined source-destination pair communication. We show that the Servetto method does not perform well in both scenarios. In addition, Hybrid strategy proposed does not perform well compared to the studied strategies. We support the derived formulae and the performance of the routing strategies with extensive simulations.

Nittala Venkata, Lakshmana Prasanth

2004-12-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Design and Analysis of Low Complexity Network Coding Schemes  

E-Print Network (OSTI)

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 introduced by Ahlswede et al., states that if the nodes are permitted to combine the information packets and forward a function of them, the throughput of the network can dramatically increase. In this dissertation we focused on the design and analysis of low complexity network coding schemes for different topologies of wired and wireless networks. In the first part we studied the routing capacity of wired networks. We provided a description of the routing capacity region in terms of a finite set of linear inequalities. We next used this result to study the routing capacity region of undirected ring networks for two multimessage scenarios. Finally, we used new network coding bounds to prove the optimality of routing schemes in these two scenarios. In the second part, we studied node-constrained line and star networks. We derived the multiple multicast capacity region of node-constrained line networks based on a low complexity binary linear coding scheme. For star networks, we examined the multiple unicast problem and offered a linear coding scheme. Then we made a connection between the network coding in a node-constrained star network and the problem of index coding with side information. In the third part, we studied the linear deterministic model of relay networks (LDRN). We focused on a unicast session and derived a simple capacity-achieving transmission scheme. We obtained our scheme by a connection to the submodular flow problem through the application of tools from matroid theory and submodular optimization theory. We also offered polynomial-time algorithms for calculating the capacity of the network and the optimal coding scheme. In the final part, we considered the multicasting problem in an LDRN and proposed a new way to construct a coding scheme. Our construction is based on the notion of flow for a unicast session in the third part of this dissertation. We presented randomized and deterministic polynomial-time versions of our algorithm.

Tabatabaei-Yazdi, Seyed

2011-08-01T23:59:59.000Z

462

Data muling over underwater wireless sensor networks using an autonomus underwater vehicle  

E-Print Network (OSTI)

Abstract — We present algorithms, systems, and experimental results for underwater data muling. In data muling a mobile agent interacts with static agents to upload, download, or transport data to a different physical location. We consider a system comprising an Autonomous Underwater Vehicle (AUV) and many static Underwater Sensor Nodes (USN) networked together optically and acoustically. The AUV can locate the static nodes using vision and hover above the static nodes for data upload. We describe the hardware and software architecture of this underwater system, as well as experimental data. Index Terms — Underwater sensor networks, AUV, visionbased navigation, underwater robotics.

Matthew Dunbabin; Peter Corke; Iuliu Vasilescu; Daniela Rus

2006-01-01T23:59:59.000Z

463

Beat Gebistorf Interconnection of Di erent Network Architectures  

E-Print Network (OSTI)

The future of the Internet is unknown, even more as the currently existing mechanisms are a wonky foundation for the requirements of modern users: Huge e orts have to be taken to manage all participating nodes and to enable the attachment of upcoming network patterns like sensor nodes or delay tolerant networks. The ANA (Autonomic Network Architectures) project tries to introduce a solution to the known problems by handling the protocol stack in a more exible way. The ultimate goal of the ANA project is to design and develop a novel network architecture that enables exible, dynamic, and fully autonomic formation of network nodes as well as whole networks. In this semester thesis a new functional block of the ANA protocol stack was implemented which is able to connect the Internet Protocol world with a network equipped with Field Based Service Discovery. The Internet Protocol builds the central protocol of the current Internet whereas Field Based Service Discovery is a novel protocol adequate for service handling in mobile ad hoc networks. Therefore the implemented functional block builds

Professor Prof; Dr. Bernhard Plattner

2008-01-01T23:59:59.000Z

464

Designing Logical Rules to Model the Response of Biomolecular Networks with Complex Interactions: An Application to Cancer Modeling  

Science Conference Proceedings (OSTI)

We discuss the propagation of constraints in eukaryotic interaction networks in relation to model prediction and the identification of critical pathways. In order to cope with posttranslational interactions, we consider two types of nodes in the network, ... Keywords: Systems biology, regulatory networks, posttranslational effects, in-silico analysis, automatic reasoning, cancer.

Carito Guziolowski; Sylvain Blachon; Tatiana Baumuratova; Gautier Stoll; Ovidiu Radulescu; Anne Siegel

2011-09-01T23:59:59.000Z

465

Analysis of an open non-Markovian GI -- (GI| ?)K queueing network with high-rate renewal arrival process  

Science Conference Proceedings (OSTI)

We analyze an open non-Markovian queueing network with high-rate renewal arrival process, Markovian routing, arbitrary service policy, and unlimited number of servers at nodes. We obtain mean values for the number of busy servers at nodes of the queueing ...

A. A. Nazarov; A. N. Moiseev

2013-04-01T23:59:59.000Z

466

Efficient hierarchical analysis of the stability of a network through dimensional reduction of its influence topology  

E-Print Network (OSTI)

The connection between network topology and stability remains unclear. General approaches that clarify this relationship and allow for more efficient stability analysis would be desirable. In this manuscript, I examine the mathematical notion of influence topology, which is fundamentally based on the network reaction stoichiometries and the first derivatives of the reactions with respect to each species at the steady state solution(s). The influence topology is naturally represented as a signed directed bipartite graph with arrows or blunt arrows connecting a species node to a reaction node (positive/negative derivative) or a reaction node to a species node (positive/negative stoichiometry). The set of all such graphs is denumerable. A significant reduction in dimensionality is possible through stoichiometric scaling, cycle compaction, and temporal scaling. All cycles in a network can be read directly from the graph of its influence topology, enabling efficient and intuitive computation of the principal minor...

Kinkhabwala, Ali

2013-01-01T23:59:59.000Z

467

Power management in energy harvesting sensor networks  

E-Print Network (OSTI)

Power management is an important concern in sensor networks, because a tethered energy infrastructure is not available and an obvious concern is to use the available battery energy efficiently. However, in some of the sensor networking applications, an additional facility is available to ameliorate the energy problem: harvesting energy from the environment. Certain considerations in using an energy harvesting source are fundamentally different from that in using a battery because, rather than a limit on the maximum energy, it has a limit on the maximum rate at which the energy can be used. Further, the harvested energy availability typically varies with time in a nondeterministic manner. While a deterministic metric such as residual battery suffices to characterize the energy availability in the case of batteries, a more sophisticated characterization may be required for a harvesting source. Another issue that becomes important in networked systems with multiple harvesting nodes is that different nodes may have different harvesting opportunity. In a distributed application, the same end-user performance may be achieved using different workload allocations, and resultant energy consumptions, at multiple nodes. In this case it is important to align the workload allocation with the energy availability at the harvesting nodes. We consider the above issues in power management for energy harvesting sensor networks. We develop abstractions to characterize the complex time varying nature of such sources with analytically tractable models and use them to address key design issues. We also develop distributed methods to efficiently use harvested energy and test these both in simulation and experimentally on an energy harvesting sensor network, prototyped for this work.

Aman Kansal; Jason Hsu; Sadaf Zahedi; Mani B Srivastava

2006-01-01T23:59:59.000Z

468

Broadband accelerator control network  

SciTech Connect

A broadband data communications network has been implemented at BNL for control of the Alternating Gradient Synchrotron (AG) proton accelerator, using commercial CATV hardware, dual coaxial cables as the communications medium, and spanning 2.0 km. A 4 MHz bandwidth Digital Control channel using CSMA-CA protocol is provided for digital data transmission, with 8 access nodes available over the length of the RELWAY. Each node consists of an rf modem and a microprocessor-based store-and-forward message handler which interfaces the RELWAY to a branch line implemented in GPIB. A gateway to the RELWAY control channel for the (preexisting) AGS Computerized Accelerator Operating system has been constructed using an LSI-11/23 microprocessor as a device in a GPIB branch line. A multilayer communications protocol has been defined for the Digital Control Channel, based on the ISO Open Systems Interconnect layered model, and a RELWAY Device Language defined as the required universal language for device control on this channel.

Skelly, J.; Clifford, T.; Frankel, R.

1983-01-01T23:59:59.000Z

469

Self-healing networks: redundancy and structure  

E-Print Network (OSTI)

We introduce the concept of self-healing in the field of complex networks. Obvious applications range from infrastructural to technological networks. By exploiting the presence of redundant links in recovering the connectivity of the system, we introduce self-healing capabilities through the application of distributed communication protocols granting the "smartness" of the system. We analyze the interplay between redundancies and smart reconfiguration protocols in improving the resilience of networked infrastructures to multiple failures; in particular, we measure the fraction of nodes still served for increasing levels of network damages. We study the effects of different connectivity patterns (planar square-grids, small-world, scale-free networks) on the healing performances. The study of small-world topologies shows us that the introduction of some long-range connections in the planar grids greatly enhances the resilience to multiple failures giving results comparable to the most resilient (but less realis...

Quattrociocchi, Walter; Scala, Antonio

2013-01-01T23:59:59.000Z

470

Page not found | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

81 - 28590 of 31,917 results. 81 - 28590 of 31,917 results. Article U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks Potential security vulnerabilities have been identified with HP Network Node Manager i (NNMi) for HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in cross site scripting (XSS). http://energy.gov/cio/articles/u-229-hp-network-node-manager-i-input-validation-flaw-permits-cross-site-scripting Article Passive Housing for an Aggressive Region A telling perspective of Washingtonian's connection with their energy consumption, architecture and ambition in their professional and personal lives. http://energy.gov/energysaver/articles/passive-housing-aggressive-region Article U-258: Adobe Flash Player Flaw Lets Remote Users Execute Arbitrary

471

Optimal Energy Management Policies for Energy Harvesting Sensor Nodes  

E-Print Network (OSTI)

1 Optimal Energy Management Policies for Energy Harvesting Sensor Nodes Vinod Sharma, Senior Member the energy available at that time. We obtain energy management policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies

Sharma, Vinod

472

Soft-core processor study for node-based architectures.  

SciTech Connect

Node-based architecture (NBA) designs for future satellite projects hold the promise of decreasing system development time and costs, size, weight, and power and positioning the laboratory to address other emerging mission opportunities quickly. Reconfigurable Field Programmable Gate Array (FPGA) based modules will comprise the core of several of the NBA nodes. Microprocessing capabilities will be necessary with varying degrees of mission-specific performance requirements on these nodes. To enable the flexibility of these reconfigurable nodes, it is advantageous to incorporate the microprocessor into the FPGA itself, either as a hardcore processor built into the FPGA or as a soft-core processor built out of FPGA elements. This document describes the evaluation of three reconfigurable FPGA based processors for use in future NBA systems--two soft cores (MicroBlaze and non-fault-tolerant LEON) and one hard core (PowerPC 405). Two standard performance benchmark applications were developed for each processor. The first, Dhrystone, is a fixed-point operation metric. The second, Whetstone, is a floating-point operation metric. Several trials were run at varying code locations, loop counts, processor speeds, and cache configurations. FPGA resource utilization was recorded for each configuration. Cache configurations impacted the results greatly; for optimal processor efficiency it is necessary to enable caches on the processors. Processor caches carry a penalty; cache error mitigation is necessary when operating in a radiation environment.

Van Houten, Jonathan Roger; Jarosz, Jason P.; Welch, Benjamin James; Gallegos, Daniel E.; Learn, Mark Walter

2008-09-01T23:59:59.000Z

473

Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes  

E-Print Network (OSTI)

Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes Christian Renner, J step towards reaching this goal: It explores discharging-characteristics of supercapacitors, discusses-ion polymers, supercapacitors can last for 10 years or even more. Superca- pacitors do not need a complex

Turau, Volker

474

A Performance Evaluation of an Alpha EV7 Processing Node  

Science Conference Proceedings (OSTI)

In this paper we detail the performance of a new Alpha-Server node containing 16 Alpha EV7 CPUs. The EV7 processor is based on the EV68 processor core that is used in terascale systems at Los Alamos National Laboratory and the Pittsburgh Supercomputing ... Keywords: Performance, analysis, application performance, communication performance, high performance computing, memory performance

Darren J. Kerbyson; Adolfy Hoisie; Scott Pakin; Fabrizio Petrini; Harvey J. Wasserman

2004-05-01T23:59:59.000Z

475

Gating internal nodes to reduce power during scan shift  

Science Conference Proceedings (OSTI)

It is a common practice to gate a limited number of scan cells in order to reduce overall switching activity during shift, thereby, reducing the circuit's dynamic power consumption. In this paper, we propose a novel approach to reduce overall shift power ... Keywords: gating internal nodes, low power test, scan shift power reduction

Dheepakkumaran Jayaraman; Rajamani Sethuram; Spyros Tragoudas

2010-05-01T23:59:59.000Z

476

Node-link mapping principles for visualizing knowledge and information  

Science Conference Proceedings (OSTI)

This chapter describes the Texas Christian University Node-Link Mapping (TCU-NLM) system, and traces its empirical and applied history from 1972 to the present. TCU-NLM, which consists of information, guide, and freestyle maps, has been explored in the ...

Donald F. Dansereau

2005-01-01T23:59:59.000Z

477

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

DOE Patents (OSTI)

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.

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-10T23:59:59.000Z

478

HP White Laboratory, Inc.  

Science Conference Proceedings (OSTI)

... Send E-Mail to NVLAP at: NVLAP@nist.gov. Personal Body Armor Testing. ... 7 Ballistic Resistance of Body Armor, Section 7, Ballistic Test Methods. ...

2014-01-03T23:59:59.000Z

479

New HP 1304A  

E-Print Network (OSTI)

of others will make you more productive (and more valuable!) If no one else has seen the problem, you must solve it yourself. At this stage, apply the Rules of Logical Troubleshooting. This consists of “milking ” the instrument for all symptoms available. Use your eyes, ears and nose. Are lights lit? Readouts active? Are there any signs of heat or broken components? Are there any abnormal sounds? Pops, hissing, hum? Is there a smell associated with a particular area? Essence

Servl Ce; Info R Mati; N From; He Wlett-packard

1981-01-01T23:59:59.000Z

480

SRC burn test in 700-hp oil-designed boiler. Annex Volume C. Boiler emission report. Final technical report  

Science Conference Proceedings (OSTI)

The Solvent-Refined Coal (SRC) test burn program was conducted at the Pittsburgh Energy Technology Center (PETC) located in Bruceton, Pa. One of the objectives of the study was to determine the feasibility of burning SRC fuels in boilers set up for fuel oil firing and to characterize emissions. Testing was conducted on the 700-hp oil-fired boiler used for research projects. No. 6 fuel oil was used for baseline data comparison, and the following SRC fuels were tested: SRC Fuel (pulverized SRC), SRC Residual Oil, and SRC-Water Slurry. Uncontrolled particulate emission rates averaged 0.9243 lb/10/sup 6/ Btu for SRC Fuel, 0.1970 lb/10/sup 6/ Btu for SRC Residual Oil, and 0.9085 lb/10/sup 6/ Btu for SRC-Water Slurry. On a lb/10/sup 6/ Btu basis, emissions from SRC Residual Oil averaged 79 and 78%, respectively, lower than the SRC Fuel and SRC-Water Slurry. The lower SRC Residual Oil emissions were due, in part, to the lower ash content of the oil and more efficient combustion. The SRC Fuel had the highest emission rate, but only 2% higher than the SRC-Water Slurry. Each fuel type was tested under variable boiler operating parameters to determine its effect on boiler emissions. The program successfully demonstrated that the SRC fuels could be burned in fuel oil boilers modified to handle SRC fuels. This report details the particulate emission program and results from testing conducted at the boiler outlet located before the mobile precipitator take-off duct. The sampling method was EPA Method 17, which uses an in-stack filter.

Not Available

1983-09-01T23:59:59.000Z

Note: This page contains sample records for the topic "hp network node" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

Energy Management in Wireless Sensor Network Operations  

E-Print Network (OSTI)

In this dissertation, we develop and analyze effective energy management policies for wireless sensor networks in emerging applications. Existing methods in this area have primarily focused on energy conservation through the use of various communication techniques. However, in most applications of wireless sensor networks, savings in energy come at the expense of several performance parameters. Therefore it is necessary to manage energy consumption while being conscious of its effects on performance. In most cases, such energy-performance issues are specific to the nature of the application. Our research has been motivated by new techniques and applications where efficient energy-performance trade-off decisions are required. We primarily study the following trade-off cases: energy and node replacement costs (Case I), energy and delay (Case II), and energy and availability (Case III). We consider these trade-off situations separately in three distinct problem scenarios. In the first problem (Case I), we consider minimizing energy and node replacement costs in underwater wireless sensor networks for seismic monitoring application. In this case, we introduce mixed-integer programming (MIP) formulations based on a combined routing and node replacement policy approach and develop effective policies for large problem instances where our MIP models are intractable. In the second problem (Case II), we develop a Markov decision process (MDP) model to manage energy-delay trade-off in network coding which is a new energy-saving technique for wireless networks. Here we derive properties of the optimal policy and develop in- sights into other simple policies that are later shown to be efficient in particular situations. In the third problem (Case III), we consider an autonomous energy harvesting sensor network where nodes are turned off from time to time to operate in an “energy-neutral” manner. In this case, we use stochastic fluid-flow analysis to evaluate and analyze the availability of the sensor nodes under effective energy management policies. In each of the above problem cases, we develop analytical formulations, and derive and/or analyze policies that effectively manage the considered energy-performance trade-off. Overall, our analyses and solution methods make new contributions to both operations research and communication networking literature.

Mohapatra, Arupa Kumar

2013-08-01T23:59:59.000Z

482

Capacity Proportional Unstructured Peer-to-Peer Networks  

E-Print Network (OSTI)

Existing methods to utilize capacity-heterogeneity in a P2P system either rely on constructing special overlays with capacity-proportional node degree or use topology adaptation to match a node's capacity with that of its neighbors. In existing P2P networks, which are often characterized by diverse node capacities and high churn, these methods may require large node degree or continuous topology adaptation, potentially making them infeasible due to their high overhead. In this thesis, we propose an unstructured P2P system that attempts to address these issues. We first prove that the overall throughput of search queries in a heterogeneous network is maximized if and only if traffic load through each node is proportional to its capacity. Our proposed system achieves this traffic distribution by biasing search walks using the Metropolis-Hastings algorithm, without requiring any special underlying topology. We then define two saturation metrics for measuring the performance of overlay networks: one for quantifying their ability to support random walks and the second for measuring their potential to handle the overhead caused by churn. Using simulations, we finally compare our proposed method with Gia, an existing system which uses topology adaptation, and find that the former performs better under all studied conditions, both saturation metrics, and such end-to-end parameters as query success rate, latency, and query-hits for various file replication schemes.

Reddy, Chandan Rama

2009-08-01T23:59:59.000Z

483

Efficient Production Optimization Using Flow Network Models  

E-Print Network (OSTI)

Reservoir simulation is an important tool for decision making and field development management. It enables reservoir engineers to predict reservoir production performance, update an existing model to reproduce monitoring data, assess alternative field development scenarios and design robust production optimization strategies by taking into account the existing uncertainties. A big obstacle in automating model calibration and production optimization approaches is the massive computation required to predict the response of real reservoirs under proposed changes in the model inputs. To speed up reservoir response predictions without compromising accuracy, fast surrogate models have been proposed. These models are either derived by preserving the physics of the involved processes (e.g. mass balance equations) to provide reliable long-range predictions or are developed based solely on statistical relations, in which case they can only provide short-range predictions due to the absence of the physical processes that govern the long-term behavior of the reservoir. We present an alternative solution that combines the advantages of both statistics-based and physics-based methods by deriving the flow predictions in complex two-dimensional models from one-dimensional flow network models. The existing injection/production wells in the original model form the nodes or vertices of the flow network. Each pair of wells (nodes) in the flow network is connected using a one-dimensional numerical simulation model; hence, the entire reservoir is reduced to a connected network of one-dimensional simulation models where the coupling between the individual one-dimensional models is enforced at the nodes where network edges intersect. The proposed flow network model provides a useful and fast tool for characterizing inter-well connectivity, estimating drainage volume between each pair of wells, and predicting reservoir production over an extended period of time for optimization purposes. We estimate the parameters of the flow network model using a robust training approach to ensure that the flow network model reproduces the response of the original full model under a wide range of development strategies. This step helps preserve the flow network model's predictive power during the production optimization when development strategies can change at different iterations. The robust networks training and the subsequent production optimization iterations are computationally efficient as they are performed with the faster flow network model. We demonstrate the effectiveness and applicability of our proposed flow network modeling approach to rapid production optimization using two-phase waterflooding simulations in synthetic and benchmark models.

Lerlertpakdee, Pongsathorn

2012-08-01T23:59:59.000Z

484

? Capacity-based design [Preliminary for Part 2] 2. Energy Harvesting Networks Transmission Completion Time Minimization for single link  

E-Print Network (OSTI)

Transmission Completion Time Minimization for single link w / finite battery Extension to fading channels Transmission policies with inefficient energy storage IEEE ICC 2013, Budapest, Hungary 6/9/2013 Goals ? Energy Efficiency (EE): What it meant last decade; what it means today ? From a communication network design perspective what should we care about for energy efficient design of cellular/conventional wireless networks? (greenish) rechargeable/energy harvesting networks? (green) ? Communication with energy harvesting nodes Green, self-sufficient nodes with extended network lifetime Relatively new field with increasing interest IEEE ICC 2013, Budapest, Hungary 6/9/2013 Prerequisites for the Tutorial

Aylin Yener; Short Term; Throughput Maximization

2013-01-01T23:59:59.000Z

485

Evaluation of Metadata-Based Data Aggregation Scheme in Clustering Wireless Sensor Networks  

Science Conference Proceedings (OSTI)

In a wireless sensor network (WSN) system, an important problem for the special application, in which the battery of a sensor node cannot be exchanged, is how to extend the life time of the entire WSN system. In the past we proposed an improvement to ... Keywords: energy efficiency, power consumption, wireless sensor network

Yoshitsugu Obashi; Tomohiro Kokogawa; Yi Zheng; Huifang Chen; Hiroshi Mineno; Tadanori Mizuno

2007-09-01T23:59:59.000Z

486

An Efficient Multi-Channel MAC Protocol for Mobile Ad Hoc Networks  

Science Conference Proceedings (OSTI)

This paper proposes a novel multi-channel MAC protocol for mobile ad hoc networks that enables the nodes to transmit packets in distributed channels. In our protocol, the ATIM window is divided into two windows. The first window is called deciding channel ... Keywords: Ad hoc network, media access control (MAC), multi-channel

Wen-Hwa Liao; Wen-Chin Chung

2009-01-01T23:59:59.000Z

487

Minimization of voltage deviation and power losses in power networks using Pareto optimization methods  

Science Conference Proceedings (OSTI)

Voltage regulation is an important task in electrical engineering for controlling node voltages in a power network. A widely used solution for the problem of voltage regulation is based on adjusting the taps in under load tap changers (ULTCs) power transformers ... Keywords: Multi-objective optimization, Power distribution network, Power losses, Under load tap changers, Voltage regulation

Francisco G. Montoya; Raúl Bańos; Consolación Gil; Antonio Espín; Alfredo Alcayde; Julio Gómez

2010-08-01T23:59:59.000Z

488

On energy efficiency of geographic opportunistic routing in lossy multihop wireless networks  

Science Conference Proceedings (OSTI)

Geographic opportunistic routing (GOR) is an emerging technique that can improve energy efficiency in lossy multihop wireless networks. GOR makes local routing decision by using nodes' location information, and exploits the broadcast nature and spatial ... Keywords: Energy efficiency, Geographic opportunistic routing, Multihop wireless networks

Kai Zeng; Jie Yang; Wenjing Lou

2012-11-01T23:59:59.000Z

489

IDRA: A flexible system architecture for next generation wireless sensor networks  

Science Conference Proceedings (OSTI)

Wireless sensor networks consist of embedded devices (sensor nodes), equipped with a low-power radio. They are used for many applications: from wireless building automation to e-health applications. However, due to the limited capabilities of sensor ... Keywords: Architecture, Energy efficiency, Experimental evaluation, Heterogeneity, Mobility, Protocol selection, QoS, Wireless sensor networks

Eli De Poorter; Evy Troubleyn; Ingrid Moerman; Piet Demeester

2011-08-01T23:59:59.000Z

490

Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks  

Science Conference Proceedings (OSTI)

Mobile ad hoc networks may be composed of a large number of nodes and hence a hierarchical cluster-based structure can be employed to address the scalability issues of the large network. In this paper we propose a size-restricted, distributed clustering ...

Gayathri Venkataraman; Sabu Emmanuel; Srikanthan Thambipillai

2007-03-01T23:59:59.000Z

491