National Library of Energy BETA

Sample records for network node manager

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

    E-Print Network [OSTI]

    Athanassios Boulis; Mani Srivastava

    2004-01-01

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

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

    E-Print Network [OSTI]

    Sharma, Vinod

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

  3. Reconfigureable network node

    DOE Patents [OSTI]

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

    2008-04-08

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

  4. Modular sensor network node

    DOE Patents [OSTI]

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

    2008-06-10

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

  5. Network Management Network Management

    E-Print Network [OSTI]

    Giaccone, Paolo

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

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

    E-Print Network [OSTI]

    Gnawali, Omprakash

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

  7. Network Management Network Management

    E-Print Network [OSTI]

    Giaccone, Paolo

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

  8. Infrastructure for Testing Nodes of a Wireless Sensor Network

    E-Print Network [OSTI]

    Zilic, Zeljko

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

  9. Cooperative Replication in Content Networks with Nodes under Churn

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

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

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

    E-Print Network [OSTI]

    Anandkumar, Animashree

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

  11. Computationally Simple Battery Management Techniques for Wireless Nodes

    E-Print Network [OSTI]

    Sarkar, Saswati

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

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

    E-Print Network [OSTI]

    Ulukus, Sennur

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

  13. IEEE 342 Node Low Voltage Networked Test System

    SciTech Connect (OSTI)

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

    2014-07-31

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

  14. Performance of wireless sensor networks under random node failures

    SciTech Connect (OSTI)

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

    2011-01-28

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

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

    DOE Patents [OSTI]

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

    1995-01-01

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

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

    DOE Patents [OSTI]

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

    1995-12-26

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

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

    E-Print Network [OSTI]

    Jiang, Hai

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

  18. Ranking nodes in growing networks: When PageRank fails

    E-Print Network [OSTI]

    Mariani, Manuel Sebastian; Zhang, Yi-Cheng

    2015-01-01

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

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

    SciTech Connect (OSTI)

    Kim, M; Leskovec, J

    2011-11-14

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

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

    E-Print Network [OSTI]

    Littman, Michael L.

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

  1. Prediction and Management in Energy Harvested Wireless Sensor Nodes

    E-Print Network [OSTI]

    Simunic, Tajana

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

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

    E-Print Network [OSTI]

    Ulukus, Sennur

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

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

    E-Print Network [OSTI]

    Basireddy, Ashish

    2012-07-16

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

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

    E-Print Network [OSTI]

    Martin, Ralph R.

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

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

    DOE Patents [OSTI]

    Faraj, Ahmad A. (Rochester, MN)

    2010-01-26

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

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

    E-Print Network [OSTI]

    Wagner, Flávio Rech

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

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

    E-Print Network [OSTI]

    Starobinski, David

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

  8. Interference management techniques in large-scale wireless networks 

    E-Print Network [OSTI]

    Luo, Yi

    2015-06-29

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

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

    E-Print Network [OSTI]

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

    2015-01-01

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

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

    E-Print Network [OSTI]

    Zhou, Xiangyun "Sean"

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

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

    E-Print Network [OSTI]

    Sikdar, Biplab

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

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

    DOE Patents [OSTI]

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

    2012-05-29

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

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

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

    Derr, Kurt; Manic, Milos

    2015-01-01

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

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

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

    Derr, Kurt; Manic, Milos

    2015-06-01

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

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

    E-Print Network [OSTI]

    Pota, Himanshu Roy

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

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

    E-Print Network [OSTI]

    Stojanovic, Milica

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

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

    E-Print Network [OSTI]

    Miller, Russ

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

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

    DOE Patents [OSTI]

    Napolitano, L.M. Jr.

    1995-11-28

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

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

    E-Print Network [OSTI]

    Kim, Kwangjo

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

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

    SciTech Connect (OSTI)

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

    2014-07-15

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

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

    E-Print Network [OSTI]

    Sen, Sandip

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

  2. Impact of Node Heterogeneity in ZigBee Mesh Network Routing

    E-Print Network [OSTI]

    Chen, Ling-Jyh

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

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

    E-Print Network [OSTI]

    El-Gamal, Hesham

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

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

    E-Print Network [OSTI]

    Hexmoor, Henry

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

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

    E-Print Network [OSTI]

    Chen, Yu

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

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

    SciTech Connect (OSTI)

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

    2013-12-15

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

  7. Self-Adaptive Power Management of Idle Nodes in Large Scale Systems

    E-Print Network [OSTI]

    Zhu, Hong

    Self-Adaptive Power Management of Idle Nodes in Large Scale Systems YONGPENG LIU(1) , HONG ZHU(2 with multiple level dynamic sleep mechanisms to reduce power consumption. However, awaking sleeping nodes takes to balance between the systems energy consumption and the response time is a key problem in the power

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

    E-Print Network [OSTI]

    Vaze, Rahul

    2012-01-01

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

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

    E-Print Network [OSTI]

    Eliassen, Frank

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Koopman, Philip

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

  12. Classification ofAttributes and Behavior in Risk Management Using Bayesian Networks

    E-Print Network [OSTI]

    Akl, Robert

    Classification ofAttributes and Behavior in Risk Management Using Bayesian Networks Ram Dantu path from the root to the end node suitable vulnerability analysis and risk management strategies-Attack Graphs, Behavior, Risk Management and risk management with these graph transitions. For many years

  13. Load Balancing in Broadband Multi-Service Networks: A Management Perspective

    E-Print Network [OSTI]

    Griffin, David

    66/1 Load Balancing in Broadband Multi-Service Networks: A Management Perspective Panos Georgatsos1 nodes may be managed by a TMN system, by virtue of a management service called Load Balancing the objectives of the proposed Load Balancing management service. 1. Introduction The essential target of future

  14. Optimal Energy Management Policies for Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

    .e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies by energy harvesting techniques ([11], [12]). Common energy harvesting devices are solar cells, wind turbines and piezo-electric cells, which extract energy from the environment. Among these, solar harvesting

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

    DOE Patents [OSTI]

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

    2012-10-23

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

  16. Congestion management in electricity networks

    E-Print Network [OSTI]

    Holmberg, Pärr; Lazarczyk, Ewa

    2012-04-25

     comparison of market designs    Another strand of literature compares different pricing strategies for real markets; often the  system  in  place  with  an  optimal  electricity  dispatch  based  on  LMP.  Bernard  and  Guertin  (2002)  simulate  a  three?node  model  of  Hydro...  effects. They show that a zone allocation system based  on the absolute values of optimal nodal price differences does not necessarily lead to a zonal  system with maximal social surplus and they present an example of a small network where  they  identify  a  multitude  of  possible  zone  constructions...

  17. MMS: An Autonomic Network-Layer Foundation for Network Management

    E-Print Network [OSTI]

    Ng, T. S. Eugene

    secured, and/or suboptimal in performance. This paper presents the design and implementation of the Meta-Management1 MMS: An Autonomic Network-Layer Foundation for Network Management Hemant Gogineni, Albert Research §Rice University Abstract-- Networks cannot be managed without management plane communications

  18. Simplifying and speeding the management of intra-node cache coherence

    DOE Patents [OSTI]

    Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton on Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Phillip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Ohmacht, Martin (Yorktown Heights, NY)

    2012-04-17

    A method and apparatus for managing coherence between two processors of a two processor node of a multi-processor computer system. Generally the present invention relates to a software algorithm that simplifies and significantly speeds the management of cache coherence in a message passing parallel computer, and to hardware apparatus that assists this cache coherence algorithm. The software algorithm uses the opening and closing of put/get windows to coordinate the activated required to achieve cache coherence. The hardware apparatus may be an extension to the hardware address decode, that creates, in the physical memory address space of the node, an area of virtual memory that (a) does not actually exist, and (b) is therefore able to respond instantly to read and write requests from the processing elements.

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

    DOE Patents [OSTI]

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

    2011-09-20

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

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

    DOE Patents [OSTI]

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

    2010-03-02

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

  1. HIERARCHICAL MANAGEMENT OF BATTLEFIELD NETWORKS WITH THE SHAMAN MANAGEMENT SYSTEM

    E-Print Network [OSTI]

    Sethi, Adarshpal

    HIERARCHICAL MANAGEMENT OF BATTLEFIELD NETWORKS WITH THE SHAMAN MANAGEMENT SYSTEM Adarshpal S Architecture for MANagement) is a novel management framework developed at the University of Delaware as a part of the research in network management sponsored by the ATIRP Consortium. SHAMAN extends the traditional flat SNMP

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

    SciTech Connect (OSTI)

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

    2013-01-01

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

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

    E-Print Network [OSTI]

    Zhang, Wensheng

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

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

    SciTech Connect (OSTI)

    Postel, John; Bannister, Joe

    2000-03-15

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

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

    E-Print Network [OSTI]

    Liu, Donggang

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

  6. Power Management in Wireless Networks Kevin Klues

    E-Print Network [OSTI]

    Jain, Raj

    Power Management in Wireless Networks Kevin Klues Abstract This paper presents a survey on the various power saving techniques used in wireless networking today. The work presented covers topics at each layer of a wireless networking protocol stack. The types of wireless networks considered include

  7. Truthful resource management in wireless ad hoc networks 

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01

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

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

    DOE Patents [OSTI]

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

    2013-08-27

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

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

    E-Print Network [OSTI]

    Zhao, Feng

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

  10. Sensor Network for Motor Energy Management | Department of Energy

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

    Sensor Network for Motor Energy Management Sensor Network for Motor Energy Management Remote Sensing Electric Motor Operation Optimizes Maintenance and Energy Efficiency Electric...

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

    E-Print Network [OSTI]

    Wu, Hongyi

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

  12. Traffic Management and Net Neutrality in Wireless Networks

    E-Print Network [OSTI]

    Jordan, Scott

    2011-01-01

    and resource allocation in wireless multimedia networks.between wired and wireless networks, and hence on potentialManagement for Wireless Networks. Artech House Publishers,

  13. Energy Management in Wireless Sensor Network Operations 

    E-Print Network [OSTI]

    Mohapatra, Arupa Kumar

    2013-07-26

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

  14. Energy-Aware Adaptive Network Resource Management

    E-Print Network [OSTI]

    Haddadi, Hamed

    Energy-Aware Adaptive Network Resource Management M. Charalambides, D. Tuncer, L. Mamatas, G protocols, this can lead to periods of resource under- utilization and constant energy consumption solutions are still missing. Existing approaches in the literature that address energy efficiency in network

  15. Dynamic Bandwidth Management in ATM Networks

    E-Print Network [OSTI]

    Griffin, David

    to the optimal configuration and operation of the network at all times, to accept successfully the highest is not the subject of this paper. Network availability is concerned with the cost-effective planning and maintenance-Healing Restoration statistic s and fault alarms VPC bw (to CAC) · Fault Manager · Perfor mance Verification · Current

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

    E-Print Network [OSTI]

    Misra, Satyajayant

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

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

    E-Print Network [OSTI]

    Wolisz, Adam

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

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

    E-Print Network [OSTI]

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

  19. INFORMATION NETWORKS TECHNOLOGY MANAGEMENT Spring 2015

    E-Print Network [OSTI]

    MSIS 5623 INFORMATION NETWORKS TECHNOLOGY MANAGEMENT Spring 2015 Spears School of Business Oklahoma State University Instructor: Dr. Jeretta Horn Nord, Professor Management Science and Information Systems Classroom: Online Class: http://oc.okstate.edu Contact Information: Office: Business 223 Stillwater Email

  20. Topology management protocols in ad hoc wireless sensor networks 

    E-Print Network [OSTI]

    Kim, Hogil

    2009-05-15

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

  1. Copyright: CGI Europe -Certis Service & Network ManagementService & Network Management

    E-Print Network [OSTI]

    Abu-Rgheff, Mosa Ali

    #12;Copyright: CGI Europe - Certis Service & Network ManagementService & Network Management IntroductionIntroduction Peter.Fellows@certis.co.uk #12;Copyright: CGI Europe - Certis ContentContent l: CGI Europe - Certis Service ExpectationsService Expectations Wire-line Cellular Data Connection

  2. Usicg Semantic Networks Data Base Management

    E-Print Network [OSTI]

    Mylopoulos, John

    144 Usicg Semantic Networks for Data Base Management bY Nicholas Roussopoulos John FIylopoulos. INTRODUCTION=------,---- "he usefulness of Data Base tlanagement Systems (DBMSs) is severely restricted on the execution of a particular data base operation the current systems can account for are related to cost

  3. Policy Management for Networked Systems and Applications

    E-Print Network [OSTI]

    Lee, Kang-Won

    Policy Management for Networked Systems and Applications Dakshi Agrawal, Seraphin Calo, James Giles {agrawal,scalo,gilesjam,kangwon,dverma}@us.ibm.com Abstract In this paper, we present a novel policy and administrative domains. The proposed policy middleware provides a standard infrastructure for the creation

  4. Power Management Mechanism Exploiting Network and Video Information over Wireless

    E-Print Network [OSTI]

    Bouras, Christos

    Power Management Mechanism Exploiting Network and Video Information over Wireless Links Christos- layer information from higher network layers may be utilized for more efficient power management that fine- tune transmission power according to information received from the transport (feedback reports

  5. Power Management Mechanism Exploiting Network and Video Information over Wireless

    E-Print Network [OSTI]

    Bouras, Christos

    Power Management Mechanism Exploiting Network and Video Information over Wireless Links Christos information from higher network layers may be utilized for more efficient power management in wireless- tune transmission power according to information received from the transport (feedback reports from

  6. GDMN : An Information Management Network for Distributed Systems

    E-Print Network [OSTI]

    Sengupta, Raja

    GDMN : An Information Management Network for Distributed Systems Amit Mahajan {amahajan from the system. 1 Introduction There are many systems that produce and con- sume information at many sites distributed over large geographical areas. Battlefield networks, traffic management systems

  7. Distributed Mobility Management for Target Tracking in Mobile Sensor Networks

    E-Print Network [OSTI]

    Chakrabarty, Krishnendu

    --Wireless mobile sensor networks, mobility management, target tracking, Bayesian, distributed system. Ç 1 of scarce resources, such as energy and network bandwidth. Furthermore, the mobility management schemeDistributed Mobility Management for Target Tracking in Mobile Sensor Networks Yi Zou, Member, IEEE

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

    E-Print Network [OSTI]

    Yao, Zhongmei

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

  9. Resource management in heterogeneous wireless sensor networks

    E-Print Network [OSTI]

    Regini, Edoardo

    2009-01-01

    5.4: Forwarding through nodes in PSM vs active nodes, 100ms,the 802.11 Power Saving Mode (PSM)[2] as its power sav- inga set of modifications to the PSM thus requiring a new MAC

  10. Autonomous Network Management Using Cooperative Learning for Network-Wide Load

    E-Print Network [OSTI]

    Yoo, S. J. Ben

    Autonomous Network Management Using Cooperative Learning for Network-Wide Load Balancing-wide load balance, we propose Autonomous Network management with Team learning based Self shortest paths while uncongested longer paths may be underutilized. To maintain network-wide load balancing

  11. Policy 130 ver 1 Title: Management of the Wireless Network

    E-Print Network [OSTI]

    Karczmarek, Joanna

    Policy 130 ver 1 Title: Management of the Wireless Network Cover - Heading Information Table Page-President, Academic and Provost Title: Management of the Wireless Network Preamble - Background & Purposes The Problem functions and duties. The UBC wireless network, provided by UBC IT, is part of UBC's telecommunications

  12. Resource Management in Multi-hop Ad Hoc Networks

    E-Print Network [OSTI]

    , they do not provide a way to control the consumption of resources in the network, such as the battery power or the carrying capacity of the nodes. This proposal describes a scheme of path-state and flow : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 5.2 Balancing Battery Life

  13. Overcomplete Radon Bases for Target Property Management in Sensor Networks

    E-Print Network [OSTI]

    Guibas, Leonidas J.

    Overcomplete Radon Bases for Target Property Management in Sensor Networks Xiaoye Jiang Stanford, exploiting an overcomplete Radon basis dictionary to model property uncertainty in such cir- cumstances

  14. V-125: Cisco Connected Grid Network Management System Multiple...

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

    System 2.x ABSTRACT: Some vulnerabilities have been reported in Cisco Connected Grid Network Management System. REFERENCE LINKS: Cisco Security Notice CVE-2013-1163 Cisco...

  15. On the performance management of heterogeneous networks using SNMP 

    E-Print Network [OSTI]

    Kunapareddy, Padmaja

    1998-01-01

    and WANs with multi-vendor devices strongly perceives the need for an effective network management system. This burgeoning demand has lead to proliferation of different ways of managing and monitoring the devices. As a ...

  16. Introduction Operations Management of Blood Banking Systems Blood Banking Systems Network Design Supply Chain Network

    E-Print Network [OSTI]

    Nagurney, Anna

    Introduction Operations Management of Blood Banking Systems Blood Banking Systems Network Design Supply Chain Network Operations Management and Design of A Sustainable Blood Banking System Amir Masoumi of Massachusetts Amherst #12;Introduction Operations Management of Blood Banking Systems Blood Banking Systems

  17. An Open and Integrated Management Platform for Wireless Sensor Networks

    E-Print Network [OSTI]

    Varvarigo, Emmanouel "Manos"

    such as heterogeneity, limited bandwidth and energy constraints, WSN management and monitoring architectures need to and management platform, and OpenRSM, an open source integrated remote systems and network management platform. The proposed system architecture can support several levels of integration (infrastructure management

  18. A brief guide to access the Wound Healing and Management (WHAM) Node via JBI COnNECT+

    E-Print Network [OSTI]

    Mucina, Ladislav

    (WHAM) click on the Node title as indicated by the red arrow. #12; Enter your search term; in this example I have entered the term `wound' And/or use the drop-down menus to define the boundaries of your search. #12; The search term `wound' within the WHAM Node returned 35 Evidence Summaries; 7 Recommended

  19. Design and implementation of an integrated network management system for TCP/IP-based distributed networks 

    E-Print Network [OSTI]

    Patel, Samir K.

    1993-01-01

    in designing of tools for network management. Various workstation vendors have developed such tools for their window systems, but many of the tools are not compatible for other systems. The X Window System, however, provides hardware independent and network...

  20. Towards All-IP Wireless Networks: Architectures and Resource Management

    E-Print Network [OSTI]

    Boutaba, Raouf

    Towards All-IP Wireless Networks: Architectures and Resource Management Mechanism Majid Ghaderi-IP network integrating different wireless technologies using IP and its associated service models. The first to facilitate the integration of wireless LAN and 3G cellular networks towards a uniform architecture for all

  1. Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks

    E-Print Network [OSTI]

    Koksal, Can Emre

    Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks Ren-Shiou Liu CSE@ece.osu.edu Abstract--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

  2. Wireless Network Capacity Management: A Real Options Approach

    E-Print Network [OSTI]

    Forsyth, Peter A.

    Wireless Network Capacity Management: A Real Options Approach Y. d'Halluin , P.A. Forsyth , and K factor algorithm is developed, based on a real options formulation. Numerical examples are provided to illustrate various aspects of the model. Keywords: real options, optimal network planning decisions, network

  3. Extra-Large Memory Nodes

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

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

  4. Automated Scalable Management of Data Center Networks

    E-Print Network [OSTI]

    Niranjan Mysore, Radhika

    2.2.1 Data Center Networks . . . . . . . . . . . . . . . .A Scalable Fault Tolerant Layer 2 Data Center NetworkExpress Lanes in Multi-Tenant Data Centers . . . . . . .

  5. V-014: Cisco Prime Data Center Network Manager JBoss RMI Services...

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

    4: Cisco Prime Data Center Network Manager JBoss RMI Services Let Remote Users Execute Arbitrary Commands V-014: Cisco Prime Data Center Network Manager JBoss RMI Services Let...

  6. Compute Nodes

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

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

  7. A STATISTICAL NEURAL NETWORK FRAMEWORK FOR RISK MANAGEMENT PROCESS

    E-Print Network [OSTI]

    Basili, Victor R.

    A STATISTICAL NEURAL NETWORK FRAMEWORK FOR RISK MANAGEMENT PROCESS From the Proposal to its of Maryland, A.V. Williams Bldg. 115, College Park 20742, MD, USA basili@cs.umd.edu Keywords: Risk Management available formal risk management models and related frameworks by providing an independent mechanism

  8. Multilayer Network Model for Analysis and Management of Change Propagation

    E-Print Network [OSTI]

    de Weck, Olivier L.

    1 Multilayer Network Model for Analysis and Management of Change Propagation Michael C. Pasqual · Olivier L. de Weck Abstract A pervasive problem for engineering change management is the phenomenon and management of change propagation using the model. The repository includes a few novel tools and metrics, most

  9. TMN conference Page 1 Traffic Management for IBC networks

    E-Print Network [OSTI]

    Griffin, David

    manager. This is particularly useful for congestion control and load balancing as well as reTMN conference Page 1 Traffic Management for IBC networks by David Griffin (GPT Ltd) and Pravin Patel (Dowty Communications Ltd) 1 Introduction This paper concentrates on the traffic management

  10. An Architecture for Energy Management in Wireless Sensor Networks

    E-Print Network [OSTI]

    California at Berkeley, University of

    An Architecture for Energy Management in Wireless Sensor Networks Xiaofan Jiang, Jay Taneja, Jorge, it is important that sen- sornets have long and predictable lifetimes. We thus expect energy management to play-grained and flexible manner. At the other extreme, low-level energy management mecha- nisms that give direct control

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

    E-Print Network [OSTI]

    Zhang, Wensheng

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

  12. Management of Network and Energy Resources in Cognitive and Self-Organizing Wireless Networks

    E-Print Network [OSTI]

    Kouroupetroglou, Georgios

    Management of Network and Energy Resources in Cognitive and Self-Organizing Wireless Networks of different devices. We propose a novel approach for energy saving and resource management in a wire- less University of Athens akousar@di.uoa.gr Abstract. The reduction of the consumed energy in modern self

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

    SciTech Connect (OSTI)

    Cree, Johnathan V.; Delgado-Frias, Jose

    2013-04-19

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

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

    Broader source: Energy.gov [DOE]

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

  15. DYNAMIC MANAGEMENT OF NETWORK SYSTEMS Syed Yousaf Shah

    E-Print Network [OSTI]

    Linhardt, Robert J.

    OF TABLES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi LIST OF FIGURES . . . . . . . . . . . . . 16 3.3 Dynamic Price Based Routing (PBR) . . . . . . . . . . . . . . . . . . . . 17 3 . . . . . . . . . . . . . . . . . . . . 29 3.5 Price Based Routing for Network Resource Management . . . . . . . . . 33 3.6 Concluding

  16. V-120: EMC Smarts Network Configuration Manager Java RMI Access...

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

    EMC Smarts Network Configuration Manager Java RMI Access Control Flaw Lets Remote Users Gain Full Control PLATFORM: Version(s): prior to 9.2 ABSTRACT: Two vulnerabilities were...

  17. New Frontiers in Internet Network Management Ehab Al-Shaer+

    E-Print Network [OSTI]

    Ng, T. S. Eugene

    into clean-slate designs that intrinsically support man- agement rather than treating management as a bolted, such as faults, misconfiguration, performance degra- dation, etc., are due to insufficient support for network

  18. Managing Wireless Sensor Networks with Supply Chain Strategy

    E-Print Network [OSTI]

    Fang, Yuguang "Michael"

    , logistics and inventory management, and mil- itary reconnaissance, etc. While much research has focused to be a good candidate for sensor networks because it does not involve costly topology maintenance and complex

  19. Dynamic Power Management of High Performance Network on Chip 

    E-Print Network [OSTI]

    Mandal, Suman Kalyan

    2012-02-14

    . The addition of intelligent networking on the chip adds to the chip’s power consumption thus making management of communication power an interesting and challenging research problem. While VLSI techniques have evolved over time to enable power reduction...

  20. Network Management: State of the Art Raouf Boutaba and Jin Xiao

    E-Print Network [OSTI]

    Boutaba, Raouf

    network management as all measures ensuring the effective and efficient operations of a system within its: to provide network with high quality of service, minimize network downtime. Network management systems shouldNetwork Management: State of the Art Raouf Boutaba and Jin Xiao Department of Computer Science

  1. Revenue Management for Cognitive Spectrum Underlay Networks: An Interference Elasticity

    E-Print Network [OSTI]

    Huang, Jianwei

    to the large body of work on uplink power control with pricing for CDMA networks (e.g., [5]­[10] and a recent a total received interference power constraint at the primary user's receiver. The transmission power1 Revenue Management for Cognitive Spectrum Underlay Networks: An Interference Elasticity

  2. Scalable fault management architecture for dynamic optical networks : an information-theoretic approach

    E-Print Network [OSTI]

    Wen, Yonggang

    2008-01-01

    All-optical switching, in place of electronic switching, of high data-rate lightpaths at intermediate nodes is one of the key enabling technologies for economically scalable future data networks. This replacement of ...

  3. Support Nodes

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

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

  4. Compute nodes

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

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

  5. An Architecture for Managing Virtual Circuit and Virtual Path Services on ATM Networks

    E-Print Network [OSTI]

    Columbia University

    1 An Architecture for Managing Virtual Circuit and Virtual Path Services on ATM Networks Abstract management architecture that provides the services and is instrumented for network management purposes service monitor- ing and control functions. The network management architecture proposes complete managed

  6. Energy Efficient Data Management in Smartphone Networks

    E-Print Network [OSTI]

    Zeinalipour, Demetris

    , we need to identify new energy-aware algorithms and techniques to provide innovative, feature technology and Smartphone networks. Our description is succeeded by an anatomy of the energy costs associated a proliferation of innovative applications founded on Smartphone networks. One example is opportunistic

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

    E-Print Network [OSTI]

    Katelman, Michael; 10.4204/EPTCS.36.6

    2010-01-01

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

  8. Radiation detection and situation management by distributed sensor networks

    SciTech Connect (OSTI)

    Jan, Frigo; Mielke, Angela; Cai, D Michael

    2009-01-01

    Detection of radioactive materials in an urban environment usually requires large, portal-monitor-style radiation detectors. However, this may not be a practical solution in many transport scenarios. Alternatively, a distributed sensor network (DSN) could complement portal-style detection of radiological materials through the implementation of arrays of low cost, small heterogeneous sensors with the ability to detect the presence of radioactive materials in a moving vehicle over a specific region. In this paper, we report on the use of a heterogeneous, wireless, distributed sensor network for traffic monitoring in a field demonstration. Through wireless communications, the energy spectra from different radiation detectors are combined to improve the detection confidence. In addition, the DSN exploits other sensor technologies and algorithms to provide additional information about the vehicle, such as its speed, location, class (e.g. car, truck), and license plate number. The sensors are in-situ and data is processed in real-time at each node. Relevant information from each node is sent to a base station computer which is used to assess the movement of radioactive materials.

  9. Interference management in wireless cellular networks 

    E-Print Network [OSTI]

    Burchardt, Harald Peter

    2013-07-01

    In wireless networks, there is an ever-increasing demand for higher system throughputs, along with growing expectation for all users to be available to multimedia and Internet services. This is especially difficult to ...

  10. Voltage Management of Networks with Distributed Generation. 

    E-Print Network [OSTI]

    O'Donnell, James

    2008-01-01

    At present there is much debate about the impacts and benefits of increasing the amount of generation connected to the low voltage areas of the electricity distribution network. The UK government is under political ...

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

    E-Print Network [OSTI]

    Kung, H. T.

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

  12. Energy and task management in energy harvesting wireless sensor networks for structural health monitoring

    E-Print Network [OSTI]

    Steck, Jamie Bradley

    2009-01-01

    work in energy harvesting and wireless sensor networks.Management in Energy Harvesting Wireless Sensor Networks forapplied to SHiMmer, a wireless, energy-harvesting structural

  13. Managing Capacity For Telecommunications Networks Under Uncertainty

    E-Print Network [OSTI]

    Forsyth, Peter A.

    the underlying risk factor in the bandwidth market, and then apply real options theory to the upgrade decision, this real options approach has not been used pre- viously in the area of network capacity planning--uncertain demand for capacity, real options, net- work planning I. INTRODUCTION In the past, bandwidth was traded

  14. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

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

    2014-12-30

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

  15. Dynamically Managing the Real-time Fabric of a Wireless Sensor-Actuator Network

    E-Print Network [OSTI]

    Lemmon, Michael

    - water distribution and collection networks - traffic networks power inverter storage Micro-Grid examples of such systems are found in the controlling spatially distributed systems. - electric power grid Transmission success is influenced by multi-access interference (MAI) Pi = node i's transmitted power hij Pi

  16. Feasibility of ecosystem-based management in boreal forests: Management planning tools SFM Network

    E-Print Network [OSTI]

    Asselin, Hugo

    Feasibility of ecosystem-based management in boreal forests: Management planning tools SFM Network Research Note Series No. 71 Highlights · The use of adaptive and user-friendly decision-support tools helps interest: a new decision-support tool in forestry From theory to practice Inthesummerof2007,Tembec

  17. Reverse Supply Chain Management and Electronic Waste Recycling: A Multitiered Network Equilibrium Framework for E-Cycling

    E-Print Network [OSTI]

    Nagurney, Anna

    Reverse Supply Chain Management and Electronic Waste Recycling: A Multitiered Network Equilibrium for the modeling of reverse supply chain management of electronic waste, which includes recycling. We describe networks; Environment; Waste management; Reverse logistics; Variational inequali- ties; Network equilibrium

  18. Home Energy Management as a Service over Networking Platforms

    E-Print Network [OSTI]

    Al Faruque, Mohammad Abdullah

    pattern, for instance, the U.S. state of California mandated Zero Net Energy buildings by 2020 Zero Net Energy (ZNE) buildings by 2020 [2]. Also, the U.S. Department of Energy (DOE) BuildingHome Energy Management as a Service over Networking Platforms Korosh Vatanparvar, Quan Chau

  19. Social Networking for Emergency Management and Public Safety

    SciTech Connect (OSTI)

    Lesperance, Ann M.; Olson, Jarrod; Godinez, Melanie A.

    2010-08-31

    On March 10, 2010 the workshop titled Social Networking for Emergency Management and Public Safety was held in Seattle, WA. The objective of this workshop was to showcase ways social media networking technologies can be used to support emergency management and public safety operations. The workshop highlighted the current state of social networking and where this dynamic engagement is heading, demonstrated some of the more commonly used technologies, highlighted case studies on how these tools have been used in a variety of jurisdictions and engaged the private sector on how these tools might serve as a conduit for two way communication between with the public sector to address regional recovery issues and decision making.

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

    E-Print Network [OSTI]

    Haddadi, Hamed

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

  1. Dynamic Network Energy Management via Proximal Message Passing

    E-Print Network [OSTI]

    devices, 1 power exchange node Á power scheduled over 96 time periods (24 hrs, 15 min intervals) gen batt

  2. A Scalable On-Line Multilevel Distributed Network Fault Detectioflonitoring System Based on the SNMP Protocol

    E-Print Network [OSTI]

    Thulsiraman, Krishnaiyan

    in this paper has been motivated by this research trend In network management. We present the design as NMS nodes with dual roles - manager and agent - and to balance loads and to avoid traffic congestion@sosu.edu thulasi@ou.edu London, Ontano,Canada N6A 5B9 Abstract-Traditional centralized network management solutions

  3. Assessment and Event Based Analysis of Dynamic Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

  4. A Duality Based Approach for Network Revenue Management in Airline Alliances

    E-Print Network [OSTI]

    Topaloglu, Huseyin

    A Duality Based Approach for Network Revenue Management in Airline Alliances Huseyin Topaloglu management model for airline alliances. In particular, our model allows the members of the alliance to decide approximation to the revenue management problem that takes place over the whole alliance network. This linear

  5. Management Services for Performance Verification in Broadband Multi-Service Networks

    E-Print Network [OSTI]

    Griffin, David

    Management Services for Performance Verification in Broadband Multi-Service Networks Panos Georgatsos1 , David Griffin2 Abstract This paper presents a practical management system for performance monitoring and network performance verification to support the larger goals of performance management systems

  6. Wireless Sensors and Networks for Advanced Energy Management

    SciTech Connect (OSTI)

    Hardy, J.E.

    2005-05-06

    Numerous national studies and working groups have identified low-cost, very low-power wireless sensors and networks as a critical enabling technology for increasing energy efficiency, reducing waste, and optimizing processes. Research areas for developing such sensor and network platforms include microsensor arrays, ultra-low power electronics and signal conditioning, data/control transceivers, and robust wireless networks. A review of some of the research in the following areas will be discussed: (1) Low-cost, flexible multi-sensor array platforms (CO{sub 2}, NO{sub x}, CO, humidity, NH{sub 3}, O{sub 2}, occupancy, etc.) that enable energy and emission reductions in applications such as buildings and manufacturing; (2) Modeling investments (energy usage and savings to drive capital investment decisions) and estimated uptime improvements through pervasive gathering of equipment and process health data and its effects on energy; (3) Robust, self-configuring wireless sensor networks for energy management; and (4) Quality-of-service for secure and reliable data transmission from widely distributed sensors. Wireless communications is poised to support technical innovations in the industrial community, with widespread use of wireless sensors forecasted to improve manufacturing production and energy efficiency and reduce emissions. Progress being made in wireless system components, as described in this paper, is helping bring these projected improvements to reality.

  7. Stable Energy-Aware Topology Management in Ad Hoc Networks

    E-Print Network [OSTI]

    Garcia-Luna-Aceves, J.J.

    2010-01-01

    Different types of nodes consume energy at different rates.less interference and consume less energy. Significant worksnodes can consume large amounts of energy by main- taining

  8. A Retasking Framework For Wireless Sensor Networks

    E-Print Network [OSTI]

    Weigle, Michele

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

  9. Energy and task management in energy harvesting wireless sensor networks for structural health monitoring

    E-Print Network [OSTI]

    Steck, Jamie Bradley

    2009-01-01

    applied to SHiMmer, a wireless, energy-harvesting structuralthesis dis- cusses a wireless, energy-harvesting sensingManagement in Energy Harvesting Wireless Sensor Networks for

  10. Artificial Neural Network for Optimized Power System Management

    E-Print Network [OSTI]

    OLeary, Daniel Albert

    2015-01-01

    vii Abstract Artificial Neural Network for Optimized PowerAn Artificial Neural Network (ANN). Data is input to theSANTA CRUZ ARTIFICIAL NEURAL NETWORK FOR OPTIMIZED POWER

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

    DOE Patents [OSTI]

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

    2009-06-23

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

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

    DOE Patents [OSTI]

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

    2010-11-16

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

  13. Adaptive Network Defense Management for Countering Smart Attack and Selective Capture

    E-Print Network [OSTI]

    Cao, Yong

    , humidity, tempera- ture, electrical characteristics, and radiation. · Smart City [46]: A query-based WSN1 Adaptive Network Defense Management for Countering Smart Attack and Selective Capture in Wireless network defense management for countering smart attack and se- lective capture which aim to cripple

  14. A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems

    E-Print Network [OSTI]

    Topaloglu, Huseyin

    A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of the bid prices and to use sample path-based derivatives

  15. Computing Time-Dependent Bid-Prices in Network Revenue Management Problems

    E-Print Network [OSTI]

    Topaloglu, Huseyin

    Computing Time-Dependent Bid-Prices in Network Revenue Management Problems Huseyin Topaloglu School for computing bid-prices in network revenue management problems. The novel aspect of our method is that it naturally provides bid-prices that depend on how much time is left until the departure. Our method provides

  16. Computing Time-Dependent Bid Prices in Network Revenue Management Problems

    E-Print Network [OSTI]

    Topaloglu, Huseyin

    Computing Time-Dependent Bid Prices in Network Revenue Management Problems Sumit Kunnumkal Indian@orie.cornell.edu July 16, 2009 Abstract We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend

  17. The RUNES Middleware for Networked Embedded Systems and its Application in a Disaster Management Scenario

    E-Print Network [OSTI]

    Picco, Gian Pietro

    scenario involves fire management in a road tunnel that is instrumented with networked sensor and actuator (Reconfigurable Ubiq- uitous Network Embedded Systems) project1 , involves a road tunnel that is instrumented with networked embedded sensors, actuators, and larger, more powerful, devices. The latter act as gateways

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

    E-Print Network [OSTI]

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

  19. SiNode Systems

    Broader source: Energy.gov [DOE]

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

  20. Management Information Systems Mexico City EMBA Program

    E-Print Network [OSTI]

    Ghosh, Joydeep

    Management Information Systems Mexico City EMBA Program Spring 2012 Professor : Professor Anitesh efficiency, and business partner and strategic values. Managers need to be able to articulate the impact) Required Books Analyzing Social Media Networks with NodeXL: Insights from a Connected World by Derek Hansen

  1. {Control of Residential Load Management Networks Using Real Time Pricing

    E-Print Network [OSTI]

    Burke, William Jerome

    2010-01-01

    modeling and control of load management. Further, withoutA profit-based load management using linear programming”.with applica- tions to load management assessment and load

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

    E-Print Network [OSTI]

    Kelly, Logan Scott

    2014-02-19

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

  3. Global Supply Chain Networks and Risk Management: A Multi-Agent Framework Anna Nagurney

    E-Print Network [OSTI]

    Nagurney, Anna

    as well as demand-side risk are included in the formulation. The model consists of three tiers of decisionGlobal Supply Chain Networks and Risk Management: A Multi-Agent Framework Anna Nagurney Radcliffe, Massachusetts 02138 and Department of Finance and Operations Management Isenberg School of Management University

  4. Using Visualization to Support Network and Application Management in a Data Center

    E-Print Network [OSTI]

    Ras, Zbigniew W.

    -learning based management systems. We present a case study that highlights the requirements on visualization systems designed for the management of networks and applications inside large data centers. We explain that this service uses, and highlight the challenges facing a visualization system for managing data center services

  5. An Efficient Energy Management System for Android Phone Using Bayesian Networks

    E-Print Network [OSTI]

    Cho, Sung-Bae

    An Efficient Energy Management System for Android Phone Using Bayesian Networks Young-Seol Lee, proximity, light and orientation sensors for context-awareness. Energy-efficient battery management systems, it becomes an issue to develop the techniques for efficient energy management on a mobile phone [2, 3, 4

  6. Traffic Management and Net Neutrality in Wireless Networks

    E-Print Network [OSTI]

    Jordan, Scott

    2011-01-01

    loops or wireless spectrum and switches or routers. Thesedevices such as routers. Wireless networks incur similar

  7. Robust Clock Synchronization in Wireless Sensor Networks 

    E-Print Network [OSTI]

    Saibua, Sawin

    2010-10-12

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

  8. Simulating a Semantic Network in LMS

    E-Print Network [OSTI]

    Koton, Phyllis A.

    1980-09-29

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

  9. Wireless Sensor Network for Advanced Energy Management Solutions

    SciTech Connect (OSTI)

    Peter J. Theisen; Bin Lu, Charles J. Luebke

    2009-09-23

    Eaton has developed an advanced energy management solution that has been deployed to several Industries of the Future (IoF) sites. This demonstrated energy savings and reduced unscheduled downtime through an improved means for performing predictive diagnostics and energy efficiency estimation. Eaton has developed a suite of online, continuous, and inferential algorithms that utilize motor current signature analysis (MCSA) and motor power signature analysis (MPSA) techniques to detect and predict the health condition and energy usage condition of motors and their connect loads. Eaton has also developed a hardware and software platform that provided a means to develop and test these advanced algorithms in the field. Results from lab validation and field trials have demonstrated that the developed advanced algorithms are able to detect motor and load inefficiency and performance degradation. Eaton investigated the performance of Wireless Sensor Networks (WSN) within various industrial facilities to understand concerns about topology and environmental conditions that have precluded broad adoption by the industry to date. A Wireless Link Assessment System (WLAS), was used to validate wireless performance under a variety of conditions. Results demonstrated that wireless networks can provide adequate performance in most facilities when properly specified and deployed. Customers from various IoF expressed interest in applying wireless more broadly for selected applications, but continue to prefer utilizing existing, wired field bus networks for most sensor based applications that will tie into their existing Computerized Motor Maintenance Systems (CMMS). As a result, wireless technology was de-emphasized within the project, and a greater focus placed on energy efficiency/predictive diagnostics. Commercially available wireless networks were only utilized in field test sites to facilitate collection of motor wellness information, and no wireless sensor network products were developed under this project. As an outgrowth of this program, Eaton developed a patented energy-optimizing drive control technology that is complementary to a traditional variable frequency drives (VFD) to enable significant energy savings for motors with variable torque applications, such as fans, pumps, and compressors. This technology provides an estimated energy saving of 2%-10% depending on the loading condition, in addition to the savings obtained from a traditional VFD. The combination of a VFD with the enhanced energy-optimizing controls will provide significant energy savings (10% to 70% depending on the load and duty cycle) for motors that are presently connected with across the line starters. It will also provide a more favorable return on investment (ROI), thus encouraging industries to adopt VFDs for more motors within their facilities. The patented technology is based on nonintrusive algorithms that estimate the instantaneous operating efficiency and motor speed and provide active energy-optimizing control of a motor, using only existing voltage and current sensors. This technology is currently being commercialized by Eaton’s Industrial Controls Division in their next generation motor control products. Due to the common nonintrusive and inferential nature of various algorithms, this same product can also include motor and equipment condition monitoring features, providing the facility owner additional information to improve process uptime and the associated energy savings. Calculations estimated potential energy savings of 261,397GWh/Yr ($15.7B/yr), through retrofitting energy-optimizing VFDs into existing facilities, and incorporating the solution into building equipment sold by original equipment manufacturers (OEMs) and installed by mechanical and electrical contractors. Utilizing MCSA and MPSA for predictive maintenance (PM) of motors and connected equipment reduces process downtime cost and the cost of wasted energy associated with shutting down and restarting the processes. Estimated savings vary depending on the industry segment and equi

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

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2008-10-10

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

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

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2009-05-15

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

  12. Hopper Login Nodes

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

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

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

    DOE Patents [OSTI]

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

    2008-06-03

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

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

    E-Print Network [OSTI]

    Jayaweera, Sudharman K.

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

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

    E-Print Network [OSTI]

    Maróti, Miklós

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

  16. Efficient Energy Management and Data Recovery in Sensor Networks using Latent Variables Based Tensor

    E-Print Network [OSTI]

    Simunic, Tajana

    Efficient Energy Management and Data Recovery in Sensor Networks using Latent Variables Based factor in a successful sensor network deployment is finding a good balance between maximizing the number of measurements taken (to maintain a good sampling rate) and minimizing the overall energy consumption (to extend

  17. Knowledge Network: An Information Repository with Services for Managing Concurrent Engineering Design

    E-Print Network [OSTI]

    Fox, Mark S.

    Knowledge Network: An Information Repository with Services for Managing Concurrent Engineering design engineers. The KAD system centers on a knowledge network that stores design knowledge and provides are constructing a Knowledge Aided Design (KAD) system for supporting concurrent engineering design and enhancing

  18. A connection management protocol for promoting cooperation in Peer-to-Peer networks q

    E-Print Network [OSTI]

    Ulusoy, Özgür

    and an adaptive connection management protocol that dynamically establishes and adapts a P2P network topology other on the adapted topology and to push the free riders away from the contributors. In this way the benefits of P2P network architecture. Additionally, renewal or presentation of inter- esting content may

  19. Economic Incentives of Providing Network Security Services Journal of Information Technology Management 1

    E-Print Network [OSTI]

    Chen, Li-Chiou

    Economic Incentives of Providing Network Security Services Journal of Information Technology Management 1 THE ECONOMIC INCENTIVES OF PROVIDING NETWORK SECURITY SERVICES ON THE INTERNET INFRASTRUCTURE Li in the economic incentives inherent in providing the defenses as well as uncertainty in current defenses. We

  20. Energy efficient management framework for multihop TDMA-based wireless networks

    E-Print Network [OSTI]

    Boutaba, Raouf

    and energy consumption. To do so, we first propose an Optimal approach, called Optimal Green Routing and LinkEnergy efficient management framework for multihop TDMA-based wireless networks Ahmed Amokrane a January 2014 Available online 11 January 2014 Keywords: TDMA-based multihop wireless networks Energy

  1. The D-Systems Project -Wireless Sensor Networks for Car-Park Management

    E-Print Network [OSTI]

    Sreenan, Cormac J.

    to perform data aggregation, when operating with a limited data delivery time budget. 3. Two new energy that they can be deployed in existing car-parks without having to install new cabling for networkThe D-Systems Project - Wireless Sensor Networks for Car-Park Management J. Barton, J. Buckley, B

  2. An SNMP Gateway for Delay/Disruption Tolerant Network Management GREGORY L. CAMPBELL

    E-Print Network [OSTI]

    Kruse, Hans

    is tested by creating a sample terrestrial management system and by mimicking interaction with the DING protocol. The results prove that a push-based data collection method that populates a shared database canAn SNMP Gateway for Delay/Disruption Tolerant Network Management by GREGORY L. CAMPBELL Mc

  3. A Semantic Analysis of Key Management Protocols for Wireless Sensor Networks$

    E-Print Network [OSTI]

    Merro, Massimo

    analysis of three well-known key management protocols for wireless sensor networks: µTESLA, LEAP+ and Li. Introduction Wireless sensors are small and cheap devices powered by low-energy batteries, equipped with radio protocol. Due to resource limitations, all key management protocols for WSNs, such as µTESLA [1], LiSP [2

  4. Information Capacity of Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

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

  5. Distributed downhole drilling network

    DOE Patents [OSTI]

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

    2006-11-21

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

  6. Managing Routing Disruptions in Internet Service Provider Networks

    E-Print Network [OSTI]

    Rexford, Jennifer

    games, and commercial transactions. This new range of applications cannot tolerate poor network the impact of routing changes in their network. I. INTRODUCTION As the Internet becomes an ever more critical increasing pressure to provide good, predictable performance to a wide range of applications. Unfortunately

  7. Vulnerability of critical infrastructures : identifying critical nodes.

    SciTech Connect (OSTI)

    Cox, Roger Gary; Robinson, David Gerald

    2004-06-01

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

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

    E-Print Network [OSTI]

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

    2007-01-01

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

  9. Management of Adenoid Cystic Carcinoma of the Breast: A Rare Cancer Network Study

    SciTech Connect (OSTI)

    Khanfir, Kaouthar, E-mail: kaouthar.khanfir@rsv-gnw.ch [Hopital de Sion, CHCVs, Sion (Switzerland); Kallel, Adel [Institut Gustave Roussy, Villejuif (France); Villette, Sylviane [Centre Rene Huguenin, Paris (France); Belkacemi, Yazid [CHU Henri Mondor, Centre Oscar Lambret, Lille (France); Vautravers, Claire [Centre George Francois Leclerc, Dijon (France); Nguyen, TanDat [Institut Jean Gaudinot, Reims (France); Miller, Robert [Mayo Clinic, Rochester, Minnesota (United States); Li Yexiong [Peking Union Medical College, Beijing (China); Taghian, Alphonse G. [Massachusetts General Hospital, Boston, Massachusetts (United States); Boersma, Liesbeth [Maastricht University Medical Center (MAASTRO clinic), Maastricht (Netherlands); Poortmans, Philip [Dr. Bernard Verbeeten Institute, Tilburg (Netherlands); Goldberg, Hadassah [Western Galilee Hospital-Nahariya, Nahariya (Israel); Vees, Hansjorg [Hopitaux Universitaires de Geneve, Geneva (Switzerland); Senkus, Elzbieta [Medical University of Gdansk, Gdansk (Poland); Igdem, Sefik; Ozsahin, Mahmut [Istanbul Bilim University, Istanbul (Turkey); Jeanneret Sozzi, Wendy [Centre Hospitalier Universitaire Vaudois, Lausanne (Switzerland)

    2012-04-01

    Background: Mammary adenoid cystic carcinoma (ACC) is a rare breast cancer. The aim of this retrospective study was to assess prognostic factors and patterns of failure, as well as the role of radiation therapy (RT), in ACC. Methods: Between January 1980 and December 2007, 61 women with breast ACC were treated at participating centers of the Rare Cancer Network. Surgery consisted of lumpectomy in 41 patients and mastectomy in 20 patients. There were 51(84%) stage pN0 and 10 stage cN0 (16%) patients. Postoperative RT was administered to 40 patients (35 after lumpectomy, 5 after mastectomy). Results: With a median follow-up of 79 months (range, 6-285), 5-year overall and disease-free survival rates were 94% (95% confidence interval [CI], 88%-100%) and 82% (95% CI, 71%-93%), respectively. The 5-year locoregional control (LRC) rate was 95% (95% CI, 89%-100%). Axillary lymph node dissection or sentinel node biopsy was performed in 84% of cases. All patients had stage pN0 disease. In univariate analysis, survival was not influenced by the type of surgery or the use of postoperative RT. The 5-year LRC rate was 100% in the mastectomy group versus 93% (95% CI, 83%-100%) in the breast-conserving surgery group, respectively (p = 0.16). For the breast-conserving surgery group, the use of RT significantly correlated with LRC (p = 0.03); the 5-year LRC rates were 95% (95% CI, 86%-100%) for the RT group versus 83% (95% CI, 54%-100%) for the group receiving no RT. No local failures occurred in patients with positive margins, all of whom received postoperative RT. Conclusion: Breast-conserving surgery is the treatment of choice for patients with ACC breast cancer. Axillary lymph node dissection or sentinel node biopsy might not be recommended. Postoperative RT should be proposed in the case of breast-conserving surgery.

  10. Efficient flooding for wireless mesh networks

    E-Print Network [OSTI]

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

    2012-01-01

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

  11. Power Management for Wireless Sensor Networks Based on Energy Budgets

    E-Print Network [OSTI]

    Turau, Volker

    . The usage of batteries in wireless sensor networks is primarily due to avoiding the wiring cost, i.e., data sources do not continuously provide energy. Consider a solar cell as an example. The power generated

  12. Table of Contents Data Management in Sensor Networks

    E-Print Network [OSTI]

    . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 Routing Generic Routing Metric and Policies for WSNs Olga Saukh, Pedro Jos´e Marr´on, Andreas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196 FlexCup: A Flexible and Efficient Code Update Mechanism for Sensor Networks Pedro Jos´e Marr

  13. Artificial Neural Network for Optimized Power System Management

    E-Print Network [OSTI]

    OLeary, Daniel Albert

    2015-01-01

    3.2 Wind and Power ConsumptionThe power consumption fitness analysis of a standard,of Figures A model of the power management model decision

  14. socP2P: P2P Content Discovery Enhancement by considering Social Networks Characteristics

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    socP2P: P2P Content Discovery Enhancement by considering Social Networks Characteristics Reza-- Content management appears as an essential requirement in order to deploy enhanced P2P networks. In P2P/nodes; therefore an efficient search mechanism is required. The proposed search algorithm in this paper, called socP

  15. Parallel HSL port Control Network

    E-Print Network [OSTI]

    Glück, Olivier

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

  16. Trends in Energy Management Technology: BCS Integration Technologies - Open Communications Networking

    SciTech Connect (OSTI)

    Webster, Tom

    2002-09-18

    Our overall purpose in writing this series of articles is to provide Federal energy managers some basic informational tools to assist their decision making process relative to energy management systems design, specification, procurement, and energy savings potential. Since Federal buildings rely on energy management systems more than their commercial counterparts, it is important for energy practitioners to have a high level of knowledge and understanding of these complex systems. This is the second article in a series and will focus on building control system (BCS) networking fundamentals and an assessment of current approaches to open communications protocols. This is important because networking is a complex subject and the networks form the basic infrastructure for energy management functions and for integrating a wide variety of OEM equipment into a complete EMCIS. The first article [1] covered enabling technologies for emerging energy management systems. Future topics will concentrate on more practical aspects including applications software, product offerings, networking strategies, and case studies of actual installations. Please refer to the first article for a more complete overview of the purpose and background for this series.

  17. Multilayer network modeling of change propagation for engineering change management

    E-Print Network [OSTI]

    Pasqual, Michael C

    2010-01-01

    Engineering change management is a critical and challenging process within product development. One pervasive source of difficulty for this process is the phenomenon of change propagation, by which a change to one part or ...

  18. Editorial Manager(tm) for Wireless Networks Manuscript Draft

    E-Print Network [OSTI]

    Kalyanaraman, Shivkumar

    power consumption. We also show that not only transmission power is greatly reduced, but also the aggregate power consumption for a successful transmission and reception. Moreover, a lower transmission power implies lower interference thus potentially increase the network capacity. Index Terms-- Wireless

  19. Policy-based Management of Body-Sensor Networks

    E-Print Network [OSTI]

    Keoh, S.; Twidle, K.; Pryce, N.; Schaeffer-Filho, A.; Lupu, E.; Dulay, N.; Sloman, M.; Heeps, S.

    Keoh,S. Twidle,K. Pryce,N. Schaeffer-Filho,A. Lupu,E. Dulay,N. Sloman,M. Heeps,S. Strowes,S. Sventek,J.S. Katsiri,E. Proceedings of the International Workshop on Wearable and Implantable Body Sensor Networks, Aachen, Germany, March 2007

  20. Evolving Cellular Automata for Location Management in Mobile Computing Networks

    E-Print Network [OSTI]

    Ha, Dong S.

    entering one of these reporting cells. To create such an evolving CA system, cells in the network for a number of test problems. Index Terms--Cellular automata, genetic algorithms, mobile computing, mobility to interferences. On the other hand, a miss on the location of a mobile terminal will necessitate a search

  1. 226 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 9, NO. 3, SEPTEMBER 2012 Mobility Management in Wireless Mesh Networks

    E-Print Network [OSTI]

    Cao, Yong

    forwarding schemes, as well as traditional tunnel- based location management schemes. Index Terms has one or more gateways that are special MRs connected to the Internet. The set of MRs forms

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

  3. A Formal Approach for Network Security Management Based on Qualitative Risk Analysis

    E-Print Network [OSTI]

    Wang, Yongge

    A Formal Approach for Network Security Management Based on Qualitative Risk Analysis Mohammad Emails: {mrahman4,ealshaer}@uncc.edu Abstract--The risk analysis is an important process for en- forcing security risk low. In this paper, we first present a declarative model for the qualitative risk analysis

  4. Autonomous Adaptive Resource Management in Sensor Network Systems for Environmental Monitoring

    E-Print Network [OSTI]

    Panangadan, Anand

    1 Autonomous Adaptive Resource Management in Sensor Network Systems for Environmental Monitoring rates, and routing of data) that impact the utilization of the system resources (such as energy reserves is illustrated on a coastal monitoring and forecast system that is in operation in the New York harbor

  5. Application-specific network management for energy-aware streaming of popular multimedia formats

    E-Print Network [OSTI]

    Vahdat, Amin

    Application-specific network management for energy-aware streaming of popular multimedia formats requirements, they do not offer any energy savings for multimedia streams over 56 kbps. The potential energy, an application-specific server side traffic shaping mech- anism can offer good energy saving for all the stream

  6. QoI-Aware Wireless Sensor Network Management for Dynamic Multi-Task Operations

    E-Print Network [OSTI]

    Leung, Kin K.

    the required QoI is satisfied by the WSN; (b) the QoI network capacity, which expresses the ability of the WSN of research in this area of WSN operation and management (O&M) focuses primarily on the "internal" aspects exposure. The novel study of WSN O&M for the efficient and effective support of the multi

  7. Technology management in education: labs, libraries, and networks Education IT News

    E-Print Network [OSTI]

    Espinosa, Horacio D.

    Page 1 of 5| ZDNet Education IT | Blogs, technology white papers, and RSS news 5/11/2007http://cliftonTechnology management in education: labs, libraries, and networks Education IT News Search technological developments in memory chips and electronic sensing devices.read more - Read More Published

  8. A Case Study on Prototyping Power Management Protocols for Sensor Networks #

    E-Print Network [OSTI]

    Kulkarni, Sandeep

    is an important problem in battery pow­ ered sensor networks as the sensors are required to operate for a long to be responsible for stack management, bu#er man­ agement, flow control, etc. Therefore, the designers simplify are typically battery powered (e.g., Mica [1], XSM [2], Telos [3]) and, hence, they can operate continuously

  9. A Case Study on Prototyping Power Management Protocols for Sensor Networks

    E-Print Network [OSTI]

    Kulkarni, Sandeep

    is an important problem in battery pow- ered sensor networks as the sensors are required to operate for a long to be responsible for stack management, buffer man- agement, flow control, etc. Therefore, the designers simplify are typically battery powered (e.g., Mica [1], XSM [2], Telos [3]) and, hence, they can operate continuously

  10. Mobile Sensor Network Data Management Demetrios Zeinalipour-Yazti

    E-Print Network [OSTI]

    Zeinalipour, Demetris

    .e., wires) using technologies such as radio frequency (RF), infrared light, acoustic energy and others the optional arguments in the tuple definition. In a more general perspective, MSN Data Management deals approaches to monitor the physical world were primarily composed of passive sensing devices, such as those

  11. Distributed Wireless Control for Building Energy Management Alan Marchiori and Qi Han

    E-Print Network [OSTI]

    Han, Qi "Chee"

    building energy management systems are es- sential to enabling the development of mass-market, low- energy distributed control system for building energy management that uses wireless sensor network-class nodes. Using.9% reduction in energy consumption immedi- ately after installing a monitoring system; however, after a month

  12. Fragile Networks: Identifying Vulnerabilities and Synergies in an Uncertain Age

    E-Print Network [OSTI]

    Nagurney, Anna

    Amherst, Massachusetts 01003 Qiang Qiang Management Division Pennsylvania State University Great Valley School of Graduate Professional Studies Malvern, Pennsylvania 19355 April 2010; revised May 2010 and the identification of the importance of network components, such as nodes and links. We demonstrated how rigorously

  13. Adaptive Network Management for Countering Selective Capture in Wireless Sensor Networks

    E-Print Network [OSTI]

    Chen, Ing-Ray

    station in a wireless sensor network (WSN) to block data delivery. We consider 3 countermeasures and the intrusion invocation interval used for intrusion detection under which the lifetime of a WSN is maximized to limited resources, a WSN must minimize energy consumption to prolong the system useful lifetime, while

  14. Adaptive Scheduling in Ad Hoc and Cellular Wireless Networks

    E-Print Network [OSTI]

    Tan, Choo Chin

    2013-01-01

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

  15. Semantic associative network for text analysis (SANTA) 

    E-Print Network [OSTI]

    Airhart, Robert William

    2000-01-01

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

  16. Efficient network camouflaging in wireless networks 

    E-Print Network [OSTI]

    Jiang, Shu

    2006-04-12

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

  17. Optimum Transmission Policies for Battery Limited Energy Harvesting Nodes

    E-Print Network [OSTI]

    Tutuncuoglu, Kaya

    2010-01-01

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

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

    E-Print Network [OSTI]

    Keromytis, Angelos D.

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

  19. CENDA: Camouflage Event Based Malicious Node Detection Architecture

    E-Print Network [OSTI]

    Liu, Alex X.

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

  20. Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes

    E-Print Network [OSTI]

    Turau, Volker

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

  1. Automatic Clustering of Grid Nodes Department of Electrical and

    E-Print Network [OSTI]

    Subhlok, Jaspal

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

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

    DOE Patents [OSTI]

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

    2010-10-05

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

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

    SciTech Connect (OSTI)

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

    2015-09-14

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

  4. POEMS: A Transformable Architecture for Managing System Overload

    E-Print Network [OSTI]

    Ooi, Beng Chin

    result in the overload of the DBMS. Existing load management systems assume nodes are fully dedicated

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

    E-Print Network [OSTI]

    Marbach, Peter

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

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

    E-Print Network [OSTI]

    Marbach, Peter

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

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

    E-Print Network [OSTI]

    Simunic, Tajana

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

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

    E-Print Network [OSTI]

    Langendoen, Koen

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

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

    E-Print Network [OSTI]

    Poon, Andrew Wing On

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

  10. Collaborative Firewalling in Wireless Networks Mahmoud Taghizadeh

    E-Print Network [OSTI]

    Liu, Alex X.

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

  11. Network coding for speedup in switches

    E-Print Network [OSTI]

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

    2007-01-01

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

  12. Open Problems in Network-aware Data Management in Exa-scale Computing and Terabit Networking Era

    E-Print Network [OSTI]

    Balman, Mehmet

    2014-01-01

    1st Workshop on High-Performance Computing meets Databases (Provisioning,High Performance Computing, Networking, StorageConference for High Performance Computing, Networking,

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

    E-Print Network [OSTI]

    Zhu, Yifeng

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

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

    E-Print Network [OSTI]

    Nelakuditi, Srihari

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

  15. 2006 Raj JainCSE574sWashington University in St. Louis Energy ManagementEnergy Management

    E-Print Network [OSTI]

    Jain, Raj

    node Does not give min total power Reduced lifetime for the network 6. Conditional Min-Max Battery://www.cse.wustl.edu/~jain/cse574-06/ #12;16-2 ©2006 Raj JainCSE574sWashington University in St. Louis OverviewOverview Battery Power Management #12;16-3 ©2006 Raj JainCSE574sWashington University in St. Louis Battery Management

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

    E-Print Network [OSTI]

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

    2005-01-01

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

  17. 334 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 8, NO. 4, DECEMBER 2011 Phoenix: A Weight-Based Network Coordinate

    E-Print Network [OSTI]

    Fu, Xiaoming

    334 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 8, NO. 4, DECEMBER 2011 Phoenix with Euclidean distance based NC systems. In this paper, we propose an NC system, so-called Phoenix, which is based on the matrix factorization model. Phoenix introduces a weight to each reference NC and trusts

  18. Efficient Strategyproof Multicast in Selfish Wireless Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

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

  19. MAC layer power management schemes for efficient energy- delay tradeoffs in wireless local area networks

    E-Print Network [OSTI]

    Sarkar, Mahasweta

    2006-01-01

    layer strategies for energy efficient wireless networking,”Investigating the energy consumption of a wireless networkR. R. Rao, “An Energy Aware Protocol for Wireless Networks”,

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

    E-Print Network [OSTI]

    Kim, Heetae; Holme, Petter

    2015-01-01

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

  1. Trust and Independence Aware Decision Fusion in Distributed Networks

    E-Print Network [OSTI]

    California at Davis, University of

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

  2. Ambient-RF-Energy-Harvesting Sensor Node with Capacitor-Leakage-Aware Duty Cycle Control

    E-Print Network [OSTI]

    Tentzeris, Manos

    Ambient-RF-Energy-Harvesting Sensor Node with Capacitor-Leakage-Aware Duty Cycle Control Ryo (WSN) that are solely powered by ambient RF power. Different from all other energy harvesting WSN systems, RF powered systems present a new challenge for the energy management. A WSN node repeatedly

  3. Optimal Distributed P2P Streaming under Node Degree Bounds

    E-Print Network [OSTI]

    Zhang, Shaoquan; Chen, Minghua

    2010-01-01

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

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

    DOE Patents [OSTI]

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

    2011-06-21

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

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

    DOE Patents [OSTI]

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

    2010-01-19

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

  6. Clock synchronization for mobile ad hoc networks 

    E-Print Network [OSTI]

    Chandra, Rajan

    2013-02-22

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

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

    E-Print Network [OSTI]

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

    2007-01-01

    EMAP2 ASIC-based energy accounting unit that al- lows fortime Detailed Energy Accounting for Wireless Sensor NodesEnergy Management and Accounting (EMAP2) ASIC combined with

  8. 228 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 7, NO. 2, APRIL 1999 Ad Hoc Mobility Management with

    E-Print Network [OSTI]

    Haas, Zygmunt J.

    the construction of UQS through the balanced incomplete block designs. The average cost, due to call loss is sometimes necessary to reduce the cost of mobility management. Index Terms--Ad hoc network, balanced on the average cost, we investigate the tradeoff between the system reliability and the cost of location updates

  9. Access Management in Multi-Administration Networks S. P. Lord, N.H. Pope, and Susan Stepney

    E-Print Network [OSTI]

    Stepney, Susan

    Access Management in Multi-Administration Networks S. P. Lord, N.H. Pope, and Susan Stepney GEC by different administrations, and allowing these administrations to maintain autonomy but to use each others services. Consider also what happens if these administrations have different policies on how access should

  10. Journal of Network and Systems Management, Vol. 12, No. 2, June 2004 ( 2004) Edited by Paul Brusil

    E-Print Network [OSTI]

    Boutaba, Raouf

    tradition of NOMS and the Integrated Man- agement Symposium (IM) as the primary forum for technical exchange among the research, standards, development, systems integrator, service provider, and user communities and Distributed Systems. The theme for NOMS 2004 was "Managing Next Generation Con- vergence Networks and Services

  11. MIXIT: The Network Meets the Wireless Channel

    E-Print Network [OSTI]

    Katti, Sachin

    2007-09-04

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

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

    E-Print Network [OSTI]

    Bouras, Christos

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

  13. PROCEEDINGS OF FOURTH BERKELEY CONFERENCE ON DISTRIBUTED DATA MANAGEMENT AND COMPUTER NETWORKS.

    E-Print Network [OSTI]

    Hall, Dennis

    2011-01-01

    Generalized Data Base Management System Data Structures andfor a Relational Data Base Management System", Proc. Sixthdecision support and data base management system based on a

  14. Energy and task management in energy harvesting wireless sensor networks for structural health monitoring

    E-Print Network [OSTI]

    Steck, Jamie Bradley

    2009-01-01

    Chapter 4. System Energy and Task Management . . 1. System2. Energy and Task Management Algorithms A. Energy3. Energy and Task Management Algorithms A. Energy

  15. Dedicated heterogeneous node scheduling including backfill scheduling

    DOE Patents [OSTI]

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

    2006-07-25

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

  16. In: Management Solutions for the New Communications World: NOMS 2002 Proceedings of the 2002 8th International IEEE/IFIP Network Operations and

    E-Print Network [OSTI]

    International IEEE/IFIP Network Operations and Management Symposium , Florence, Italy IEEE Publishing, April, a user-- and quality--oriented service management is desperately needed to fulfill the posed requirements model supports service planing, provisioning, operation as well as service management at the customer

  17. Journal of Network and Systems Management, Vol. 13, No. 3, September 2005 ( C 2005) DOI: 10.1007/s10922-005-7774-6

    E-Print Network [OSTI]

    Pras, Aiko

    management--more than 300 experts from academia and industry who gathered to attend the various presentations management just as quickly to keep up with those advances. The Technical Program consisted of 53 papersJournal of Network and Systems Management, Vol. 13, No. 3, September 2005 ( C 2005) DOI: 10.1007/s

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

    E-Print Network [OSTI]

    Bathula, Balagangadhar G

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

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

    E-Print Network [OSTI]

    Arabshahi, Payman

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

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

    E-Print Network [OSTI]

    Li, William Wei-Liang

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

  1. Energy-Efficient Transaction Management for Mobile Ad-hoc Network Databases

    E-Print Network [OSTI]

    Gruenwald, Le

    mobile node to support services and applications [6]. Also the battery technology is not developed as rapidly as the mobile devices and wireless technologies, so that the limited battery lifetime is always system. In this system, both clients and servers are mobile, wireless and battery

  2. Energy Management for Time-Critical Energy Harvesting Wireless Sensor Networks

    E-Print Network [OSTI]

    Aydin, Hakan

    this problem, we present a set of Harvesting Aware Speed Selection (HASS) algo- rithms. We use an epoch such as solar, wind or wa- ter flow, WSN nodes potentially have perpetual energy supply. However, given saving techniques, Dy- namic Voltage Scaling (DVS) [2] and Dynamic Modulation Scaling (DMS) [18]. The DVS

  3. Organization of growing random networks

    SciTech Connect (OSTI)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

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

  4. Systematic wireless network coding

    E-Print Network [OSTI]

    Shrader, Brooke E.

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

  5. Optimizing Cluster Heads for Energy Efficiency in Large-Scale Heterogeneous Wireless Sensor Networks

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

    Gu, Yi; Wu, Qishi; Rao, Nageswara S. V.

    2010-01-01

    Many complex sensor network applications require deploying a large number of inexpensive and small sensors in a vast geographical region to achieve quality through quantity. Hierarchical clustering is generally considered as an efficient and scalable way to facilitate the management and operation of such large-scale networks and minimize the total energy consumption for prolonged lifetime. Judicious selection of cluster heads for data integration and communication is critical to the success of applications based on hierarchical sensor networks organized as layered clusters. We investigate the problem of selecting sensor nodes in a predeployed sensor network to be the cluster headsmore »to minimize the total energy needed for data gathering. We rigorously derive an analytical formula to optimize the number of cluster heads in sensor networks under uniform node distribution, and propose a Distance-based Crowdedness Clustering algorithm to determine the cluster heads in sensor networks under general node distribution. The results from an extensive set of experiments on a large number of simulated sensor networks illustrate the performance superiority of the proposed solution over the clustering schemes based on k -means algorithm. « less

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

    Office of Scientific and Technical Information (OSTI)

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

  7. PROCEEDINGS OF THE FIFTH BERKELEY WORKSHOP ON DISTRIBUTED DATA MANAGEMENT AND COMPUTER NETWORKS

    E-Print Network [OSTI]

    Johnson, R.R.

    2011-01-01

    a Relational Data Base Management System," Proc. ACM-SIGMOD,level of large data base management systems. One reason forA distributed data base management system supports a data

  8. Trends in Energy Management Technology: BCS Integration Technologies - Open Communications Networking

    E-Print Network [OSTI]

    Webster, Tom

    2002-01-01

    2000, p. 223. Trends in Energy Management Technology CBE/UCCimetrics. Trends in Energy Management Technology CBE/UC2000, p. 6. Trends in Energy Management Technology CBE/UC

  9. Trends in Energy Management Technology: BCS Integration Technologies - Open Communications Networking

    E-Print Network [OSTI]

    Webster, Tom

    2002-01-01

    223. Trends in Energy Management Technology CBE/UC BerkeleyTrends in Energy Management Technology CBE/UC Berkeley FEMP/Trends in Energy Management Technology CBE/UC Berkeley FEMP/

  10. An Interactive Context-aware Power Management Technique for Optimizing Sensor Network Lifetime

    E-Print Network [OSTI]

    Simunic, Tajana

    problem in sensor networks equipped with renewable energy sources is deciding how do you allocate energy spatio- temporal granularity. A key problem in sensor networks is deciding how do you allocate energy allocation algorithms in sensor networks. However, for sensors equipped with renewable energy sources

  11. An Industrial Network Flow Information Integration Model for Supply Chain Management and Intelligent Transportation

    E-Print Network [OSTI]

    Hsu, Cheng

    using digital connection is proposed to the field of industrial network flow control for application in a way comparable to an adaptive control panel administering an automated material handling system-factory network flows, such as material handling systems, the field of inter-factory network flow control lacks

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

    DOE Patents [OSTI]

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

    2008-01-01

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

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

    DOE Patents [OSTI]

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

    2012-01-10

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

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

    E-Print Network [OSTI]

    Albert, Réka

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Seiseki Akibue; Mio Murao

    2015-03-26

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

  18. Supernetworks for theSupernetworks for the Management of KnowledgeManagement of Knowledge

    E-Print Network [OSTI]

    Nagurney, Anna

    International Conference on Knowledge, Culture and Change in Organisations, University of Greenwich, London #12;· Internet · Transportation/logistical networks · Other telecommunication networks · Energy Era #12;Network System Nodes Links Flows Transportation Urban Intersections, Roads Autos Homes, Places

  19. Community Detection from Location-Tagged Networks

    E-Print Network [OSTI]

    Liu, Zhi

    2015-01-01

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

  20. Resetting Bounding Nodes in Acquiring Spanish

    E-Print Network [OSTI]

    Cebreiros, Ramiro

    1996-01-01

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

  1. Opportunistic scheduling in large-scale wireless networks

    E-Print Network [OSTI]

    Modiano, Eytan H.

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

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

    E-Print Network [OSTI]

    Parandehgheibi, Marzieh

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

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

    E-Print Network [OSTI]

    Iyer, Bharat Vishwanathan

    2005-02-17

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

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

    E-Print Network [OSTI]

    Chang, Yu-Han

    2003-12-04

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

  5. Stable Throughput in a Cognitive Wireless Network

    E-Print Network [OSTI]

    Fanous, Anthony

    2012-01-01

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

  6. Energy and task management in energy harvesting wireless sensor networks for structural health monitoring

    E-Print Network [OSTI]

    Steck, Jamie Bradley

    2009-01-01

    A wireless sensor network (WSN) is composed of a collectionmanagement used on systems, a WSN must have a method foras hardware advances and WSN demands expand. Energy

  7. Design and Analysis of Low Complexity Network Coding Schemes 

    E-Print Network [OSTI]

    Tabatabaei-Yazdi, Seyed

    2012-02-20

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

  8. Bayesian Belief Network (BBN)-based advisory system development for steam generator replacement project management

    E-Print Network [OSTI]

    Kim, Dohyoung, 1970-

    2002-01-01

    The growing need for improved project management technique points to the usefulness of a knowledge-base advisory system to help project managers understand current and future project status and optimize decisions based ...

  9. Architecture for Efficient Monitoring and Man-agement of Sensor Networks

    E-Print Network [OSTI]

    Wang, Yongge

    - sors. We form groups of sensors around these agents while considering the load on each agent. An energy communication which re- duces the amount of sensor energy expended in transmission, enables efficient monitoring network lifetime. The approach is vali- dated by the simulation results. Keywords: Sensor networks, Energy

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

    E-Print Network [OSTI]

    Vouyioukas, Demosthenes

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

  11. Election in complete asynchronous networks with intermittent link failures 

    E-Print Network [OSTI]

    Lokre, Jahnavi V.

    1991-01-01

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

  12. Content-aware Caching and Traffic Management in Content Distribution Networks 

    E-Print Network [OSTI]

    Amble, Meghana Mukund

    2012-02-14

    is Nd. A. Request Arrivals at Front-end Nodes Under the switch abstraction of the CDN, we have request queues of size qcs[k] at source s for content c at (discrete) time k: We denote the vector of all such queues (the system state) by ~Q[k...]: The number of requests that arrive at time k is denoted acs[k]. Arrivals are Bayesian, with nite mean c s and second moment c s: We assume that for any A 0, there exists a A > 0, such that P(acs[k] A) > 1 A 8c; s; k: In other words, the maximum...

  13. Physical layer model design for wireless networks 

    E-Print Network [OSTI]

    Yu, Yi

    2009-06-02

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

  14. Epidemic Propagation In Overlaid Wireless Networks

    SciTech Connect (OSTI)

    Yanmaz, Evsen [Los Alamos National Laboratory

    2008-01-01

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

  15. Collective network for computer structures

    DOE Patents [OSTI]

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

    2014-01-07

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

  16. Collective network for computer structures

    DOE Patents [OSTI]

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

    2011-08-16

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

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

    E-Print Network [OSTI]

    Instituto de Sistemas e Robotica

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

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

    E-Print Network [OSTI]

    Sreenan, Cormac J.

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

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

    E-Print Network [OSTI]

    Sharma, Vinod

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

  20. Distributed services for mobile ad hoc networks 

    E-Print Network [OSTI]

    Cao, Guangtong

    2005-11-01

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

  1. Global interrupt and barrier networks

    DOE Patents [OSTI]

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

    2008-10-28

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

  2. Cooperative Diversity in Interference Limited Wireless Networks

    E-Print Network [OSTI]

    Liang, Ben

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

  3. An Integration Framework for Sensor Networks and Data Stream Management Systems

    E-Print Network [OSTI]

    Lindner, Wolfgang

    that report the light and temperature Permission to copy without fee all or part of this material is granted to decide if readings from a motion-detector are correlated with network activity, or if truck loca- tions

  4. A primitive based approach for managing, deploying and monitoring in-building wireless sensor networks

    E-Print Network [OSTI]

    Dutta, Seemanta

    2012-01-01

    5.2.23 Send ZigBee coordinator information . . . . 5.2.24command primitive . . . . . . sending ZigBee coordinator7.1 Securing the ZigBee network . . . . 7.2 Securing the

  5. Strategic management for large engineering projects : the stakeholder value network approach

    E-Print Network [OSTI]

    Feng, Wen, Ph. D. Massachusetts Institute of Technology

    2013-01-01

    A critical element of the challenges and opportunities for today's large engineering projects are associated with the multi-type and networked relationships between these projects and their various stakeholders. This ...

  6. ActiveSTB: an efficient wireless resource manager in home networks 

    E-Print Network [OSTI]

    Hall, Varrian Durand

    2009-05-15

    The rapid growth of new wireless and mobile devices accessing the internet has led to an increase in the demand for multimedia streaming services. These home-based wireless connections require efficient distribution of shared network resources which...

  7. A real options approach to manage flexible contracts in the telecommunication networking industry

    E-Print Network [OSTI]

    Tay, Ee Learn, 1968-

    2004-01-01

    One of the biggest challenges facing Original Equipment Manufacturers (OEMs) and Electronic Manufacturing Services (EMS) providers in the telecommunication networking industry is to predict the spending patterns of the ...

  8. Distributed connection management for real-time communication over wormhole-routed networks 

    E-Print Network [OSTI]

    Sundaresan, Sharad

    1997-01-01

    Wormhole networks provide a very high-speed communication medium that is well suited for a large number of bandwidth demanding applications. Unfortunately, the lack of buffering in the switches causes blocked packets to transiently monopolize...

  9. On Solving Stochastic PERT Networks and Using RFIDs for Operations Management

    E-Print Network [OSTI]

    Cinicioglu, Esma N.

    2008-05-01

    The current methods used to solve stochastic PERT networks overlook the true distribution of the maximum of two distributions and thus fail to compute an accurate estimation of the project completion time. This dissertation ...

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

    SciTech Connect (OSTI)

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

    2005-09-01

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

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

    DOE Patents [OSTI]

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

    2011-05-24

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

  12. Modeling Heterogeneity in Networks using Uncertainty Quantification Tools

    E-Print Network [OSTI]

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

    2015-01-01

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

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

    DOE Patents [OSTI]

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

    2010-01-12

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

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

    DOE Patents [OSTI]

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

    2012-03-20

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

  15. Co-Simulation Tools for Networked Control Systems

    E-Print Network [OSTI]

    Branicky, Michael S.

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

  16. Network Flow Optimization under Uncertainty

    E-Print Network [OSTI]

    Tesfatsion, Leigh

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

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

    E-Print Network [OSTI]

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

  18. Network

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

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

  19. Maximizing Static Network Lifetime of Wireless Broadcast Adhoc Networks

    E-Print Network [OSTI]

    Poovendran, Radha

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

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

    E-Print Network [OSTI]

    Heetae Kim; Sang Hoon Lee; Petter Holme

    2015-04-28

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

  1. Proceedings of the sixth Berkeley workshop on distributed data management and computer networks

    SciTech Connect (OSTI)

    Various Authors

    1982-01-01

    A distributed data base management system allows data to be stored at multiple locations and to be accessed as a single unified data base. In this workshop, seventeen papers were presented which have been prepared separately for the energy data base. These items deal with data transfer, protocols and management. (GHT)

  2. A Tractable Revenue Management Model for Capacity Allocation and Overbooking over an Airline Network

    E-Print Network [OSTI]

    Topaloglu, Huseyin

    to the reservations were given by a separable function, then the optimality equation for the joint capacity allocationA Tractable Revenue Management Model for Capacity Allocation and Overbooking over an Airline a revenue management model to jointly make the capacity allocation and overbooking decisions over an airline

  3. Communication in Home Area Networks

    E-Print Network [OSTI]

    Wang, Yubo

    2012-01-01

    of smart home energy management systems based on zigbee”,Networks Enabling Energy Management Systems ”, Universities'Profile HV Home Energy Management System High Voltage SNR

  4. Managing the Management: CORBAbased Instrumentation of Management Systems

    E-Print Network [OSTI]

    Managing the Management: CORBA­based Instrumentation of Management Systems A. Keller Munich Network Management Team Department of Computer Science, TU MË? unchen Arcisstr. 21, D­80333 Munich, Germany akeller@ieee.org Proceedings of the Sixth IFIP/IEEE International Symposium on Integrated Network Management (IM'99), Boston

  5. On the Throughput Capacity of Heterogeneous Wireless Networks

    E-Print Network [OSTI]

    Latchman, Haniph A.

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

  6. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, D.B.

    1994-07-19

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

  7. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, Dario B. (DeSoto, TX)

    1994-01-01

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

  8. Standards Development and Deployment of a Comprehensive, Integrated, Open-standard Monitoring and Equipment Control Networking Protocol Infrastructure for Effective Facility Energy Management of a Large-scale Industrial Site in Alberta, Canada 

    E-Print Network [OSTI]

    Bernstein, R.

    2014-01-01

    Integration (FMSI) Responsibilities • Building Automation System Panel Integration • Design, Maintain, and Supply BMS Panels • Building Management System • User interface • Common dashboard look and feel • Database management and maintenance • BMS software... Suncor Building Management System Standards Development and Deployment of a Comprehensive, Integrated, Open-standard Monitoring and Equipment Control Networking Protocol Infrastructure for Effective Facility Energy Management of a Large...

  9. Magic of Numbers in Networks of Wireless Image Sensors

    E-Print Network [OSTI]

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

    2006-01-01

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

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

    E-Print Network [OSTI]

    Kent, University of

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

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

    E-Print Network [OSTI]

    Beigl, Michael

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

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

    E-Print Network [OSTI]

    Calamoneri, Tiziana

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

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

    E-Print Network [OSTI]

    Li, Xiaolin "Andy"

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

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

    E-Print Network [OSTI]

    Birman, Kenneth P.

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

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

    E-Print Network [OSTI]

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

  16. Bridging the Gap between Network and Project Selection Levels in Pavement Management 

    E-Print Network [OSTI]

    Gurganus, Charles Felder

    2011-08-08

    projects). This research focuses on evaluating the Texas Department of Transportation’s (TxDOT) Pavement Management Information System (PMIS) to assess the agreement between its need estimates and actual construction projects at the district level...

  17. Eradicating Computer Viruses on Networks

    E-Print Network [OSTI]

    Huang, Jinyu

    2012-01-01

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

  18. A Wireless Body Sensor Network for the Prevention and Management of Asthma

    E-Print Network [OSTI]

    's activities, geographic location, and air pollution exposures occurs. At the personal network layer (PNL smoke and outdoor air pollution), and exercise. Often triggers are associated with an asthmatic pollution levels are high [8]. However, asthmatics may find it difficult to avoid urban air pollution. Also

  19. Refactoring Network Control and Management: A Case for the 4D Architecture

    E-Print Network [OSTI]

    of elementary functions to distribute explicit instructions to manipulate the data plane forwarding mechanisms design, routing protocols #12;Abstract We argue for the refactoring of the IP control plane to support network-wide objectives and control. We put forward a design that refactors functionality into a novel 4D

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

    SciTech Connect (OSTI)

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

    2014-01-28

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

  1. Clock Agreement Among Parallel Supercomputer Nodes

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

    Jones, Terry R.; Koenig, Gregory A.

    2014-04-30

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

  2. Clock Agreement Among Parallel Supercomputer Nodes

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

    Jones, Terry R.; Koenig, Gregory A.

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

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

    DOE Patents [OSTI]

    Crosetto, D.B.

    1996-12-31

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

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

    DOE Patents [OSTI]

    Crosetto, Dario B. (DeSoto, TX)

    1996-01-01

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

  5. Dynamic Networks: Recent Results and Applications

    E-Print Network [OSTI]

    Nagurney, Anna

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

  6. Power-Adaptive Routing Topology for Remote Sensor Networks

    E-Print Network [OSTI]

    Mishra, Prabhat

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

  7. Information Survival Threshold in Sensor and P2P Networks

    E-Print Network [OSTI]

    Pratt, Vaughan

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

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

    E-Print Network [OSTI]

    Langendoen, Koen

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

  9. Zone routing in a torus network

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

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

  10. Optimized Node Selection for Compressive Sleeping Wireless Sensor Networks

    E-Print Network [OSTI]

    Chen, Wei; Wassell, Ian J.

    2015-02-05

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

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

    E-Print Network [OSTI]

    Panwar, Shivendra S.

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

  12. The normalization of meshes and nodes in electrical networks 

    E-Print Network [OSTI]

    Johnson, Allen Forrest

    1951-01-01

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

  13. Report on Management Controls Over the Licensing Support Network for the Yucca Mountain Repository

    SciTech Connect (OSTI)

    none,

    2004-05-31

    The Department identified a number of steps that had to be accomplished prior to making its documents available on the Network. Initially, relevant documents have to be identified and captured from each of its organizations and contractors. Then, the documents must be reviewed for legibility; a bibliographic header must be added; and each document has to be screened to ensure that sensitive unclassified, Privacy Act, or privileged information is not released to the public. Once relevant documents are processed through these steps, they are posted to the Department's website. Once posted to the Department's website, the documents will be made available for indexing by the NRC. The NRC will then search the information for key words and build indices into the Network. After indexing is complete, the documents will be available to the public. Although the Department plans to submit its license application in December 2004, the NRC will not begin the license application proceedings unless all documents are available for public review through the Network for at least six months.

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

    E-Print Network [OSTI]

    Jung, Eun Jae

    2009-05-15

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

  15. Wireless Networks 6 (2000) 263277 263 Application-driven power management for mobile communication

    E-Print Network [OSTI]

    Han, Richard Y.

    2000-01-01

    to be properly managed to conserve energy. In this paper, we present the design and implementation results from experiments using our implementation of the protocol. These experiments measure the energy and compare the effects of different suspension strategies. Our results show up to 83% savings in the energy

  16. DEMAND MANAGEMENT FOR HOME ENERGY NETWORKS USING COST-OPTIMAL APPLIANCE SCHEDULING

    E-Print Network [OSTI]

    Rakocevic, Veselin

    , Madrid, Spain veselin.rakocevic.1@city.ac.uk Keywords: Smart Homes, Optimization for Efficient Energy Consumption, Energy Profiling and Measurement, Energy Demand Management, Economic Models of Energy Efficiency. For energy providers, the greatest remaining challenges lie in: (1) development of intelligent resource

  17. management

    National Nuclear Security Administration (NNSA)

    5%2A en Management and Budget http:www.nnsa.energy.govaboutusouroperationsmanagementandbudget

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

    E-Print Network [OSTI]

    Singh, Shweta

    2012-01-01

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

  19. Disaster risk management in prospect mining area Blitar district, East Java, using microtremor analysis and ANP (analytical network processing) approach

    SciTech Connect (OSTI)

    Parwatiningtyas, Diyan E-mail: erlinunindra@gmail.com; Ambarsari, Erlin Windia E-mail: erlinunindra@gmail.com; Marlina, Dwi E-mail: erlinunindra@gmail.com; Wiratomo, Yogi E-mail: erlinunindra@gmail.com

    2014-03-24

    Indonesia has a wealth of natural assets is so large to be managed and utilized, either from its own local government and local communities, especially in the mining sector. However, mining activities can change the state of the surface layer of the earth that have a high impact disaster risk. This could threaten the safety and disrupt human life, environmental damage, loss of property, and the psychological impact, sulking to the rule of law no 24 of 2007. That's why we strive to manage and minimize the risk of mine disasters in the region, how to use the method of calculation of Amplification Factor (AF) from the analysis based microtremor sulking Kanai and Nakamura, and decision systems were tested by analysis of ANP. Based on the amplification factor and Analytical Network Processing (ANP) obtained, some points showed instability in the surface layer of a mining area include the site of the TP-7, TP-8, TP-9, TP-10, (Birowo2). If in terms of structure, location indicated unstable due to have a sloping surface layer, resulting in the occurrence of landslides and earthquake risk is high. In the meantime, other areas of the mine site can be said to be a stable area.

  20. ODU Sensor Network Research Group 11 Information assuranceInformation assurance

    E-Print Network [OSTI]

    Goddard, Wayne

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

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

    E-Print Network [OSTI]

    Borchers, Brian

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

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

    E-Print Network [OSTI]

    Oh, Eunseuk

    2004-11-15

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

  3. Complex networks vulnerability to module-based attacks

    E-Print Network [OSTI]

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

    2015-01-01

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

  4. Using social network and stakeholder analysis to help evaluate infectious waste management: A step towards a holistic assessment

    SciTech Connect (OSTI)

    Caniato, Marco; Vaccari, Mentore; Visvanathan, Chettiyappan; Zurbrügg, Christian

    2014-05-01

    Highlights: • Assessment of infectious waste management in Bangkok, in particular incineration. • Integration of social network and stakeholder analysis assessment methods. • Assessment of stakeholder characteristics, role, interaction and communication. • Interviewees self-evaluate their own characteristics and the system. • Non-technical aspects are important for system acceptability, and sustainability. - Abstract: Assessing the strengths and weaknesses of a solid waste management scheme requires an accurate analysis and integration of several determining features. In addition to the technical aspects, any such system shows a complex interaction of actors with varying stakes, decision-making power and influence, as well as a favourable or disabling environment. When capitalizing on the knowledge and experience from a specific case, it is also crucial that experts do not “forget” or underestimate the importance of such social determinants and that they are familiar with the methods and tools to assess them. Social network analysis (SNA) and stakeholder analysis (SA) methods can be successfully applied to better understand actors’ role and actions, analyse driving forces and existing coordination among stakeholders, as well as identify bottlenecks in communication which affect daily operations or strategic planning for the future way forward. SNA and SA, appropriately adjusted for a certain system, can provide a useful integration to methods by assessing other aspects to ensure a comprehensive picture of the situation. This paper describes how to integrate SNA and SA in order to survey a solid waste management system. This paper presents the results of an analysis of On-Nuch infectious waste incinerator in Bangkok, Thailand. Stakeholders were interviewed and asked to prioritize characteristics and relationships which they consider particularly important for system development and success of the scheme. In such a way, a large quantity of information about organization, communication between stakeholders and their perception about operation, environmental and health impact, and potential alternatives for the system was collected in a systematic way. The survey results suggest that stakeholders are generally satisfied with the system operation, though communication should be improved. Moreover, stakeholders should be strategically more involved in system development planning, according to their characteristics, to prevent negative reactions.

  5. Demand-Supply Optimization with Risk Management for a Multi-Connection Water Reservoir Network

    E-Print Network [OSTI]

    Chatpatanasiri, Ratthachat

    2009-01-01

    In this paper, we propose a framework to solve a demand-supply optimization problem of long-term water resource allocation on a multi-connection reservoir network which, in two aspects, is different to the problem considered in previous works. First, while all previous works consider a problem where each reservoir can transfer water to only one fixed reservoir, we consider a multi-connection network being constructed in Thailand in which each reservoir can transfer water to many reservoirs in one period of time. Second, a demand-supply plan considered here is static, in contrast to a dynamic policy considered in previous works. Moreover, in order to efficiently develop a long-term static plan, a severe loss (a risk) is taken into account, i.e. a risk occurs if the real amount of water stored in each reservoir in each time period is less than what planned by the optimizer. The multi-connection function and the risk make the problem rather complex such that traditional stochastic dynamic programming and determi...

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

    DOE Patents [OSTI]

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

    2013-10-22

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

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

    E-Print Network [OSTI]

    Liang, Weifa

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

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

    E-Print Network [OSTI]

    Mitzenmacher, Michael

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

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

    E-Print Network [OSTI]

    Lui, John C.S.

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

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

    DOE Patents [OSTI]

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

    2010-08-24

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

  11. Dynamic sensor tasking in heterogeneous, mobile sensor networks

    E-Print Network [OSTI]

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

    2005-01-01

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

  12. An energy efficient RF transceiver for wireless microsensor networks

    E-Print Network [OSTI]

    Daly, Denis Clarke

    2005-01-01

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

  13. Wound Healing & Management Node Taxonomy 30th September 2011

    E-Print Network [OSTI]

    Mucina, Ladislav

    dressings) Mechanical debridement - hydrotherapy-whirlpool, low frequency ultrasound, pressure irrigation honey Povidone impregnated Tea tree oil impregnated Hypertonic saline impregnated Silver impregnated Chlorhexidine impregnated 11. Topical Negative Pressure Foam systems - VACTM Gauze systems ­ (Arjo

  14. Visual Matrix Clustering of Social Networks

    SciTech Connect (OSTI)

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

    2013-07-01

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

  15. International Journal of Network Security, Vol.16, No.4, PP.289303, July 2014 289 Penny: Secure, Decentralized Data Management

    E-Print Network [OSTI]

    Hamlen, Kevin W.

    International Journal of Network Security, Vol.16, No.4, PP.289­303, July 2014 289 Penny: Secure in these networks. This paper presents Penny, a structured P2P network that efficiently supports integrity that Penny can efficiently handle realistic P2P network traffic and robust enough to prevent malicious

  16. Mobile Zigbee Sensor Networks

    E-Print Network [OSTI]

    Anantdeep, Er; Kaur, Er Balpreet

    2010-01-01

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

  17. October 2006 LOG MANAGEMENT: USING

    E-Print Network [OSTI]

    to Computer Security Log Management NIST's Information Technology Laboratory recently issued SpecialOctober 2006 LOG MANAGEMENT: USING COMPUTER AND NETWORK RECORDS TO IMPROVE INFORMATION SECURITY LOG MANAGEMENT: USING COMPUTER AND NETWORK RECORDS TO IMPROVE INFORMATION SECURITY Shirley Radack, Editor

  18. Software Defined Networking (SDN) Project

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

    Networking (SDN) Project Energy sector-focused SDN flow controller to manage control system networks centrally and securely Background Traditional information technology (IT)...

  19. Advanced mobile networking, sensing, and controls.

    SciTech Connect (OSTI)

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

    2005-03-01

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

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

    E-Print Network [OSTI]

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

    2012-01-01

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

  1. Optimum Transmission Range for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Deng, Jing

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

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

    E-Print Network [OSTI]

    Si, Yain Whar "Lawrence"

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

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

    E-Print Network [OSTI]

    Govindan, Ramesh

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

  4. Monitoring Churn in Wireless Networks Stephan Holzer1

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Choi, Suhyoung

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

  6. Optimal redundancy against disjoint vulnerabilities in networks

    E-Print Network [OSTI]

    Krause, Sebastian M; Zlati?, Vinko

    2015-01-01

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

  7. Class network routing

    DOE Patents [OSTI]

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

    2009-09-08

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

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

    E-Print Network [OSTI]

    Laneman, J. Nicholas

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Jeong, Jaehoon "Paul"

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

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

    E-Print Network [OSTI]

    Dettmann, Carl

    2012-01-01

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

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

    E-Print Network [OSTI]

    Tong, Lang

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

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

    E-Print Network [OSTI]

    Kranakis, Evangelos

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

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

    E-Print Network [OSTI]

    Albert, Réka

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

  17. Bayesian networks: maths problems March 31, 2009

    E-Print Network [OSTI]

    Barker, Jon

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

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

    E-Print Network [OSTI]

    Kwon, Ji Heon

    2008-05-27

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

  19. 1256 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 16, NO. 5, SEPTEMBER 2005 Web Content Management by Self-Organization

    E-Print Network [OSTI]

    Yin, Hujun

    --We present a new method for content management and knowledge discovery using a topology-preserving neural to manually annotate electronic documents, e.g., webmas- ters and knowledge managers dealing with content-commerce, software contents management, doc- ument management and knowledge discovery [1]. Document management

  20. Capacitated Node Routing Problems (Preliminary Progress Report)

    E-Print Network [OSTI]

    Ralphs, Ted

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

  1. Multiresolution Storage and Search in Sensor Networks

    E-Print Network [OSTI]

    Heidemann, John

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

  2. QoS-Assured Service Composition in Managed Service Overlay Networks Xiaohui Gu, Klara Nahrstedt Rong N. Chang, Christopher Ward

    E-Print Network [OSTI]

    Nahrstedt, Klara

    Network (SON) SON Access Domain Service Provider: XXX.com service instance X service instance Y service

  3. Caching in wireless networks

    E-Print Network [OSTI]

    Niesen, Urs

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

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

    DOE Patents [OSTI]

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

    2010-03-30

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

  5. Downhole drilling network using burst modulation techniques

    DOE Patents [OSTI]

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

    2007-04-03

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

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

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

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

    2013-01-01

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

  7. Distributed Network Monitoring using Mobile Agents Paradigm Farhad Kamangar, David Levine, Gergely V. Zruba, and Navakiran Chitturi

    E-Print Network [OSTI]

    Záruba, Gergely

    , servers and management agents. The network management load is equally distributed between managers monitoring and management has been done using predominantly centralized techniques. Mobile agents have been, Network Management, Mobile Agent, Java, Distributed, Dynamic, Network Modeling, Fault

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

    DOE Patents [OSTI]

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

    2011-07-19

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

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

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

    E-Print Network [OSTI]

    Rossi, Michele

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

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

    E-Print Network [OSTI]

    Soatto, Stefano

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

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

    E-Print Network [OSTI]

    Mehta, Anoop

    2015-01-01

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

  13. Networks of recyclable material waste-picker’s cooperatives: An alternative for the solid waste management in the city of Rio de Janeiro

    SciTech Connect (OSTI)

    Tirado-Soto, Magda Martina; Zamberlan, Fabio Luiz

    2013-04-15

    Highlights: ? In the marketing of recyclable materials, the waste-pickers are the least wins. ? It is proposed creating a network of recycling cooperatives to achieve viability. ? The waste-pickers contribute to waste management to the city. - Abstract: The objective of this study is to discuss the role of networks formed of waste-picker cooperatives in ameliorating problems of final disposal of solid waste in the city of Rio de Janeiro, since the city’s main landfill will soon have to close because of exhausted capacity. However, it is estimated that in the city of Rio de Janeiro there are around five thousand waste-pickers working in poor conditions, with lack of physical infrastructure and training, but contributing significantly by diverting solid waste from landfills. According to the Sustainable Development Indicators (IBGE, 2010a,b) in Brazil, recycling rates hover between 45% and 55%. In the municipality of Rio de Janeiro, only 1% of the waste produced is collected selectively by the government (COMLURB, 2010), demonstrating that recycling is mainly performed by waste-pickers. Furthermore, since the recycling market is an oligopsony that requires economies of scale to negotiate directly with industries, the idea of working in networks of cooperatives meets the demands for joint marketing of recyclable materials. Thus, this work presents a method for creating and structuring a network of recycling cooperatives, with prior training for working in networks, so that the expected synergies and joint efforts can lead to concrete results. We intend to demonstrate that it is first essential to strengthen the waste-pickers’ cooperatives in terms of infrastructure, governance and training so that solid waste management can be environmentally, socially and economically sustainable in the city of Rio de Janeiro.

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

  15. Flexible network wireless transceiver and flexible network telemetry transceiver

    DOE Patents [OSTI]

    Brown, Kenneth D. (Grain Valley, MO)

    2008-08-05

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

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

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

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

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

    E-Print Network [OSTI]

    Bergman, Keren

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

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

    DOE Patents [OSTI]

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

    2011-01-25

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

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

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

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

  20. IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 10, NO. 4, AUGUST 2002 579 Managing Capacity for Telecommunications

    E-Print Network [OSTI]

    Papadopouli, Maria

    revenues. We study the underlying risk factor in the bandwidth market and then apply real options theory. To the best of our knowledge, this real options approach has not been used previously in the area of network. Index Terms--Network planning, real options, uncertain demand for capacity. I. INTRODUCTION IN THE PAST

  1. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-01-01

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

  2. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-06-01

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

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

    E-Print Network [OSTI]

    Manohar, Rajit

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

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

    E-Print Network [OSTI]

    Manohar, Rajit

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

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

    E-Print Network [OSTI]

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

    2007-01-01

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

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

    E-Print Network [OSTI]

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

    2007-01-01

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

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

    E-Print Network [OSTI]

    Tavakoli, Arsalan

    2009-01-01

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

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

    DOE Patents [OSTI]

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

    2013-01-29

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

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

    E-Print Network [OSTI]

    Levi, Albert

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

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

    E-Print Network [OSTI]

    Xu, Wenyuan

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

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

    E-Print Network [OSTI]

    International Association for Cryptologic Research (IACR)

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

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

    E-Print Network [OSTI]

    Demaine, Erik D.

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

  13. A quantum access network

    E-Print Network [OSTI]

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

    2014-09-02

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

  14. The extreme vulnerability of interdependent spatially embedded networks

    E-Print Network [OSTI]

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

    2015-01-01

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

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

    E-Print Network [OSTI]

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

    2015-01-01

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

  16. A Failure Self-recovery Strategy with Balanced Energy Consumption for Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Qiu, Tie; Xia, Feng; Wu, Guowei; Zhou, Yu

    2012-01-01

    In energy constrained wireless sensor networks, it is significant to make full use of the limited energy and maximize the network lifetime even when facing some unexpected situation. In this paper, all sensor nodes are grouped into clusters, and for each cluster, it has a mobile cluster head to manage the whole cluster. We consider an emergent situation that one of the mobile cluster heads is broken down, and hence the whole cluster is consequently out of work. An efficient approach is proposed for recovering the failure cluster by selecting multiple static sensor nodes as the cluster heads to collect packets and transmit them to the sink node. Improved simulated annealing algorithm is utilized to achieve the uniform deployment of the cluster heads. The new cluster heads are dynamically changed in order to keep balanced energy consumption. Among the new cluster heads, packets are transmitted through multi-hop forwarding path which is cost-lowest path found by Dijkstra's algorithm. A balanced energy consumptio...

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

    E-Print Network [OSTI]

    Analyti, Anastasia

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

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

    E-Print Network [OSTI]

    Shinozuka, Masanobu

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

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

    E-Print Network [OSTI]

    Chan, Shueng-Han Gary

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

  20. Information Capacity of an Energy Harvesting Sensor Node

    E-Print Network [OSTI]

    Viswanath, Pramod

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

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

    E-Print Network [OSTI]

    Najm, Farid N.

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

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

    E-Print Network [OSTI]

    Tufto, Jarle

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

  3. Efficiently Operating Wireless Nodes Powered by Renewable Energy Sources

    E-Print Network [OSTI]

    Gautam, Natarajan

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

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

    E-Print Network [OSTI]

    Narizuka, Takuma; Yamazaki, Yoshihiro

    2015-01-01

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

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

    E-Print Network [OSTI]

    Baras, John S.

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

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

    E-Print Network [OSTI]

    Song, Dawn

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

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

    E-Print Network [OSTI]

    Santoro, Nicola

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

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

    E-Print Network [OSTI]

    Santoro, Nicola

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

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

    E-Print Network [OSTI]

    Ingrand, François

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

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

    E-Print Network [OSTI]

    Ungerer, Theo

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

  11. Scaling the Earth System Grid to 100Gbps Networks

    SciTech Connect (OSTI)

    Balman, Mehmet; Sim, Alex

    2012-03-02

    The SC11 demonstration, titled Scaling the Earth System Grid to 100Gbps Networks, showed the ability to use underlying infrastructure for the movement of climate data over 100Gbps network. Climate change research is one of the critical data intensive sciences, and the amount of data is continuously growing. Climate simulation data is geographically distributed over the world, and it needs to be accessed from many sources for fast and efficient analysis and inter-comparison of simulations. We used a 100Gbps link connecting National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory (LBNL), Argonne National Laboratory (ANL) and Oak Ridge National Laboratory (ORNL). In the demo, the Intergovernmental Panel on Climate Change (IPCC) Fourth Assessment Report (AR4) phase 3 of the Coupled Model Intercomparison Project (CMIP-3) dataset was staged into the memory of computing nodes at ANL and ORNL from NERSC over the 100Gbps network for analysis and visualization. In general, climate simulation data consists of relatively small and large files with irregular file size distribution in each dataset. In this demo, we addressed challenges on data management in terms of high bandwidth networks, usability of existing protocols and middleware tools, and how applications can adapt and benefit from next generation networks.

  12. Environmental sensor networks and continuous data quality assurance to manage salinity within a highly regulated river basin

    E-Print Network [OSTI]

    Quinn, N.W.T.

    2010-01-01

    Unfortunately software systems for data quality assurancedata quality management using a novel software tool,and water quality sondes) and dataloggers with software that

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

    SciTech Connect (OSTI)

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

    2009-01-01

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

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

    E-Print Network [OSTI]

    Albert, Réka

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

  15. Environmental sensor networks and continuous data quality assurance to manage salinity within a highly regulated river basin

    SciTech Connect (OSTI)

    Quinn, N.W.T.; Ortega, R.; Holm, L.

    2010-01-05

    This paper describes a new approach to environmental decision support for salinity management in the San Joaquin Basin of California that focuses on web-based data sharing using YSI Econet technology and continuous data quality management using a novel software tool, Aquarius.

  16. Optimize Storage Placement in Sensor Networks

    E-Print Network [OSTI]

    Li, Qun

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

  17. Observability of Neuronal Network Motifs (Invited Paper)

    E-Print Network [OSTI]

    Brennan, Sean

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

  18. Fractional Immunization in Networks B. Aditya Prakash

    E-Print Network [OSTI]

    Faloutsos, Christos

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

  19. Optimal Topology Design in Wireless Personal Area Networks

    E-Print Network [OSTI]

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

  20. Fault Tolerant Deployment and Topology Control in Wireless Networks

    E-Print Network [OSTI]

    Li, Xiang-Yang

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

  1. Minimum Energy Coding for Wireless NanoSensor Networks

    E-Print Network [OSTI]

    Shihada, Basem

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

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

    E-Print Network [OSTI]

    Bystroff, Chris

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

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

    E-Print Network [OSTI]

    Stankovic, John A.

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

  4. Resource Allocation in Sensor Networks with Renewable Energy

    E-Print Network [OSTI]

    Koksal, Can Emre

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

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

    SciTech Connect (OSTI)

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

    2009-04-01

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

  6. Deterministic Scale-Free Networks

    E-Print Network [OSTI]

    Albert-Laszlo Barabasi; Erzsebet Ravasz; Tamas Vicsek

    2002-02-06

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

  7. SCANDEX: Service Centric Networking for Challenged Decentralised Networks

    E-Print Network [OSTI]

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

    2015-05-18

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

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

    E-Print Network [OSTI]

    Elkashlan, Maged

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

  9. Course Information SER 234 Operating Systems and Networking

    E-Print Network [OSTI]

    · · · · · · · · · · · Course Information SER 234 Operating Systems and Networking Catalog Description Fundamentals of operating systems, process management, scheduling, and file management. Network technology, topologies, protocols, application control; network and operating system security. Credit Hours

  10. On the Capacity of Hybrid Wireless Networks Benyuan Liu

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

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

  11. Datacenter-Scale Network Research on FPGAs Zhangxi Tan

    E-Print Network [OSTI]

    Asanovi?, Krste

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

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

    E-Print Network [OSTI]

    Asanovic, Krste

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

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

    E-Print Network [OSTI]

    Zhang, Fenghui

    2008-10-10

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

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

    E-Print Network [OSTI]

    Brown III, Donald R.

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

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

    E-Print Network [OSTI]

    Liang, Weifa

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

  16. Algorithms for Determining Network Robustness Heath J. LeBlanc

    E-Print Network [OSTI]

    Koutsoukos, Xenofon D.

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Liu, Jiangchuan (JC)

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

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

    E-Print Network [OSTI]

    Durresi, Arjan

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

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

    E-Print Network [OSTI]

    Vouyioukas, Demosthenes

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

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

    E-Print Network [OSTI]

    Redner, Sidney

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

  2. Profit-based Routing for Centralized Wireless Networks

    E-Print Network [OSTI]

    Bahk, Saewoong

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

  3. Maximizing Battery Life Routing in Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Liang, Weifa

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

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

    E-Print Network [OSTI]

    Simunic, Tajana

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

  5. The multicast capacity region of large wireless networks

    E-Print Network [OSTI]

    Shah, Devavrat

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

  6. Computing the Capacity Region of a Wireless Network

    E-Print Network [OSTI]

    Gummadi, Ramakrishna

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

  7. ESF/PESC Exploratory Workshop on Wireless Sensor Networks

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Kansas, University of

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

  9. Industrial Applications of Networked Control Karl H. Johansson

    E-Print Network [OSTI]

    Johansson, Karl Henrik

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

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

    E-Print Network [OSTI]

    Erkip, Elza

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

  11. The flux measure of influence in engineering networks

    E-Print Network [OSTI]

    Schwing, Kyle Michael

    2009-01-01

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

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

    E-Print Network [OSTI]

    Hassanzadeh, Amin

    2014-05-03

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

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

    E-Print Network [OSTI]

    Ozgul, Damla

    2011-10-21

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

  14. Worst-Case Analysis of Network Design Problem Heuristics

    E-Print Network [OSTI]

    Wong, Richard T.

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

  15. Decentralized detection in resource-limited sensor network architectures

    E-Print Network [OSTI]

    Tay, Wee Peng

    2008-01-01

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

  16. Decentralized TDOA Sensor Pairing in Multihop Wireless Sensor Networks

    E-Print Network [OSTI]

    Meng, Wei; Lihua, Xie; Wendong, Xiao

    2013-01-01

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

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

    E-Print Network [OSTI]

    Albert, Réka

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

  18. Automatic data for applied railway management : passenger demand, service quality measurement, and tactical planning on the London Overground Network

    E-Print Network [OSTI]

    Frumin, Michael S

    2010-01-01

    The broad goal of this thesis is to demonstrate the potential positive impacts of applying automatic data to the management and tactical planning of a modern urban railway. Tactical planning is taken here to mean the set ...

  19. Web-Interactive Integration of Regional Weather Networks for Risk Management of Late Blight in Potato Canopies

    E-Print Network [OSTI]

    Douches, David S.

    of potato late blight. The system integrates regional automated weather network data, fungicide rates application for 30 Michigan sites were updated daily. From 1997 to 2000, the use of weather data in grower according to weather-based recommendations. #12;3 Late blight of potato, caused by Phytophthora infestans

  20. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, ACCEPTED FOR PUBLICATION 1 Measurement-Aware Monitor Placement and

    E-Print Network [OSTI]

    Chuah, Chen-Nee

    , Chia-Wei Chang, Chen-Nee Chuah, and Bill Lin Abstract--Network-wide traffic measurement is important it for publication was L. Deri. G. Huang and C.-N. Chuah are with the University of California at Davis, CA USA (e