Science.gov

Sample records for distribution networks sistema

  1. Distributed network scheduling

    NASA Technical Reports Server (NTRS)

    Clement, Bradley J.; Schaffer, Steven R.

    2004-01-01

    Distributed Network Scheduling is the scheduling of future communications of a network by nodes in the network. This report details software for doing this onboard spacecraft in a remote network. While prior work on distributed scheduling has been applied to remote spacecraft networks, the software reported here focuses on modeling communication activities in greater detail and including quality of service constraints. Our main results are based on a Mars network of spacecraft and include identifying a maximum opportunity of improving traverse exploration rate a factor of three; a simulation showing reduction in one-way delivery times from a rover to Earth from as much as 5 to 1.5 hours; simulated response to unexpected events averaging under an hour onboard; and ground schedule generation ranging from seconds to 50 minutes for 15 to 100 communication goals.

  2. Network aware distributed applications

    SciTech Connect

    Agarwal, Deborah; Tierney, Brian L.; Gunter, Dan; Lee, Jason; Johnston, William

    2001-02-04

    Most distributed applications today manage to utilize only a small percentage of the needed and available network bandwidth. Often application developers are not aware of the potential bandwidth of the network, and therefore do not know what to expect. Even when application developers are aware of the specifications of the machines and network links, they have few resources that can help determine why the expected performance was not achieved. What is needed is a ubiquitous and easy-to-use service that provides reliable, accurate, secure, and timely estimates of dynamic network properties. This service will help advise applications on how to make use of the network's increasing bandwidth and capabilities for traffic shaping and engineering. When fully implemented, this service will make building currently unrealizable levels of network awareness into distributed applications a relatively mundane task. For example, a remote data visualization application could choose between sending a wireframe, a pre-rendered image, or a 3-D representation, based on forecasts of CPU availability and power, compression options, and available bandwidth. The same service will provide on-demand performance information so that applications can compare predicted with actual results, and allow detailed queries about the end-to-end path for application and network tuning and debugging.

  3. Prototyping distributed simulation networks

    NASA Technical Reports Server (NTRS)

    Doubleday, Dennis L.

    1990-01-01

    Durra is a declarative language designed to support application-level programming. The use of Durra is illustrated to describe a simple distributed application: a simulation of a collection of networked vehicle simulators. It is shown how the language is used to describe the application, its components and structure, and how the runtime executive provides for the execution of the application.

  4. Distributed Semantic Overlay Networks

    NASA Astrophysics Data System (ADS)

    Doulkeridis, Christos; Vlachou, Akrivi; Nørvåg, Kjetil; Vazirgiannis, Michalis

    Semantic Overlay Networks (SONs) have been recently proposed as a way to organize content in peer-to-peer (P2P) networks. The main objective is to discover peers with similar content and then form thematically focused peer groups. Efficient content retrieval can be performed by having queries selectively forwarded only to relevant groups of peers to the query. As a result, less peers need to be contacted, in order to answer a query. In this context, the challenge is to generate SONs in a decentralized and distributed manner, as the centralized assembly of global information is not feasible. Different approaches for exploiting the generated SONs for content retrieval have been proposed in the literature, which are examined in this chapter, with a particular focus on SON interconnections for efficient search. Several applications, such as P2P document and image retrieval, can be deployed over generated SONs, motivating the need for distributed and truly scalable SON creation. Therefore, recently several research papers focus on SONs as stated in our comprehensive overview of related work in the field of semantic overlay networks. A classification of existing algorithms according to a set of qualitative criteria is also provided. In spite of the rich existing work in the field of SONs, several challenges have not been efficiently addressed yet, therefore, future promising research directions are pointed out and discussed at the end of this chapter.

  5. Distributed Observer Network

    NASA Technical Reports Server (NTRS)

    2008-01-01

    NASA s advanced visual simulations are essential for analyses associated with life cycle planning, design, training, testing, operations, and evaluation. Kennedy Space Center, in particular, uses simulations for ground services and space exploration planning in an effort to reduce risk and costs while improving safety and performance. However, it has been difficult to circulate and share the results of simulation tools among the field centers, and distance and travel expenses have made timely collaboration even harder. In response, NASA joined with Valador Inc. to develop the Distributed Observer Network (DON), a collaborative environment that leverages game technology to bring 3-D simulations to conventional desktop and laptop computers. DON enables teams of engineers working on design and operations to view and collaborate on 3-D representations of data generated by authoritative tools. DON takes models and telemetry from these sources and, using commercial game engine technology, displays the simulation results in a 3-D visual environment. Multiple widely dispersed users, working individually or in groups, can view and analyze simulation results on desktop and laptop computers in real time.

  6. Distributed Observer Network

    NASA Technical Reports Server (NTRS)

    Conroy, Michael; Mazzone, Rebecca; Little, William; Elfrey, Priscilla; Mann, David; Mabie, Kevin; Cuddy, Thomas; Loundermon, Mario; Spiker, Stephen; McArthur, Frank; Srey, Tate; Bonilla, Dennis

    2010-01-01

    The Distributed Observer network (DON) is a NASA-collaborative environment that leverages game technology to bring three-dimensional simulations to conventional desktop and laptop computers in order to allow teams of engineers working on design and operations, either individually or in groups, to view and collaborate on 3D representations of data generated by authoritative tools such as Delmia Envision, Pro/Engineer, or Maya. The DON takes models and telemetry from these sources and, using commercial game engine technology, displays the simulation results in a 3D visual environment. DON has been designed to enhance accessibility and user ability to observe and analyze visual simulations in real time. A variety of NASA mission segment simulations [Synergistic Engineering Environment (SEE) data, NASA Enterprise Visualization Analysis (NEVA) ground processing simulations, the DSS simulation for lunar operations, and the Johnson Space Center (JSC) TRICK tool for guidance, navigation, and control analysis] were experimented with. Desired functionalities, [i.e. Tivo-like functions, the capability to communicate textually or via Voice-over-Internet Protocol (VoIP) among team members, and the ability to write and save notes to be accessed later] were targeted. The resulting DON application was slated for early 2008 release to support simulation use for the Constellation Program and its teams. Those using the DON connect through a client that runs on their PC or Mac. This enables them to observe and analyze the simulation data as their schedule allows, and to review it as frequently as desired. DON team members can move freely within the virtual world. Preset camera points can be established, enabling team members to jump to specific views. This improves opportunities for shared analysis of options, design reviews, tests, operations, training, and evaluations, and improves prospects for verification of requirements, issues, and approaches among dispersed teams.

  7. Distributed Sensor Networks

    DTIC Science & Technology

    2014-03-25

    measures found for the network in Figure 111-2. Note that none of the nodes can hear all of the reference nodes, so no node is performing triangulation ...environment. A newly purchased laser graphics printer was added to support higher resolution graphics hard-copy output. An enhanced version of AT&T’s

  8. Distributed semantic networks and CLIPS

    NASA Technical Reports Server (NTRS)

    Snyder, James; Rodriguez, Tony

    1991-01-01

    Semantic networks of frames are commonly used as a method of reasoning in many problems. In most of these applications the semantic network exists as a single entity in a single process environment. Advances in workstation hardware provide support for more sophisticated applications involving multiple processes, interacting in a distributed environment. In these applications the semantic network may well be distributed over several concurrently executing tasks. This paper describes the design and implementation of a frame based, distributed semantic network in which frames are accessed both through C Language Integrated Production System (CLIPS) expert systems and procedural C++ language programs. The application area is a knowledge based, cooperative decision making model utilizing both rule based and procedural experts.

  9. Regulation of distribution network business

    SciTech Connect

    Roman, J.; Gomez, T.; Munoz, A.; Peco, J.

    1999-04-01

    The traditional distribution function actually comprises two separate activities: distribution network and retailing. Retailing, which is also termed supply, consists of trading electricity at the wholesale level and selling it to the end users. The distribution network business, or merely distribution, is a natural monopoly and it must be regulated. Increasing attention is presently being paid to the regulation of distribution pricing. Distribution pricing, comprises two major tasks: global remuneration of the distribution utility and tariff setting by allocation of the total costs among all the users of the network services. In this paper, the basic concepts for establishing the global remuneration of a distribution utility are presented. A remuneration scheme which recognizes adequate investment and operation costs, promotes losses reduction and incentivates the control of the quality of service level is proposed. Efficient investment and operation costs are calculated by using different types of strategic planning and regression analysis models. Application examples that have been used during the distribution regulation process in Spain are also presented.

  10. Generalizing distributed sensing networks

    SciTech Connect

    Kuespert, J.; Kutscher, D.

    1996-11-01

    Recent research in airborne oil spill remote sensing [FBFG94] leads towards modular systems that consist of several distinct sensors to combine the capabilities of the different sensor classes. The Medusa project [GHW96] is an example of a distributed system. It exhibits a distributed architecture to provide a maximum of flexibility, concurrency and safety and must clearly be rated as a classical distributed application from a computer science point of view. This article describes the {open_quotes}sensor description system{close_quotes} (SDS). SDS allows the developer of sensing systems to minimize the effort of integrating his particular subsystem into an existing application. By applying formal methods to the integration process a developer is able to describe the abstract properties of his sensing system like parameter values, generated data format, applicable methods on the data etc. and can thus rely on the SDS tools to produce the required software backends automatically: A graphical user interface for parameter control, an online visualization, data transfer facilities to a database and finally the evaluation and interpretation facility. Ibis technique puts future sensing enterprises in a position where different classes of sensors can easily be combined almost off-the-shelf to build powerful systems in very short turnaround times. 10 refs., 7 figs.

  11. Distributed downhole drilling network

    DOEpatents

    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.

  12. Distributed simulation of network protocols

    NASA Technical Reports Server (NTRS)

    Paterra, Frank; Overstreet, C. Michael; Maly, Kurt J.

    1990-01-01

    Simulations of high speed network protocols are very CPU intensive operations requiring very long run times. Very high speed network protocols (Gigabit/sec rates) require longer simulation runs in order to reach a steady state, while at the same time requiring additional CPU processing for each unit of time because of the data rates for the traffic being simulated. As protocol development proceeds and simulations provide insights into any problems associated with the protocol, the simulation model often must be changed to generate additional or finer statistical performance information. Iterating on this process is very time consuming due to the required run times for the simulation models. The results of the efforts to distribute a high speed ring network protocol, Carrier Sensed Multiple Access/Ring Network (CSMA/RN), are presented.

  13. Spatially Distributed Social Complex Networks

    NASA Astrophysics Data System (ADS)

    Frasco, Gerald F.; Sun, Jie; Rozenfeld, Hernán D.; ben-Avraham, Daniel

    2014-01-01

    We propose a bare-bones stochastic model that takes into account both the geographical distribution of people within a country and their complex network of connections. The model, which is designed to give rise to a scale-free network of social connections and to visually resemble the geographical spread seen in satellite pictures of the Earth at night, gives rise to a power-law distribution for the ranking of cities by population size (but for the largest cities) and reflects the notion that highly connected individuals tend to live in highly populated areas. It also yields some interesting insights regarding Gibrat's law for the rates of city growth (by population size), in partial support of the findings in a recent analysis of real data [Rozenfeld et al., Proc. Natl. Acad. Sci. U.S.A. 105, 18702 (2008).]. The model produces a nontrivial relation between city population and city population density and a superlinear relationship between social connectivity and city population, both of which seem quite in line with real data.

  14. Optimal distributions for multiplex logistic networks.

    PubMed

    Solá Conde, Luis E; Used, Javier; Romance, Miguel

    2016-06-01

    This paper presents some mathematical models for distribution of goods in logistic networks based on spectral analysis of complex networks. Given a steady distribution of a finished product, some numerical algorithms are presented for computing the weights in a multiplex logistic network that reach the equilibrium dynamics with high convergence rate. As an application, the logistic networks of Germany and Spain are analyzed in terms of their convergence rates.

  15. Correct degree distribution of apollonian networks

    NASA Astrophysics Data System (ADS)

    Guo, Jin-Li; Wang, Li-Na

    2010-08-01

    In this paper, we point out that there is a shortcoming of the degree distribution and the analyzing approach of the Apollonian network in [Andrade J S, Herrmann H J, Andrade R F S, et al. Phys. Rev. Lett. 94, 018702 (2005).]. Because the Apollonian network is a deterministic network, its degree distribution can be directly calculated. We correct the degree distribution of the Apollonian network. We also give a numerical simulation of network evolution. The analytical result agrees with the simulation well. The results show that there is the shortcoming of the results of Herrmann et al.

  16. Evaluation of Distribution Network Customer Outage Costs

    NASA Astrophysics Data System (ADS)

    Zemīte, Laila; Gerhards, Jānis

    2009-01-01

    Customer outage cost criteria are considered, collected and analyzed outage costs in Latvia distribution network, as well as distribution network outage elimination structure, the most common outage causes, are proposed outage costs estimation model. Finally the discussion of results of expected customer outage costs and interrupted energy assessment rate calculation results in Latvia distribution network in 2007 are presented, based on customers' mean value of incomes, outcomes and profitability.

  17. Distance distribution in configuration-model networks

    NASA Astrophysics Data System (ADS)

    Nitzan, Mor; Katzav, Eytan; Kühn, Reimer; Biham, Ofer

    2016-06-01

    We present analytical results for the distribution of shortest path lengths between random pairs of nodes in configuration model networks. The results, which are based on recursion equations, are shown to be in good agreement with numerical simulations for networks with degenerate, binomial, and power-law degree distributions. The mean, mode, and variance of the distribution of shortest path lengths are also evaluated. These results provide expressions for central measures and dispersion measures of the distribution of shortest path lengths in terms of moments of the degree distribution, illuminating the connection between the two distributions.

  18. Can distributed delays perfectly stabilize dynamical networks?

    NASA Astrophysics Data System (ADS)

    Omi, Takahiro; Shinomoto, Shigeru

    2008-04-01

    Signal transmission delays tend to destabilize dynamical networks leading to oscillation, but their dispersion contributes oppositely toward stabilization. We analyze an integrodifferential equation that describes the collective dynamics of a neural network with distributed signal delays. With the Γ distributed delays less dispersed than exponential distribution, the system exhibits reentrant phenomena, in which the stability is once lost but then recovered as the mean delay is increased. With delays dispersed more highly than exponential, the system never destabilizes.

  19. Minimum loss reconfiguration of unbalanced distribution networks

    SciTech Connect

    Borozan, V.; Rajicic, D.; Ackovski, R.

    1997-01-01

    A heuristic method for determining the configuration with minimum resistive line losses for three-phase unbalanced distribution networks is described. This method is based on previous papers dealing with balanced network. Using a fast and reliable load flow solution technique and also, efficient algorithms for network elements inspection, so that methodology becomes capable to solve the challenging problem while still maintaining a high execution speed. A developed algorithm is applied on a practical distribution network. Performed analysis highlight the influence of load imbalances on a solution of minimum loss reconfiguration problem.

  20. Distributed intelligence in an astronomical Distributed Sensor Network

    NASA Astrophysics Data System (ADS)

    White, R. R.; Davis, H.; Vestrand, W. T.; Wozniak, P. R.

    2008-03-01

    The Telescope Alert Operations Network System (TALONS) was designed and developed in the year 2000, around the architectural principles of a distributed sensor network. This network supported the original Rapid Telescopes for Optical Response (RAPTOR) project goals; however, only with further development could TALONS meet the goals of the larger Thinking Telescope Project. The complex objectives of the Thinking Telescope project required a paradigm shift in the software architecture - the centralised intelligence merged into the TALONS network operations could no longer meet all of the new requirements. The intelligence needed to be divorced from the network operations and developed as a series of peripheral intelligent agents, distributing the decision making and analytical processes based on the temporal volatility of the data. This paper is presented as only one part of the poster from the workshop and in it we will explore the details of this architecture and how that merges with the current Thinking Telescope system to meet our project goals.

  1. Distribution of Information in Ad Hoc Networks

    DTIC Science & Technology

    2007-09-01

    INTENTIONALLY LEFT BLANK v ABSTRACT Ad-hoc networks are distributed, self-organized networks which do not need a fixed infrastructure. Entities in...73 V . CONCLUSIONS AND FUTURE WORK ............................75 A. OVERVIEW ..........................................75 B. CONCLUSIONS...statistical analysis on the results. Finally, Chapter V concludes the research and provides suggestions for further research. 7 II. BACKGROUND A

  2. Distributed Beamforming in a Swarm UAV Network

    DTIC Science & Technology

    2008-03-01

    opportunistic random arrays with the concept of swarm UAVs. A considerable amount of research has already been done about the feasibility and advantages of...a widely dispersed wirelessly networked opportunistic array may anticipate many advantages over single platform-borne opportunistic arrays. Major...distribution is unlimited DISTRIBUTED BEAMFORMING IN A SWARM UAV NETWORK İbrahim KOCAMAN 1st Lieutenant, Turkish Air Force B.S., Turkish Air Force

  3. Next Generation Distributed Sensor Networks

    DTIC Science & Technology

    2004-09-01

    the exciting information processing problems that are being solved to effectively harvest the benefits of current and emerging nano , micro ...A number of nano and micro sensors are being introduced each month ranging from biological sensors to complex RF and optical sensors. The mass...sensor networks as one of the top ten emerging technologies. The July 2003 issue of the IEEE Proceeding is devoted to micro and nano sensors

  4. Evolving complex networks with conserved clique distributions.

    PubMed

    Kaczor, Gregor; Gros, Claudius

    2008-07-01

    We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We evaluate the statistical properties of the graphs generated, such as the degree distribution and network diameters, and compare them to some real-world graphs.

  5. Distributing Executive Information Systems through Networks.

    ERIC Educational Resources Information Center

    Penrod, James I.; And Others

    1993-01-01

    Many colleges and universities will soon adopt distributed systems for executive information and decision support. Distribution of shared information through computer networks will improve decision-making processes dramatically on campuses. Critical success factors include administrative support, favorable organizational climate, ease of use,…

  6. Distributed multiple path routing in complex networks

    NASA Astrophysics Data System (ADS)

    Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui

    2016-12-01

    Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.

  7. Distributed intelligent control and status networking

    NASA Technical Reports Server (NTRS)

    Fortin, Andre; Patel, Manoj

    1993-01-01

    Over the past two years, the Network Control Systems Branch (Code 532) has been investigating control and status networking technologies. These emerging technologies use distributed processing over a network to accomplish a particular custom task. These networks consist of small intelligent 'nodes' that perform simple tasks. Containing simple, inexpensive hardware and software, these nodes can be easily developed and maintained. Once networked, the nodes can perform a complex operation without a central host. This type of system provides an alternative to more complex control and status systems which require a central computer. This paper will provide some background and discuss some applications of this technology. It will also demonstrate the suitability of one particular technology for the Space Network (SN) and discuss the prototyping activities of Code 532 utilizing this technology.

  8. Benford’s Distribution in Complex Networks

    NASA Astrophysics Data System (ADS)

    Morzy, Mikołaj; Kajdanowicz, Tomasz; Szymański, Bolesław K.

    2016-10-01

    Many collections of numbers do not have a uniform distribution of the leading digit, but conform to a very particular pattern known as Benford’s distribution. This distribution has been found in numerous areas such as accounting data, voting registers, census data, and even in natural phenomena. Recently it has been reported that Benford’s law applies to online social networks. Here we introduce a set of rigorous tests for adherence to Benford’s law and apply it to verification of this claim, extending the scope of the experiment to various complex networks and to artificial networks created by several popular generative models. Our findings are that neither for real nor for artificial networks there is sufficient evidence for common conformity of network structural properties with Benford’s distribution. We find very weak evidence suggesting that three measures, degree centrality, betweenness centrality and local clustering coefficient, could adhere to Benford’s law for scalefree networks but only for very narrow range of their parameters.

  9. Robust entanglement distribution via quantum network coding

    NASA Astrophysics Data System (ADS)

    Epping, Michael; Kampermann, Hermann; Bruß, Dagmar

    2016-10-01

    Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, ‘consume’ entangled quantum states during their execution. When participants are located at distant sites, these resource states need to be distributed. Due to transmission losses quantum repeater become necessary for large distances (e.g. ≳ 300 {{km}}). Here we generalize the concept of the graph state repeater to D-dimensional graph states and to repeaters that can perform basic measurement-based quantum computations, which we call quantum routers. This processing of data at intermediate network nodes is called quantum network coding. We describe how a scheme to distribute general two-colourable graph states via quantum routers with network coding can be constructed from classical linear network codes. The robustness of the distribution of graph states against outages of network nodes is analysed by establishing a link to stabilizer error correction codes. Furthermore we show, that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.

  10. Benford’s Distribution in Complex Networks

    PubMed Central

    Morzy, Mikołaj; Kajdanowicz, Tomasz; Szymański, Bolesław K.

    2016-01-01

    Many collections of numbers do not have a uniform distribution of the leading digit, but conform to a very particular pattern known as Benford’s distribution. This distribution has been found in numerous areas such as accounting data, voting registers, census data, and even in natural phenomena. Recently it has been reported that Benford’s law applies to online social networks. Here we introduce a set of rigorous tests for adherence to Benford’s law and apply it to verification of this claim, extending the scope of the experiment to various complex networks and to artificial networks created by several popular generative models. Our findings are that neither for real nor for artificial networks there is sufficient evidence for common conformity of network structural properties with Benford’s distribution. We find very weak evidence suggesting that three measures, degree centrality, betweenness centrality and local clustering coefficient, could adhere to Benford’s law for scalefree networks but only for very narrow range of their parameters. PMID:27748398

  11. Force distributions in disordered fiber networks

    NASA Astrophysics Data System (ADS)

    Heidemann, Knut; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F.; Wardetzky, Max

    Disordered filamentous networks determine the mechanical response of many materials in nature. Due to the filamentous character of these networks, the strain field, and hence the force distributions, can be highly inhomogeneous. Large local stresses can result in an increased susceptibility for local rearrangements due to rupture or unbinding events. In our study, we introduce a quantitative measure to characterize the emergence of highly stressed one-dimensional paths, so-called force chains, in three-dimensional nonlinear fiber networks. Furthermore, we provide an analytical approach, based on graph theory, that quantitatively describes the force distributions in one-dimensional periodic spring networks. Our analytical results are in excellent agreement with our extensive numerical simulations.

  12. Tie strength distribution in scientific collaboration networks

    NASA Astrophysics Data System (ADS)

    Ke, Qing; Ahn, Yong-Yeol

    2014-09-01

    Science is increasingly dominated by teams. Understanding patterns of scientific collaboration and their impacts on the productivity and evolution of disciplines is crucial to understand scientific processes. Electronic bibliography offers a unique opportunity to map and investigate the nature of scientific collaboration. Recent studies have demonstrated a counterintuitive organizational pattern of scientific collaboration networks: densely interconnected local clusters consist of weak ties, whereas strong ties play the role of connecting different clusters. This pattern contrasts itself from many other types of networks where strong ties form communities while weak ties connect different communities. Although there are many models for collaboration networks, no model reproduces this pattern. In this paper, we present an evolution model of collaboration networks, which reproduces many properties of real-world collaboration networks, including the organization of tie strengths, skewed degree and weight distribution, high clustering, and assortative mixing.

  13. Resilient Core Networks for Energy Distribution

    SciTech Connect

    Kuntze, Nicolai; Rudolph, Carsten; Leivesley, Sally; Manz, David O.; Endicott-Popovsky, Barbara E.

    2014-07-28

    Abstract—Substations and their control are crucial for the availability of electricity in today’s energy distribution. Ad- vanced energy grids with Distributed Energy Resources require higher complexity in substations, distributed functionality and communication between devices inside substations and between substations. Also, substations include more and more intelligent devices and ICT based systems. All these devices are connected to other systems by different types of communication links or are situated in uncontrolled environments. Therefore, the risk of ICT based attacks on energy grids is growing. Consequently, security measures to counter these risks need to be an intrinsic part of energy grids. This paper introduces the concept of a Resilient Core Network to interconnected substations. This core network provides essen- tial security features, enables fast detection of attacks and allows for a distributed and autonomous mitigation of ICT based risks.

  14. Distributed control network for optogenetic experiments

    NASA Astrophysics Data System (ADS)

    Kasprowicz, G.; Juszczyk, B.; Mankiewicz, L.

    2014-11-01

    Nowadays optogenetic experiments are constructed to examine social behavioural relations in groups of animals. A novel concept of implantable device with distributed control network and advanced positioning capabilities is proposed. It is based on wireless energy transfer technology, micro-power radio interface and advanced signal processing.

  15. Optimal design of spatial distribution networks

    NASA Astrophysics Data System (ADS)

    Gastner, Michael T.; Newman, M. E. J.

    2006-07-01

    We consider the problem of constructing facilities such as hospitals, airports, or malls in a country with a nonuniform population density, such that the average distance from a person’s home to the nearest facility is minimized. We review some previous approximate treatments of this problem that indicate that the optimal distribution of facilities should have a density that increases with population density, but does so slower than linearly, as the two-thirds power. We confirm this result numerically for the particular case of the United States with recent population data using two independent methods, one a straightforward regression analysis, the other based on density-dependent map projections. We also consider strategies for linking the facilities to form a spatial network, such as a network of flights between airports, so that the combined cost of maintenance of and travel on the network is minimized. We show specific examples of such optimal networks for the case of the United States.

  16. Pruning Neural Networks with Distribution Estimation Algorithms

    SciTech Connect

    Cantu-Paz, E

    2003-01-15

    This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algorithm (GA), the paper considers three distribution estimation algorithms (DEAs): a compact GA, an extended compact GA, and the Bayesian Optimization Algorithm. The objective is to determine if the DEAs present advantages over the simple GA in terms of accuracy or speed in this problem. The experiments used a feed forward neural network trained with standard back propagation and public-domain and artificial data sets. The pruned networks seemed to have better or equal accuracy than the original fully-connected networks. Only in a few cases, pruning resulted in less accurate networks. We found few differences in the accuracy of the networks pruned by the four EAs, but found important differences in the execution time. The results suggest that a simple GA with a small population might be the best algorithm for pruning networks on the data sets we tested.

  17. Distributed multisensor fusion with network connection management

    NASA Astrophysics Data System (ADS)

    Kadar, Ivan

    2005-05-01

    The author in previous publications illustrated the need for better understanding the role of Connection Management (CNM) in spatially and geographically diverse distributed sensor networks. This construct is re-examined in a conceptual CNM architectural framework. The purpose of Connection Management is to provide seamless demand-based resource-allocation and sharing of the information products. For optimum distributed information fusion performance, these systems must minimize communications delays and maximize message throughput, reduce or eliminate out-of-sequence measurements, take into account data pedigree and at the same time optimally allocate bandwidth resources and/or encode track data (sources of information) for optimum distributed estimation of target state. In order to achieve overall distributed "network" effectiveness, these systems must be adaptive, and be able distribute data on demand basis in real-time. While the requirements for these systems are known, research in this area has been fragmented. Related problems, goals and potential solutions are explored highlighting the need for a multi-disciplinary approach among communications, estimation, information and queuing theory, networking, optimization and fusion communities. A CNM conceptual architecture and simulation results are illustrated for optimum demand-based bandwidth allocation.

  18. Hierarchical distributed stabilization of power networks

    NASA Astrophysics Data System (ADS)

    Ishizaki, Takayuki; Sadamoto, Tomonori; Imura, Jun-ichi

    2014-10-01

    Large fluctuation of electric power due to high penetration of renewable energy sources such as photovoltaic and wind power generation increases the risk to make the whole power network system unstable. The conventional frequency control called load frequency control is based on PID (proportional-integral-derivative) control or more advanced centralized and decentralized/distributed control. If we could more effectively use information on the state of the other neighbor generators, we can expect to make the whole system more robust against the large frequency fluctuation. This paper proposes a fundamental framework towards the design of hierarchical distributed stabilizing controllers for a network of power generators and loads. This novel type of distributed controller, composed of a global controller and a set of local controllers, takes into account the effect of the interaction among the generators and loads to improve robustness for the variation of locally stabilizing controllers.

  19. Distribution network reconfiguration for energy loss reduction

    SciTech Connect

    Taleski, R.; Rajicic, D.

    1997-02-01

    A new method for energy loss reduction for distribution networks is presented. It is based on known techniques and algorithms for radial network analysis--oriented element ordering, power summation method for power flow, statistical representation of load variations, and a recently developed energy summation method for computation of energy losses. These methods, combined with the heuristic rules developed to lead the iterative process, make the energy loss minimization method effective, robust and fast. It presents an alternative to the power minimization methods for operation and planning purposes.

  20. Reconfigurable real-time distributed processing network

    NASA Astrophysics Data System (ADS)

    Page, S. F.; Seely, R. D.; Hickman, D.

    2011-06-01

    This paper describes a novel real-time image and signal processing network, RONINTM, which facilitates the rapid design and deployment of systems providing advanced geospatial surveillance and situational awareness capability. RONINTM is a distributed software architecture consisting of multiple agents or nodes, which can be configured to implement a variety of state-of-the-art computer vision and signal processing algorithms. The nodes operate in an asynchronous fashion and can run on a variety of hardware platforms, thus providing a great deal of scalability and flexibility. Complex algorithmic configuration chains can be assembled using an intuitive graphical interface in a plug-and- play manner. RONINTM has been successfully exploited for a number of applications, ranging from remote event detection to complex multiple-camera real-time 3D object reconstruction. This paper describes the motivation behind the creation of the network, the core design features, and presents details of an example application. Finally, the on-going development of the network is discussed, which is focussed on dynamic network reconfiguration. This allows to the network to automatically adapt itself to node or communications failure by intelligently re-routing network communications and through adaptive resource management.

  1. Self-organizing distributed sensor networks

    NASA Astrophysics Data System (ADS)

    Clare, Loren P.; Pottie, Gregory J.; Agre, Jonathan R.

    1999-07-01

    Advances in CMOS IC and micro electrical-mechanical systems (MEMS) technologies are enabling construction of low-cost building blocks each of which incorporates sensing, signal processing, and wireless communications. Collections of these integrated microsensor nodes may be formed into sensor networks in a wide variety of ways, with characteristics that depend on the specific application--the total number of nodes, the spatial density, the geometric configuration (e.g., linear vs. areal), topographic aspects (e.g., smooth vs. rough terrain), and proximity and proportion of user/sink points. The power of these distributed sensor networks will be unleashed by means of their ability to self-organize, i.e., to bootstrap and dynamically maintain organizational structure befitting the purpose and situation that is presented, without the need for human assistance. A prototype sensor system and networking protocols are being developed under the DARPA/TTO AWAIRS Program and are described.

  2. Self Calibrated Wireless Distributed Environmental Sensory Networks

    PubMed Central

    Fishbain, Barak; Moreno-Centeno, Erick

    2016-01-01

    Recent advances in sensory and communication technologies have made Wireless Distributed Environmental Sensory Networks (WDESN) technically and economically feasible. WDESNs present an unprecedented tool for studying many environmental processes in a new way. However, the WDESNs’ calibration process is a major obstacle in them becoming the common practice. Here, we present a new, robust and efficient method for aggregating measurements acquired by an uncalibrated WDESN, and producing accurate estimates of the observed environmental variable’s true levels rendering the network as self-calibrated. The suggested method presents novelty both in group-decision-making and in environmental sensing as it offers a most valuable tool for distributed environmental monitoring data aggregation. Applying the method on an extensive real-life air-pollution dataset showed markedly more accurate results than the common practice and the state-of-the-art. PMID:27098279

  3. Structure Learning in Power Distribution Networks

    SciTech Connect

    Deka, Deepjyoti; Chertkov, Michael; Backhaus, Scott N.

    2015-01-13

    Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as these related to demand response, outage detection and management, and improved load-monitoring. Here, inspired by proliferation of the metering technology, we discuss statistical estimation problems in structurally loopy but operationally radial distribution grids consisting in learning operational layout of the network from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time – which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

  4. Self Calibrated Wireless Distributed Environmental Sensory Networks.

    PubMed

    Fishbain, Barak; Moreno-Centeno, Erick

    2016-04-21

    Recent advances in sensory and communication technologies have made Wireless Distributed Environmental Sensory Networks (WDESN) technically and economically feasible. WDESNs present an unprecedented tool for studying many environmental processes in a new way. However, the WDESNs' calibration process is a major obstacle in them becoming the common practice. Here, we present a new, robust and efficient method for aggregating measurements acquired by an uncalibrated WDESN, and producing accurate estimates of the observed environmental variable's true levels rendering the network as self-calibrated. The suggested method presents novelty both in group-decision-making and in environmental sensing as it offers a most valuable tool for distributed environmental monitoring data aggregation. Applying the method on an extensive real-life air-pollution dataset showed markedly more accurate results than the common practice and the state-of-the-art.

  5. Optimal loss reduction of distribution networks

    SciTech Connect

    Glamocanin, V. )

    1990-08-01

    A new algorithm for network reconfiguration of power distribution systems is presented. An optimal loss reduction is accomplished to maintain acceptable voltage at customer loads as well as to assure sufficient conductor and substation current capacity to handle load requirements. The success of the algorithm depends directly upon the straightforward and highly-efficient solution of quadratic cost transshipment problem. The new algorithm, described in this paper, completely eliminates the need for matrix operations and executes all operations directly on graph of the distribution system.

  6. Wealth distribution on complex networks with losses

    NASA Astrophysics Data System (ADS)

    Wang, Fei; Fang, Weiguo

    2015-07-01

    Wealth distribution plays an important role in the field of econophysics. In this paper, this issue is investigated based on the Bouchaud and Mézard (BM) wealth distribution model by the method of complex networks in this paper. Previous reports usually assumed that wealth increased steadily or was transferred from one agent to another. However, wealth may be lost due to some natural disasters or incidents. Therefore, we introduce terms representing losses in the BM model to describe the economic behavior more precisely. We find that an anti-degree preference helps to create an equitable economic environment. The Gini coefficient of the wealth distribution is calculated, and an optimized preferential parameter is obtained for both the case with losses and the case without losses. For variable values of the parameter, the corresponding results are obtained and discussed. If network topologies are considered, we find that a homogeneous network prompts an equitable economic environment. Simulations prove that losses enlarge the rich-poor gap.

  7. Distributed pattern detection in cyber networks

    NASA Astrophysics Data System (ADS)

    Paffenroth, Randy C.; Du Toit, Philip C.; Scharf, Louis L.; Jayasumana, Anura P.; Banadara, Vidarshana W.; Nong, Ryan

    2012-06-01

    In this paper we describe an approach for the detection and classication of weak, distributed patterns in sensor networks. Of course, before one can begin development of a pattern detection algorithm, one must rst dene the term "pattern", which by nature is a broad and inclusive term. One of the key aspects of our work is a denition of pattern that has already proven eective in detecting anomalies in real world data. While designing detection algorithms for all classes of patterns in all types of networks sounds appealing, this approach would almost certainly require heuristic methods and only cursory statements of performance. Rather, we have specically studied the problem of intrusion detection in computer networks in which a pattern is an abnormal or unexpected spatio-temporal dependence in the data collected across the nodes. We do not attempt to match an a priori template, but instead have developed algorithms that allow the pattern to reveal itself in the data by way of dependence or independence of observed time series. Although the problem is complex and challenging, recent advances in l1 techniques for robust matrix completion, compressed sensing, and correlation detection provide promising opportunities for progress. Our key contribution to this body of work is the development of methods that make an accounting of uncertainty in the measurements on which the inferences are based. The performance of our methods will be demonstrated on real world data, including measured data from the Abilene Internet2 network.

  8. Loss distribution of systemic defaults in different interbank networks

    NASA Astrophysics Data System (ADS)

    Li, Shouwei; He, Jianmin

    2016-04-01

    We analyze the impact of the network structure, the default probability and the loss given default (LGD) on the loss distribution of systemic defaults in the interbank market, where network structures analyzed include random networks, small-world networks and scale-free networks. We find that the network structure has little effect on the shape of the loss distribution, whereas the opposite is true to the default probability; the LGD changes the shape of the loss distribution significantly when default probabilities are high; the maximum of the possible loss is sensitive to the network structure and the LGD.

  9. Using Content Distribution Networks for Astronomy Outreach

    NASA Astrophysics Data System (ADS)

    Jäger, M.; Christiansen, L. L.; André, M.

    2015-09-01

    Thousands of people from all over the world search the internet on a daily basis for the newest discoveries in astronomy: be it in the form of press releases, high resolution images, videos or even planetarium fulldome content. The growing amount of data available, combined with the increasing number of media files and users distributed across the globe, leads to a significant decrease in speed for those users located furthest from the server delivering the content. One solution for bringing astronomical content to users faster is to use a content delivery network.

  10. Optimal design of distributed wastewater treatment networks

    SciTech Connect

    Galan, B.; Grossmann, I.E.

    1998-10-01

    This paper deals with the optimum design of a distributed wastewater network where multicomponent streams are considered that are to be processed by units for reducing the concentration of several contaminants. The proposed model gives rise to a nonconvex nonlinear problem which often exhibits local minima and causes convergence difficulties. A search procedure is proposed in this paper that is based on the successive solution of a relaxed linear model and the original nonconvex nonlinear problem. Several examples are presented to illustrate that the proposed method often yields global or near global optimum solutions. The model is also extended for selecting different treatment technologies and for handling membrane separation modules.

  11. Information Weighted Consensus for Distributed Estimation in Vision Networks

    ERIC Educational Resources Information Center

    Kamal, Ahmed Tashrif

    2013-01-01

    Due to their high fault-tolerance, ease of installation and scalability to large networks, distributed algorithms have recently gained immense popularity in the sensor networks community, especially in computer vision. Multi-target tracking in a camera network is one of the fundamental problems in this domain. Distributed estimation algorithms…

  12. When is an ecological network complex? Connectance drives degree distribution and emerging network properties

    PubMed Central

    Gravel, Dominique

    2014-01-01

    Connectance and degree distributions are important components of the structure of ecological networks. In this contribution, we use a statistical argument and simple network generating models to show that properties of the degree distribution are driven by network connectance. We discuss the consequences of this finding for (1) the generation of random networks in null-model analyses, and (2) the interpretation of network structure and ecosystem properties in relationship with degree distribution. PMID:24688835

  13. Advanced Energy Storage Management in Distribution Network

    SciTech Connect

    Liu, Guodong; Ceylan, Oguzhan; Xiao, Bailu; Starke, Michael R; Ollis, T Ben; King, Daniel J; Irminger, Philip; Tomsovic, Kevin

    2016-01-01

    With increasing penetration of distributed generation (DG) in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative mixed integer quadratic constrained quadratic programming model to optimize the operation of a three phase unbalanced distribution system with high penetration of Photovoltaic (PV) panels, DG and energy storage (ES) is developed. The proposed model minimizes not only the operating cost, including fuel cost and purchasing cost, but also voltage deviations and power loss. The optimization model is based on the linearized sensitivity coefficients between state variables (e.g., node voltages) and control variables (e.g., real and reactive power injections of DG and ES). To avoid slow convergence when close to the optimum, a golden search method is introduced to control the step size and accelerate the convergence. The proposed algorithm is demonstrated on modified IEEE 13 nodes test feeders with multiple PV panels, DG and ES. Numerical simulation results validate the proposed algorithm. Various scenarios of system configuration are studied and some critical findings are concluded.

  14. Social Networking Adapted for Distributed Scientific Collaboration

    NASA Technical Reports Server (NTRS)

    Karimabadi, Homa

    2012-01-01

    Share is a social networking site with novel, specially designed feature sets to enable simultaneous remote collaboration and sharing of large data sets among scientists. The site will include not only the standard features found on popular consumer-oriented social networking sites such as Facebook and Myspace, but also a number of powerful tools to extend its functionality to a science collaboration site. A Virtual Observatory is a promising technology for making data accessible from various missions and instruments through a Web browser. Sci-Share augments services provided by Virtual Observatories by enabling distributed collaboration and sharing of downloaded and/or processed data among scientists. This will, in turn, increase science returns from NASA missions. Sci-Share also enables better utilization of NASA s high-performance computing resources by providing an easy and central mechanism to access and share large files on users space or those saved on mass storage. The most common means of remote scientific collaboration today remains the trio of e-mail for electronic communication, FTP for file sharing, and personalized Web sites for dissemination of papers and research results. Each of these tools has well-known limitations. Sci-Share transforms the social networking paradigm into a scientific collaboration environment by offering powerful tools for cooperative discourse and digital content sharing. Sci-Share differentiates itself by serving as an online repository for users digital content with the following unique features: a) Sharing of any file type, any size, from anywhere; b) Creation of projects and groups for controlled sharing; c) Module for sharing files on HPC (High Performance Computing) sites; d) Universal accessibility of staged files as embedded links on other sites (e.g. Facebook) and tools (e.g. e-mail); e) Drag-and-drop transfer of large files, replacing awkward e-mail attachments (and file size limitations); f) Enterprise-level data and

  15. Power distribution in two-dimensional optical network channels

    NASA Astrophysics Data System (ADS)

    Wang, Dong-Xue; Karim, Mohammad A.

    1996-04-01

    The power distribution in two-dimensional optical network channels is analyzed. The maximum number of allowable channels as determined by the characteristics of optical detector is identified, in particular, for neural-network and wavelet-transform applications.

  16. Design framework for entanglement-distribution switching networks

    NASA Astrophysics Data System (ADS)

    Drost, Robert J.; Brodsky, Michael

    2016-09-01

    The distribution of quantum entanglement appears to be an important component of applications of quantum communications and networks. The ability to centralize the sourcing of entanglement in a quantum network can provide for improved efficiency and enable a variety of network structures. A necessary feature of an entanglement-sourcing network node comprising several sources of entangled photons is the ability to reconfigurably route the generated pairs of photons to network neighbors depending on the desired entanglement sharing of the network users at a given time. One approach to such routing is the use of a photonic switching network. The requirements for an entanglement distribution switching network are less restrictive than for typical conventional applications, leading to design freedom that can be leveraged to optimize additional criteria. In this paper, we present a mathematical framework defining the requirements of an entanglement-distribution switching network. We then consider the design of such a switching network using a number of 2 × 2 crossbar switches, addressing the interconnection of these switches and efficient routing algorithms. In particular, we define a worst-case loss metric and consider 6 × 6, 8 × 8, and 10 × 10 network designs that optimize both this metric and the number of crossbar switches composing the network. We pay particular attention to the 10 × 10 network, detailing novel results proving the optimality of the proposed design. These optimized network designs have great potential for use in practical quantum networks, thus advancing the concept of quantum networks toward reality.

  17. A Complex Network Approach to Distributional Semantic Models.

    PubMed

    Utsumi, Akira

    2015-01-01

    A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models.

  18. Assessment of distributed arterial network models.

    PubMed

    Segers, P; Stergiopulos, N; Verdonck, P; Verhoeven, R

    1997-11-01

    The aim of this study is to evaluate the relative importance of elastic non-linearities, viscoelasticity and resistance vessel modelling on arterial pressure and flow wave contours computed with distributed arterial network models. The computational results of a non-linear (time-domain) and a linear (frequency-domain) mode were compared using the same geometrical configuration and identical upstream and downstream boundary conditions and mechanical properties. pressures were computed at the ascending aorta, brachial and femoral artery. In spite of the identical problem definition, computational differences were found in input impedance modulus (max. 15-20%), systolic pressure (max. 5%) and pulse pressure (max. 10%). For the brachial artery, the ratio of pulse pressure to aortic pulse pressure was practically identical for both models (3%), whereas for the femoral artery higher values are found for the linear model (+10%). The aortic/brachial pressure transfer function indicates that pressure harmonic amplification is somewhat higher in the linear model for frequencies lower than 6 Hz while the opposite is true for higher frequencies. These computational disparities were attributed to conceptual model differences, such as the treatment of geometric tapering, rather than to elastic or convective non-linearities. Compared to the effect of viscoelasticity, the discrepancy between the linear and non-linear model is of the same importance. At peripheral locations, the correct representation of terminal impedance outweight the computational differences between the linear and non-linear models.

  19. Empirical study on clique-degree distribution of networks.

    PubMed

    Xiao, Wei-Ke; Ren, Jie; Qi, Feng; Song, Zhi-Wei; Zhu, Meng-Xiao; Yang, Hong-Feng; Jin, Hui-Yu; Wang, Bing-Hong; Zhou, Tao

    2007-09-01

    The community structure and motif-modular-network hierarchy are of great importance for understanding the relationship between structures and functions. We investigate the distribution of clique degrees, which are an extension of degree and can be used to measure the density of cliques in networks. Empirical studies indicate the extensive existence of power-law clique-degree distributions in various real networks, and the power-law exponent decreases with an increase of clique size.

  20. Algebraic Approach for Recovering Topology in Distributed Camera Networks

    DTIC Science & Technology

    2009-01-14

    Algebraic Approach for Recovering Topology in Distributed Camera Networks Edgar J. Lobaton Parvez Ahammad S. Shankar Sastry Electrical Engineering...Topology in Distributed Camera Networks Edgar J. Lobaton , Parvez Ahammad, S. Shankar Sastry ∗† January 14, 2009 Abstract Camera networks are widely used...well as a real-world experimental set-up. Our proposed approach ∗E.J. Lobaton and S.S. Sastry are with the Electrical Engineering and Computer

  1. Network Capacity Assessment of CHP-based Distributed Generation on Urban Energy Distribution Networks

    NASA Astrophysics Data System (ADS)

    Zhang, Xianjun

    The combined heat and power (CHP)-based distributed generation (DG) or dis-tributed energy resources (DERs) are mature options available in the present energy market, considered to be an effective solution to promote energy efficiency. In the urban environment, the electricity, water and natural gas distribution networks are becoming increasingly interconnected with the growing penetration of the CHP-based DG. Subsequently, this emerging interdependence leads to new topics meriting serious consideration: how much of the CHP-based DG can be accommodated and where to locate these DERs, and given preexisting constraints, how to quantify the mutual impacts on operation performances between these urban energy distribution networks and the CHP-based DG. The early research work was conducted to investigate the feasibility and design methods for one residential microgrid system based on existing electricity, water and gas infrastructures of a residential community, mainly focusing on the economic planning. However, this proposed design method cannot determine the optimal DG sizing and siting for a larger test bed with the given information of energy infrastructures. In this context, a more systematic as well as generalized approach should be developed to solve these problems. In the later study, the model architecture that integrates urban electricity, water and gas distribution networks, and the CHP-based DG system was developed. The proposed approach addressed the challenge of identifying the optimal sizing and siting of the CHP-based DG on these urban energy networks and the mutual impacts on operation performances were also quantified. For this study, the overall objective is to maximize the electrical output and recovered thermal output of the CHP-based DG units. The electricity, gas, and water system models were developed individually and coupled by the developed CHP-based DG system model. The resultant integrated system model is used to constrain the DG's electrical

  2. Distributed Computer Networks in Support of Complex Group Practices

    PubMed Central

    Wess, Bernard P.

    1978-01-01

    The economics of medical computer networks are presented in context with the patient care and administrative goals of medical networks. Design alternatives and network topologies are discussed with an emphasis on medical network design requirements in distributed data base design, telecommunications, satellite systems, and software engineering. The success of the medical computer networking technology is predicated on the ability of medical and data processing professionals to design comprehensive, efficient, and virtually impenetrable security systems to protect data bases, network access and services, and patient confidentiality.

  3. Sensor modules for wireless distributed sensor networks

    SciTech Connect

    Lee, A P; McConaghy, C F; Simon, J N; Benett, W; Jones, L; Trevino, J

    1999-02-22

    A national security need as well as environmental monitoring need exists for networks of sensors. The advantages of a network of sensors over a single sensor are improved range, sensitivity, directionality, and data readability. Depending upon the particular application, sensors can be acoustic, chemical, biological, thermal or inertial. A major desire in these sensor networks is to have the individual sensor and associated electronics small and low enough in power that the battery can also be small and of long life. Smaller, low power sensor nodes can allow more nodes per network. A typical network for security applications is depicted in Figure 1. Here a number of sensor nodes are deployed around a central hub node in a star configuration. In this scenario the hubs communicate with each other and ultimately relay information to a satellite. Future networks might follow this scenario or some other network architecture such as a hopping network where individual nodes communicate directly with each other. The focus of our research has been on development of the small low power nodes and less on the overall network topology. However, some consideration of the network must be given when designing the nodes and some consideration of the nodes must be given when designing the network. An individual sensor node contains not only the sensor but also the sensor interface electronics, analog to digital (A/D) converter, logic, RF communication link, antenna, and the battery. Future nodes will also contain some form of signal processing to allow more sophisticated network architectures. The FY98 goal for this project was to make a sensor node with a physical form factor of a 2 inch x 2 inch x 2 inch cube.

  4. Topological fractal networks introduced by mixed degree distribution

    NASA Astrophysics Data System (ADS)

    Zou, Liuhua; Pei, Wenjiang; Li, Tao; He, Zhenya; Cheung, Yiuming

    2007-07-01

    Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism and allow for uncovering universal origins of collective behaviors. However, highly clustered scale-free network, with power-law degree distribution, or small-world network models, with exponential degree distribution, are not self-similarity. We investigate networks growth mechanism of the branching-deactivated geographical attachment preference that learned from certain empirical evidence of social behaviors. It yields high clustering and spectrums of degree distribution ranging from algebraic to exponential, average shortest path length ranging from linear to logarithmic. We observe that the present networks fit well with small-world graphs and scale-free networks in both limit cases (exponential and algebraic degree distribution, respectively), obviously lacking self-similar property under a length-scale transformation. Interestingly, we find perfect topological fractal structure emerges by a mixture of both algebraic and exponential degree distributions in a wide range of parameter values. The results present a reliable connection among small-world graphs, scale-free networks and topological fractal networks, and promise a natural way to investigate universal origins of collective behaviors.

  5. A distributed topological camera network representation for tracking applications.

    PubMed

    Lobaton, Edgar; Vasudevan, Ramanarayan; Bajcsy, Ruzena; Sastry, Shankar

    2010-10-01

    Sensor networks have been widely used for surveillance, monitoring, and tracking. Camera networks, in particular, provide a large amount of information that has traditionally been processed in a centralized manner employing a priori knowledge of camera location and of the physical layout of the environment. Unfortunately, these conventional requirements are far too demanding for ad-hoc distributed networks. In this article, we present a simplicial representation of a camera network called the camera network complex ( CN-complex), that accurately captures topological information about the visual coverage of the network. This representation provides a coordinate-free calibration of the sensor network and demands no localization of the cameras or objects in the environment. A distributed, robust algorithm, validated via two experimental setups, is presented for the construction of the representation using only binary detection information. We demonstrate the utility of this representation in capturing holes in the coverage, performing tracking of agents, and identifying homotopic paths.

  6. Electricity distribution networks: Changing regulatory approaches

    NASA Astrophysics Data System (ADS)

    Cambini, Carlo

    2016-09-01

    Increasing the penetration of distributed generation and smart grid technologies requires substantial investments. A study proposes an innovative approach that combines four regulatory tools to provide economic incentives for distribution system operators to facilitate these innovative practices.

  7. Minimizing communication cost among distributed controllers in software defined networks

    NASA Astrophysics Data System (ADS)

    Arlimatti, Shivaleela; Elbreiki, Walid; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

    2016-08-01

    Software Defined Networking (SDN) is a new paradigm to increase the flexibility of today's network by promising for a programmable network. The fundamental idea behind this new architecture is to simplify network complexity by decoupling control plane and data plane of the network devices, and by making the control plane centralized. Recently controllers have distributed to solve the problem of single point of failure, and to increase scalability and flexibility during workload distribution. Even though, controllers are flexible and scalable to accommodate more number of network switches, yet the problem of intercommunication cost between distributed controllers is still challenging issue in the Software Defined Network environment. This paper, aims to fill the gap by proposing a new mechanism, which minimizes intercommunication cost with graph partitioning algorithm, an NP hard problem. The methodology proposed in this paper is, swapping of network elements between controller domains to minimize communication cost by calculating communication gain. The swapping of elements minimizes inter and intra communication cost among network domains. We validate our work with the OMNeT++ simulation environment tool. Simulation results show that the proposed mechanism minimizes the inter domain communication cost among controllers compared to traditional distributed controllers.

  8. Distributed sensor networks with collective computation

    SciTech Connect

    Lanman, D. R.

    2001-01-01

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

  9. Scalable Quantum Networks for Distributed Computing and Sensing

    DTIC Science & Technology

    2016-04-01

    AFRL-AFOSR-UK-TR-2016-0007 Scalable Quantum Networks for Distributed Computing and Sensing Ian Walmsley THE UNIVERSITY OF OXFORD Final Report 04/01...MM-YYYY) 12/07/2015 2. REPORT TYPE Final 3. DATES COVERED (From - To) 01-Sep-2012 to 31-Aug-2015 4. TITLE AND SUBTITLE Scalable Quantum Networks...SUPPLEMENTARY NOTES 14. ABSTRACT We identified two barriers to the implementation of large-scale photonic quantum networks. First, as scalability requires

  10. Degree distributions of bipartite networks and their projections

    NASA Astrophysics Data System (ADS)

    Vasques Filho, Demival; O'Neale, Dion

    Bipartite networks play an important role in the analysis of social and economic systems as they explicitly show the conceptual links between different types of entities. As an example, it is possible to build networks to investigate interactions regarding scientific and technological innovation that are well represented by a natural bipartite structure. Since we are often most interested in only one of the node types (e.g. the authors in an author-publication network), it is common to end up working with a projected version of the underlying bipartite network. The topology of projections and the dynamics that take place on it are highly dependent on the probability distribution of nodes degrees. We use the formalism of generating functions to infer how the degree distributions of the original bipartite network affect the distribution in the projected version. Moreover, we create artificial bipartite graphs by arbitrarily choosing degree distributions for the sets of nodes and construct the projection to analyze the resulting probability distribution. Our findings show that when projecting onto a particular set of nodes, the resulting degree distribution follows the behavior of the probability distribution of such nodes, subject, however, to the tail of the opposite distribution.

  11. Memory Network For Distributed Data Processors

    NASA Technical Reports Server (NTRS)

    Bolen, David; Jensen, Dean; Millard, ED; Robinson, Dave; Scanlon, George

    1992-01-01

    Universal Memory Network (UMN) is modular, digital data-communication system enabling computers with differing bus architectures to share 32-bit-wide data between locations up to 3 km apart with less than one millisecond of latency. Makes it possible to design sophisticated real-time and near-real-time data-processing systems without data-transfer "bottlenecks". This enterprise network permits transmission of volume of data equivalent to an encyclopedia each second. Facilities benefiting from Universal Memory Network include telemetry stations, simulation facilities, power-plants, and large laboratories or any facility sharing very large volumes of data. Main hub of UMN is reflection center including smaller hubs called Shared Memory Interfaces.

  12. The application of fuzzy neural network in distribution center location

    NASA Astrophysics Data System (ADS)

    Li, Yongpan; Liu, Yong

    2013-03-01

    In this paper, the establishment of the fuzzy neural network model for logistics distribution center location applied the fuzzy method to the input value of BP algorithm and took the experts' evaluation value as the expected output. At the same time, using the network learning to get the optimized selection and furthermore get a more accurate evaluation to the programs of location.

  13. Flow distributions and spatial correlations in human brain capillary networks

    NASA Astrophysics Data System (ADS)

    Lorthois, Sylvie; Peyrounette, Myriam; Larue, Anne; Le Borgne, Tanguy

    2015-11-01

    The vascular system of the human brain cortex is composed of a space filling mesh-like capillary network connected upstream and downstream to branched quasi-fractal arterioles and venules. The distribution of blood flow rates in these networks may affect the efficiency of oxygen transfer processes. Here, we investigate the distribution and correlation properties of blood flow velocities from numerical simulations in large 3D human intra-cortical vascular network (10000 segments) obtained from an anatomical database. In each segment, flow is solved from a 1D non-linear model taking account of the complex rheological properties of blood flow in microcirculation to deduce blood pressure, blood flow and red blood cell volume fraction distributions throughout the network. The network structural complexity is found to impart broad and spatially correlated Lagrangian velocity distributions, leading to power law transit time distributions. The origins of this behavior (existence of velocity correlations in capillary networks, influence of the coupling with the feeding arterioles and draining veins, topological disorder, complex blood rheology) are studied by comparison with results obtained in various model capillary networks of controlled disorder. ERC BrainMicroFlow GA615102, ERC ReactiveFronts GA648377.

  14. Optimization of an interactive distributive computer network

    NASA Technical Reports Server (NTRS)

    Frederick, V.

    1985-01-01

    The activities under a cooperative agreement for the development of a computer network are briefly summarized. Research activities covered are: computer operating systems optimization and integration; software development and implementation of the IRIS (Infrared Imaging of Shuttle) Experiment; and software design, development, and implementation of the APS (Aerosol Particle System) Experiment.

  15. Network Computing for Distributed Underwater Acoustic Sensors

    DTIC Science & Technology

    2014-03-31

    a model for the OPNET environment by Llor et al. [17, 18]. 2.2 Main results We have developed a solution leveraging the simulation work of Borowski...networks with OPNET , In Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, SIMUTools ’11, pp. 19–26, ICST, Brussels

  16. Collaborative Estimation in Distributed Sensor Networks

    ERIC Educational Resources Information Center

    Kar, Swarnendu

    2013-01-01

    Networks of smart ultra-portable devices are already indispensable in our lives, augmenting our senses and connecting our lives through real time processing and communication of sensory (e.g., audio, video, location) inputs. Though usually hidden from the user's sight, the engineering of these devices involves fierce tradeoffs between energy…

  17. Optical Intrabuilding and Interbuilding Distribution Networks.

    ERIC Educational Resources Information Center

    Hull, Joseph A.

    Fiber optics communication technology is a potential competitive alternative to coaxial cable and shielded twisted pairlines as a wide-band communications medium. Pilot demonstrations by public institutions such as the health care delivery system can test the application of this new technology. Fiber optic networks may have the potential to be…

  18. Load Distribution in Congested Scale-Free Networks

    NASA Astrophysics Data System (ADS)

    Zheng, Jian-Feng; Gao, Zi-You; Fu, Bai-Bai

    In this work, we study the effects of scale-free topology and congestion on load distribution. Congestion effect can be described by link cost functions, which map link flows into travel times. Two different kinds of link's practical capacity (it is similar to link's capacity for transport) which is a parameter in link cost functions, i.e., uniform case and nonuniform case, are investigated. After introducing the effect of congestion, load distribution is typically discussed in Barábasi-Albert and Goh scale-free networks. In the uniform case, for Barábasi-Albert scale-free networks, we recover a power-law behavior for load distribution with a larger exponent, as compared with the distribution of betweenness centrality; for Goh scale-free networks, we also recover a power-law behavior and its exponent approaches to the exponent of degree distribution. While in the nonuniform case, the power-law behavior for load distribution may not always be conserved in both Barábasi-Albert and Goh scale-free networks. That is to say, different kinds of load distributions are obtained under different conditions. It may shed some light to study traffic dynamics on scale-free networks.

  19. Improved method for loss minimization in distribution networks

    SciTech Connect

    Borozan, V.; Rajicic, D.; Ackovski, R.

    1995-08-01

    A heuristic method for determining the distribution network configuration with minimum resistive line losses is described. This method is based on optimality condition developed by Merlin and Back. Using a fast and reliable load flow solution technique and introducing efficient algorithms for network elements inspection, that methodology becomes suitable for a real-time application. The proposed method is tested on a three test-systems, used in literature for the same purposes. Its efficiency advantages are especially emphasized in its application on distribution networks of realistic size.

  20. Directed networks' different link formation mechanisms causing degree distribution distinction

    NASA Astrophysics Data System (ADS)

    Behfar, Stefan Kambiz; Turkina, Ekaterina; Cohendet, Patrick; Burger-Helmchen, Thierry

    2016-11-01

    Within undirected networks, scientists have shown much interest in presenting power-law features. For instance, Barabási and Albert (1999) claimed that a common property of many large networks is that vertex connectivity follows scale-free power-law distribution, and in another study Barabási et al. (2002) showed power law evolution in the social network of scientific collaboration. At the same time, Jiang et al. (2011) discussed deviation from power-law distribution; others indicated that size effect (Bagrow et al., 2008), information filtering mechanism (Mossa et al., 2002), and birth and death process (Shi et al., 2005) could account for this deviation. Within directed networks, many authors have considered that outlinks follow a similar mechanism of creation as inlinks' (Faloutsos et al., 1999; Krapivsky et al., 2001; Tanimoto, 2009) with link creation rate being the linear function of node degree, resulting in a power-law shape for both indegree and outdegree distribution. Some other authors have made an assumption that directed networks, such as scientific collaboration or citation, behave as undirected, resulting in a power-law degree distribution accordingly (Barabási et al., 2002). At the same time, we claim (1) Outlinks feature different degree distributions than inlinks; where different link formation mechanisms cause the distribution distinctions, (2) in/outdegree distribution distinction holds for different levels of system decomposition; therefore this distribution distinction is a property of directed networks. First, we emphasize in/outlink formation mechanisms as causal factors for distinction between indegree and outdegree distributions (where this distinction has already been noticed in Barker et al. (2010) and Baxter et al. (2006)) within a sample network of OSS projects as well as Java software corpus as a network. Second, we analyze whether this distribution distinction holds for different levels of system decomposition: open

  1. Applicability of delay tolerant networking to distributed satellite systems

    NASA Astrophysics Data System (ADS)

    Freimann, A.; Tzschichholz, T.; Schmidt, M.; Kleinschrodt, A.; Schilling, K.

    2016-12-01

    Currently, a trend towards distributed small satellite missions is emerging using cooperating satellites to achieve joint mission objectives, e.g. for earth observation. Communication is a key feature when cooperation between satellites is desired. Typically those satellite networks are affected by slow data rates, high packet loss and intermittent connectivity. To address these challenges the store-and-forward approach of the delay tolerant networking (DTN) concept is investigated in this article. Network simulations of typical scenarios were carried out and evaluated to derive statements about the applicability of the DTN approach to networks in low earth orbits.

  2. A distributed framework for inter-domain virtual network embedding

    NASA Astrophysics Data System (ADS)

    Wang, Zihua; Han, Yanni; Lin, Tao; Tang, Hui

    2013-03-01

    Network virtualization has been a promising technology for overcoming the Internet impasse. A main challenge in network virtualization is the efficient assignment of virtual resources. Existing work focused on intra-domain solutions whereas inter-domain situation is more practical in realistic setting. In this paper, we present a distributed inter-domain framework for mapping virtual networks to physical networks which can ameliorate the performance of the virtual network embedding. The distributed framework is based on a Multi-agent approach. A set of messages for information exchange is defined. We design different operations and IPTV use scenarios to validate the advantages of our framework. Use cases shows that our framework can solve the inter-domain problem efficiently.

  3. Distributed Coordination for Optimal Energy Generation and Distribution in Cyber-Physical Energy Networks.

    PubMed

    Ahn, Hyo-Sung; Kim, Byeong-Yeon; Lim, Young-Hun; Lee, Byung-Hun; Oh, Kwang-Kyo

    2017-02-23

    This paper proposes three coordination laws for optimal energy generation and distribution in energy network, which is composed of physical flow layer and cyber communication layer. The physical energy flows through the physical layer; but all the energies are coordinated to generate and flow by distributed coordination algorithms on the basis of communication information. First, distributed energy generation and energy distribution laws are proposed in a decoupled manner without considering the interactive characteristics between the energy generation and energy distribution. Second, a joint coordination law to treat the energy generation and energy distribution in a coupled manner taking account of the interactive characteristics is designed. Third, to handle over- or less-energy generation cases, an energy distribution law for networks with batteries is designed. The coordination laws proposed in this paper are fully distributed in the sense that they are decided optimally only using relative information among neighboring nodes. Through numerical simulations, the validity of the proposed distributed coordination laws is illustrated.

  4. Vibro-acoustic control with a distributed sensor network.

    PubMed

    Frampton, Kenneth D

    2006-04-01

    The purpose of this work is to demonstrate the ability of a distributed control system, based on a smart sensor network, to reduce acoustic radiation from a vibrating structure. The platform from which control is effected consists of a network of smart sensors, each referred to as a node. Each node possesses its own computational capability, sensor, actuator and the ability to communicate with other nodes via a wired or wireless network. The primary focus of this work is to employ existing group management middleware concepts to enable vibro-acoustic control with such a distributed network. Group management middleware is distributed software that provides for the establishment and maintenance of groups of distributed nodes and that provides for the network communication among such groups. The control objective is met by designing distributed feedback compensators that take advantage of node groups in order to effect their control. The node groups are formed based on physical proximity. The global control objective is to minimize the radiated sound power from a rectangular plate. Results of this investigation demonstrate that such a distributed control system can achieve attenuations comparable to those achieved by a centralized controller.

  5. Department Networks and Distributed Leadership in Schools

    ERIC Educational Resources Information Center

    de Lima, Jorge Avila

    2008-01-01

    Many schools are organised into departments which function as contexts that frame teachers' professional experiences in important ways. Some educational systems have adopted distributed forms of leadership within schools that rely strongly on the departmental structure and on the role of the department coordinator as teacher leader. This paper…

  6. LaRC local area networks to support distributed computing

    NASA Technical Reports Server (NTRS)

    Riddle, E. P.

    1984-01-01

    The Langley Research Center's (LaRC) Local Area Network (LAN) effort is discussed. LaRC initiated the development of a LAN to support a growing distributed computing environment at the Center. The purpose of the network is to provide an improved capability (over inteactive and RJE terminal access) for sharing multivendor computer resources. Specifically, the network will provide a data highway for the transfer of files between mainframe computers, minicomputers, work stations, and personal computers. An important influence on the overall network design was the vital need of LaRC researchers to efficiently utilize the large CDC mainframe computers in the central scientific computing facility. Although there was a steady migration from a centralized to a distributed computing environment at LaRC in recent years, the work load on the central resources increased. Major emphasis in the network design was on communication with the central resources within the distributed environment. The network to be implemented will allow researchers to utilize the central resources, distributed minicomputers, work stations, and personal computers to obtain the proper level of computing power to efficiently perform their jobs.

  7. Discriminating topology in galaxy distributions using network analysis

    NASA Astrophysics Data System (ADS)

    Hong, Sungryong; Coutinho, Bruno C.; Dey, Arjun; Barabási, Albert-L.; Vogelsberger, Mark; Hernquist, Lars; Gebhardt, Karl

    2016-07-01

    The large-scale distribution of galaxies is generally analysed using the two-point correlation function. However, this statistic does not capture the topology of the distribution, and it is necessary to resort to higher order correlations to break degeneracies. We demonstrate that an alternate approach using network analysis can discriminate between topologically different distributions that have similar two-point correlations. We investigate two galaxy point distributions, one produced by a cosmological simulation and the other by a Lévy walk. For the cosmological simulation, we adopt the redshift z = 0.58 slice from Illustris and select galaxies with stellar masses greater than 108 M⊙. The two-point correlation function of these simulated galaxies follows a single power law, ξ(r) ˜ r-1.5. Then, we generate Lévy walks matching the correlation function and abundance with the simulated galaxies. We find that, while the two simulated galaxy point distributions have the same abundance and two-point correlation function, their spatial distributions are very different; most prominently, filamentary structures, absent in Lévy fractals. To quantify these missing topologies, we adopt network analysis tools and measure diameter, giant component, and transitivity from networks built by a conventional friends-of-friends recipe with various linking lengths. Unlike the abundance and two-point correlation function, these network quantities reveal a clear separation between the two simulated distributions; therefore, the galaxy distribution simulated by Illustris is not a Lévy fractal quantitatively. We find that the described network quantities offer an efficient tool for discriminating topologies and for comparing observed and theoretical distributions.

  8. Distributed fault detection over sensor networks with Markovian switching topologies

    NASA Astrophysics Data System (ADS)

    Ge, Xiaohua; Han, Qing-Long

    2014-05-01

    This paper deals with the distributed fault detection for discrete-time Markov jump linear systems over sensor networks with Markovian switching topologies. The sensors are scatteredly deployed in the sensor field and the fault detectors are physically distributed via a communication network. The system dynamics changes and sensing topology variations are modeled by a discrete-time Markov chain with incomplete mode transition probabilities. Each of these sensor nodes firstly collects measurement outputs from its all underlying neighboring nodes, processes these data in accordance with the Markovian switching topologies, and then transmits the processed data to the remote fault detector node. Network-induced delays and accumulated data packet dropouts are incorporated in the data transmission between the sensor nodes and the distributed fault detector nodes through the communication network. To generate localized residual signals, mode-independent distributed fault detection filters are proposed. By means of the stochastic Lyapunov functional approach, the residual system performance analysis is carried out such that the overall residual system is stochastically stable and the error between each residual signal and the fault signal is made as small as possible. Furthermore, a sufficient condition on the existence of the mode-independent distributed fault detection filters is derived in the simultaneous presence of incomplete mode transition probabilities, Markovian switching topologies, network-induced delays, and accumulated data packed dropouts. Finally, a stirred-tank reactor system is given to show the effectiveness of the developed theoretical results.

  9. Reduction of harmonic pollution in distribution networks

    SciTech Connect

    Lawrance, W.B.; Michalik, G.; Mielczarski, W.; Szczepanik, J.

    1995-12-31

    The paper presents two new schemes of harmonic current reduction in distribution of harmonic current reduction in distribution circuits. The first scheme aims at the reduction of harmonics generated by six pulse bridge rectifiers which are common nonlinear load in industry. The new approach is based on injection of the third harmonic current into the transformer secondary. The current injected is generated in two passive filters connected between the outputs of the bridge and the common point of transformer secondary. The scheme is very effective reducing harmonic distortion in the supply current from 27% to 4--5%. The second scheme presented aims at the reduction of harmonic distortion caused by fluorescent lamp systems. It assumes the installation of a series filter in the neutral conductor. A specially designed filter provides a low impedance path for the first harmonic current and high impedance for higher harmonics. Simulation and laboratory tests show significant reduction of harmonics in the neutral and phase conductors.

  10. A distributed name resolution system in information centric networks

    NASA Astrophysics Data System (ADS)

    Elbreiki, Walid; Arlimatti, Shivaleela; Hassan, Suhaidi; Habbal, Adib; Elshaikh, Mohamed

    2016-08-01

    Information Centric Networks (ICN) is the new paradigm that envisages to shift the Internet away from its existing Point-to-Point architecture to a data centric, where communication is based on named hosts rather than the information stored on these hosts. Name Resolution is the center of attraction for ICN, where Named Data Objects (NDO) are used for identifying the information and guiding for routing or forwarding inside ICN. Recently, several researches use distributed NRS to overcome the problem of interest flooding, congestion and overloading. Yet the distribution of NRS is based on random distribution. How to distribute the NRS is still an important and challenging problem. In this work, we address the problem of distribution of NRS by proposing a new mechanism called Distributed Name Resolution System (DNRS), by considering the time of publishing the NDOs in the NRS. This mechanism partitions the network to distribute the workload among NRSs by increasing storage capacity. In addition, partitioning the network increases flexibility and scalability of NRS. We evaluate the effectiveness of our proposed mechanism, which achieves lesser end-to-end delay with more average throughputs compared to random distribution of NRS without disturbing the underlying routing or forwarding strategies.

  11. Exploring empowerment in settings: mapping distributions of network power.

    PubMed

    Neal, Jennifer Watling

    2014-06-01

    This paper brings together two trends in the empowerment literature-understanding empowerment in settings and understanding empowerment as relational-by examining what makes settings empowering from a social network perspective. Specifically, extending Neal and Neal's (Am J Community Psychol 48(3/4):157-167, 2011) conception of network power, an empowering setting is defined as one in which (1) actors have existing relationships that allow for the exchange of resources and (2) the distribution of network power among actors in the setting is roughly equal. The paper includes a description of how researchers can examine distributions of network power in settings. Next, this process is illustrated in both an abstract example and using empirical data on early adolescents' peer relationships in urban classrooms. Finally, implications for theory, methods, and intervention related to understanding empowering settings are explored.

  12. A Reconfiguration Strategy of Distribution Networks Considering Node Importance

    PubMed Central

    Wen, Juan; Tan, Yanghong; Jiang, Lin

    2016-01-01

    Node importance degree is a vital index in distribution network reconfiguration because it reflects the robustness of the network structure by evaluating node importance. Since the traditional reconfiguration ignores this index, the reconstructed network structure may be vulnerable which would reduce the security and stability of the distribution systems. This paper presents a novel reconfiguration strategy considering the node importance. The optimization objectives are the improvement of the node importance degree and the reduction of power loss. To balance the objectives, the reconfiguration mathematical model is formulated as a compound objective function with weight coefficients. Then the quantum particle swarm algorithm is employed to address this compound objective optimization problem. The strategy can model different scenarios network reconfiguration by adjusting the weight vector based on the tendencies of the utility decision maker. Illustrative examples verify the effectiveness of the proposed strategy. PMID:27992589

  13. Aerosol Measurements by the Globally Distributed Micro Pulse Lidar Network

    NASA Technical Reports Server (NTRS)

    Spinhirne, James; Welton, Judd; Campbell, James; Berkoff, Tim; Starr, David (Technical Monitor)

    2001-01-01

    Full time measurements of the vertical distribution of aerosol are now being acquired at a number of globally distributed MP (micro pulse) lidar sites. The MP lidar systems provide full time profiling of all significant cloud and aerosol to the limit of signal attenuation from compact, eye safe instruments. There are currently eight sites in operation and over a dozen planned. At all sited there are also passive aerosol and radiation measurements supporting the lidar data. Four of the installations are at Atmospheric Radiation Measurement program sites. The network operation includes instrument operation and calibration and the processing of aerosol measurements with standard retrievals and data products from the network sites. Data products include optical thickness and extinction cross section profiles. Application of data is to supplement satellite aerosol measurements and to provide a climatology of the height distribution of aerosol. The height distribution of aerosol is important for aerosol transport and the direct scattering and absorption of shortwave radiation in the atmosphere. Current satellite and other data already provide a great amount of information on aerosol distribution, but no passive technique can adequately resolve the height profile of aerosol. The Geoscience Laser Altimeter System (GLAS) is an orbital lidar to be launched in early 2002. GLAS will provide global measurements of the height distribution of aerosol. The MP lidar network will provide ground truth and analysis support for GLAS and other NASA Earth Observing System data. The instruments, sites, calibration procedures and standard data product algorithms for the MPL network will be described.

  14. Interconnecting PV on New York City's Secondary Network Distribution System

    SciTech Connect

    Anderson, K; Coddington, M; Burman, K; Hayter, S; Kroposki, B; Watson, and A

    2009-11-01

    The U.S. Department of Energy (DOE) has teamed with cities across the country through the Solar America Cities (SAC) partnership program to help reduce barriers and accelerate implementation of solar energy. The New York City SAC team is a partnership between the City University of New York (CUNY), the New York City Mayor s Office of Long-term Planning and Sustainability, and the New York City Economic Development Corporation (NYCEDC).The New York City SAC team is working with DOE s National Renewable Energy Laboratory (NREL) and Con Edison, the local utility, to develop a roadmap for photovoltaic (PV) installations in the five boroughs. The city set a goal to increase its installed PV capacity from1.1 MW in 2005 to 8.1 MW by 2015 (the maximum allowed in 2005). A key barrier to reaching this goal, however, is the complexity of the interconnection process with the local utility. Unique challenges are associated with connecting distributed PV systems to secondary network distribution systems (simplified to networks in this report). Although most areas of the country use simpler radial distribution systems to distribute electricity, larger metropolitan areas like New York City typically use networks to increase reliability in large load centers. Unlike the radial distribution system, where each customer receives power through a single line, a network uses a grid of interconnected lines to deliver power to each customer through several parallel circuits and sources. This redundancy improves reliability, but it also requires more complicated coordination and protection schemes that can be disrupted by energy exported from distributed PV systems. Currently, Con Edison studies each potential PV system in New York City to evaluate the system s impact on the network, but this is time consuming for utility engineers and may delay the customer s project or add cost for larger installations. City leaders would like to streamline this process to facilitate faster, simpler, and

  15. Degree distribution of random birth-and-death network with network size decline

    NASA Astrophysics Data System (ADS)

    Xiao-Jun, Zhang; Hui-Lan, Yang

    2016-06-01

    In this paper, we provide a general method to obtain the exact solutions of the degree distributions for random birth-and-death network (RBDN) with network size decline. First, by stochastic process rules, the steady state transformation equations and steady state degree distribution equations are given in the case of m ≥ 3 and 0 < p < 1/2, then the average degree of network with n nodes is introduced to calculate the degree distributions. Specifically, taking m = 3 for example, we explain the detailed solving process, in which computer simulation is used to verify our degree distribution solutions. In addition, the tail characteristics of the degree distribution are discussed. Our findings suggest that the degree distributions will exhibit Poisson tail property for the declining RBDN. Project supported by the National Natural Science Foundation of China (Grant No. 61273015) and the Chinese Scholarship Council.

  16. LPFG sensing network for distributed shape control

    NASA Astrophysics Data System (ADS)

    Ishihara, Abraham K.; Ben-Menahem, Shahar; Kazemi, Alex; Kress, Bernard; Kulishov, Mykola

    2014-09-01

    In this paper, we discuss various aspects of the control and sensing in a flexible wing aircraft using embedded LPFG (Long Period Fiber Grating). Driven by the need to improve aerodynamic efficiency and reduce fuel burn, interest in light-weight structures for next generation aircraft has been on the rise. However, in order to fully exploit novel lightweight structures, there is a critical need for distributed sensing along the entire wing span and its integration with closed-loop control systems. A model of an LPFG sensor string embedded in an Euler-Bernoulli beam is proposed along with an associated control algorithm.

  17. The Integrated Distributed Virtual Research Network: An Introduction

    DTIC Science & Technology

    2014-06-01

    Tom Kile , Theron Trout, and Gary Cohn for their extensive contribution to this document to include reviews, comments, and edits, which contributed...to the quality of the document. The ARL Integrated Distributed Virtual Research Testbed (IDVRT) team, consisting of Alex Tarantin, Khoa Bui, Tom Kile ...n. Network Engineer (non-voting member) Tom Kile o. Network Engineer (non-voting member) Theron Trout p. Non-voting members (serving at the

  18. A Scalable Distribution Network Risk Evaluation Framework via Symbolic Dynamics

    PubMed Central

    Yuan, Kai; Liu, Jian; Liu, Kaipei; Tan, Tianyuan

    2015-01-01

    Background Evaluations of electric power distribution network risks must address the problems of incomplete information and changing dynamics. A risk evaluation framework should be adaptable to a specific situation and an evolving understanding of risk. Methods This study investigates the use of symbolic dynamics to abstract raw data. After introducing symbolic dynamics operators, Kolmogorov-Sinai entropy and Kullback-Leibler relative entropy are used to quantitatively evaluate relationships between risk sub-factors and main factors. For layered risk indicators, where the factors are categorized into four main factors – device, structure, load and special operation – a merging algorithm using operators to calculate the risk factors is discussed. Finally, an example from the Sanya Power Company is given to demonstrate the feasibility of the proposed method. Conclusion Distribution networks are exposed and can be affected by many things. The topology and the operating mode of a distribution network are dynamic, so the faults and their consequences are probabilistic. PMID:25789859

  19. Distributed Reinforcement Learning Approach for Vehicular Ad Hoc Networks

    NASA Astrophysics Data System (ADS)

    Wu, Celimuge; Kumekawa, Kazuya; Kato, Toshihiko

    In Vehicular Ad hoc Networks (VANETs), general purpose ad hoc routing protocols such as AODV cannot work efficiently due to the frequent changes in network topology caused by vehicle movement. This paper proposes a VANET routing protocol QLAODV (Q-Learning AODV) which suits unicast applications in high mobility scenarios. QLAODV is a distributed reinforcement learning routing protocol, which uses a Q-Learning algorithm to infer network state information and uses unicast control packets to check the path availability in a real time manner in order to allow Q-Learning to work efficiently in a highly dynamic network environment. QLAODV is favored by its dynamic route change mechanism, which makes it capable of reacting quickly to network topology changes. We present an analysis of the performance of QLAODV by simulation using different mobility models. The simulation results show that QLAODV can efficiently handle unicast applications in VANETs.

  20. Distributed network organization underlying feeding behavior in the mollusk Lymnaea.

    PubMed

    Benjamin, Paul R

    2012-04-17

    The aim of the work reviewed here is to relate the properties of individual neurons to network organization and behavior using the feeding system of the gastropod mollusk, Lymnaea. Food ingestion in this animal involves sequences of rhythmic biting movements that are initiated by the application of a chemical food stimulus to the lips and esophagus. We investigated how individual neurons contribute to various network functions that are required for the generation of feeding behavior such as rhythm generation, initiation ('decision making'), modulation and hunger and satiety. The data support the view that feeding behavior is generated by a distributed type of network organization with individual neurons often contributing to more than one network function, sharing roles with other neurons. Multitasking in a distributed type of network would be 'economically' sensible in the Lymnaea feeding system where only about 100 neurons are available to carry out a variety of complex tasks performed by millions of neurons in the vertebrate nervous system. Having complementary and potentially alternative mechanisms for network functions would also add robustness to what is a 'noisy' network where variable firing rates and synaptic strengths are commonly encountered in electrophysiological recording experiments.

  1. On the log-normal distribution of network traffic

    NASA Astrophysics Data System (ADS)

    Antoniou, I.; Ivanov, V. V.; Ivanov, Valery V.; Zrelov, P. V.

    2002-07-01

    A detailed analysis of traffic measurements shows that the aggregation of these measurements forms a statistical distribution, which is approximated with high accuracy by the log-normal distribution. The inter-arrival times and packet sizes, contributing to the formation of network traffic, can be considered as independent. Applying the wavelet transform to traffic measurements, we demonstrate the multiplicative character of traffic series. This result confirms that the scheme, developed by Kolmogorov [Dokl. Akad. Nauk SSSR 31 (1941) 99] for the homogeneous fragmentation of grains, applies also to network traffic.

  2. Automatic Distribution Network Reconfiguration: An Event-Driven Approach

    SciTech Connect

    Ding, Fei; Jiang, Huaiguang; Tan, Jin

    2016-11-14

    This paper proposes an event-driven approach for reconfiguring distribution systems automatically. Specifically, an optimal synchrophasor sensor placement (OSSP) is used to reduce the number of synchrophasor sensors while keeping the whole system observable. Then, a wavelet-based event detection and location approach is used to detect and locate the event, which performs as a trigger for network reconfiguration. With the detected information, the system is then reconfigured using the hierarchical decentralized approach to seek for the new optimal topology. In this manner, whenever an event happens the distribution network can be reconfigured automatically based on the real-time information that is observable and detectable.

  3. Distributed network management in the flat structured mobile communities

    NASA Astrophysics Data System (ADS)

    Balandina, Elena

    2005-10-01

    Delivering proper management into the flat structured mobile communities is crucial for improving users experience and increase applications diversity in mobile networks. The available P2P applications do application-centric management, but it cannot replace network-wide management, especially when a number of different applications are used simultaneously in the network. The network-wide management is the key element required for a smooth transition from standalone P2P applications to the self-organizing mobile communities that maintain various services with quality and security guaranties. The classical centralized network management solutions are not applicable in the flat structured mobile communities due to the decentralized nature and high mobility of the underlying networks. Also the basic network management tasks have to be revised taking into account specialties of the flat structured mobile communities. The network performance management becomes more dependent on the current nodes' context, which also requires extension of the configuration management functionality. The fault management has to take into account high mobility of the network nodes. The performance and accounting managements are mainly targeted in maintain an efficient and fair access to the resources within the community, however they also allow unbalanced resource use of the nodes that explicitly permit it, e.g. as a voluntary donation to the community or due to the profession (commercial) reasons. The security management must implement the new trust models, which are based on the community feedback, professional authorization, and a mix of both. For fulfilling these and another specialties of the flat structured mobile communities, a new network management solution is demanded. The paper presents a distributed network management solution for flat structured mobile communities. Also the paper points out possible network management roles for the different parties (e.g. operators, service

  4. Acoustic mapping of ocean currents using networked distributed sensors.

    PubMed

    Huang, Chen-Fen; Yang, T C; Liu, Jin-Yuan; Schindall, Jeff

    2013-09-01

    Distributed underwater sensors are expected to provide oceanographic monitoring over large areas. As fabrication technology advances, low cost sensors will be available for many uses. The sensors communicate to each other and are networked using acoustic communications. This paper first studies the performance of such systems for current measurements using tomographic inversion approaches to compare with that of a conventional system which distributes the sensors on the periphery of the area of interest. It then proposes two simple signal processing methods for ocean current mapping (using distributed networked sensors) aimed at real-time in-buoy processing. Tomographic inversion generally requires solving a challenging high dimensional inverse problem, involving substantial computations. Given distributed sensors, currents can be constructed locally based on data from neighboring sensors. It is shown using simulated data that similar results are obtained using distributed processing as using conventional tomographic approaches. The advantage for distributed systems is that by increasing the number of nodes, one gains a much more improved performance. Furthermore, distributed systems use much less energy than a conventional tomographic system for the same area coverage. Experimental data from an acoustic communication and networking experiment are used to demonstrate the feasibility of acoustic current mapping.

  5. Universal scaling of optimal current distribution in transportation networks.

    PubMed

    Simini, Filippo; Rinaldo, Andrea; Maritan, Amos

    2009-04-01

    Transportation networks are inevitably selected with reference to their global cost which depends on the strengths and the distribution of the embedded currents. We prove that optimal current distributions for a uniformly injected d -dimensional network exhibit robust scale-invariance properties, independently of the particular cost function considered, as long as it is convex. We find that, in the limit of large currents, the distribution decays as a power law with an exponent equal to (2d-1)/(d-1). The current distribution can be exactly calculated in d=2 for all values of the current. Numerical simulations further suggest that the scaling properties remain unchanged for both random injections and by randomizing the convex cost functions.

  6. EDONIO: Extended distributed object network I/O library

    SciTech Connect

    D`Azevedo, E.F.; Romine, C.H.

    1995-03-01

    This report describes EDONIO (Extended Distributed Object Network I/O), an enhanced version of DONIO (Distributed Object Network I/O Library) optimized for the Intel Paragon Systems using the new M-ASYNC access mode. DONIO provided fast file I/O capabilities in the Intel iPSC/860 and Paragon distributed memory parallel environments by caching a copy of the entire file in memory distributed across all processors. EDONIO is more memory efficient by caching only a subset of the disk file at a time. DONIO was restricted by the high memory requirements and use of 32-bit integer indexing to handle files no larger than 2 Gigabytes. EDONIO overcomes this barrier by using the extended integer library routines provided by Intel`s NX operating system. For certain applications, EDONIO may show a ten-fold improvement in performance over the native NX I/O routines.

  7. Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation.

    PubMed

    Du, Tingsong; Hu, Yang; Ke, Xianting

    2015-01-01

    An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

  8. Growing Fully Distributed Robust Topologies in a Sensor Network

    NASA Astrophysics Data System (ADS)

    Gasparri, Andrea; Meloni, Sandro; Panzieri, Stefano

    Wireless Sensor Networks (WSN) are at the forefront of emerging technologies due to the recent advances in Micro-Electro-Mechanical Systems (MEMS) technology. WSN are considered to be unattended systems with applications ranging from environmental sensing, structural monitoring, and industrial process control to emergency response and mobile target tracking.The distributed nature and the limited hardware capabilities of WSN challenge the development of effective applications. The strength of a sensor network, which turns out to be also its weakness, is the capability to perform inter-node processing while sharing data across the network. However, the limited reliability of a node, due to the low-cost nature of the hardware components, drastically constrains this aspect. For this reason, the availability of a mechanism to build distributed robust connectivity topologies, where robustness is meant against random failures of nodes and intentional attacks of nodes, is crucial. The complex network theory along with the percolation theory provides a suitable framework to achieve that. Indeed, topologies such as multi-modal and scale free ones, show interesting properties which might be embedded into a sensor network to significantly increase its robustness. In this work, a mechanisms to build robust topologies in a distributed fashion is proposed, its effectiveness is analytically investigated and results are validated through simulations.

  9. [Distribution and taxonomy of Pyrgophorus platyrachis (Caenogastropoda: Hydrobiidae) in the Sistema de Maracaibo, Venezuela].

    PubMed

    Nava, Mario; Severeyn, Héctor; Machado, Nakary

    2011-09-01

    The presence of a microgastropod identified as Potamopyrgus sp. was detected previously in the Maracaibo System; nevertheless, a detailed morphological analysis identified this snail in other genera. The objective of this work is to update the distribution and taxonomy of Pyrgophorus platyrachis in the Maracaibo System, Venezuela in samples obtained between 2001 and 2009. The presence of hundreds of individuals of P. platyrachis were observed in the estuary, indeed in the localities of the Gran Eneal lagoon (4 111 snails), Peonías lagoon (229 snails), Punta Capitán Chico (758 snails), San Francisco (2 517 snails), Curarire (240 snails), Apon River mouth (173 snails), Ojeda City (240 snails), Bachaquero (128 snails) and Tomoporo de Agua (385 snails). We performed a taxonomical analysis, and emphasized in ecological aspects, such as the distribution of the species and habitat features, as near vegetation and type of associated sediment. We found three morphotypes of the species, one smooth, another with spiral striations and the other with spines. Smooth morphotype was exclusive of the Gran Eneal lagoon, Peonías lagoon, Punta Capitan Chico and Apon River mouth localities, whereas the other two morphotypes were found together in the remaining localities. According to our detailed anatomical and taxonomical analysis we propose a synonymy between P. platyrachis and the other species described like Pyrgophorus parvulus and Pyrgophorus spinosus.

  10. Performance evaluation of distributed wavelength assignment in WDM optical networks

    NASA Astrophysics Data System (ADS)

    Hashiguchi, Tomohiro; Wang, Xi; Morikawa, Hiroyuki; Aoyama, Tomonori

    2004-04-01

    In WDM wavelength routed networks, prior to a data transfer, a call setup procedure is required to reserve a wavelength path between the source-destination node pairs. A distributed approach to a connection setup can achieve a very high speed, while improving the reliability and reducing the implementation cost of the networks. However, along with many advantages, several major challenges have been posed by the distributed scheme in how the management and allocation of wavelength could be efficiently carried out. In this thesis, we apply a distributed wavelength assignment algorithm named priority based wavelength assignment (PWA) that was originally proposed for the use in burst switched optical networks to the problem of reserving wavelengths of path reservation protocols in the distributed control optical networks. Instead of assigning wavelengths randomly, this approach lets each node select the "safest" wavelengths based on the information of wavelength utilization history, thus unnecessary future contention is prevented. The simulation results presented in this paper show that the proposed protocol can enhance the performance of the system without introducing any apparent drawbacks.

  11. Social Networks and Performance in Distributed Learning Communities

    ERIC Educational Resources Information Center

    Cadima, Rita; Ojeda, Jordi; Monguet, Josep M.

    2012-01-01

    Social networks play an essential role in learning environments as a key channel for knowledge sharing and students' support. In distributed learning communities, knowledge sharing does not occur as spontaneously as when a working group shares the same physical space; knowledge sharing depends even more on student informal connections. In this…

  12. Exploration of Heterogeneity in Distributed Research Network Drug Safety Analyses

    ERIC Educational Resources Information Center

    Hansen, Richard A.; Zeng, Peng; Ryan, Patrick; Gao, Juan; Sonawane, Kalyani; Teeter, Benjamin; Westrich, Kimberly; Dubois, Robert W.

    2014-01-01

    Distributed data networks representing large diverse populations are an expanding focus of drug safety research. However, interpreting results is difficult when treatment effect estimates vary across datasets (i.e., heterogeneity). In a previous study, risk estimates were generated for selected drugs and potential adverse outcomes. Analyses were…

  13. Distributed simulation using a real-time shared memory network

    NASA Technical Reports Server (NTRS)

    Simon, Donald L.; Mattern, Duane L.; Wong, Edmond; Musgrave, Jeffrey L.

    1993-01-01

    The Advanced Control Technology Branch of the NASA Lewis Research Center performs research in the area of advanced digital controls for aeronautic and space propulsion systems. This work requires the real-time implementation of both control software and complex dynamical models of the propulsion system. We are implementing these systems in a distributed, multi-vendor computer environment. Therefore, a need exists for real-time communication and synchronization between the distributed multi-vendor computers. A shared memory network is a potential solution which offers several advantages over other real-time communication approaches. A candidate shared memory network was tested for basic performance. The shared memory network was then used to implement a distributed simulation of a ramjet engine. The accuracy and execution time of the distributed simulation was measured and compared to the performance of the non-partitioned simulation. The ease of partitioning the simulation, the minimal time required to develop for communication between the processors and the resulting execution time all indicate that the shared memory network is a real-time communication technique worthy of serious consideration.

  14. Centralized and distributed control architectures under Foundation Fieldbus network.

    PubMed

    Persechini, Maria Auxiliadora Muanis; Jota, Fábio Gonçalves

    2013-01-01

    This paper aims at discussing possible automation and control system architectures based on fieldbus networks in which the controllers can be implemented either in a centralized or in a distributed form. An experimental setup is used to demonstrate some of the addressed issues. The control and automation architecture is composed of a supervisory system, a programmable logic controller and various other devices connected to a Foundation Fieldbus H1 network. The procedures used in the network configuration, in the process modelling and in the design and implementation of controllers are described. The specificities of each one of the considered logical organizations are also discussed. Finally, experimental results are analysed using an algorithm for the assessment of control loops to compare the performances between the centralized and the distributed implementations.

  15. Distributed Coordinated Control of Large-Scale Nonlinear Networks

    DOE PAGES

    Kundu, Soumya; Anghel, Marian

    2015-11-08

    We provide a distributed coordinated approach to the stability analysis and control design of largescale nonlinear dynamical systems by using a vector Lyapunov functions approach. In this formulation the large-scale system is decomposed into a network of interacting subsystems and the stability of the system is analyzed through a comparison system. However finding such comparison system is not trivial. In this work, we propose a sum-of-squares based completely decentralized approach for computing the comparison systems for networks of nonlinear systems. Moreover, based on the comparison systems, we introduce a distributed optimal control strategy in which the individual subsystems (agents) coordinatemore » with their immediate neighbors to design local control policies that can exponentially stabilize the full system under initial disturbances.We illustrate the control algorithm on a network of interacting Van der Pol systems.« less

  16. Distributed Coordinated Control of Large-Scale Nonlinear Networks

    SciTech Connect

    Kundu, Soumya; Anghel, Marian

    2015-11-08

    We provide a distributed coordinated approach to the stability analysis and control design of largescale nonlinear dynamical systems by using a vector Lyapunov functions approach. In this formulation the large-scale system is decomposed into a network of interacting subsystems and the stability of the system is analyzed through a comparison system. However finding such comparison system is not trivial. In this work, we propose a sum-of-squares based completely decentralized approach for computing the comparison systems for networks of nonlinear systems. Moreover, based on the comparison systems, we introduce a distributed optimal control strategy in which the individual subsystems (agents) coordinate with their immediate neighbors to design local control policies that can exponentially stabilize the full system under initial disturbances.We illustrate the control algorithm on a network of interacting Van der Pol systems.

  17. Joint physical and numerical modeling of water distribution networks.

    SciTech Connect

    Zimmerman, Adam; O'Hern, Timothy John; Orear, Leslie Jr.; Kajder, Karen C.; Webb, Stephen Walter; Cappelle, Malynda A.; Khalsa, Siri Sahib; Wright, Jerome L.; Sun, Amy Cha-Tien; Chwirka, J. Benjamin; Hartenberger, Joel David; McKenna, Sean Andrew; van Bloemen Waanders, Bart Gustaaf; McGrath, Lucas K.; Ho, Clifford Kuofei

    2009-01-01

    This report summarizes the experimental and modeling effort undertaken to understand solute mixing in a water distribution network conducted during the last year of a 3-year project. The experimental effort involves measurement of extent of mixing within different configurations of pipe networks, measurement of dynamic mixing in a single mixing tank, and measurement of dynamic solute mixing in a combined network-tank configuration. High resolution analysis of turbulence mixing is carried out via high speed photography as well as 3D finite-volume based Large Eddy Simulation turbulence models. Macroscopic mixing rules based on flow momentum balance are also explored, and in some cases, implemented in EPANET. A new version EPANET code was developed to yield better mixing predictions. The impact of a storage tank on pipe mixing in a combined pipe-tank network during diurnal fill-and-drain cycles is assessed. Preliminary comparison between dynamic pilot data and EPANET-BAM is also reported.

  18. The application of artificial intelligence techniques to large distributed networks

    NASA Technical Reports Server (NTRS)

    Dubyah, R.; Smith, T. R.; Star, J. L.

    1985-01-01

    Data accessibility and transfer of information, including the land resources information system pilot, are structured as large computer information networks. These pilot efforts include the reduction of the difficulty to find and use data, reducing processing costs, and minimize incompatibility between data sources. Artificial Intelligence (AI) techniques were suggested to achieve these goals. The applicability of certain AI techniques are explored in the context of distributed problem solving systems and the pilot land data system (PLDS). The topics discussed include: PLDS and its data processing requirements, expert systems and PLDS, distributed problem solving systems, AI problem solving paradigms, query processing, and distributed data bases.

  19. An architecture for distributed video applications based on declarative networking

    NASA Astrophysics Data System (ADS)

    Wang, Xiping; Gonzales, Cesar; Lobo, Jorge; Calo, Seraphin; Verma, Dinesh

    2012-06-01

    Video surveillance applications are examples of complex distributed coalition tasks. Real-time capture and analysis of image sensor data is one of the most important tasks in a number of military critical decision making scenarios. In complex battlefield situations, there is a need to coordinate the operation of distributed image sensors and the analysis of their data as transmitted over a heterogeneous wireless network where bandwidth, power, and computational capabilities are constrained. There is also a need to automate decision making based on the results of the analysis of video data. Declarative Networking is a promising technology for controlling complex video surveillance applications in this sort of environment. This paper presents a flexible and extensible architecture for deploying distributed video surveillance applications using the declarative networking paradigm, which allows us to dynamically connect and manage distributed image sensors and deploy various modules for the analysis of video data to satisfy a variety of video surveillance requirements. With declarative computing, it becomes possible for us not only to express the program control structure in a declarative fashion, but also to simplify the management of distributed video surveillance applications.

  20. Distributed fault detection and isolation resilient to network model uncertainties.

    PubMed

    Teixeira, Andre; Shames, Iman; Sandberg, Henrik; Johansson, Karl H

    2014-11-01

    The ability to maintain state awareness in the face of unexpected and unmodeled errors and threats is a defining feature of a resilient control system. Therefore, in this paper, we study the problem of distributed fault detection and isolation (FDI) in large networked systems with uncertain system models. The linear networked system is composed of interconnected subsystems and may be represented as a graph. The subsystems are represented by nodes, while the edges correspond to the interconnections between subsystems. Considering faults that may occur on the interconnections and subsystems, as our first contribution, we propose a distributed scheme to jointly detect and isolate faults occurring in nodes and edges of the system. As our second contribution, we analyze the behavior of the proposed scheme under model uncertainties caused by the addition or removal of edges. Additionally, we propose a novel distributed FDI scheme based on local models and measurements that is resilient to changes outside of the local subsystem and achieves FDI. Our third contribution addresses the complexity reduction of the distributed FDI method, by characterizing the minimum amount of model information and measurements needed to achieve FDI and by reducing the number of monitoring nodes. The proposed methods can be fused to design a scalable and resilient distributed FDI architecture that achieves local FDI despite unknown changes outside the local subsystem. The proposed approach is illustrated by numerical experiments on the IEEE 118-bus power network benchmark.

  1. Towards the distribution network of time and frequency

    NASA Astrophysics Data System (ADS)

    Lipiński, M.; Krehlik, P.; Śliwczyński, Ł.; Buczek, Ł.; Kołodziej, J.; Nawrocki, J.; Nogaś, P.; Dunst, P.; Lemański, D.; Czubla, A.; Pieczerak, J.; Adamowicz, W.; Pawszak, T.; Igalson, J.; Binczewski, A.; Bogacki, W.; Ostapowicz, P.; Stroiński, M.; Turza, K.

    2014-05-01

    In the paper the genesis, current stage and perspectives of the OPTIME project are described. The main goal of the project is to demonstrate that the newdeveloped at AGH technology of fiber optic transfer of the atomic clocks reference signals is ready to be used in building the domestic Time and Frequency distribution network. In the first part we summarize the two-year continuous operation of 420 kmlong link connecting the Laboratory of Time and Frequency at Central Office of Measures GUM in Warsaw and Time Service Laboratory at Astrogeodynamic Obserwatory AOS in Borowiec near Poznan. For the first time, we are reporting the two year comparison of UTC(PL) and UTC(AOS) atomic timescales with this link, and we refer it to the results of comparisons performed by GPS-based methods. We also address some practical aspects of maintaining time and frequency dissemination over fiber optical network. In the second part of the paper the concept of the general architecture of the distribution network with two Reference Time and Frequency Laboratories and local repositories is proposed. Moreover the brief project of the second branch connecting repositories in Poznan Polish Supercomputing and Networking Center and Torun Nicolaus Copernicus University with the first end-users in Torun such as National Laboratory of Atomic, Molecular and Optical Physics and Nicolaus Copernicus Astronomical Center is described. In the final part the perspective of developing the network both in the domestic range as far as extention with the international connections possibilities are presented.

  2. Hadoop neural network for parallel and distributed feature selection.

    PubMed

    Hodge, Victoria J; O'Keefe, Simon; Austin, Jim

    2016-06-01

    In this paper, we introduce a theoretical basis for a Hadoop-based neural network for parallel and distributed feature selection in Big Data sets. It is underpinned by an associative memory (binary) neural network which is highly amenable to parallel and distributed processing and fits with the Hadoop paradigm. There are many feature selectors described in the literature which all have various strengths and weaknesses. We present the implementation details of five feature selection algorithms constructed using our artificial neural network framework embedded in Hadoop YARN. Hadoop allows parallel and distributed processing. Each feature selector can be divided into subtasks and the subtasks can then be processed in parallel. Multiple feature selectors can also be processed simultaneously (in parallel) allowing multiple feature selectors to be compared. We identify commonalities among the five features selectors. All can be processed in the framework using a single representation and the overall processing can also be greatly reduced by only processing the common aspects of the feature selectors once and propagating these aspects across all five feature selectors as necessary. This allows the best feature selector and the actual features to select to be identified for large and high dimensional data sets through exploiting the efficiency and flexibility of embedding the binary associative-memory neural network in Hadoop.

  3. Distributed networks enable advances in US space weather operations

    NASA Astrophysics Data System (ADS)

    Tobiska, W. Kent; Bouwer, S. Dave

    2011-06-01

    Space weather, the shorter-term variable impact of the Sun’s photons, solar wind particles, and interplanetary magnetic field upon the Earth’s environment, adversely affects our technological systems. These technological systems, including their space component, are increasingly being seen as a way to help solve 21st Century problems such as climate change, energy access, fresh water availability, and transportation coordination. Thus, the effects of space weather on space systems and assets must be mitigated and operational space weather using automated distributed networks has emerged as a common operations methodology. The evolution of space weather operations is described and the description of distributed network architectures is provided, including their use of tiers, data objects, redundancy, and time domain definitions. There are several existing distributed networks now providing space weather information and the lessons learned in developing those networks are discussed along with the details of examples for the Solar Irradiance Platform (SIP), Communication Alert and Prediction System (CAPS), GEO Alert and Prediction System (GAPS), LEO Alert and Prediction System (LAPS), Radiation Alert and Prediction System (RAPS), and Magnetosphere Alert and Prediction System (MAPS).

  4. Steady-state distributions of probability fluxes on complex networks

    NASA Astrophysics Data System (ADS)

    Chełminiak, Przemysław; Kurzyński, Michał

    2017-02-01

    We consider a simple model of the Markovian stochastic dynamics on complex networks to examine the statistical properties of the probability fluxes. The additional transition, called hereafter a gate, powered by the external constant force breaks a detailed balance in the network. We argue, using a theoretical approach and numerical simulations, that the stationary distributions of the probability fluxes emergent under such conditions converge to the Gaussian distribution. By virtue of the stationary fluctuation theorem, its standard deviation depends directly on the square root of the mean flux. In turn, the nonlinear relation between the mean flux and the external force, which provides the key result of the present study, allows us to calculate the two parameters that entirely characterize the Gaussian distribution of the probability fluxes both close to as well as far from the equilibrium state. Also, the other effects that modify these parameters, such as the addition of shortcuts to the tree-like network, the extension and configuration of the gate and a change in the network size studied by means of computer simulations are widely discussed in terms of the rigorous theoretical predictions.

  5. Distributed policy based access to networked heterogeneous ISR data sources

    NASA Astrophysics Data System (ADS)

    Bent, G.; Vyvyan, D.; Wood, David; Zerfos, Petros; Calo, Seraphin

    2010-04-01

    Within a coalition environment, ad hoc Communities of Interest (CoI's) come together, perhaps for only a short time, with different sensors, sensor platforms, data fusion elements, and networks to conduct a task (or set of tasks) with different coalition members taking different roles. In such a coalition, each organization will have its own inherent restrictions on how it will interact with the others. These are usually stated as a set of policies, including security and privacy policies. The capability that we want to enable for a coalition operation is to provide access to information from any coalition partner in conformance with the policies of all. One of the challenges in supporting such ad-hoc coalition operations is that of providing efficient access to distributed sources of data, where the applications requiring the data do not have knowledge of the location of the data within the network. To address this challenge the International Technology Alliance (ITA) program has been developing the concept of a Dynamic Distributed Federated Database (DDFD), also know as a Gaian Database. This type of database provides a means for accessing data across a network of distributed heterogeneous data sources where access to the information is controlled by a mixture of local and global policies. We describe how a network of disparate ISR elements can be expressed as a DDFD and how this approach enables sensor and other information sources to be discovered autonomously or semi-autonomously and/or combined, fused formally defined local and global policies.

  6. Physical Modeling of Scaled Water Distribution System Networks.

    SciTech Connect

    O'Hern, Timothy J.; Hammond, Glenn Edward; Orear, Leslie ,; van Bloemen Waanders, Bart G.; Paul Molina; Ross Johnson

    2005-10-01

    Threats to water distribution systems include release of contaminants and Denial of Service (DoS) attacks. A better understanding, and validated computational models, of the flow in water distribution systems would enable determination of sensor placement in real water distribution networks, allow source identification, and guide mitigation/minimization efforts. Validation data are needed to evaluate numerical models of network operations. Some data can be acquired in real-world tests, but these are limited by 1) unknown demand, 2) lack of repeatability, 3) too many sources of uncertainty (demand, friction factors, etc.), and 4) expense. In addition, real-world tests have limited numbers of network access points. A scale-model water distribution system was fabricated, and validation data were acquired over a range of flow (demand) conditions. Standard operating variables included system layout, demand at various nodes in the system, and pressure drop across various pipe sections. In addition, the location of contaminant (salt or dye) introduction was varied. Measurements of pressure, flowrate, and concentration at a large number of points, and overall visualization of dye transport through the flow network were completed. Scale-up issues that that were incorporated in the experiment design include Reynolds number, pressure drop across nodes, and pipe friction and roughness. The scale was chosen to be 20:1, so the 10 inch main was modeled with a 0.5 inch pipe in the physical model. Controlled validation tracer tests were run to provide validation to flow and transport models, especially of the degree of mixing at pipe junctions. Results of the pipe mixing experiments showed large deviations from predicted behavior and these have a large impact on standard network operations models.3

  7. Using overlay network architectures for scalable video distribution

    NASA Astrophysics Data System (ADS)

    Patrikakis, Charalampos Z.; Despotopoulos, Yannis; Fafali, Paraskevi; Cha, Jihun; Kim, Kyuheon

    2004-11-01

    Within the last years, the enormous growth of Internet based communication as well as the rapid increase of available processing power has lead to the widespread use of multimedia streaming as a means to convey information. This work aims at providing an open architecture designed to support scalable streaming to a large number of clients using application layer multicast. The architecture is based on media relay nodes that can be deployed transparently to any existing media distribution scheme, which can support media streamed using the RTP and RTSP protocols. The architecture is based on overlay networks at application level, featuring rate adaptation mechanisms for responding to network congestion.

  8. Distributed Estimation for Vector Signal in Linear Coherent Sensor Networks

    NASA Astrophysics Data System (ADS)

    Wu, Chien-Hsien; Lin, Ching-An

    We introduce the distributed estimation of a random vector signal in wireless sensor networks that follow coherent multiple access channel model. We adopt the linear minimum mean squared error fusion rule. The problem of interest is to design linear coding matrices for those sensors in the network so as to minimize mean squared error of the estimated vector signal under a total power constraint. We show that the problem can be formulated as a convex optimization problem and we obtain closed form expressions of the coding matrices. Numerical results are used to illustrate the performance of the proposed method.

  9. Fast Distributed Dynamics of Semantic Networks via Social Media.

    PubMed

    Carrillo, Facundo; Cecchi, Guillermo A; Sigman, Mariano; Slezak, Diego Fernández

    2015-01-01

    We investigate the dynamics of semantic organization using social media, a collective expression of human thought. We propose a novel, time-dependent semantic similarity measure (TSS), based on the social network Twitter. We show that TSS is consistent with static measures of similarity but provides high temporal resolution for the identification of real-world events and induced changes in the distributed structure of semantic relationships across the entire lexicon. Using TSS, we measured the evolution of a concept and its movement along the semantic neighborhood, driven by specific news/events. Finally, we showed that particular events may trigger a temporary reorganization of elements in the semantic network.

  10. Fast Distributed Dynamics of Semantic Networks via Social Media

    PubMed Central

    Carrillo, Facundo; Cecchi, Guillermo A.; Sigman, Mariano; Fernández Slezak, Diego

    2015-01-01

    We investigate the dynamics of semantic organization using social media, a collective expression of human thought. We propose a novel, time-dependent semantic similarity measure (TSS), based on the social network Twitter. We show that TSS is consistent with static measures of similarity but provides high temporal resolution for the identification of real-world events and induced changes in the distributed structure of semantic relationships across the entire lexicon. Using TSS, we measured the evolution of a concept and its movement along the semantic neighborhood, driven by specific news/events. Finally, we showed that particular events may trigger a temporary reorganization of elements in the semantic network. PMID:26074953

  11. Pollutant intrusion modeling in water distribution networks using artificial neural networks.

    PubMed

    Singh, Raj Mohan; Rahul, Akhouri Ishan

    2011-07-01

    The development and implementation of water quality models for water distribution systems have been growing interest for both environment and hydraulic researchers. It is imperative that the system is able to distribute disinfectants and/or chemicals efficiently for specified quality standards and recover the actual quality of water in case of intrusion of a pollutant into the distribution network. The present work presents hydraulic and quality analysis in a typical water distribution system to obtain the concentration at the sources (pumping station or tanks) affected by typical pollutants utilizing water quality at monitoring points as inputs to artificial neural network (ANN) model. The universal function approximation property of the ANN architecture is being employed for inverse mapping to predict the water quality at the source using the water quality at arbitrary monitoring locations in the distribution system. The optimal monitoring points are identified by water age analysis. The performance evaluation results are encouraging and demonstrate the potential applicability of the methodology.

  12. Efficient network meta-analysis: a confidence distribution approach*

    PubMed Central

    Yang, Guang; Liu, Dungang; Liu, Regina Y.; Xie, Minge; Hoaglin, David C.

    2014-01-01

    Summary Network meta-analysis synthesizes several studies of multiple treatment comparisons to simultaneously provide inference for all treatments in the network. It can often strengthen inference on pairwise comparisons by borrowing evidence from other comparisons in the network. Current network meta-analysis approaches are derived from either conventional pairwise meta-analysis or hierarchical Bayesian methods. This paper introduces a new approach for network meta-analysis by combining confidence distributions (CDs). Instead of combining point estimators from individual studies in the conventional approach, the new approach combines CDs which contain richer information than point estimators and thus achieves greater efficiency in its inference. The proposed CD approach can e ciently integrate all studies in the network and provide inference for all treatments even when individual studies contain only comparisons of subsets of the treatments. Through numerical studies with real and simulated data sets, the proposed approach is shown to outperform or at least equal the traditional pairwise meta-analysis and a commonly used Bayesian hierarchical model. Although the Bayesian approach may yield comparable results with a suitably chosen prior, it is highly sensitive to the choice of priors (especially the prior of the between-trial covariance structure), which is often subjective. The CD approach is a general frequentist approach and is prior-free. Moreover, it can always provide a proper inference for all the treatment effects regardless of the between-trial covariance structure. PMID:25067933

  13. 75 FR 9343 - Nomenclature Change Relating to the Network Distribution Center Transition

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-03-02

    ... 111 and 121 Nomenclature Change Relating to the Network Distribution Center Transition AGENCY: Postal... to the ongoing transition of USPS bulk mail centers (BMC) to network distribution centers (NDC), by... Distribution Center. BMC NDC. Destination Bulk Mail Center Destination Network Distribution Center. DBMC...

  14. An Optimization of the Maintenance Assets Distribution Network in the Argentine Air Force

    DTIC Science & Technology

    2015-03-26

    AN OPTIMIZATION OF THE MAINTENANCE ASSETS DISTRIBUTION NETWORK IN THE ARGENTINE AIR FORCE...copyright protection in the United States. AFIT-ENS-MS-15-M-152 AN OPTIMIZATION OF THE MAINTENANCE ASSETS DISTRIBUTION NETWORK IN THE ARGENTINE AIR...PUBLIC RELEASE; DISTRIBUTION UNLIMITED. AFIT-ENS-MS-15-M-152 AN OPTIMIZATION OF THE MAINTENANCE ASSETS DISTRIBUTION NETWORK IN THE ARGENTINE AIR

  15. A Distributed Network Mobility Management Scheme for Hierarchical Mobile IPv6 Networks

    NASA Astrophysics Data System (ADS)

    Kawano, Keita; Kinoshita, Kazuhiko; Yamai, Nariyoshi

    Route optimization for network mobility is a key technique for providing a node in a mobile network (Mobile Network Node or MNN) with high quality broadband communications. Many schemes adding route optimization function to Network Mobility (NEMO) Basic Support protocol, the standardized network mobility management protocol from the IETF nemo working group, have already been proposed in recent years. One such scheme, a scheme using Hierarchical Mobile IPv6 (HMIPv6) aims to overcome micromobility management issues as well by applying a mechanism based on HMIPv6. The traditional scheme, however, suffers from a significant number of signaling messages as the number of MNNs and/or the number of their Correspondent Nodes (CNs) increase, because many messages notifying the MNNs' Home Agents (HAMNNs) and the CNs of the mobile network's movement are generated simultaneously each time the mobile network moves to the domain of another micromobility management router (Mobility Anchor Point or MAP). This paper proposes a scheme to overcome this problem. Our scheme reduces the number of signaling messages generated at the same time by managing the mobility of MNNs using multiple MAPs distributed within a network for load sharing. The results of simulation experiments show that our scheme works efficiently compared to the traditional scheme when a mobile network has many MNNs and/or these MNNs communicate with many CNs.

  16. S-curve networks and an approximate method for estimating degree distributions of complex networks

    NASA Astrophysics Data System (ADS)

    Guo, Jin-Li

    2010-12-01

    In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási-Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási-Albert method commonly used in current network research.

  17. A precise clock distribution network for MRPC-based experiments

    NASA Astrophysics Data System (ADS)

    Wang, S.; Cao, P.; Shang, L.; An, Q.

    2016-06-01

    In high energy physics experiments, the MRPC (Multi-Gap Resistive Plate Chamber) detectors are widely used recently which can provide higher-resolution measurement for particle identification. However, the application of MRPC detectors leads to a series of challenges in electronics design with large number of front-end electronic channels, especially for distributing clock precisely. To deal with these challenges, this paper presents a universal scheme of clock transmission network for MRPC-based experiments with advantages of both precise clock distribution and global command synchronization. For precise clock distributing, the clock network is designed into a tree architecture with two stages: the first one has a point-to-multipoint long range bidirectional distribution with optical channels and the second one has a fan-out structure with copper link inside readout crates. To guarantee the precision of clock frequency or phase, the r-PTP (reduced Precision Time Protocol) and the DDMTD (digital Dual Mixer Time Difference) methods are used for frequency synthesis, phase measurement and adjustment, which is implemented by FPGA (Field Programmable Gate Array) in real-time. In addition, to synchronize global command execution, based upon this clock distribution network, synchronous signals are coded with clock for transmission. With technique of encoding/decoding and clock data recovery, signals such as global triggers or system control commands, can be distributed to all front-end channels synchronously, which greatly simplifies the system design. The experimental results show that both the clock jitter (RMS) and the clock skew can be less than 100 ps.

  18. High load distribution network in the 80's

    NASA Astrophysics Data System (ADS)

    Gebhardt, O.

    1982-08-01

    High duty, compact equipment having no negative environmental effects when used in high power distribution networks, was developed. Digital computer programs allowed for optimization of the design and simulation of the operating conditions of system components. A computer model allowed for testing and choosing the optimal medium voltage network and the possible extensions of the low tension network. Materials were elaborated and tested in order to guarantees a reliable long-term behavior of the components. This led to the development of a space saving insulator traverse and helped to solve stressing problems of VPE-cables also with internal forced water cooling. With the development and production of a subterranean muffled transformer for powerful low voltage consumers, all the necessary system components for a densely populated area are available.

  19. Research on three-phase unbalanced distribution network reconfiguration strategy

    NASA Astrophysics Data System (ADS)

    Hu, Shuang; Li, Ke-Jun; Xu, Yanshun; Liu, Zhijie; Guo, Jing; Wang, Zhuodi

    2017-01-01

    With the development of social economy, the loads installed in the distribution network become more and more complex which may cause the three-phase unbalance problems. This paper proposes an optimal reconfiguration approach based on mixed integer quadric programming (MIQP) method to address the three-phase unbalance problem. It aims to minimize the total network losses of the system. By using several square constraints to substitute the circular constraint, the original optimization problem is linearized and converted into a mixed-integer linear programming (MILP) model. Then this MILP problem is solved in general algebraic model system (GAMS) software using CPLEX solver. The additional losses caused by three-phase unbalanced are also considered. An IEEE 34 nodes test system is used to demonstrate the feasibility and effectiveness of the proposed method. The results show that the losses and the voltage violation mitigation in the network can be reduced significantly.

  20. A cognitive fault diagnosis system for distributed sensor networks.

    PubMed

    Alippi, Cesare; Ntalampiras, Stavros; Roveri, Manuel

    2013-08-01

    This paper introduces a novel cognitive fault diagnosis system (FDS) for distributed sensor networks that takes advantage of spatial and temporal relationships among sensors. The proposed FDS relies on a suitable functional graph representation of the network and a two-layer hierarchical architecture designed to promptly detect and isolate faults. The lower processing layer exploits a novel change detection test (CDT) based on hidden Markov models (HMMs) configured to detect variations in the relationships between couples of sensors. HMMs work in the parameter space of linear time-invariant dynamic systems, approximating, over time, the relationship between two sensors; changes in the approximating model are detected by inspecting the HMM likelihood. Information provided by the CDT layer is then passed to the cognitive one, which, by exploiting the graph representation of the network, aggregates information to discriminate among faults, changes in the environment, and false positives induced by the model bias of the HMMs.

  1. Global asymptotic stability of Hopfield neural network involving distributed delays.

    PubMed

    Zhao, Hongyong

    2004-01-01

    In the paper, we study dynamical behaviors of Hopfield neural networks system with distributed delays. Some new criteria ensuring the existence and uniqueness, and the global asymptotic stability (GAS) of equilibrium point are derived. In the results, we do not assume that the signal propagation functions satisfy the Lipschitz condition and do not require them to be bounded, differentiable or strictly increasing. Moreover, the symmetry of the connection matrix is not also necessary. Thus, we improve some previous works of other researchers. These conditions are presented in terms of system parameters and have importance leading significance in designs and applications of the GAS for Hopfield neural networks system with distributed delays. Two examples are also worked out to demonstrate the advantages of our results.

  2. Mapping distributed brain function and networks with diffuse optical tomography

    NASA Astrophysics Data System (ADS)

    Eggebrecht, Adam T.; Ferradal, Silvina L.; Robichaux-Viehoever, Amy; Hassanpour, Mahlega S.; Dehghani, Hamid; Snyder, Abraham Z.; Hershey, Tamara; Culver, Joseph P.

    2014-06-01

    Mapping of human brain function has revolutionized systems neuroscience. However, traditional functional neuroimaging by positron emission tomography or functional magnetic resonance imaging cannot be used when applications require portability, or are contraindicated because of ionizing radiation (positron emission tomography) or implanted metal (functional magnetic resonance imaging). Optical neuroimaging offers a non-invasive alternative that is radiation free and compatible with implanted metal and electronic devices (for example, pacemakers). However, optical imaging technology has heretofore lacked the combination of spatial resolution and wide field of view sufficient to map distributed brain functions. Here, we present a high-density diffuse optical tomography imaging array that can map higher-order, distributed brain function. The system was tested by imaging four hierarchical language tasks and multiple resting-state networks including the dorsal attention and default mode networks. Finally, we imaged brain function in patients with Parkinson's disease and implanted deep brain stimulators that preclude functional magnetic resonance imaging.

  3. Event-triggered output feedback control for distributed networked systems.

    PubMed

    Mahmoud, Magdi S; Sabih, Muhammad; Elshafei, Moustafa

    2016-01-01

    This paper addresses the problem of output-feedback communication and control with event-triggered framework in the context of distributed networked control systems. The design problem of the event-triggered output-feedback control is proposed as a linear matrix inequality (LMI) feasibility problem. The scheme is developed for the distributed system where only partial states are available. In this scheme, a subsystem uses local observers and share its information to its neighbors only when the subsystem's local error exceeds a specified threshold. The developed method is illustrated by using a coupled cart example from the literature.

  4. Distributed joint source-channel coding in wireless sensor networks.

    PubMed

    Zhu, Xuqi; Liu, Yu; Zhang, Lin

    2009-01-01

    Considering the fact that sensors are energy-limited and the wireless channel conditions in wireless sensor networks, there is an urgent need for a low-complexity coding method with high compression ratio and noise-resisted features. This paper reviews the progress made in distributed joint source-channel coding which can address this issue. The main existing deployments, from the theory to practice, of distributed joint source-channel coding over the independent channels, the multiple access channels and the broadcast channels are introduced, respectively. To this end, we also present a practical scheme for compressing multiple correlated sources over the independent channels. The simulation results demonstrate the desired efficiency.

  5. Distributed Signal Processing for Wireless EEG Sensor Networks.

    PubMed

    Bertrand, Alexander

    2015-11-01

    Inspired by ongoing evolutions in the field of wireless body area networks (WBANs), this tutorial paper presents a conceptual and exploratory study of wireless electroencephalography (EEG) sensor networks (WESNs), with an emphasis on distributed signal processing aspects. A WESN is conceived as a modular neuromonitoring platform for high-density EEG recordings, in which each node is equipped with an electrode array, a signal processing unit, and facilities for wireless communication. We first address the advantages of such a modular approach, and we explain how distributed signal processing algorithms make WESNs more power-efficient, in particular by avoiding data centralization. We provide an overview of distributed signal processing algorithms that are potentially applicable in WESNs, and for illustration purposes, we also provide a more detailed case study of a distributed eye blink artifact removal algorithm. Finally, we study the power efficiency of these distributed algorithms in comparison to their centralized counterparts in which all the raw sensor signals are centralized in a near-end or far-end fusion center.

  6. Functional brain networks develop from a "local to distributed" organization.

    PubMed

    Fair, Damien A; Cohen, Alexander L; Power, Jonathan D; Dosenbach, Nico U F; Church, Jessica A; Miezin, Francis M; Schlaggar, Bradley L; Petersen, Steven E

    2009-05-01

    The mature human brain is organized into a collection of specialized functional networks that flexibly interact to support various cognitive functions. Studies of development often attempt to identify the organizing principles that guide the maturation of these functional networks. In this report, we combine resting state functional connectivity MRI (rs-fcMRI), graph analysis, community detection, and spring-embedding visualization techniques to analyze four separate networks defined in earlier studies. As we have previously reported, we find, across development, a trend toward 'segregation' (a general decrease in correlation strength) between regions close in anatomical space and 'integration' (an increased correlation strength) between selected regions distant in space. The generalization of these earlier trends across multiple networks suggests that this is a general developmental principle for changes in functional connectivity that would extend to large-scale graph theoretic analyses of large-scale brain networks. Communities in children are predominantly arranged by anatomical proximity, while communities in adults predominantly reflect functional relationships, as defined from adult fMRI studies. In sum, over development, the organization of multiple functional networks shifts from a local anatomical emphasis in children to a more "distributed" architecture in young adults. We argue that this "local to distributed" developmental characterization has important implications for understanding the development of neural systems underlying cognition. Further, graph metrics (e.g., clustering coefficients and average path lengths) are similar in child and adult graphs, with both showing "small-world"-like properties, while community detection by modularity optimization reveals stable communities within the graphs that are clearly different between young children and young adults. These observations suggest that early school age children and adults both have

  7. A Network Scheduling Model for Distributed Control Simulation

    NASA Technical Reports Server (NTRS)

    Culley, Dennis; Thomas, George; Aretskin-Hariton, Eliot

    2016-01-01

    Distributed engine control is a hardware technology that radically alters the architecture for aircraft engine control systems. Of its own accord, it does not change the function of control, rather it seeks to address the implementation issues for weight-constrained vehicles that can limit overall system performance and increase life-cycle cost. However, an inherent feature of this technology, digital communication networks, alters the flow of information between critical elements of the closed-loop control. Whereas control information has been available continuously in conventional centralized control architectures through virtue of analog signaling, moving forward, it will be transmitted digitally in serial fashion over the network(s) in distributed control architectures. An underlying effect is that all of the control information arrives asynchronously and may not be available every loop interval of the controller, therefore it must be scheduled. This paper proposes a methodology for modeling the nominal data flow over these networks and examines the resulting impact for an aero turbine engine system simulation.

  8. Decentralized Dimensionality Reduction for Distributed Tensor Data Across Sensor Networks.

    PubMed

    Liang, Junli; Yu, Guoyang; Chen, Badong; Zhao, Minghua

    2016-11-01

    This paper develops a novel decentralized dimensionality reduction algorithm for the distributed tensor data across sensor networks. The main contributions of this paper are as follows. First, conventional centralized methods, which utilize entire data to simultaneously determine all the vectors of the projection matrix along each tensor mode, are not suitable for the network environment. Here, we relax the simultaneous processing manner into the one-vector-by-one-vector (OVBOV) manner, i.e., determining the projection vectors (PVs) related to each tensor mode one by one. Second, we prove that in the OVBOV manner each PV can be determined without modifying any tensor data, which simplifies corresponding computations. Third, we cast the decentralized PV determination problem as a set of subproblems with consensus constraints, so that it can be solved in the network environment only by local computations and information communications among neighboring nodes. Fourth, we introduce the null space and transform the PV determination problem with complex orthogonality constraints into an equivalent hidden convex one without any orthogonality constraint, which can be solved by the Lagrange multiplier method. Finally, experimental results are given to show that the proposed algorithm is an effective dimensionality reduction scheme for the distributed tensor data across the sensor networks.

  9. Process and Data Management in a Reconfigurable Distributed Network.

    DTIC Science & Technology

    1984-10-15

    INTELIGENT CONTROL IN LOCAL DISTRIBUTED ENVIRONMENT 8.1. Introduction Both database (DB) and artificial intelligence (Al) systems must represent and...discussed in Chapter 7. Finally, we are also interested in the application of both Artificial Intelligence and Database technologies to a dynamic network...research shows that under some restricted types of failures, and making some assumptions about the behaviour of the processors and the communication medium

  10. Relaxation of Distributed Data Aggregation for Underwater Acoustic Sensor Networks

    DTIC Science & Technology

    2014-03-31

    Acoustic Sensor Networks Contract Report # AMBUSH.1.2 Contract # W7707-145675 M. Rabbat, M. Coates McGill University ( Montreal , QC, Canada) Fiscal...challenging. Chan- nel conditions change rapidly and high data-rate communications are generally not possi- ble. Consequently, protocols and mechanisms...Üstebay, D., and Coates, M. (2014), Distributed ensemble Kalman filtering, (Technical Report) McGill University, Montreal , Quebec. [8] Evensen, G

  11. Overhead-Performance Tradeoffs in Distributed Wireless Networks

    DTIC Science & Technology

    2015-06-26

    time-frequency resources are spent on non-information bearing control information that is not efficiently encoded. Three simple resource controllers...poorly encoded non-information bearing resource measurement and control signals. This enabled the investigators to make a strong case for studying the...between the overhead an optimized distributed wireless network controller collects and the performance on the data- bearing signals it achieves: the more

  12. Distributed Immune Systems for Wireless Network Information Assurance

    DTIC Science & Technology

    2010-04-26

    Network Information Assurance Report Title ABSTRACT The research program focused on developing innovative distributed methods and algorithms that take...our work we completed the development and evaluation of such algorithms. In our research we focused on the fact that the self propagating code will...against adaptive adversaries. In an effort to make this evaluation framework accessible to other researchers , we started the development of a software

  13. Degree distribution, rank-size distribution, and leadership persistence in mediation-driven attachment networks

    NASA Astrophysics Data System (ADS)

    Hassan, Md. Kamrul; Islam, Liana; Haque, Syed Arefinul

    2017-03-01

    We investigate the growth of a class of networks in which a new node first picks a mediator at random and connects with m randomly chosen neighbors of the mediator at each time step. We show that the degree distribution in such a mediation-driven attachment (MDA) network exhibits power-law P(k) ∼k - γ(m) with a spectrum of exponents depending on m. To appreciate the contrast between MDA and Barabási-Albert (BA) networks, we then discuss their rank-size distribution. To quantify how long a leader, the node with the maximum degree, persists in its leadership as the network evolves, we investigate the leadership persistence probability F(τ) i.e. the probability that a leader retains its leadership up to time τ. We find that it exhibits a power-law F(τ) ∼τ - θ(m) with persistence exponent θ(m) ≈ 1.51 ∀ m in MDA networks and θ(m) → 1.53 exponentially with m in BA networks.

  14. Automatic analysis of attack data from distributed honeypot network

    NASA Astrophysics Data System (ADS)

    Safarik, Jakub; Voznak, MIroslav; Rezac, Filip; Partila, Pavol; Tomala, Karel

    2013-05-01

    There are many ways of getting real data about malicious activity in a network. One of them relies on masquerading monitoring servers as a production one. These servers are called honeypots and data about attacks on them brings us valuable information about actual attacks and techniques used by hackers. The article describes distributed topology of honeypots, which was developed with a strong orientation on monitoring of IP telephony traffic. IP telephony servers can be easily exposed to various types of attacks, and without protection, this situation can lead to loss of money and other unpleasant consequences. Using a distributed topology with honeypots placed in different geological locations and networks provides more valuable and independent results. With automatic system of gathering information from all honeypots, it is possible to work with all information on one centralized point. Communication between honeypots and centralized data store use secure SSH tunnels and server communicates only with authorized honeypots. The centralized server also automatically analyses data from each honeypot. Results of this analysis and also other statistical data about malicious activity are simply accessible through a built-in web server. All statistical and analysis reports serve as information basis for an algorithm which classifies different types of used VoIP attacks. The web interface then brings a tool for quick comparison and evaluation of actual attacks in all monitored networks. The article describes both, the honeypots nodes in distributed architecture, which monitor suspicious activity, and also methods and algorithms used on the server side for analysis of gathered data.

  15. Distributed optimal power and rate control in wireless sensor networks.

    PubMed

    Tang, Meiqin; Bai, Jianyong; Li, Jing; Xin, Yalin

    2014-01-01

    With the rapid development of wireless sensor networks, reducing energy consumption is becoming one of the important factors to extend node lifetime, and it is necessary to adjust the launching power of each node because of the limited energy available to the sensor nodes in the networks. This paper proposes a power and rate control model based on the network utility maximization (NUM) framework, where a weighting factor is used to reflect the influence degree of the sending power and transmission rate to the utility function. In real networks, nodes interfere with each other in the procedure of transmitting signal, which may lead to signal transmission failure and may negatively have impacts on networks throughput. Using dual decomposition techniques, the NUM problem is decomposed into two distributed subproblems, and then the conjugate gradient method is applied to solve the optimization problem with the calculation of the Hessian matrix and its inverse in order to guarantee fast convergence of the algorithm. The convergence proof is also provided in this paper. Numerical examples show that the proposed solution achieves significant throughput compared with exiting approaches.

  16. Distributed communications and control network for robotic mining

    NASA Technical Reports Server (NTRS)

    Schiffbauer, William H.

    1989-01-01

    The application of robotics to coal mining machines is one approach pursued to increase productivity while providing enhanced safety for the coal miner. Toward that end, a network composed of microcontrollers, computers, expert systems, real time operating systems, and a variety of program languages are being integrated that will act as the backbone for intelligent machine operation. Actual mining machines, including a few customized ones, have been given telerobotic semiautonomous capabilities by applying the described network. Control devices, intelligent sensors and computers onboard these machines are showing promise of achieving improved mining productivity and safety benefits. Current research using these machines involves navigation, multiple machine interaction, machine diagnostics, mineral detection, and graphical machine representation. Guidance sensors and systems employed include: sonar, laser rangers, gyroscopes, magnetometers, clinometers, and accelerometers. Information on the network of hardware/software and its implementation on mining machines are presented. Anticipated coal production operations using the network are discussed. A parallelism is also drawn between the direction of present day underground coal mining research to how the lunar soil (regolith) may be mined. A conceptual lunar mining operation that employs a distributed communication and control network is detailed.

  17. Distributed Optimal Power and Rate Control in Wireless Sensor Networks

    PubMed Central

    Tang, Meiqin; Bai, Jianyong; Li, Jing; Xin, Yalin

    2014-01-01

    With the rapid development of wireless sensor networks, reducing energy consumption is becoming one of the important factors to extend node lifetime, and it is necessary to adjust the launching power of each node because of the limited energy available to the sensor nodes in the networks. This paper proposes a power and rate control model based on the network utility maximization (NUM) framework, where a weighting factor is used to reflect the influence degree of the sending power and transmission rate to the utility function. In real networks, nodes interfere with each other in the procedure of transmitting signal, which may lead to signal transmission failure and may negatively have impacts on networks throughput. Using dual decomposition techniques, the NUM problem is decomposed into two distributed subproblems, and then the conjugate gradient method is applied to solve the optimization problem with the calculation of the Hessian matrix and its inverse in order to guarantee fast convergence of the algorithm. The convergence proof is also provided in this paper. Numerical examples show that the proposed solution achieves significant throughput compared with exiting approaches. PMID:24895654

  18. A distributed geo-routing algorithm for wireless sensor networks.

    PubMed

    Joshi, Gyanendra Prasad; Kim, Sung Won

    2009-01-01

    Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.

  19. Distributed synchronization control of complex networks with communication constraints.

    PubMed

    Xu, Zhenhua; Zhang, Dan; Song, Hongbo

    2016-11-01

    This paper is concerned with the distributed synchronization control of complex networks with communication constraints. In this work, the controllers communicate with each other through the wireless network, acting as a controller network. Due to the constrained transmission power, techniques such as the packet size reduction and transmission rate reduction schemes are proposed which could help reduce communication load of the controller network. The packet dropout problem is also considered in the controller design since it is often encountered in networked control systems. We show that the closed-loop system can be modeled as a switched system with uncertainties and random variables. By resorting to the switched system approach and some stochastic system analysis method, a new sufficient condition is firstly proposed such that the exponential synchronization is guaranteed in the mean-square sense. The controller gains are determined by using the well-known cone complementarity linearization (CCL) algorithm. Finally, a simulation study is performed, which demonstrates the effectiveness of the proposed design algorithm.

  20. Biological instability in a chlorinated drinking water distribution network.

    PubMed

    Nescerecka, Alina; Rubulis, Janis; Vital, Marius; Juhna, Talis; Hammes, Frederik

    2014-01-01

    The purpose of a drinking water distribution system is to deliver drinking water to the consumer, preferably with the same quality as when it left the treatment plant. In this context, the maintenance of good microbiological quality is often referred to as biological stability, and the addition of sufficient chlorine residuals is regarded as one way to achieve this. The full-scale drinking water distribution system of Riga (Latvia) was investigated with respect to biological stability in chlorinated drinking water. Flow cytometric (FCM) intact cell concentrations, intracellular adenosine tri-phosphate (ATP), heterotrophic plate counts and residual chlorine measurements were performed to evaluate the drinking water quality and stability at 49 sampling points throughout the distribution network. Cell viability methods were compared and the importance of extracellular ATP measurements was examined as well. FCM intact cell concentrations varied from 5×10(3) cells mL(-1) to 4.66×10(5) cells mL(-1) in the network. While this parameter did not exceed 2.1×10(4) cells mL(-1) in the effluent from any water treatment plant, 50% of all the network samples contained more than 1.06×10(5) cells mL(-1). This indisputably demonstrates biological instability in this particular drinking water distribution system, which was ascribed to a loss of disinfectant residuals and concomitant bacterial growth. The study highlights the potential of using cultivation-independent methods for the assessment of chlorinated water samples. In addition, it underlines the complexity of full-scale drinking water distribution systems, and the resulting challenges to establish the causes of biological instability.

  1. Distributed game-theoretic topology control in cognitive networks

    NASA Astrophysics Data System (ADS)

    van den Berg, Eric; Fecko, Mariusz A.; Samtani, Sunil; Lacatus, Catalin; Patel, Mitesh

    2010-04-01

    Existing distributed approaches to topology control are poor at exploiting the large configuration space of cognitive radios and use extensive inter-node synchronization to aim at optimality. We have created a framework to design and study distributed topology control algorithms that combine network-formation games with machine learning. In our approach, carefully designed incentive mechanisms drive distributed autonomous agents towards a pre-determined system-wide optimum. The algorithms rely on game players to pursue selfish actions through low-complexity greedy algorithms with low or no signaling overhead. Convergence and stability are ensured through proper mechanism design that eliminates infinite adaptation process. The framework also includes game-theoretic extensions to influence behavior such as fragment merging and preferring links to weakly connected neighbors. Learning allows adaptations that prevent node starvation, reduce link flapping, and minimize routing disruptions by incorporating network layer feedback in cost/utility tradeoffs. The algorithms are implemented in Telcordia Wireless IP Scalable Network Emulator. Using greedy utility maximization as a benchmark, we show improvements of 13-40% for metrics such as the numbers of disconnected fragments and weakly connected nodes, topology stability, and disruption to user flows. The proposed framework is particularly suitable to cognitive radio networks because it can be extended to handle heterogeneous users with different utility functions and conflicting objectives. Desired outcome is then achieved by application of standard cooperation techniques such as utility transfer (payments). Additional cross-layer optimizations are possible by playing games at multiple layers in a highly scalable manner.

  2. Scalable Optimization Methods for Distribution Networks With High PV Integration

    SciTech Connect

    Guggilam, Swaroop S.; Dall'Anese, Emiliano; Chen, Yu Christine; Dhople, Sairaj V.; Giannakis, Georgios B.

    2016-07-01

    This paper proposes a suite of algorithms to determine the active- and reactive-power setpoints for photovoltaic (PV) inverters in distribution networks. The objective is to optimize the operation of the distribution feeder according to a variety of performance objectives and ensure voltage regulation. In general, these algorithms take a form of the widely studied ac optimal power flow (OPF) problem. For the envisioned application domain, nonlinear power-flow constraints render pertinent OPF problems nonconvex and computationally intensive for large systems. To address these concerns, we formulate a quadratic constrained quadratic program (QCQP) by leveraging a linear approximation of the algebraic power-flow equations. Furthermore, simplification from QCQP to a linearly constrained quadratic program is provided under certain conditions. The merits of the proposed approach are demonstrated with simulation results that utilize realistic PV-generation and load-profile data for illustrative distribution-system test feeders.

  3. Application of neural networks to the dynamic spatial distribution of nodes within an urban wireless network

    NASA Astrophysics Data System (ADS)

    Hortos, William S.

    1995-04-01

    The optimal location of wireless transceivers or communicating sensor devices in an urban area and within large human-made structures is considered. The purpose of the positioning of the devices is formation of a distributed network, either in a mesh or hub-spoke topology, that achieves robust connectivity of the nodes. Real-world examples include wireless local area networks (LANs) within buildings and radio beacons in an outdoor mobile radio environment. Operating environments contain both fixed and moving interferers that correspond to both stationary and time-varying spatial distributions of path distortion of stationary and transient fading and multipath delays that impede connectivity. The positioning of the autonomous wireless devices in an area with an unknown spatial pattern of interferers would normally be a slow incremental process. The proposed objective is determination of the spatial distribution of the devices to achieve the maximum radio connectivity in a minimal number of iterative steps. Impeding the optimal distribution of wireless nodes is the corresponding distribution of environmental interferers in the area or volume of network operation. The problem of network formation is posed as an adaptive learning problem, in particular, a self-organizing map of locally competitive wireless units that recursively update their positions and individual operating configurations at each iterative step of the neural algorithm. The scheme allows the wireless units to adaptively learn the pattern distribution of interferers in their operating environment based on the level of radio interference measured at each node by an equivalent received signal strength from wireless units within the node's hearing distance. Two cases are considered. The first is an indoor human-made environment where the interference pattern is largely deterministic and stationary and the units are positioned to form a wireless LAN. The second situation applies to an outdoor urban

  4. Patch Network for Power Allocation and Distribution in Smart Materials

    NASA Technical Reports Server (NTRS)

    Golembiewski, Walter T.

    2000-01-01

    The power allocation and distribution (PAD) circuitry is capable of allocating and distributing a single or multiple sources of power over multi-elements of a power user grid system. The purpose of this invention is to allocate and distribute power that is collected by individual patch rectennas to a region of specific power-user devices, such as actuators. The patch rectenna converts microwave power into DC power. Then this DC power is used to drive actuator devices. However, the power from patch rectennas is not sufficient to drive actuators unless all the collected power is effectively used to drive another group by allocation and distribution. The power allocation and distribution (PAD) circuitry solves the shortfall of power for devices in a large array. The PAD concept is based on the networked power control in which power collected over the whole array of rectennas is allocated to a sub domain where a group of devices is required to be activated for operation. Then the allocated power is distributed to individual element of power-devices in the sub domain according to a selected run-mode.

  5. Distributed System Intruder Tools, Trinoo and Tribe Flood Network

    SciTech Connect

    Criscuolo, P.J.; Rathbun, T

    1999-12-21

    Trinoo and Tribe Flood Network (TFN) are new forms of denial of Service (DOS) attacks. attacks are designed to bring down a computer or network by overloading it with a large amount of network traffic using TCP, UDP, or ICMP. In the past, these attacks came from a single location and were easy to detect. Trinoo and TFN are distributed system intruder tools. These tools launch DoS attacks from multiple computer systems at a target system simultaneously. This makes the assault hard to detect and almost impossible to track to the original attacker. Because these attacks can be launched from hundreds of computers under the command of a single attacker, they are far more dangerous than any DoS attack launched from a single location. These distributed tools have only been seen on Solaris and Linux machines, but there is no reason why they could not be modified for UNIX machines. The target system can also be of any type because the attack is based on the TCP/IP architecture, not a flaw in any particular operating system (OS). CIAC considers the risks presented by these DoS tools to be high.

  6. Distributed Principal Component Analysis for Wireless Sensor Networks

    PubMed Central

    Le Borgne, Yann-Aël; Raybaud, Sylvain; Bontempi, Gianluca

    2008-01-01

    The Principal Component Analysis (PCA) is a data dimensionality reduction tech-nique well-suited for processing data from sensor networks. It can be applied to tasks like compression, event detection, and event recognition. This technique is based on a linear trans-form where the sensor measurements are projected on a set of principal components. When sensor measurements are correlated, a small set of principal components can explain most of the measurements variability. This allows to significantly decrease the amount of radio communication and of energy consumption. In this paper, we show that the power iteration method can be distributed in a sensor network in order to compute an approximation of the principal components. The proposed implementation relies on an aggregation service, which has recently been shown to provide a suitable framework for distributing the computation of a linear transform within a sensor network. We also extend this previous work by providing a detailed analysis of the computational, memory, and communication costs involved. A com-pression experiment involving real data validates the algorithm and illustrates the tradeoffs between accuracy and communication costs. PMID:27873788

  7. Assessing mechanical vulnerability in water distribution networks under multiple failures

    NASA Astrophysics Data System (ADS)

    Berardi, Luigi; Ugarelli, Rita; Røstum, Jon; Giustolisi, Orazio

    2014-03-01

    Understanding mechanical vulnerability of water distribution networks (WDN) is of direct relevance for water utilities since it entails two different purposes. On the one hand, it might support the identification of severe failure scenarios due to external causes (e.g., natural or intentional events) which result into the most critical consequences on WDN supply capacity. On the other hand, it aims at figure out the WDN portions which are more prone to be affected by asset disruptions. The complexity of such analysis stems from the number of possible scenarios with single and multiple simultaneous shutdowns of asset elements leading to modifications of network topology and insufficient water supply to customers. In this work, the search for the most disruptive combinations of multiple asset failure events is formulated and solved as a multiobjective optimization problem. The higher vulnerability failure scenarios are detected as those causing the lower supplied demand due to the lower number of simultaneous failures. The automatic detection of WDN topology, subsequent to the detachments of failed elements, is combined with pressure-driven analysis. The methodology is demonstrated on a real water distribution network. Results show that, besides the failures causing the detachment of reservoirs, tanks, or pumps, there are other different topological modifications which may cause severe WDN service disruptions. Such information is of direct relevance to support planning asset enhancement works and improve the preparedness to extreme events.

  8. DataONE: A Distributed Earth Science Data Network

    NASA Astrophysics Data System (ADS)

    Cook, R. B.; DataONE Leadership Team

    2011-12-01

    Addressing the Earth's environmental problems requires that we change the ways that we harness existing data and develop new methods to combine, analyze, and visualize diverse data resources. DataONE (Observation Network for Earth) represents a virtual organization whose goal is to enable new science and knowledge creation through universal access to data about life on Earth and the environment that sustains it. DataONE is designed to be the foundation of innovative environmental science through a distributed framework and sustainable cyberinfrastructure that meets the needs of science and society for open, persistent, robust, and secure access to easily discovered Earth observational data. DataONE is interdisciplinary, making disparate biological and environmental data available and engaging scientists, land-managers, policy makers, students, educators, and the public through logical access and intuitive visualizations. The foundation of DataONE is the established collaboration among participating organizations that have multi-decadal expertise in a wide range of fields that includes: existing archive initiatives, libraries, environmental observing systems and research networks, data and information management, science synthesis centers, and professional societies. Most importantly, DataONE will serve a broad range of science domains both directly and through the interoperability with the DataONE distributed network.

  9. A Multi Agent-Based Framework for Simulating Household PHEV Distribution and Electric Distribution Network Impact

    SciTech Connect

    Cui, Xiaohui; Liu, Cheng; Kim, Hoe Kyoung; Kao, Shih-Chieh; Tuttle, Mark A; Bhaduri, Budhendra L

    2011-01-01

    The variation of household attributes such as income, travel distance, age, household member, and education for different residential areas may generate different market penetration rates for plug-in hybrid electric vehicle (PHEV). Residential areas with higher PHEV ownership could increase peak electric demand locally and require utilities to upgrade the electric distribution infrastructure even though the capacity of the regional power grid is under-utilized. Estimating the future PHEV ownership distribution at the residential household level can help us understand the impact of PHEV fleet on power line congestion, transformer overload and other unforeseen problems at the local residential distribution network level. It can also help utilities manage the timing of recharging demand to maximize load factors and utilization of existing distribution resources. This paper presents a multi agent-based simulation framework for 1) modeling spatial distribution of PHEV ownership at local residential household level, 2) discovering PHEV hot zones where PHEV ownership may quickly increase in the near future, and 3) estimating the impacts of the increasing PHEV ownership on the local electric distribution network with different charging strategies. In this paper, we use Knox County, TN as a case study to show the simulation results of the agent-based model (ABM) framework. However, the framework can be easily applied to other local areas in the US.

  10. Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation

    PubMed Central

    Du, Tingsong; Hu, Yang; Ke, Xianting

    2015-01-01

    An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA. PMID:26447713

  11. Impact tolerance in mussel thread networks by heterogeneous material distribution

    NASA Astrophysics Data System (ADS)

    Qin, Zhao; Buehler, Markus J.

    2013-07-01

    The Mytilidae, generally known as marine mussels, are known to attach to most substrates including stone, wood, concrete and iron by using a network of byssus threads. Mussels are subjected to severe mechanical impacts caused by waves. However, how the network of byssus threads keeps the mussel attached in this challenging mechanical environment is puzzling, as the dynamical forces far exceed the measured strength of byssus threads and their attachment to the environment. Here we combine experiment and simulation, and show that the heterogeneous material distribution in byssus threads has a critical role in decreasing the effect of impact loading. We find that a combination of stiff and soft materials at an 80:20 ratio enables mussels to rapidly and effectively dissipate impact energy. Notably, this facilitates a significantly enhanced strength under dynamical loading over 900% that of the strength under static loading.

  12. Impact tolerance in mussel thread networks by heterogeneous material distribution.

    PubMed

    Qin, Zhao; Buehler, Markus J

    2013-01-01

    The Mytilidae, generally known as marine mussels, are known to attach to most substrates including stone, wood, concrete and iron by using a network of byssus threads. Mussels are subjected to severe mechanical impacts caused by waves. However, how the network of byssus threads keeps the mussel attached in this challenging mechanical environment is puzzling, as the dynamical forces far exceed the measured strength of byssus threads and their attachment to the environment. Here we combine experiment and simulation, and show that the heterogeneous material distribution in byssus threads has a critical role in decreasing the effect of impact loading. We find that a combination of stiff and soft materials at an 80:20 ratio enables mussels to rapidly and effectively dissipate impact energy. Notably, this facilitates a significantly enhanced strength under dynamical loading over 900% that of the strength under static loading.

  13. Degree distribution and assortativity in line graphs of complex networks

    NASA Astrophysics Data System (ADS)

    Wang, Xiangrong; Trajanovski, Stojan; Kooij, Robert E.; Van Mieghem, Piet

    2016-03-01

    Topological characteristics of links of complex networks influence the dynamical processes executed on networks triggered by links, such as cascading failures triggered by links in power grids and epidemic spread due to link infection. The line graph transforms links in the original graph into nodes. In this paper, we investigate how graph metrics in the original graph are mapped into those for its line graph. In particular, we study the degree distribution and the assortativity of a graph and its line graph. Specifically, we show, both analytically and numerically, the degree distribution of the line graph of an Erdős-Rényi graph follows the same distribution as its original graph. We derive a formula for the assortativity of line graphs and indicate that the assortativity of a line graph is not linearly related to its original graph. Additionally, line graphs of various graphs, e.g. Erdős-Rényi graphs, scale-free graphs, show positive assortativity. In contrast, we find certain types of trees and non-trees whose line graphs have negative assortativity.

  14. A Rawlsian Approach to Distribute Responsibilities in Networks

    PubMed Central

    2009-01-01

    Due to their non-hierarchical structure, socio-technical networks are prone to the occurrence of the problem of many hands. In the present paper an approach is introduced in which people’s opinions on responsibility are empirically traced. The approach is based on the Rawlsian concept of Wide Reflective Equilibrium (WRE) in which people’s considered judgments on a case are reflectively weighed against moral principles and background theories, ideally leading to a state of equilibrium. Application of the method to a hypothetical case with an artificially constructed network showed that it is possible to uncover the relevant data to assess a consensus amongst people in terms of their individual WRE. It appeared that the moral background theories people endorse are not predictive for their actual distribution of responsibilities but that they indicate ways of reasoning and justifying outcomes. Two ways of ascribing responsibilities were discerned, corresponding to two requirements of a desirable responsibility distribution: fairness and completeness. Applying the method triggered learning effects, both with regard to conceptual clarification and moral considerations, and in the sense that it led to some convergence of opinions. It is recommended to apply the method to a real engineering case in order to see whether this approach leads to an overlapping consensus on a responsibility distribution which is justifiable to all and in which no responsibilities are left unfulfilled, therewith trying to contribute to the solution of the problem of many hands. PMID:19626463

  15. The SECOQC quantum key distribution network in Vienna

    NASA Astrophysics Data System (ADS)

    Peev, M.; Pacher, C.; Alléaume, R.; Barreiro, C.; Bouda, J.; Boxleitner, W.; Debuisschert, T.; Diamanti, E.; Dianati, M.; Dynes, J. F.; Fasel, S.; Fossier, S.; Fürst, M.; Gautier, J.-D.; Gay, O.; Gisin, N.; Grangier, P.; Happe, A.; Hasani, Y.; Hentschel, M.; Hübel, H.; Humer, G.; Länger, T.; Legré, M.; Lieger, R.; Lodewyck, J.; Lorünser, T.; Lütkenhaus, N.; Marhold, A.; Matyus, T.; Maurhart, O.; Monat, L.; Nauerth, S.; Page, J.-B.; Poppe, A.; Querasser, E.; Ribordy, G.; Robyr, S.; Salvail, L.; Sharpe, A. W.; Shields, A. J.; Stucki, D.; Suda, M.; Tamas, C.; Themel, T.; Thew, R. T.; Thoma, Y.; Treiber, A.; Trinkler, P.; Tualle-Brouri, R.; Vannel, F.; Walenta, N.; Weier, H.; Weinfurter, H.; Wimberger, I.; Yuan, Z. L.; Zbinden, H.; Zeilinger, A.

    2009-07-01

    In this paper, we present the quantum key distribution (QKD) network designed and implemented by the European project SEcure COmmunication based on Quantum Cryptography (SECOQC) (2004-2008), unifying the efforts of 41 research and industrial organizations. The paper summarizes the SECOQC approach to QKD networks with a focus on the trusted repeater paradigm. It discusses the architecture and functionality of the SECOQC trusted repeater prototype, which has been put into operation in Vienna in 2008 and publicly demonstrated in the framework of a SECOQC QKD conference held from October 8 to 10, 2008. The demonstration involved one-time pad encrypted telephone communication, a secure (AES encryption protected) video-conference with all deployed nodes and a number of rerouting experiments, highlighting basic mechanisms of the SECOQC network functionality. The paper gives an overview of the eight point-to-point network links in the prototype and their underlying technology: three plug and play systems by id Quantique, a one way weak pulse system from Toshiba Research in the UK, a coherent one-way system by GAP Optique with the participation of id Quantique and the AIT Austrian Institute of Technology (formerly ARCAustrian Research Centers GmbH—ARC is now operating under the new name AIT Austrian Institute of Technology GmbH following a restructuring initiative.), an entangled photons system by the University of Vienna and the AIT, a continuous-variables system by Centre National de la Recherche Scientifique (CNRS) and THALES Research and Technology with the participation of Université Libre de Bruxelles, and a free space link by the Ludwig Maximillians University in Munich connecting two nodes situated in adjacent buildings (line of sight 80 m). The average link length is between 20 and 30 km, the longest link being 83 km. The paper presents the architecture and functionality of the principal networking agent—the SECOQC node module, which enables the authentic

  16. Pattern detection in stream networks: Quantifying spatialvariability in fish distribution

    USGS Publications Warehouse

    Torgersen, Christian E.; Gresswell, Robert E.; Bateman, Doug

    2004-01-01

    Biological and physical properties of rivers and streams are inherently difficult to sample and visualize at the resolution and extent necessary to detect fine-scale distributional patterns over large areas. Satellite imagery and broad-scale fish survey methods are effective for quantifying spatial variability in biological and physical variables over a range of scales in marine environments but are often too coarse in resolution to address conservation needs in inland fisheries management. We present methods for sampling and analyzing multiscale, spatially continuous patterns of stream fishes and physical habitat in small- to medium-size watersheds (500–1000 hectares). Geospatial tools, including geographic information system (GIS) software such as ArcInfo dynamic segmentation and ArcScene 3D analyst modules, were used to display complex biological and physical datasets. These tools also provided spatial referencing information (e.g. Cartesian and route-measure coordinates) necessary for conducting geostatistical analyses of spatial patterns (empirical semivariograms and wavelet analysis) in linear stream networks. Graphical depiction of fish distribution along a one-dimensional longitudinal profile and throughout the stream network (superimposed on a 10-metre digital elevation model) provided the spatial context necessary for describing and interpreting the relationship between landscape pattern and the distribution of coastal cutthroat trout (Oncorhynchus clarki clarki) in western Oregon, U.S.A. The distribution of coastal cutthroat trout was highly autocorrelated and exhibited a spherical semivariogram with a defined nugget, sill, and range. Wavelet analysis of the main-stem longitudinal profile revealed periodicity in trout distribution at three nested spatial scales corresponding ostensibly to landscape disturbances and the spacing of tributary junctions.

  17. Time Synchronization and Distribution Mechanisms for Space Networks

    NASA Technical Reports Server (NTRS)

    Woo, Simon S.; Gao, Jay L.; Clare, Loren P.; Mills, David L.

    2011-01-01

    This work discusses research on the problems of synchronizing and distributing time information between spacecraft based on the Network Time Protocol (NTP), where NTP is a standard time synchronization protocol widely used in the terrestrial network. The Proximity-1 Space Link Interleaved Time Synchronization (PITS) Protocol was designed and developed for synchronizing spacecraft that are in proximity where proximity is less than 100,000 km distant. A particular application is synchronization between a Mars orbiter and rover. Lunar scenarios as well as outer-planet deep space mother-ship-probe missions may also apply. Spacecraft with more accurate time information functions as a time-server, and the other spacecraft functions as a time-client. PITS can be easily integrated and adaptable to the CCSDS Proximity-1 Space Link Protocol with minor modifications. In particular, PITS can take advantage of the timestamping strategy that underlying link layer functionality provides for accurate time offset calculation. The PITS algorithm achieves time synchronization with eight consecutive space network time packet exchanges between two spacecraft. PITS can detect and avoid possible errors from receiving duplicate and out-of-order packets by comparing with the current state variables and timestamps. Further, PITS is able to detect error events and autonomously recover from unexpected events that can possibly occur during the time synchronization and distribution process. This capability achieves an additional level of protocol protection on top of CRC or Error Correction Codes. PITS is a lightweight and efficient protocol, eliminating the needs for explicit frame sequence number and long buffer storage. The PITS protocol is capable of providing time synchronization and distribution services for a more general domain where multiple entities need to achieve time synchronization using a single point-to-point link.

  18. Optimal Voltage Regulation for Unbalanced Distribution Networks Considering Distributed Energy Resources

    SciTech Connect

    Xu, Yan; Tomsovic, Kevin

    2015-01-01

    With increasing penetration of distributed generation in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative quadratic constrained quadratic programming model to minimize voltage deviations and maximize distributed energy resource (DER) active power output in a three phase unbalanced distribution system is developed. The optimization model is based on the linearized sensitivity coefficients between controlled variables (e.g., node voltages) and control variables (e.g., real and reactive power injections of DERs). To avoid the oscillation of solution when it is close to the optimum, a golden search method is introduced to control the step size. Numerical simulations on modified IEEE 13 nodes test feeders show the efficiency of the proposed model. Compared to the results solved by heuristic search (harmony algorithm), the proposed model converges quickly to the global optimum.

  19. Distributed virtual worlds in high-speed networks

    NASA Astrophysics Data System (ADS)

    Schiffner, Norbert

    1998-09-01

    Recent research efforts have concentrated on determining how the distributed workplace can be transformed into a shared virtual environment. Interaction among people and process virtual worlds has to be provided and improved. To enhance the usability of our virtual collaborative environment we integrated a multicast communication environment. With the availability of global information highways, 3D graphical intercontinental collaboration will become a part of our daily work routine. This paper describes the basics of our network infrastructure and the multicast support. As a proof of concept, a virtual world scenario is also presented in this paper.

  20. Integrated Microtransducer and Neural Networks System for Distributed Control

    DTIC Science & Technology

    1997-12-01

    this burden, to Washington Head 0< 5 a \\ ved -0188 cisting data sources, other aspect of this iu neports, 1215 Jefferson L.UHGI.UUII u uiMi uu...Network Systems for Distributed Control 6. AUTHOR(S) Professor Chih-Ming Ho 5 . FUNDING NUMBERS F49620-93-1-0332 7. PERFORMING ORGANIZATION NAME(S...Waltham, Mass. U.S.A. April, 1995. 5 . Joshi, Speyer, J. and Kim, J. "A systems theory approach to the control of transitional flows", Accept by J. of

  1. Simulating the Household Plug-in Hybrid Electric Vehicle Distribution and its Electric Distribution Network Impacts

    SciTech Connect

    Cui, Xiaohui; Kim, Hoe Kyoung; Liu, Cheng; Kao, Shih-Chieh; Bhaduri, Budhendra L

    2012-01-01

    This paper presents a multi agent-based simulation framework for modeling spatial distribution of plug-in hybrid electric vehicle ownership at local residential level, discovering plug-in hybrid electric vehicle hot zones where ownership may quickly increase in the near future, and estimating the impacts of the increasing plug-in hybrid electric vehicle ownership on the local electric distribution network with different charging strategies. We use Knox County, Tennessee as a case study to highlight the simulation results of the agent-based simulation framework.

  2. Distributed communications resource management for tracking and surveillance networks

    NASA Astrophysics Data System (ADS)

    Chong, Edwin K. P.; Brewington, Brian

    2005-09-01

    We present a market-like method for distributed communications resource management in the context of networked tracking and surveillance systems. This method divides communication resources according to the expected utility provided by information of particular types. By formulating the problem as an optimization of the joint utility of information flow rates, the dual of the problem can be understood to provide a price for particular routes. Distributed rate control can be accomplished using primal-dual iteration in combination with communication of these route prices. We extend the previous work on the subject in a few important ways. First, we consider utility functions that are jointly-dependent on flow rates, to properly account for geometric synergy that can occur in sensor fusion problems. Second, we do not require that the rate-update algorithms have explicit knowledge of utility functions. Instead, our update algorithms involve transmitting marginal utility values. We present simulation results to demonstrate the effectiveness of the technique.

  3. Distributed Observer Network (DON), Version 3.0, User's Guide

    NASA Technical Reports Server (NTRS)

    Mazzone, Rebecca A.; Conroy, Michael P.

    2015-01-01

    The Distributed Observer Network (DON) is a data presentation tool developed by the National Aeronautics and Space Administration (NASA) to distribute and publish simulation results. Leveraging the display capabilities inherent in modern gaming technology, DON places users in a fully navigable 3-D environment containing graphical models and allows the users to observe how those models evolve and interact over time in a given scenario. Each scenario is driven with data that has been generated by authoritative NASA simulation tools and exported in accordance with a published data interface specification. This decoupling of the data from the source tool enables DON to faithfully display a simulator's results and ensure that every simulation stakeholder will view the exact same information every time.

  4. ESIM_DSN Web-Enabled Distributed Simulation Network

    NASA Technical Reports Server (NTRS)

    Bedrossian, Nazareth; Novotny, John

    2002-01-01

    In this paper, the eSim(sup DSN) approach to achieve distributed simulation capability using the Internet is presented. With this approach a complete simulation can be assembled from component subsystems that run on different computers. The subsystems interact with each other via the Internet The distributed simulation uses a hub-and-spoke type network topology. It provides the ability to dynamically link simulation subsystem models to different computers as well as the ability to assign a particular model to each computer. A proof-of-concept demonstrator is also presented. The eSim(sup DSN) demonstrator can be accessed at http://www.jsc.draper.com/esim which hosts various examples of Web enabled simulations.

  5. MarketBayes: A distributed, market-based Bayesian network

    SciTech Connect

    Pennock, D.M.

    1996-12-31

    This paper presents initial work on a system called MarketBayes, a computational market economy where distributed agents trade in uncertain propositions. For any Bayesian network, we have defined a corresponding economy of goods, consumers and producers that essentially {open_quotes}computes{close_quotes} the same information. Although our research thus far has only verified the existence of a market structure capable of Bayesian calculations, our hope is that such a system may address a variety of interesting problems of distributed uncertain reasoning. For example, the economic framework should be well suited for belief aggregation, since the bids of numerous agents with varying beliefs, confidence levels and wealth are concisely {open_quotes}summarized{close_quotes} in the going prices of goods.

  6. Distributed Joint Source-Channel Coding in Wireless Sensor Networks

    PubMed Central

    Zhu, Xuqi; Liu, Yu; Zhang, Lin

    2009-01-01

    Considering the fact that sensors are energy-limited and the wireless channel conditions in wireless sensor networks, there is an urgent need for a low-complexity coding method with high compression ratio and noise-resisted features. This paper reviews the progress made in distributed joint source-channel coding which can address this issue. The main existing deployments, from the theory to practice, of distributed joint source-channel coding over the independent channels, the multiple access channels and the broadcast channels are introduced, respectively. To this end, we also present a practical scheme for compressing multiple correlated sources over the independent channels. The simulation results demonstrate the desired efficiency. PMID:22408560

  7. Distributed estimation for adaptive sensor selection in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Mahmoud, Magdi S.; Hassan Hamid, Matasm M.

    2014-05-01

    Wireless sensor networks (WSNs) are usually deployed for monitoring systems with the distributed detection and estimation of sensors. Sensor selection in WSNs is considered for target tracking. A distributed estimation scenario is considered based on the extended information filter. A cost function using the geometrical dilution of precision measure is derived for active sensor selection. A consensus-based estimation method is proposed in this paper for heterogeneous WSNs with two types of sensors. The convergence properties of the proposed estimators are analyzed under time-varying inputs. Accordingly, a new adaptive sensor selection (ASS) algorithm is presented in which the number of active sensors is adaptively determined based on the absolute local innovations vector. Simulation results show that the tracking accuracy of the ASS is comparable to that of the other algorithms.

  8. Voltage management of distribution networks with high penetration of distributed photovoltaic generation sources

    NASA Astrophysics Data System (ADS)

    Alyami, Saeed

    Installation of photovoltaic (PV) units could lead to great challenges to the existing electrical systems. Issues such as voltage rise, protection coordination, islanding detection, harmonics, increased or changed short-circuit levels, etc., need to be carefully addressed before we can see a wide adoption of this environmentally friendly technology. Voltage rise or overvoltage issues are of particular importance to be addressed for deploying more PV systems to distribution networks. This dissertation proposes a comprehensive solution to deal with the voltage violations in distribution networks, from controlling PV power outputs and electricity consumption of smart appliances in real time to optimal placement of PVs at the planning stage. The dissertation is composed of three parts: the literature review, the work that has already been done and the future research tasks. An overview on renewable energy generation and its challenges are given in Chapter 1. The overall literature survey, motivation and the scope of study are also outlined in the chapter. Detailed literature reviews are given in the rest of chapters. The overvoltage and undervoltage phenomena in typical distribution networks with integration of PVs are further explained in Chapter 2. Possible approaches for voltage quality control are also discussed in this chapter, followed by the discussion on the importance of the load management for PHEVs and appliances and its benefits to electric utilities and end users. A new real power capping method is presented in Chapter 3 to prevent overvoltage by adaptively setting the power caps for PV inverters in real time. The proposed method can maintain voltage profiles below a pre-set upper limit while maximizing the PV generation and fairly distributing the real power curtailments among all the PV systems in the network. As a result, each of the PV systems in the network has equal opportunity to generate electricity and shares the responsibility of voltage

  9. River network solution for a distributed hydrological model and applications

    NASA Astrophysics Data System (ADS)

    Jha, Raghunath; Herath, Srikantha; Musiake, Katumi

    2000-02-01

    A simultaneous solution for one-dimensional unsteady flow routing for a network of rivers has been developed, which can be used either with a complete distributed hydrological model, a simple rainfall-runoff model or as a stand alone river routing model. Either dynamic or kinematic solution schemes can be selected to simulate the river flows. The river network is either generated from the Digital Elevation Model (DEM) or directly input to the model. The model can handle any number of upstream channels and computational points. A sparse matrix solution algorithm is used to solve the 2N×2N matrix resulting from N nodes in the network. A submodule generates the initial water depth and discharge at each computational point from equilibrium discharge in the absence of observed initial conditions. The model is applied in three sub-catchments of the Chao Phraya river basin, Thailand, considering three different conditions. The simulated results show good agreement with observed discharges and provide insight to water level fluctuations, especially where tributaries join the main channel.

  10. Distributed user-centric scheduling for visible light communication networks.

    PubMed

    Chen, Lingjiao; Wang, Jiaheng; Zhou, Jiantao; Ng, Derrick Wing Kwan; Schober, Robert; Zhao, Chunming

    2016-07-11

    Visible light communication (VLC) networks, consisting of multiple light-emitting diodes (LEDs) acting as optical access points (APs), can provide low-cost high-rate data transmission to multiple users simultaneously in indoor environments. However, the performance of VLC networks is severely limited by the interference between different users. In this paper, we establish a distributed user-centric scheduling framework based on stable marriage theory, and propose a novel decentralized scheduling method to manage interference by forming flexible amorphous cells for all users. The proposed scheduling method has provable low computational complexity and requires only the exchange of a few 1-bit messages between the APs and the users but not the feedback of the channel state information of the entire network. We further show that the proposed method can achieve both user-wise and system-wise optimality as well as a certain level of fairness. Simulation results indicate that our decentralized user-centric scheduling method outperforms existing centralized approaches in terms of throughput, fairness, and computational complexity.

  11. A Distributed Support Vector Machine Learning Over Wireless Sensor Networks.

    PubMed

    Kim, Woojin; Stanković, Milos S; Johansson, Karl H; Kim, H Jin

    2015-11-01

    This paper is about fully-distributed support vector machine (SVM) learning over wireless sensor networks. With the concept of the geometric SVM, we propose to gossip the set of extreme points of the convex hull of local data set with neighboring nodes. It has the advantages of a simple communication mechanism and finite-time convergence to a common global solution. Furthermore, we analyze the scalability with respect to the amount of exchanged information and convergence time, with a specific emphasis on the small-world phenomenon. First, with the proposed naive convex hull algorithm, the message length remains bounded as the number of nodes increases. Second, by utilizing a small-world network, we have an opportunity to drastically improve the convergence performance with only a small increase in power consumption. These properties offer a great advantage when dealing with a large-scale network. Simulation and experimental results support the feasibility and effectiveness of the proposed gossip-based process and the analysis.

  12. Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

    PubMed Central

    Enayet, Asma; Razzaque, Md. Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

    2014-01-01

    The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works. PMID:25529205

  13. A complex network based model for detecting isolated communities in water distribution networks

    NASA Astrophysics Data System (ADS)

    Sheng, Nan; Jia, Youwei; Xu, Zhao; Ho, Siu-Lau; Wai Kan, Chi

    2013-12-01

    Water distribution network (WDN) is a typical real-world complex network of major infrastructure that plays an important role in human's daily life. In this paper, we explore the formation of isolated communities in WDN based on complex network theory. A graph-algebraic model is proposed to effectively detect the potential communities due to pipeline failures. This model can properly illustrate the connectivity and evolution of WDN during different stages of contingency events, and identify the emerging isolated communities through spectral analysis on Laplacian matrix. A case study on a practical urban WDN in China is conducted, and the consistency between the simulation results and the historical data are reported to showcase the feasibility and effectiveness of the proposed model.

  14. Radiation detection and situation management by distributed sensor networks

    SciTech Connect

    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.

  15. Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network Division

    PubMed Central

    Khan, Wazir Zada; Aalsalem, Mohammed Y.; Saad, N. M.

    2015-01-01

    Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads. PMID:25992913

  16. Distributed clone detection in static wireless sensor networks: random walk with network division.

    PubMed

    Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M

    2015-01-01

    Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

  17. Distribution of mitochondrial nucleoids upon mitochondrial network fragmentation and network reintegration in HEPG2 cells.

    PubMed

    Tauber, Jan; Dlasková, Andrea; Šantorová, Jitka; Smolková, Katarína; Alán, Lukáš; Špaček, Tomáš; Plecitá-Hlavatá, Lydie; Jabůrek, Martin; Ježek, Petr

    2013-03-01

    Mitochondrial DNA (mtDNA) is organized in nucleoids in complex with accessory proteins, proteins of mtDNA replication and gene expression machinery. A robust mtDNA genome is represented by hundreds to thousands of nucleoids in cell mitochondrion. Detailed information is lacking about the dynamics of nucleoid distribution within the mitochondrial network upon physiological and pathological events. Therefore, we used confocal microscopy to study mitochondrial nucleoid redistribution upon mitochondrial fission and following reintegration of the mitochondrial network. Fission was induced by oxidative stress at respiration inhibition by rotenone or upon elimination of the protonmotive force by uncoupling or upon canceling its electrical component, ΔΨ(m), by valinomycin; and by silencing of mitofusin MFN2. Agent withdrawal resulted in concomitant mitochondrial network reintegration. We found two major principal morphological states: (i) a tubular state of the mitochondrial network with equidistant nucleoid spacing, 1.10±0.2 nucleoids per μm, and (ii) a fragmented state of solitary spheroid objects in which several nucleoids were clustered. We rarely observed singular mitochondrial fragments with a single nucleoid inside and very seldom we observed empty fragments. Reintegration of fragments into the mitochondrial network re-established the tubular state with equidistant nucleoid spacing. The two major morphological states coexisted at intermediate stages. These observations suggest that both mitochondrial network fission and reconnection of the disintegrated network are nucleoid-centric, i.e., fission and new mitochondrial tubule formation are initiated around nucleoids. Analyses of combinations of these morphological icons thus provide a basis for a future mitochondrial morphology diagnostics.

  18. Development of Computer-Supported Collaborative Social Networks in a Distributed Learning Community

    ERIC Educational Resources Information Center

    Cho, H.; Lee, J.-S.; Stefanone, M.; Gay, G.

    2005-01-01

    This study examines the formation and change of collaborative learning social networks in a distributed learning community. A social network perspective is employed to understand how collaborative networks evolved over time when 31 distributed learners collaborated on a design project using a computer-mediated communication system during two…

  19. Measurement of the Vertical Distribution of Aerosol by Globally Distributed MP Lidar Network Sites

    NASA Technical Reports Server (NTRS)

    Spinhirne, James; Welton, Judd; Campbell, James; Starr, David OC. (Technical Monitor)

    2001-01-01

    The global distribution of aerosol has an important influence on climate through the scattering and absorption of shortwave radiation and through modification of cloud optical properties. Current satellite and other data already provide a great amount of information on aerosol distribution. However there are critical parameters that can only be obtained by active optical profiling. For aerosol, no passive technique can adequately resolve the height profile of aerosol. The aerosol height distribution is required for any model for aerosol transport and the height resolved radiative heating/cooling effect of aerosol. The Geoscience Laser Altimeter System (GLAS) is an orbital lidar to be launched by 2002. GLAS will provide global measurements of the height distribution of aerosol. The sampling will be limited by nadir only coverage. There is a need for local sites to address sampling, and accuracy factors. Full time measurements of the vertical distribution of aerosol are now being acquired at a number of globally distributed MP (micro pulse) lidar sites. The MP lidar systems provide profiling of all significant cloud and aerosol to the limit of signal attenuation from compact, eye safe instruments. There are currently six sites in operation and over a dozen planned. At all sites there are a complement of passive aerosol and radiation measurements supporting the lidar data. Four of the installations are at Atmospheric Radiation Measurement program sites. The aerosol measurements, retrievals and data products from the network sites will be discussed. The current and planned application of data to supplement satellite aerosol measurements is covered.

  20. Distributed and decentralized state estimation in gas networks as distributed parameter systems.

    PubMed

    Ahmadian Behrooz, Hesam; Boozarjomehry, R Bozorgmehry

    2015-09-01

    In this paper, a framework for distributed and decentralized state estimation in high-pressure and long-distance gas transmission networks (GTNs) is proposed. The non-isothermal model of the plant including mass, momentum and energy balance equations are used to simulate the dynamic behavior. Due to several disadvantages of implementing a centralized Kalman filter for large-scale systems, the continuous/discrete form of extended Kalman filter for distributed and decentralized estimation (DDE) has been extended for these systems. Accordingly, the global model is decomposed into several subsystems, called local models. Some heuristic rules are suggested for system decomposition in gas pipeline networks. In the construction of local models, due to the existence of common states and interconnections among the subsystems, the assimilation and prediction steps of the Kalman filter are modified to take the overlapping and external states into account. However, dynamic Riccati equation for each subsystem is constructed based on the local model, which introduces a maximum error of 5% in the estimated standard deviation of the states in the benchmarks studied in this paper. The performance of the proposed methodology has been shown based on the comparison of its accuracy and computational demands against their counterparts in centralized Kalman filter for two viable benchmarks. In a real life network, it is shown that while the accuracy is not significantly decreased, the real-time factor of the state estimation is increased by a factor of 10.

  1. Multi-scale modularity and motif distributional effect in metabolic networks.

    PubMed

    Gao, Shang; Chen, Alan; Rahmani, Ali; Zeng, Jia; Tan, Mehmet; Alhajj, Reda; Rokne, Jon; Demetrick, Douglas; Wei, Xiaohui

    2016-01-01

    Metabolism is a set of fundamental processes that play important roles in a plethora of biological and medical contexts. It is understood that the topological information of reconstructed metabolic networks, such as modular organization, has crucial implications on biological functions. Recent interpretations of modularity in network settings provide a view of multiple network partitions induced by different resolution parameters. Here we ask the question: How do multiple network partitions affect the organization of metabolic networks? Since network motifs are often interpreted as the super families of evolved units, we further investigate their impact under multiple network partitions and investigate how the distribution of network motifs influences the organization of metabolic networks. We studied Homo sapiens, Saccharomyces cerevisiae and Escherichia coli metabolic networks; we analyzed the relationship between different community structures and motif distribution patterns. Further, we quantified the degree to which motifs participate in the modular organization of metabolic networks.

  2. Voltage Control of Distribution Network with a Large Penetration of Photovoltaic Generations using FACTS Devices

    NASA Astrophysics Data System (ADS)

    Kondo, Taro; Baba, Jumpei; Yokoyama, Akihiko

    In recent years, there is a great deal of interest in distributed generations from viewpoints of environmental problem and energy saving measure. Thus, a lot of distributed generators will be connected to the distribution network in the future. However, increase of distributed generators, which convert natural energy into electric energy, is concerned on their adverse effects on distribution network. Therefore, control of distribution networks using Flexible AC Transmission System (FACTS) devices is considered in order to adjust the voltage profile, and as a result more distributed generations can be installed into the networks. In this paper, four types of FACTS devices, Static Synchronous Compensator (STATCOM), Static Synchronous Series Compensator (SSSC), Unified Power Flow Controller (UPFC) and self-commutated Back-To-Back converter (BTB), are analyzed by comparison of required minimum capacity of the inverters in a residential distribution network with a large penetration of photovoltaic generations.

  3. Re-building distribution networks to assure future microbicide access.

    PubMed

    Forbes, Anna; Engle, Nicole

    2005-01-01

    The first candidate topical microbicides--products designed to reduce women's risk of HIV infection--are now in the final stages of efficacy testing, and, if successful, could start to be available by the end of the decade. Advocates in public health and international development are already discussing how to expedite access to this new technology in countries where it could have the largest public health impact. The World Health Organization (WHO), World Bank, and the European Union support the integration of family planning and HIV programs. Such integration is impeded by U.S. policy, funding restrictions, and reluctance to integrate family planning and HIV/AIDS funding. This article describes how these policies weaken, rather than strengthen, the capacity of distribution networks to play an urgently needed role in microbicide roll-out when the time comes.

  4. A Partially Distributed Intrusion Detection System for Wireless Sensor Networks

    PubMed Central

    Cho, Eung Jun; Hong, Choong Seon; Lee, Sungwon; Jeon, Seokhee

    2013-01-01

    The increasing use of wireless sensor networks, which normally comprise several very small sensor nodes, makes their security an increasingly important issue. They can be practically and efficiently secured using intrusion detection systems. Conventional security mechanisms are not usually applicable due to the sensor nodes having limitations of computational power, memory capacity, and battery power. Therefore, specific security systems should be designed to function under constraints of energy or memory. A partially distributed intrusion detection system with low memory and power demands is proposed here. It employs a Bloom filter, which allows reduced signature code size. Multiple Bloom filters can be combined to reduce the signature code for each Bloom filter array. The mechanism could then cope with potential denial of service attacks, unlike many previous detection systems with Bloom filters. The mechanism was evaluated and validated through analysis and simulation.

  5. Distributed Prognostics and Health Management with a Wireless Network Architecture

    NASA Technical Reports Server (NTRS)

    Goebel, Kai; Saha, Sankalita; Sha, Bhaskar

    2013-01-01

    A heterogeneous set of system components monitored by a varied suite of sensors and a particle-filtering (PF) framework, with the power and the flexibility to adapt to the different diagnostic and prognostic needs, has been developed. Both the diagnostic and prognostic tasks are formulated as a particle-filtering problem in order to explicitly represent and manage uncertainties in state estimation and remaining life estimation. Current state-of-the-art prognostic health management (PHM) systems are mostly centralized in nature, where all the processing is reliant on a single processor. This can lead to a loss in functionality in case of a crash of the central processor or monitor. Furthermore, with increases in the volume of sensor data as well as the complexity of algorithms, traditional centralized systems become for a number of reasons somewhat ungainly for successful deployment, and efficient distributed architectures can be more beneficial. The distributed health management architecture is comprised of a network of smart sensor devices. These devices monitor the health of various subsystems or modules. They perform diagnostics operations and trigger prognostics operations based on user-defined thresholds and rules. The sensor devices, called computing elements (CEs), consist of a sensor, or set of sensors, and a communication device (i.e., a wireless transceiver beside an embedded processing element). The CE runs in either a diagnostic or prognostic operating mode. The diagnostic mode is the default mode where a CE monitors a given subsystem or component through a low-weight diagnostic algorithm. If a CE detects a critical condition during monitoring, it raises a flag. Depending on availability of resources, a networked local cluster of CEs is formed that then carries out prognostics and fault mitigation by efficient distribution of the tasks. It should be noted that the CEs are expected not to suspend their previous tasks in the prognostic mode. When the

  6. Hierarchical Data Distribution Scheme for Peer-to-Peer Networks

    NASA Astrophysics Data System (ADS)

    Bhushan, Shashi; Dave, M.; Patel, R. B.

    2010-11-01

    In the past few years, peer-to-peer (P2P) networks have become an extremely popular mechanism for large-scale content sharing. P2P systems have focused on specific application domains (e.g. music files, video files) or on providing file system like capabilities. P2P is a powerful paradigm, which provides a large-scale and cost-effective mechanism for data sharing. P2P system may be used for storing data globally. Can we implement a conventional database on P2P system? But successful implementation of conventional databases on the P2P systems is yet to be reported. In this paper we have presented the mathematical model for the replication of the partitions and presented a hierarchical based data distribution scheme for the P2P networks. We have also analyzed the resource utilization and throughput of the P2P system with respect to the availability, when a conventional database is implemented over the P2P system with variable query rate. Simulation results show that database partitions placed on the peers with higher availability factor perform better. Degradation index, throughput, resource utilization are the parameters evaluated with respect to the availability factor.

  7. Distributed Sensible Heat Flux Measurements for Wireless Sensor Networks

    NASA Astrophysics Data System (ADS)

    Huwald, H.; Brauchli, T.; Lehning, M.; Higgins, C. W.

    2015-12-01

    The sensible heat flux component of the surface energy balance is typically computed using eddy covariance or two point profile measurements while alternative approaches such as the flux variance method based on convective scaling has been much less explored and applied. Flux variance (FV) certainly has a few limitations and constraints but may be an interesting and competitive method in low-cost and power limited wireless sensor networks (WSN) with the advantage of providing spatio-temporal sensible heat flux over the domain of the network. In a first step, parameters such as sampling frequency, sensor response time, and averaging interval are investigated. Then we explore the applicability and the potential of the FV method for use in WSN in a field experiment. Low-cost sensor systems are tested and compared against reference instruments (3D sonic anemometers) to evaluate the performance and limitations of the sensors as well as the method with respect to the standard calculations. Comparison experiments were carried out at several sites to gauge the flux measurements over different surface types (gravel, grass, water) from the low-cost systems. This study should also serve as an example of spatially distributed sensible heat flux measurements.

  8. Analysis of critical operating conditions for LV distribution networks with microgrids

    NASA Astrophysics Data System (ADS)

    Zehir, M. A.; Batman, A.; Sonmez, M. A.; Font, A.; Tsiamitros, D.; Stimoniaris, D.; Kollatou, T.; Bagriyanik, M.; Ozdemir, A.; Dialynas, E.

    2016-11-01

    Increase in the penetration of Distributed Generation (DG) in distribution networks, raises the risk of voltage limit violations while contributing to line losses. Especially in low voltage (LV) distribution networks (secondary distribution networks), impacts of active power flows on the bus voltages and on the network losses are more dominant. As network operators must meet regulatory limitations, they have to take into account the most critical operating conditions in their systems. In this study, it is aimed to present the impact of the worst operation cases of LV distribution networks comprising microgrids. Simulation studies are performed on a field data-based virtual test-bed. The simulations are repeated for several cases consisting different microgrid points of connection with different network loading and microgrid supply/demand conditions.

  9. Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method

    PubMed Central

    Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng

    2012-01-01

    The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious ‘cliff effect’ may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the ‘cliff effect’ is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected. PMID:23235451

  10. Geosciences Information Network (GIN): A Distributed, Interoperable Data Network for the Geosciences

    NASA Astrophysics Data System (ADS)

    Allison, L.; Gundersen, L. C.; Richard, S. M.; Dickinson, T. L.

    2008-12-01

    A coalition of the state geological surveys (AASG), the U.S. Geological Survey (USGS), and other partners will receive NSF funding over the next 3 years under the INTEROP solicitation to start building a distributed, interoperable data network that will make thousands of data bases from the geological surveys and their partners available, searchable, and interoperable. This Geosciences Information Network (GIN) will focus on both spatial and analytical geologic data collected across the country for the past 150 years. Key components of the proposed network include: 1) catalog systems for data discovery; 2) service definitions that define interfaces for searching catalogs and accessing resources; 3) shared interchange formats to encode information for transmission; 4) data providers that publish information using standardized services defined by the network; and 5) client applications enabled to utilize information resources provided by the network. The GIN will integrate and utilize catalog resources that currently exist or are in development. We are working closely with the USGS National Geologic Map Database and its existing map catalog; with the USGS National Geological and Geophysical Data Preservation project, which is developing a metadata catalog for geoscience information resource discovery; and with the GEON catalog. Existing and emerging extensible mark-up languages such as GeoSciML, ChemML, and Open Geospatial Consortium sensor, observation and measurement MLs will provide the necessary interchange formats. Client application development will be fostered by collaboration with industry partners such as ESRI who's Geology Data Model for ArcGIS software is being designed to be compatible with GIN. The GIN project will focus on development of the remaining aspects of the system including: service definitions, technical assistance to data providers to implement the services and bring content online, and system integration. The Geosciences Information Network

  11. Swarm Based Implementation of a Virtal Distributed Database System in a Sensor Network

    DTIC Science & Technology

    2004-03-01

    SWARM BASED IMPLEMENTATION OF A VIRTUAL DISTRIBUTED DATABASE SYSTEM IN A SENSOR NETWORK THESIS Wen Chian Lee AFIT/GCE/ENG/04-06...AFIT/GCE/ENG/04-06 SWARM BASED IMPLEMENTATION OF A VIRTUAL DISTRIBUTED DATABASE SYSTEM IN A SENSOR NETWORK THESIS...a dynamic ad-hoc sensor network. The distributed database system based on a swarm of UAVs is tested against a set of reconnaissance test suites

  12. A New Linearization Method of Unbalanced Electrical Distribution Networks

    SciTech Connect

    Liu, Guodong; Xu, Yan; Ceylan, Oguzhan; Tomsovic, Kevin

    2014-01-01

    Abstract--- With increasing penetration of distributed generation in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. As DN control and operation strategies are mostly based on the linearized sensitivity coefficients between controlled variables (e.g., node voltages, line currents, power loss) and control variables (e.g., power injections, transformer tap positions), efficient and precise calculation of these sensitivity coefficients, i.e. linearization of DN, is of fundamental importance. In this paper, the derivation of the node voltages and power loss as functions of the nodal power injections and transformers' tap-changers positions is presented, and then solved by a Gauss-Seidel method. Compared to other approaches presented in the literature, the proposed method takes into account different load characteristics (e.g., constant PQ, constant impedance, constant current and any combination of above) of a generic multi-phase unbalanced DN and improves the accuracy of linearization. Numerical simulations on both IEEE 13 and 34 nodes test feeders show the efficiency and accuracy of the proposed method.

  13. Structure Learning and Statistical Estimation in Distribution Networks - Part I

    SciTech Connect

    Deka, Deepjyoti; Backhaus, Scott N.; Chertkov, Michael

    2015-02-13

    Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as those related to demand response, outage detection and management, and improved load-monitoring. In this two part paper, inspired by proliferation of the metering technology, we discuss estimation problems in structurally loopy but operationally radial distribution grids from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. In Part I, the objective is to learn the operational layout of the grid. Part II of this paper presents algorithms that estimate load statistics or line parameters in addition to learning the grid structure. Further, Part II discusses the problem of structure estimation for systems with incomplete measurement sets. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time– which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

  14. Distributed visual-target-surveillance system in wireless sensor networks.

    PubMed

    Wang, Xue; Wang, Sheng; Bi, Daowei

    2009-10-01

    A wireless sensor network (WSN) is a powerful unattended distributed measurement system, which is widely used in target surveillance because of its outstanding performance in distributed sensing and signal processing. This paper introduces a multiview visual-target-surveillance system in WSN, which can autonomously implement target classification and tracking with collaborative online learning and localization. The proposed system is a hybrid system of single-node and multinode fusion. It is constructed on a peer-to-peer (P2P)-based computing paradigm and consists of some simple but feasible methods for target detection and feature extraction. Importantly, a support-vector-machine-based semisupervised learning method is used to achieve online classifier learning with only unlabeled samples. To reduce the energy consumption and increase the accuracy, a novel progressive data-fusion paradigm is proposed for online learning and localization, where a feasible routing method is adopted to implement information transmission with the tradeoff between performance and cost. Experiment results verify that the proposed surveillance system is an effective, energy-efficient, and robust system for real-world application. Furthermore, the P2P-based progressive data-fusion paradigm can improve the energy efficiency and robustness of target surveillance.

  15. Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing

    PubMed Central

    Fujiwara, M.; Waseda, A.; Nojima, R.; Moriai, S.; Ogata, W.; Sasaki, M.

    2016-01-01

    Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir’s (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km). PMID:27363566

  16. Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing.

    PubMed

    Fujiwara, M; Waseda, A; Nojima, R; Moriai, S; Ogata, W; Sasaki, M

    2016-07-01

    Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir's (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km).

  17. Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing

    NASA Astrophysics Data System (ADS)

    Fujiwara, M.; Waseda, A.; Nojima, R.; Moriai, S.; Ogata, W.; Sasaki, M.

    2016-07-01

    Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir’s (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km).

  18. Distributed Denial of Service Tools, Trin00, Tribe Flood Network, Tribe Flood Network 2000 and Stacheldraht.

    SciTech Connect

    Criscuolo, P. J.

    2000-02-14

    One type of attack on computer systems is know as a Denial of Service (DoS) attack. A DoS attack is designed to prevent legitimate users from using a system. Traditional Denial of Service attacks are done by exploiting a buffer overflow, exhausting system resources, or exploiting a system bug that results in a system that is no longer functional. In the summer of 1999, a new breed of attack has been developed called Distributed Denial of Service (DDoS) attack. Several educational and high capacity commercial sites have been affected by these DDoS attacks. A DDoS attack uses multiple machines operating in concert to attack a network or site. There is very little that can be done if you are the target of a DDoS. The nature of these attacks cause so much extra network traffic that it is difficult for legitimate traffic to reach your site while blocking the forged attacking packets. The intent of this paper is to help sites not be involved in a DDoS attack. The first tools developed to perpetrate the DDoS attack were Trin00 and Tribe Flood Network (TFN). They spawned the next generation of tools called Tribe Flood Network 2000 (TFN2K) and Stacheldraht (German for Barb Wire). These DDoS attack tools are designed to bring one or more sites down by flooding the victim with large amounts of network traffic originating at multiple locations and remotely controlled by a single client. This paper discusses how these DDoS tools work, how to detect them, and specific technical information on each individual tool. It is written with the system administrator in mind. It assumes that the reader has basic knowledge of the TCP/IP Protocol.

  19. Enhancements for distributed certificate authority approaches for mobile wireless ad hoc networks.

    SciTech Connect

    Van Leeuwen, Brian P.; Michalski, John T.; Anderson, William Erik

    2003-12-01

    Mobile wireless ad hoc networks that are resistant to adversarial manipulation are necessary for distributed systems used in military and security applications. Critical to the successful operation of these networks, which operate in the presence of adversarial stressors, are robust and efficient information assurance methods. In this report we describe necessary enhancements for a distributed certificate authority (CA) used in secure wireless network architectures. Necessary cryptographic algorithms used in distributed CAs are described and implementation enhancements of these algorithms in mobile wireless ad hoc networks are developed. The enhancements support a network's ability to detect compromised nodes and facilitate distributed CA services. We provide insights to the impacts the enhancements will have on network performance with timing diagrams and preliminary network simulation studies.

  20. Geosciences Information Network (GIN): A modular, distributed, interoperable data network for the geosciences

    NASA Astrophysics Data System (ADS)

    Allison, M.; Gundersen, L. C.; Richard, S. M.; Dickinson, T. L.

    2008-12-01

    A coalition of the state geological surveys (AASG), the U.S. Geological Survey (USGS), and partners will receive NSF funding over 3 years under the INTEROP solicitation to start building the Geoscience Information Network (www.geoinformatics.info/gin) a distributed, interoperable data network. The GIN project will develop standardized services to link existing and in-progress components using a few standards and protocols, and work with data providers to implement these services. The key components of this network are 1) catalog system(s) for data discovery; 2) service definitions for interfaces for searching catalogs and accessing resources; 3) shared interchange formats to encode information for transmission (e.g. various XML markup languages); 4) data providers that publish information using standardized services defined by the network; and 5) client applications adapted to use information resources provided by the network. The GIN will integrate and use catalog resources that currently exist or are in development. We are working with the USGS National Geologic Map Database's existing map catalog, with the USGS National Geological and Geophysical Data Preservation Program, which is developing a metadata catalog (National Digital Catalog) for geoscience information resource discovery, and with the GEON catalog. Existing interchange formats will be used, such as GeoSciML, ChemML, and Open Geospatial Consortium sensor, observation and measurement MLs. Client application development will be fostered by collaboration with industry and academic partners. The GIN project will focus on the remaining aspects of the system -- service definitions and assistance to data providers to implement the services and bring content online - and on system integration of the modules. Initial formal collaborators include the OneGeology-Europe consortium of 27 nations that is building a comparable network under the EU INSPIRE initiative, GEON, Earthchem, and GIS software company ESRI

  1. Spatial Distribution Characteristics of Healthcare Facilities in Nanjing: Network Point Pattern Analysis and Correlation Analysis

    PubMed Central

    Ni, Jianhua; Qian, Tianlu; Xi, Changbai; Rui, Yikang; Wang, Jiechen

    2016-01-01

    The spatial distribution of urban service facilities is largely constrained by the road network. In this study, network point pattern analysis and correlation analysis were used to analyze the relationship between road network and healthcare facility distribution. The weighted network kernel density estimation method proposed in this study identifies significant differences between the outside and inside areas of the Ming city wall. The results of network K-function analysis show that private hospitals are more evenly distributed than public hospitals, and pharmacy stores tend to cluster around hospitals along the road network. After computing the correlation analysis between different categorized hospitals and street centrality, we find that the distribution of these hospitals correlates highly with the street centralities, and that the correlations are higher with private and small hospitals than with public and large hospitals. The comprehensive analysis results could help examine the reasonability of existing urban healthcare facility distribution and optimize the location of new healthcare facilities. PMID:27548197

  2. Spatial Distribution Characteristics of Healthcare Facilities in Nanjing: Network Point Pattern Analysis and Correlation Analysis.

    PubMed

    Ni, Jianhua; Qian, Tianlu; Xi, Changbai; Rui, Yikang; Wang, Jiechen

    2016-08-18

    The spatial distribution of urban service facilities is largely constrained by the road network. In this study, network point pattern analysis and correlation analysis were used to analyze the relationship between road network and healthcare facility distribution. The weighted network kernel density estimation method proposed in this study identifies significant differences between the outside and inside areas of the Ming city wall. The results of network K-function analysis show that private hospitals are more evenly distributed than public hospitals, and pharmacy stores tend to cluster around hospitals along the road network. After computing the correlation analysis between different categorized hospitals and street centrality, we find that the distribution of these hospitals correlates highly with the street centralities, and that the correlations are higher with private and small hospitals than with public and large hospitals. The comprehensive analysis results could help examine the reasonability of existing urban healthcare facility distribution and optimize the location of new healthcare facilities.

  3. An Open Distributed Architecture for Sensor Networks for Risk Management

    PubMed Central

    Douglas, John; Usländer, Thomas; Schimak, Gerald; Esteban, J. Fernando; Denzer, Ralf

    2008-01-01

    , http://www.eu-orchestra.org/) and ‘Sensors Anywhere’ (SANY, http://sany-ip.eu/) are discussed in this article. These projects have developed an open distributed information technology architecture and have implemented web services for the accessing and using data emanating, for example, from sensor networks. These developments are based on existing data and service standards proposed by international organizations. The projects seek to develop the ideals of the EC directive INSPIRE (http://inspire.jrc.it), which was launched in 2001 and whose implementation began this year (2007), into the risk management domain. Thanks to the open nature of the architecture and services being developed within these projects, they can be implemented by any interested party and can be accessed by all potential users. The architecture is based around a service-oriented approach that makes use of Internet-based applications (web services) whose inputs and outputs conform to standards. The benefit of this philosophy is that it is expected to favor the emergence of an operational market for risk management services in Europe, it eliminates the need to replace or radically alter the hundreds of already operational IT systems in Europe (drastically lowering costs for users), and it allows users and stakeholders to achieve interoperability while using the system most adequate to their needs, budgets, culture etc. (i.e. it has flexibility). PMID:27879791

  4. Reduction of chemical reaction networks through delay distributions

    NASA Astrophysics Data System (ADS)

    Barrio, Manuel; Leier, André; Marquez-Lago, Tatiana T.

    2013-03-01

    Accurate modelling and simulation of dynamic cellular events require two main ingredients: an adequate description of key chemical reactions and simulation of such chemical events in reasonable time spans. Quite logically, posing the right model is a crucial step for any endeavour in Computational Biology. However, more often than not, it is the associated computational costs which actually limit our capabilities of representing complex cellular behaviour. In this paper, we propose a methodology aimed at representing chains of chemical reactions by much simpler, reduced models. The abridgement is achieved by generation of model-specific delay distribution functions, consecutively fed to a delay stochastic simulation algorithm. We show how such delay distributions can be analytically described whenever the system is solely composed of consecutive first-order reactions, with or without additional "backward" bypass reactions, yielding an exact reduction. For models including other types of monomolecular reactions (constitutive synthesis, degradation, or "forward" bypass reactions), we discuss why one must adopt a numerical approach for its accurate stochastic representation, and propose two alternatives for this. In these cases, the accuracy depends on the respective numerical sample size. Our model reduction methodology yields significantly lower computational costs while retaining accuracy. Quite naturally, computational costs increase alongside network size and separation of time scales. Thus, we expect our model reduction methodologies to significantly decrease computational costs in these instances. We anticipate the use of delays in model reduction will greatly alleviate some of the current restrictions in simulating large sets of chemical reactions, largely applicable in pharmaceutical and biological research.

  5. A Distributed Network for Social Cognition Enriched for Oxytocin Receptors

    PubMed Central

    Mitre, Mariela; Marlin, Bianca J.; Schiavo, Jennifer K.; Morina, Egzona; Norden, Samantha E.; Hackett, Troy A.; Aoki, Chiye J.

    2016-01-01

    Oxytocin is a neuropeptide important for social behaviors such as maternal care and parent–infant bonding. It is believed that oxytocin receptor signaling in the brain is critical for these behaviors, but it is unknown precisely when and where oxytocin receptors are expressed or which neural circuits are directly sensitive to oxytocin. To overcome this challenge, we generated specific antibodies to the mouse oxytocin receptor and examined receptor expression throughout the brain. We identified a distributed network of female mouse brain regions for maternal behaviors that are especially enriched for oxytocin receptors, including the piriform cortex, the left auditory cortex, and CA2 of the hippocampus. Electron microscopic analysis of the cerebral cortex revealed that oxytocin receptors were mainly expressed at synapses, as well as on axons and glial processes. Functionally, oxytocin transiently reduced synaptic inhibition in multiple brain regions and enabled long-term synaptic plasticity in the auditory cortex. Thus modulation of inhibition may be a general mechanism by which oxytocin can act throughout the brain to regulate parental behaviors and social cognition. SIGNIFICANCE STATEMENT Oxytocin is an important peptide hormone involved in maternal behavior and social cognition, but it has been unclear what elements of neural circuits express oxytocin receptors due to the paucity of suitable antibodies. Here, we developed new antibodies to the mouse oxytocin receptor. Oxytocin receptors were found in discrete brain regions and at cortical synapses for modulating excitatory-inhibitory balance and plasticity. These antibodies should be useful for future studies of oxytocin and social behavior. PMID:26911697

  6. Testing contamination source identification methods for water distribution networks

    DOE PAGES

    Seth, Arpan; Klise, Katherine A.; Siirola, John D.; ...

    2016-04-01

    In the event of contamination in a water distribution network (WDN), source identification (SI) methods that analyze sensor data can be used to identify the source location(s). Knowledge of the source location and characteristics are important to inform contamination control and cleanup operations. Various SI strategies that have been developed by researchers differ in their underlying assumptions and solution techniques. The following manuscript presents a systematic procedure for testing and evaluating SI methods. The performance of these SI methods is affected by various factors including the size of WDN model, measurement error, modeling error, time and number of contaminant injections,more » and time and number of measurements. This paper includes test cases that vary these factors and evaluates three SI methods on the basis of accuracy and specificity. The tests are used to review and compare these different SI methods, highlighting their strengths in handling various identification scenarios. These SI methods and a testing framework that includes the test cases and analysis tools presented in this paper have been integrated into EPA’s Water Security Toolkit (WST), a suite of software tools to help researchers and others in the water industry evaluate and plan various response strategies in case of a contamination incident. Lastly, a set of recommendations are made for users to consider when working with different categories of SI methods.« less

  7. Testing contamination source identification methods for water distribution networks

    SciTech Connect

    Seth, Arpan; Klise, Katherine A.; Siirola, John D.; Haxton, Terranna; Laird, Carl D.

    2016-04-01

    In the event of contamination in a water distribution network (WDN), source identification (SI) methods that analyze sensor data can be used to identify the source location(s). Knowledge of the source location and characteristics are important to inform contamination control and cleanup operations. Various SI strategies that have been developed by researchers differ in their underlying assumptions and solution techniques. The following manuscript presents a systematic procedure for testing and evaluating SI methods. The performance of these SI methods is affected by various factors including the size of WDN model, measurement error, modeling error, time and number of contaminant injections, and time and number of measurements. This paper includes test cases that vary these factors and evaluates three SI methods on the basis of accuracy and specificity. The tests are used to review and compare these different SI methods, highlighting their strengths in handling various identification scenarios. These SI methods and a testing framework that includes the test cases and analysis tools presented in this paper have been integrated into EPA’s Water Security Toolkit (WST), a suite of software tools to help researchers and others in the water industry evaluate and plan various response strategies in case of a contamination incident. Lastly, a set of recommendations are made for users to consider when working with different categories of SI methods.

  8. Distributed reinforcement learning for adaptive and robust network intrusion response

    NASA Astrophysics Data System (ADS)

    Malialis, Kleanthis; Devlin, Sam; Kudenko, Daniel

    2015-07-01

    Distributed denial of service (DDoS) attacks constitute a rapidly evolving threat in the current Internet. Multiagent Router Throttling is a novel approach to defend against DDoS attacks where multiple reinforcement learning agents are installed on a set of routers and learn to rate-limit or throttle traffic towards a victim server. The focus of this paper is on online learning and scalability. We propose an approach that incorporates task decomposition, team rewards and a form of reward shaping called difference rewards. One of the novel characteristics of the proposed system is that it provides a decentralised coordinated response to the DDoS problem, thus being resilient to DDoS attacks themselves. The proposed system learns remarkably fast, thus being suitable for online learning. Furthermore, its scalability is successfully demonstrated in experiments involving 1000 learning agents. We compare our approach against a baseline and a popular state-of-the-art throttling technique from the network security literature and show that the proposed approach is more effective, adaptive to sophisticated attack rate dynamics and robust to agent failures.

  9. Distributed Coding/Decoding Complexity in Video Sensor Networks

    PubMed Central

    Cordeiro, Paulo J.; Assunção, Pedro

    2012-01-01

    Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality. PMID:22736972

  10. A quantum key distribution system for optical fiber networks

    NASA Astrophysics Data System (ADS)

    Hughes, Richard J.; Chapuran, Thomas E.; Dallmann, Nicholas; Hiskett, Philip A.; McCabe, Kevin P.; Montano, Paul M.; Nordholt, Jane E.; Peterson, Charles G.; Runser, Robert J.; Sedillo, Robert; Tyagi, Kush; Wipf, Christopher C.

    2005-08-01

    A novel, user-friendly quantum key distribution (QKD) system operating at a wavelength of 1550nm and at a clock rate of 10MHz was constructed to explore the compatibility of this emerging technology with the optical fiber network environment. Custom circuit boards providing the low-level control and sensing functions for both the transmitter and receiver were developed, allowing software-based system reconfiguration via USB interface to personal computers. The computer control allowed the user to change operating parameters such as detector bias voltages and pulse delays and also allowed for self-tuning of the system. Epitaxx avalanche photodiodes, operated in Geiger mode, were used to detect the single photons. A complete QKD protocol stack incorporating the "sifting", reconciliation, privacy amplification, authentication and key confirmation functions was implemented in software. The system was tested over twenty five kilometers of dark underground fiber, producing 18.6 million sifted bits, with a sifted bit error rate of 4.9% at an average number of photons per pulse of 0.2, during a continuous 12-hour period of self-sustaining operation: a small portion of the secret bits distilled from each session's sifted bits were used to authenticate the next session. A total of 6.8 million shared secret bits were produced.

  11. Organization of network properties of cells in local and distributed neuronal networks of the brain of cats.

    PubMed

    Merzhanova, G Kh; Berg, A I

    1992-01-01

    The network properties of neurons of the visual and motor cortex and of the lateral nucleus of the hypothalamus were investigated on the basis of identified interneuronal interactions, using the cross-correlation method of analysis, in cats with developed alimentary conditioned instrumental reflexes to light. The varied organization of the network properties of cortical neurons in the organization of local and distributed neuronal networks was demonstrated, namely: the predominance of divergent properties over convergent properties for large cells in local networks and the leveling out of these relationships in distributed networks. The neurons of the lateral nucleus of the hypothalamus had an equal representation of convergent and divergent properties in the organization of local and distributed networks. The network properties of neurons of the cortical and subcortical structures were manifested in the background, following the development of conditioned reflexes, and during extinction. Only the small cells of the visual cortex were functionally dependent and changed the relationship of network properties in local networks during the extinction of conditioned reflexes.

  12. Analysis of Road Network Pattern Considering Population Distribution and Central Business District

    PubMed Central

    Zhao, Fangxia; Sun, Huijun; Wu, Jianjun; Gao, Ziyou; Liu, Ronghui

    2016-01-01

    This paper proposes a road network growing model with the consideration of population distribution and central business district (CBD) attraction. In the model, the relative neighborhood graph (RNG) is introduced as the connection mechanism to capture the characteristics of road network topology. The simulation experiment is set up to illustrate the effects of population distribution and CBD attraction on the characteristics of road network. Moreover, several topological attributes of road network is evaluated by using coverage, circuitness, treeness and total length in the experiment. Finally, the suggested model is verified in the simulation of China and Beijing Highway networks. PMID:26981857

  13. Analysis of Road Network Pattern Considering Population Distribution and Central Business District.

    PubMed

    Zhao, Fangxia; Sun, Huijun; Wu, Jianjun; Gao, Ziyou; Liu, Ronghui

    2016-01-01

    This paper proposes a road network growing model with the consideration of population distribution and central business district (CBD) attraction. In the model, the relative neighborhood graph (RNG) is introduced as the connection mechanism to capture the characteristics of road network topology. The simulation experiment is set up to illustrate the effects of population distribution and CBD attraction on the characteristics of road network. Moreover, several topological attributes of road network is evaluated by using coverage, circuitness, treeness and total length in the experiment. Finally, the suggested model is verified in the simulation of China and Beijing Highway networks.

  14. Entropy-based heavy tailed distribution transformation and visual analytics for monitoring massive network traffic

    NASA Astrophysics Data System (ADS)

    Han, Keesook J.; Hodge, Matthew; Ross, Virginia W.

    2011-06-01

    For monitoring network traffic, there is an enormous cost in collecting, storing, and analyzing network traffic datasets. Data mining based network traffic analysis has a growing interest in the cyber security community, but is computationally expensive for finding correlations between attributes in massive network traffic datasets. To lower the cost and reduce computational complexity, it is desirable to perform feasible statistical processing on effective reduced datasets instead of on the original full datasets. Because of the dynamic behavior of network traffic, traffic traces exhibit mixtures of heavy tailed statistical distributions or overdispersion. Heavy tailed network traffic characterization and visualization are important and essential tasks to measure network performance for the Quality of Services. However, heavy tailed distributions are limited in their ability to characterize real-time network traffic due to the difficulty of parameter estimation. The Entropy-Based Heavy Tailed Distribution Transformation (EHTDT) was developed to convert the heavy tailed distribution into a transformed distribution to find the linear approximation. The EHTDT linearization has the advantage of being amenable to characterize and aggregate overdispersion of network traffic in realtime. Results of applying the EHTDT for innovative visual analytics to real network traffic data are presented.

  15. Software-Enabled Distributed Network Governance: The PopMedNet Experience

    PubMed Central

    Davies, Melanie; Erickson, Kyle; Wyner, Zachary; Malenfant, Jessica; Rosen, Rob; Brown, Jeffrey

    2016-01-01

    Introduction: The expanded availability of electronic health information has led to increased interest in distributed health data research networks. Distributed Research Network Model: The distributed research network model leaves data with and under the control of the data holder. Data holders, network coordinating centers, and researchers have distinct needs and challenges within this model. Software Enabled Governance: PopMedNet: The concerns of network stakeholders are addressed in the design and governance models of the PopMedNet software platform. PopMedNet features include distributed querying, customizable workflows, and auditing and search capabilities. Its flexible role-based access control system enables the enforcement of varying governance policies. Selected Case Studies: Four case studies describe how PopMedNet is used to enforce network governance models. Issues and Challenges: Trust is an essential component of a distributed research network and must be built before data partners may be willing to participate further. The complexity of the PopMedNet system must be managed as networks grow and new data, analytic methods, and querying approaches are developed. Conclusions: The PopMedNet software platform supports a variety of network structures, governance models, and research activities through customizable features designed to meet the needs of network stakeholders. PMID:27141522

  16. Distributed Interplanetary Delay/Disruption Tolerant Network (DTN) Monitor and Control System

    NASA Technical Reports Server (NTRS)

    Wang, Shin-Ywan

    2012-01-01

    The main purpose of Distributed interplanetary Delay Tolerant Network Monitor and Control System as a DTN system network management implementation in JPL is defined to provide methods and tools that can monitor the DTN operation status, detect and resolve DTN operation failures in some automated style while either space network or some heterogeneous network is infused with DTN capability. In this paper, "DTN Monitor and Control system in Deep Space Network (DSN)" exemplifies a case how DTN Monitor and Control system can be adapted into a space network as it is DTN enabled.

  17. A decentralized mechanism for improving the functional robustness of distribution networks.

    PubMed

    Shi, Benyun; Liu, Jiming

    2012-10-01

    Most real-world distribution systems can be modeled as distribution networks, where a commodity can flow from source nodes to sink nodes through junction nodes. One of the fundamental characteristics of distribution networks is the functional robustness, which reflects the ability of maintaining its function in the face of internal or external disruptions. In view of the fact that most distribution networks do not have any centralized control mechanisms, we consider the problem of how to improve the functional robustness in a decentralized way. To achieve this goal, we study two important problems: 1) how to formally measure the functional robustness, and 2) how to improve the functional robustness of a network based on the local interaction of its nodes. First, we derive a utility function in terms of network entropy to characterize the functional robustness of a distribution network. Second, we propose a decentralized network pricing mechanism, where each node need only communicate with its distribution neighbors by sending a "price" signal to its upstream neighbors and receiving "price" signals from its downstream neighbors. By doing so, each node can determine its outflows by maximizing its own payoff function. Our mathematical analysis shows that the decentralized pricing mechanism can produce results equivalent to those of an ideal centralized maximization with complete information. Finally, to demonstrate the properties of our mechanism, we carry out a case study on the U.S. natural gas distribution network. The results validate the convergence and effectiveness of our mechanism when comparing it with an existing algorithm.

  18. An Open Distributed Architecture for Sensor Networks for Risk Management.

    PubMed

    Douglas, John; Usländer, Thomas; Schimak, Gerald; Esteban, J Fernando; Denzer, Ralf

    2008-03-13

    ://www.eu-orchestra.org/) and 'Sensors Anywhere'(SANY, http://sany-ip.eu/) are discussed in this article. These projects have developed anopen distributed information technology architecture and have implemented web servicesfor the accessing and using data emanating, for example, from sensor networks. Thesedevelopments are based on existing data and service standards proposed by internationalorganizations. The projects seek to develop the ideals of the EC directive INSPIRE(http://inspire.jrc.it), which was launched in 2001 and whose implementation began this year(2007), into the risk management domain. Thanks to the open nature of the architecture andservices being developed within these projects, they can be implemented by any interestedparty and can be accessed by all potential users. The architecture is based around a serviceorientedapproach that makes use of Internet-based applications (web services) whose inputsand outputs conform to standards. The benefit of this philosophy is that it is expected tofavor the emergence of an operational market for risk management services in Europe, iteliminates the need to replace or radically alter the hundreds of already operational ITsystems in Europe (drastically lowering costs for users), and it allows users and stakeholdersto achieve interoperability while using the system most adequate to their needs, budgets,culture etc. (i.e. it has flexibility).

  19. Growing scale-free networks with tunable distributions of triad motifs

    NASA Astrophysics Data System (ADS)

    Li, Shuguang; Yuan, Jianping; Shi, Yong; Zagal, Juan Cristóbal

    2015-06-01

    Network motifs are local structural patterns and elementary functional units of complex networks in real world, which can have significant impacts on the global behavior of these systems. Many models are able to reproduce complex networks mimicking a series of global features of real systems, however the local features such as motifs in real networks have not been well represented. We propose a model to grow scale-free networks with tunable motif distributions through a combined operation of preferential attachment and triad motif seeding steps. Numerical experiments show that the constructed networks have adjustable distributions of the local triad motifs, meanwhile preserving the global features of power-law distributions of node degree, short average path lengths of nodes, and highly clustered structures.

  20. Research on social communication network evolution based on topology potential distribution

    NASA Astrophysics Data System (ADS)

    Zhao, Dongjie; Jiang, Jian; Li, Deyi; Zhang, Haisu; Chen, Guisheng

    2011-12-01

    Aiming at the problem of social communication network evolution, first, topology potential is introduced to measure the local influence among nodes in networks. Second, from the perspective of topology potential distribution the method of network evolution description based on topology potential distribution is presented, which takes the artificial intelligence with uncertainty as basic theory and local influence among nodes as essentiality. Then, a social communication network is constructed by enron email dataset, the method presented is used to analyze the characteristic of the social communication network evolution and some useful conclusions are got, implying that the method is effective, which shows that topology potential distribution can effectively describe the characteristic of sociology and detect the local changes in social communication network.

  1. Managing Communications with Experts in Geographically Distributed Collaborative Networks

    DTIC Science & Technology

    2009-03-01

    City and has been a staff writer for The New Yorker since 1996. 3 Leonhard Paul Euler , April 15, 1707 – September 18, 1783, was a pioneering Swiss...contributions to their field of expertise, in the 1780s, Leonhard Euler3, who was considered a true pioneer in the field of network science, invented network

  2. Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

    ERIC Educational Resources Information Center

    Yu, Chao

    2013-01-01

    In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

  3. Extracting Hidden Hierarchies in 3D Distribution Networks

    NASA Astrophysics Data System (ADS)

    Modes, Carl; Magnasco, Marcelo; Katifori, Eleni

    2015-03-01

    Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks - the topology and edge weights - determines how efficiently the networks perform their function. Yet, the set of tools that can characterize such a weighted cycle-rich architecture in a physically relevant, mathematically compact way is sparse. In order to fill this void, we have developed a new algorithm that rests on an abstraction of the physical `tiling' in the case of a two dimensional network to an effective tiling of an abstract surface in space that the network may be thought to sit in. Generically these abstract surfaces are richer than the plane and upon sequential removal of the weakest links by edge weight, neighboring tiles merge and a tree characterizing this merging process results. The properties of this characteristic tree can provide the physical and topological data required to describe the architecture of the network and to build physical models. This new algorithm can be used for automated phenotypic characterization of any weighted network whose structure is dominated by cycles, such as mammalian vasculature in the organs, the root networks of clonal colonies like quaking aspen, or the force networks in jammed granular matter.

  4. Neural Network Recognition and Classification of Aerosol Particle Size Distributions

    DTIC Science & Technology

    1990-01-01

    and the ADALINE developed by WVidrow [3]. However, interest in neural network research waned in the 1970s after Minsky and Papert [,4] demonstrated the...Storage in Networks of Adaline Neurons", in Self- Organizing Systems, Yovitz, M.C., Jacobi, G. T. and Goldstein, G. (eds.), Spartan Books, Wash- ington

  5. Distributed Processing System for Restoration of Electric Power Distribution Network Using Two-Layered Contract Net Protocol

    NASA Astrophysics Data System (ADS)

    Kodama, Yu; Hamagami, Tomoki

    Distributed processing system for restoration of electric power distribution network using two-layered CNP is proposed. The goal of this study is to develop the restoration system which adjusts to the future power network with distributed generators. The state of the art of this study is that the two-layered CNP is applied for the distributed computing environment in practical use. The two-layered CNP has two classes of agents, named field agent and operating agent in the network. In order to avoid conflicts of tasks, operating agent controls privilege for managers to send the task announcement messages in CNP. This technique realizes the coordination between agents which work asynchronously in parallel with others. Moreover, this study implements the distributed processing system using a de-fact standard multi-agent framework, JADE(Java Agent DEvelopment framework). This study conducts the simulation experiments of power distribution network restoration and compares the proposed system with the previous system. We confirmed the results show effectiveness of the proposed system.

  6. Distributed Computing Over New Technology Networks: Quality of Service for CORBA Objects.

    DTIC Science & Technology

    1996-10-01

    technology. This was accomplished in four (largely sequential) steps: (1) Study the impact of new technology networks on distributed computing environments...distributed programs such as C3 or collaborative planning applications; (2) Study how Distributed Computing Environments (DCEs) should support QoS in

  7. Extracting Hidden Hierarchies in 3D Distribution Networks

    NASA Astrophysics Data System (ADS)

    Modes, Carl D.; Magnasco, Marcelo O.; Katifori, Eleni

    2016-07-01

    Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function. Yet, the set of tools that can characterize such a weighted cycle-rich architecture in a physically relevant, mathematically compact way is sparse. In order to fill this void, we have developed a new algorithm that rests on an abstraction of the physical "tiling" in the case of a two-dimensional network to an effective tiling of an abstract surface in 3-space that the network may be thought to sit in. Generically, these abstract surfaces are richer than the flat plane because there are now two families of fundamental units that may aggregate upon cutting weakest links—the plaquettes of the tiling and the longer "topological" cycles associated with the abstract surface itself. Upon sequential removal of the weakest links, as determined by a physically relevant edge weight, such as flow volume or capacity, neighboring plaquettes merge and a new tree graph characterizing this merging process results. The properties of this characteristic tree can provide the physical and topological data required to describe the architecture of the network and to build physical models. The new algorithm can be used for automated phenotypic characterization of any weighted network whose structure is dominated by cycles, such as mammalian vasculature in the organs or the force networks in jammed granular matter.

  8. Method and apparatus for reducing the harmonic currents in alternating-current distribution networks

    DOEpatents

    Beverly, Leon H.; Hance, Richard D.; Kristalinski, Alexandr L.; Visser, Age T.

    1996-01-01

    An improved apparatus and method reduce the harmonic content of AC line and neutral line currents in polyphase AC source distribution networks. The apparatus and method employ a polyphase Zig-Zag transformer connected between the AC source distribution network and a load. The apparatus and method also employs a mechanism for increasing the source neutral impedance of the AC source distribution network. This mechanism can consist of a choke installed in the neutral line between the AC source and the Zig-Zag transformer.

  9. Method and apparatus for reducing the harmonic currents in alternating-current distribution networks

    DOEpatents

    Beverly, L.H.; Hance, R.D.; Kristalinski, A.L.; Visser, A.T.

    1996-11-19

    An improved apparatus and method reduce the harmonic content of AC line and neutral line currents in polyphase AC source distribution networks. The apparatus and method employ a polyphase Zig-Zag transformer connected between the AC source distribution network and a load. The apparatus and method also employs a mechanism for increasing the source neutral impedance of the AC source distribution network. This mechanism can consist of a choke installed in the neutral line between the AC source and the Zig-Zag transformer. 23 figs.

  10. Effective Suppression of Pathological Synchronization in Cortical Networks by Highly Heterogeneous Distribution of Inhibitory Connections

    PubMed Central

    Kada, Hisashi; Teramae, Jun-Nosuke; Tokuda, Isao T.

    2016-01-01

    Even without external random input, cortical networks in vivo sustain asynchronous irregular firing with low firing rate. In addition to detailed balance between excitatory and inhibitory activities, recent theoretical studies have revealed that another feature commonly observed in cortical networks, i.e., long-tailed distribution of excitatory synapses implying coexistence of many weak and a few extremely strong excitatory synapses, plays an essential role in realizing the self-sustained activity in recurrent networks of biologically plausible spiking neurons. The previous studies, however, have not considered highly non-random features of the synaptic connectivity, namely, bidirectional connections between cortical neurons are more common than expected by chance and strengths of synapses are positively correlated between pre- and postsynaptic neurons. The positive correlation of synaptic connections may destabilize asynchronous activity of networks with the long-tailed synaptic distribution and induce pathological synchronized firing among neurons. It remains unclear how the cortical network avoids such pathological synchronization. Here, we demonstrate that introduction of the correlated connections indeed gives rise to synchronized firings in a cortical network model with the long-tailed distribution. By using a simplified feed-forward network model of spiking neurons, we clarify the underlying mechanism of the synchronization. We then show that the synchronization can be efficiently suppressed by highly heterogeneous distribution, typically a lognormal distribution, of inhibitory-to-excitatory connection strengths in a recurrent network model of cortical neurons. PMID:27803659

  11. Distributive Computer Networking: Making It Work on a Regional Basis: Effective sharing through a network requires new management and resource distribution techniques.

    PubMed

    Cornew, R W; Morse, P M

    1975-08-15

    After 4 years of operation the NERComP network is now a self-supporting success. Some of the reasons for its success are that (i) the network started small and built up utilization; (ii) the members, through monthly trustee meetings, practiced "participatory management" from the outset; (iii) unlike some networks, NERComP appealed to individual academic and research users who were terminal-oriented and who controlled their own budgets; (iv) the compactness of the New England region made it an ideal laboratory for testing networking concepts; and (v) a dedicated staff was willing to work hard in the face of considerable uncertainty. While the major problems were "political, organizational and economic" (1) we have found that they can be solved if the network meets real needs. We have also found that it is difficult to proceed beyond a certain point without investing responsibility and authority in the networking organization. Conversely, there is a need to distribute some responsibilities such as marketing and user services back to the member institutions. By adopting a modest starting point and achieving limited goals the necessary trust and working relationships between institutions can be built. In our case the necessary planning has been facilitated by recognizing three distinct network functions: governance, user services, and technical operations. Separating out the three essential networing tasks and dealing with each individually through advisory committees, each with its own staff coordinator, has overcome a distracting tendency to address all issues at once. It has also provided an element of feedback between the end user and the supplier not usually present in networking activity. The success of NERComP demonstrates that a distributive-type network can work. Our experiences in New England-which, because of its numerous colleges and universities free from domination by any single institution, is a microcosm for academic computing in the United States

  12. NetWall distributed firewall in the use of campus network

    NASA Astrophysics Data System (ADS)

    He, Junhua; Zhang, Pengshuai

    2011-10-01

    Internet provides a modern means of education but also non-mainstream consciousness and poor dissemination of information opens the door, network and moral issues have become prominent, poor dissemination of information and network spread rumors and negative effects of new problems, ideological and political education in schools had a huge impact, poses a severe challenge. This paper presents a distributed firewall will NetWall deployed in a campus network solution. The characteristics of the campus network, using technology to filter out bad information on the means of control, of sensitive information related to the record, establish a complete information security management platform for the campus network.

  13. Implementation of a tactical voice/data network over FDDI. [Fiber Distributed Data Interface

    NASA Technical Reports Server (NTRS)

    Bergman, L. A.; Halloran, F.; Martinez, J.

    1988-01-01

    An asynchronous high-speed fiber-optic local-area network is described that simultaneously supports packet data traffic with synchronous TI voice traffic over a standard asynchronous FDDI (fiber distributed data interface) token-ring channel. A voice interface module was developed that parses, buffers, and resynchronizes the voice data to the packet network. The technique is general, however, and can be applied to any deterministic class of networks, including multitier backbones. In addition, the higher layer packet data protocols may operate independently of those for the voice, thereby permitting great flexibility in reconfiguring the network. Voice call setup and switching functions are performed external to the network with PABX equipment.

  14. Stationary and uniform entanglement distribution in qubit networks with quasilocal dissipation

    NASA Astrophysics Data System (ADS)

    Rafiee, Morteza; Lupo, Cosmo; Mokhtari, Hossein; Mancini, Stefano

    2012-04-01

    We consider qubit networks where adjacent qubits besides interacting via XY coupling, also dissipate into the same environment. The steady states are computed exactly for all network sizes and topologies, showing that they are always symmetric under permutation of network sites, leading to a uniform distribution of the stationary entanglement across the network. The maximum entanglement between two arbitrary qubits is shown to depend only on the total number of qubits in the network, and scales linearly with it. A possible physical realization by means of an array of doped cavities is discussed for the case of a linear chain.

  15. Distributed learning automata-based algorithm for community detection in complex networks

    NASA Astrophysics Data System (ADS)

    Khomami, Mohammad Mehdi Daliri; Rezvanian, Alireza; Meybodi, Mohammad Reza

    2016-03-01

    Community structure is an important and universal topological property of many complex networks such as social and information networks. The detection of communities of a network is a significant technique for understanding the structure and function of networks. In this paper, we propose an algorithm based on distributed learning automata for community detection (DLACD) in complex networks. In the proposed algorithm, each vertex of network is equipped with a learning automation. According to the cooperation among network of learning automata and updating action probabilities of each automaton, the algorithm interactively tries to identify high-density local communities. The performance of the proposed algorithm is investigated through a number of simulations on popular synthetic and real networks. Experimental results in comparison with popular community detection algorithms such as walk trap, Danon greedy optimization, Fuzzy community detection, Multi-resolution community detection and label propagation demonstrated the superiority of DLACD in terms of modularity, NMI, performance, min-max-cut and coverage.

  16. Interplay between excitability type and distributions of neuronal connectivity determines neuronal network synchronization.

    PubMed

    Mofakham, Sima; Fink, Christian G; Booth, Victoria; Zochowski, Michal R

    2016-10-01

    While the interplay between neuronal excitability properties and global properties of network topology is known to affect network propensity for synchronization, it is not clear how detailed characteristics of these properties affect spatiotemporal pattern formation. Here we study mixed networks, composed of neurons having type I and/or type II phase response curves, with varying distributions of local and random connections and show that not only average network properties, but also the connectivity distribution statistics, significantly affect network synchrony. Namely, we study networks with fixed networkwide properties, but vary the number of random connections that nodes project. We show that varying node excitability (type I vs type II) influences network synchrony most dramatically for systems with long-tailed distributions of the number of random connections per node. This indicates that a cluster of even a few highly rewired cells with a high propensity for synchronization can alter the degree of synchrony in the network as a whole. We show this effect generally on a network of coupled Kuramoto oscillators and investigate the impact of this effect more thoroughly in pulse-coupled networks of biophysical neurons.

  17. Interplay between excitability type and distributions of neuronal connectivity determines neuronal network synchronization

    NASA Astrophysics Data System (ADS)

    Mofakham, Sima; Fink, Christian G.; Booth, Victoria; Zochowski, Michal R.

    2016-10-01

    While the interplay between neuronal excitability properties and global properties of network topology is known to affect network propensity for synchronization, it is not clear how detailed characteristics of these properties affect spatiotemporal pattern formation. Here we study mixed networks, composed of neurons having type I and/or type II phase response curves, with varying distributions of local and random connections and show that not only average network properties, but also the connectivity distribution statistics, significantly affect network synchrony. Namely, we study networks with fixed networkwide properties, but vary the number of random connections that nodes project. We show that varying node excitability (type I vs type II) influences network synchrony most dramatically for systems with long-tailed distributions of the number of random connections per node. This indicates that a cluster of even a few highly rewired cells with a high propensity for synchronization can alter the degree of synchrony in the network as a whole. We show this effect generally on a network of coupled Kuramoto oscillators and investigate the impact of this effect more thoroughly in pulse-coupled networks of biophysical neurons.

  18. Equivalence of coupled networks and networks with multimodal frequency distributions: Conditions for the bimodal and trimodal case

    NASA Astrophysics Data System (ADS)

    Pietras, Bastian; Deschle, Nicolás; Daffertshofer, Andreas

    2016-11-01

    Populations of oscillators can display a variety of synchronization patterns depending on the oscillators' intrinsic coupling and the coupling between them. We consider two coupled symmetric (sub)populations with unimodal frequency distributions. If internal and external coupling strengths are identical, a change of variables transforms the system into a single population of oscillators whose natural frequencies are bimodally distributed. Otherwise an additional bifurcation parameter κ enters the dynamics. By using the Ott-Antonsen ansatz, we rigorously prove that κ does not lead to new bifurcations, but that a symmetric two-coupled-population network and a network with a symmetric bimodal frequency distribution are topologically equivalent. Seeking for generalizations, we further analyze a symmetric trimodal network vis-à-vis three coupled symmetric unimodal populations. Here, however, the equivalence with respect to stability, dynamics, and bifurcations of the two systems no longer holds.

  19. Scaling of nearest neighbors' connectivity distribution for scale-free networks

    NASA Astrophysics Data System (ADS)

    Wei, Zong-Wen; Zhang, Wen-Yao; li, Yu-Jian; Wang, Bing-Hong

    2015-09-01

    Most of real-world networks are called scale-free networks, since the degree distribution follows a power law. However, observing from a node, its nearest neighbors' degree distribution expressed by conditional probability P(k'|k) lacks definite studies and conclusions. Here, we provide a systematic study combined with theoretical and empirical demonstrations, which reveal the inherent connectivity profile of real-world networks. We show that P(k'|k) in the regime k' and k'>k can be approximated by different power laws. One is strongly determined by the degree correlation, and the other depends on both degree distribution and correlation. Based on this result, we propose a degree correlation spectra approach beyond the widely used Pearson correlation coefficient, finding that some networks exhibit sophisticated hybrid correlation patterns. Our results represent a step forward in understanding the structure of complex networks.

  20. Patient Informed Governance of Distributed Research Networks: Results and Discussion from Six Patient Focus Groups

    PubMed Central

    Mamo, Laura A.; Browe, Dennis K.; Logan, Holly C.; Kim, Katherine K.

    2013-01-01

    Understanding how to govern emerging distributed research networks is essential to their success. Distributed research networks aggregate patient medical data from many institutions leaving data within the local provider security system. While much is known about patients’ views on secondary medical research, little is known about their views on governance of research networks. We conducted six focus groups with patients from three medical centers across the U.S. to understand their perspectives on privacy, consent, and ethical concerns of sharing their data as part of research networks. Participants positively endorsed sharing their health data with these networks believing that doing so could advance healthcare knowledge. However, patients expressed several concerns regarding security and broader ethical issues such as commercialism, public benefit, and social responsibility. We suggest that network governance guidelines move beyond strict technical requirements and address wider socio-ethical concerns by fully including patients in governance processes. PMID:24551383

  1. Patient informed governance of distributed research networks: results and discussion from six patient focus groups.

    PubMed

    Mamo, Laura A; Browe, Dennis K; Logan, Holly C; Kim, Katherine K

    2013-01-01

    Understanding how to govern emerging distributed research networks is essential to their success. Distributed research networks aggregate patient medical data from many institutions leaving data within the local provider security system. While much is known about patients' views on secondary medical research, little is known about their views on governance of research networks. We conducted six focus groups with patients from three medical centers across the U.S. to understand their perspectives on privacy, consent, and ethical concerns of sharing their data as part of research networks. Participants positively endorsed sharing their health data with these networks believing that doing so could advance healthcare knowledge. However, patients expressed several concerns regarding security and broader ethical issues such as commercialism, public benefit, and social responsibility. We suggest that network governance guidelines move beyond strict technical requirements and address wider socio-ethical concerns by fully including patients in governance processes.

  2. Epidemic spreading on complex networks with general degree and weight distributions

    NASA Astrophysics Data System (ADS)

    Wang, Wei; Tang, Ming; Zhang, Hai-Feng; Gao, Hui; Do, Younghae; Liu, Zong-Hua

    2014-10-01

    The spread of disease on complex networks has attracted wide attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In this study, a novel edge-weight-based compartmental approach is developed to estimate the epidemic threshold and epidemic size (final infected density) on networks with general degree and weight distributions, and a remarkable agreement with numerics is obtained. Even in complex networks with the strong heterogeneous degree and weight distributions, this approach is used. We then propose an edge-weight-based removal strategy with different biases and find that such a strategy can effectively control the spread of epidemic when the highly weighted edges are preferentially removed, especially when the weight distribution of a network is extremely heterogenous. The theoretical results from the suggested method can accurately predict the above removal effectiveness.

  3. Scalable Mobile Ad Hoc Network (MANET) to Enhance Situational Awareness in Distributed Small Unit Operations

    DTIC Science & Technology

    2015-06-01

    saying that he has called for “a network that would allow soldiers to tap their laptop or smart phone keyboards and obtain the information they need, as...AD HOC NETWORK (MANET) TO ENHANCE SITUATIONAL AWARENESS IN DISTRIBUTED SMALL UNIT OPERATIONS by Jonathan Clarke Driesslein June 2015...REPORT DATE June 2015 3. REPORT TYPE AND DATES COVERED Master’s Thesis 4. TITLE AND SUBTITLE SCALABLE MOBILE AD HOC NETWORK (MANET) TO

  4. Distributed Transmitter Localization by Power Difference of Arrival (PDOA) on a Network of GNU Radio Sensors

    DTIC Science & Technology

    2015-02-03

    N. Patwari, J. Ash, S. Kyperountas, A. Hero, R. Moses, and N. Correal, “Locating the nodes: cooperative localization in wireless sensor networks ...volume 2, pp. 750–754 vol.2 (Sept 2002), doi: 10.1109/PIMRC.2002.1047322. 5. G. Mao, B. Fidan, and B. D. Anderson, “ Wireless sensor network localization...on a Network of GNU Radio Sensors February 3, 2015 Approved for public release; distribution is unlimited. Andrew robertson sAstry KompellA Joe

  5. Distributed Transforms for Efficient Data Gathering in Sensor Networks

    NASA Technical Reports Server (NTRS)

    Ortega, Antonio (Inventor); Narang, Sunil K. (Inventor); Shen, Godwin (Inventor); Perez-Trufero, Javier (Inventor)

    2014-01-01

    Devices, systems, and techniques for data collecting network such as wireless sensors are disclosed. A described technique includes detecting one or more remote nodes included in the wireless sensor network using a local power level that controls a radio range of the local node. The technique includes transmitting a local outdegree. The local outdegree can be based on a quantity of the one or more remote nodes. The technique includes receiving one or more remote outdegrees from the one or more remote nodes. The technique includes determining a local node type of the local node based on detecting a node type of the one or more remote nodes, using the one or more remote outdegrees, and using the local outdegree. The technique includes adjusting characteristics, including an energy usage characteristic and a data compression characteristic, of the wireless sensor network by selectively modifying the local power level and selectively changing the local node type.

  6. Distributed Teaching Presence and Communicative Patterns in Asynchronous Learning: Name versus Reply Networks

    ERIC Educational Resources Information Center

    Engel, Anna; Coll, Cesar; Bustos, Alfonso

    2013-01-01

    This work explores some methodological challenges in the application of Social Network Analysis (SNA) to the study of "Asynchronous Learning Networks" (ALN). Our interest in the SNA is situated within the framework of the study of Distributed Teaching Presence (DTP), understood as the exercise of educational influence, through a multi-method…

  7. The values of the parameters of some multilayer distributed RC null networks

    NASA Technical Reports Server (NTRS)

    Huelsman, L. P.; Raghunath, S.

    1974-01-01

    In this correspondence, the values of the parameters of some multilayer distributed RC notch networks are determined, and the usually accepted values are shown to be in error. The magnitude of the error is illustrated by graphs of the frequency response of the networks.

  8. Simulation based flow distribution network optimization for vacuum assisted resin transfer moulding process

    NASA Astrophysics Data System (ADS)

    Hsiao, Kuang-Ting; Devillard, Mathieu; Advani, Suresh G.

    2004-05-01

    In the vacuum assisted resin transfer moulding (VARTM) process, using a flow distribution network such as flow channels and high permeability fabrics can accelerate the resin infiltration of the fibre reinforcement during the manufacture of composite parts. The flow distribution network significantly influences the fill time and fill pattern and is essential for the process design. The current practice has been to cover the top surface of the fibre preform with the distribution media with the hope that the resin will flood the top surface immediately and penetrate through the thickness. However, this approach has some drawbacks. One is when the resin finds its way to the vent before it has penetrated the preform entirely, which results in a defective part or resin wastage. Also, if the composite structure contains ribs or inserts, this approach invariably results in dry spots. Instead of this intuitive approach, we propose a science-based approach to design the layout of the distribution network. Our approach uses flow simulation of the resin into the network and the preform and a genetic algorithm to optimize the flow distribution network. An experimental case study of a co-cured rib structure is conducted to demonstrate the design procedure and validate the optimized flow distribution network design. Good agreement between the flow simulations and the experimental results was observed. It was found that the proposed design algorithm effectively optimized the flow distribution network of the part considered in our case study and hence should prove to be a useful tool to extend the VARTM process to manufacture of complex structures with effective use of the distribution network layup.

  9. Distributed Convergence to Nash Equilibria in Two-Network Zero-Sum Games

    DTIC Science & Technology

    2013-02-17

    convexity-concavity assumptions, continuous- time subgradient flow dynam- ics converges to a saddle point (Arrow et al., 1951, 1958). Asymptotic convergence ...Distributed convergence toNash equilibria in two- network zero-sumgames ⋆ B. Gharesifard a J. Cortés b aCoordinated Science Laboratory, University of...AND SUBTITLE Distributed convergence to Nash equilibria in two- network zero-sumgames 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT

  10. LWT Based Sensor Node Signal Processing in Vehicle Surveillance Distributed Sensor Network

    NASA Astrophysics Data System (ADS)

    Cha, Daehyun; Hwang, Chansik

    Previous vehicle surveillance researches on distributed sensor network focused on overcoming power limitation and communication bandwidth constraints in sensor node. In spite of this constraints, vehicle surveillance sensor node must have signal compression, feature extraction, target localization, noise cancellation and collaborative signal processing with low computation and communication energy dissipation. In this paper, we introduce an algorithm for light-weight wireless sensor node signal processing based on lifting scheme wavelet analysis feature extraction in distributed sensor network.

  11. Fiber linked distributed data acquisition in an open network architecture

    SciTech Connect

    Pawelski, F.J.

    1995-03-01

    Flexible and easily expanded process control systems can be achieved through the use of an open and distributed architecture. This paper discusses how to achieve a truly open and distributed process control system as well as some of the goals, concerns and advantages of such a system.

  12. How breadth of degree distribution influences network robustness: Comparing localized and random attacks

    NASA Astrophysics Data System (ADS)

    Yuan, Xin; Shao, Shuai; Stanley, H. Eugene; Havlin, Shlomo

    2015-09-01

    The stability of networks is greatly influenced by their degree distributions and in particular by their breadth. Networks with broader degree distributions are usually more robust to random failures but less robust to localized attacks. To better understand the effect of the breadth of the degree distribution we study two models in which the breadth is controlled and compare their robustness against localized attacks (LA) and random attacks (RA). We study analytically and by numerical simulations the cases where the degrees in the networks follow a bi-Poisson distribution, P (k ) =α e-λ1λ/1kk ! +(1 -α ) e-λ2λ/2kk ! ,α ∈[0 ,1 ] , and a Gaussian distribution, P (k ) =A exp(-(k/-μ) 22 σ2 ), with a normalization constant A where k ≥0 . In the bi-Poisson distribution the breadth is controlled by the values of α , λ1, and λ2, while in the Gaussian distribution it is controlled by the standard deviation, σ . We find that only when α =0 or α =1 , i.e., degrees obeying a pure Poisson distribution, are LA and RA the same. In all other cases networks are more vulnerable under LA than under RA. For a Gaussian distribution with an average degree μ fixed, we find that when σ2 is smaller than μ the network is more vulnerable against random attack. When σ2 is larger than μ , however, the network becomes more vulnerable against localized attack. Similar qualitative results are also shown for interdependent networks.

  13. An Optimal Symmetric Secret Distribution of Star Networks

    DTIC Science & Technology

    2007-01-01

    itself be assisted by other sensors in terms of routing. However, the intermediate sensors can neither learn the contents of the message nor can...instantiation in ad-hoc networks. Computer Comunications , (29):200–215, 2006. [5] Aiyer A.S., Alvisi L, and Gouda M. G. Key grids: A protocol family for

  14. Current Status of Domestic Satellites for Television Network Distribution.

    ERIC Educational Resources Information Center

    Wells, Daniel R.

    Since the previous status report in November of 1970, there has been little progress made in the actual implementation of domestic satellite television systems, because comprehensive technical specifications had not been provided by the three broadcast networks, ABC, NBC, and CBS. When the requirements were submitted to the interested vendors, PBS…

  15. Wireless Networks for Beamforming in Distributed Phased Array Radar

    DTIC Science & Technology

    2007-09-01

    www.ddg1000.com/pressroom/, last retrieved July 2007. [17] David C. Jenn, Rodney Johnson , Michael Melich , and Robert Broadston, “Wirelessly networked...Monterey, California 6. Dr. Steven J. Russell Office of Naval Research Arlington, Virginia 7. Professor Michael Melich Wayne E. Meyer

  16. Performance Evaluation and Control of Distributed Computer Communication Networks.

    DTIC Science & Technology

    1985-09-01

    Pazos-Rangel "Bandwidth Allocation and Routing in ISDN’s," IEEE Communications Magazine , February 1984. Abstract The goal of communications network design...December 1982. [28] M. Gerla and R. Pazos, "Bandwidth Allocation and Routing in ISDN’s," IEEE Communications Magazine , February 1984. [29] R. Pazos

  17. Space Networking Demonstrated for Distributed Human-Robotic Planetary Exploration

    NASA Technical Reports Server (NTRS)

    Bizon, Thomas P.; Seibert, Marc A.

    2003-01-01

    Communications and networking experts from the NASA Glenn Research Center designed and implemented an innovative communications infrastructure for a simulated human-robotic planetary mission. The mission, which was executed in the Arizona desert during the first 2 weeks of September 2002, involved a diverse team of researchers from several NASA centers and academic institutions.

  18. A Topology Visualization Early Warning Distribution Algorithm for Large-Scale Network Security Incidents

    PubMed Central

    He, Hui; Fan, Guotao; Ye, Jianwei; Zhang, Weizhe

    2013-01-01

    It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system's emergency response capabilities, alleviate the cyber attacks' damage, and strengthen the system's counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system's plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks' topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology. PMID:24191145

  19. A topology visualization early warning distribution algorithm for large-scale network security incidents.

    PubMed

    He, Hui; Fan, Guotao; Ye, Jianwei; Zhang, Weizhe

    2013-01-01

    It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system's emergency response capabilities, alleviate the cyber attacks' damage, and strengthen the system's counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system's plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks' topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.

  20. The 3-cycle weighted spectral distribution in evolving community-based networks

    NASA Astrophysics Data System (ADS)

    Jiao, Bo; Wu, Xiaoqun

    2017-03-01

    One of the main organizing principles in real-world networks is that of network communities, where sets of nodes organize into densely linked clusters. Many of these community-based networks evolve over time, that is, we need some size-independent metrics to capture the connection relationships embedded in these clusters. One of these metrics is the average clustering coefficient, which represents the triangle relationships between all nodes of networks. However, the vast majority of network communities is composed of low-degree nodes. Thus, we should further investigate other size-independent metrics to subtly measure the triangle relationships between low-degree nodes. In this paper, we study the 3-cycle weighted spectral distribution (WSD) defined as the weighted sum of the normalized Laplacian spectral distribution with a scaling factor n, where n is the network size (i.e., the node number). Using some diachronic community-based network models and real-world networks, we demonstrate that the ratio of the 3-cycle WSD to the network size is asymptotically independent of the network size and strictly represents the triangle relationships between low-degree nodes. Additionally, we find that the ratio is a good indicator of the average clustering coefficient in evolving community-based systems.

  1. Improving Power Quality in Low-Voltage Networks Containing Distributed Energy Resources

    NASA Astrophysics Data System (ADS)

    Mazumder, Sumit; Ghosh, Arindam; Zare, Firuz

    2013-05-01

    Severe power quality problems can arise when a large number of single-phase distributed energy resources (DERs) are connected to a low-voltage power distribution system. Due to the random location and size of DERs, it may so happen that a particular phase generates excess power than its load demand. In such an event, the excess power will be fed back to the distribution substation and will eventually find its way to the transmission network, causing undesirable voltage-current unbalance. As a solution to this problem, the article proposes the use of a distribution static compensator (DSTATCOM), which regulates voltage at the point of common coupling (PCC), thereby ensuring balanced current flow from and to the distribution substation. Additionally, this device can also support the distribution network in the absence of the utility connection, making the distribution system work as a microgrid. The proposals are validated through extensive digital computer simulation studies using PSCADTM.

  2. Distributed Generation Planning using Peer Enhanced Multi-objective Teaching-Learning based Optimization in Distribution Networks

    NASA Astrophysics Data System (ADS)

    Selvam, Kayalvizhi; Vinod Kumar, D. M.; Siripuram, Ramakanth

    2016-06-01

    In this paper, an optimization technique called peer enhanced teaching learning based optimization (PeTLBO) algorithm is used in multi-objective problem domain. The PeTLBO algorithm is parameter less so it reduced the computational burden. The proposed peer enhanced multi-objective based TLBO (PeMOTLBO) algorithm has been utilized to find a set of non-dominated optimal solutions [distributed generation (DG) location and sizing in distribution network]. The objectives considered are: real power loss and the voltage deviation subjected to voltage limits and maximum penetration level of DG in distribution network. Since the DG considered is capable of injecting real and reactive power to the distribution network the power factor is considered as 0.85 lead. The proposed peer enhanced multi-objective optimization technique provides different trade-off solutions in order to find the best compromise solution a fuzzy set theory approach has been used. The effectiveness of this proposed PeMOTLBO is tested on IEEE 33-bus and Indian 85-bus distribution system. The performance is validated with Pareto fronts and two performance metrics (C-metric and S-metric) by comparing with robust multi-objective technique called non-dominated sorting genetic algorithm-II and also with the basic TLBO.

  3. Traffic-driven epidemic spreading on scale-free networks with tunable degree distribution

    NASA Astrophysics Data System (ADS)

    Yang, Han-Xin; Wang, Bing-Hong

    2016-04-01

    We study the traffic-driven epidemic spreading on scale-free networks with tunable degree distribution. The heterogeneity of networks is controlled by the exponent γ of power-law degree distribution. It is found that the epidemic threshold is minimized at about γ=2.2. Moreover, we find that nodes with larger algorithmic betweenness are more likely to be infected. We expect our work to provide new insights in to the effect of network structures on traffic-driven epidemic spreading.

  4. Experiences on integration of network management and a distributed computing platform

    NASA Astrophysics Data System (ADS)

    Rahkila, Sakari; Stenberg, Susanne

    1997-09-01

    The integration of the two recognized network management protocol standards, common management information protocol, and simple network management protocol, and common object request broker architecture (CORBA) technology, allows management applications to take advantage of distributed object computing as well as the standardized network management protocols. This paper describes the distributed computing platform (DCP) prototype developed at the Nokia Research Center. The DCP prototype is a framework, including tools, compilers and gateways, built to support both Internet and open systems interconnection management through a CORBA infrastructure.

  5. Distributed Microprocessor Automation Network for Synthesizing Radiotracers Used in Positron Emission Tomography [PET

    DOE R&D Accomplishments Database

    Russell, J. A. G.; Alexoff, D. L.; Wolf, A. P.

    1984-09-01

    This presentation describes an evolving distributed microprocessor network for automating the routine production synthesis of radiotracers used in Positron Emission Tomography. We first present a brief overview of the PET method for measuring biological function, and then outline the general procedure for producing a radiotracer. The paper identifies several reasons for our automating the syntheses of these compounds. There is a description of the distributed microprocessor network architecture chosen and the rationale for that choice. Finally, we speculate about how this network may be exploited to extend the power of the PET method from the large university or National Laboratory to the biomedical research and clinical community at large. (DT)

  6. Characterizing short-term stability for Boolean networks over any distribution of transfer functions

    DOE PAGES

    Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; ...

    2016-07-05

    Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.

  7. Distributed data networks: a blueprint for Big Data sharing and healthcare analytics.

    PubMed

    Popovic, Jennifer R

    2017-01-01

    This paper defines the attributes of distributed data networks and outlines the data and analytic infrastructure needed to build and maintain a successful network. We use examples from one successful implementation of a large-scale, multisite, healthcare-related distributed data network, the U.S. Food and Drug Administration-sponsored Sentinel Initiative. Analytic infrastructure-development concepts are discussed from the perspective of promoting six pillars of analytic infrastructure: consistency, reusability, flexibility, scalability, transparency, and reproducibility. This paper also introduces one use case for machine learning algorithm development to fully utilize and advance the portfolio of population health analytics, particularly those using multisite administrative data sources.

  8. Better understanding of water quality evolution in water distribution networks using data clustering.

    PubMed

    Mandel, Pierre; Maurel, Marie; Chenu, Damien

    2015-12-15

    The complexity of water distribution networks raises challenges in managing, monitoring and understanding their behavior. This article proposes a novel methodology applying data clustering to the results of hydraulic simulation to define quality zones, i.e. zones with the same dynamic water origin. The methodology is presented on an existing Water Distribution Network; a large dataset of conductivity measurements measured by 32 probes validates the definition of the quality zones. The results show how quality zones help better understanding the network operation and how they can be used to analyze water quality events. Moreover, a statistical comparison with 158,230 conductivity measurements validates the definition of the quality zones.

  9. The Study of Development Strategy for Bank Distribution Network through the Analysis of Inter-regional Financial Transaction Network

    NASA Astrophysics Data System (ADS)

    Hong, Jae Weon; Hong, Won Eui; Kwak, Yoon Sik

    This study attempts to shed light on the factors that influence the locations of bank branches in establishing a bank's distribution network from the angle of the network analysis. Whereas the previous studies analyzed the locations of bank branches on the basis of their geographical characteristics and image, the significance of this study rests upon the fact that it endeavors to explore the location factors from a new perspective of the movement path of financial customers. For this analysis, the network between administrative districts, which form the fundamental unit of a location, was analyzed based on the financial transactional data. The important findings of this study are as follows. First, in conformity with the previous studies, the income level, the spending level, the number of businesses, and the size of workforce in the pertinent region were all found to influence the size of a bank's market. Second, the centrality index extracted from the analysis of the network was found to have a significant effect on the locations of bank branches. In particular, the degree centrality was revealed to have a greater influence on the size of a bank's market than does the closeness centrality. Such results of this study clearly suggest the needs for a new approach from the perspective of network in furtherance of other factors that have been considered important in the previous studies of the distribution network strategies.

  10. Correlation-aware multimedia content distribution in overlay networks

    NASA Astrophysics Data System (ADS)

    Zhu, Ying; Li, Baochun

    2006-01-01

    We address the question: What is the best way to construct a mesh overlay topology for multimedia content distribution, such that the highest streaming rate can be achieved? We model overlay capacity correlations as linear capacity constraints (LCC) and propose a distributed algorithm that constructs an overlay mesh which incorporates heuristically inferred linear capacity constraints. Our simulations results confirm the accuracy of representing overlays using our LCC model and show the LCC-overlay achieving substantial improvement in achievable flow rate.

  11. Distribution Tolerant Network Technology Flight Validation Report: DINET

    NASA Technical Reports Server (NTRS)

    Jones, Ross M.

    2009-01-01

    In October and November of 2008, the Jet Propulsion Laboratory installed and tested essential elements of Delay/Disruption Tolerant Networking (DTN) technology on the Deep Impact spacecraft. This experiment, called Deep Impact Network Experiment (DINET), was performed in close cooperation with the EPOXI project which has responsibility for the spacecraft. During DINET some 300 images were transmitted from the JPL nodes to the spacecraft. Then, they were automatically forwarded from the spacecraft back to the JPL nodes, exercising DTN's bundle origination, transmission, acquisition, dynamic route computation, congestion control, prioritization, custody transfer, and automatic retransmission procedures, both on the spacecraft and on the ground, over a period of 27 days. All transmitted bundles were successfully received, without corruption. The DINET experiment demonstrated DTN readiness for operational use in space missions.

  12. Using Inspiration from Synaptic Plasticity Rules to Optimize Traffic Flow in Distributed Engineered Networks.

    PubMed

    Suen, Jonathan Y; Navlakha, Saket

    2017-02-09

    Controlling the flow and routing of data is a fundamental problem in many distributed networks, including transportation systems, integrated circuits, and the Internet. In the brain, synaptic plasticity rules have been discovered that regulate network activity in response to environmental inputs, which enable circuits to be stable yet flexible. Here, we develop a new neuro-inspired model for network flow control that depends only on modifying edge weights in an activity-dependent manner. We show how two fundamental plasticity rules, long-term potentiation and long-term depression, can be cast as a distributed gradient descent algorithm for regulating traffic flow in engineered networks. We then characterize, both by simulation and analytically, how different forms of edge-weight-update rules affect network routing efficiency and robustness. We find a close correspondence between certain classes of synaptic weight-update rules derived experimentally in the brain and rules commonly used in engineering, suggesting common principles to both.

  13. Distributed robust adaptive control for a class of dynamical complex networks against imperfect communications

    NASA Astrophysics Data System (ADS)

    Jin, Xiao-Zheng; Yang, Guang-Hong

    2011-03-01

    In this article, a robust tracking control problem of a class of dynamical complex networks is presented through a distributed adaptive approach. Uncertain network topology with unknown coupling strength, delayed and perturbed communications and external disturbances are considered, while the bounds of channel noises and coupling delays and disturbances are assumed to be unknown. Adaptation laws are proposed to estimate the network coupling strength and the upper and lower bounds of communication state errors and disturbances on-line. Based on the information from adaptive schemes, a class of distributed robust adaptive controllers is constructed to automatically compensate for the imperfect network and disturbance effects. Then, according to the Lyapunov stability theory, it is shown that the achievement of tracking for complex networks is effective on imperfect communications and disturbances. The effectiveness of the proposed design is illustrated via a decoupled longitudinal model of an F-18 aircraft.

  14. Distributed Fusion in Sensor Networks with Information Genealogy

    DTIC Science & Technology

    2011-06-28

    published in Fusion 2009 [5] received one of the best student paper awards. Our overall goal is to provide provable methodologies which follow directly... 2009 . [5] Rommel Carvalho and KC Chang, "A Performance Evaluation Tool for Multi-Sensor Classification Systems," in Proc. 121 International...Conference on Information Fusion, Seattle, July, 2009 . [6] Wei Sun and KC Chang, "Message Passing for General Hybrid Bayesian Networks: Representation

  15. Panel Review of Long-Haul Networking in Distributed Simulation

    DTIC Science & Technology

    1990-06-01

    Second R&D Research and Development RISC Reduced Instruction Set Computer SAF Semi -Automated Forces SDI Strategic Defense Initiative SIMNET Simulator...Suggestions for meeting the needs of long-haul networking in ADST included the following: • Generate objects simulated for semi -automated and fully-automated...grows less than linearly with the number of objects; (c) The percentage of fully-automated forces (FAFs) 0 and semi -automated forces (SAFs) will grow as

  16. Performance Evaluation and Control of Distributed Computer Communication Networks.

    DTIC Science & Technology

    1984-09-01

    in ISDN’s," IEEE Communications Magazine , Feb. 1984. [29] R.A. Pazos-Rangel, "Evaluatidn and Design of Integrated Packet Switch- ing and Circuit... Communications Magazine , February 1984. Abstract The goal of communications network design is to satisfy user requirements with the minimum amount of...investigations have been reported in reference (1) and (2) below. References (1) M. Gerla, R. Pazos-Rangel "Bandwidth Allocation and Routing in ISDN’s," IEEE

  17. Economic evaluation of broadband distribution networks to the home

    NASA Astrophysics Data System (ADS)

    Merk, Charles A.

    1992-02-01

    Economic wideband, linear fiber optic transmitters and receivers pave the way for broadband to the home. The diamond network architecture (DNA) delivers 1 GHz bandwidth. This provides standard video, HDTV, and switched two-way broadband digital services to the home. An economic model is presented using the DNA that considers the impact of digital TV, HDTV, and the evolution of switched voice and data services on a CATV system.

  18. Network Formation: Neighborhood Structures, Establishment Costs, and Distributed Learning

    DTIC Science & Technology

    2012-09-19

    element equal to 1; and (iii) λ ≥ 0 is a parameter used to model possible perturbations in the decision making process, also called mutations [33...vol. 106, no. 2, pp. 265–295, 2002. [19] N. Olaizola and F. Valenciano, “One-way flow network formation under constraints,” University of the Basque ...57–84, 1993. [34] L. Breiman, Probability. Philadelphia: SIAM, 1992. [35] M. Kandori, G. Mailath, and R. Rob, “Learning, mutation , and long-run

  19. Efficient packet transportation on complex networks with nonuniform node capacity distribution

    NASA Astrophysics Data System (ADS)

    He, Xuan; Niu, Kai; He, Zhiqiang; Lin, Jiaru; Jiang, Zhong-Yuan

    2015-03-01

    Provided that node delivery capacity may be not uniformly distributed in many realistic networks, we present a node delivery capacity distribution in which each node capacity is composed of uniform fraction and degree related proportion. Based on the node delivery capacity distribution, we construct a novel routing mechanism called efficient weighted routing (EWR) strategy to enhance network traffic capacity and transportation efficiency. Compared with the shortest path routing and the efficient routing strategies, the EWR achieves the highest traffic capacity. After investigating average path length, network diameter, maximum efficient betweenness, average efficient betweenness, average travel time and average traffic load under extensive simulations, it indicates that the EWR appears to be a very effective routing method. The idea of this routing mechanism gives us a good insight into network science research. The practical use of this work is prospective in some real complex systems such as the Internet.

  20. Distributed computing methodology for training neural networks in an image-guided diagnostic application.

    PubMed

    Plagianakos, V P; Magoulas, G D; Vrahatis, M N

    2006-03-01

    Distributed computing is a process through which a set of computers connected by a network is used collectively to solve a single problem. In this paper, we propose a distributed computing methodology for training neural networks for the detection of lesions in colonoscopy. Our approach is based on partitioning the training set across multiple processors using a parallel virtual machine. In this way, interconnected computers of varied architectures can be used for the distributed evaluation of the error function and gradient values, and, thus, training neural networks utilizing various learning methods. The proposed methodology has large granularity and low synchronization, and has been implemented and tested. Our results indicate that the parallel virtual machine implementation of the training algorithms developed leads to considerable speedup, especially when large network architectures and training sets are used.

  1. A time reference distribution concept for a time division communication network

    NASA Technical Reports Server (NTRS)

    Stover, H. A.

    1973-01-01

    Starting with an assumed ideal network having perfect clocks at every node and known fixed transmission delays between nodes, the effects of adding tolerances to both transmission delays and nodal clocks is described. The advantages of controlling tolerances on time rather than frequency are discussed. Then a concept is presented for maintaining these tolerances on time throughout the network. This concept, called time reference distribution, is a systematic technique for distributing time reference to all nodes of the network. It is reliable, survivable and possesses many other desirable characteristics. Some of its features such as an excellent self monitoring capability will be pointed out. Some preliminary estimates of the accuracy that might be expected are developed and there is a brief discussion of the impact upon communication system costs. Time reference distribution is a concept that appears very attractive. It has not had experimental evaluation and has not yet been endorsed for use in any communication network.

  2. The use of climatic parameters and indices in vegetation distribution. A case study in the Spanish Sistema Central

    NASA Astrophysics Data System (ADS)

    Gavilán, Rosario G.

    2005-11-01

    In this study, over 100 phytoclimatic indices and other climatic parameters were calculated using the climatic data from 260 meteorological stations in a Mediterranean territory located in the centre of the Iberian Peninsula. The nature of these indices was very different; some of them expressed general climatic features (e.g. continentality), while others were formulated for different Mediterranean territories and included particular limits of those indices that expressed differences in vegetation distribution. We wanted to know whether all of these indices were able to explain changes in vegetation on a spatial scale, and whether their boundaries worked similarly to the original territory. As they were so numerous, we investigated whether any of them were redundant. To relate vegetation to climate parameters we preferred to use its hierarchical nature, in discrete units (characterized by one or more dominant or co-dominant species), although it is known to vary continuously. These units give clearer results in this kind of phytoclimatic study. We have therefore used the main communities that represent natural potential vegetation. Multivariate and estimative analyses were used as statistical methods. The classification showed different levels of correlation among climatic parameters, but all of them were over 0.5. One hundred and eleven parameters were grouped into five larger groups: temperature (T), annual pluviothermic indices (PTY), summer pluviothermic indices (SPT), winter potential evapotranspiration (WPET) and thermal continentality indices (K). The remaining parameters showed low correlations with these five groups; some of them revealed obvious spatial changes in vegetation, such as summer hydric parameters that were zero in most vegetation types but not in high mountain vegetation. Others showed no clear results. For example, the Kerner index, an index of thermal continentality, showed lower values than expected for certain particular types of

  3. The use of climatic parameters and indices in vegetation distribution. A case study in the Spanish Sistema Central.

    PubMed

    Gavilán, Rosario G

    2005-11-01

    In this study, over 100 phytoclimatic indices and other climatic parameters were calculated using the climatic data from 260 meteorological stations in a Mediterranean territory located in the centre of the Iberian Peninsula. The nature of these indices was very different; some of them expressed general climatic features (e.g. continentality), while others were formulated for different Mediterranean territories and included particular limits of those indices that expressed differences in vegetation distribution. We wanted to know whether all of these indices were able to explain changes in vegetation on a spatial scale, and whether their boundaries worked similarly to the original territory. As they were so numerous, we investigated whether any of them were redundant. To relate vegetation to climate parameters we preferred to use its hierarchical nature, in discrete units (characterized by one or more dominant or co-dominant species), although it is known to vary continuously. These units give clearer results in this kind of phytoclimatic study. We have therefore used the main communities that represent natural potential vegetation. Multivariate and estimative analyses were used as statistical methods. The classification showed different levels of correlation among climatic parameters, but all of them were over 0.5. One hundred and eleven parameters were grouped into five larger groups: temperature (T), annual pluviothermic indices (PTY), summer pluviothermic indices (SPT), winter potential evapotranspiration (WPET) and thermal continentality indices (K). The remaining parameters showed low correlations with these five groups; some of them revealed obvious spatial changes in vegetation, such as summer hydric parameters that were zero in most vegetation types but not in high mountain vegetation. Others showed no clear results. For example, the Kerner index, an index of thermal continentality, showed lower values than expected for certain particular types of

  4. Implementing and Investigating Distributed Leadership in a National University Network--SaMnet

    ERIC Educational Resources Information Center

    Sharma, Manjula D.; Rifkin, Will; Tzioumis, Vicky; Hill, Matthew; Johnson, Elizabeth; Varsavsky, Cristina; Jones, Susan; Beames, Stephanie; Crampton, Andrea; Zadnik, Marjan; Pyke, Simon

    2017-01-01

    The literature suggests that collaborative approaches to leadership, such as distributed leadership, are essential for supporting educational innovators in leading change in teaching in universities. This paper briefly describes the array of activities, processes and resources to support distributed leadership in the implementation of a network,…

  5. Discriminating different classes of biological networks by analyzing the graphs spectra distribution.

    PubMed

    Takahashi, Daniel Yasumasa; Sato, João Ricardo; Ferreira, Carlos Eduardo; Fujita, André

    2012-01-01

    The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e.g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

  6. Analysis and synthesis of distributed-lumped-active networks by digital computer

    NASA Technical Reports Server (NTRS)

    1973-01-01

    The use of digital computational techniques in the analysis and synthesis of DLA (distributed lumped active) networks is considered. This class of networks consists of three distinct types of elements, namely, distributed elements (modeled by partial differential equations), lumped elements (modeled by algebraic relations and ordinary differential equations), and active elements (modeled by algebraic relations). Such a characterization is applicable to a broad class of circuits, especially including those usually referred to as linear integrated circuits, since the fabrication techniques for such circuits readily produce elements which may be modeled as distributed, as well as the more conventional lumped and active ones.

  7. Distributed Load Shedding over Directed Communication Networks with Time Delays

    SciTech Connect

    Yang, Tao; Wu, Di

    2016-07-25

    When generation is insufficient to support all loads under emergencies, effective and efficient load shedding needs to be deployed in order to maintain the supply-demand balance. This paper presents a distributed load shedding algorithm, which makes efficient decision based on the discovered global information. In the global information discovery process, each load only communicates with its neighboring load via directed communication links possibly with arbitrarily large but bounded time varying communication delays. We propose a novel distributed information discovery algorithm based on ratio consensus. Simulation results are used to validate the proposed method.

  8. Research and Design of the Three-tier Distributed Network Management System Based on COM / COM + and DNA

    NASA Astrophysics Data System (ADS)

    Liang, Likai; Bi, Yushen

    Considered on the distributed network management system's demand of high distributives, extensibility and reusability, a framework model of Three-tier distributed network management system based on COM/COM+ and DNA is proposed, which adopts software component technology and N-tier application software framework design idea. We also give the concrete design plan of each layer of this model. Finally, we discuss the internal running process of each layer in the distributed network management system's framework model.

  9. Distributed Power Allocation for Sink-Centric Clusters in Multiple Sink Wireless Sensor Networks

    PubMed Central

    Cao, Lei; Xu, Chen; Shao, Wei; Zhang, Guoan; Zhou, Hui; Sun, Qiang; Guo, Yuehua

    2010-01-01

    Due to the battery resource constraints, saving energy is a critical issue in wireless sensor networks, particularly in large sensor networks. One possible solution is to deploy multiple sink nodes simultaneously. Another possible solution is to employ an adaptive clustering hierarchy routing scheme. In this paper, we propose a multiple sink cluster wireless sensor networks scheme which combines the two solutions, and propose an efficient transmission power control scheme for a sink-centric cluster routing protocol in multiple sink wireless sensor networks, denoted as MSCWSNs-PC. It is a distributed, scalable, self-organizing, adaptive system, and the sensor nodes do not require knowledge of the global network and their location. All sinks effectively work out a representative view of a monitored region, after which power control is employed to optimize network topology. The simulations demonstrate the advantages of our new protocol. PMID:22294911

  10. Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.

    PubMed

    Larjo, Antti; Lähdesmäki, Harri

    2015-12-01

    Bayesian networks have become popular for modeling probabilistic relationships between entities. As their structure can also be given a causal interpretation about the studied system, they can be used to learn, for example, regulatory relationships of genes or proteins in biological networks and pathways. Inference of the Bayesian network structure is complicated by the size of the model structure space, necessitating the use of optimization methods or sampling techniques, such Markov Chain Monte Carlo (MCMC) methods. However, convergence of MCMC chains is in many cases slow and can become even a harder issue as the dataset size grows. We show here how to improve convergence in the Bayesian network structure space by using an adjustable proposal distribution with the possibility to propose a wide range of steps in the structure space, and demonstrate improved network structure inference by analyzing phosphoprotein data from the human primary T cell signaling network.

  11. Stability of weighted spectral distribution in a pseudo tree-like network model

    NASA Astrophysics Data System (ADS)

    Bo, Jiao; Yuan-ping, Nie; Cheng-dong, Huang; Jing, Du; Rong-hua, Guo; Fei, Huang; Jian-mai, Shi

    2016-05-01

    The comparison of networks with different orders strongly depends on the stability analysis of graph features in evolving systems. In this paper, we rigorously investigate the stability of the weighted spectral distribution (i.e., a spectral graph feature) as the network order increases. First, we use deterministic scale-free networks generated by a pseudo tree-like model to derive the precise formula of the spectral feature, and then analyze the stability of the spectral feature based on the precise formula. Except for the scale-free feature, the pseudo tree-like model exhibits the hierarchical and small-world structures of complex networks. The stability analysis is useful for the classification of networks with different orders and the similarity analysis of networks that may belong to the same evolving system. Project supported by the National Natural Science Foundation of China (Grant Nos. 61402485, 61303061, and 71201169).

  12. Apparatus and method for data communication in an energy distribution network

    SciTech Connect

    Hussain, Mohsin; LaPorte, Brock; Uebel, Udo; Zia, Aftab

    2014-07-08

    A system for communicating information on an energy distribution network is disclosed. In one embodiment, the system includes a local supervisor on a communication network, wherein the local supervisor can collect data from one or more energy generation/monitoring devices. The system also includes a command center on the communication network, wherein the command center can generate one or more commands for controlling the one or more energy generation devices. The local supervisor can periodically transmit a data signal indicative of the data to the command center via a first channel of the communication network at a first interval. The local supervisor can also periodically transmit a request for a command to the command center via a second channel of the communication network at a second interval shorter than the first interval. This channel configuration provides effective data communication without a significant increase in the use of network resources.

  13. High Speed Quantum Key Distribution Over Optical Fiber Network System1

    PubMed Central

    Ma, Lijun; Mink, Alan; Tang, Xiao

    2009-01-01

    The National Institute of Standards and Technology (NIST) has developed a number of complete fiber-based high-speed quantum key distribution (QKD) systems that includes an 850 nm QKD system for a local area network (LAN), a 1310 nm QKD system for a metropolitan area network (MAN), and a 3-node quantum network controlled by a network manager. This paper discusses the key techniques used to implement these systems, which include polarization recovery, noise reduction, frequency up-conversion detection based on a periodically polled lithium nitrate (PPLN) waveguide, custom high-speed data handling boards and quantum network management. Using our quantum network, a QKD secured video surveillance application has been demonstrated. Our intention is to show the feasibility and sophistication of QKD systems based on current technology. PMID:27504218

  14. Information Fusion and Performance Modeling with Distributed Sensor Networks

    DTIC Science & Technology

    2010-11-01

    Ec,Ed) = X I P(X j I,Ec)P(I j E): (20) SUN & CHANG: MESSAGE PASSING FOR HYBRID BNS: REPRESENTATION, PROPAGATION, AND INTEGRATION 1531 Fig. 6. GHM -2...experiments. One is shown in Fig. 4 as mentioned in Section IIIA called GHM -1. GHM -1 has one loop in each network segment, respectively, (partitioned by...the interface node K). Another experiment model is shown in Fig. 6 called GHM -2. GHM -2 has multiple loops in the continuous segment. For GHM -1, we

  15. Supervised learning of probability distributions by neural networks

    NASA Technical Reports Server (NTRS)

    Baum, Eric B.; Wilczek, Frank

    1988-01-01

    Supervised learning algorithms for feedforward neural networks are investigated analytically. The back-propagation algorithm described by Werbos (1974), Parker (1985), and Rumelhart et al. (1986) is generalized by redefining the values of the input and output neurons as probabilities. The synaptic weights are then varied to follow gradients in the logarithm of likelihood rather than in the error. This modification is shown to provide a more rigorous theoretical basis for the algorithm and to permit more accurate predictions. A typical application involving a medical-diagnosis expert system is discussed.

  16. Radiology Film Tracking in a Distributed Clinical Network

    PubMed Central

    Marquette, David D.; Arrildt, William

    1985-01-01

    A system for tracking radiology films has been designed and is being installed at the Johns Hopkins Hospital. The installation of database and network capabilities in a large hospital environment provide the opportunity to extend to all nursing units and clinics access to the hospital's film tracking system. Ethernet communication technology allows communication to remote libraries. The integration of film tracking with scheduling and order entry systems in radiology make it possible to attain a high level of automated database interface and film jacket label production.

  17. A Streaming Content Distribution Network for E-Learning Support

    ERIC Educational Resources Information Center

    Esteve, M.; Molina, B.; Palau, C.; Fortino, G.

    2006-01-01

    To date e-Learning material has usually been accessed and delivered through a central web server. As the number of users, the amount of information, the frequency of accesses and the volume of data increase, together with the introduction of multimedia streaming applications, a decentralized content distribution architecture is necessary. In this…

  18. Distributed estimation of sensors position in underwater wireless sensor network

    NASA Astrophysics Data System (ADS)

    Zandi, Rahman; Kamarei, Mahmoud; Amiri, Hadi

    2016-05-01

    In this paper, a localisation method for determining the position of fixed sensor nodes in an underwater wireless sensor network (UWSN) is introduced. In this simple and range-free scheme, the node localisation is achieved by utilising an autonomous underwater vehicle (AUV) that transverses through the network deployment area, and that periodically emits a message block via four directional acoustic beams. A message block contains the actual known AUV position as well as a directional dependent marker that allows a node to identify the respective transmit beam. The beams form a fixed angle with the AUV body. If a node passively receives message blocks, it could calculate the arithmetic mean of the coordinates existing in each messages sequence, to find coordinates at two different time instants via two different successive beams. The node position can be derived from the two computed positions of the AUV. The major advantage of the proposed localisation algorithm is that it is silent, which leads to energy efficiency for sensor nodes. The proposed method does not require any synchronisation among the nodes owing to being silent. Simulation results, using MATLAB, demonstrated that the proposed method had better performance than other similar AUV-based localisation methods in terms of the rates of well-localised sensor nodes and positional root mean square error.

  19. Modeling complexity in engineered infrastructure system: Water distribution network as an example

    NASA Astrophysics Data System (ADS)

    Zeng, Fang; Li, Xiang; Li, Ke

    2017-02-01

    The complex topology and adaptive behavior of infrastructure systems are driven by both self-organization of the demand and rigid engineering solutions. Therefore, engineering complex systems requires a method balancing holism and reductionism. To model the growth of water distribution networks, a complex network model was developed following the combination of local optimization rules and engineering considerations. The demand node generation is dynamic and follows the scaling law of urban growth. The proposed model can generate a water distribution network (WDN) similar to reported real-world WDNs on some structural properties. Comparison with different modeling approaches indicates that a realistic demand node distribution and co-evolvement of demand node and network are important for the simulation of real complex networks. The simulation results indicate that the efficiency of water distribution networks is exponentially affected by the urban growth pattern. On the contrary, the improvement of efficiency by engineering optimization is limited and relatively insignificant. The redundancy and robustness, on another aspect, can be significantly improved through engineering methods.

  20. Flow distribution in parallel microfluidic networks and its effect on concentration gradient

    PubMed Central

    Guermonprez, Cyprien; Michelin, Sébastien; Baroud, Charles N.

    2015-01-01

    The architecture of microfluidic networks can significantly impact the flow distribution within its different branches and thereby influence tracer transport within the network. In this paper, we study the flow rate distribution within a network of parallel microfluidic channels with a single input and single output, using a combination of theoretical modeling and microfluidic experiments. Within the ladder network, the flow rate distribution follows a U-shaped profile, with the highest flow rate occurring in the initial and final branches. The contrast with the central branches is controlled by a single dimensionless parameter, namely, the ratio of hydrodynamic resistance between the distribution channel and the side branches. This contrast in flow rates decreases when the resistance of the side branches increases relative to the resistance of the distribution channel. When the inlet flow is composed of two parallel streams, one of which transporting a diffusing species, a concentration variation is produced within the side branches of the network. The shape of this concentration gradient is fully determined by two dimensionless parameters: the ratio of resistances, which determines the flow rate distribution, and the Péclet number, which characterizes the relative speed of diffusion and advection. Depending on the values of these two control parameters, different distribution profiles can be obtained ranging from a flat profile to a step distribution of solute, with well-distributed gradients between these two limits. Our experimental results are in agreement with our numerical model predictions, based on a simplified 2D advection-diffusion problem. Finally, two possible applications of this work are presented: the first one combines the present design with self-digitization principle to encapsulate the controlled concentration in nanoliter chambers, while the second one extends the present design to create a continuous concentration gradient within an open flow

  1. Epidemic threshold determined by the first moments of network with alternating degree distributions

    NASA Astrophysics Data System (ADS)

    Li, Kezan; Zhang, Haifeng; Fu, Xinchu; Ding, Yong; Small, Michael

    2015-02-01

    During the alternating day-night cycle, people have differing behavior and hence different connection patterns-such as going to work or home, shopping and so on. Hence, the true topological structure of human contact networks are not only time-varying but also exhibit certain distribution regularity. In this paper, we will investigate epidemic spreading on time-varying human contact networks, which follow one degree distribution during daytime, but another at night. Based on SIS (susceptible/infected/susceptible) propagation mechanism, we study the epidemic threshold of this network with alternating distributions. A surprising result is that for the discrete-time case the epidemic threshold is determined only by the first moments of the two alternating degree distributions, if the degree of each node is constant for all nights. A similar result is valid for the continuous-time case if the duration is sufficiently small. This work shows that the spreading dynamics of time-varying networks with alternating distributions is completely different from the widely studied case of static spreading networks.

  2. Large-scale P2P network based distributed virtual geographic environment (DVGE)

    NASA Astrophysics Data System (ADS)

    Tan, Xicheng; Yu, Liang; Bian, Fuling

    2007-06-01

    Virtual Geographic Environment has raised full concern as a kind of software information system that helps us understand and analyze the real geographic environment, and it has also expanded to application service system in distributed environment--distributed virtual geographic environment system (DVGE), and gets some achievements. However, limited by the factor of the mass data of VGE, the band width of network, as well as numerous requests and economic, etc. DVGE still faces some challenges and problems which directly cause the current DVGE could not provide the public with high-quality service under current network mode. The Rapid development of peer-to-peer network technology has offered new ideas of solutions to the current challenges and problems of DVGE. Peer-to-peer network technology is able to effectively release and search network resources so as to realize efficient share of information. Accordingly, this paper brings forth a research subject on Large-scale peer-to-peer network extension of DVGE as well as a deep study on network framework, routing mechanism, and DVGE data management on P2P network.

  3. Structure Learning and Statistical Estimation in Distribution Networks - Part II

    SciTech Connect

    Deka, Deepjyoti; Backhaus, Scott N.; Chertkov, Michael

    2015-02-13

    Limited placement of real-time monitoring devices in the distribution grid, recent trends notwithstanding, has prevented the easy implementation of demand-response and other smart grid applications. Part I of this paper discusses the problem of learning the operational structure of the grid from nodal voltage measurements. In this work (Part II), the learning of the operational radial structure is coupled with the problem of estimating nodal consumption statistics and inferring the line parameters in the grid. Based on a Linear-Coupled(LC) approximation of AC power flows equations, polynomial time algorithms are designed to identify the structure and estimate nodal load characteristics and/or line parameters in the grid using the available nodal voltage measurements. Then the structure learning algorithm is extended to cases with missing data, where available observations are limited to a fraction of the grid nodes. The efficacy of the presented algorithms are demonstrated through simulations on several distribution test cases.

  4. System-wide power management control via clock distribution network

    DOEpatents

    Coteus, Paul W.; Gara, Alan; Gooding, Thomas M.; Haring, Rudolf A.; Kopcsay, Gerard V.; Liebsch, Thomas A.; Reed, Don D.

    2015-05-19

    An apparatus, method and computer program product for automatically controlling power dissipation of a parallel computing system that includes a plurality of processors. A computing device issues a command to the parallel computing system. A clock pulse-width modulator encodes the command in a system clock signal to be distributed to the plurality of processors. The plurality of processors in the parallel computing system receive the system clock signal including the encoded command, and adjusts power dissipation according to the encoded command.

  5. Global Observation Information Networking: Using the Distributed Image Spreadsheet (DISS)

    NASA Technical Reports Server (NTRS)

    Hasler, Fritz

    1999-01-01

    The DISS and many other tools will be used to present visualizations which span the period from the original Suomi/Hasler animations of the first ATS-1 GEO weather satellite images in 1966 ....... to the latest 1999 NASA Earth Science Vision for the next 25 years. Hot off the SGI Onyx Graphics-Supercomputers are NASA's visualizations of Hurricanes Mitch, Georges, Fran and Linda. These storms have been recently featured on the covers of National Geographic, Time, Newsweek and Popular Science and used repeatedly this season on National and International network TV. Results will be presented from a new paper on automatic wind measurements in Hurricane Luis from 1-min GOES images that appeared in the November BAMS.

  6. Efficiently passing messages in distributed spiking neural network simulation.

    PubMed

    Thibeault, Corey M; Minkovich, Kirill; O'Brien, Michael J; Harris, Frederick C; Srinivasa, Narayan

    2013-01-01

    Efficiently passing spiking messages in a neural model is an important aspect of high-performance simulation. As the scale of networks has increased so has the size of the computing systems required to simulate them. In addition, the information exchange of these resources has become more of an impediment to performance. In this paper we explore spike message passing using different mechanisms provided by the Message Passing Interface (MPI). A specific implementation, MVAPICH, designed for high-performance clusters with Infiniband hardware is employed. The focus is on providing information about these mechanisms for users of commodity high-performance spiking simulators. In addition, a novel hybrid method for spike exchange was implemented and benchmarked.

  7. Controllable coupling of distributed qubits within a microtoroidal cavity network

    NASA Astrophysics Data System (ADS)

    Hu, C.; Xia, Y.; Song, J.

    2012-05-01

    We propose a scheme to control the coupling between two arbitrary atoms scattered within a quantum network composed of microtoroidal cavities linked by a ring-fibre. The atom-atom effective couplings are induced by pairing of off-resonant Raman transitions. The couplings can be arbitrarily controlled by adjusting classical fields. Compared with the previous scheme [S.B. Zheng, C.P. Yang, F. Nori, Phys. Rev. A 82, 042327 (2010)], the present scheme uses microtoroidal cavities with higher coupling efficiency than Fabry-Perot cavities. Furthermore, the scheme is not only suitable for the short-fibre limit, but also for multiple fibre modes. The added fibre modes can play a positive role, especially when the coupling rate between cavity-mode and fibre-mode is not large. In addition, a wider frequency domain of fibre modes can be used in this scheme.

  8. Autonomous Distributed Congestion Control Scheme in WCDMA Network

    NASA Astrophysics Data System (ADS)

    Ahmad, Hafiz Farooq; Suguri, Hiroki; Choudhary, Muhammad Qaisar; Hassan, Ammar; Liaqat, Ali; Khan, Muhammad Umer

    Wireless technology has become widely popular and an important means of communication. A key issue in delivering wireless services is the problem of congestion which has an adverse impact on the Quality of Service (QoS), especially timeliness. Although a lot of work has been done in the context of RRM (Radio Resource Management), the deliverance of quality service to the end user still remains a challenge. Therefore there is need for a system that provides real-time services to the users through high assurance. We propose an intelligent agent-based approach to guarantee a predefined Service Level Agreement (SLA) with heterogeneous user requirements for appropriate bandwidth allocation in QoS sensitive cellular networks. The proposed system architecture exploits Case Based Reasoning (CBR) technique to handle RRM process of congestion management. The system accomplishes predefined SLA through the use of Retrieval and Adaptation Algorithm based on CBR case library. The proposed intelligent agent architecture gives autonomy to Radio Network Controller (RNC) or Base Station (BS) in accepting, rejecting or buffering a connection request to manage system bandwidth. Instead of simply blocking the connection request as congestion hits the system, different buffering durations are allocated to diverse classes of users based on their SLA. This increases the opportunity of connection establishment and reduces the call blocking rate extensively in changing environment. We carry out simulation of the proposed system that verifies efficient performance for congestion handling. The results also show built-in dynamism of our system to cater for variety of SLA requirements.

  9. The effect of distributed time-delays on the synchronization of neuronal networks

    NASA Astrophysics Data System (ADS)

    Kachhvah, Ajay Deep

    2017-01-01

    Here we investigate the synchronization of networks of FitzHugh-Nagumo neurons coupled in scale-free, small-world and random topologies, in the presence of distributed time delays in the coupling of neurons. We explore how the synchronization transition is affected when the time delays in the interactions between pairs of interacting neurons are non-uniform. We find that the presence of distributed time-delays does not change the behavior of the synchronization transition significantly, vis-a-vis networks with constant time-delay, where the value of the constant time-delay is the mean of the distributed delays. We also notice that a normal distribution of delays gives rise to a transition at marginally lower coupling strengths, vis-a-vis uniformly distributed delays. These trends hold across classes of networks and for varying standard deviations of the delay distribution, indicating the generality of these results. So we conclude that distributed delays, which may be typically expected in real-world situations, do not have a notable effect on synchronization. This allows results obtained with constant delays to remain relevant even in the case of randomly distributed delays.

  10. Investigation of transient overvoltages in heavily meshed low-voltage underground distribution networks

    NASA Astrophysics Data System (ADS)

    Salcedo Ulerio, Reynaldo Odalis

    The analysis of overvoltages in electrical distribution networks is of considerable significance since they may damage the power system infrastructure and the associated electrical equipment. Overvoltages in distribution networks arise due to switching transients, resonance, lightning strikes and ground faults, among other causes. The operation of network protectors (NWP), low voltage circuit breakers with directional power relay, in a secondary network prevents the continuous flow of reverse power. There are three modes of operation for the network protectors: sensitive, time delayed, and insensitive. In case of a fault, although all of the network protectors sense the fault at the same time, their operation is not simultaneous. Many of them open very quickly with opening times similar to those of the feeder breaker. However, some operate a few cycles later, others take several seconds to open and a few might even fail to operate. Therefore, depending on the settings of the network protectors, faults can last for significantly long time due to backfeeding of current from the low voltage (LV) network into the medium voltage (MV) network. In this work, low voltages are defined as 208V/460V and medium voltage are defined as 25kV/35kV. This thesis presents overvoltages which arise because of the occurrence of a single-line-to-ground (SLG) fault on the MV side (connected in delta) of the system. The thesis reveals that overvoltage stresses are imposed on insulation, micro-processor controlled equipment, and switching devices by overvoltages during current backfeeding. Also, it establishes a relationship between overvoltage magnitude, its duration, and the network loading conditions. Overvoltages above 3 p.u. may be developed as a result of a simultaneous occurrence of three phenomena: neutral displacement, Ferranti effect, and magnetic current chopping. Furthermore, this thesis exposes the possibility of occurrence of the ferro-resonance phenomena in a distribution

  11. Space Network Time Distribution and Synchronization Protocol Development for Mars Proximity Link

    NASA Technical Reports Server (NTRS)

    Woo, Simon S.; Gao, Jay L.; Mills, David

    2010-01-01

    Time distribution and synchronization in deep space network are challenging due to long propagation delays, spacecraft movements, and relativistic effects. Further, the Network Time Protocol (NTP) designed for terrestrial networks may not work properly in space. In this work, we consider the time distribution protocol based on time message exchanges similar to Network Time Protocol (NTP). We present the Proximity-1 Space Link Interleaved Time Synchronization (PITS) algorithm that can work with the CCSDS Proximity-1 Space Data Link Protocol. The PITS algorithm provides faster time synchronization via two-way time transfer over proximity links, improves scalability as the number of spacecraft increase, lowers storage space requirement for collecting time samples, and is robust against packet loss and duplication which underlying protocol mechanisms provide.

  12. Model-based control of networked distributed systems with multi-rate state feedback updates

    NASA Astrophysics Data System (ADS)

    Garcia, Eloy; Antsaklis, Panos

    2013-09-01

    This paper presents a model-based multi-rate control technique for stabilisation of uncertain discrete-time systems that transmit information through a limited bandwidth communication network. This model-based multi-rate approach is applied to two networked architectures. First, we discuss the implementation of a centralised control system with distributed sensing capabilities and, second, we address the problem of stabilisation of networks of coupled subsystems with distributed sensors and controllers. In both cases, we provide necessary and sufficient conditions for stability of the uncertain system with multi-rate model updates. Furthermore, we show that, in general, an important reduction of network bandwidth can be obtained using the multi-rate approach with respect to the single-rate implementations. Finally, an extension is provided that addresses restricted access to the communication channel.

  13. Distributed Recurrent Neural Networks for Cooperative Control of Manipulators: A Game-Theoretic Perspective.

    PubMed

    Li, Shuai; He, Jinbo; Li, Yangming; Rafique, Muhammad Usman

    2017-02-01

    This paper considers cooperative kinematic control of multiple manipulators using distributed recurrent neural networks and provides a tractable way to extend existing results on individual manipulator control using recurrent neural networks to the scenario with the coordination of multiple manipulators. The problem is formulated as a constrained game, where energy consumptions for each manipulator, saturations of control input, and the topological constraints imposed by the communication graph are considered. An implicit form of the Nash equilibrium for the game is obtained by converting the problem into its dual space. Then, a distributed dynamic controller based on recurrent neural networks is devised to drive the system toward the desired Nash equilibrium to seek the optimal solution of the cooperative control. Global stability and solution optimality of the proposed neural networks are proved in the theory. Simulations demonstrate the effectiveness of the proposed method.

  14. Analytic solutions for links and triangles distributions in finite Barabási-Albert networks

    NASA Astrophysics Data System (ADS)

    Ferreira, Ricardo M.; de Almeida, Rita M. C.; Brunnet, Leonardo G.

    2017-01-01

    Barabási-Albert model describes many different natural networks, often yielding sensible explanations to the subjacent dynamics. However, finite size effects may prevent from discerning among different underlying physical mechanisms and from determining whether a particular finite system is driven by Barabási-Albert dynamics. Here we propose master equations for the evolution of the degrees, links and triangles distributions, solve them both analytically and by numerical iteration, and compare with numerical simulations. The analytic solutions for all these distributions predict the network evolution for systems as small as 100 nodes. The analytic method we developed is applicable for other classes of networks, representing a powerful tool to investigate the evolution of natural networks.

  15. Resilient distributed control in the presence of misbehaving agents in networked control systems.

    PubMed

    Zeng, Wente; Chow, Mo-Yuen

    2014-11-01

    In this paper, we study the problem of reaching a consensus among all the agents in the networked control systems (NCS) in the presence of misbehaving agents. A reputation-based resilient distributed control algorithm is first proposed for the leader-follower consensus network. The proposed algorithm embeds a resilience mechanism that includes four phases (detection, mitigation, identification, and update), into the control process in a distributed manner. At each phase, every agent only uses local and one-hop neighbors' information to identify and isolate the misbehaving agents, and even compensate their effect on the system. We then extend the proposed algorithm to the leaderless consensus network by introducing and adding two recovery schemes (rollback and excitation recovery) into the current framework to guarantee the accurate convergence of the well-behaving agents in NCS. The effectiveness of the proposed method is demonstrated through case studies in multirobot formation control and wireless sensor networks.

  16. Electrical breakdown in a fuse network with random, continuously distributed breaking strengths

    NASA Astrophysics Data System (ADS)

    Kahng, B.; Batrouni, G. G.; Redner, S.; de Arcangelis, L.; Herrmann, H. J.

    1988-05-01

    We investigate the breakdown properties of a random resistor-fuse network in which each network element behaves as a linear resistor if the voltage drop is less than a threshold value, but then ``burns out'' and changes irreversibly to an insulator for larger voltages. We consider a fully occupied network in which each resistor has the same resistance (in the linear regime), and with the threshold voltage drop uniformly distributed over the range v-=1-w/2 to v+=1+w/2 (0network. For sufficiently small w, ``brittle'' fracture occurs, in which catastrophic breaking is triggered by the failure of a vanishingly small fraction of bonds in the network. In this regime, the average voltage drop per unit length required to break the network, , varies as v-+O(1/L2), and L-->∞, and the distribution of breakdown voltages decays exponentially in vb. By probabilistic arguments, we also establish the existence of a transition between this brittle regime and a ``ductile'' regime at a critical value of w=wc(L), which approaches 2, as L-->∞. This suggests that the fuse network fails by brittle fracture in the thermodynamic limit, except in the extreme case where the distribution of bond strengths includes the value zero. The ductile regime, w>wc(L), is characterized by crack growth which is driven by increases in the external potential, before the network reaches the breaking point. For this case, numerical simulations indicate that the average breaking potential decreases as 1/(lnL)y, with y<=0.8, and that the distribution of breakdown voltages has a double experimental form. Numerical simulations are also performed to provide a geometrical description of the details of the breaking process as a function of w.

  17. A Network-Aware Distributed Storage Cache for Data Intensive Environments

    SciTech Connect

    Tierney, B.L.; Lee, J.R.; Johnston, W.E.; Crowley, B.; Holding, M.

    1999-12-23

    Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data at multiple sites around the world. The technologies, the middleware services, and the architectures that are used to build useful high-speed, wide area distributed systems, constitute the field of data intensive computing. In this paper the authors describe an architecture for data intensive applications where they use a high-speed distributed data cache as a common element for all of the sources and sinks of data. This cache-based approach provides standard interfaces to a large, application-oriented, distributed, on-line, transient storage system. They describe their implementation of this cache, how they have made it network aware, and how they do dynamic load balancing based on the current network conditions. They also show large increases in application throughput by access to knowledge of the network conditions.

  18. The European ALMA Regional Centre Network: A Geographically Distributed User Support Model

    NASA Astrophysics Data System (ADS)

    Hatziminaoglou, E.; Zwaan, M.; Andreani, P.; Barta, M.; Bertoldi, F.; Brand, J.; Gueth, F.; Hogerheijde, M.; Maercker, M.; Massardi, M.; Muehle, S.; Muxlow, Th.; Richards, A.; Schilke, P.; Tilanus, R.; Vlemmings, W.; Afonso, J.; Messias, H.

    2015-12-01

    In recent years there has been a paradigm shift from centralised to geographically distributed resources. Individual entities are no longer able to host or afford the necessary expertise in-house, and, as a consequence, society increasingly relies on widespread collaborations. Although such collaborations are now the norm for scientific projects, more technical structures providing support to a distributed scientific community without direct financial or other material benefits are scarce. The network of European ALMA Regional Centre (ARC) nodes is an example of such an internationally distributed user support network. It is an organised effort to provide the European ALMA user community with uniform expert support to enable optimal usage and scientific output of the ALMA facility. The network model for the European ARC nodes is described in terms of its organisation, communication strategies and user support.

  19. Distributed adaptive tracking control for synchronization of unknown networked Lagrangian systems.

    PubMed

    Chen, Gang; Lewis, Frank L

    2011-06-01

    This paper investigates the cooperative tracking control problem for a group of Lagrangian vehicle systems with directed communication graph topology. All the vehicles can have different dynamics. A design method for a distributed adaptive protocol is given which guarantees that all the networked systems synchronize to the motion of a target system. The dynamics of the networked systems, as well as the target system, are all assumed unknown. A neural network (NN) is used at each node to approximate the distributed dynamics. The resulting protocol consists of a simple decentralized proportional-plus-derivative term and a nonlinear term with distributed adaptive tuning laws at each node. The case with nonconstant NN approximation error is considered. There, a robust term is added to suppress the external disturbances and the approximation errors of the NNs. Simulation examples are included to demonstrate the effectiveness of the proposed algorithms.

  20. Operations management in distribution networks within a smart city framework.

    PubMed

    Cerulli, Raffaele; Dameri, Renata Paola; Sciomachen, Anna

    2017-02-20

    This article studies a vehicle routing problem with environmental constraints that are motivated by the requirements for sustainable urban transport. The empirical research presents a fleet planning problem that takes into consideration both minimum cost vehicle routes and minimum pollution. The problem is formulated as a mixed integer linear programming model and experimentally validated using data collected from a real situation: a grocery company delivering goods ordered via e-channels to customers spread in the urban and metropolitan area of Genoa smart city. The proposed model is a variant of the vehicle routing problem tailored to include environmental issues and street limitations. Its novelty regards also the use of real data instances provided by the B2C grocery company. Managerial implications are the choice of both the routes and the number and type of vehicles. Results show that commercial distribution strategies achieve better results in term of both business and environmental performance, provided the smart mobility goals and constraints are included into the distribution model from the beginning.

  1. Censoring distributed nonlinear state estimates in radar networks

    NASA Astrophysics Data System (ADS)

    Conte, Armond S.; Niu, Ruixin

    2016-05-01

    In a distributed radar track fusion system, it is desired to limit the communication rate between the sensors and the central node to only the most relevant information available. One way to do this is to use some metric that judges quantity of new information available, in comparison to that which has already been provided. The J-Divergence is a symmetric metric, derived from the Kullback-Liebler divergence, which performs a comparison of the statistical distance between two probability distributions. For the comparison between new and old data, a large J-Divergence can represent the existence of new information, while a small J-Divergence represents the lack of new information. Previous work included an application where the J-Divergence was used to limit data for scenarios in which the primary state estimator was an Extended Kalman Filter and used only Gaussian approximations at the local sensors. This paper expands the range of estimators to particle filters in order to account for situations where censoring is desired to be applied to non-linear/non-Gaussian environments. A derivation of the J-Divergence between probability density functions (PDFs) which are approximated by particles is provided for use in a non-feedback fusion case. An example application is given involving a 2D radar tracking scenario using the J-Divergences of a particle filter with the Gaussian approximation and a particle filter with the approximated discrete prior/posterior PDFs.

  2. A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

    NASA Technical Reports Server (NTRS)

    Bhaduri, Kanishka; Srivastava, Ashok N.

    2009-01-01

    This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining tasks in a distributed environment such as clustering, anomaly detection, target tracking to name a few. This technology is crucial for many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Centralizing all or some of the data for building global models is impractical in such peer-to-peer environments because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. The distributed algorithm we have developed in this paper is provably-correct i.e. it converges to the same result compared to a similar centralized algorithm and can automatically adapt to changes to the data and the network. We show that the communication overhead of the algorithm is very low due to its local nature. This monitoring algorithm is then used as a feedback loop to sample data from the network and rebuild the model when it is outdated. We present thorough experimental results to verify our theoretical claims.

  3. Event-Triggered Distributed Average Consensus Over Directed Digital Networks With Limited Communication Bandwidth.

    PubMed

    Li, Huaqing; Chen, Guo; Huang, Tingwen; Dong, Zhaoyang; Zhu, Wei; Gao, Lan

    2016-12-01

    In this paper, we consider the event-triggered distributed average-consensus of discrete-time first-order multiagent systems with limited communication data rate and general directed network topology. In the framework of digital communication network, each agent has a real-valued state but can only exchange finite-bit binary symbolic data sequence with its neighborhood agents at each time step due to the digital communication channels with energy constraints. Novel event-triggered dynamic encoder and decoder for each agent are designed, based on which a distributed control algorithm is proposed. A scheme that selects the number of channel quantization level (number of bits) at each time step is developed, under which all the quantizers in the network are never saturated. The convergence rate of consensus is explicitly characterized, which is related to the scale of network, the maximum degree of nodes, the network structure, the scaling function, the quantization interval, the initial states of agents, the control gain and the event gain. It is also found that under the designed event-triggered protocol, by selecting suitable parameters, for any directed digital network containing a spanning tree, the distributed average consensus can be always achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. Two simulation examples are provided to illustrate the feasibility of presented protocol and the correctness of the theoretical results.

  4. Neighbor network in a polydisperse hard-disk fluid: degree distribution and assortativity.

    PubMed

    Chremos, Alexandros; Camp, Philip J

    2007-11-01

    The neighbor network in a two-dimensional polydisperse hard-disk fluid with diameter distribution p(sigma) approximately sigma(-4) is examined using constant-pressure Monte Carlo simulations. Graphs are constructed from vertices (disks) with edges (links) connecting each vertex to k neighboring vertices defined by a radical tessellation. At packing fractions in the range 0.24< or =eta< or =0.36, the decay of the network degree distribution is observed to be consistent with the power law k(-gamma) where the exponent lies in the range 5.6< or =gamma< or =6.0 . Comparisons with the predictions of a maximum-entropy theory suggest that this apparent power-law behavior is not the asymptotic one and that p(k) approximately k(-4) in the limit k-->infinity. This is consistent with the simple idea that for large disks, the number of neighbors is proportional to the disk diameter. A power-law decay of the network degree distribution is one of the characteristics of a scale-free network. The assortativity of the network is measured and is found to be positive, meaning that vertices of equal degree are connected more often than in a random network. Finally, the equation of state is determined and compared with the prediction from a scaled-particle theory. Very good agreement between simulation and theory is demonstrated.

  5. Data fusion on a distributed heterogeneous sensor network.

    SciTech Connect

    Lamborn, Peter; Williams, Pamela J.

    2006-02-01

    Alarm-based sensor systems are being explored as a tool to expand perimeter security for facilities and force protection. However, the collection of increased sensor data has resulted in an insufficient solution that includes faulty data points. Data analysis is needed to reduce nuisance and false alarms, which will improve officials decision making and confidence levels in the system's alarms. Moreover, operational costs can be allayed and losses mitigated if authorities are alerted only when a real threat is detected. In the current system, heuristics such as persistence of alarm and type of sensor that detected an event are used to guide officials responses. We hypothesize that fusing data from heterogeneous sensors in the sensor field can provide more complete situational awareness than looking at individual sensor data. We propose a two stage approach to reduce false alarms. First, we use self organizing maps to cluster sensors based on global positioning coordinates and then train classifiers on the within cluster data to obtain a local view of the event. Next, we train a classifier on the local results to compute a global solution. We investigate the use of machine learning techniques, such as k-nearest neighbor, neural networks, and support vector machines to improve alarm accuracy. On simulated sensor data, the proposed approach identifies false alarms with greater accuracy than a weighted voting algorithm.

  6. A cognitive information processing framework for distributed sensor networks

    NASA Astrophysics Data System (ADS)

    Wang, Feiyi; Qi, Hairong

    2004-09-01

    In this paper, we present a cognitive agent framework (CAF) based on swarm intelligence and self-organization principles, and demonstrate it through collaborative processing for target classification in sensor networks. The framework involves integrated designs to provide both cognitive behavior at the organization level to conquer complexity and reactive behavior at the individual agent level to retain simplicity. The design tackles various problems in the current information processing systems, including overly complex systems, maintenance difficulties, increasing vulnerability to attack, lack of capability to tolerate faults, and inability to identify and cope with low-frequency patterns. An important and distinguishing point of the presented work from classical AI research is that the acquired intelligence does not pertain to distinct individuals but to groups. It also deviates from multi-agent systems (MAS) due to sheer quantity of extremely simple agents we are able to accommodate, to the degree that some loss of coordination messages and behavior of faulty/compromised agents will not affect the collective decision made by the group.

  7. Network effects across the earnings distribution: payoffs to visible and invisible job finding assistance.

    PubMed

    McDonald, Steve

    2015-01-01

    This study makes three critical contributions to the "Do Contacts Matter?" debate. First, the widely reported null relationship between informal job searching and wages is shown to be mostly the artifact of a coding error and sample selection restrictions. Second, previous analyses examined only active informal job searching without fully considering the benefits derived from unsolicited network assistance (the "invisible hand of social capital") - thereby underestimating the network effect. Third, wage returns to networks are examined across the earnings distribution. Longitudinal data from the NLSY reveal significant wage returns for network-based job finding over formal job searching, especially for individuals who were informally recruited into their jobs (non-searchers). Fixed effects quantile regression analyses show that contacts generate wage premiums among middle and high wage jobs, but not low wage jobs. These findings challenge conventional wisdom on contact effects and advance understanding of how social networks affect wage attainment and inequality.

  8. Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks

    PubMed Central

    Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S.

    2015-01-01

    The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the “critical degree” (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology. PMID:26207631

  9. Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks.

    PubMed

    Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S

    2015-01-01

    The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the "critical degree" (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology.

  10. Distribution of Orientation Selectivity in Recurrent Networks of Spiking Neurons with Different Random Topologies

    PubMed Central

    Sadeh, Sadra; Rotter, Stefan

    2014-01-01

    Neurons in the primary visual cortex are more or less selective for the orientation of a light bar used for stimulation. A broad distribution of individual grades of orientation selectivity has in fact been reported in all species. A possible reason for emergence of broad distributions is the recurrent network within which the stimulus is being processed. Here we compute the distribution of orientation selectivity in randomly connected model networks that are equipped with different spatial patterns of connectivity. We show that, for a wide variety of connectivity patterns, a linear theory based on firing rates accurately approximates the outcome of direct numerical simulations of networks of spiking neurons. Distance dependent connectivity in networks with a more biologically realistic structure does not compromise our linear analysis, as long as the linearized dynamics, and hence the uniform asynchronous irregular activity state, remain stable. We conclude that linear mechanisms of stimulus processing are indeed responsible for the emergence of orientation selectivity and its distribution in recurrent networks with functionally heterogeneous synaptic connectivity. PMID:25469704

  11. Improved Cost-Base Design of Water Distribution Networks using Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Moradzadeh Azar, Foad; Abghari, Hirad; Taghi Alami, Mohammad; Weijs, Steven

    2010-05-01

    Population growth and progressive extension of urbanization in different places of Iran cause an increasing demand for primary needs. The water, this vital liquid is the most important natural need for human life. Providing this natural need is requires the design and construction of water distribution networks, that incur enormous costs on the country's budget. Any reduction in these costs enable more people from society to access extreme profit least cost. Therefore, investment of Municipal councils need to maximize benefits or minimize expenditures. To achieve this purpose, the engineering design depends on the cost optimization techniques. This paper, presents optimization models based on genetic algorithm(GA) to find out the minimum design cost Mahabad City's (North West, Iran) water distribution network. By designing two models and comparing the resulting costs, the abilities of GA were determined. the GA based model could find optimum pipe diameters to reduce the design costs of network. Results show that the water distribution network design using Genetic Algorithm could lead to reduction of at least 7% in project costs in comparison to the classic model. Keywords: Genetic Algorithm, Optimum Design of Water Distribution Network, Mahabad City, Iran.

  12. Exponential Stability of Almost Periodic Solutions for Memristor-Based Neural Networks with Distributed Leakage Delays.

    PubMed

    Xu, Changjin; Li, Peiluan; Pang, Yicheng

    2016-12-01

    In this letter, we deal with a class of memristor-based neural networks with distributed leakage delays. By applying a new Lyapunov function method, we obtain some sufficient conditions that ensure the existence, uniqueness, and global exponential stability of almost periodic solutions of neural networks. We apply the results of this solution to prove the existence and stability of periodic solutions for this delayed neural network with periodic coefficients. We then provide an example to illustrate the effectiveness of the theoretical results. Our results are completely new and complement the previous studies Chen, Zeng, and Jiang ( 2014 ) and Jiang, Zeng, and Chen ( 2015 ).

  13. Polarization recovery and auto-compensation in quantum key distribution network

    NASA Astrophysics Data System (ADS)

    Ma, Lijun; Xu, Hai; Tang, Xiao

    2006-08-01

    A Quantum Key Distribution (QKD) network can allow multi-user communication via secure key. Moreover, by actively switching communication nodes, one can achieve high key transmission rate for the selected nodes. However, the polarization properties of different fiber path are different and these properties also randomly drift over time. Therefore, polarization recovery after the switching and auto-compensation during key transmission are critical for the QKD network. In this work, we use programmable polarization controllers to implement polarization recovery and auto-compensation in the QKD network. We will also discuss its time limitation and future improvement.

  14. Sampling cluster stability for peer-to-peer based content distribution networks

    NASA Astrophysics Data System (ADS)

    Darlagiannis, Vasilios; Mauthe, Andreas; Steinmetz, Ralf

    2006-01-01

    Several types of Content Distribution Networks are being deployed over the Internet today, based on different architectures to meet their requirements (e.g., scalability, efficiency and resiliency). Peer-to-Peer (P2P) based Content Distribution Networks are promising approaches that have several advantages. Structured P2P networks, for instance, take a proactive approach and provide efficient routing mechanisms. Nevertheless, their maintenance can increase considerably in highly dynamic P2P environments. In order to address this issue, a two-tier architecture that combines a structured overlay network with a clustering mechanism is suggested in a hybrid scheme. In this paper, we examine several sampling algorithms utilized in the aforementioned hybrid network that collect local information in order to apply a selective join procedure. The algorithms are based mostly on random walks inside the overlay network. The aim of the selective join procedure is to provide a well balanced and stable overlay infrastructure that can easily overcome the unreliable behavior of the autonomous peers that constitute the network. The sampling algorithms are evaluated using simulation experiments where several properties related to the graph structure are revealed.

  15. Engineering Building And Campus Networks For Fiber Distributed Data Interface (FDDI)

    NASA Astrophysics Data System (ADS)

    McIntosh, Thomas F.

    1990-01-01

    The FDDI standard provides a high speed optical channel for interconnection among mainframes and peripherals, and for use as a backbone network between lower speed local area networks (LANs). As FDDI networks move out of the data center environment, detailed engineering rules are required to construct and administer the dual ring architectures for building and campus applications. This paper examines generic building and campus layouts, and demonstrates the implementation of the logical rings within the star physical topology of the AT&T Premises Distribution System (PDS). A companion paper presents optical performance models to determine distance limitations of the cable plant for these networks, with or without optical bypass switches.' The networks addressed range from a single closet, to a single multi-floor building, to a campus involving multiple buildings. Standard interfaces to the distribution system are defined for each administrative location in the generic building layout. Uniform jumper configurations are specified for cross-connections among the interfaces, which form the network into a dual ring architecture. Using the design guidelines presented, networks of any size and configuration can be constructed which conform to the FDDI dual ring standard.

  16. Characterizing short-term stability for Boolean networks over any distribution of transfer functions.

    PubMed

    Seshadhri, C; Smith, Andrew M; Vorobeychik, Yevgeniy; Mayo, Jackson R; Armstrong, Robert C

    2016-07-01

    We present a characterization of short-term stability of Kauffman's NK (random) Boolean networks under arbitrary distributions of transfer functions. Given such a Boolean network where each transfer function is drawn from the same distribution, we present a formula that determines whether short-term chaos (damage spreading) will happen. Our main technical tool which enables the formal proof of this formula is the Fourier analysis of Boolean functions, which describes such functions as multilinear polynomials over the inputs. Numerical simulations on mixtures of threshold functions and nested canalyzing functions demonstrate the formula's correctness.

  17. Characterizing short-term stability for Boolean networks over any distribution of transfer functions

    NASA Astrophysics Data System (ADS)

    Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.

    2016-07-01

    We present a characterization of short-term stability of Kauffman's N K (random) Boolean networks under arbitrary distributions of transfer functions. Given such a Boolean network where each transfer function is drawn from the same distribution, we present a formula that determines whether short-term chaos (damage spreading) will happen. Our main technical tool which enables the formal proof of this formula is the Fourier analysis of Boolean functions, which describes such functions as multilinear polynomials over the inputs. Numerical simulations on mixtures of threshold functions and nested canalyzing functions demonstrate the formula's correctness.

  18. Degree Distribution of Position-Dependent Ball-Passing Networks in Football Games

    NASA Astrophysics Data System (ADS)

    Narizuka, Takuma; Yamamoto, Ken; Yamazaki, Yoshihiro

    2015-08-01

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

  19. Species-free species distribution models describe macroecological properties of protected area networks.

    PubMed

    Robinson, Jason L; Fordyce, James A

    2017-01-01

    Among the greatest challenges facing the conservation of plants and animal species in protected areas are threats from a rapidly changing climate. An altered climate creates both challenges and opportunities for improving the management of protected areas in networks. Increasingly, quantitative tools like species distribution modeling are used to assess the performance of protected areas and predict potential responses to changing climates for groups of species, within a predictive framework. At larger geographic domains and scales, protected area network units have spatial geoclimatic properties that can be described in the gap analysis typically used to measure or aggregate the geographic distributions of species (stacked species distribution models, or S-SDM). We extend the use of species distribution modeling techniques in order to model the climate envelope (or "footprint") of individual protected areas within a network of protected areas distributed across the 48 conterminous United States and managed by the US National Park System. In our approach we treat each protected area as the geographic range of a hypothetical endemic species, then use MaxEnt and 5 uncorrelated BioClim variables to model the geographic distribution of the climatic envelope associated with each protected area unit (modeling the geographic area of park units as the range of a species). We describe the individual and aggregated climate envelopes predicted by a large network of 163 protected areas and briefly illustrate how macroecological measures of geodiversity can be derived from our analysis of the landscape ecological context of protected areas. To estimate trajectories of change in the temporal distribution of climatic features within a protected area network, we projected the climate envelopes of protected areas in current conditions onto a dataset of predicted future climatic conditions. Our results suggest that the climate envelopes of some parks may be locally unique or have

  20. Optical-network-connected multi-channel 96-GHz-band distributed radar system

    NASA Astrophysics Data System (ADS)

    Kanno, Atsushi; Kuri, Toshiaki; Kawanishi, Tetsuya

    2015-05-01

    The millimeter-wave (MMW) radar is a promising candidate for high-precision imaging because of its short wavelength and broad range of available bandwidths. In particular in the frequency range of 92-100 GHz, which is regulated for radiolocation, an atmospheric attenuation coefficient less than 1 dB/km limits the imaging range. Therefore, a combination of MMW radar and distributed antenna system directly connected to optical fiber networks can realize both high-precision imaging and large-area surveillance. In this paper, we demonstrate a multi-channel MMW frequency-modulated continuous-wave distributed radar system connected to an analog radio-over-fiber network.

  1. Species-free species distribution models describe macroecological properties of protected area networks

    PubMed Central

    Fordyce, James A.

    2017-01-01

    Among the greatest challenges facing the conservation of plants and animal species in protected areas are threats from a rapidly changing climate. An altered climate creates both challenges and opportunities for improving the management of protected areas in networks. Increasingly, quantitative tools like species distribution modeling are used to assess the performance of protected areas and predict potential responses to changing climates for groups of species, within a predictive framework. At larger geographic domains and scales, protected area network units have spatial geoclimatic properties that can be described in the gap analysis typically used to measure or aggregate the geographic distributions of species (stacked species distribution models, or S-SDM). We extend the use of species distribution modeling techniques in order to model the climate envelope (or “footprint”) of individual protected areas within a network of protected areas distributed across the 48 conterminous United States and managed by the US National Park System. In our approach we treat each protected area as the geographic range of a hypothetical endemic species, then use MaxEnt and 5 uncorrelated BioClim variables to model the geographic distribution of the climatic envelope associated with each protected area unit (modeling the geographic area of park units as the range of a species). We describe the individual and aggregated climate envelopes predicted by a large network of 163 protected areas and briefly illustrate how macroecological measures of geodiversity can be derived from our analysis of the landscape ecological context of protected areas. To estimate trajectories of change in the temporal distribution of climatic features within a protected area network, we projected the climate envelopes of protected areas in current conditions onto a dataset of predicted future climatic conditions. Our results suggest that the climate envelopes of some parks may be locally unique or

  2. OCEAN-PC and a distributed network for ocean data

    NASA Technical Reports Server (NTRS)

    Mclain, Douglas R.

    1992-01-01

    The Intergovernmental Oceanographic Commission (IOC) wishes to develop an integrated software package for oceanographic data entry and access in developing countries. The software, called 'OCEAN-PC', would run on low cost PC microcomputers and would encourage and standardize: (1) entry of local ocean observations; (2) quality control of the local data; (3) merging local data with historical data; (4) improved display and analysis of the merged data; and (5) international data exchange. OCEAN-PC will link existing MS-DOS oceanographic programs and data sets with table-driven format conversions. Since many ocean data sets are now being distributed on optical discs (Compact Discs - Read Only Memory, CD-ROM, Mass et al. 1987), OCEAN-PC will emphasize access to CD-ROMs.

  3. Voltage variation due to solar photovoltaic in distribution network

    NASA Astrophysics Data System (ADS)

    Azad, H. I.; Ramachandaramurthy, V. K.; >Hesamaldin Maleki,

    2013-06-01

    Grid integration of solar photovoltaic (PV) plant offers reduction in greenhouse emissions and independence from fossil fuels for power generation. The integration of such forms of power generation also brings with it a variety of policy and technical issues. One of the technical issues is the variation in grid voltages in the presence of solar photovoltaic (PV) plant, resulting in degradation of power quality. In this paper, the application of a dq current controller to limit the voltage variation at the point of common coupling (PCC) due to a 2 MW solar photovoltaic (PV) plant will be discussed. The controller's goal is to ensure that the voltage variation meets the momentary voltage change limits specified in TNB's Technical Guidebook for the connection of distributed generation. The proposed dq current controller is shown to be able to limit the voltage variation.

  4. Origins of power-law degree distribution in the heterogeneity of human activity in social networks

    PubMed Central

    Muchnik, Lev; Pei, Sen; Parra, Lucas C.; Reis, Saulo D. S.; Andrade Jr, José S.; Havlin, Shlomo; Makse, Hernán A.

    2013-01-01

    The probability distribution of number of ties of an individual in a social network follows a scale-free power-law. However, how this distribution arises has not been conclusively demonstrated in direct analyses of people's actions in social networks. Here, we perform a causal inference analysis and find an underlying cause for this phenomenon. Our analysis indicates that heavy-tailed degree distribution is causally determined by similarly skewed distribution of human activity. Specifically, the degree of an individual is entirely random - following a “maximum entropy attachment” model - except for its mean value which depends deterministically on the volume of the users' activity. This relation cannot be explained by interactive models, like preferential attachment, since the observed actions are not likely to be caused by interactions with other people. PMID:23648793

  5. A Study of Economical Incentives for Voltage Profile Control Method in Future Distribution Network

    NASA Astrophysics Data System (ADS)

    Tsuji, Takao; Sato, Noriyuki; Hashiguchi, Takuhei; Goda, Tadahiro; Tange, Seiji; Nomura, Toshio

    In a future distribution network, it is difficult to maintain system voltage because a large number of distributed generators are introduced to the system. The authors have proposed “voltage profile control method” using power factor control of distributed generators in the previous work. However, the economical disbenefit is caused by the active power decrease when the power factor is controlled in order to increase the reactive power. Therefore, proper incentives must be given to the customers that corporate to the voltage profile control method. Thus, in this paper, we develop a new rules which can decide the economical incentives to the customers. The method is tested in one feeder distribution network model and its effectiveness is shown.

  6. Origins of power-law degree distribution in the heterogeneity of human activity in social networks.

    PubMed

    Muchnik, Lev; Pei, Sen; Parra, Lucas C; Reis, Saulo D S; Andrade, José S; Havlin, Shlomo; Makse, Hernán A

    2013-01-01

    The probability distribution of number of ties of an individual in a social network follows a scale-free power-law. However, how this distribution arises has not been conclusively demonstrated in direct analyses of people's actions in social networks. Here, we perform a causal inference analysis and find an underlying cause for this phenomenon. Our analysis indicates that heavy-tailed degree distribution is causally determined by similarly skewed distribution of human activity. Specifically, the degree of an individual is entirely random - following a "maximum entropy attachment" model - except for its mean value which depends deterministically on the volume of the users' activity. This relation cannot be explained by interactive models, like preferential attachment, since the observed actions are not likely to be caused by interactions with other people.

  7. A Distributed Transmission Rate Adjustment Algorithm in Heterogeneous CSMA/CA Networks

    PubMed Central

    Xie, Shuanglong; Low, Kay Soon; Gunawan, Erry

    2015-01-01

    Distributed transmission rate tuning is important for a wide variety of IEEE 802.15.4 network applications such as industrial network control systems. Such systems often require each node to sustain certain throughput demand in order to guarantee the system performance. It is thus essential to determine a proper transmission rate that can meet the application requirement and compensate for network imperfections (e.g., packet loss). Such a tuning in a heterogeneous network is difficult due to the lack of modeling techniques that can deal with the heterogeneity of the network as well as the network traffic changes. In this paper, a distributed transmission rate tuning algorithm in a heterogeneous IEEE 802.15.4 CSMA/CA network is proposed. Each node uses the results of clear channel assessment (CCA) to estimate the busy channel probability. Then a mathematical framework is developed to estimate the on-going heterogeneous traffics using the busy channel probability at runtime. Finally a distributed algorithm is derived to tune the transmission rate of each node to accurately meet the throughput requirement. The algorithm does not require modifications on IEEE 802.15.4 MAC layer and it has been experimentally implemented and extensively tested using TelosB nodes with the TinyOS protocol stack. The results reveal that the algorithm is accurate and can satisfy the throughput demand. Compared with existing techniques, the algorithm is fully distributed and thus does not require any central coordination. With this property, it is able to adapt to traffic changes and re-adjust the transmission rate to the desired level, which cannot be achieved using the traditional modeling techniques. PMID:25822140

  8. Distributed Permafrost Observation Network in Western Alaska: the First Results

    NASA Astrophysics Data System (ADS)

    Romanovsky, V. E.; Cable, W.; Marchenko, S. S.; Panda, S. K.

    2014-12-01

    The area of Western Alaska including the Selawik National Wildlife Refuge (SNWR) is generally underrepresented in terms of permafrost thermal monitoring. Thus, the main objective of this study was to establish a permafrost monitoring network in Western Alaska in order to understand the spatial variability in permafrost thermal regime in the area and to have a baseline in order to detect future change. Present and future thawing of permafrost in the region will have a dramatic effect on the ecosystems and infrastructure because the permafrost here generally has a high ice content, as a result of preservation of old ground ice in these relatively cold regions even during the warmer time intervals of the Holocene. Over the summers of 2011 and 2012 a total of 26 automated monitoring stations were established to collect temperature data from the active layer and near-surface permafrost. While most of these stations were basic and only measured the temperature down to 1.5 m at 4 depths, three of the stations had higher vertical temperature resolution down to 3 m. The sites were selected using an ecotype (basic vegetation groups) map of very high resolution (30 m) that had been created for the area in 2009. We found the Upland Dwarf Birch-Tussock Shrub ecotype to be the coldest with a mean annual ground temperature at 1 meter (MAGT1.0) of -3.9 °C during the August 1st, 2012 to July 31st, 2013 measurement period. This is also the most widespread ecotype in the SNWR, covering approximately 28.4% by area. The next widespread ecotype in the SNWR is the Lowland and Upland Birch-Ericaceous Low Shrub. This ecotype had higher ground temperatures with an average MAGT1.0 of -2.4 °C during the same measurement period. We also found that within some ecotypes (White Spruce and Alder-Willow Shrub) the presence or absence of moss on the surface seems to indicate the presence or absence of near surface permafrost. In general, we found good agreement between ecotype classes and

  9. Distributed Network Control for Mobile Multi-Modal Wireless Sensor Networks

    DTIC Science & Technology

    2010-08-19

    sensors is more prevalent than in an open field or underwater due to buildings, people, motor ve- hicles, and so on. We simulated the sensor network in an...roads arranged as a Manhattan -like grid (see Figure 6): pressure sensors, video sensors (cameras), and magnetic sensors. A large brown block represents

  10. Distributed Space Situational Awareness (D-SSA) With A Satellite-Assisted Collaborative Space Surveillance Network

    DTIC Science & Technology

    2011-01-01

    R. and Murray, R.M. (2004). Consensus problems in networks of agents with switching topology and time -delays. IEEE Trans. Autom. Control, 49(9), 1520... consensus tracking problem on a time -varying graph with incomplete data and noisy communications links. We propose a distributed and collaborative framework...proposed distributed tracking with consensus algorithm. The performance results show that the proposed algorithm indeed performs very well under conditions

  11. Biology-Inspired Distributed Consensus in Massively-Deployed Sensor Networks

    NASA Technical Reports Server (NTRS)

    Jones, Kennie H.; Lodding, Kenneth N.; Olariu, Stephan; Wilson, Larry; Xin, Chunsheng

    2005-01-01

    Promises of ubiquitous control of the physical environment by large-scale wireless sensor networks open avenues for new applications that are expected to redefine the way we live and work. Most of recent research has concentrated on developing techniques for performing relatively simple tasks in small-scale sensor networks assuming some form of centralized control. The main contribution of this work is to propose a new way of looking at large-scale sensor networks, motivated by lessons learned from the way biological ecosystems are organized. Indeed, we believe that techniques used in small-scale sensor networks are not likely to scale to large networks; that such large-scale networks must be viewed as an ecosystem in which the sensors/effectors are organisms whose autonomous actions, based on local information, combine in a communal way to produce global results. As an example of a useful function, we demonstrate that fully distributed consensus can be attained in a scalable fashion in massively deployed sensor networks where individual motes operate based on local information, making local decisions that are aggregated across the network to achieve globally-meaningful effects.

  12. Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

    NASA Technical Reports Server (NTRS)

    Fathpour, Nanaz; Hadaegh, Fred Y.; Mesbahi, Mehran; Rahmani, Amirreza

    2011-01-01

    Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation-flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are proposed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms rely on a local information exchange network, relaxing the assumptions on existing algorithms. Distributed space systems rely on a signal transmission network among multiple spacecraft for their operation. Control and coordination among multiple spacecraft in a formation is facilitated via a network of relative sensing and interspacecraft communications. Guidance, navigation, and control rely on the sensing network. This network becomes more complex the more spacecraft are added, or as mission requirements become more complex. The observability of a formation state was observed by a set of local observations from a particular node in the formation. Formation observability can be parameterized in terms of the matrices appearing in the formation dynamics and observation matrices. An agreement protocol was used as a mechanism for observing formation states from local measurements. An agreement protocol is essentially an unforced dynamic system whose trajectory is governed by the interconnection geometry and initial condition of each node, with a goal of reaching a common value of interest. The observability of the interconnected system depends on the geometry of the network, as well as the position of the observer relative to the topology. For the first time, critical GN&C (guidance, navigation, and control estimation) subsystems are synthesized by bringing the contribution of the spacecraft information-exchange network to the forefront of algorithmic analysis and design. The result is a

  13. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

    PubMed

    Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

    2015-01-01

    Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

  14. Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

    NASA Technical Reports Server (NTRS)

    Rahmani, Amirreza; Mesbahi, Mehran; Fathpour, Nanaz; Hadaegh, Fred Y.

    2008-01-01

    In this work, we develop an approach to formation estimation by explicitly characterizing formation's system-theoretic attributes in terms of the underlying inter-spacecraft information-exchange network. In particular, we approach the formation observer/estimator design by relaxing the accessibility to the global state information by a centralized observer/estimator- and in turn- providing an analysis and synthesis framework for formation observers/estimators that rely on local measurements. The noveltyof our approach hinges upon the explicit examination of the underlying distributed spacecraft network in the realm of guidance, navigation, and control algorithmic analysis and design. The overarching goal of our general research program, some of whose results are reported in this paper, is the development of distributed spacecraft estimation algorithms that are scalable, modular, and robust to variations inthe topology and link characteristics of the formation information exchange network. In this work, we consider the observability of a spacecraft formation from a single observation node and utilize the agreement protocol as a mechanism for observing formation states from local measurements. Specifically, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the observability of the corresponding multi-agent system The ramification of this notion of observability over networks is then explored in the context of distributed formation estimation.

  15. Efficient Allocation of Resources for Defense of Spatially Distributed Networks Using Agent-Based Simulation.

    PubMed

    Kroshl, William M; Sarkani, Shahram; Mazzuchi, Thomas A

    2015-09-01

    This article presents ongoing research that focuses on efficient allocation of defense resources to minimize the damage inflicted on a spatially distributed physical network such as a pipeline, water system, or power distribution system from an attack by an active adversary, recognizing the fundamental difference between preparing for natural disasters such as hurricanes, earthquakes, or even accidental systems failures and the problem of allocating resources to defend against an opponent who is aware of, and anticipating, the defender's efforts to mitigate the threat. Our approach is to utilize a combination of integer programming and agent-based modeling to allocate the defensive resources. We conceptualize the problem as a Stackelberg "leader follower" game where the defender first places his assets to defend key areas of the network, and the attacker then seeks to inflict the maximum damage possible within the constraints of resources and network structure. The criticality of arcs in the network is estimated by a deterministic network interdiction formulation, which then informs an evolutionary agent-based simulation. The evolutionary agent-based simulation is used to determine the allocation of resources for attackers and defenders that results in evolutionary stable strategies, where actions by either side alone cannot increase its share of victories. We demonstrate these techniques on an example network, comparing the evolutionary agent-based results to a more traditional, probabilistic risk analysis (PRA) approach. Our results show that the agent-based approach results in a greater percentage of defender victories than does the PRA-based approach.

  16. Quantum key distribution for security guarantees over QoS-driven 3D satellite networks

    NASA Astrophysics Data System (ADS)

    Wang, Ping; Zhang, Xi; Chen, Genshe; Pham, Khanh; Blasch, Erik

    2014-06-01

    In recent years, quantum-based communication is emerging as a new technique for ensuring secured communications because it can guarantee absolute security between two different remote entities. Quantum communication performs the transmission and exchange of quantum information among distant nodes within a network. Quantum key distribution (QKD) is a methodology for generating and distributing random encryption keys using the principles of quantum physics. In this paper, we investigate the techniques on how to efficiently use QKD in 3D satellite networks and propose an effective method to overcome its communications-distance limitations. In order to implement secured and reliable communications over wireless satellite links, we develop a free-space quantum channel model in satellite communication networks. To enlarge the communications distances over 3D satellite networks, we propose to employ the intermediate nodes to relay the unconditional keys and guarantee the Quantum Bit Error Rate (QBER) for security requirement over 3D satellite networks. We also propose the communication model for QKD security-Quality of Service (QoS) guarantee and an adaptive cooperative routing selection scheme to optimize the throughput performance of QKD-based satellite communications networks. The obtained simulation results verify our proposed schemes.

  17. TALON - The Telescope Alert Operation Network System : intelligent linking of distributed autonomous robotic telescopes

    SciTech Connect

    White, R. R.; Wren, J.; Davis, H. R.; Galassi, M. C.; Starr, D. L.; Vestrand, W. T.; Wozniak, P. R.

    2004-01-01

    The internet has brought about great change in the astronomical community, but this interconnectivity is just starting to be exploited for use in instrumentation. Utilizing the internet for communicating between distributed astronomical systems is still in its infancy, but it already shows great potential. Here we present an example of a distributed network of telescopes that performs more efficienfiy in synchronous operation than as individual instruments. RAPid Telescopes for Optical Response (RAPTOR) is a system of telescopes at LANL that has intelligent intercommunication, combined with wide-field optics, temporal monitoring software, and deep-field follow-up capability all working in closed-loop real-time operation. The Telescope ALert Operations Network (TALON) is a network server that allows intercommunication of alert triggers from external and internal resources and controls the distribution of these to each of the telescopes on the network. TALON is designed to grow, allowing any number of telescopes to be linked together and communicate. Coupled with an intelligent alert client at each telescope, it can analyze and respond to each distributed TALON alert based on the telescopes needs and schedule.

  18. Water Quality Modeling in the Dead End Sections of Drinking Water Distribution Networks -journal article

    EPA Science Inventory

    Dead-end sections of drinking water distribution networks are known to be problematic zones in terms of water quality degradation. Extended residence time due to water stagnation leads to rapid reduction of disinfectant residuals allowing the regrowth of microbial pathogens. Wate...

  19. Water Quality Modeling in the Dead End Sections of Drinking Water Distribution Networks

    EPA Science Inventory

    Dead-end sections of drinking water distribution networks are known to be problematic zones in terms of water quality degradation. Extended residence time due to water stagnation leads to rapid reduction of disinfectant residuals allowing the regrowth of microbial pathogens. Wate...

  20. Cognitive Science Program. Hierarchical Distributed Networks in the Neuropsychology of Selective Attention.

    DTIC Science & Technology

    2014-09-26

    Neuropsychology of Selective Attention 6. PERFORMINGORG. REPORTNUMBER 7. AUTHOR(a) 8...8217 . .---.-’ . ..- , .. . • - . .. . .--.. ... . ." - *- " • ..... -- -., .-- , ’ Hierarchical Distributed Networks in the Neuropsychology of Selective Attention Michael I. Posner Department of Psychology University of Oregon...Eugene and Cognitive Neuropsychology Lab., Good Samaritan Hospital, Portland OUTLINE I. Goal of the Chapter 11. Framework for linking cognitive

  1. Variable-Length Message Transmission for Distributed Loop Computer Networks (Part I).

    ERIC Educational Resources Information Center

    Reames, C. C.; Liu, M. T.

    An introduction to the problems of variable-length message transmission in distributed loop computer networks, with a summary of previous accomplishments in the area, begins this technically-oriented document. An improved technique, overcoming some of the inadequacies in presently used techniques, is proposed together with a conceptual model of…

  2. A distributed wireless sensor network system for transportation safety and security

    NASA Astrophysics Data System (ADS)

    Chowdhury, Mashrur; Wang, Kuang-Ching; Fries, Ryan; Ma, Yongchang; Bagaria, Devang

    2007-04-01

    Given the anticipated increases in highway traffic, the scale and complexity of the traffic infrastructure will continue to grow progressively in time and in distributed geographical areas. To assure transportation efficiency, safety, and security in the presence of such growth, it is critical to identify an infrastructure development methodology that can adapt to expansions while assuring reliable operation for both centralized monitoring and distributed management. In this paper, a wireless sensor network design methodology is presented, aimed at providing effective distributed surveillance, anomaly detection, and coordinated response. The proposed methodology integrates state-of-the-art traffic sensors, with flexibly programmable controller devices that can integrate with the available traffic control equipments. The system methodology provides a paradigm in which sensors and controllers can be progressively incorporated and programmed to autonomously coordinate with peer sensors and a hierarchy of controllers to detect, notify, and react to anomalous events. Since the system can tolerate failure of parts of the system, as the network connectivity continues to increase, the proposed sensor network will have positive implications on evacuation plans during natural disasters or terrorist attacks. To illustrate the design methodology and usage, a simulated system along a freeway corridor in South Carolina was constructed in an integrated microscopic traffic and wireless sensor network simulation platform, in which distributed incident detection and response functions were implemented. The test results, including detection and false alarm rates and wireless communication latencies, are analyzed to identify insights of the system's operation and potential enhancement strategies.

  3. Modeling Multiple Human-Automation Distributed Systems using Network-form Games

    NASA Technical Reports Server (NTRS)

    Brat, Guillaume

    2012-01-01

    The paper describes at a high-level the network-form game framework (based on Bayes net and game theory), which can be used to model and analyze safety issues in large, distributed, mixed human-automation systems such as NextGen.

  4. TALON: the telescope alert operation network system: intelligent linking of distributed autonomous robotic telescopes

    NASA Astrophysics Data System (ADS)

    White, Robert R.; Wren, James; Davis, Heath R.; Galassi, Mark; Starr, Daniel; Vestrand, W. T.; Wozniak, P.

    2004-09-01

    The internet has brought about great change in the astronomical community, but this interconnectivity is just starting to be exploited for use in instrumentation. Utilizing the internet for communicating between distributed astronomical systems is still in its infancy, but it already shows great potential. Here we present an example of a distributed network of telescopes that performs more efficiently in synchronous operation than as individual instruments. RAPid Telescopes for Optical Response (RAPTOR) is a system of telescopes at LANL that has intelligent intercommunication, combined with wide-field optics, temporal monitoring software, and deep-field follow-up capability all working in closed-loop real-time operation. The Telescope ALert Operations Network (TALON) is a network server that allows intercommunication of alert triggers from external and internal resources and controls the distribution of these to each of the telescopes on the network. TALON is designed to grow, allowing any number of telescopes to be linked together and communicate. Coupled with an intelligent alert client at each telescope, it can analyze and respond to each distributed TALON alert based on the telescopes needs and schedule.

  5. Unified Framework for Deriving Simultaneous Equation Algorithms for Water Distribution Networks

    EPA Science Inventory

    The known formulations for steady state hydraulics within looped water distribution networks are re-derived in terms of linear and non-linear transformations of the original set of partly linear and partly non-linear equations that express conservation of mass and energy. All of ...

  6. Low-Power RF SOI-CMOS Technology for Distributed Sensor Networks

    NASA Technical Reports Server (NTRS)

    Dogan, Numan S.

    2003-01-01

    The objective of this work is to design and develop Low-Power RF SOI-CMOS Technology for Distributed Sensor Networks. We briefly report on the accomplishments in this work. We also list the impact of this work on graduate student research training/involvement.

  7. Energy distribution property and energy coding of a structural neural network

    PubMed Central

    Wang, Ziyin; Wang, Rubin

    2014-01-01

    Studying neural coding through neural energy is a novel view. In this paper, based on previously proposed single neuron model, the correlation between the energy consumption and the parameters of the cortex networks (amount of neurons, coupling strength, and transform delay) under an oscillational condition were researched. We found that energy distribution varies orderly as these parameters change, and it is closely related to the synchronous oscillation of the neural network. Besides, we compared this method with traditional method of relative coefficient, which shows energy method works equal to or better than the traditional one. It is novel that the synchronous activity and neural network parameters could be researched by assessing energy distribution and consumption. Therefore, the conclusion of this paper will refine the framework of neural coding theory and contribute to our understanding of the coding mechanism of the cerebral cortex. It provides a strong theoretical foundation of a novel neural coding theory—energy coding. PMID:24600382

  8. Energy distribution property and energy coding of a structural neural network.

    PubMed

    Wang, Ziyin; Wang, Rubin

    2014-01-01

    Studying neural coding through neural energy is a novel view. In this paper, based on previously proposed single neuron model, the correlation between the energy consumption and the parameters of the cortex networks (amount of neurons, coupling strength, and transform delay) under an oscillational condition were researched. We found that energy distribution varies orderly as these parameters change, and it is closely related to the synchronous oscillation of the neural network. Besides, we compared this method with traditional method of relative coefficient, which shows energy method works equal to or better than the traditional one. It is novel that the synchronous activity and neural network parameters could be researched by assessing energy distribution and consumption. Therefore, the conclusion of this paper will refine the framework of neural coding theory and contribute to our understanding of the coding mechanism of the cerebral cortex. It provides a strong theoretical foundation of a novel neural coding theory-energy coding.

  9. Video distribution techniques over WiMAX networks for m-Health applications.

    PubMed

    Markarian, Garik; Mihaylova, Lyudmila; Tsitserov, Dmitry V; Zvikhachevskaya, A

    2012-01-01

    In this paper, we propose a novel approach for video distribution over IEEE 802.16 networks for mobile Healthcare (m-Health) applications. The technique incorporates resource distribution, scheduling, and content-aware video streaming taking advantage of a flexible quality of service functionality offered by IEEE 802.16/WiMAX technology. The proposed technique is thoroughly investigated using network simulator software under various real-life m-Health scenarios, which include streaming video over medium access control layer service connections. It is shown that the technique is fully compatible with the WiMAX standard specification and allows a 9-16% increase in the overall network throughput, which is dependent upon the initial system configuration and the selection of WiMAX user parameters.

  10. Degree distribution and robustness of cooperative communication network with scale-free model

    NASA Astrophysics Data System (ADS)

    Wang, Jian-Rong; Wang, Jian-Ping; He, Zhen; Xu, Hai-Tao

    2015-06-01

    With the requirements of users enhanced for wireless communication, the cooperative communication will become a development trend in future. In this paper, a model based on complex networks with both preferential attachment is researched to solve an actual network CCN (Cooperative Communication Network). Firstly, the evolution of CCN is given by four steps with different probabilities. At the same time, the rate equations of nodes degree are presented to analyze the evolution of CCN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation. Finally, the robustness of CCN is studied by numerical simulation with random attack and intentional attack to analyze the effects of degree distribution and average path length. The results of this paper are more significant for building CCN to programme the resource of communication. Project supported by the Natural Science Foundation of Beijing (Grant No. 4152035) and the National Natural Science Foundation of China (Grant No. 61272507).

  11. Dataset for Testing Contamination Source Identification Methods for Water Distribution Networks

    EPA Pesticide Factsheets

    This dataset includes the results of a simulation study using the source inversion techniques available in the Water Security Toolkit. The data was created to test the different techniques for accuracy, specificity, false positive rate, and false negative rate. The tests examined different parameters including measurement error, modeling error, injection characteristics, time horizon, network size, and sensor placement. The water distribution system network models that were used in the study are also included in the dataset. This dataset is associated with the following publication:Seth, A., K. Klise, J. Siirola, T. Haxton , and C. Laird. Testing Contamination Source Identification Methods for Water Distribution Networks. Journal of Environmental Division, Proceedings of American Society of Civil Engineers. American Society of Civil Engineers (ASCE), Reston, VA, USA, ., (2016).

  12. Optimal long-term design, rehabilitation and upgrading of water distribution networks

    NASA Astrophysics Data System (ADS)

    Tanyimboh, Tiku; Kalungi, Paul

    2008-07-01

    Given a limited budget, the choice of the best water distribution network upgrading strategy is a complex optimization problem. A model for the optimal long-term design and upgrading of new and existing water distribution networks is presented. A key strength of the methodology is the use of maximum entropy flows, which reduces the size of the problem and enables the application of linear programming for pipe size optimization. It also ensures the reliability level is high. The capital and maintenance costs and hydraulic performance are considered simultaneously for a predefined design horizon. The timing of upgrading over the entire planning horizon is obtained by dynamic programming. The deterioration over time of the structural integrity and hydraulic capacity of every pipe are explicitly considered. The upgrading options considered include pipe paralleling and replacement. The effectiveness of the model is demonstrated using the water supply network of Wobulenzi town in Uganda.

  13. The distribution of first hitting times of randomwalks on Erdős–Rényi networks

    NASA Astrophysics Data System (ADS)

    Tishby, Ido; Biham, Ofer; Katzav, Eytan

    2017-03-01

    Analytical results for the distribution of first hitting times of random walks on Erdős–Rényi networks are presented. Starting from a random initial node, a random walker hops between adjacent nodes until it hits a node which it has already visited before. At this point, the path terminates. The path length, namely the number of steps, d, pursued by the random walker from the initial node up to its termination is called the first hitting time or the first intersection length. Using recursion equations, we obtain analytical results for the tail distribution of the path lengths, P(d>\\ell ) . The results are found to be in excellent agreement with numerical simulations. It is found that the distribution P(d>\\ell ) follows a product of an exponential distribution and a Rayleigh distribution. The mean, median and standard deviation of this distribution are also calculated, in terms of the network size and its mean degree. The termination of an RW path may take place either by backtracking to the previous node or by retracing of its path, namely stepping into a node which has been visited two or more time steps earlier. We obtain analytical results for the probabilities, p b and p r , that the cause of termination will be backtracking or retracing, respectively. It is shown that in dilute networks the dominant termination scenario is backtracking while in dense networks most paths terminate by retracing. We also obtain expressions for the conditional distributions P(d=\\ell |b) and P(d=\\ell |r) , for those paths which are terminated by backtracking or by retracing, respectively. These results provide useful insight into the general problem of survival analysis and the statistics of mortality rates when two or more termination scenarios coexist.

  14. An extended clique degree distribution and its heterogeneity in cooperation-competition networks

    NASA Astrophysics Data System (ADS)

    Feng, Ai-Xia; Fu, Chun-Hua; Xu, Xiu-Lian; Zhou, Yue-Ping; Chang, Hui; Wang, Jian; He, Da-Ren; Feng, Guo-Lin

    2012-04-01

    After Xiao et al. [W.-K. Xiao, J. Ren, F. Qi, Z.W. Song, M.X. Zhu, H.F. Yang, H.Y. Jin, B.-H. Wang, Tao Zhou, Empirical study on clique-degree distribution of networks, Phys. Rev. E 76 (2007) 037102], in this article we present an investigation on so-called k-cliques, which are defined as complete subgraphs of k (k>1) nodes, in the cooperation-competition networks described by bipartite graphs. In the networks, the nodes named actors are taking part in events, organizations or activities, named acts. We mainly examine a property of a k-clique called “k-clique act degree”, q, defined as the number of acts, in which the k-clique takes part. Our analytic treatment on a cooperation-competition network evolution model demonstrates that the distribution of k-clique act degrees obeys Mandelbrot distribution, P(q)∝(. To validate the analytical model, we have further studied 13 different empirical cooperation-competition networks with the clique numbers k=2 and k=3. Empirical investigation results show an agreement with the analytic derivations. We propose a new “heterogeneity index”, H, to describe the heterogeneous degree distributions of k-clique and heuristically derive the correlation between H and α and γ. We argue that the cliques, which take part in the largest number of acts, are the most important subgraphs, which can provide a new criterion to distinguish important cliques in the real world networks.

  15. Global synchronization of memristive neural networks subject to random disturbances via distributed pinning control.

    PubMed

    Guo, Zhenyuan; Yang, Shaofu; Wang, Jun

    2016-12-01

    This paper presents theoretical results on global exponential synchronization of multiple memristive neural networks in the presence of external noise by means of two types of distributed pinning control. The multiple memristive neural networks are coupled in a general structure via a nonlinear function, which consists of a linear diffusive term and a discontinuous sign term. A pinning impulsive control law is introduced in the coupled system to synchronize all neural networks. Sufficient conditions are derived for ascertaining global exponential synchronization in mean square. In addition, a pinning adaptive control law is developed to achieve global exponential synchronization in mean square. Both pinning control laws utilize only partial state information received from the neighborhood of the controlled neural network. Simulation results are presented to substantiate the theoretical results.

  16. Energy summation method for energy loss computation in radial distribution networks

    SciTech Connect

    Taleski, R.; Rajicic, D.

    1996-05-01

    A method for energy loss calculation in radial distribution networks is presented. It is based on the statistical representation of the influence of different load curves in the network upon element power flows and on the oriented ordering of the network elements. Also, the paper proposes the use of different, but constant, voltages at each node, instead of nominal voltage at all nodes. The procedure is very simple, and it involves four steps: element ordering, calculation of second moments, power flow calculation with average loads at nodes, and energy calculation in network elements. The presented results illustrate that the algorithm has advantages over methods that use nominal voltage at each node for accuracy, and advantages over methods that calculate accurate energy losses for speed.

  17. Estimation of Distribution Algorithm with Local Sampling Strategy for Community Detection in Complex Networks

    NASA Astrophysics Data System (ADS)

    Yu, Fahong; Li, Wenping; He, Feng; Yu, Bolin; Xia, Xiaoyun; Ma, Longhua

    2016-12-01

    It is important to discover the potential community structure for analyzing complex networks. In this paper, an estimation of distribution algorithm with local sampling strategy for community detection in complex networks is presented to optimize the modularity density function. In the proposed algorithm, the evolution probability model is built according to eminent individuals selected by simulated annealing mechanism and a local sampling strategy based on a local similarity model is adopted to improve both the speed and the accuracy for detecting community structure in complex networks. At the same time, a more general version of the criterion function with a tunable parameter λ is used to avoid the resolution limit. Experiments on synthetic and real-life networks demonstrate the performance and the comparison of experimental results with those of several state-of-the-art methods, the proposed algorithm is considerably efficient and competitive.

  18. Measurement-Device-Independent Quantum Key Distribution over Untrustful Metropolitan Network

    NASA Astrophysics Data System (ADS)

    Tang, Yan-Lin; Yin, Hua-Lei; Zhao, Qi; Liu, Hui; Sun, Xiang-Xiang; Huang, Ming-Qi; Zhang, Wei-Jun; Chen, Si-Jing; Zhang, Lu; You, Li-Xing; Wang, Zhen; Liu, Yang; Lu, Chao-Yang; Jiang, Xiao; Ma, Xiongfeng; Zhang, Qiang; Chen, Teng-Yun; Pan, Jian-Wei

    2016-01-01

    Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds—security and practicality, constitutes an appealing solution to secure metropolitan communications.

  19. Numerical simulation of distribution of neutrophils in a lattice alveolar capillary network.

    PubMed

    Shirai, Atsushi; Hayase, Toshiyuki

    2009-02-28

    Neutrophils are known to be retained in narrow pulmonary capillaries, even in normal lungs, due to their low deformability, resulting in a higher concentration than that in systemic circulation. In this study, to obtain a fundamental understanding of the behavior of neutrophils, we simplified an alveolar capillary network to a rectangular grid of short capillary segments and numerically investigated the flow of a suspension of neutrophils and plasma through the capillary network for various concentrations of the suspension, Csus, injected into the network. The cells traveled limited preferential paths in the network while Csus was low. Retention of a cell or cells induced plugging of the segment with a cessation of blood flow, and as the result of the changed plasma flow field caused by such plugging, the cells took various routes differing from the preferential paths. A low incidence of plugging helped to accelerate the cells flowing in the network with tight segments, resulting in a decrease in their mean transit time through the network as compared with the case of a single-cell transit. On the contrary, however, an increasing incidence of plugging induced backward motion of the cells and a resultant increase in the mean transit time. The time-averaged number of cells in the network increased with the increase in Csus, and the fractional residence time of cells in individual segments approached a constant. This means that a high concentration of neutrophils facilitates their uniform distribution in the network. However, the ratio between the time-averaged concentration of the cells in the network and Csus decreased and our numerical simulation did not reach the experimentally obtained value. This implies that, in a real alveolar capillary bed, plasma leaks through the plugged segments or that the capillary network has bypasses through which the plasma can flow.

  20. Distributed convex optimisation with event-triggered communication in networked systems

    NASA Astrophysics Data System (ADS)

    Liu, Jiayun; Chen, Weisheng

    2016-12-01

    This paper studies the distributed convex optimisation problem over directed networks. Motivated by practical considerations, we propose a novel distributed zero-gradient-sum optimisation algorithm with event-triggered communication. Therefore, communication and control updates just occur at discrete instants when some predefined condition satisfies. Thus, compared with the time-driven distributed optimisation algorithms, the proposed algorithm has the advantages of less energy consumption and less communication cost. Based on Lyapunov approaches, we show that the proposed algorithm makes the system states asymptotically converge to the solution of the problem exponentially fast and the Zeno behaviour is excluded. Finally, simulation example is given to illustrate the effectiveness of the proposed algorithm.

  1. Anti-correlations in the degree distribution increase stimulus detection performance in noisy spiking neural networks.

    PubMed

    Martens, Marijn B; Houweling, Arthur R; E Tiesinga, Paul H

    2017-02-01

    Neuronal circuits in the rodent barrel cortex are characterized by stable low firing rates. However, recent experiments show that short spike trains elicited by electrical stimulation in single neurons can induce behavioral responses. Hence, the underlying neural networks provide stability against internal fluctuations in the firing rate, while simultaneously making the circuits sensitive to small external perturbations. Here we studied whether stability and sensitivity are affected by the connectivity structure in recurrently connected spiking networks. We found that anti-correlation between the number of afferent (in-degree) and efferent (out-degree) synaptic connections of neurons increases stability against pathological bursting, relative to networks where the degrees were either positively correlated or uncorrelated. In the stable network state, stimulation of a few cells could lead to a detectable change in the firing rate. To quantify the ability of networks to detect the stimulation, we used a receiver operating characteristic (ROC) analysis. For a given level of background noise, networks with anti-correlated degrees displayed the lowest false positive rates, and consequently had the highest stimulus detection performance. We propose that anti-correlation in the degree distribution may be a computational strategy employed by sensory cortices to increase the detectability of external stimuli. We show that networks with anti-correlated degrees can in principle be formed by applying learning rules comprised of a combination of spike-timing dependent plasticity, homeostatic plasticity and pruning to networks with uncorrelated degrees. To test our prediction we suggest a novel experimental method to estimate correlations in the degree distribution.

  2. An advanced distributed automated extraction of drainage network model on high-resolution DEM

    NASA Astrophysics Data System (ADS)

    Mao, Y.; Ye, A.; Xu, J.; Ma, F.; Deng, X.; Miao, C.; Gong, W.; Di, Z.

    2014-07-01

    A high-resolution and high-accuracy drainage network map is a prerequisite for simulating the water cycle in land surface hydrological models. The objective of this study was to develop a new automated extraction of drainage network model, which can get high-precision continuous drainage network on high-resolution DEM (Digital Elevation Model). The high-resolution DEM need too much computer resources to extract drainage network. The conventional GIS method often can not complete to calculate on high-resolution DEM of big basins, because the number of grids is too large. In order to decrease the computation time, an advanced distributed automated extraction of drainage network model (Adam) was proposed in the study. The Adam model has two features: (1) searching upward from outlet of basin instead of sink filling, (2) dividing sub-basins on low-resolution DEM, and then extracting drainage network on sub-basins of high-resolution DEM. The case study used elevation data of the Shuttle Radar Topography Mission (SRTM) at 3 arc-second resolution in Zhujiang River basin, China. The results show Adam model can dramatically reduce the computation time. The extracting drainage network was continuous and more accurate than HydroSHEDS (Hydrological data and maps based on Shuttle Elevation Derivatives at multiple Scales).

  3. Genetic algorithms for the design of looped irrigation water distribution networks

    NASA Astrophysics Data System (ADS)

    Reca, Juan; MartíNez, Juan

    2006-05-01

    A new computer model called Genetic Algorithm Pipe Network Optimization Model (GENOME) has been developed with the aim of optimizing the design of new looped irrigation water distribution networks. The model is based on a genetic algorithm method, although relevant modifications and improvements have been implemented to adapt the model to this specific problem. It makes use of the robust network solver EPANET. The model has been tested and validated by applying it to the least cost optimization of several benchmark networks reported in the literature. The results obtained with GENOME have been compared with those found in previous works, obtaining the same results as the best published in the literature to date. Once the model was validated, the optimization of a real complex irrigation network has been carried out to evaluate the potential of the genetic algorithm for the optimal design of large-scale networks. Although satisfactory results have been obtained, some adjustments would be desirable to improve the performance of genetic algorithms when the complexity of the network requires it.

  4. Estimating interevent time distributions from finite observation periods in communication networks

    NASA Astrophysics Data System (ADS)

    Kivelä, Mikko; Porter, Mason A.

    2015-11-01

    A diverse variety of processes—including recurrent disease episodes, neuron firing, and communication patterns among humans—can be described using interevent time (IET) distributions. Many such processes are ongoing, although event sequences are only available during a finite observation window. Because the observation time window is more likely to begin or end during long IETs than during short ones, the analysis of such data is susceptible to a bias induced by the finite observation period. In this paper, we illustrate how this length bias is born and how it can be corrected without assuming any particular shape for the IET distribution. To do this, we model event sequences using stationary renewal processes, and we formulate simple heuristics for determining the severity of the bias. To illustrate our results, we focus on the example of empirical communication networks, which are temporal networks that are constructed from communication events. The IET distributions of such systems guide efforts to build models of human behavior, and the variance of IETs is very important for estimating the spreading rate of information in networks of temporal interactions. We analyze several well-known data sets from the literature, and we find that the resulting bias can lead to systematic underestimates of the variance in the IET distributions and that correcting for the bias can lead to qualitatively different results for the tails of the IET distributions.

  5. Geographic location, network patterns and population distribution of rural settlements in Greece

    NASA Astrophysics Data System (ADS)

    Asimakopoulos, Avraam; Mogios, Emmanuel; Xenikos, Dimitrios G.

    2016-10-01

    Our work addresses the problem of how social networks are embedded in space, by studying the spread of human population over complex geomorphological terrain. We focus on villages or small cities up to a few thousand inhabitants located in mountainous areas in Greece. This terrain presents a familiar tree-like structure of valleys and land plateaus. Cities are found more often at lower altitudes and exhibit preference on south orientation. Furthermore, the population generally avoids flat land plateaus and river beds, preferring locations slightly uphill, away from the plateau edge. Despite the location diversity regarding geomorphological parameters, we find certain quantitative norms when we examine location and population distributions relative to the (man-made) transportation network. In particular, settlements at radial distance ℓ away from road network junctions have the same mean altitude, practically independent of ℓ ranging from a few meters to 10 km. Similarly, the distribution of the settlement population at any given ℓ is the same for all ℓ. Finally, the cumulative distribution of the number of rural cities n(ℓ) is fitted to the Weibull distribution, suggesting that human decisions for creating settlements could be paralleled to mechanisms typically attributed to this particular statistical distribution.

  6. Estimating interevent time distributions from finite observation periods in communication networks.

    PubMed

    Kivelä, Mikko; Porter, Mason A

    2015-11-01

    A diverse variety of processes-including recurrent disease episodes, neuron firing, and communication patterns among humans-can be described using interevent time (IET) distributions. Many such processes are ongoing, although event sequences are only available during a finite observation window. Because the observation time window is more likely to begin or end during long IETs than during short ones, the analysis of such data is susceptible to a bias induced by the finite observation period. In this paper, we illustrate how this length bias is born and how it can be corrected without assuming any particular shape for the IET distribution. To do this, we model event sequences using stationary renewal processes, and we formulate simple heuristics for determining the severity of the bias. To illustrate our results, we focus on the example of empirical communication networks, which are temporal networks that are constructed from communication events. The IET distributions of such systems guide efforts to build models of human behavior, and the variance of IETs is very important for estimating the spreading rate of information in networks of temporal interactions. We analyze several well-known data sets from the literature, and we find that the resulting bias can lead to systematic underestimates of the variance in the IET distributions and that correcting for the bias can lead to qualitatively different results for the tails of the IET distributions.

  7. Cooperative Management of a Lithium-Ion Battery Energy Storage Network: A Distributed MPC Approach

    SciTech Connect

    Fang, Huazhen; Wu, Di; Yang, Tao

    2016-12-12

    This paper presents a study of cooperative power supply and storage for a network of Lithium-ion energy storage systems (LiBESSs). We propose to develop a distributed model predictive control (MPC) approach for two reasons. First, able to account for the practical constraints of a LiBESS, the MPC can enable a constraint-aware operation. Second, a distributed management can cope with a complex network that integrates a large number of LiBESSs over a complex communication topology. With this motivation, we then build a fully distributed MPC algorithm from an optimization perspective, which is based on an extension of the alternating direction method of multipliers (ADMM) method. A simulation example is provided to demonstrate the effectiveness of the proposed algorithm.

  8. Unravelling the size distribution of social groups with information theory in complex networks

    NASA Astrophysics Data System (ADS)

    Hernando, A.; Villuendas, D.; Vesperinas, C.; Abad, M.; Plastino, A.

    2010-07-01

    The minimization of Fisher’s information (MFI) approach of Frieden et al. [Phys. Rev. E 60, 48 (1999)] is applied to the study of size distributions in social groups on the basis of a recently established analogy between scale invariant systems and classical gases [Phys. A 389, 490 (2010)]. Going beyond the ideal gas scenario is seen to be tantamount to simulating the interactions taking place, for a competitive cluster growth process, in a scale-free ideal network - a non-correlated network with a connection-degree’s distribution that mimics the scale-free ideal gas density distribution. We use a scaling rule that allows one to classify the final cluster-size distributions using only one parameter that we call the competitiveness, which can be seen as a measure of the strength of the interactions. We find that both empirical city-size distributions and electoral results can be thus reproduced and classified according to this competitiveness-parameter, that also allow us to infer the maximum number of stable social relationships that one person can maintain, known as the Dunbar number, together with its standard deviation. We discuss the importance of this number in connection with the empirical phenomenon known as “six-degrees of separation”. Finally, we show that scaled city-size distributions of large countries follow, in general, the same universal distribution.

  9. An Efficient Framework for Large Scale Multimedia Content Distribution in P2P Network: I2NC

    PubMed Central

    Anandaraj, M.; Ganeshkumar, P.; Vijayakumar, K. P.; Selvaraj, K.

    2015-01-01

    Network coding (NC) makes content distribution more effective and easier in P2P content distribution network and reduces the burden of the original seeder. It generalizes traditional network routing by allowing the intermediate nodes to generate new coded packet by combining the received packets. The randomization introduced by network coding makes all packets equally important and resolves the problem of locating the rarest block. Further, it reduces traffic in the network. In this paper, we analyze the performance of traditional network coding in P2P content distribution network by using a mathematical model and it is proved that traffic reduction has not been fully achieved in P2P network using traditional network coding. It happens due to the redundant transmission of noninnovative information block among the peers in the network. Hence, we propose a new framework, called I2NC (intelligent-peer selection and incremental-network coding), to eliminate the unnecessary flooding of noninnovative coded packets and thereby to improve the performance of network coding in P2P content distribution further. A comparative study and analysis of the proposed system is made through various related implementations and the results show that 10–15% of traffic reduced and improved the average and maximum download time by reducing original seeder's workload. PMID:26605375

  10. Report on NSF/ARO/ONR Workshop on Distributed Camera Networks: Research Challenges and Future Directions

    NASA Astrophysics Data System (ADS)

    Bhanu, Bir; Roy Chowdhury, Amit

    Large-scale video networks are becoming increasingly important for a wide range of critical applications. The development of automated techniques for aggregating and interpreting information from multiple video streams in large-scale networks in real-life scenarios is very challenging. Research in video sensor networks is highly interdisciplinary and requires expertise from a variety of fields. The goal of this effort was to organize a two-day nationally recognized workshop in the domain of camera networks that brings together leading researchers from academia, industry and the government. The workshop was held at the University of California at Riverside on May 11-12, 2009. The workshop was attended by 75 participants. The workshop was sponsored by the US National Science Foundation, US Army Research Office and US Office of Naval Research. The workshop addressed critical interdisciplinary challenges at the intersection of large-scale video camera networks and distributed sensing, processing, communication and control; distributed video understanding; embedded real-time systems; graphics and simulation; and education. The recommendations of the workshop are summarized in the following order of topics: Video Processing and Video Understanding

  11. A Matrix-Based Proactive Data Relay Algorithm for Large Distributed Sensor Networks

    PubMed Central

    Xu, Yang; Hu, Xuemei; Hu, Haixiao; Liu, Ming

    2016-01-01

    In large-scale distributed sensor networks, sensed data is required to be relayed around the network so that one or few sensors can gather adequate relative data to produce high quality information for decision-making. In regards to very high energy-constraint sensor nodes, data transmission should be extremely economical. However, traditional data delivery protocols are potentially inefficient relaying unpredictable sensor readings for data fusion in large distributed networks for either overwhelming query transmissions or unnecessary data coverage. By building sensors’ local model from their previously transmitted data in three matrixes, we have developed a novel energy-saving data relay algorithm, which allows sensors to proactively make broadcast decisions by using a neat matrix computation to provide balance between transmission and energy-saving. In addition, we designed a heuristic maintenance algorithm to efficiently update these three matrices. This can easily be deployed to large-scale mobile networks in which decisions of sensors are based on their local matrix models no matter how large the network is, and the local models of these sensors are updated constantly. Compared with some traditional approaches based on our simulations, the efficiency of this approach is manifested in uncertain environment. The results show that our approach is scalable and can effectively balance aggregating data with minimizing energy consumption. PMID:27537891

  12. Reliability assessment of water supply systems with storage and distribution networks

    NASA Astrophysics Data System (ADS)

    Fujiwara, Okitsugu; Ganesharajah, Tharmarajah

    1993-08-01

    The water supply system studied in this paper consists of a water treatment plant, a ground-level storage, a pumping station, and a distribution network in series. Expected served demand is employed to measure reliability taking into account both insufficient heads and flows at individual nodes in the network since it is the most important service level index provided to individual users. A basic method proposed is to assume that the insufficient nodal head reduces the effectiveness of flow supplied at the node and that the authority provides the maximum service to customers so that the real-time pump and network flow operations maximize the effective served system demand. The average value of the maximum effective served system demand relative to the total system demand over all system states is defined as system reliability, and the nodal reliability for each demand node is similarly defined. The Markov chain method introduced by Beim and Hobbs (1988) is employed to describe the evolution of the storage level over time so that the real-time pump and network flow operations can be accurately implemented by solving a nonlinear programming model. Two example systems are presented to demonstrate numerically the advantage of the method proposed in its consideration of the distribution network and nodal reliabilities.

  13. DCPVP: Distributed Clustering Protocol Using Voting and Priority for Wireless Sensor Networks

    PubMed Central

    Hematkhah, Hooman; Kavian, Yousef S.

    2015-01-01

    This paper presents a new clustering protocol for designing energy-efficient hierarchical wireless sensor networks (WSNs) by dividing the distributed sensor network into virtual sensor groups to satisfy the scalability and prolong the network lifetime in large-scale applications. The proposed approach is a distributed clustering protocol called DCPVP, which is based on voting and priority ideas. In the DCPVP protocol, the size of clusters is based on the distance of nodes from the data link such as base station (BS) and the local node density. The cluster heads are elected based on the mean distance from neighbors, remaining energy and the times of being elected as cluster head. The performance of the DCPVP protocol is compared with some well-known clustering protocols in literature such as the LEACH, HEED, WCA, GCMRA and TCAC protocols. The simulation results confirm that the prioritizing- and voting-based election ideas decrease the construction time and the energy consumption of clustering progress in sensor networks and consequently improve the lifetime of networks with limited resources and battery powered nodes in harsh and inaccessible environments. PMID:25763646

  14. A Matrix-Based Proactive Data Relay Algorithm for Large Distributed Sensor Networks.

    PubMed

    Xu, Yang; Hu, Xuemei; Hu, Haixiao; Liu, Ming

    2016-08-16

    In large-scale distributed sensor networks, sensed data is required to be relayed around the network so that one or few sensors can gather adequate relative data to produce high quality information for decision-making. In regards to very high energy-constraint sensor nodes, data transmission should be extremely economical. However, traditional data delivery protocols are potentially inefficient relaying unpredictable sensor readings for data fusion in large distributed networks for either overwhelming query transmissions or unnecessary data coverage. By building sensors' local model from their previously transmitted data in three matrixes, we have developed a novel energy-saving data relay algorithm, which allows sensors to proactively make broadcast decisions by using a neat matrix computation to provide balance between transmission and energy-saving. In addition, we designed a heuristic maintenance algorithm to efficiently update these three matrices. This can easily be deployed to large-scale mobile networks in which decisions of sensors are based on their local matrix models no matter how large the network is, and the local models of these sensors are updated constantly. Compared with some traditional approaches based on our simulations, the efficiency of this approach is manifested in uncertain environment. The results show that our approach is scalable and can effectively balance aggregating data with minimizing energy consumption.

  15. Distributed Particle Swarm Optimization and Simulated Annealing for Energy-efficient Coverage in Wireless Sensor Networks

    PubMed Central

    Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

    2007-01-01

    The limited energy supply of wireless sensor networks poses a great challenge for the deployment of wireless sensor nodes. In this paper, we focus on energy-efficient coverage with distributed particle swarm optimization and simulated annealing. First, the energy-efficient coverage problem is formulated with sensing coverage and energy consumption models. We consider the network composed of stationary and mobile nodes. Second, coverage and energy metrics are presented to evaluate the coverage rate and energy consumption of a wireless sensor network, where a grid exclusion algorithm extracts the coverage state and Dijkstra's algorithm calculates the lowest cost path for communication. Then, a hybrid algorithm optimizes the energy consumption, in which particle swarm optimization and simulated annealing are combined to find the optimal deployment solution in a distributed manner. Simulated annealing is performed on multiple wireless sensor nodes, results of which are employed to correct the local and global best solution of particle swarm optimization. Simulations of wireless sensor node deployment verify that coverage performance can be guaranteed, energy consumption of communication is conserved after deployment optimization and the optimization performance is boosted by the distributed algorithm. Moreover, it is demonstrated that energy efficiency of wireless sensor networks is enhanced by the proposed optimization algorithm in target tracking applications.

  16. A practical approach for outdoors distributed target localization in wireless sensor networks

    NASA Astrophysics Data System (ADS)

    Béjar, Benjamín; Zazo, Santiago

    2012-12-01

    Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensus-based implementation of the algorithm is proposed based on an augmented Lagrangian approach and primal-dual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate.

  17. A growth model for directed complex networks with power-law shape in the out-degree distribution

    PubMed Central

    Esquivel-Gómez, J.; Stevens-Navarro, E.; Pineda-Rico, U.; Acosta-Elias, J.

    2015-01-01

    Many growth models have been published to model the behavior of real complex networks. These models are able to reproduce several of the topological properties of such networks. However, in most of these growth models, the number of outgoing links (i.e., out-degree) of nodes added to the network is constant, that is all nodes in the network are born with the same number of outgoing links. In other models, the resultant out-degree distribution decays as a poisson or an exponential distribution. However, it has been found that in real complex networks, the out-degree distribution decays as a power-law. In order to obtain out-degree distribution with power-law behavior some models have been proposed. This work introduces a new model that allows to obtain out-degree distributions that decay as a power-law with an exponent in the range from 0 to 1. PMID:25567141

  18. Multi-Channel Distributed Coordinated Function over Single Radio in Wireless Sensor Networks

    PubMed Central

    Campbell, Carlene E.-A.; Loo, Kok-Keong (Jonathan); Gemikonakli, Orhan; Khan, Shafiullah; Singh, Dhananjay

    2011-01-01

    Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band. PMID:22346614

  19. Multi-channel distributed coordinated function over single radio in wireless sensor networks.

    PubMed

    Campbell, Carlene E-A; Loo, Kok-Keong Jonathan; Gemikonakli, Orhan; Khan, Shafiullah; Singh, Dhananjay

    2011-01-01

    Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band.

  20. Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms

    DTIC Science & Technology

    2008-10-27

    Quorum sensing in bacteria, Annual Review of Microbiology, 55, 165–199. 287 “Distributed Control of Robotic Networks” by F. Bullo, J. Cortés and S...complexity notions 137 3.1 A model for synchronous robotic networks 137 3.2 Robotic networks with relative sensing 148 3.3 Coordination tasks and complexity...Chapter 3 introduces a model for a group of robots that synchronously communicate/ sense locally, process information, and move. We describe the physical

  1. Establish a Data Transmission Platform of the Rig Based on the Distributed Network

    NASA Astrophysics Data System (ADS)

    Bao, Zefu; Li, Tao

    In order to control in real-time ,closed-loop feedback the information, saving the money and labor,we distribute a platform of network data. It through the establishment of the platform in the oil drilling to achieve the easiest route of each device of the rig that conveying timely. The design proposed the platform to transfer networking data by PA which allows the rig control for optimal use. Against the idea,achieving first through on-site cabling and the establishment of data transmission module in the rig monitoring system. The results of standard field application show that the platform solve the problem of rig control.

  2. [Isolation and characterization of injured coliforms from the drinking water distribution network of La Plata, Argentina].

    PubMed

    Basualdo, J A; Córdoba, M A; De Luca, M M; Roccia, I L; Pezzani, B C; Vay, C; Ageron, E; Grimont, P A

    2001-01-01

    We screened the La Plata drinking water distribution network for fecal and total coliform bacterial indicator by purification procedures, cultivating 66 membrane-filtered samples from the two networks on m-T7 agar. Subterranean and river-derived water yielded 13 and 18 confirmed gram-negative bacillus isolates, with 54% and 72% representing total coliforms, respectively. Those from the former source were Klebsiella oxytoca, Enterobacter agglomerans, and Enterobacter aerogenes and from the latter Klebsiella oxytoca, Enterobacter agglomerans, and Enterobacter cloacae, genomic group 3. Since 58% of the samples were positive using m-T7 medium it is suggested that the inclusion in standard quality control protocols should be implemented.

  3. Robustness of a distributed neural network controller for locomotion in a hexapod robot

    NASA Technical Reports Server (NTRS)

    Chiel, Hillel J.; Beer, Randall D.; Quinn, Roger D.; Espenschied, Kenneth S.

    1992-01-01

    A distributed neural-network controller for locomotion, based on insect neurobiology, has been used to control a hexapod robot. How robust is this controller? Disabling any single sensor, effector, or central component did not prevent the robot from walking. Furthermore, statically stable gaits could be established using either sensor input or central connections. Thus, a complex interplay between central neural elements and sensor inputs is responsible for the robustness of the controller and its ability to generate a continuous range of gaits. These results suggest that biologically inspired neural-network controllers may be a robust method for robotic control.

  4. Ensemble distribution models in conservation prioritization: from consensus predictions to consensus reserve networks

    PubMed Central

    Meller, Laura; Cabeza, Mar; Pironon, Samuel; Barbet-Massin, Morgane; Maiorano, Luigi; Georges, Damien; Thuiller, Wilfried

    2014-01-01

    Aim Conservation planning exercises increasingly rely on species distributions predicted either from one particular statistical model or, more recently, from an ensemble of models (i.e. ensemble forecasting). However, it has not yet been explored how different ways of summarizing ensemble predictions affect conservation planning outcomes. We evaluate these effects and compare commonplace consensus methods, applied before the conservation prioritization phase, to a novel method that applies consensus after reserve selection. Location Europe. Methods We used an ensemble of predicted distributions of 146 Western Palaearctic bird species in alternative ways: four different consensus methods, as well as distributions discounted with variability, were used to produce inputs for spatial conservation prioritization. In addition, we developed and tested a novel method, in which we built 100 datasets by sampling the ensemble of predicted distributions, ran a conservation prioritization analysis on each of them and averaged the resulting priority ranks. We evaluated the conservation outcome against three controls: (i) a null control, based on random ranking of cells; (2) the reference solution, based on an expert-refined dataset; and (3) the independent solution, based on an independent dataset. Results Networks based on predicted distributions were more representative of rare species than randomly selected networks. Alternative methods to summarize ensemble predictions differed in representativeness of resulting reserve networks. Our novel method resulted in better representation of rare species than pre-selection consensus methods. Main conclusions Retaining information about the variation in the predicted distributions throughout the conservation prioritization seems to provide better results than summarizing the predictions before conservation prioritization. Our results highlight the need to understand and consider model-based uncertainty when using predicted

  5. Development, Testing and Installation of a Superconducting Fault Current Limiter for Medium Voltage Distribution Networks

    NASA Astrophysics Data System (ADS)

    Martini, Luciano; Bocchi, Marco; Ascade, Massimo; Valzasina, Angelo; Rossi, Valerio; Angeli, Giuliano; Ravetta, Cesare

    Since 2009 Ricerca sul Sistema Energetico (RSE S.p.A.) has been involved in the design of resistive-type Superconducting Fault Current Limiter (SFCL) for MV applications to be installed in the A2A Reti Elettriche S.p.A distribution grid in the Milano area. The project started with simulations, design and testing activities for a singlephase device; in this paper we report on the successive step, which is concerned with developing, testing and installation at the hosting utility of the final three-phase SFCL prototype. The result of this research activity is a resistive-type 9 kV/3.4 MVA SFCL device, based on first generation (1G) BSCCO tapes, developed by RSE in the framework of a R&D national project. Owing to the positive test results of partial discharge, dielectric and shortcircuit results the three-phase SFCL device is being to be installed in the A2A distribution grid in the Milano area and it is going to be soon energized starting a one-year long field-testing activity.

  6. Connectivity, permeability, and channeling in randomly distributed and kinematically defined discrete fracture network models

    NASA Astrophysics Data System (ADS)

    Maillot, J.; Davy, P.; Le Goc, R.; Darcel, C.; de Dreuzy, J. R.

    2016-11-01

    A major use of DFN models for industrial applications is to evaluate permeability and flow structure in hardrock aquifers from geological observations of fracture networks. The relationship between the statistical fracture density distributions and permeability has been extensively studied, but there has been little interest in the spatial structure of DFN models, which is generally assumed to be spatially random (i.e., Poisson). In this paper, we compare the predictions of Poisson DFNs to new DFN models where fractures result from a growth process defined by simplified kinematic rules for nucleation, growth, and fracture arrest. This so-called "kinematic fracture model" is characterized by a large proportion of T intersections, and a smaller number of intersections per fracture. Several kinematic models were tested and compared with Poisson DFN models with the same density, length, and orientation distributions. Connectivity, permeability, and flow distribution were calculated for 3-D networks with a self-similar power law fracture length distribution. For the same statistical properties in orientation and density, the permeability is systematically and significantly smaller by a factor of 1.5-10 for kinematic than for Poisson models. In both cases, the permeability is well described by a linear relationship with the areal density p32, but the threshold of kinematic models is 50% larger than of Poisson models. Flow channeling is also enhanced in kinematic DFN models. This analysis demonstrates the importance of choosing an appropriate DFN organization for predicting flow properties from fracture network parameters.

  7. Distributed Synchronization in Networks of Agent Systems With Nonlinearities and Random Switchings.

    PubMed

    Tang, Yang; Gao, Huijun; Zou, Wei; Kurths, Jürgen

    2013-02-01

    In this paper, the distributed synchronization problem of networks of agent systems with controllers and nonlinearities subject to Bernoulli switchings is investigated. Controllers and adaptive updating laws injected in each vertex of networks depend on the state information of its neighborhood. Three sets of Bernoulli stochastic variables are introduced to describe the occurrence probabilities of distributed adaptive controllers, updating laws and nonlinearities, respectively. By the Lyapunov functions method, we show that the distributed synchronization of networks composed of agent systems with multiple randomly occurring nonlinearities, multiple randomly occurring controllers, and multiple randomly occurring updating laws can be achieved in mean square under certain criteria. The conditions derived in this paper can be solved by semi-definite programming. Moreover, by mathematical analysis, we find that the coupling strength, the probabilities of the Bernoulli stochastic variables, and the form of nonlinearities have great impacts on the convergence speed and the terminal control strength. The synchronization criteria and the observed phenomena are demonstrated by several numerical simulation examples. In addition, the advantage of distributed adaptive controllers over conventional adaptive controllers is illustrated.

  8. Tau Pathology Distribution in Alzheimer's disease Corresponds Differentially to Cognition-Relevant Functional Brain Networks.

    PubMed

    Hansson, Oskar; Grothe, Michel J; Strandberg, Tor Olof; Ohlsson, Tomas; Hägerström, Douglas; Jögi, Jonas; Smith, Ruben; Schöll, Michael

    2017-01-01

    Neuropathological studies have shown that the typical neurofibrillary pathology of hyperphosphorylated tau protein in Alzheimer's disease (AD) preferentially affects specific brain regions whereas others remain relatively spared. It has been suggested that the distinct regional distribution profile of tau pathology in AD may be a consequence of the intrinsic network structure of the human brain. The spatially distributed brain regions that are most affected by the spread of tau pathology may hence reflect an interconnected neuronal system. Here, we characterized the brain-wide regional distribution profile of tau pathology in AD using (18)F-AV 1451 tau-sensitive positron emission tomography (PET) imaging, and studied this pattern in relation to the functional network organization of the human brain. Specifically, we quantified the spatial correspondence of the regional distribution pattern of PET-evidenced tau pathology in AD with functional brain networks characterized by large-scale resting state functional magnetic resonance imaging (rs-fMRI) data in healthy subjects. Regional distribution patterns of increased PET-evidenced tau pathology in AD compared to controls were characterized in two independent samples of prodromal and manifest AD cases (the Swedish BioFINDER study, n = 44; the ADNI study, n = 35). In the BioFINDER study we found that the typical AD tau pattern involved predominantly inferior, medial, and lateral temporal cortical areas, as well as the precuneus/posterior cingulate, and lateral parts of the parietal and occipital cortex. This pattern overlapped primarily with the dorsal attention, and to some extent with higher visual, limbic and parts of the default-mode network. PET-evidenced tau pathology in the ADNI replication sample, which represented a more prodromal group of AD cases, was less pronounced but showed a highly similar spatial distribution profile, suggesting an earlier-stage snapshot of a consistently progressing regional pattern

  9. Mapping Power Law Distributions in Digital Health Social Networks: Methods, Interpretations, and Practical Implications

    PubMed Central

    2015-01-01

    Background Social networks are common in digital health. A new stream of research is beginning to investigate the mechanisms of digital health social networks (DHSNs), how they are structured, how they function, and how their growth can be nurtured and managed. DHSNs increase in value when additional content is added, and the structure of networks may resemble the characteristics of power laws. Power laws are contrary to traditional Gaussian averages in that they demonstrate correlated phenomena. Objectives The objective of this study is to investigate whether the distribution frequency in four DHSNs can be characterized as following a power law. A second objective is to describe the method used to determine the comparison. Methods Data from four DHSNs—Alcohol Help Center (AHC), Depression Center (DC), Panic Center (PC), and Stop Smoking Center (SSC)—were compared to power law distributions. To assist future researchers and managers, the 5-step methodology used to analyze and compare datasets is described. Results All four DHSNs were found to have right-skewed distributions, indicating the data were not normally distributed. When power trend lines were added to each frequency distribution, R 2 values indicated that, to a very high degree, the variance in post frequencies can be explained by actor rank (AHC .962, DC .975, PC .969, SSC .95). Spearman correlations provided further indication of the strength and statistical significance of the relationship (AHC .987. DC .967, PC .983, SSC .993, P<.001). Conclusions This is the first study to investigate power distributions across multiple DHSNs, each addressing a unique condition. Results indicate that despite vast differences in theme, content, and length of existence, DHSNs follow properties of power laws. The structure of DHSNs is important as it gives insight to researchers and managers into the nature and mechanisms of network functionality. The 5-step process undertaken to compare actor contribution patterns

  10. Tau Pathology Distribution in Alzheimer's disease Corresponds Differentially to Cognition-Relevant Functional Brain Networks

    PubMed Central

    Hansson, Oskar; Grothe, Michel J.; Strandberg, Tor Olof; Ohlsson, Tomas; Hägerström, Douglas; Jögi, Jonas; Smith, Ruben; Schöll, Michael

    2017-01-01

    Neuropathological studies have shown that the typical neurofibrillary pathology of hyperphosphorylated tau protein in Alzheimer's disease (AD) preferentially affects specific brain regions whereas others remain relatively spared. It has been suggested that the distinct regional distribution profile of tau pathology in AD may be a consequence of the intrinsic network structure of the human brain. The spatially distributed brain regions that are most affected by the spread of tau pathology may hence reflect an interconnected neuronal system. Here, we characterized the brain-wide regional distribution profile of tau pathology in AD using 18F-AV 1451 tau-sensitive positron emission tomography (PET) imaging, and studied this pattern in relation to the functional network organization of the human brain. Specifically, we quantified the spatial correspondence of the regional distribution pattern of PET-evidenced tau pathology in AD with functional brain networks characterized by large-scale resting state functional magnetic resonance imaging (rs-fMRI) data in healthy subjects. Regional distribution patterns of increased PET-evidenced tau pathology in AD compared to controls were characterized in two independent samples of prodromal and manifest AD cases (the Swedish BioFINDER study, n = 44; the ADNI study, n = 35). In the BioFINDER study we found that the typical AD tau pattern involved predominantly inferior, medial, and lateral temporal cortical areas, as well as the precuneus/posterior cingulate, and lateral parts of the parietal and occipital cortex. This pattern overlapped primarily with the dorsal attention, and to some extent with higher visual, limbic and parts of the default-mode network. PET-evidenced tau pathology in the ADNI replication sample, which represented a more prodromal group of AD cases, was less pronounced but showed a highly similar spatial distribution profile, suggesting an earlier-stage snapshot of a consistently progressing regional pattern. In

  11. Exact probability distributions of selected species in stochastic chemical reaction networks.

    PubMed

    López-Caamal, Fernando; Marquez-Lago, Tatiana T

    2014-09-01

    Chemical reactions are discrete, stochastic events. As such, the species' molecular numbers can be described by an associated master equation. However, handling such an equation may become difficult due to the large size of reaction networks. A commonly used approach to forecast the behaviour of reaction networks is to perform computational simulations of such systems and analyse their outcome statistically. This approach, however, might require high computational costs to provide accurate results. In this paper we opt for an analytical approach to obtain the time-dependent solution of the Chemical Master Equation for selected species in a general reaction network. When the reaction networks are composed exclusively of zeroth and first-order reactions, this analytical approach significantly alleviates the computational burden required by simulation-based methods. By building upon these analytical solutions, we analyse a general monomolecular reaction network with an arbitrary number of species to obtain the exact marginal probability distribution for selected species. Additionally, we study two particular topologies of monomolecular reaction networks, namely (i) an unbranched chain of monomolecular reactions with and without synthesis and degradation reactions and (ii) a circular chain of monomolecular reactions. We illustrate our methodology and alternative ways to use it for non-linear systems by analysing a protein autoactivation mechanism. Later, we compare the computational load required for the implementation of our results and a pure computational approach to analyse an unbranched chain of monomolecular reactions. Finally, we study calcium ions gates in the sarco/endoplasmic reticulum mediated by ryanodine receptors.

  12. Secure and Cost-Effective Distributed Aggregation for Mobile Sensor Networks.

    PubMed

    Guo, Kehua; Zhang, Ping; Ma, Jianhua

    2016-04-23

    Secure data aggregation (SDA) schemes are widely used in distributed applications, such as mobile sensor networks, to reduce communication cost, prolong the network life cycle and provide security. However, most SDA are only suited for a single type of statistics (i.e., summation-based or comparison-based statistics) and are not applicable to obtaining multiple statistic results. Most SDA are also inefficient for dynamic networks. This paper presents multi-functional secure data aggregation (MFSDA), in which the mapping step and coding step are introduced to provide value-preserving and order-preserving and, later, to enable arbitrary statistics support in the same query. MFSDA is suited for dynamic networks because these active nodes can be counted directly from aggregation data. The proposed scheme is tolerant to many types of attacks. The network load of the proposed scheme is balanced, and no significant bottleneck exists. The MFSDA includes two versions: MFSDA-I and MFSDA-II. The first one can obtain accurate results, while the second one is a more generalized version that can significantly reduce network traffic at the expense of less accuracy loss.

  13. Output power distributions of terminals in a 3G mobile communication network.

    PubMed

    Persson, Tomas; Törnevik, Christer; Larsson, Lars-Eric; Lovén, Jan

    2012-05-01

    The objective of this study was to examine the distribution of the output power of mobile phones and other terminals connected to a 3G network in Sweden. It is well known that 3G terminals can operate with very low output power, particularly for voice calls. Measurements of terminal output power were conducted in the Swedish TeliaSonera 3G network in November 2008 by recording network statistics. In the analysis, discrimination was made between rural, suburban, urban, and dedicated indoor networks. In addition, information about terminal output power was possible to collect separately for voice and data traffic. Information from six different Radio Network Controllers (RNCs) was collected during at least 1 week. In total, more than 800000 h of voice calls were collected and in addition to that a substantial amount of data traffic. The average terminal output power for 3G voice calls was below 1 mW for any environment including rural, urban, and dedicated indoor networks. This is <1% of the maximum available output power. For data applications the average output power was about 6-8 dB higher than for voice calls. For rural areas the output power was about 2 dB higher, on average, than in urban areas.

  14. Numerical simulation of fibrous biomaterials with randomly distributed fiber network structure.

    PubMed

    Jin, Tao; Stanciulescu, Ilinca

    2016-08-01

    This paper presents a computational framework to simulate the mechanical behavior of fibrous biomaterials with randomly distributed fiber networks. A random walk algorithm is implemented to generate the synthetic fiber network in 2D used in simulations. The embedded fiber approach is then adopted to model the fibers as embedded truss elements in the ground matrix, which is essentially equivalent to the affine fiber kinematics. The fiber-matrix interaction is partially considered in the sense that the two material components deform together, but no relative movement is considered. A variational approach is carried out to derive the element residual and stiffness matrices for finite element method (FEM), in which material and geometric nonlinearities are both included. Using a data structure proposed to record the network geometric information, the fiber network is directly incorporated into the FEM simulation without significantly increasing the computational cost. A mesh sensitivity analysis is conducted to show the influence of mesh size on various simulation results. The proposed method can be easily combined with Monte Carlo (MC) simulations to include the influence of the stochastic nature of the network and capture the material behavior in an average sense. The computational framework proposed in this work goes midway between homogenizing the fiber network into the surrounding matrix and accounting for the fully coupled fiber-matrix interaction at the segment length scale, and can be used to study the connection between the microscopic structure and the macro-mechanical behavior of fibrous biomaterials with a reasonable computational cost.

  15. A unified framework for spiking and gap-junction interactions in distributed neuronal network simulations

    PubMed Central

    Hahne, Jan; Helias, Moritz; Kunkel, Susanne; Igarashi, Jun; Bolten, Matthias; Frommer, Andreas; Diesmann, Markus

    2015-01-01

    Contemporary simulators for networks of point and few-compartment model neurons come with a plethora of ready-to-use neuron and synapse models and support complex network topologies. Recent technological advancements have broadened the spectrum of application further to the efficient simulation of brain-scale networks on supercomputers. In distributed network simulations the amount of spike data that accrues per millisecond and process is typically low, such that a common optimization strategy is to communicate spikes at relatively long intervals, where the upper limit is given by the shortest synaptic transmission delay in the network. This approach is well-suited for simulations that employ only chemical synapses but it has so far impeded the incorporation of gap-junction models, which require instantaneous neuronal interactions. Here, we present a numerical algorithm based on a waveform-relaxation technique which allows for network simulations with gap junctions in a way that is compatible with the delayed communication strategy. Using a reference implementation in the NEST simulator, we demonstrate that the algorithm and the required data structures can be smoothly integrated with existing code such that they complement the infrastructure for spiking connections. To show that the unified framework for gap-junction and spiking interactions achieves high performance and delivers high accuracy in the presence of gap junctions, we present benchmarks for workstations, clusters, and supercomputers. Finally, we discuss limitations of the novel technology. PMID:26441628

  16. Distributed Information Compression for Target Tracking in Cluster-Based Wireless Sensor Networks.

    PubMed

    Liao, Shi-Kuan; Lai, Kai-Jay; Tsai, Hsiao-Ping; Wen, Chih-Yu

    2016-06-22

    Target tracking is a critical wireless sensor application, which involves signal and information processing technologies. In conventional target position estimation methods, an estimate is usually demonstrated by an average target position. In contrast, this work proposes a distributed information compression method to describe the measurement uncertainty of tracking problems in cluster-based wireless sensor networks. The leader-based information processing scheme is applied to perform target positioning and energy conservation. A two-level hierarchical network topology is adopted for energy-efficient target tracking with information compression. A Level 1 network architecture is a cluster-based network topology for managing network operations. A Level 2 network architecture is an event-based and leader-based topology, utilizing the concept of information compression to process the estimates of sensor nodes. The simulation results show that compared to conventional schemes, the proposed data processing scheme has a balanced system performance in terms of tracking accuracy, data size for transmission and energy consumption.

  17. MaxEnt analysis of a water distribution network in Canberra, ACT, Australia

    NASA Astrophysics Data System (ADS)

    Waldrip, Steven H.; Niven, Robert K.; Abel, Markus; Schlegel, Michael; Noack, Bernd R.

    2015-01-01

    A maximum entropy (MaxEnt) method is developed to infer the state of a pipe flow network, for situations in which there is insufficient information to form a closed equation set. This approach substantially extends existing deterministic methods for the analysis of engineered flow networks (e.g. Newton's method or the Hardy Cross scheme). The network is represented as an undirected graph structure, in which the uncertainty is represented by a continuous relative entropy on the space of internal and external flow rates. The head losses (potential differences) on the network are treated as dependent variables, using specified pipe-flow resistance functions. The entropy is maximised subject to "observable" constraints on the mean values of certain flow rates and/or potential differences, and also "physical" constraints arising from the frictional properties of each pipe and from Kirchhoff's nodal and loop laws. A numerical method is developed in Matlab for solution of the integral equation system, based on multidimensional quadrature. Several nonlinear resistance functions (e.g. power-law and Colebrook) are investigated, necessitating numerical solution of the implicit Lagrangian by a double iteration scheme. The method is applied to a 1123-node, 1140-pipe water distribution network for the suburb of Torrens in the Australian Capital Territory, Australia, using network data supplied by water authority ACTEW Corporation Limited. A number of different assumptions are explored, including various network geometric representations, prior probabilities and constraint settings, yielding useful predictions of network demand and performance. We also propose this methodology be used in conjunction with in-flow monitoring systems, to obtain better inferences of user consumption without large investments in monitoring equipment and maintenance.

  18. Evolutionary prisoner's dilemma on Newman-Watts social networks with an asymmetric payoff distribution mechanism

    NASA Astrophysics Data System (ADS)

    Du, Wen-Bo; Cao, Xian-Bin; Yang, Han-Xin; Hu, Mao-Bin

    2010-01-01

    In this paper, we introduce an asymmetric payoff distribution mechanism into the evolutionary prisoner's dilemma game (PDG) on Newman-Watts social networks, and study its effects on the evolution of cooperation. The asymmetric payoff distribution mechanism can be adjusted by the parameter α: if α > 0, the rich will exploit the poor to get richer; if α < 0, the rich are forced to offer part of their income to the poor. Numerical results show that the cooperator frequency monotonously increases with α and is remarkably promoted when α > 0. The effects of updating order and self-interaction are also investigated. The co-action of random updating and self-interaction can induce the highest cooperation level. Moreover, we employ the Gini coefficient to investigate the effect of asymmetric payoff distribution on the the system's wealth distribution. This work may be helpful for understanding cooperative behaviour and wealth inequality in society.

  19. Multirate parallel distributed compensation of a cluster in wireless sensor and actor networks

    NASA Astrophysics Data System (ADS)

    Yang, Chun-xi; Huang, Ling-yun; Zhang, Hao; Hua, Wang

    2016-01-01

    The stabilisation problem for one of the clusters with bounded multiple random time delays and packet dropouts in wireless sensor and actor networks is investigated in this paper. A new multirate switching model is constructed to describe the feature of this single input multiple output linear system. According to the difficulty of controller design under multi-constraints in multirate switching model, this model can be converted to a Takagi-Sugeno fuzzy model. By designing a multirate parallel distributed compensation, a sufficient condition is established to ensure this closed-loop fuzzy control system to be globally exponentially stable. The solution of the multirate parallel distributed compensation gains can be obtained by solving an auxiliary convex optimisation problem. Finally, two numerical examples are given to show, compared with solving switching controller, multirate parallel distributed compensation can be obtained easily. Furthermore, it has stronger robust stability than arbitrary switching controller and single-rate parallel distributed compensation under the same conditions.

  20. Design of atomic step networks on Si(111) through strain distribution control

    NASA Astrophysics Data System (ADS)

    Omi, Hiroo; Homma, Yoshikazu; Ogino, Toshio; Stoyanov, Stoyan; Tonchev, Vesselin

    2004-01-01

    We propose an alternative method to control atomic step networks on silicon for future wafer-scale integration of self-assembling nanostructures. The method is the strain-distribution-control method that we have recently proposed in [H. Omi, D. J. Bottomley, and T. Ogino, Appl. Phys. Lett. 80, 1073 (2002)], which we apply here to design atomic step networks on vicinal Si(111) wafer. Si(111) with its strain patterned by buried silicon oxide inclusions was annealed at 1230 °C in ultrahigh vacuum and observed by in situ secondary electron microscopy and ex situ atomic force microscopy. The images show that the method enables us to create the desired arrays of atomic step networks on an arbitrary area of planar silicon wafer. The arrays remain stable during the 1230 °C annealing.

  1. Layer 1 VPN services in distributed next-generation SONET/SDH networks with inverse multiplexing

    NASA Astrophysics Data System (ADS)

    Ghani, N.; Muthalaly, M. V.; Benhaddou, D.; Alanqar, W.

    2006-05-01

    Advances in next-generation SONET/SDH along with GMPLS control architectures have enabled many new service provisioning capabilities. In particular, a key services paradigm is the emergent Layer 1 virtual private network (L1 VPN) framework, which allows multiple clients to utilize a common physical infrastructure and provision their own 'virtualized' circuit-switched networks. This precludes expensive infrastructure builds and increases resource utilization for carriers. Along these lines, a novel L1 VPN services resource management scheme for next-generation SONET/SDH networks is proposed that fully leverages advanced virtual concatenation and inverse multiplexing features. Additionally, both centralized and distributed GMPLS-based implementations are also tabled to support the proposed L1 VPN services model. Detailed performance analysis results are presented along with avenues for future research.

  2. Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

    PubMed

    Yoon, Young; Kim, Beom Heyn

    2016-01-01

    Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

  3. Examining the Distribution, Modularity, and Community Structure in Article Networks for Systematic Reviews.

    PubMed

    Ji, Xiaonan; Machiraju, Raghu; Ritter, Alan; Yen, Po-Yin

    2015-01-01

    Systematic reviews (SRs) provide high quality evidence for clinical practice, but the article screening process is time and labor intensive. As SRs aim to identify relevant articles with a specific scope, we propose that a pre-defined article relationship, using similarity metrics, could accelerate this process. In this study, we established the article relationship using MEDLINE element similarities and visualized the article network with the Force Atlas layout. We also analyzed the article networks with graph diameter, closeness centrality, and module classes. The results revealed the distribution of articles and found that included articles tended to aggregate together in some module classes, providing further evidence of the existence of strong relationships among included articles. This approach can be utilized to facilitate the articles selection process through early identification of these dominant module classes. We are optimistic that the use of article network visualization can help better SR work prioritization.

  4. Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network

    PubMed Central

    Kim, Beom Heyn

    2016-01-01

    Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users. PMID:27367610

  5. Cluster synchronization of community network with distributed time delays via impulsive control

    NASA Astrophysics Data System (ADS)

    Leng, Hui; Wu, Zhao-Yan

    2016-11-01

    Cluster synchronization is an important dynamical behavior in community networks and deserves further investigations. A community network with distributed time delays is investigated in this paper. For achieving cluster synchronization, an impulsive control scheme is introduced to design proper controllers and an adaptive strategy is adopted to make the impulsive controllers unified for different networks. Through taking advantage of the linear matrix inequality technique and constructing Lyapunov functions, some synchronization criteria with respect to the impulsive gains, instants, and system parameters without adaptive strategy are obtained and generalized to the adaptive case. Finally, numerical examples are presented to demonstrate the effectiveness of the theoretical results. Project supported by the National Natural Science Foundation of China (Grant No. 61463022), the Natural Science Foundation of Jiangxi Province, China (Grant No. 20161BAB201021), and the Natural Science Foundation of Jiangxi Educational Committee, China (Grant No. GJJ14273).

  6. Androgen receptor distribution in the social decision-making network of eusocial naked mole-rats.

    PubMed

    Holmes, Melissa M; Van Mil, Spencer; Bulkowski, Camila; Goldman, Sharry L; Goldman, Bruce D; Forger, Nancy G

    2013-11-01

    Naked mole-rats are highly social rodents that live in large groups and exhibit a strict reproductive and social hierarchy. Only a few animals in each colony breed; the remainder are non-reproductive and are socially subordinate to breeders. We have examined androgen receptor immunoreactive (AR+) cells in brain regions comprising the recently described social decision-making network in subordinate and breeder naked mole-rats of both sexes. We find that subordinates have a significantly higher percentage of AR+ cells in all brain regions expressing this protein. By contrast, there were no significant effects of sex and no sex-by-status interactions on the percentage of AR+ cells. Taken together with previous findings, the present data complete a systematic assessment of the distribution of AR protein in the social decision-making network of the eusocial mammalian brain and demonstrate a significant role for social status in the regulation of this protein throughout many nodes of this network.

  7. Signal Destruction Tunes the Zone of Activation in Spatially Distributed Signaling Networks.

    PubMed

    Silva, Kalinga Pavan; Chellamuthu, Prithiviraj; Boedicker, James Q

    2017-03-14

    Diverse microbial communities coordinate group behaviors through signal exchange, such as the exchange of acyl-homoserine lactones (AHLs) by Gram-negative bacteria. Cellular communication is prone to interference by neighboring microbes. One mechanism of interference is signal destruction through the production of an enzyme that cleaves the signaling molecule. Here we examine the ability of one such interference enzyme, AiiA, to modulate signal propagation in a spatially distributed system of bacteria. We have developed an experimental assay to measure signal transduction and implement a theoretical model of signaling dynamics to predict how the system responds to interference. We show that titration of an interfering strain into a signaling network tunes the spatial range of activation over the centimeter length scale, quantifying the robustness of the signaling network to signal destruction and demonstrating the ability to program systems-level responses of spatially heterogeneous cellular networks.

  8. Techniques for selecting topology and implementing the distributed control system network

    NASA Astrophysics Data System (ADS)

    Chernyi, S.

    2016-04-01

    On grounds of reviews devoted to flows analysis methods in the data processing networks within the automated control systems for the technological process and assessment of these methods by the selected set of requirements, one may make conclusion about expediency of using the combination of graph flow algorithms and the queuing theory. The outputs of the research concerning the impact of network dynamics on the drilling platform distributed system control quality prove the fact that the quality of the transient depends upon the frequency of discretization and intensity of flows. With increasing the intensity of flows, the static error of the control enlarges. It was concluded that in order to control the automation objects in the real-time mode it is required to minimize the delays in transmitting packets in the network.

  9. Scaling of weighted spectral distribution in deterministic scale-free networks

    NASA Astrophysics Data System (ADS)

    Jiao, Bo; Nie, Yuan-ping; Shi, Jian-mai; Huang, Cheng-dong; Zhou, Ying; Du, Jing; Guo, Rong-hua; Tao, Ye-rong

    2016-06-01

    Scale-free networks are abundant in the real world. In this paper, we investigate the scaling properties of the weighted spectral distribution in several deterministic and stochastic models of evolving scale-free networks. First, we construct a new deterministic scale-free model whose node degrees have a unified format. Using graph structure features, we derive a precise formula for the spectral metric in this model. This formula verifies that the spectral metric grows sublinearly as network size (i.e., the number of nodes) grows. Additionally, the mathematical reasoning of the precise formula theoretically provides detailed explanations for this scaling property. Finally, we validate the scaling properties of the spectral metric using some stochastic models. The experimental results show that this scaling property can be retained regardless of local world, node deleting and assortativity adjustment.

  10. Relaxation dynamics of small-world degree-distributed treelike polymer networks

    NASA Astrophysics Data System (ADS)

    Galiceanu, Mircea; Oliveira, Edieliton S.; Dolgushev, Maxim

    2016-11-01

    Hyperbranched polymers are typically treelike macromolecules with a very disordered structure. Here we construct hyperbranched polymers based on the degree distribution of the small-world networks. This algorithm allows us to study a transition from monodisperse linear chains to structurally-disordered dendritic polymers by varying the parameter p (0 ≤ p ≤ 1), which measures the randomness and the degree of branching of the network. Employing the framework of generalized Gaussian structures, we determine for the obtained structures the relaxation spectra, which are exemplified on the mechanical relaxation moduli (storage and loss moduli). We monitor these physical quantities for networks of different sizes and for various values of the parameter p. In the intermediate frequency domain, we encounter macroscopically distinguishable behaviours.

  11. Energy efficient wireless sensor network for structural health monitoring using distributed embedded piezoelectric transducers

    NASA Astrophysics Data System (ADS)

    Li, Peng; Olmi, Claudio; Song, Gangbing

    2010-04-01

    Piezoceramic based transducers are widely researched and used for structural health monitoring (SHM) systems due to the piezoceramic material's inherent advantage of dual sensing and actuation. Wireless sensor network (WSN) technology benefits from advances made in piezoceramic based structural health monitoring systems, allowing easy and flexible installation, low system cost, and increased robustness over wired system. However, piezoceramic wireless SHM systems still faces some drawbacks, one of these is that the piezoceramic based SHM systems require relatively high computational capabilities to calculate damage information, however, battery powered WSN sensor nodes have strict power consumption limitation and hence limited computational power. On the other hand, commonly used centralized processing networks require wireless sensors to transmit all data back to the network coordinator for analysis. This signal processing procedure can be problematic for piezoceramic based SHM applications as it is neither energy efficient nor robust. In this paper, we aim to solve these problems with a distributed wireless sensor network for piezoceramic base structural health monitoring systems. Three important issues: power system, waking up from sleep impact detection, and local data processing, are addressed to reach optimized energy efficiency. Instead of sweep sine excitation that was used in the early research, several sine frequencies were used in sequence to excite the concrete structure. The wireless sensors record the sine excitations and compute the time domain energy for each sine frequency locally to detect the energy change. By comparing the data of the damaged concrete frame with the healthy data, we are able to find out the damage information of the concrete frame. A relative powerful wireless microcontroller was used to carry out the sampling and distributed data processing in real-time. The distributed wireless network dramatically reduced the data

  12. Multi-risk assessment of L'Aquila gas distribution network

    NASA Astrophysics Data System (ADS)

    Esposito, S.; Iervolino, I.; Silvestri, F.; d'Onofrio, A.; Santo, A.; Franchin, P.; Cavalieri, F.

    2012-04-01

    This study focuses on the assessment of seismic risk for gas distribution networks. The basic function of a gas system is to deliver gas from sources to costumers and it is essentially composed of pipelines, reduction stations, and demand nodes, which are connected to end users to which the lifeline delivers gas. Because most of the components are spatially distributed and buried, seismic hazard has to account for both spatial correlation of ground motion intensity measures and effects induced by permanent ground deformation such as liquefaction and landslide, which determine localized ground failure. Different performance measures are considered in the study for the network, in terms of connectivity and flow reduction. Part of the gas distribution network operating in L'Aquila (central Italy), operated by ENEL Rete Gas spa has been chosen as case study. The whole network is distributed via a 621 km pipeline network: 234 km of pipes operating at medium pressure and the remaining 387 km with gas flowing at low pressure; it also consists of Metering/Pressure reduction stations, Reduction Groups and demand nodes. The framework presented makes use of probabilistic seismic hazard analysis, both in terms of ground motion and permanent ground deformation, empirical relations to estimate pipeline response, fragility curves for the evaluation of reduction cabins vulnerability, performance indicators to characterize the functionality of the gas network. The analysis were performed through a computer code specific for risk assessment of distributed systems developed by the authors. Probabilistic hazard scenarios have been simulated for the region covering the case study considering the Paganica fault on which L'Aquila 2009 earthquake was originated as source. The strong motion has been evaluated using an European ground motion prediction equation and an associated spatial correlation model. Regarding geotechnical hazards the landslide potential of L'Aquila region, according

  13. Whole-brain activity maps reveal stereotyped, distributed networks for visuomotor behavior.

    PubMed

    Portugues, Ruben; Feierstein, Claudia E; Engert, Florian; Orger, Michael B

    2014-03-19

    Most behaviors, even simple innate reflexes, are mediated by circuits of neurons spanning areas throughout the brain. However, in most cases, the distribution and dynamics of firing patterns of these neurons during behavior are not known. We imaged activity, with cellular resolution, throughout the whole brains of zebrafish performing the optokinetic response. We found a sparse, broadly distributed network that has an elaborate but ordered pattern, with a bilaterally symmetrical organization. Activity patterns fell into distinct clusters reflecting sensory and motor processing. By correlating neuronal responses with an array of sensory and motor variables, we find that the network can be clearly divided into distinct functional modules. Comparing aligned data from multiple fish, we find that the spatiotemporal activity dynamics and functional organization are highly stereotyped across individuals. These experiments systematically reveal the functional architecture of neural circuits underlying a sensorimotor behavior in a vertebrate brain.

  14. A Wolf Pack Algorithm for Active and Reactive Power Coordinated Optimization in Active Distribution Network

    NASA Astrophysics Data System (ADS)

    Zhuang, H. M.; Jiang, X. J.

    2016-08-01

    This paper presents an active and reactive power dynamic optimization model for active distribution network (ADN), whose control variables include the output of distributed generations (DGs), charge or discharge power of energy storage system (ESS) and reactive power from capacitor banks. To solve the high-dimension nonlinear optimization model, a new heuristic swarm intelligent method, namely wolf pack algorithm (WPA) with better global convergence and computational robustness, is adapted so that the network loss minimization can be achieved. In this paper, the IEEE33-bus system is used to show the effectiveness of WPA technique compared with other techniques. Numerical tests on the modified IEEE 33-bus system show that WPA for active and reactive multi-period optimization of ADN is exact and effective.

  15. XNsim: Internet-Enabled Collaborative Distributed Simulation via an Extensible Network

    NASA Technical Reports Server (NTRS)

    Novotny, John; Karpov, Igor; Zhang, Chendi; Bedrossian, Nazareth S.

    2007-01-01

    In this paper, the XNsim approach to achieve Internet-enabled, dynamically scalable collaborative distributed simulation capabilities is presented. With this approach, a complete simulation can be assembled from shared component subsystems written in different formats, that run on different computing platforms, with different sampling rates, in different geographic locations, and over singlelmultiple networks. The subsystems interact securely with each other via the Internet. Furthermore, the simulation topology can be dynamically modified. The distributed simulation uses a combination of hub-and-spoke and peer-topeer network topology. A proof-of-concept demonstrator is also presented. The XNsim demonstrator can be accessed at http://www.jsc.draver.corn/xn that hosts various examples of Internet enabled simulations.

  16. Whole-brain activity maps reveal stereotyped, distributed networks for visuomotor behavior

    PubMed Central

    Portugues, Ruben; Feierstein, Claudia E.; Engert, Florian; Orger, Michael B.

    2014-01-01

    Summary Most behaviors, even simple innate reflexes, are mediated by circuits of neurons spanning areas throughout the brain. However, in most cases, the distribution and dynamics of firing patterns of these neurons during behavior are not known. We imaged activity, with cellular resolution, throughout the whole brains of zebrafish performing the optokinetic response. We found a sparse, broadly distributed network that has an elaborate, but ordered, pattern, with a bilaterally symmetrical organization. Activity patterns fell into distinct clusters reflecting sensory and motor processing. By correlating neuronal responses with an array of sensory and motor variables, we find that the network can be clearly divided into distinct functional modules. Comparing aligned data from multiple fish, we find that the spatiotemporal activity dynamics and functional organization are highly stereotyped across individuals. These experiments reveal, for the first time in a vertebrate, the comprehensive functional architecture of the neural circuits underlying a sensorimotor behavior. PMID:24656252

  17. Multiple concurrent sources localization based on a two-node distributed acoustic sensor network

    NASA Astrophysics Data System (ADS)

    Xu, Jiaxin; Zhao, Zhao; Chen, Chunzeng; Xu, Zhiyong

    2017-01-01

    In this work, we propose a new approach to localize multiple concurrent sources using a distributed acoustic sensor network. Only two node-arrays are required in this sensor network, and each node-array consists of only two widely spaced sensors. Firstly, direction-of-arrivals (DOAs) of multiple sources are estimated at each node-array by utilizing a new pooled angular spectrum proposed in this paper, which can implement the spatial aliasing suppression effectively. Based on minimum variance distortionless response (MVDR) beamforming and the DOA estimates of the sources, the time-frequency spectra containing the corresponding energy distribution features associated with those sources are reconstructed in each node-array. Then, scale invariant feature transform (SIFT) is employed to solve the DOA association problem. Performance evaluation is conducted with field recordings and experimental results prove the effectivity and feasibility of the proposed method.

  18. Hybrid decode-amplify-forward (HDAF) scheme in distributed Alamouti-coded cooperative network

    NASA Astrophysics Data System (ADS)

    Gurrala, Kiran Kumar; Das, Susmita

    2015-05-01

    In this article, a signal-to-noise ratio (SNR)-based hybrid decode-amplify-forward scheme in a distributed Alamouti-coded cooperative network is proposed. Considering a flat Rayleigh fading channel environment, the MATLAB simulation and analysis are carried out. In the cooperative scheme, two relays are employed, where each relay is transmitting each row Alamouti code. The selection of SNR threshold depends on the target rate information. The closed form expressions of symbol error rate (SER), the outage probability and average channel capacity with tight upper bounds are derived and compared with the simulation done in MATLAB environment. Furthermore, the impact of relay location on the SER performance is analysed. It is observed that the proposed hybrid relaying technique outperforms the individual amplify and forward and decode and forward ones in the distributed Alamouti-coded cooperative network.

  19. Continuous-Time Discrete-Distribution Theory for Activity-Driven Networks

    NASA Astrophysics Data System (ADS)

    Zino, Lorenzo; Rizzo, Alessandro; Porfiri, Maurizio

    2016-11-01

    Activity-driven networks are a powerful paradigm to study epidemic spreading over time-varying networks. Despite significant advances, most of the current understanding relies on discrete-time computer simulations, in which each node is assigned an activity potential from a continuous distribution. Here, we establish a continuous-time discrete-distribution framework toward an analytical treatment of the epidemic spreading, from its onset to the endemic equilibrium. In the thermodynamic limit, we derive a nonlinear dynamical system to accurately model the epidemic spreading and leverage techniques from the fields of differential inclusions and adaptive estimation to inform short- and long-term predictions. We demonstrate our framework through the analysis of two real-world case studies, exemplifying different physical phenomena and time scales.

  20. Ultra-stable long distance optical frequency distribution using the Internet fiber network.

    PubMed

    Lopez, Olivier; Haboucha, Adil; Chanteau, Bruno; Chardonnet, Christian; Amy-Klein, Anne; Santarelli, Giorgio

    2012-10-08

    We report an optical link of 540 km for ultrastable frequency distribution over the Internet fiber network. The stable frequency optical signal is processed enabling uninterrupted propagation on both directions. The robustness and the performance of the link are enhanced by a cost effective fully automated optoelectronic station. This device is able to coherently regenerate the return optical signal with a heterodyne optical phase locking of a low noise laser diode. Moreover the incoming signal polarization variation are tracked and processed in order to maintain beat note amplitudes within the operation range. Stable fibered optical interferometer enables optical detection of the link round trip phase signal. The phase-noise compensated link shows a fractional frequency instability in 10 Hz bandwidth of 5 × 10(-15) at one second measurement time and 2 × 10(-19) at 30,000 s. This work is a significant step towards a sustainable wide area ultrastable optical frequency distribution and comparison network.

  1. An Intelligent Control for the Distributed Flexible Network Photovoltaic System using Autonomous Control and Agent

    NASA Astrophysics Data System (ADS)

    Park, Sangsoo; Miura, Yushi; Ise, Toshifumi

    This paper proposes an intelligent control for the distributed flexible network photovoltaic system using autonomous control and agent. The distributed flexible network photovoltaic system is composed of a secondary battery bank and a number of subsystems which have a solar array, a dc/dc converter and a load. The control mode of dc/dc converter can be selected based on local information by autonomous control. However, if only autonomous control using local information is applied, there are some problems associated with several cases such as voltage drop on long power lines. To overcome these problems, the authors propose introducing agents to improve control characteristics. The autonomous control with agents is called as intelligent control in this paper. The intelligent control scheme that employs the communication between agents is applied for the model system and proved with simulation using PSCAD/EMTDC.

  2. Continuous-Time Discrete-Distribution Theory for Activity-Driven Networks.

    PubMed

    Zino, Lorenzo; Rizzo, Alessandro; Porfiri, Maurizio

    2016-11-25

    Activity-driven networks are a powerful paradigm to study epidemic spreading over time-varying networks. Despite significant advances, most of the current understanding relies on discrete-time computer simulations, in which each node is assigned an activity potential from a continuous distribution. Here, we establish a continuous-time discrete-distribution framework toward an analytical treatment of the epidemic spreading, from its onset to the endemic equilibrium. In the thermodynamic limit, we derive a nonlinear dynamical system to accurately model the epidemic spreading and leverage techniques from the fields of differential inclusions and adaptive estimation to inform short- and long-term predictions. We demonstrate our framework through the analysis of two real-world case studies, exemplifying different physical phenomena and time scales.

  3. A Distributed Collaborative Filtering Recommendation Model for P2P Networks

    NASA Astrophysics Data System (ADS)

    Wang, Jun; Peng, Jian; Cao, Xiaoyang

    Conventional collaborative filtering(CF) recommendation applies the user-based centralized architecture. This architecture has some problems of sparsity and scalability, in addition to not fit the current popular P2P architecture. Therefore, this paper proposes a distributed model to implement the CF algorithm by maintaining the user’s record information distributedly in each nodes throughout the network, constructing a DHT, applying the Chord algorithm to realize locating of the record and designing the corresponding communication policy to obtain data needed.

  4. Lyapunov Functions, Stationary Distributions, and Non-equilibrium Potential for Reaction Networks.

    PubMed

    Anderson, David F; Craciun, Gheorghe; Gopalkrishnan, Manoj; Wiuf, Carsten

    2015-09-01

    We consider the relationship between stationary distributions for stochastic models of reaction systems and Lyapunov functions for their deterministic counterparts. Specifically, we derive the well-known Lyapunov function of reaction network theory as a scaling limit of the non-equilibrium potential of the stationary distribution of stochastically modeled complex balanced systems. We extend this result to general birth-death models and demonstrate via example that similar scaling limits can yield Lyapunov functions even for models that are not complex or detailed balanced, and may even have multiple equilibria.

  5. Prototype of network distributed control system for MLF/J-PARC

    NASA Astrophysics Data System (ADS)

    Nakatani, Takeshi; Nakajima, Kenji; Torii, Shuki; Bharoto; Higemoto, Wataru; Sato, Setsuo; Otomo, Toshiya; Arai, Masatoshi

    2006-11-01

    We have developed a prototype data acquisition and device control system for experiment instruments at the Material and Life science Facility (MLF)/Japan-Proton Accelerator Research Complex (J-PARC). The system employs distributed computing via Ethernet, client/server architecture, modular structure and a state machine. Communication between client and server software utilizes socket protocols over TCP/IP. We have deployed this prototype software in the network distributed control system by improving the data acquisition software used at KENS, introducing the system for the SWAN at KENS/KEK. It was kept in working order throughout 2 weeks of machine operation.

  6. The origin of the criticality in meme popularity distribution on complex networks

    PubMed Central

    Kim, Yup; Park, Seokjong; Yook, Soon-Hyung

    2016-01-01

    Previous studies showed that the meme popularity distribution is described by a heavy-tailed distribution or a power-law, which is a characteristic feature of the criticality. Here, we study the origin of the criticality on non-growing and growing networks based on the competition induced criticality model. From the direct Mote Carlo simulations and the exact mapping into the position dependent biased random walk (PDBRW), we find that the meme popularity distribution satisfies a very robust power- law with exponent α = 3/2 if there is an innovation process. On the other hand, if there is no innovation, then we find that the meme popularity distribution is bounded and highly skewed for early transient time periods, while it satisfies a power-law with exponent α ≠ 3/2 for intermediate time periods. The exact mapping into PDBRW clearly shows that the balance between the creation of new memes by the innovation process and the extinction of old memes is the key factor for the criticality. We confirm that the balance for the criticality sustains for relatively small innovation rate. Therefore, the innovation processes with significantly influential memes should be the simple and fundamental processes which cause the critical distribution of the meme popularity in real social networks. PMID:27009399

  7. The origin of the criticality in meme popularity distribution on complex networks

    NASA Astrophysics Data System (ADS)

    Kim, Yup; Park, Seokjong; Yook, Soon-Hyung

    2016-03-01

    Previous studies showed that the meme popularity distribution is described by a heavy-tailed distribution or a power-law, which is a characteristic feature of the criticality. Here, we study the origin of the criticality on non-growing and growing networks based on the competition induced criticality model. From the direct Mote Carlo simulations and the exact mapping into the position dependent biased random walk (PDBRW), we find that the meme popularity distribution satisfies a very robust power- law with exponent α = 3/2 if there is an innovation process. On the other hand, if there is no innovation, then we find that the meme popularity distribution is bounded and highly skewed for early transient time periods, while it satisfies a power-law with exponent α ≠ 3/2 for intermediate time periods. The exact mapping into PDBRW clearly shows that the balance between the creation of new memes by the innovation process and the extinction of old memes is the key factor for the criticality. We confirm that the balance for the criticality sustains for relatively small innovation rate. Therefore, the innovation processes with significantly influential memes should be the simple and fundamental processes which cause the critical distribution of the meme popularity in real social networks.

  8. The origin of the criticality in meme popularity distribution on complex networks.

    PubMed

    Kim, Yup; Park, Seokjong; Yook, Soon-Hyung

    2016-03-24

    Previous studies showed that the meme popularity distribution is described by a heavy-tailed distribution or a power-law, which is a characteristic feature of the criticality. Here, we study the origin of the criticality on non-growing and growing networks based on the competition induced criticality model. From the direct Mote Carlo simulations and the exact mapping into the position dependent biased random walk (PDBRW), we find that the meme popularity distribution satisfies a very robust power- law with exponent α = 3/2 if there is an innovation process. On the other hand, if there is no innovation, then we find that the meme popularity distribution is bounded and highly skewed for early transient time periods, while it satisfies a power-law with exponent α ≠ 3/2 for intermediate time periods. The exact mapping into PDBRW clearly shows that the balance between the creation of new memes by the innovation process and the extinction of old memes is the key factor for the criticality. We confirm that the balance for the criticality sustains for relatively small innovation rate. Therefore, the innovation processes with significantly influential memes should be the simple and fundamental processes which cause the critical distribution of the meme popularity in real social networks.

  9. A Distributed Multiagent System Architecture for Body Area Networks Applied to Healthcare Monitoring

    PubMed Central

    Laza, Rosalía; Pereira, António

    2015-01-01

    In the last years the area of health monitoring has grown significantly, attracting the attention of both academia and commercial sectors. At the same time, the availability of new biomedical sensors and suitable network protocols has led to the appearance of a new generation of wireless sensor networks, the so-called wireless body area networks. Nowadays, these networks are routinely used for continuous monitoring of vital parameters, movement, and the surrounding environment of people, but the large volume of data generated in different locations represents a major obstacle for the appropriate design, development, and deployment of more elaborated intelligent systems. In this context, we present an open and distributed architecture based on a multiagent system for recognizing human movements, identifying human postures, and detecting harmful activities. The proposed system evolved from a single node for fall detection to a multisensor hardware solution capable of identifying unhampered falls and analyzing the users' movement. The experiments carried out contemplate two different scenarios and demonstrate the accuracy of our proposal as a real distributed movement monitoring and accident detection system. Moreover, we also characterize its performance, enabling future analyses and comparisons with similar approaches. PMID:25874202

  10. A Self-Organizing Incremental Neural Network based on local distribution learning.

    PubMed

    Xing, Youlu; Shi, Xiaofeng; Shen, Furao; Zhou, Ke; Zhao, Jinxi

    2016-12-01

    In this paper, we propose an unsupervised incremental learning neural network based on local distribution learning, which is called Local Distribution Self-Organizing Incremental Neural Network (LD-SOINN). The LD-SOINN combines the advantages of incremental learning and matrix learning. It can automatically discover suitable nodes to fit the learning data in an incremental way without a priori knowledge such as the structure of the network. The nodes of the network store rich local information regarding the learning data. The adaptive vigilance parameter guarantees that LD-SOINN is able to add new nodes for new knowledge automatically and the number of nodes will not grow unlimitedly. While the learning process continues, nodes that are close to each other and have similar principal components are merged to obtain a concise local representation, which we call a relaxation data representation. A denoising process based on density is designed to reduce the influence of noise. Experiments show that the LD-SOINN performs well on both artificial and real-word data.

  11. Quantum teleportation with independent sources and prior entanglement distribution over a network

    NASA Astrophysics Data System (ADS)

    Sun, Qi-Chao; Mao, Ya-Li; Chen, Si-Jing; Zhang, Wei; Jiang, Yang-Fan; Zhang, Yan-Bao; Zhang, Wei-Jun; Miki, Shigehito; Yamashita, Taro; Terai, Hirotaka; Jiang, Xiao; Chen, Teng-Yun; You, Li-Xing; Chen, Xian-Feng; Wang, Zhen; Fan, Jing-Yun; Zhang, Qiang; Pan, Jian-Wei

    2016-10-01

    Quantum teleportation faithfully transfers a quantum state between distant nodes in a network, which enables revolutionary information-processing applications. This has motivated a tremendous amount of research activity. However, in the past not a single quantum-teleportation experiment has been realized with independent quantum sources, entanglement distribution prior to the Bell-state measurement (BSM) and feedforward operation simultaneously, even in the laboratory environment. We take the challenge and report the construction of a 30 km optical-fibre-based quantum network distributed over a 12.5 km area. This network is robust against noise in the real world with active stabilization strategies, which allows us to realize quantum teleportation with all the ingredients simultaneously. Both the quantum-state and process-tomography measurements and an independent statistical hypothesis test confirm the quantum nature of the quantum teleportation over this network. Our experiment marks a critical step towards the realization of a global ‘quantum internet’ in the real world.

  12. A distributed multiagent system architecture for body area networks applied to healthcare monitoring.

    PubMed

    Felisberto, Filipe; Laza, Rosalía; Fdez-Riverola, Florentino; Pereira, António

    2015-01-01

    In the last years the area of health monitoring has grown significantly, attracting the attention of both academia and commercial sectors. At the same time, the availability of new biomedical sensors and suitable network protocols has led to the appearance of a new generation of wireless sensor networks, the so-called wireless body area networks. Nowadays, these networks are routinely used for continuous monitoring of vital parameters, movement, and the surrounding environment of people, but the large volume of data generated in different locations represents a major obstacle for the appropriate design, development, and deployment of more elaborated intelligent systems. In this context, we present an open and distributed architecture based on a multiagent system for recognizing human movements, identifying human postures, and detecting harmful activities. The proposed system evolved from a single node for fall detection to a multisensor hardware solution capable of identifying unhampered falls and analyzing the users' movement. The experiments carried out contemplate two different scenarios and demonstrate the accuracy of our proposal as a real distributed movement monitoring and accident detection system. Moreover, we also characterize its performance, enabling future analyses and comparisons with similar approaches.

  13. Phylogenetic structure of European Salmonella Enteritidis outbreak correlates with national and international egg distribution network

    PubMed Central

    Inns, Thomas; Jombart, Thibaut; Ashton, Philip; Loman, Nicolas; Chatt, Carol; Messelhaeusser, Ute; Rabsch, Wolfgang; Simon, Sandra; Nikisins, Sergejs; Bernard, Helen; le Hello, Simon; Jourdan da-Silva, Nathalie; Kornschober, Christian; Mossong, Joel; Hawkey, Peter; de Pinna, Elizabeth; Grant, Kathie; Cleary, Paul

    2016-01-01

    Outbreaks of Salmonella Enteritidis have long been associated with contaminated poultry and eggs. In the summer of 2014 a large multi-national outbreak of Salmonella Enteritidis phage type 14b occurred with over 350 cases reported in the United Kingdom, Germany, Austria, France and Luxembourg. Egg supply network investigation and microbiological sampling identified the source to be a Bavarian egg producer. As part of the international investigation into the outbreak, over 400 isolates were sequenced including isolates from cases, implicated UK premises and eggs from the suspected source producer. We were able to show a clear statistical correlation between the topology of the UK egg distribution network and the phylogenetic network of outbreak isolates. This correlation can most plausibly be explained by different parts of the egg distribution network being supplied by eggs solely from independent premises of the Bavarian egg producer (Company X). Microbiological sampling from the source premises, traceback information and information on the interventions carried out at the egg production premises all supported this conclusion. The level of insight into the outbreak epidemiology provided by whole-genome sequencing (WGS) would not have been possible using traditional microbial typing methods. PMID:28348865

  14. Sensor Location Problem Optimization for Traffic Network with Different Spatial Distributions of Traffic Information.

    PubMed

    Bao, Xu; Li, Haijian; Qin, Lingqiao; Xu, Dongwei; Ran, Bin; Rong, Jian

    2016-10-27

    To obtain adequate traffic information, the density of traffic sensors should be sufficiently high to cover the entire transportation network. However, deploying sensors densely over the entire network may not be realistic for practical applications due to the budgetary constraints of traffic management agencies. This paper describes several possible spatial distributions of traffic information credibility and proposes corresponding different sensor information credibility functions to describe these spatial distribution properties. A maximum benefit model and its simplified model are proposed to solve the traffic sensor location problem. The relationships between the benefit and the number of sensors are formulated with different sensor information credibility functions. Next, expanding models and algorithms in analytic results are performed. For each case, the maximum benefit, the optimal number and spacing of sensors are obtained and the analytic formulations of the optimal sensor locations are derived as well. Finally, a numerical example is proposed to verify the validity and availability of the proposed models for solving a network sensor location problem. The results show that the optimal number of sensors of segments with different model parameters in an entire freeway network can be calculated. Besides, it can also be concluded that the optimal sensor spacing is independent of end restrictions but dependent on the values of model parameters that represent the physical conditions of sensors and roads.

  15. SHD digital cinema distribution over a long distance network of Internet2

    NASA Astrophysics Data System (ADS)

    Yamaguchi, Takahiro; Shirai, Daisuke; Fujii, Tatsuya; Nomura, Mitsuru; Fujii, Tetsuro; Ono, Sadayasu

    2003-06-01

    We have developed a prototype SHD (Super High Definition) digital cinema distribution system that can store, transmit and display eight-million-pixel motion pictures that have the image quality of a 35-mm film movie. The system contains a video server, a real-time decoder, and a D-ILA projector. Using a gigabit Ethernet link and TCP/IP, the server transmits JPEG2000 compressed motion picture data streams to the decoder at transmission speeds as high as 300 Mbps. The received data streams are decompressed by the decoder, and then projected onto a screen via the projector. With this system, digital cinema contents can be distributed over a wide-area optical gigabit IP network. However, when digital cinema contents are delivered over long distances by using a gigabit IP network and TCP, the round-trip time increases and network throughput either stops rising or diminishes. In a long-distance SHD digital cinema transmission experiment performed on the Internet2 network in October 2002, we adopted enlargement of the TCP window, multiple TCP connections, and shaping function to control the data transmission quantity. As a result, we succeeded in transmitting the SHD digital cinema content data at about 300 Mbps between Chicago and Los Angeles, a distance of more than 3000 km.

  16. The impact of capillary dilation on the distribution of red blood cells in artificial networks.

    PubMed

    Schmid, Franca; Reichold, Johannes; Weber, Bruno; Jenny, Patrick

    2015-04-01

    Recent studies suggest that pericytes around capillaries are contractile and able to alter the diameter of capillaries. To investigate the effects of capillary dilation on network dynamics, we performed simulations in artificial capillary networks of different sizes and complexities. The unequal partition of hematocrit at diverging bifurcations was modeled by assuming that each red blood cell (RBC) enters the branch with the faster instantaneous flow. Network simulations with and without RBCs were performed to investigate the effect of local dilations. The results showed that the increase in flow rate due to capillary dilation was less when the effects of RBCs are included. For bifurcations with sufficient RBCs in the parent vessel and nearly equal flows in the branches, the flow rate in the dilated branch did not increase. Instead, a self-regulation of flow was observed due to accumulation of RBCs in the dilated capillary. A parametric study was performed to examine the dependence on initial capillary diameter, dilation factor, and tube hematocrit. Furthermore, the conditions needed for an efficient self-regulation mechanism are discussed. The results support the hypothesis that RBCs play a significant role for the fluid dynamics in capillary networks and that it is crucial to consider the blood flow rate and the distribution of RBCs to understand the supply of oxygen in the vasculature. Furthermore, our results suggest that capillary dilation/constriction offers the potential of being an efficient mechanism to alter the distribution of RBCs locally and hence could be important for the local regulation of oxygen delivery.

  17. Sensor Location Problem Optimization for Traffic Network with Different Spatial Distributions of Traffic Information

    PubMed Central

    Bao, Xu; Li, Haijian; Qin, Lingqiao; Xu, Dongwei; Ran, Bin; Rong, Jian

    2016-01-01

    To obtain adequate traffic information, the density of traffic sensors should be sufficiently high to cover the entire transportation network. However, deploying sensors densely over the entire network may not be realistic for practical applications due to the budgetary constraints of traffic management agencies. This paper describes several possible spatial distributions of traffic information credibility and proposes corresponding different sensor information credibility functions to describe these spatial distribution properties. A maximum benefit model and its simplified model are proposed to solve the traffic sensor location problem. The relationships between the benefit and the number of sensors are formulated with different sensor information credibility functions. Next, expanding models and algorithms in analytic results are performed. For each case, the maximum benefit, the optimal number and spacing of sensors are obtained and the analytic formulations of the optimal sensor locations are derived as well. Finally, a numerical example is proposed to verify the validity and availability of the proposed models for solving a network sensor location problem. The results show that the optimal number of sensors of segments with different model parameters in an entire freeway network can be calculated. Besides, it can also be concluded that the optimal sensor spacing is independent of end restrictions but dependent on the values of model parameters that represent the physical conditions of sensors and roads. PMID:27801794

  18. Phylogenetic structure of European Salmonella Enteritidis outbreak correlates with national and international egg distribution network.

    PubMed

    Dallman, Tim; Inns, Thomas; Jombart, Thibaut; Ashton, Philip; Loman, Nicolas; Chatt, Carol; Messelhaeusser, Ute; Rabsch, Wolfgang; Simon, Sandra; Nikisins, Sergejs; Bernard, Helen; le Hello, Simon; Jourdan da-Silva, Nathalie; Kornschober, Christian; Mossong, Joel; Hawkey, Peter; de Pinna, Elizabeth; Grant, Kathie; Cleary, Paul

    2016-08-01

    Outbreaks of Salmonella Enteritidis have long been associated with contaminated poultry and eggs. In the summer of 2014 a large multi-national outbreak of Salmonella Enteritidis phage type 14b occurred with over 350 cases reported in the United Kingdom, Germany, Austria, France and Luxembourg. Egg supply network investigation and microbiological sampling identified the source to be a Bavarian egg producer. As part of the international investigation into the outbreak, over 400 isolates were sequenced including isolates from cases, implicated UK premises and eggs from the suspected source producer. We were able to show a clear statistical correlation between the topology of the UK egg distribution network and the phylogenetic network of outbreak isolates. This correlation can most plausibly be explained by different parts of the egg distribution network being supplied by eggs solely from independent premises of the Bavarian egg producer (Company X). Microbiological sampling from the source premises, traceback information and information on the interventions carried out at the egg production premises all supported this conclusion. The level of insight into the outbreak epidemiology provided by whole-genome sequencing (WGS) would not have been possible using traditional microbial typing methods.

  19. Joint accurate time and stable frequency distribution infrastructure sharing fiber footprint with research network

    NASA Astrophysics Data System (ADS)

    Vojtech, Josef; Slapak, Martin; Skoda, Pavel; Radil, Jan; Havlis, Ondrej; Altmann, Michal; Munster, Petr; Smotlacha, Vladimir; Kundrat, Jan; Velc, Radek; Altmannova, Lada; Hula, Miloslav

    2016-09-01

    In this paper, we present infrastructure for accurate time and stable frequency distribution. It is based on sharing of fibers of research and educational network carrying data traffic. Accurate time and stable frequency transmission uses mainly created dark channels amplified by special bidirectional amplifiers with the same propagation path for both directions. Paper also targets challenges joined with bidirectional transmission, which represents directional non-reciprocities and interaction with parallel data transmissions.

  20. A location-routing-inventory model for designing multisource distribution networks

    NASA Astrophysics Data System (ADS)

    Ahmadi-Javid, Amir; Seddighi, Amir Hossein

    2012-06-01

    This article studies a ternary-integration problem that incorporates location, inventory and routing decisions in designing a multisource distribution network. The objective of the problem is to minimize the total cost of location, routing and inventory. A mixed-integer programming formulation is first presented, and then a three-phase heuristic is developed to solve large-sized instances of the problem. The numerical study indicates that the proposed heuristic is both effective and efficient.

  1. A Computational Wireless Network Backplane: Performance in a Distributed Speaker Identification Application Postprint

    DTIC Science & Technology

    2008-12-01

    traffic patterns are intense but constrained to a local area. Examples include peer-to-peer applications or sensor data processing in the region. In such...vol. 30, no. 4, pp. 68–74, 1997. [7] J. Dean and S. Ghemawat, “ Mapreduce : simplified data processing on large clusters ,” Commun. ACM, vol. 51, no. 1...DWARF, a general distributed application execution framework for wireless ad-hoc networks which dynamically allocates computation resources and manages

  2. Comparison of Communication Architectures and Network Topologies for Distributed Propulsion Controls (Preprint)

    DTIC Science & Technology

    2013-05-01

    SPIDER [25], and TTCAN [26] [12]. In general, TTPs require a significant amount of initial design to create the message schedule model and do not allow...Gabriel Leen and Donald Heffernan. Ttcan : a new time-triggered controller area network. Microprocessors and Microsystems, 26(2):77–94, 2002. [27] Sinem...TTP, TTP/C • SPIDER • TTCAN • CANbus • Ethernet • AFDX • FlexRay 8 Event Triggered Time Triggered 28 Approved for public release; distribution

  3. Parallel multi-join query optimization algorithm for distributed sensor network in the internet of things

    NASA Astrophysics Data System (ADS)

    Zheng, Yan

    2015-03-01

    Internet of things (IoT), focusing on providing users with information exchange and intelligent control, attracts a lot of attention of researchers from all over the world since the beginning of this century. IoT is consisted of large scale of sensor nodes and data processing units, and the most important features of IoT can be illustrated as energy confinement, efficient communication and high redundancy. With the sensor nodes increment, the communication efficiency and the available communication band width become bottle necks. Many research work is based on the instance which the number of joins is less. However, it is not proper to the increasing multi-join query in whole internet of things. To improve the communication efficiency between parallel units in the distributed sensor network, this paper proposed parallel query optimization algorithm based on distribution attributes cost graph. The storage information relations and the network communication cost are considered in this algorithm, and an optimized information changing rule is established. The experimental result shows that the algorithm has good performance, and it would effectively use the resource of each node in the distributed sensor network. Therefore, executive efficiency of multi-join query between different nodes could be improved.

  4. Multi-View Human Activity Recognition in Distributed Camera Sensor Networks

    PubMed Central

    Mosabbeb, Ehsan Adeli; Raahemifar, Kaamran; Fathy, Mahmood

    2013-01-01

    With the increasing demand on the usage of smart and networked cameras in intelligent and ambient technology environments, development of algorithms for such resource-distributed networks are of great interest. Multi-view action recognition addresses many challenges dealing with view-invariance and occlusion, and due to the huge amount of processing and communicating data in real life applications, it is not easy to adapt these methods for use in smart camera networks. In this paper, we propose a distributed activity classification framework, in which we assume that several camera sensors are observing the scene. Each camera processes its own observations, and while communicating with other cameras, they come to an agreement about the activity class. Our method is based on recovering a low-rank matrix over consensus to perform a distributed matrix completion via convex optimization. Then, it is applied to the problem of human activity classification. We test our approach on IXMAS and MuHAVi datasets to show the performance and the feasibility of the method. PMID:23881136

  5. Neural networks for combined control of capacitor banks and voltage regulators in distribution systems

    SciTech Connect

    Gu, Z.; Rizy, D.T.

    1996-02-01

    A neural network for controlling shunt capacitor banks and feeder voltage regulators in electric distribution systems is presented. The objective of the neural controller is to minimize total I{sup 2}R losses and maintain all bus voltages within standard limits. The performance of the neural network for different input selections and training data is discussed and compared. Two different input selections are tried, one using the previous control states of the capacitors and regulator along with measured line flows and voltage which is equivalent to having feedback and the other with measured line flows and voltage without previous control settings. The results indicate that the neural net controller with feedback can outperform the one without. Also, proper selection of a training data set that adequately covers the operating space of the distribution system is important for achieving satisfactory performance with the neural controller. The neural controller is tested on a radially configured distribution system with 30 buses, 5 switchable capacitor banks an d one nine tap line regulator to demonstrate the performance characteristics associated with these principles. Monte Carlo simulations show that a carefully designed and relatively compact neural network with a small but carefully developed training set can perform quite well under slight and extreme variation of loading conditions.

  6. A Wireless Sensor Network approach for distributed in-line chemical analysis of water.

    PubMed

    Capella, J V; Bonastre, A; Ors, R; Peris, M

    2010-03-15

    In this work we propose the implementation of a distributed system based on a Wireless Sensor Network for the control of a chemical analysis system for fresh water. This implementation is presented by describing the nodes that form the distributed system, the communication system by wireless networks, control strategies, and so on. Nitrate, ammonium, and chloride are measured in-line using appropriate ion selective electrodes (ISEs), the results obtained being compared with those provided by the corresponding reference methods. Recovery analyses with ISEs and standard methods, study of interferences, and evaluation of major sensor features have also been carried out. The communication among the nodes that form the distributed system is implemented by means of the utilization of proprietary wireless networks, and secondary data transmission services (GSM or GPRS) provided by a mobile telephone operator. The information is processed, integrated and stored in a control center. These data can be retrieved--through the Internet--so as to know the real-time system status and its evolution.

  7. A Distributed Data-Gathering Protocol Using AUV in Underwater Sensor Networks

    PubMed Central

    Khan, Jawaad Ullah; Cho, Ho-Shin

    2015-01-01

    In this paper, we propose a distributed data-gathering scheme using an autonomous underwater vehicle (AUV) working as a mobile sink to gather data from a randomly distributed underwater sensor network where sensor nodes are clustered around several cluster headers. Unlike conventional data-gathering schemes where the AUV visits either every node or every cluster header, the proposed scheme allows the AUV to visit some selected nodes named path-nodes in a way that reduces the overall transmission power of the sensor nodes. Monte Carlo simulations are performed to investigate the performance of the proposed scheme compared with several preexisting techniques employing the AUV in terms of total amount of energy consumption, standard deviation of each node’s energy consumption, latency to gather data at a sink, and controlling overhead. Simulation results show that the proposed scheme not only reduces the total energy consumption but also distributes the energy consumption more uniformly over the network, thereby increasing the lifetime of the network. PMID:26287189

  8. Soft deposits, the key site for microbial growth in drinking water distribution networks.

    PubMed

    Zacheus, O M; Lehtola, M J; Korhonen, L K; Martikainen, P J

    2001-05-01

    In this project we studied the microbiological quality of soft pipeline deposits removed from drinking water distribution networks during mechanical cleaning. Drinking water and deposit samples were collected from 16 drinking water distribution networks located at eight towns in different parts of Finland. Soft pipeline deposits were found to be the key site for microbial growth in the distribution networks. The microbial numbers in the soft deposits were significantly higher than numbers in running water. The highest microbial numbers were detected in the main deposit pushed ahead by the first swab. The deposits contained high numbers of heterotrophic bacteria, actinomycetes and fungi. Also coliform bacteria were often isolated from deposit samples. Manganese and copper in the deposits correlated negatively with the numbers of heterotrophic bacteria. After a year, the viable microbial numbers in the new deposits were almost as high as in the old deposits before the first mechanical cleaning. The bacterial biomass production was higher in the new than in the old deposits.

  9. On the feasibility of measuring urban air pollution by wireless distributed sensor networks.

    PubMed

    Moltchanov, Sharon; Levy, Ilan; Etzion, Yael; Lerner, Uri; Broday, David M; Fishbain, Barak

    2015-01-01

    Accurate evaluation of air pollution on human-wellbeing requires high-resolution measurements. Standard air quality monitoring stations provide accurate pollution levels but due to their sparse distribution they cannot capture the highly resolved spatial variations within cities. Similarly, dedicated field campaigns can use tens of measurement devices and obtain highly dense spatial coverage but normally deployment has been limited to short periods of no more than few weeks. Nowadays, advances in communication and sensory technologies enable the deployment of dense grids of wireless distributed air monitoring nodes, yet their sensor ability to capture the spatiotemporal pollutant variability at the sub-neighborhood scale has never been thoroughly tested. This study reports ambient measurements of gaseous air pollutants by a network of six wireless multi-sensor miniature nodes that have been deployed in three urban sites, about 150 m apart. We demonstrate the network's capability to capture spatiotemporal concentration variations at an exceptional fine resolution but highlight the need for a frequent in-situ calibration to maintain the consistency of some sensors. Accordingly, a procedure for a field calibration is proposed and shown to improve the system's performance. Overall, our results support the compatibility of wireless distributed sensor networks for measuring urban air pollution at a sub-neighborhood spatial resolution, which suits the requirement for highly spatiotemporal resolved measurements at the breathing-height when assessing exposure to urban air pollution.

  10. Quantifying the Relationship Between Drainage Networks at Hillslope Scale and Particle Size Distribution at Pedon Scale

    NASA Astrophysics Data System (ADS)

    Cámara, Joaquín; Martín, Miguel Ángel; Gómez-Miguel, Vicente

    2015-02-01

    Nowadays, translating information about hydrologic and soil properties and processes across scales has emerged as a major theme in soil science and hydrology, and suitable theories for upscaling or downscaling hydrologic and soil information are being looked forward. The recognition of low-order catchments as self-organized systems suggests the existence of a great amount of links at different scales between their elements. The objective of this work was to research in areas of homogeneous bedrock material, the relationship between the hierarchical structure of the drainage networks at hillslope scale and the heterogeneity of the particle-size distribution at pedon scale. One of the most innovative elements in this work is the choice of the parameters to quantify the organization level of the studied features. The fractal dimension has been selected to measure the hierarchical structure of the drainage networks, while the Balanced Entropy Index (BEI) has been the chosen parameter to quantify the heterogeneity of the particle-size distribution from textural data. These parameters have made it possible to establish quantifiable relationships between two features attached to different steps in the scale range. Results suggest that the bedrock lithology of the landscape constrains the architecture of the drainage networks developed on it and the particle soil distribution resulting in the fragmentation processes.

  11. Networked buffering: a basic mechanism for distributed robustness in complex adaptive systems.

    PubMed

    Whitacre, James M; Bender, Axel

    2010-06-15

    A generic mechanism--networked buffering--is proposed for the generation of robust traits in complex systems. It requires two basic conditions to be satisfied: 1) agents are versatile enough to perform more than one single functional role within a system and 2) agents are degenerate, i.e. there exists partial overlap in the functional capabilities of agents. Given these prerequisites, degenerate systems can readily produce a distributed systemic response to local perturbations. Reciprocally, excess resources related to a single function can indirectly support multiple unrelated functions within a degenerate system. In models of genome:proteome mappings for which localized decision-making and modularity of genetic functions are assumed, we verify that such distributed compensatory effects cause enhanced robustness of system traits. The conditions needed for networked buffering to occur are neither demanding nor rare, supporting the conjecture that degeneracy may fundamentally underpin distributed robustness within several biotic and abiotic systems. For instance, networked buffering offers new insights into systems engineering and planning activities that occur under high uncertainty. It may also help explain recent developments in understanding the origins of resilience within complex ecosystems.

  12. Calibration of an outdoor distributed camera network with a 3D point cloud.

    PubMed

    Ortega, Agustín; Silva, Manuel; Teniente, Ernesto H; Ferreira, Ricardo; Bernardino, Alexandre; Gaspar, José; Andrade-Cetto, Juan

    2014-07-29

    Outdoor camera networks are becoming ubiquitous in critical urban areas of the largest cities around the world. Although current applications of camera networks are mostly tailored to video surveillance, recent research projects are exploiting their use to aid robotic systems in people-assisting tasks. Such systems require precise calibration of the internal and external parameters of the distributed camera network. Despite the fact that camera calibration has been an extensively studied topic, the development of practical methods for user-assisted calibration that minimize user intervention time and maximize precision still pose significant challenges. These camera systems have non-overlapping fields of view, are subject to environmental stress, and are likely to suffer frequent recalibration. In this paper, we propose the use of a 3D map covering the area to support the calibration process and develop an automated method that allows quick and precise calibration of a large camera network. We present two cases of study of the proposed calibration method: one is the calibration of the Barcelona Robot Lab camera network, which also includes direct mappings (homographies) between image coordinates and world points in the ground plane (walking areas) to support person and robot detection and localization algorithms. The second case consist of improving the GPS positioning of geo-tagged images taken with a mobile device in the Facultat de Matemàtiques i Estadística (FME) patio at the Universitat Politècnica de Catalunya (UPC).

  13. Two-layer wireless distributed sensor/control network based on RF

    NASA Astrophysics Data System (ADS)

    Feng, Li; Lin, Yuchi; Zhou, Jingjing; Dong, Guimei; Xia, Guisuo

    2006-11-01

    A project of embedded Wireless Distributed Sensor/Control Network (WDSCN) based on RF is presented after analyzing the disadvantages of traditional measure and control system. Because of high-cost and complexity, such wireless techniques as Bluetooth and WiFi can't meet the needs of WDSCN. The two-layer WDSCN is designed based on RF technique, which operates in the ISM free frequency channel with low power and high transmission speed. Also the network is low cost, portable and moveable, integrated with the technologies of computer network, sensor, microprocessor and wireless communications. The two-layer network topology is selected in the system; a simple but efficient self-organization net protocol is designed to fit the periodic data collection, event-driven and store-and-forward. Furthermore, adaptive frequency hopping technique is adopted for anti-jamming apparently. The problems about power reduction and synchronization of data in wireless system are solved efficiently. Based on the discussion above, a measure and control network is set up to control such typical instruments and sensors as temperature sensor and signal converter, collect data, and monitor environmental parameters around. This system works well in different rooms. Experiment results show that the system provides an efficient solution to WDSCN through wireless links, with high efficiency, low power, high stability, flexibility and wide working range.

  14. Calibration of an Outdoor Distributed Camera Network with a 3D Point Cloud

    PubMed Central

    Ortega, Agustín; Silva, Manuel; Teniente, Ernesto H.; Ferreira, Ricardo; Bernardino, Alexandre; Gaspar, José; Andrade-Cetto, Juan

    2014-01-01

    Outdoor camera networks are becoming ubiquitous in critical urban areas of the largest cities around the world. Although current applications of camera networks are mostly tailored to video surveillance, recent research projects are exploiting their use to aid robotic systems in people-assisting tasks. Such systems require precise calibration of the internal and external parameters of the distributed camera network. Despite the fact that camera calibration has been an extensively studied topic, the development of practical methods for user-assisted calibration that minimize user intervention time and maximize precision still pose significant challenges. These camera systems have non-overlapping fields of view, are subject to environmental stress, and are likely to suffer frequent recalibration. In this paper, we propose the use of a 3D map covering the area to support the calibration process and develop an automated method that allows quick and precise calibration of a large camera network. We present two cases of study of the proposed calibration method: one is the calibration of the Barcelona Robot Lab camera network, which also includes direct mappings (homographies) between image coordinates and world points in the ground plane (walking areas) to support person and robot detection and localization algorithms. The second case consist of improving the GPS positioning of geo-tagged images taken with a mobile device in the Facultat de Matemàtiques i Estadística (FME) patio at the Universitat Politècnica de Catalunya (UPC). PMID:25076221

  15. Using Hybrid Angle/Distance Information for Distributed Topology Control in Vehicular Sensor Networks

    PubMed Central

    Huang, Chao-Chi; Chiu, Yang-Hung; Wen, Chih-Yu

    2014-01-01

    In a vehicular sensor network (VSN), the key design issue is how to organize vehicles effectively, such that the local network topology can be stabilized quickly. In this work, each vehicle with on-board sensors can be considered as a local controller associated with a group of communication members. In order to balance the load among the nodes and govern the local topology change, a group formation scheme using localized criteria is implemented. The proposed distributed topology control method focuses on reducing the rate of group member change and avoiding the unnecessary information exchange. Two major phases are sequentially applied to choose the group members of each vehicle using hybrid angle/distance information. The operation of Phase I is based on the concept of the cone-based method, which can select the desired vehicles quickly. Afterwards, the proposed time-slot method is further applied to stabilize the network topology. Given the network structure in Phase I, a routing scheme is presented in Phase II. The network behaviors are explored through simulation and analysis in a variety of scenarios. The results show that the proposed mechanism is a scalable and effective control framework for VSNs. PMID:25350506

  16. Advancing the boundaries of high-connectivity network simulation with distributed computing.

    PubMed

    Morrison, Abigail; Mehring, Carsten; Geisel, Theo; Aertsen, A D; Diesmann, Markus

    2005-08-01

    The availability of efficient and reliable simulation tools is one of the mission-critical technologies in the fast-moving field of computational neuroscience. Research indicates that higher brain functions emerge from large and complex cortical networks and their interactions. The large number of elements (neurons) combined with the high connectivity (synapses) of the biological network and the specific type of interactions impose severe constraints on the explorable system size that previously have been hard to overcome. Here we present a collection of new techniques combined to a coherent simulation tool removing the fundamental obstacle in the computational study of biological neural networks: the enormous number of synaptic contacts per neuron. Distributing an individual simulation over multiple computers enables the investigation of networks orders of magnitude larger than previously possible. The software scales excellently on a wide range of tested hardware, so it can be used in an interactive and iterative fashion for the development of ideas, and results can be produced quickly even for very large networks. In contrast to earlier approaches, a wide class of neuron models and synaptic dynamics can be represented.

  17. Reliability analysis of water distribution networks in consideration of equity, redistribution, and pressure-dependent demand

    NASA Astrophysics Data System (ADS)

    Fujiwara, Okitsugu; Li, Jun

    A goal programming model has been developed to analyze the system behavior for the water distribution networks under contingency situations due to failures of pipes and pumps, taking into account three aspects: (1) equity, or sharing inconvenience equally among consumers; (2) redistribution of the network flows to reduce the negative consequences of a failure of one portion on other portions of the network; and (3) consideration of pressure-dependent demand delivery due to insufficient head, namely, if a nodal head falls below a desired level, the flow delivered to that node is reduced. The first priority of the goal program is to maximize the lowest nodal demand supply ratio (or the ratio of actually delivered demand to the required demand at a node). The second priority is to maximize the system demand supply ratio (or the ratio of actually delivered water to the required total system demand). Link flow directions in the model are not fixed but are determined by a set of criteria. The system behaviors with respect to the three aspects of reliability factors are examined through extensive numerical experiments. The impact of equity requirements on redistribution of network flows, link flow directions, nodal demand supply ratio, and system demand supply ratio when failure events become serious is examined in particular detail. It is found that equity requirements can satisfactorily bring about fair sharing of inconvenience among consumers. The model proposed also suggests that network operations should reverse some link flow directions in order to meet equity requirements under severe contingencies.

  18. A hybrid deep neural network and physically based distributed model for river stage prediction

    NASA Astrophysics Data System (ADS)

    hitokoto, Masayuki; sakuraba, Masaaki

    2016-04-01

    We developed the real-time river stage prediction model, using the hybrid deep neural network and physically based distributed model. As the basic model, 4 layer feed-forward artificial neural network (ANN) was used. As a network training method, the deep learning technique was applied. To optimize the network weight, the stochastic gradient descent method based on the back propagation method was used. As a pre-training method, the denoising autoencoder was used. Input of the ANN model is hourly change of water level and hourly rainfall, output data is water level of downstream station. In general, the desirable input of the ANN has strong correlation with the output. In conceptual hydrological model such as tank model and storage-function model, river discharge is governed by the catchment storage. Therefore, the change of the catchment storage, downstream discharge subtracted from rainfall, can be the potent input candidate of the ANN model instead of rainfall. From this point of view, the hybrid deep neural network and physically based distributed model was developed. The prediction procedure of the hybrid model is as follows; first, downstream discharge was calculated by the distributed model, and then estimates the hourly change of catchment storage form rainfall and calculated discharge as the input of the ANN model, and finally the ANN model was calculated. In the training phase, hourly change of catchment storage can be calculated by the observed rainfall and discharge data. The developed model was applied to the one catchment of the OOYODO River, one of the first-grade river in Japan. The modeled catchment is 695 square km. For the training data, 5 water level gauging station and 14 rain-gauge station in the catchment was used. The training floods, superior 24 events, were selected during the period of 2005-2014. Prediction was made up to 6 hours, and 6 models were developed for each prediction time. To set the proper learning parameters and network

  19. Use of spatially distributed time-integrated sediment sampling networks and distributed fine sediment modelling to inform catchment management.

    PubMed

    Perks, M T; Warburton, J; Bracken, L J; Reaney, S M; Emery, S B; Hirst, S

    2017-02-06

    Under the EU Water Framework Directive, suspended sediment is omitted from environmental quality standards and compliance targets. This omission is partly explained by difficulties in assessing the complex dose-response of ecological communities. But equally, it is hindered by a lack of spatially distributed estimates of suspended sediment variability across catchments. In this paper, we demonstrate the inability of traditional, discrete sampling campaigns for assessing exposure to fine sediment. Sampling frequencies based on Environmental Quality Standard protocols, whilst reflecting typical manual sampling constraints, are unable to determine the magnitude of sediment exposure with an acceptable level of precision. Deviations from actual concentrations range between -35 and +20% based on the interquartile range of simulations. As an alternative, we assess the value of low-cost, suspended sediment sampling networks for quantifying suspended sediment transfer (SST). In this study of the 362 km(2) upland Esk catchment we observe that spatial patterns of sediment flux are consistent over the two year monitoring period across a network of 17 monitoring sites. This enables the key contributing sub-catchments of Butter Beck (SST: 1141 t km(2) yr(-1)) and Glaisdale Beck (SST: 841 t km(2) yr(-1)) to be identified. The time-integrated samplers offer a feasible alternative to traditional infrequent and discrete sampling approaches for assessing spatio-temporal changes in contamination. In conjunction with a spatially distributed diffuse pollution model (SCIMAP), time-integrated sediment sampling is an effective means of identifying critical sediment source areas in the catchment, which can better inform sediment management strategies for pollution prevention and control.

  20. Dynamics of bacterial communities before and after distribution in a full-scale drinking water network.

    PubMed

    El-Chakhtoura, Joline; Prest, Emmanuelle; Saikaly, Pascal; van Loosdrecht, Mark; Hammes, Frederik; Vrouwenvelder, Hans

    2015-05-01

    Understanding the biological stability of drinking water distribution systems is imperative in the framework of process control and risk management. The objective of this research was to examine the dynamics of the bacterial community during drinking water distribution at high temporal resolution. Water samples (156 in total) were collected over short time-scales (minutes/hours/days) from the outlet of a treatment plant and a location in its corresponding distribution network. The drinking water is treated by biofiltration and disinfectant residuals are absent during distribution. The community was analyzed by 16S rRNA gene pyrosequencing and flow cytometry as well as conventional, culture-based methods. Despite a random dramatic event (detected with pyrosequencing and flow cytometry but not with plate counts), the bacterial community profile at the two locations did not vary significantly over time. A diverse core microbiome was shared between the two locations (58-65% of the taxa and 86-91% of the sequences) and found to be dependent on the treatment strategy. The bacterial community structure changed during distribution, with greater richness detected in the network and phyla such as Acidobacteria and Gemmatimonadetes becoming abundant. The rare taxa displayed the highest dynamicity, causing the major change during water distribution. This change did not have hygienic implications and is contingent on the sensitivity of the applied methods. The concept of biological stability therefore needs to be revised. Biostability is generally desired in drinking water guidelines but may be difficult to achieve in large-scale complex distribution systems that are inherently dynamic.