WorldWideScience

Sample records for network anchor nodes

  1. International Lunar Network (ILN) Anchor Nodes

    Science.gov (United States)

    Cohen, Barbara A.

    2009-01-01

    This slide presentation reviews the United States' contribution to the International Lunar Network (ILN) project, the Anchor Nodes project. The ILN is an initiative of 9 national space agencies to establish a set of robotic geophysical monitoring stations on the surface of the Moon. The project is aimed at furthering the understanding of the lunar composition, and interior structure.

  2. The International Lunar Network (ILN) Anchor Nodes Mission Update

    Science.gov (United States)

    Cohen, B. A.; Bassler, J. A.; McDougal, J. M.; Harris, D. W.; Hill, L.; Hammond, M. S.; Morse, B. J.; Reed, C. L. B.; Kirby, K. W.; Morgan, T. H.

    2009-01-01

    NASA s Science Mission Directorate (SMD) established the Lunar Quest Program (LQP) to accomplish lunar science objectives embodied in the National Academies report The Scientific Context for Exploration of the Moon (2007) and the NASA Advisory Council-sponsored Workshop on Science Associated with the Lunar Exploration Architecture (2007). A major element of LQP's lunar flight projects is the International Lunar Network (ILN), a network of small geophysical nodes on the lunar surface. NASA plans to provide the first two stations around 2014 and a second pair in the 2016-2017 timeframe. International involvement to provide additional stations will build up the network so that 8-10 nodes could be simultaneously operating. This flight project complements SMD's initiatives to build a robust lunar science community through R&A lines and increases international participation in NASA's robotic exploration of the moon.

  3. Current Status of the International Lunar Network (ILN) Anchor Nodes Mission

    Science.gov (United States)

    Cohen, Barbara A.; Bassler, Julie A.; Harris, Danny W.; Morse, Brian J.; Reed, Cheryl L.; Eng, Doug A.; Kirby, Karen W.

    2009-01-01

    NASA's Science Mission Directorate s (SMD) International Lunar Network Anchor Nodes Mission continues its concept development and is scheduled to complete the first formal milestone gate of a Mission Concept Review (MCR) in Autumn 2009. The mission will establish two-four nodes of the International Lunar Network (ILN), a network of lunar geophysical stations envisioned to be emplaced by the many nations collaborating on this joint endeavor. This mission will operate over six years or more and make significant progress in satisfying many of the National Research Council s lunar science objectives, while strategically contributing to the U.S. Vision for Space Exploration Policy's objective for a robust robotic lunar program. This paper will provide a status report on the ILN Anchor Nodes mission and overview of the concept to date, which is being implemented jointly by NASA's Marshall Space Flight Center and The Johns Hopkins University Applied Physics Laboratory.

  4. MSFC Robotic Lunar Lander Testbed and Current Status of the International Lunar Network (ILN) Anchor Nodes Mission

    Science.gov (United States)

    Cohen, Barbara; Bassler, Julie; Harris, Danny; Morse, Brian; Reed, Cheryl; Kirby, Karen; Eng, Douglas

    2009-01-01

    The lunar lander robotic exploration testbed at Marshall Spaceflight Center provides a test environment for robotic lander test articles, components and algorithms to reduce the risk on the airless body designs during lunar landing. Also included is a chart comparing the two different types of Anchor nodes for the International Lunar Network (ILN): Solar/Battery and the Advanced Stirling Radioisotope generator (ARSG.)

  5. The International Lunar Network (ILN) and the US Anchor Nodes Mission

    Science.gov (United States)

    Cohen, Barbara A.; Bessler, J. A.; Harris, D. W.; Hill, L.; Hammond, M. S.; McDougal, J. M.; Morse, B. J.; Red, C. L. B.; Kirby, K. W.

    2009-01-01

    This presentation reviews the International Lunar Network (ILN) mission, a cooperative effort designed to coordinate individual lunar landers in a geophysical network on the lunar surface. The presentation also includes information on the geophysical network, mission operations, and recent accomplishments.

  6. Reconfigureable network node

    Science.gov (United States)

    Vanderveen, Keith B [Tracy, CA; Talbot, Edward B [Livermore, CA; Mayer, Laurence E [Davis, CA

    2008-04-08

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

  7. Modular sensor network node

    Science.gov (United States)

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

    2008-06-10

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

  8. Distributed Recognition of Reference Nodes for Wireless Sensor Network Localization

    Directory of Open Access Journals (Sweden)

    M. Simek

    2012-04-01

    Full Text Available All known localization techniques for wireless sensor and ad-hoc networks require certain set of reference nodes being used for position estimation. The anchor-free techniques in contrast to anchor-based do not require reference nodes called anchors to be placed in the network area before localization operation itself, but they can establish own reference coordinate system to be used for the relative position estimation. We observed that contemporary anchor-free localization algorithms achieve a low localization error, but dissipate significant energy reserves during the recognition of reference nodes used for the position estimation. Therefore, we have proposed the optimized anchor-free localization algorithm referred to as BRL (Boundary Recognition aided Localization, which achieves a low localization error and mainly reduces the communication cost of the reference nodes recognition phase. The proposed BRL algorithm was investigated throughout the extensive simulations on the database of networks with the different number of nodes and densities and was compared in terms of communication cost and localization error with the known related algorithms such as AFL and CRP. Through the extensive simulations we have observed network conditions where novel BRL algorithm excels in comparison with the state of art.

  9. Localizing and placement of network node functions in a network

    NARCIS (Netherlands)

    Strijkers, R.J.; Meulenhoff, P.J.

    2014-01-01

    The invention enables placement and use of a network node function in a second network node instead of using the network node function in a first network node. The network node function is e.g. a server function or a router function. The second network node is typically located in or close to the

  10. Allocating resources between network nodes for providing a network node function

    NARCIS (Netherlands)

    Strijkers, R.J.; Meulenhoff, P.J.

    2014-01-01

    The invention provides a method wherein a first network node advertises available resources that a second network node may use to offload network node functions transparently to the first network node. Examples of the first network node are a client device (e.g. PC, notebook, tablet, smart phone), a

  11. Underwater Sensor Nodes and Networks

    Directory of Open Access Journals (Sweden)

    Jaime Lloret

    2013-09-01

    Full Text Available Sensor technology has matured enough to be used in any type of environment. The appearance of new physical sensors has increased the range of environmental parameters for gathering data. Because of the huge amount of unexploited resources in the ocean environment, there is a need of new research in the field of sensors and sensor networks. This special issue is focused on collecting recent advances on underwater sensors and underwater sensor networks in order to measure, monitor, surveillance of and control of underwater environments. On the one hand, from the sensor node perspective, we will see works related with the deployment of physical sensors, development of sensor nodes and transceivers for sensor nodes, sensor measurement analysis and several issues such as layer 1 and 2 protocols for underwater communication and sensor localization and positioning systems. On the other hand, from the sensor network perspective, we will see several architectures and protocols for underwater environments and analysis concerning sensor network measurements. Both sides will provide us a complete view of last scientific advances in this research field.

  12. Underwater sensor nodes and networks.

    Science.gov (United States)

    Lloret, Jaime

    2013-09-05

    Sensor technology has matured enough to be used in any type of environment. The appearance of new physical sensors has increased the range of environmental parameters for gathering data. Because of the huge amount of unexploited resources in the ocean environment, there is a need of new research in the field of sensors and sensor networks. This special issue is focused on collecting recent advances on underwater sensors and underwater sensor networks in order to measure, monitor, surveillance of and control of underwater environments. On the one hand, from the sensor node perspective, we will see works related with the deployment of physical sensors, development of sensor nodes and transceivers for sensor nodes, sensor measurement analysis and several issues such as layer 1 and 2 protocols for underwater communication and sensor localization and positioning systems. On the other hand, from the sensor network perspective, we will see several architectures and protocols for underwater environments and analysis concerning sensor network measurements. Both sides will provide us a complete view of last scientific advances in this research field.

  13. Maximizing Lifetime of Wireless Sensor Networks with Mobile Sink Nodes

    Directory of Open Access Journals (Sweden)

    Yourong Chen

    2014-01-01

    Full Text Available In order to maximize network lifetime and balance energy consumption when sink nodes can move, maximizing lifetime of wireless sensor networks with mobile sink nodes (MLMS is researched. The movement path selection method of sink nodes is proposed. Modified subtractive clustering method, k-means method, and nearest neighbor interpolation method are used to obtain the movement paths. The lifetime optimization model is established under flow constraint, energy consumption constraint, link transmission constraint, and other constraints. The model is solved from the perspective of static and mobile data gathering of sink nodes. Subgradient method is used to solve the lifetime optimization model when one sink node stays at one anchor location. Geometric method is used to evaluate the amount of gathering data when sink nodes are moving. Finally, all sensor nodes transmit data according to the optimal data transmission scheme. Sink nodes gather the data along the shortest movement paths. Simulation results show that MLMS can prolong network lifetime, balance node energy consumption, and reduce data gathering latency under appropriate parameters. Under certain conditions, it outperforms Ratio_w, TPGF, RCC, and GRND.

  14. The complex network reliability and influential nodes

    Science.gov (United States)

    Li, Kai; He, Yongfeng

    2017-08-01

    In order to study the complex network node important degree and reliability, considering semi-local centrality, betweenness centrality and PageRank algorithm, through the simulation method to gradually remove nodes and recalculate the importance in the random network, small world network and scale-free network. Study the relationship between the largest connected component and node removed proportion, the research results show that betweenness centrality and PageRank algorithm based on the global information network are more effective for evaluating the importance of nodes, and the reliability of the network is related to the network topology.

  15. OFFLOADING OF A WIRELESS NODE AUTHENTICATION WITH CORE NETWORK

    DEFF Research Database (Denmark)

    2017-01-01

    An example technique may include controlling receiving, by a second node from a first node in a wireless network, a request to offload authentication of the first node with the core network to the second node, controlling receiving, by the second node from the first node, data to be forwarded...... to the core network, performing, by the second node based on the request, an authentication with the core network on behalf of the first node while the first node is not connected with the second node, and controlling forwarding the received data from the second node to the core network while the first node...

  16. A node architecture for disaster relief networking

    NARCIS (Netherlands)

    Hoeksema, F.W.; Heskamp, M.; Schiphorst, Roelof; Slump, Cornelis H.

    2005-01-01

    In this paper we present node architecture for a personal node in a cognitive ad-hoc disaster relief network. This architecture is motivated from the network system requirements, especially single-hop distance and jamming-resilience requirements. It is shown that the power consumption of current-day

  17. Locating influential nodes in complex networks

    Science.gov (United States)

    Malliaros, Fragkiskos D.; Rossi, Maria-Evgenia G.; Vazirgiannis, Michalis

    2016-01-01

    Understanding and controlling spreading processes in networks is an important topic with many diverse applications, including information dissemination, disease propagation and viral marketing. It is of crucial importance to identify which entities act as influential spreaders that can propagate information to a large portion of the network, in order to ensure efficient information diffusion, optimize available resources or even control the spreading. In this work, we capitalize on the properties of the K-truss decomposition, a triangle-based extension of the core decomposition of graphs, to locate individual influential nodes. Our analysis on real networks indicates that the nodes belonging to the maximal K-truss subgraph show better spreading behavior compared to previously used importance criteria, including node degree and k-core index, leading to faster and wider epidemic spreading. We further show that nodes belonging to such dense subgraphs, dominate the small set of nodes that achieve the optimal spreading in the network.

  18. Node localization algorithm of wireless sensor network for large electrical equipment monitoring application

    DEFF Research Database (Denmark)

    Chen, Qinyin; Hu, Y.; Chen, Zhe

    2016-01-01

    Node localization technology is an important technology for the Wireless Sensor Networks (WSNs) applications. An improved 3D node localization algorithm is proposed in this paper, which is based on a Multi-dimensional Scaling (MDS) node localization algorithm for large electrical equipment...... monitoring applications. The proposed algorithm utilizes the relative information of anchor nodes to calculate the distance of two nodes with two hops in a non-line of sight (NLOS) condition. This proposed algorithm improves the positioning accuracy and reduces the effect of the measurement error, which...

  19. Detecting controlling nodes of boolean regulatory networks.

    Science.gov (United States)

    Schober, Steffen; Kracht, David; Heckel, Reinhard; Bossert, Martin

    2011-10-11

    Boolean models of regulatory networks are assumed to be tolerant to perturbations. That qualitatively implies that each function can only depend on a few nodes. Biologically motivated constraints further show that functions found in Boolean regulatory networks belong to certain classes of functions, for example, the unate functions. It turns out that these classes have specific properties in the Fourier domain. That motivates us to study the problem of detecting controlling nodes in classes of Boolean networks using spectral techniques. We consider networks with unbalanced functions and functions of an average sensitivity less than 23k, where k is the number of controlling variables for a function. Further, we consider the class of 1-low networks which include unate networks, linear threshold networks, and networks with nested canalyzing functions. We show that the application of spectral learning algorithms leads to both better time and sample complexity for the detection of controlling nodes compared with algorithms based on exhaustive search. For a particular algorithm, we state analytical upper bounds on the number of samples needed to find the controlling nodes of the Boolean functions. Further, improved algorithms for detecting controlling nodes in large-scale unate networks are given and numerically studied.

  20. Navigable Waterway Network Node Locations

    Data.gov (United States)

    Department of Homeland Security — The National Waterway Network is a comprehensive network database of the nation's navigable waterways. The data set covers the 48 contiguous states plus the District...

  1. A mobile anchor assisted localization algorithm based on regular hexagon in wireless sensor networks.

    Science.gov (United States)

    Han, Guangjie; Zhang, Chenyu; Lloret, Jaime; Shu, Lei; Rodrigues, Joel J P C

    2014-01-01

    Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution.

  2. A Mobile Anchor Assisted Localization Algorithm Based on Regular Hexagon in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Guangjie Han

    2014-01-01

    Full Text Available Localization is one of the key technologies in wireless sensor networks (WSNs, since it provides fundamental support for many location-aware protocols and applications. Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution.

  3. A Mobile Anchor Assisted Localization Algorithm Based on Regular Hexagon in Wireless Sensor Networks

    Science.gov (United States)

    Rodrigues, Joel J. P. C.

    2014-01-01

    Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints of cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution. PMID:25133212

  4. Underwater sensor nodes and networks

    National Research Council Canada - National Science Library

    Lloret, Jaime

    2013-01-01

    .... This special issue is focused on collecting recent advances on underwater sensors and underwater sensor networks in order to measure, monitor, surveillance of and control of underwater environments...

  5. Secure message authentication system for node to node network

    Science.gov (United States)

    Sindhu, R.; Vanitha, M. M.; Norman, J.

    2017-10-01

    The Message verification remains some of the best actual methods for prevent the illegal and dis honored communication after presence progressed to WSNs (Wireless Sensor Networks). Intend for this purpose, several message verification systems must stand established, created on both symmetric key cryptography otherwise public key cryptosystems. Best of them will have some limits for great computational then statement above in count of deficiency of climb ability then flexibility in node settlement occurrence. In a polynomial based system was newly presented for these problems. Though, this system then situations delay will must the dimness of integral limitation firm in the point of polynomial: once the amount of message transferred remains the greater than the limitation then the opponent will completely improve the polynomial approaches. This paper suggests using ECC (Elliptic Curve Cryptography). Though using the node verification the technique in this paper permits some nodes to transfer a limitless amount of messages lacking misery in the limit problem. This system will have the message cause secrecy. Equally theoretic study then model effects show our planned system will be effective than the polynomial based method in positions of calculation then statement above in privacy points though message basis privacy.

  6. Measure of Node Similarity in Multilayer Networks

    DEFF Research Database (Denmark)

    Møllgaard, Anders; Zettler, Ingo; Dammeyer, Jesper

    2016-01-01

    university.Our analysis is based on data obtained using smartphones equipped with customdata collection software, complemented by questionnaire-based data. The networkof social contacts is represented as a weighted multilayer network constructedfrom different channels of telecommunication as well as data......The weight of links in a network is often related to the similarity of thenodes. Here, we introduce a simple tunable measure for analysing the similarityof nodes across different link weights. In particular, we use the measure toanalyze homophily in a group of 659 freshman students at a large...... might bepresent in one layer of the multilayer network and simultaneously be absent inthe other layers. For a variable such as gender, our measure reveals atransition from similarity between nodes connected with links of relatively lowweight to dis-similarity for the nodes connected by the strongest...

  7. A Double Rate Localization Algorithm with One Anchor for Multi-Hop Underwater Acoustic Networks.

    Science.gov (United States)

    Gao, Jingjie; Shen, Xiaohong; Zhao, Ruiqin; Mei, Haodi; Wang, Haiyan

    2017-04-28

    Localization is a basic issue for underwater acoustic networks (UANs). Currently, most localization algorithms only perform well in one-hop networks or need more anchors which are not suitable for the underwater environment. In this paper, we proposed a double rate localization algorithm with one anchor for multi-hop underwater acoustic networks (DRL). The algorithm firstly presents a double rate scheme which separates the localization procedure into two modes to increase the ranging accuracy in multi-hop UANs while maintaining the transmission rate. Then an optimal selection scheme of reference nodes was proposed to reduce the influence of references' topology on localization performance. The proposed DRL algorithm can be used in the multi-hop UANs to increase the localization accuracy and reduce the usage of anchor nodes. The simulation and experimental results demonstrated that the proposed DRL algorithm has a better localization performance than the previous algorithms in many aspects such as accuracy and communication cost, and is more suitable to the underwater environment.

  8. Measure of Node Similarity in Multilayer Networks.

    Directory of Open Access Journals (Sweden)

    Anders Mollgaard

    Full Text Available The weight of links in a network is often related to the similarity of the nodes. Here, we introduce a simple tunable measure for analysing the similarity of nodes across different link weights. In particular, we use the measure to analyze homophily in a group of 659 freshman students at a large university. Our analysis is based on data obtained using smartphones equipped with custom data collection software, complemented by questionnaire-based data. The network of social contacts is represented as a weighted multilayer network constructed from different channels of telecommunication as well as data on face-to-face contacts. We find that even strongly connected individuals are not more similar with respect to basic personality traits than randomly chosen pairs of individuals. In contrast, several socio-demographics variables have a significant degree of similarity. We further observe that similarity might be present in one layer of the multilayer network and simultaneously be absent in the other layers. For a variable such as gender, our measure reveals a transition from similarity between nodes connected with links of relatively low weight to dis-similarity for the nodes connected by the strongest links. We finally analyze the overlap between layers in the network for different levels of acquaintanceships.

  9. Eigenvector centrality of nodes in multiplex networks

    OpenAIRE

    Solá Conde, Luis; Romance del Río, Miguel; Criado, R.; Flores Álvarez, Julio; García del Amo, Alejandro; Boccaletti, Stefano

    2013-01-01

    We extend the concept of eigenvector centrality to multiplex networks, and introduce several alternative parameters that quantify the importance of nodes in a multi-layered networked system, including the definition of vectorial-type centralities. In addition, we rigorously show that, under reasonable conditions, such centrality measures exist and are unique. Computer experiments and simulations demonstrate that the proposed measures provide substantially different results when applied to the...

  10. Network Design with Node Degree Balance Constraints

    DEFF Research Database (Denmark)

    Pedersen, Michael Berliner; Crainic, Teodor Gabriel

    This presentation discusses an extension to the network design model where there in addition to the flow conservation constraints also are constraints that require design conservation. This means that the number of arcs entering and leaving a node must be the same. As will be shown the model has...

  11. Artificial neural networks with an infinite number of nodes

    Science.gov (United States)

    Blekas, K.; Lagaris, I. E.

    2017-10-01

    A new class of Artificial Neural Networks is described incorporating a node density function and functional weights. This network containing an infinite number of nodes, excels in generalizing and possesses a superior extrapolation capability.

  12. Analysis of complex network performance and heuristic node removal strategies

    Science.gov (United States)

    Jahanpour, Ehsan; Chen, Xin

    2013-12-01

    Removing important nodes from complex networks is a great challenge in fighting against criminal organizations and preventing disease outbreaks. Six network performance metrics, including four new metrics, are applied to quantify networks' diffusion speed, diffusion scale, homogeneity, and diameter. In order to efficiently identify nodes whose removal maximally destroys a network, i.e., minimizes network performance, ten structured heuristic node removal strategies are designed using different node centrality metrics including degree, betweenness, reciprocal closeness, complement-derived closeness, and eigenvector centrality. These strategies are applied to remove nodes from the September 11, 2001 hijackers' network, and their performance are compared to that of a random strategy, which removes randomly selected nodes, and the locally optimal solution (LOS), which removes nodes to minimize network performance at each step. The computational complexity of the 11 strategies and LOS is also analyzed. Results show that the node removal strategies using degree and betweenness centralities are more efficient than other strategies.

  13. The value of peripheral nodes in controlling multilayer networks

    CERN Document Server

    Zhang, Yan; Schweitzer, Frank

    2015-01-01

    We analyze the controllability of a two-layer network, where driver nodes can be chosen only from one layer. Each layer contains a scale-free network with directed links. The dynamics of nodes depends on the incoming links from other nodes (reputation dynamics). We find that the controllable part of the network is larger when choosing peripherial nodes to connect the two layers. The control is as efficient for peripherial nodes as driver nodes as it is for more central nodes. If we assume a cost to utilize nodes which is proportional to their degree, utilizing peripherial nodes to connect the two layers or to act as driver nodes is not only the most cost-efficient solution, it is also the one that gives us the best performance in controlling the two-layer network.

  14. Eigenvector centrality of nodes in multiplex networks

    Science.gov (United States)

    Solá, Luis; Romance, Miguel; Criado, Regino; Flores, Julio; García del Amo, Alejandro; Boccaletti, Stefano

    2013-09-01

    We extend the concept of eigenvector centrality to multiplex networks, and introduce several alternative parameters that quantify the importance of nodes in a multi-layered networked system, including the definition of vectorial-type centralities. In addition, we rigorously show that, under reasonable conditions, such centrality measures exist and are unique. Computer experiments and simulations demonstrate that the proposed measures provide substantially different results when applied to the same multiplex structure, and highlight the non-trivial relationships between the different measures of centrality introduced.

  15. Measure of Node Similarity in Multilayer Networks

    DEFF Research Database (Denmark)

    Møllgaard, Anders; Zettler, Ingo; Dammeyer, Jesper

    2016-01-01

    The weight of links in a network is often related to the similarity of thenodes. Here, we introduce a simple tunable measure for analysing the similarityof nodes across different link weights. In particular, we use the measure toanalyze homophily in a group of 659 freshman students at a large...... university.Our analysis is based on data obtained using smartphones equipped with customdata collection software, complemented by questionnaire-based data. The networkof social contacts is represented as a weighted multilayer network constructedfrom different channels of telecommunication as well as data...

  16. Mining Important Nodes in Directed Weighted Complex Networks

    Directory of Open Access Journals (Sweden)

    Yunyun Yang

    2017-01-01

    Full Text Available In complex networks, mining important nodes has been a matter of concern by scholars. In recent years, scholars have focused on mining important nodes in undirected unweighted complex networks. But most of the methods are not applicable to directed weighted complex networks. Therefore, this paper proposes a Two-Way-PageRank method based on PageRank for further discussion of mining important nodes in directed weighted complex networks. We have mainly considered the frequency of contact between nodes and the length of time of contact between nodes. We have considered the source of the nodes (in-degree and the whereabouts of the nodes (out-degree simultaneously. We have given node important performance indicators. Through numerical examples, we analyze the impact of variation of some parameters on node important performance indicators. Finally, the paper has verified the accuracy and validity of the method through empirical network data.

  17. Effect of the missing nodes in a bidirectional network

    Science.gov (United States)

    Gemao, Beverly; Lai, Pik-Yin

    2017-08-01

    Complex networks have attracted studies from various fields of science due to their relevance in many real systems. As not all nodes are measured in real-systems, this paper explores the effect of the missing nodes on the observed nodes of a bidirectional network with Gaussian noises. Here, it is shown that the collective effect of the missing nodes on the observed nodes may be viewed as a colored noise with exponentially decaying time correlations.

  18. Energy Constraint Node Cache Based Routing Protocol For Adhoc Network

    OpenAIRE

    Dhiraj Nitnaware; Ajay Verma

    2010-01-01

    Mobile Adhoc Networks (MANETs) is a wireless infrastructureless network, where nodes are free to move independently in any direction. The nodes have limited battery power; hence we require energy efficient routing protocols to optimize network performance. This paper aims to develop a new routing algorithm based on the energy status of the node cache. We have named this algorithm as ECNC_AODV (Energy Constraint Node Cache) based routing protocol which is derived from the AODV protocol. The al...

  19. Node Heterogeneity for Energy Efficient Synchronization for Wireless Sensor Network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2016-01-01

    is the introduction of heterogeneous nodes regarding energy, and the other is to synchronize the local clock of the node with the global clock of the network. In this context, the paper proposes Node Heterogeneity aware Energy Efficient Synchronization Algorithm (NHES). It works on the formation of cluster......-based spanning tree (SPT). In the initial stage of the algorithm, the nodes are grouped into the cluster and form the tree. The nodes in the cluster and cluster heads in the network are synchronized with the notion of the global time scale of the network. Also, clock skews may cause the errors and be one......The energy of the node in the Wireless Sensor Networks (WSNs) is scare and causes the variation in the lifetime of the network. Also, the throughput and delay of the network depend on how long the network sustains i.e. energy consumption. One way to increase the sustainability of network...

  20. Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Ruiyun Yu

    2014-01-01

    Full Text Available Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks.

  1. Identification of hybrid node and link communities in complex networks.

    Science.gov (United States)

    He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

    2015-03-02

    Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

  2. Identification of hybrid node and link communities in complex networks

    Science.gov (United States)

    He, Dongxiao; Jin, Di; Chen, Zheng; Zhang, Weixiong

    2015-03-01

    Identifying communities in complex networks is an effective means for analyzing complex systems, with applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and finding communities of links are two popular schemes for network analysis. These schemes, however, have inherent drawbacks and are inadequate to capture complex organizational structures in real networks. We introduce a new scheme and an effective approach for identifying complex mixture structures of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large network of semantically associated words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.

  3. Node Heterogeneity for Energy Efficient Synchronization for Wireless Sensor Network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2016-01-01

    is the introduction of heterogeneous nodes regarding energy, and the other is to synchronize the local clock of the node with the global clock of the network. In this context, the paper proposes Node Heterogeneity aware Energy Efficient Synchronization Algorithm (NHES). It works on the formation of cluster......-based spanning tree (SPT). In the initial stage of the algorithm, the nodes are grouped into the cluster and form the tree. The nodes in the cluster and cluster heads in the network are synchronized with the notion of the global time scale of the network. Also, clock skews may cause the errors and be one...

  4. Near-Minimal Node Control of Networked Evolutionary Games

    NARCIS (Netherlands)

    Riehl, James Robert; Cao, Ming

    2014-01-01

    We investigate a problem related to the controllability of networked evolutionary games, first presenting an algorithm that computes a near-minimal set of nodes to drive all nodes in a tree network to a desired strategy, and then briefly discussing an algorithm that works for arbitrary networks

  5. Identifying node role in social network based on multiple indicators.

    Directory of Open Access Journals (Sweden)

    Shaobin Huang

    Full Text Available It is a classic topic of social network analysis to evaluate the importance of nodes and identify the node that takes on the role of core or bridge in a network. Because a single indicator is not sufficient to analyze multiple characteristics of a node, it is a natural solution to apply multiple indicators that should be selected carefully. An intuitive idea is to select some indicators with weak correlations to efficiently assess different characteristics of a node. However, this paper shows that it is much better to select the indicators with strong correlations. Because indicator correlation is based on the statistical analysis of a large number of nodes, the particularity of an important node will be outlined if its indicator relationship doesn't comply with the statistical correlation. Therefore, the paper selects the multiple indicators including degree, ego-betweenness centrality and eigenvector centrality to evaluate the importance and the role of a node. The importance of a node is equal to the normalized sum of its three indicators. A candidate for core or bridge is selected from the great degree nodes or the nodes with great ego-betweenness centrality respectively. Then, the role of a candidate is determined according to the difference between its indicators' relationship with the statistical correlation of the overall network. Based on 18 real networks and 3 kinds of model networks, the experimental results show that the proposed methods perform quite well in evaluating the importance of nodes and in identifying the node role.

  6. Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks.

    Science.gov (United States)

    Zhu, Junxing; Zhang, Jiawei; Wu, Quanyuan; Jia, Yan; Zhou, Bin; Wei, Xiaokai; Yu, Philip S

    2017-08-03

    Nowadays, people are usually involved in multiple heterogeneous social networks simultaneously. Discovering the anchor links between the accounts owned by the same users across different social networks is crucial for many important inter-network applications, e.g., cross-network link transfer and cross-network recommendation. Many different supervised models have been proposed to predict anchor links so far, but they are effective only when the labeled anchor links are abundant. However, in real scenarios, such a requirement can hardly be met and most anchor links are unlabeled, since manually labeling the inter-network anchor links is quite costly and tedious. To overcome such a problem and utilize the numerous unlabeled anchor links in model building, in this paper, we introduce the active learning based anchor link prediction problem. Different from the traditional active learning problems, due to the one-to-one constraint on anchor links, if an unlabeled anchor link a = ( u , v ) is identified as positive (i.e., existing), all the other unlabeled anchor links incident to account u or account v will be negative (i.e., non-existing) automatically. Viewed in such a perspective, asking for the labels of potential positive anchor links in the unlabeled set will be rewarding in the active anchor link prediction problem. Various novel anchor link information gain measures are defined in this paper, based on which several constraint active anchor link prediction methods are introduced. Extensive experiments have been done on real-world social network datasets to compare the performance of these methods with state-of-art anchor link prediction methods. The experimental results show that the proposed Mean-entropy-based Constrained Active Learning (MC) method can outperform other methods with significant advantages.

  7. Dynamic Evolution in Social Cooperation Networks with Node Failure

    OpenAIRE

    Yaofeng Zhang; Renbin Xiao

    2013-01-01

    Social cooperation networks are a kind of social networks in which individuals are linked through cooperation. Interference of economic crises, natural disasters and other emergencies may cause the node fails in social cooperation networks. To further study the influences of node failure on the total fitness degree and the cooperative ratio in social cooperation networks, the update rules of individual strategy and networks self-repair are constructed on the basis of the social cooperation ne...

  8. Bottlenecks and stability in networks with contending nodes

    NARCIS (Netherlands)

    Coenen, T.; Berg, J.L. van den; Boucherie, R.J.; Graaf, M. de; Hanbali, A.A.

    2013-01-01

    This paper considers a class of queueing network models where nodes have to contend with each other to serve their customers. In each time slot, a node with a non-empty queue either serves a customer or is blocked by a node in its vicinity. The focus of our study is on analyzing the throughput and

  9. Node Importance Ranking of Complex Networks with Entropy Variation

    Directory of Open Access Journals (Sweden)

    Xinbo Ai

    2017-06-01

    Full Text Available The heterogeneous nature of a complex network determines the roles of each node in the network that are quite different. Mechanisms of complex networks such as spreading dynamics, cascading reactions, and network synchronization are highly affected by a tiny fraction of so-called important nodes. Node importance ranking is thus of great theoretical and practical significance. Network entropy is usually utilized to characterize the amount of information encoded in the network structure and to measure the structural complexity at the graph level. We find that entropy can also serve as a local level metric to quantify node importance. We propose an entropic metric, Entropy Variation, defining the node importance as the variation of network entropy before and after its removal, according to the assumption that the removal of a more important node is likely to cause more structural variation. Like other state-of-the-art methods for ranking node importance, the proposed entropic metric is also used to utilize structural information, but at the systematical level, not the local level. Empirical investigations on real life networks, the Snake Idioms Network, and several other well-known networks, demonstrate the superiority of the proposed entropic metric, notably outperforming other centrality metrics in identifying the top-k most important nodes.

  10. Distributed precision based localization algorithm for ad-hoc wireless networks

    NARCIS (Netherlands)

    Havinga, Paul J.M.; Evers, L.; van Hoesel, L.F.W.; Octavian, Stefan

    2005-01-01

    The invention relates to method for determining the position of a non-anchor node in an ad-hoc network comprising a number of non-anchor nodes and at least one anchor node having a predetermined location, said method comprising the steps of: determining the distance from a first non-anchor node to a

  11. Node Attribute-enhanced Community Detection in Complex Networks.

    Science.gov (United States)

    Jia, Caiyan; Li, Yafang; Carson, Matthew B; Wang, Xiaoyang; Yu, Jian

    2017-05-25

    Community detection involves grouping the nodes of a network such that nodes in the same community are more densely connected to each other than to the rest of the network. Previous studies have focused mainly on identifying communities in networks using node connectivity. However, each node in a network may be associated with many attributes. Identifying communities in networks combining node attributes has become increasingly popular in recent years. Most existing methods operate on networks with attributes of binary, categorical, or numerical type only. In this study, we introduce kNN-enhance, a simple and flexible community detection approach that uses node attribute enhancement. This approach adds the k Nearest Neighbor (kNN) graph of node attributes to alleviate the sparsity and the noise effect of an original network, thereby strengthening the community structure in the network. We use two testing algorithms, kNN-nearest and kNN-Kmeans, to partition the newly generated, attribute-enhanced graph. Our analyses of synthetic and real world networks have shown that the proposed algorithms achieve better performance compared to existing state-of-the-art algorithms. Further, the algorithms are able to deal with networks containing different combinations of binary, categorical, or numerical attributes and could be easily extended to the analysis of massive networks.

  12. A Secure Localization Approach Using Mutual Authentication and Insider Node Validation in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Gulshan Kumar

    2017-01-01

    Full Text Available Localization is a concerning issue in the applications of wireless sensor networks. Along with the accuracy of the location estimation of the sensor nodes, the security of the estimation is another priority. Wireless sensor networks often face various attacks where the attackers try to manipulate the estimated location or try to provide false beacons. In this paper, we have proposed a methodology that will address this problem of security aspects in localization of the sensor nodes. Moreover, we have considered the network environment with random node deployment and mobility as these two conditions are less addressed in previous research works. Further, our proposed algorithm provides low overhead due to the usage of less control messages in a limited transmission range. In addition, we have also proposed an algorithm to detect the malicious anchor nodes inside the network. The simulated results show that our proposed algorithm is efficient in terms of time consumption, localization accuracy, and localization ratio in the presence of malicious nodes.

  13. ASH : Tackling node mobility in large-scale networks

    NARCIS (Netherlands)

    Pruteanu, A.; Dulman, S.

    2012-01-01

    With the increased adoption of technologies likewireless sensor networks by real-world applications, dynamic network topologies are becoming the rule rather than the exception. Node mobility, however, introduces a range of problems (communication interference, path uncertainty, low quality of

  14. Flexible Edge Nodes enabled by Hybrid Software Defined Optics & Networking

    DEFF Research Database (Denmark)

    Vegas Olmos, Juan José; Mehmeri, Victor; Tafur Monroy, Idelfonso

    This paper presents our vision on flexible edge nodes for future networks and our efforts to combine software defined optics and software defined networking to optimize the overall performance and user experience.......This paper presents our vision on flexible edge nodes for future networks and our efforts to combine software defined optics and software defined networking to optimize the overall performance and user experience....

  15. Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks

    Directory of Open Access Journals (Sweden)

    Shudong Li

    2013-01-01

    Full Text Available In the research on network security, distinguishing the vulnerable components of networks is very important for protecting infrastructures systems. Here, we probe how to identify the vulnerable nodes of complex networks in cascading failures, which was ignored before. Concerned with random attack (RA and highest load attack (HL on nodes, we model cascading dynamics of complex networks. Then, we introduce four kinds of weighting methods to characterize the nodes of networks including Barabási-Albert scale-free networks (SF, Watts-Strogatz small-world networks (WS, Erdos-Renyi random networks (ER, and two real-world networks. The simulations show that, for SF networks under HL attack, the nodes with small value of the fourth kind of weight are the most vulnerable and the ones with small value of the third weight are also vulnerable. Also, the real-world autonomous system with power-law distribution verifies these findings. Moreover, for WS and ER networks under both RA and HL attack, when the nodes have low tolerant ability, the ones with small value of the fourth kind of weight are more vulnerable and also the ones with high degree are easier to break down. The results give us important theoretical basis for digging the potential safety loophole and making protection strategy.

  16. GFT centrality: A new node importance measure for complex networks

    Science.gov (United States)

    Singh, Rahul; Chakraborty, Abhishek; Manoj, B. S.

    2017-12-01

    Identifying central nodes is very crucial to design efficient communication networks or to recognize key individuals of a social network. In this paper, we introduce Graph Fourier Transform Centrality (GFT-C), a metric that incorporates local as well as global characteristics of a node, to quantify the importance of a node in a complex network. GFT-C of a reference node in a network is estimated from the GFT coefficients derived from the importance signal of the reference node. Our study reveals the superiority of GFT-C over traditional centralities such as degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, and Google PageRank centrality, in the context of various arbitrary and real-world networks with different degree-degree correlations.

  17. Ranking influential nodes in complex networks with structural holes

    Science.gov (United States)

    Hu, Ping; Mei, Ting

    2018-01-01

    Ranking influential nodes in complex networks is of great theoretical and practical significance to ensure the safe operations of networks. In view of the important role structural hole nodes usually play in information spreading in complex networks, we propose a novel ranking method of influential nodes using structural holes called E-Burt method, which can be applied to weighted networks. This method fully takes into account the total connectivity strengths of the node in its local scope, the number of the connecting edges and the distributions of the total connectivity strengths on its connecting edges. The simulation results on the susceptible-infectious-recovered (SIR) dynamics suggest that the proposed E-Burt method can rank influential nodes more effectively and accurately in complex networks.

  18. Study on Selfish Node Incentive Mechanism with a Forward Game Node in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mohammed Ahmed Ahmed Al-Jaoufi

    2017-01-01

    Full Text Available In a wireless sensor network, some nodes may act selfishly and noncooperatively, such as not forwarding packets, in response to their own limited resources. If most of the nodes in a network exhibit this selfish behavior, the entire network will be paralyzed, and it will not be able to provide normal service. This paper considers implementing the idea of evolutionary game theory into the nodes of wireless sensor networks to effectively improve the reliability and stability of the networks. We present a new model for the selfish node incentive mechanism with a forward game node for wireless sensor networks, and we discuss applications of the replicator dynamics mechanism to analyze evolutionary trends of trust relationships among nodes. We analyzed our approach theoretically and conducted simulations based on the idea of evolutionary game theory. The results of the simulation indicated that a wireless sensor network that uses the incentive mechanism can forward packets well while resisting any slight variations. Thus, the stability and reliability of wireless sensor networks are improved. We conducted numerical experiments, and the results verified our conclusions based on the theoretical analysis.

  19. GWO-LPWSN: Grey Wolf Optimization Algorithm for Node Localization Problem in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    R. Rajakumar

    2017-01-01

    Full Text Available Seyedali Mirjalili et al. (2014 introduced a completely unique metaheuristic technique particularly grey wolf optimization (GWO. This algorithm mimics the social behavior of grey wolves whereas it follows the leadership hierarchy and attacking strategy. The rising issue in wireless sensor network (WSN is localization problem. The objective of this problem is to search out the geographical position of unknown nodes with the help of anchor nodes in WSN. In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem. The proposed work is implemented using MATLAB 8.2 whereas nodes are deployed in a random location within the desired network area. The parameters like computation time, percentage of localized node, and minimum localization error measures are utilized to analyse the potency of GWO rule with other variants of metaheuristics algorithms such as particle swarm optimization (PSO and modified bat algorithm (MBA. The observed results convey that the GWO provides promising results compared to the PSO and MBA in terms of the quick convergence rate and success rate.

  20. Compressed sensing based missing nodes prediction in temporal communication network

    Science.gov (United States)

    Cheng, Guangquan; Ma, Yang; Liu, Zhong; Xie, Fuli

    2018-02-01

    The reconstruction of complex network topology is of great theoretical and practical significance. Most research so far focuses on the prediction of missing links. There are many mature algorithms for link prediction which have achieved good results, but research on the prediction of missing nodes has just begun. In this paper, we propose an algorithm for missing node prediction in complex networks. We detect the position of missing nodes based on their neighbor nodes under the theory of compressed sensing, and extend the algorithm to the case of multiple missing nodes using spectral clustering. Experiments on real public network datasets and simulated datasets show that our algorithm can detect the locations of hidden nodes effectively with high precision.

  1. Malicious node detection in ad-hoc wireless networks

    Science.gov (United States)

    Griswold, Richard L.; Medidi, Sirisha R.

    2003-07-01

    Advances in wireless communications and the proliferation of mobile computing devices has led to the rise of a new type of computer network: the ad-hoc wireless network. Ad-hoc networks are characterized by a lack of fixed infrastructure, which give ad-hoc networks a great deal of flexibility, but also increases the risk of security problems. In wired networks, key pieces of network infrastructure are secured to prevent unauthorized physical access and tampering. Network administrators ensure that everything is properly configured and are on-hand to fix problems and deal with intrusions. In contrast, the nodes in an ad-hoc network are responsible for routing and forwarding data in the network, and there are no network administrators to handle potential problems. This makes an ad-hoc network more vulnerable to a misconfigured, faulty, or compromised node. We propose a means for a node in an ad-hoc network to detect and handle these malicious nodes by comparing data available to the routing protocol, such as cached routes in Dynamic Source Routing, ICMP messages, and transport layer information, such as TCP timeouts. This data can then be used along with network probes to isolate the malicious node.

  2. Identifying key nodes in multilayer networks based on tensor decomposition

    Science.gov (United States)

    Wang, Dingjie; Wang, Haitao; Zou, Xiufen

    2017-06-01

    The identification of essential agents in multilayer networks characterized by different types of interactions is a crucial and challenging topic, one that is essential for understanding the topological structure and dynamic processes of multilayer networks. In this paper, we use the fourth-order tensor to represent multilayer networks and propose a novel method to identify essential nodes based on CANDECOMP/PARAFAC (CP) tensor decomposition, referred to as the EDCPTD centrality. This method is based on the perspective of multilayer networked structures, which integrate the information of edges among nodes and links between different layers to quantify the importance of nodes in multilayer networks. Three real-world multilayer biological networks are used to evaluate the performance of the EDCPTD centrality. The bar chart and ROC curves of these multilayer networks indicate that the proposed approach is a good alternative index to identify real important nodes. Meanwhile, by comparing the behavior of both the proposed method and the aggregated single-layer methods, we demonstrate that neglecting the multiple relationships between nodes may lead to incorrect identification of the most versatile nodes. Furthermore, the Gene Ontology functional annotation demonstrates that the identified top nodes based on the proposed approach play a significant role in many vital biological processes. Finally, we have implemented many centrality methods of multilayer networks (including our method and the published methods) and created a visual software based on the MATLAB GUI, called ENMNFinder, which can be used by other researchers.

  3. Exploring the evolution of node neighborhoods in Dynamic Networks

    Science.gov (United States)

    Orman, Günce Keziban; Labatut, Vincent; Naskali, Ahmet Teoman

    2017-09-01

    Dynamic Networks are a popular way of modeling and studying the behavior of evolving systems. However, their analysis constitutes a relatively recent subfield of Network Science, and the number of available tools is consequently much smaller than for static networks. In this work, we propose a method specifically designed to take advantage of the longitudinal nature of dynamic networks. It characterizes each individual node by studying the evolution of its direct neighborhood, based on the assumption that the way this neighborhood changes reflects the role and position of the node in the whole network. For this purpose, we define the concept of neighborhood event, which corresponds to the various transformations such groups of nodes can undergo, and describe an algorithm for detecting such events. We demonstrate the interest of our method on three real-world networks: DBLP, LastFM and Enron. We apply frequent pattern mining to extract meaningful information from temporal sequences of neighborhood events. This results in the identification of behavioral trends emerging in the whole network, as well as the individual characterization of specific nodes. We also perform a cluster analysis, which reveals that, in all three networks, one can distinguish two types of nodes exhibiting different behaviors: a very small group of active nodes, whose neighborhood undergo diverse and frequent events, and a very large group of stable nodes.

  4. Active Learning for Node Classification in Assortative and Disassortative Networks

    CERN Document Server

    Moore, Cristopher; Zhu, Yaojia; Rouquier, Jean-Baptiste; Lane, Terran

    2011-01-01

    In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of all the other nodes. We develop an active learning algorithm for this problem which uses information-theoretic techniques to choose which nodes to explore. We test our algorithm on networks from three different domains: a social network, a network of English words that appear adjacently in a novel, and a marine food web. Our algorithm makes no initial assumptions about how the groups connect, and performs well even when faced with quite general types of network structure. In particular, we do not assume that nodes of the same class are more likely to be connected to each other---only that they connect to the rest of the network in similar ways.

  5. Enhancing the reliability of head nodes in underwater sensor networks.

    Science.gov (United States)

    Min, Hong; Cho, Yookun; Heo, Junyoung

    2012-01-01

    Underwater environments are quite different from terrestrial environments in terms of the communication media and operating conditions associated with those environments. In underwater sensor networks, the probability of node failure is high because sensor nodes are deployed in harsher environments than ground-based networks. The sensor nodes are surrounded by salt water and moved around by waves and currents. Many studies have focused on underwater communication environments in an effort to improve the data transmission throughput. In this paper, we present a checkpointing scheme for the head nodes to quickly recover from a head node failure. Experimental results show that the proposed scheme enhances the reliability of the networks and makes them more efficient in terms of energy consumption and the recovery latency compared to the previous scheme without checkpointing.

  6. Eradicating catastrophic collapse in interdependent networks via reinforced nodes.

    Science.gov (United States)

    Yuan, Xin; Hu, Yanqing; Stanley, H Eugene; Havlin, Shlomo

    2017-03-28

    In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources, together with their connected neighbors can still be functioning after disconnected from the giant component. Here, we propose and study a generalized percolation model that introduces a fraction of reinforced nodes in the interdependent networks that can function and support their neighborhood. We analyze, both analytically and via simulations, the order parameter-the functioning component-comprising both the giant component and smaller components that include at least one reinforced node. Remarkably, it is found that, for interdependent networks, we need to reinforce only a small fraction of nodes to prevent abrupt catastrophic collapses. Moreover, we find that the universal upper bound of this fraction is 0.1756 for two interdependent Erdős-Rényi (ER) networks: regular random (RR) networks and scale-free (SF) networks with large average degrees. We also generalize our theory to interdependent networks of networks (NONs). These findings might yield insight for designing resilient interdependent infrastructure networks.

  7. Measures of node centrality in mobile social networks

    Science.gov (United States)

    Gao, Zhenxiang; Shi, Yan; Chen, Shanzhi

    2015-02-01

    Mobile social networks exploit human mobility and consequent device-to-device contact to opportunistically create data paths over time. While links in mobile social networks are time-varied and strongly impacted by human mobility, discovering influential nodes is one of the important issues for efficient information propagation in mobile social networks. Although traditional centrality definitions give metrics to identify the nodes with central positions in static binary networks, they cannot effectively identify the influential nodes for information propagation in mobile social networks. In this paper, we address the problems of discovering the influential nodes in mobile social networks. We first use the temporal evolution graph model which can more accurately capture the topology dynamics of the mobile social network over time. Based on the model, we explore human social relations and mobility patterns to redefine three common centrality metrics: degree centrality, closeness centrality and betweenness centrality. We then employ empirical traces to evaluate the benefits of the proposed centrality metrics, and discuss the predictability of nodes' global centrality ranking by nodes' local centrality ranking. Results demonstrate the efficiency of the proposed centrality metrics.

  8. Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes

    OpenAIRE

    Hui Yang; Ming Tang; Thilo Gross

    2015-01-01

    One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. Howeve...

  9. Performance of wireless sensor networks under random node failures

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-01-28

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

  10. Resistance between two nodes of a ring network

    Science.gov (United States)

    Jiang, Zhuozhuo; Yan, Weigen

    2017-10-01

    The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Given m positive integers m1 ,m2 , ⋯ ,mn, let G[mi]1n be the resistor network with node set V =V1 ∪V2 ∪ ⋯ ∪Vn and with a unit resistor between arbitrary two nodes u ∈Vi , v ∈Vi+1 for i = 1 , 2 , ⋯ , n, where Vi ∩Vj = 0̸ if i ≠ j, and ∣Vi ∣ =mi ,Vn+1 =V1. Gervacio (2016) introduces a modified method to compute the resistance between two nodes. Based on this method, in this paper, we use the elimination and substitution principles in electrical circuit to obtain the resistance between arbitrary two nodes of G[mi]1n.

  11. Mirror node correlations tuning synchronization in multiplex networks

    Science.gov (United States)

    Kumar, Anil; Baptista, Murilo S.; Zaikin, Alexey; Jalan, Sarika

    2017-12-01

    We show that the degree-degree correlations have a major impact on global synchronizability (GS) of multiplex networks, enabling the specification of synchronizability by only changing the degree-degree correlations of the mirror nodes while maintaining the connection architecture of the individual layer unaltered. If individual layers have nodes that are mildly correlated, the multiplex network is best synchronizable when the mirror degrees are strongly negatively correlated. If individual layers have nodes with strong degree-degree correlations, mild correlations among the degrees of mirror nodes are the best strategy for the optimization of GS. Global synchronization also depend on the density of connections, a phenomenon not observed in a single layer network. The results are crucial to understand, predict, and specify behavior of systems having multiple types of connections among the interacting units.

  12. Ranking stability and super-stable nodes in complex networks.

    Science.gov (United States)

    Ghoshal, Gourab; Barabási, Albert-László

    2011-07-19

    Pagerank, a network-based diffusion algorithm, has emerged as the leading method to rank web content, ecological species and even scientists. Despite its wide use, it remains unknown how the structure of the network on which it operates affects its performance. Here we show that for random networks the ranking provided by pagerank is sensitive to perturbations in the network topology, making it unreliable for incomplete or noisy systems. In contrast, in scale-free networks we predict analytically the emergence of super-stable nodes whose ranking is exceptionally stable to perturbations. We calculate the dependence of the number of super-stable nodes on network characteristics and demonstrate their presence in real networks, in agreement with the analytical predictions. These results not only deepen our understanding of the interplay between network topology and dynamical processes but also have implications in all areas where ranking has a role, from science to marketing.

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

    Science.gov (United States)

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

    1995-12-26

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

  14. Rapid identifying high-influence nodes in complex networks

    Science.gov (United States)

    Song, Bo; Jiang, Guo-Ping; Song, Yu-Rong; Xia, Ling-Ling

    2015-10-01

    A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the uncertainties of network scale and topology, and the timeliness of dynamic behaviors in real networks, we propose a rapid identifying method (RIM) to find the fraction of high-influential nodes. Instead of ranking all nodes, our method only aims at ranking a small number of nodes in network. We set the high-influential nodes as initial spreaders, and evaluate the performance of RIM by the susceptible-infected-recovered (SIR) model. The simulations show that in different networks, RIM performs well on rapid identifying high-influential nodes, which is verified by typical ranking methods, such as degree, closeness, betweenness, and eigenvector centrality methods. Project supported by the National Natural Science Foundation of China (Grant Nos. 61374180 and 61373136), the Ministry of Education Research in the Humanities and Social Sciences Planning Fund Project, China (Grant No. 12YJAZH120), and the Six Projects Sponsoring Talent Summits of Jiangsu Province, China (Grant No. RLD201212).

  15. Critical Node Location in De Bruijn Networks

    Science.gov (United States)

    2016-10-01

    algorithms that are normally time- consuming perform exceptionally well on de Bruijn networks. This class of networks has yet to be considered from an... exceptionally well on de Bruijn networks. This class of networks has yet to be considered from an identifying code perspective, and a complete...Note that this provides only an upper bound on our t-prefixes - if we have repeated letters than we may have double -counted. Now we are ready to

  16. Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes.

    Science.gov (United States)

    Yang, Hui; Tang, Ming; Gross, Thilo

    2015-08-21

    One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.

  17. Latency-Bounded Minimum Influential Node Selection in Social Networks

    Science.gov (United States)

    Zou, Feng; Zhang, Zhao; Wu, Weili

    As one of the essential problems in information diffusion process, how to select a set of influential nodes as the starting nodes has been studied by lots of researchers. All the existing solutions focus on how to maximize the influence of the initially selected “influential nodes”, paying no attention on how the influential nodes selection could maximize the speed of the diffusion. In this paper, we consider the problem of influential nodes selection regarding to the propagation speed in social network information diffusion. We define a discrete optimization problem, called Fast Information Propagation Problem. We show that this problem is NP-hard problem when the time requirement for information propagation is exactly 1-hop. We also propose a Latency-bounded Minimum Influential Node Selection Algorithm to solve the problem in this case.

  18. Multiple-node basin stability in complex dynamical networks

    Science.gov (United States)

    Mitra, Chiranjit; Choudhary, Anshul; Sinha, Sudeshna; Kurths, Jürgen; Donner, Reik V.

    2017-03-01

    Dynamical entities interacting with each other on complex networks often exhibit multistability. The stability of a desired steady regime (e.g., a synchronized state) to large perturbations is critical in the operation of many real-world networked dynamical systems such as ecosystems, power grids, the human brain, etc. This necessitates the development of appropriate quantifiers of stability of multiple stable states of such systems. Motivated by the concept of basin stability (BS) [P. J. Menck et al., Nat. Phys. 9, 89 (2013), 10.1038/nphys2516], we propose here the general framework of multiple-node basin stability for gauging the global stability and robustness of networked dynamical systems in response to nonlocal perturbations simultaneously affecting multiple nodes of a system. The framework of multiple-node BS provides an estimate of the critical number of nodes that, when simultaneously perturbed, significantly reduce the capacity of the system to return to the desired stable state. Further, this methodology can be applied to estimate the minimum number of nodes of the network to be controlled or safeguarded from external perturbations to ensure proper operation of the system. Multiple-node BS can also be utilized for probing the influence of spatially localized perturbations or targeted attacks to specific parts of a network. We demonstrate the potential of multiple-node BS in assessing the stability of the synchronized state in a deterministic scale-free network of Rössler oscillators and a conceptual model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics.

  19. Impact of constrained rewiring on network structure and node dynamics.

    Science.gov (United States)

    Rattana, P; Berthouze, L; Kiss, I Z

    2014-11-01

    In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

  20. Node Augmentation Technique in Bayesian Network Evidence Analysis and Marshaling

    Energy Technology Data Exchange (ETDEWEB)

    Keselman, Dmitry [Los Alamos National Laboratory; Tompkins, George H [Los Alamos National Laboratory; Leishman, Deborah A [Los Alamos National Laboratory

    2010-01-01

    Given a Bayesian network, sensitivity analysis is an important activity. This paper begins by describing a network augmentation technique which can simplifY the analysis. Next, we present two techniques which allow the user to determination the probability distribution of a hypothesis node under conditions of uncertain evidence; i.e. the state of an evidence node or nodes is described by a user specified probability distribution. Finally, we conclude with a discussion of three criteria for ranking evidence nodes based on their influence on a hypothesis node. All of these techniques have been used in conjunction with a commercial software package. A Bayesian network based on a directed acyclic graph (DAG) G is a graphical representation of a system of random variables that satisfies the following Markov property: any node (random variable) is independent of its non-descendants given the state of all its parents (Neapolitan, 2004). For simplicities sake, we consider only discrete variables with a finite number of states, though most of the conclusions may be generalized.

  1. Measure the structure similarity of nodes in complex networks based on relative entropy

    Science.gov (United States)

    Zhang, Qi; Li, Meizhu; Deng, Yong

    2018-02-01

    Similarity of nodes is a basic structure quantification in complex networks. Lots of methods in research on complex networks are based on nodes' similarity such as node's classification, network's community structure detection, network's link prediction and so on. Therefore, how to measure nodes' similarity is an important problem in complex networks. In this paper, a new method is proposed to measure nodes' structure similarity based on relative entropy and each node's local structure. In the new method, each node's structure feature can be quantified as a special kind of information. The quantification of similarity between different pair of nodes can be replaced as the quantification of similarity in structural information. Then relative entropy is used to measure the difference between each pair of nodes' structural information. At last the value of relative entropy between each pair of nodes is used to measure nodes' structure similarity in complex networks. Comparing with existing methods the new method is more accuracy to measure nodes' structure similarity.

  2. Speech transport in packet-radio networks with mobile nodes

    Science.gov (United States)

    Shacham, N.; Craighill, E. J.; Poggio, A. A.

    1983-12-01

    A research effort to provide speech-carrying capabilities to a data-oriented packet-switching radio network is described. The features of the network that limit its ability to carry packetized speech are discussed, and their effects on the network performance are analyzed. A new protocol, called duct routing, that enhances the network capabilities in a mobile environment is presented. That protocol makes use of repeater redundancy to compensate for loss of communication connectivity due to node mobility. A series of experiments to evaluate the network performance in carrying speech traffic, both with data and voice protocols, is described, and the results are presented and discussed.

  3. A new mutually reinforcing network node and link ranking algorithm.

    Science.gov (United States)

    Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E

    2015-10-23

    This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.

  4. A new mutually reinforcing network node and link ranking algorithm

    Science.gov (United States)

    Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

    2015-10-01

    This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity.

  5. An Effective Cuckoo Search Algorithm for Node Localization in Wireless Sensor Network.

    Science.gov (United States)

    Cheng, Jing; Xia, Linyuan

    2016-08-31

    Localization is an essential requirement in the increasing prevalence of wireless sensor network (WSN) applications. Reducing the computational complexity, communication overhead in WSN localization is of paramount importance in order to prolong the lifetime of the energy-limited sensor nodes and improve localization performance. This paper proposes an effective Cuckoo Search (CS) algorithm for node localization. Based on the modification of step size, this approach enables the population to approach global optimal solution rapidly, and the fitness of each solution is employed to build mutation probability for avoiding local convergence. Further, the approach restricts the population in the certain range so that it can prevent the energy consumption caused by insignificant search. Extensive experiments were conducted to study the effects of parameters like anchor density, node density and communication range on the proposed algorithm with respect to average localization error and localization success ratio. In addition, a comparative study was conducted to realize the same localization task using the same network deployment. Experimental results prove that the proposed CS algorithm can not only increase convergence rate but also reduce average localization error compared with standard CS algorithm and Particle Swarm Optimization (PSO) algorithm.

  6. Securing Gateways within Clustered Power Centric Network of Nodes

    Directory of Open Access Journals (Sweden)

    Qaisar Javaid

    2016-01-01

    Full Text Available Knowledge Networks are gaining momentum within cyber world. Knowledge leads to innovation and for this reason organizations focus on research and information gathering in order to gain and improve existing knowledge. This of information era, which is primarily based on world wide web technologies, enables significantly expanded networks of people to communicate and collaborate 'virtually' across teams, across entire organizations and across the world, anytime and anywhere. Innovations in computing and telecommunications have transformed the corporations from structured and manageable types to interwoven network of blurred boundaries such as; ad hoc networks and mobile wireless networks, etc. This study explores knowledge networks in Information Technology and security leaks that are found, as well as measures that are taken to counter this menace which is coming up with optimal Secure Clustered Power Centric node network. The paper concludes these measures, evaluating and integrating them to come up with a secured network design.

  7. Optimal Node Placement in Underwater Wireless Sensor Networks

    KAUST Repository

    Felamban, M.

    2013-03-25

    Wireless Sensor Networks (WSN) are expected to play a vital role in the exploration and monitoring of underwater areas which are not easily reachable by humans. However, underwater communication via acoustic waves is subject to several performance limitations that are very different from those used for terresstrial networks. In this paper, we investigate node placement for building an initial underwater WSN infrastructure. We formulate this problem as a nonlinear mathematical program with the objective of minimizing the total transmission loss under a given number of sensor nodes and targeted coverage volume. The obtained solution is the location of each node represented via a truncated octahedron to fill out the 3D space. Experiments are conducted to verify the proposed formulation, which is solved using Matlab optimization tool. Simulation is also conducted using an ns-3 simulator, and the simulation results are consistent with the obtained results from mathematical model with less than 10% error.

  8. Entanglement distillation between solid-state quantum network nodes.

    Science.gov (United States)

    Kalb, N; Reiserer, A A; Humphreys, P C; Bakermans, J J W; Kamerling, S J; Nickerson, N H; Benjamin, S C; Twitchen, D J; Markham, M; Hanson, R

    2017-06-02

    The impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable imperfections necessitate a means to improve remote entanglement by local quantum operations. We realize entanglement distillation on a quantum network primitive of distant electron-nuclear two-qubit nodes. The heralded generation of two copies of a remote entangled state is demonstrated through single-photon-mediated entangling of the electrons and robust storage in the nuclear spins. After applying local two-qubit gates, single-shot measurements herald the distillation of an entangled state with increased fidelity that is available for further use. The key combination of generating, storing, and processing entangled states should enable the exploration of multiparticle entanglement on an extended quantum network. Copyright © 2017, American Association for the Advancement of Science.

  9. Entanglement distillation between solid-state quantum network nodes

    Science.gov (United States)

    Kalb, N.; Reiserer, A. A.; Humphreys, P. C.; Bakermans, J. J. W.; Kamerling, S. J.; Nickerson, N. H.; Benjamin, S. C.; Twitchen, D. J.; Markham, M.; Hanson, R.

    2017-06-01

    The impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable imperfections necessitate a means to improve remote entanglement by local quantum operations. We realize entanglement distillation on a quantum network primitive of distant electron-nuclear two-qubit nodes. The heralded generation of two copies of a remote entangled state is demonstrated through single-photon-mediated entangling of the electrons and robust storage in the nuclear spins. After applying local two-qubit gates, single-shot measurements herald the distillation of an entangled state with increased fidelity that is available for further use. The key combination of generating, storing, and processing entangled states should enable the exploration of multiparticle entanglement on an extended quantum network.

  10. Exploiting node mobility for energy optimization in wireless sensor networks

    Science.gov (United States)

    El-Moukaddem, Fatme Mohammad

    Wireless Sensor Networks (WSNs) have become increasingly available for data-intensive applications such as micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit the sheer amount of data generated within an application's lifetime to the base station despite the fact that sensor nodes have limited power supplies such as batteries or small solar panels. The availability of numerous low-cost robotic units (e.g. Robomote and Khepera) has made it possible to construct sensor networks consisting of mobile sensor nodes. It has been shown that the controlled mobility offered by mobile sensors can be exploited to improve the energy efficiency of a network. In this thesis, we propose schemes that use mobile sensor nodes to reduce the energy consumption of data-intensive WSNs. Our approaches differ from previous work in two main aspects. First, our approaches do not require complex motion planning of mobile nodes, and hence can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless communications into a holistic optimization framework. We consider three problems arising from the limited energy in the sensor nodes. In the first problem, the network consists of mostly static nodes and contains only a few mobile nodes. In the second and third problems, we assume essentially that all nodes in the WSN are mobile. We first study a new problem called max-data mobile relay configuration (MMRC ) that finds the positions of a set of mobile sensors, referred to as relays, that maximize the total amount of data gathered by the network during its lifetime. We show that the MMRC problem is surprisingly complex even for a trivial network topology due to the joint consideration of the energy consumption of both wireless communication and mechanical locomotion. We present optimal MMRC algorithms and practical distributed

  11. Identification of important nodes in directed biological networks: a network motif approach.

    Directory of Open Access Journals (Sweden)

    Pei Wang

    Full Text Available Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA, this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.

  12. Fractional Dynamics of Network Growth Constrained by Aging Node Interactions.

    Science.gov (United States)

    Safdari, Hadiseh; Zare Kamali, Milad; Shirazi, Amirhossein; Khalighi, Moein; Jafari, Gholamreza; Ausloos, Marcel

    2016-01-01

    In many social complex systems, in which agents are linked by non-linear interactions, the history of events strongly influences the whole network dynamics. However, a class of "commonly accepted beliefs" seems rarely studied. In this paper, we examine how the growth process of a (social) network is influenced by past circumstances. In order to tackle this cause, we simply modify the well known preferential attachment mechanism by imposing a time dependent kernel function in the network evolution equation. This approach leads to a fractional order Barabási-Albert (BA) differential equation, generalizing the BA model. Our results show that, with passing time, an aging process is observed for the network dynamics. The aging process leads to a decay for the node degree values, thereby creating an opposing process to the preferential attachment mechanism. On one hand, based on the preferential attachment mechanism, nodes with a high degree are more likely to absorb links; but, on the other hand, a node's age has a reduced chance for new connections. This competitive scenario allows an increased chance for younger members to become a hub. Simulations of such a network growth with aging constraint confirm the results found from solving the fractional BA equation. We also report, as an exemplary application, an investigation of the collaboration network between Hollywood movie actors. It is undubiously shown that a decay in the dynamics of their collaboration rate is found, even including a sex difference. Such findings suggest a widely universal application of the so generalized BA model.

  13. Optimal Node Placement in Underwater Acoustic Sensor Network

    KAUST Repository

    Felemban, Muhamad

    2011-10-01

    Almost 70% of planet Earth is covered by water. A large percentage of underwater environment is unexplored. In the past two decades, there has been an increase in the interest of exploring and monitoring underwater life among scientists and in industry. Underwater operations are extremely difficult due to the lack of cheap and efficient means. Recently, Wireless Sensor Networks have been introduced in underwater environment applications. However, underwater communication via acoustic waves is subject to several performance limitations, which makes the relevant research issues very different from those on land. In this thesis, we investigate node placement for building an initial Underwater Wireless Sensor Network infrastructure. Firstly, we formulated the problem into a nonlinear mathematic program with objectives of minimizing the total transmission loss under a given number of sensor nodes and targeted volume. We conducted experiments to verify the proposed formulation, which is solved using Matlab optimization tool. We represented each node with a truncated octahedron to fill out the 3D space. The truncated octahedrons are tiled in the 3D space with each node in the center where locations of the nodes are given using 3D coordinates. Results are supported using ns-3 simulator. Results from simulation are consistent with the obtained results from mathematical model with less than 10% error.

  14. Exact asymptotic expansion for the resistance between the center node and a node on the cobweb network boundary

    Directory of Open Access Journals (Sweden)

    R. Kenna

    2014-09-01

    Full Text Available We analyze the resistance between two nodes in a cobweb network of resistors. Based on an exact expression, we derive the asymptotic expansions for the resistance between the center node and a node on the boundary of the M x N cobweb network with resistors r and s in the two spatial directions. All coefficients in this expansion are expressed through analytical functions.

  15. Effects of network node consolidation in optical access and aggregation networks on costs and power consumption

    Science.gov (United States)

    Lange, Christoph; Hülsermann, Ralf; Kosiankowski, Dirk; Geilhardt, Frank; Gladisch, Andreas

    2010-01-01

    The increasing demand for higher bit rates in access networks requires fiber deployment closer to the subscriber resulting in fiber-to-the-home (FTTH) access networks. Besides higher access bit rates optical access network infrastructure and related technologies enable the network operator to establish larger service areas resulting in a simplified network structure with a lower number of network nodes. By changing the network structure network operators want to benefit from a changed network cost structure by decreasing in short and mid term the upfront investments for network equipment due to concentration effects as well as by reducing the energy costs due to a higher energy efficiency of large network sites housing a high amount of network equipment. In long term also savings in operational expenditures (OpEx) due to the closing of central office (CO) sites are expected. In this paper different architectures for optical access networks basing on state-of-the-art technology are analyzed with respect to network installation costs and power consumption in the context of access node consolidation. Network planning and dimensioning results are calculated for a realistic network scenario of Germany. All node consolidation scenarios are compared against a gigabit capable passive optical network (GPON) based FTTH access network operated from the conventional CO sites. The results show that a moderate reduction of the number of access nodes may be beneficial since in that case the capital expenditures (CapEx) do not rise extraordinarily and savings in OpEx related to the access nodes are expected. The total power consumption does not change significantly with decreasing number of access nodes but clustering effects enable a more energyefficient network operation and optimized power purchase order quantities leading to benefits in energy costs.

  16. Power Aware Simulation Framework for Wireless Sensor Networks and Nodes

    Directory of Open Access Journals (Sweden)

    Daniel Weber

    2008-07-01

    Full Text Available The constrained resources of sensor nodes limit analytical techniques and cost-time factors limit test beds to study wireless sensor networks (WSNs. Consequently, simulation becomes an essential tool to evaluate such systems.We present the power aware wireless sensors (PAWiS simulation framework that supports design and simulation of wireless sensor networks and nodes. The framework emphasizes power consumption capturing and hence the identification of inefficiencies in various hardware and software modules of the systems. These modules include all layers of the communication system, the targeted class of application itself, the power supply and energy management, the central processing unit (CPU, and the sensor-actuator interface. The modular design makes it possible to simulate heterogeneous systems. PAWiS is an OMNeT++ based discrete event simulator written in C++. It captures the node internals (modules as well as the node surroundings (network, environment and provides specific features critical to WSNs like capturing power consumption at various levels of granularity, support for mobility, and environmental dynamics as well as the simulation of timing effects. A module library with standardized interfaces and a power analysis tool have been developed to support the design and analysis of simulation models. The performance of the PAWiS simulator is comparable with other simulation environments.

  17. Ranking nodes in growing networks: When PageRank fails.

    Science.gov (United States)

    Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

    2015-11-10

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

  18. Ranking nodes in growing networks: When PageRank fails

    Science.gov (United States)

    Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

    2015-11-01

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

  19. Multispecies Trapped-Ion Node for Quantum Networking

    Science.gov (United States)

    Inlek, I. V.; Crocker, C.; Lichtman, M.; Sosnova, K.; Monroe, C.

    2017-06-01

    Trapped atomic ions are a leading platform for quantum information networks, with long-lived identical qubit memories that can be locally entangled through their Coulomb interaction and remotely entangled through photonic channels. However, performing both local and remote operations in a single node of a quantum network requires extreme isolation between spectator qubit memories and qubits associated with the photonic interface. We achieve this isolation by cotrapping 171Yb+ and 138Ba+ qubits. We further demonstrate the ingredients of a scalable ion trap network node with two distinct experiments that consist of entangling the mixed species qubit pair through their collective motion and entangling a 138Ba+ qubit with an emitted visible photon.

  20. High-precision multi-node clock network distribution

    Science.gov (United States)

    Chen, Xing; Cui, Yifan; Lu, Xing; Ci, Cheng; Zhang, Xuesong; Liu, Bo; Wu, Hong; Tang, Tingsong; Shi, Kebin; Zhang, Zhigang

    2017-10-01

    A high precision multi-node clock network for multiple users was built following the precise frequency transmission and time synchronization of 120 km fiber. The network topology adopts a simple star-shaped network structure. The clock signal of a hydrogen maser (synchronized with UTC) was recovered from a 120 km telecommunication fiber link and then was distributed to 4 sub-stations. The fractional frequency instability of all substations is in the level of 10-15 in a second and the clock offset instability is in sub-ps in root-mean-square average.

  1. Error recovery to enable error-free message transfer between nodes of a computer network

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-01-26

    An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

  2. Contact Trees: Network Visualization beyond Nodes and Edges

    Science.gov (United States)

    Sallaberry, Arnaud; Fu, Yang-chih; Ho, Hwai-Chung; Ma, Kwan-Liu

    2016-01-01

    Node-Link diagrams make it possible to take a quick glance at how nodes (or actors) in a network are connected by edges (or ties). A conventional network diagram of a “contact tree” maps out a root and branches that represent the structure of nodes and edges, often without further specifying leaves or fruits that would have grown from small branches. By furnishing such a network structure with leaves and fruits, we reveal details about “contacts” in our ContactTrees upon which ties and relationships are constructed. Our elegant design employs a bottom-up approach that resembles a recent attempt to understand subjective well-being by means of a series of emotions. Such a bottom-up approach to social-network studies decomposes each tie into a series of interactions or contacts, which can help deepen our understanding of the complexity embedded in a network structure. Unlike previous network visualizations, ContactTrees highlight how relationships form and change based upon interactions among actors, as well as how relationships and networks vary by contact attributes. Based on a botanical tree metaphor, the design is easy to construct and the resulting tree-like visualization can display many properties at both tie and contact levels, thus recapturing a key ingredient missing from conventional techniques of network visualization. We demonstrate ContactTrees using data sets consisting of up to three waves of 3-month contact diaries over the 2004-2012 period, and discuss how this design can be applied to other types of datasets. PMID:26784350

  3. A New Node Deployment and Location Dispatch Algorithm for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng Jiang

    2016-01-01

    Full Text Available Considering that deployment strategies for underwater sensor networks should contribute to fully connecting the networks, a Guaranteed Full Connectivity Node Deployment (GFCND algorithm is proposed in this study. The GFCND algorithm attempts to deploy the coverage nodes according to the greedy iterative strategy, after which the connectivity nodes are used to improve network connectivity and fully connect the whole network. Furthermore, a Location Dispatch Based on Command Nodes (LDBCN algorithm is proposed, which accomplishes the location adjustment of the common nodes with the help of the SINK node and the command nodes. The command nodes then dispatch the common nodes. Simulation results show that the GFCND algorithm achieves a comparatively large coverage percentage and a fully connected network; furthermore, the LDBCN algorithm helps the common nodes preserve more total energy when they reach their destination locations.

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

    Energy Technology Data Exchange (ETDEWEB)

    Kim, M; Leskovec, J

    2011-11-14

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

  5. Hidden Connectivity in Networks with Vulnerable Classes of Nodes

    Directory of Open Access Journals (Sweden)

    Sebastian M. Krause

    2016-10-01

    Full Text Available In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a “color-avoiding” percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

  6. Fractional Dynamics of Network Growth Constrained by Aging Node Interactions.

    Directory of Open Access Journals (Sweden)

    Hadiseh Safdari

    Full Text Available In many social complex systems, in which agents are linked by non-linear interactions, the history of events strongly influences the whole network dynamics. However, a class of "commonly accepted beliefs" seems rarely studied. In this paper, we examine how the growth process of a (social network is influenced by past circumstances. In order to tackle this cause, we simply modify the well known preferential attachment mechanism by imposing a time dependent kernel function in the network evolution equation. This approach leads to a fractional order Barabási-Albert (BA differential equation, generalizing the BA model. Our results show that, with passing time, an aging process is observed for the network dynamics. The aging process leads to a decay for the node degree values, thereby creating an opposing process to the preferential attachment mechanism. On one hand, based on the preferential attachment mechanism, nodes with a high degree are more likely to absorb links; but, on the other hand, a node's age has a reduced chance for new connections. This competitive scenario allows an increased chance for younger members to become a hub. Simulations of such a network growth with aging constraint confirm the results found from solving the fractional BA equation. We also report, as an exemplary application, an investigation of the collaboration network between Hollywood movie actors. It is undubiously shown that a decay in the dynamics of their collaboration rate is found, even including a sex difference. Such findings suggest a widely universal application of the so generalized BA model.

  7. Minimum steering node set of complex networks and its applications to biomolecular networks.

    Science.gov (United States)

    Wu, Lin; Li, Min; Wang, Jianxin; Wu, Fang-Xiang

    2016-06-01

    Many systems of interests in practices can be represented as complex networks. For biological systems, biomolecules do not perform their functions alone but interact with each other to form so-called biomolecular networks. A system is said to be controllable if it can be steered from any initial state to any other final state in finite time. The network controllability has become essential to study the dynamics of the networks and understand the importance of individual nodes in the networks. Some interesting biological phenomena have been discovered in terms of the structural controllability of biomolecular networks. Most of current studies investigate the structural controllability of networks in notion of the minimum driver node sets (MDSs). In this study, the authors analyse the network structural controllability in notion of the minimum steering node sets (MSSs). They first develop a graph-theoretic algorithm to identify the MSS for a given network and then apply it to several biomolecular networks. Application results show that biomolecules identified in the MSSs play essential roles in corresponding biological processes. Furthermore, the application results indicate that the MSSs can reflect the network dynamics and node importance in controlling the networks better than the MDSs.

  8. The Study of Collective Actions in a University Anchored Community Wireless Network

    Science.gov (United States)

    Kuchibhotla, Hari N.

    2012-01-01

    The emergence of wireless devices and the ease in setting up wireless devices has created opportunities for various entities, and in particular to universities, by partnering with their local communities in the form of a university anchored community wireless network. This provides opportunities for students to be part of the community-based…

  9. Node-to-node field calibration of wireless distributed air pollution sensor network.

    Science.gov (United States)

    Kizel, Fadi; Etzion, Yael; Shafran-Nathan, Rakefet; Levy, Ilan; Fishbain, Barak; Bartonova, Alena; Broday, David M

    2018-02-01

    Low-cost air quality sensors offer high-resolution spatiotemporal measurements that can be used for air resources management and exposure estimation. Yet, such sensors require frequent calibration to provide reliable data, since even after a laboratory calibration they might not report correct values when they are deployed in the field, due to interference with other pollutants, as a result of sensitivity to environmental conditions and due to sensor aging and drift. Field calibration has been suggested as a means for overcoming these limitations, with the common strategy involving periodical collocations of the sensors at an air quality monitoring station. However, the cost and complexity involved in relocating numerous sensor nodes back and forth, and the loss of data during the repeated calibration periods make this strategy inefficient. This work examines an alternative approach, a node-to-node (N2N) calibration, where only one sensor in each chain is directly calibrated against the reference measurements and the rest of the sensors are calibrated sequentially one against the other while they are deployed and collocated in pairs. The calibration can be performed multiple times as a routine procedure. This procedure minimizes the total number of sensor relocations, and enables calibration while simultaneously collecting data at the deployment sites. We studied N2N chain calibration and the propagation of the calibration error analytically, computationally and experimentally. The in-situ N2N calibration is shown to be generic and applicable for different pollutants, sensing technologies, sensor platforms, chain lengths, and sensor order within the chain. In particular, we show that chain calibration of three nodes, each calibrated for a week, propagate calibration errors that are similar to those found in direct field calibration. Hence, N2N calibration is shown to be suitable for calibration of distributed sensor networks. Copyright © 2017 Elsevier Ltd. All

  10. A Model to Convert Airport Geographic and Geometric Information into a Node-Link Network

    OpenAIRE

    Zhang, Yang

    2015-01-01

    An airport node-link network model is an important input for most airport simulation models. Developing, maintaining and updating detailed airport surface node-link models require significant work. A model to convert airport geographic and geometric information into a node-link network is thus needed. In this thesis, an efficient model to automate the procedure of converting airport geographic and geometric information into a node-link network is proposed. The geographic and geometric info...

  11. Identifying node spreading influence for tunable clustering coefficient networks

    Science.gov (United States)

    Wang, Zi-Yi; Han, Jing-Ti; Zhao, Jun

    2017-11-01

    Identifying the node spreading influence is of significant for information and innovation diffusion. In this paper, we argue that the spreading process should be taken into account for identifying the node spreading influence and investigate the effect of the network structure, measured by the clustering coefficient, on the performance of spreading dynamics. Firstly, we generate a series of networks with tunable clustering coefficients. Then, taking into account the spreading process, we explore the performances among the Dynamics-sensitive (DS) index and the degree, between, closeness, eigenvector indices. Comparing with the Susceptible-Infective-Removed (SIR) model, the extensive results show that, for different spreading time steps and clustering coefficients, the DS centrality outperforms the performance, τ > 0 . 97, of degree, betweenness, closeness and eigenvector measures. Moreover, the accuracy of closeness and eigenvector centrality is similar and conducts better in networks with larger spreading rate β = 0 . 20 , τ > 0 . 93. As the clustering coefficient increases, all the performances decrease but DS centrality with least percent of 1.16 at most under β = 0 . 10, and Closeness with the largest percent of 9.75 under β = 0 . 05. This work suggests that the spreading influence not only depends on the network structure, more importantly, the spreading dynamic process also affect the performance greatly, which should be taken into account simultaneously.

  12. Criticality predicts maximum irregularity in recurrent networks of excitatory nodes.

    Directory of Open Access Journals (Sweden)

    Yahya Karimipanah

    Full Text Available A rigorous understanding of brain dynamics and function requires a conceptual bridge between multiple levels of organization, including neural spiking and network-level population activity. Mounting evidence suggests that neural networks of cerebral cortex operate at a critical regime, which is defined as a transition point between two phases of short lasting and chaotic activity. However, despite the fact that criticality brings about certain functional advantages for information processing, its supporting evidence is still far from conclusive, as it has been mostly based on power law scaling of size and durations of cascades of activity. Moreover, to what degree such hypothesis could explain some fundamental features of neural activity is still largely unknown. One of the most prevalent features of cortical activity in vivo is known to be spike irregularity of spike trains, which is measured in terms of the coefficient of variation (CV larger than one. Here, using a minimal computational model of excitatory nodes, we show that irregular spiking (CV > 1 naturally emerges in a recurrent network operating at criticality. More importantly, we show that even at the presence of other sources of spike irregularity, being at criticality maximizes the mean coefficient of variation of neurons, thereby maximizing their spike irregularity. Furthermore, we also show that such a maximized irregularity results in maximum correlation between neuronal firing rates and their corresponding spike irregularity (measured in terms of CV. On the one hand, using a model in the universality class of directed percolation, we propose new hallmarks of criticality at single-unit level, which could be applicable to any network of excitable nodes. On the other hand, given the controversy of the neural criticality hypothesis, we discuss the limitation of this approach to neural systems and to what degree they support the criticality hypothesis in real neural networks. Finally

  13. Prediction Approach of Critical Node Based on Multiple Attribute Decision Making for Opportunistic Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qifan Chen

    2016-01-01

    Full Text Available Predicting critical nodes of Opportunistic Sensor Network (OSN can help us not only to improve network performance but also to decrease the cost in network maintenance. However, existing ways of predicting critical nodes in static network are not suitable for OSN. In this paper, the conceptions of critical nodes, region contribution, and cut-vertex in multiregion OSN are defined. We propose an approach to predict critical node for OSN, which is based on multiple attribute decision making (MADM. It takes RC to present the dependence of regions on Ferry nodes. TOPSIS algorithm is employed to find out Ferry node with maximum comprehensive contribution, which is a critical node. The experimental results show that, in different scenarios, this approach can predict the critical nodes of OSN better.

  14. A bridge role metric model for nodes in software networks.

    Directory of Open Access Journals (Sweden)

    Bo Li

    Full Text Available A bridge role metric model is put forward in this paper. Compared with previous metric models, our solution of a large-scale object-oriented software system as a complex network is inherently more realistic. To acquire nodes and links in an undirected network, a new model that presents the crucial connectivity of a module or the hub instead of only centrality as in previous metric models is presented. Two previous metric models are described for comparison. In addition, it is obvious that the fitting curve between the Bre results and degrees can well be fitted by a power law. The model represents many realistic characteristics of actual software structures, and a hydropower simulation system is taken as an example. This paper makes additional contributions to an accurate understanding of module design of software systems and is expected to be beneficial to software engineering practices.

  15. Combination methods for identifying influential nodes in networks

    Science.gov (United States)

    Gao, Chao; Zhong, Lu; Li, Xianghua; Zhang, Zili; Shi, Ning

    2015-11-01

    Identifying influential nodes is of theoretical significance in many domains. Although lots of methods have been proposed to solve this problem, their evaluations are under single-source attack in scale-free networks. Meanwhile, some researches have speculated that the combinations of some methods may achieve more optimal results. In order to evaluate this speculation and design a universal strategy suitable for different types of networks under the consideration of multi-source attacks, this paper proposes an attribute fusion method with two independent strategies to reveal the correlation of existing ranking methods and indicators. One is based on feature union (FU) and the other is based on feature ranking (FR). Two different propagation models in the fields of recommendation system and network immunization are used to simulate the efficiency of our proposed method. Experimental results show that our method can enlarge information spreading and restrain virus propagation in the application of recommendation system and network immunization in different types of networks under the condition of multi-source attacks.

  16. The congestion control algorithm based on queue management of each node in mobile ad hoc networks

    Science.gov (United States)

    Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

    2016-12-01

    This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

  17. Cluster Anti-Synchronization of Complex Networks with Nonidentical Dynamical Nodes

    Directory of Open Access Journals (Sweden)

    Shuguo Wang

    2012-01-01

    Full Text Available This paper investigates a new cluster antisynchronization scheme in the time-varying delays coupled complex dynamical networks with nonidentical nodes. Based on the community structure of the networks, the controllers are designed differently between the nodes in one community that have direct connections to the nodes in other communities and the nodes without direct connections with the nodes in other communities strategy; some sufficient criteria are derived to ensure cluster anti-synchronization of the network model. Particularly, the weight configuration matrix is not assumed to be irreducible. The numerical simulations are performed to verify the effectiveness of the theoretical results.

  18. Distributed Detection of Randomly Located Targets in Mobility-Assisted Sensor Networks with Node Mobility Management

    Directory of Open Access Journals (Sweden)

    Jayaweera SudharmanK

    2010-01-01

    Full Text Available Performance gain achieved by adding mobile nodes to a stationary sensor network for target detection depends on factors such as the number of mobile nodes deployed, mobility patterns, speed and energy constraints of mobile nodes, and the nature of the target locations (deterministic or random. In this paper, we address the problem of distributed detection of a randomly located target by a hybrid sensor network. Specifically, we develop two decision-fusion architectures for detection where in the first one, impact of node mobility is taken into account for decisions updating at the fusion center, while in the second model the impact of node mobility is taken at the node level decision updating. The cost of deploying mobile nodes is analyzed in terms of the minimum fraction of mobile nodes required to achieve the desired performance level within a desired delay constraint. Moreover, we consider managing node mobility under given constraints.

  19. Identifying key nodes based on improved structural holes in complex networks

    Science.gov (United States)

    Yu, Hui; Cao, Xi; Liu, Zun; Li, Yongjun

    2017-11-01

    Identifying key nodes in complex networks is of theoretical and practical significance. Local metrics such as degree centrality is simplest but cannot effectively identify the important bridging nodes. Global metrics such as betweenness and closeness centrality can better identify important nodes, but they are often restricted by the unknown topology and cannot be conveniently applied in large-scale networks. In this paper, we propose an effective ranking method based on an Improved Structural Holes (ISH) to identify the important nodes. ISH method only uses the degree of nodes and the nearest neighborhood information rather than considering the global structure of a network. Our experimental results on five complex networks show that the proposed method can effectively identify the key nodes in complex networks and can also be applied in large-scale or unconnected networks.

  20. A Grooming Nodes Optimal Allocation Method for Multicast in WDM Networks

    Directory of Open Access Journals (Sweden)

    Chengying Wei

    2016-01-01

    Full Text Available The grooming node has the capability of grooming multicast traffic with the small granularity into established light at high cost of complexity and node architecture. In the paper, a grooming nodes optimal allocation (GNOA method is proposed to optimize the allocation of the grooming nodes constraint by the blocking probability for multicast traffic in sparse WDM networks. In the proposed GNOA method, the location of each grooming node is determined by the SCLD strategy. The improved smallest cost largest degree (SCLD strategy is designed to select the nongrooming nodes in the proposed GNOA method. The simulation results show that the proposed GNOA method can reduce the required number of grooming nodes and decrease the cost of constructing a network to guarantee a certain request blocking probability when the wavelengths per fiber and transmitter/receiver ports per node are sufficient for the optical multicast in WDM networks.

  1. Ranking Silent Nodes in Information Networks: A Quantitative Approach and Applications

    Science.gov (United States)

    Interdonato, Roberto; Tagarelli, Andrea

    This paper overviews recent research findings concerning a new challenging problem in information networks, namely identifying and ranking silent nodes. We present three case studies which show how silent nodes' behavior maps to different situations in computer networks, online social networks, and online collaboration networks, and we discuss major benefits in identifying and ranking silent nodes in such networks. We also provide an overview of our proposed approach, which relies on a new eigenvector- centrality graph-based ranking method built on a silent-oriented network model.

  2. Coverage Improvement for Wireless Sensor Networks using Grid Quorum based Node Mobility

    DEFF Research Database (Denmark)

    Mathur, Prateek; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

    2012-01-01

    Coverage of wireless sensor networks (WSNs) is an important quality of service (QoS) metric and often the desired coverage is not attainable at the initial deployment, but node mobility can be used to improve the coverage by relocating sensor nodes. Unconstrained node mobility is considered infea...

  3. Emulation of realistic network traffic patterns on an eight-node data vortex interconnection network subsystem

    Science.gov (United States)

    Small, Benjamin A.; Shacham, Assaf; Bergman, Keren; Athikulwongse, Krit; Hawkins, Cory; Wills, D. Scott

    2004-11-01

    e demonstrate the feasibility of the data vortex interconnection network architecture for use in supercomputing by emulating realistic network traffic on an eight-node subnetwork. The evaluation workload uses memory accesses from the Barnes-Hut application in the SLPASH-2 parallel computing benchmark suite, which was extracted by using the M5 multiprocessor system simulator. We confirm that traffic is routed correctly and efficiently.

  4. Dependency Network Analysis (DEPNA) Reveals Context Related Influence of Brain Network Nodes.

    Science.gov (United States)

    Jacob, Yael; Winetraub, Yonatan; Raz, Gal; Ben-Simon, Eti; Okon-Singer, Hadas; Rosenberg-Katz, Keren; Hendler, Talma; Ben-Jacob, Eshel

    2016-06-07

    Communication between and within brain regions is essential for information processing within functional networks. The current methods to determine the influence of one region on another are either based on temporal resolution, or require a predefined model for the connectivity direction. However these requirements are not always achieved, especially in fMRI studies, which have poor temporal resolution. We thus propose a new graph theory approach that focuses on the correlation influence between selected brain regions, entitled Dependency Network Analysis (DEPNA). Partial correlations are used to quantify the level of influence of each node during task performance. As a proof of concept, we conducted the DEPNA on simulated datasets and on two empirical motor and working memory fMRI tasks. The simulations revealed that the DEPNA correctly captures the network's hierarchy of influence. Applying DEPNA to the functional tasks reveals the dynamics between specific nodes as would be expected from prior knowledge. To conclude, we demonstrate that DEPNA can capture the most influencing nodes in the network, as they emerge during specific cognitive processes. This ability opens a new horizon for example in delineating critical nodes for specific clinical interventions.

  5. Adaptive Connectivity Restoration from Node Failure(s in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Huaiyuan Wang

    2016-09-01

    Full Text Available Recently, there is a growing interest in the applications of wireless sensor networks (WSNs. A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple. Collaborative Single Node Failure Restoration algorithm (CSFR is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s. In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA.

  6. Energy-Aware Topology Evolution Model with Link and Node Deletion in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xiaojuan Luo

    2012-01-01

    Full Text Available Based on the complex network theory, a new topological evolving model is proposed. In the evolution of the topology of sensor networks, the energy-aware mechanism is taken into account, and the phenomenon of change of the link and node in the network is discussed. Theoretical analysis and numerical simulation are conducted to explore the topology characteristics and network performance with different node energy distribution. We find that node energy distribution has the weak effect on the degree distribution P(k that evolves into the scale-free state, nodes with more energy carry more connections, and degree correlation is nontrivial disassortative. Moreover, the results show that, when nodes energy is more heterogeneous, the network is better clustered and enjoys higher performance in terms of the network efficiency and the average path length for transmitting data.

  7. Metabolic network visualization eliminating node redundance and preserving metabolic pathways

    Directory of Open Access Journals (Sweden)

    Sagot Marie-France

    2007-07-01

    Full Text Available Abstract Background The tools that are available to draw and to manipulate the representations of metabolism are usually restricted to metabolic pathways. This limitation becomes problematic when studying processes that span several pathways. The various attempts that have been made to draw genome-scale metabolic networks are confronted with two shortcomings: 1- they do not use contextual information which leads to dense, hard to interpret drawings, 2- they impose to fit to very constrained standards, which implies, in particular, duplicating nodes making topological analysis considerably more difficult. Results We propose a method, called MetaViz, which enables to draw a genome-scale metabolic network and that also takes into account its structuration into pathways. This method consists in two steps: a clustering step which addresses the pathway overlapping problem and a drawing step which consists in drawing the clustered graph and each cluster. Conclusion The method we propose is original and addresses new drawing issues arising from the no-duplication constraint. We do not propose a single drawing but rather several alternative ways of presenting metabolism depending on the pathway on which one wishes to focus. We believe that this provides a valuable tool to explore the pathway structure of metabolism.

  8. Opinion formation driven by PageRank node influence on directed networks

    Science.gov (United States)

    Eom, Young-Ho; Shepelyansky, Dima L.

    2015-10-01

    We study a two states opinion formation model driven by PageRank node influence and report an extensive numerical study on how PageRank affects collective opinion formations in large-scale empirical directed networks. In our model the opinion of a node can be updated by the sum of its neighbor nodes' opinions weighted by the node influence of the neighbor nodes at each step. We consider PageRank probability and its sublinear power as node influence measures and investigate evolution of opinion under various conditions. First, we observe that all networks reach steady state opinion after a certain relaxation time. This time scale is decreasing with the heterogeneity of node influence in the networks. Second, we find that our model shows consensus and non-consensus behavior in steady state depending on types of networks: Web graph, citation network of physics articles, and LiveJournal social network show non-consensus behavior while Wikipedia article network shows consensus behavior. Third, we find that a more heterogeneous influence distribution leads to a more uniform opinion state in the cases of Web graph, Wikipedia, and Livejournal. However, the opposite behavior is observed in the citation network. Finally we identify that a small number of influential nodes can impose their own opinion on significant fraction of other nodes in all considered networks. Our study shows that the effects of heterogeneity of node influence on opinion formation can be significant and suggests further investigations on the interplay between node influence and collective opinion in networks.

  9. Multi-attribute integrated measurement of node importance in complex networks

    Science.gov (United States)

    Wang, Shibo; Zhao, Jinlou

    2015-11-01

    The measure of node importance in complex networks is very important to the research of networks stability and robustness; it also can ensure the security of the whole network. Most researchers have used a single indicator to measure the networks node importance, so that the obtained measurement results only reflect certain aspects of the networks with a loss of information. Meanwhile, because of the difference of networks topology, the nodes' importance should be described by combining the character of the networks topology. Most of the existing evaluation algorithms cannot completely reflect the circumstances of complex networks, so this paper takes into account the degree of centrality, the relative closeness centrality, clustering coefficient, and topology potential and raises an integrated measuring method to measure the nodes' importance. This method can reflect nodes' internal and outside attributes and eliminate the influence of network structure on the node importance. The experiments of karate network and dolphin network show that networks topology structure integrated measure has smaller range of metrical result than a single indicator and more universal. Experiments show that attacking the North American power grid and the Internet network with the method has a faster convergence speed than other methods.

  10. Network architecture design of an agile sensing system with sandwich wireless sensor nodes

    Science.gov (United States)

    Dorvash, S.; Li, X.; Pakzad, S.; Cheng, L.

    2012-04-01

    Wireless sensor network (WSN) is recently emerged as a powerful tool in the structural health monitoring (SHM). Due to the limitations of wireless channel capacity and the heavy data traffic, the control on the network is usually not real time. On the other hand, many SHM applications require quick response when unexpected events, such as earthquake, happen. Realizing the need to have an agile monitoring system, an approach, called sandwich node, was proposed. Sandwich is a design of complex sensor node where two Imote2 nodes are connected with each other to enhance the capabilities of the sensing units. The extra channel and processing power, added into the nodes, enable agile responses of the sensing network, particularly in interrupting the network and altering the undergoing tasks for burst events. This paper presents the design of a testbed for examination of the performance of wireless sandwich nodes in a network. The designed elements of the network are the software architecture of remote and local nodes, and the triggering strategies for coordinating the sensing units. The performance of the designed network is evaluated through its implementation in a monitoring test in the laboratory. For both original Imote2 and the sandwich node, the response time is estimated. The results show that the sandwich node is an efficient solution to the collision issue in existing interrupt approaches and the latency in dense wireless sensor networks.

  11. Node ID based detection of Sybil attack in mobile wireless sensor network

    Science.gov (United States)

    Sharmila, S.; Umamaheswari, G.

    2013-10-01

    Security is the major issue in wireless sensor networks and many defence mechanisms have been developed to secure the network from these alarming attacks by detecting the malicious nodes which hinder the performance of the network. Sybil attack can make the network vulnerable. Sybil attack means a node which illegitimately claims multiple identities. This attack threatens wireless sensor network in routing, voting system, fair resource allocation, data aggregation and misbehaviour detection. Hence, the research is carried out to prevent the Sybil attack and improve the network performance. The node ID-based scheme is proposed, where the detection is based on node registration, consisting of two phases and the assignment of ID to the node is done dynamically. The ID's corresponding to the nodes registered is at the base station and the node active time is monitored, any abnormalities in the above phases confirm the presence of Sybil nodes in the network. The scheme is simulated using NS2. The energy consumed for this algorithm is 2.3 J. The proposed detection scheme is analysed based on the network's PDR and found that the throughput has improved, which prove that this scheme may be used in the environment where security is needed.

  12. Coupling effect of nodes popularity and similarity on social network persistence.

    Science.gov (United States)

    Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

    2017-02-21

    Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes' popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

  13. Building WDM wide area resilient transport network from 4-node semi-mesh and mesh sub-networks

    DEFF Research Database (Denmark)

    Limal, Emmanuel; Mikkelsen, Benny; Stubkjær, Kristian

    1997-01-01

    This paper deals with optical transport network design using wavelength division multiplexing (WDM) facilities. It proposes a method for building networks from sub-network combinations. Two types of 4-node sub-networks and their properties are presented. For each sub-network, any fiber break can...... be recovered using re-routing paths. A European network set-up illustrates the method capabilities. The network has 19 nodes connected through 39 links distributed within 9 semi-mesh sub-networks. Comparison is made between local and non-local re-routing and between channel capacities of 2.5 and 10 Gb...

  14. Identifying and characterizing key nodes among communities based on electrical-circuit networks.

    Directory of Open Access Journals (Sweden)

    Fenghui Zhu

    Full Text Available Complex networks with community structures are ubiquitous in the real world. Despite many approaches developed for detecting communities, we continue to lack tools for identifying overlapping and bridging nodes that play crucial roles in the interactions and communications among communities in complex networks. Here we develop an algorithm based on the local flow conservation to effectively and efficiently identify and distinguish the two types of nodes. Our method is applicable in both undirected and directed networks without a priori knowledge of the community structure. Our method bypasses the extremely challenging problem of partitioning communities in the presence of overlapping nodes that may belong to multiple communities. Due to the fact that overlapping and bridging nodes are of paramount importance in maintaining the function of many social and biological networks, our tools open new avenues towards understanding and controlling real complex networks with communities accompanied with the key nodes.

  15. Identifying and characterizing key nodes among communities based on electrical-circuit networks.

    Science.gov (United States)

    Zhu, Fenghui; Wang, Wenxu; Di, Zengru; Fan, Ying

    2014-01-01

    Complex networks with community structures are ubiquitous in the real world. Despite many approaches developed for detecting communities, we continue to lack tools for identifying overlapping and bridging nodes that play crucial roles in the interactions and communications among communities in complex networks. Here we develop an algorithm based on the local flow conservation to effectively and efficiently identify and distinguish the two types of nodes. Our method is applicable in both undirected and directed networks without a priori knowledge of the community structure. Our method bypasses the extremely challenging problem of partitioning communities in the presence of overlapping nodes that may belong to multiple communities. Due to the fact that overlapping and bridging nodes are of paramount importance in maintaining the function of many social and biological networks, our tools open new avenues towards understanding and controlling real complex networks with communities accompanied with the key nodes.

  16. An Optimized Hidden Node Detection Paradigm for Improving the Coverage and Network Efficiency in Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Adwan Alanazi

    2016-09-01

    Full Text Available Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node– continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2. The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches.

  17. An Optimized Hidden Node Detection Paradigm for Improving the Coverage and Network Efficiency in Wireless Multimedia Sensor Networks

    Science.gov (United States)

    Alanazi, Adwan; Elleithy, Khaled

    2016-01-01

    Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node– continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches. PMID:27618048

  18. Node Self-Deployment Algorithm Based on an Uneven Cluster with Radius Adjusting for Underwater Sensor Networks.

    Science.gov (United States)

    Jiang, Peng; Xu, Yiming; Wu, Feng

    2016-01-14

    Existing move-restricted node self-deployment algorithms are based on a fixed node communication radius, evaluate the performance based on network coverage or the connectivity rate and do not consider the number of nodes near the sink node and the energy consumption distribution of the network topology, thereby degrading network reliability and the energy consumption balance. Therefore, we propose a distributed underwater node self-deployment algorithm. First, each node begins the uneven clustering based on the distance on the water surface. Each cluster head node selects its next-hop node to synchronously construct a connected path to the sink node. Second, the cluster head node adjusts its depth while maintaining the layout formed by the uneven clustering and then adjusts the positions of in-cluster nodes. The algorithm originally considers the network reliability and energy consumption balance during node deployment and considers the coverage redundancy rate of all positions that a node may reach during the node position adjustment. Simulation results show, compared to the connected dominating set (CDS) based depth computation algorithm, that the proposed algorithm can increase the number of the nodes near the sink node and improve network reliability while guaranteeing the network connectivity rate. Moreover, it can balance energy consumption during network operation, further improve network coverage rate and reduce energy consumption.

  19. Node Self-Deployment Algorithm Based on an Uneven Cluster with Radius Adjusting for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng Jiang

    2016-01-01

    Full Text Available Existing move-restricted node self-deployment algorithms are based on a fixed node communication radius, evaluate the performance based on network coverage or the connectivity rate and do not consider the number of nodes near the sink node and the energy consumption distribution of the network topology, thereby degrading network reliability and the energy consumption balance. Therefore, we propose a distributed underwater node self-deployment algorithm. First, each node begins the uneven clustering based on the distance on the water surface. Each cluster head node selects its next-hop node to synchronously construct a connected path to the sink node. Second, the cluster head node adjusts its depth while maintaining the layout formed by the uneven clustering and then adjusts the positions of in-cluster nodes. The algorithm originally considers the network reliability and energy consumption balance during node deployment and considers the coverage redundancy rate of all positions that a node may reach during the node position adjustment. Simulation results show, compared to the connected dominating set (CDS based depth computation algorithm, that the proposed algorithm can increase the number of the nodes near the sink node and improve network reliability while guaranteeing the network connectivity rate. Moreover, it can balance energy consumption during network operation, further improve network coverage rate and reduce energy consumption.

  20. Switching behavior of droplets crossing nodes on a fiber network.

    Science.gov (United States)

    Weyer, F; Duchesne, A; Vandewalle, N

    2017-10-17

    Lately, curious structures have been erected in arid regions: they are large nets able to catch water from fog. Tiny droplets condense on the mesh and are collected on the bottom of it. This innovative technology is crucial to obtain drinkable water in these inhospitable areas. Many studies aim to understand the behavior of droplets trapped on this entanglement of fibers. However, the motion of a droplet sliding on a network of inclined fibers and encountering several crossings when going down remains an open question. Here, we look at the path chosen by such a drop and, especially, we analyze its behavior at the different nodes of the array. We show that droplets may change from one fiber to another one depending on the slope and the diameter of these fibers. We prove that we can force a droplet to follow a specific path simply by carefully designing the fiber mesh. These findings are expected to provide a very convenient way to manipulate small droplets in applications from microfluidics to fog harvesting.

  1. A family of algorithms for computing consensus about node state from network data.

    Directory of Open Access Journals (Sweden)

    Eleanor R Brush

    Full Text Available Biological and social networks are composed of heterogeneous nodes that contribute differentially to network structure and function. A number of algorithms have been developed to measure this variation. These algorithms have proven useful for applications that require assigning scores to individual nodes-from ranking websites to determining critical species in ecosystems-yet the mechanistic basis for why they produce good rankings remains poorly understood. We show that a unifying property of these algorithms is that they quantify consensus in the network about a node's state or capacity to perform a function. The algorithms capture consensus by either taking into account the number of a target node's direct connections, and, when the edges are weighted, the uniformity of its weighted in-degree distribution (breadth, or by measuring net flow into a target node (depth. Using data from communication, social, and biological networks we find that that how an algorithm measures consensus-through breadth or depth- impacts its ability to correctly score nodes. We also observe variation in sensitivity to source biases in interaction/adjacency matrices: errors arising from systematic error at the node level or direct manipulation of network connectivity by nodes. Our results indicate that the breadth algorithms, which are derived from information theory, correctly score nodes (assessed using independent data and are robust to errors. However, in cases where nodes "form opinions" about other nodes using indirect information, like reputation, depth algorithms, like Eigenvector Centrality, are required. One caveat is that Eigenvector Centrality is not robust to error unless the network is transitive or assortative. In these cases the network structure allows the depth algorithms to effectively capture breadth as well as depth. Finally, we discuss the algorithms' cognitive and computational demands. This is an important consideration in systems in which

  2. Contextualized Network Analysis: Theory and Methods for Networks with Node Covariates

    Science.gov (United States)

    Binkiewicz, Norbert M.

    Biological and social systems consist of myriad interacting units. The interactions can be intuitively represented in the form of a graph or network. Measurements of these graphs can reveal the underlying structure of these interactions, which provides insight into the systems that generated the graphs. Moreover, in applications such as neuroconnectomics, social networks, and genomics, graph data is accompanied by contextualizing measures on each node. We leverage these node covariates to help uncover latent communities, using a modification of spectral clustering. Statistical guarantees are provided under a joint mixture model called the node contextualized stochastic blockmodel, including a bound on the mis-clustering rate. For most simulated conditions, covariate assisted spectral clustering yields superior results relative to both regularized spectral clustering without node covariates and an adaptation of canonical correlation analysis. We apply covariate assisted spectral clustering to large brain graphs derived from diffusion MRI, using the node locations or neurological regions as covariates. In both cases, covariate assisted spectral clustering yields clusters that are easier to interpret neurologically. A low rank update algorithm is developed to reduce the computational cost of determining the tuning parameter for covariate assisted spectral clustering. As simulations demonstrate, the low rank update algorithm increases the speed of covariate assisted spectral clustering up to ten-fold, while practically matching the clustering performance of the standard algorithm. Graphs with node attributes are sometimes accompanied by ground truth labels that align closely with the latent communities in the graph. We consider the example of a mouse retina neuron network accompanied by the neuron spatial location and neuronal cell types. In this example, the neuronal cell type is considered a ground truth label. Current approaches for defining neuronal cell type vary

  3. Cluster Head Selection in a Homogeneous Wireless Sensor Network Ensuring Full Connectivity with Minimum Isolated Nodes

    Directory of Open Access Journals (Sweden)

    Tapan Kumar Jain

    2014-01-01

    Full Text Available The research work proposes a cluster head selection algorithm for a wireless sensor network. A node can be a cluster head if it is connected to at least one unique neighbor node where the unique neighbor is the one that is not connected to any other node. If there is no connected unique node then the CH is selected on the basis of residual energy and the number of neighbor nodes. With the increase in number of clusters, the processing energy of the network increases; hence, this algorithm proposes minimum number of clusters which further leads to increased network lifetime. The major novel contribution of the proposed work is an algorithm that ensures a completely connected network with minimum number of isolated nodes. An isolated node will remain only if it is not within the transmission range of any other node. With the maximum connectivity, the coverage of the network is automatically maximized. The superiority of the proposed design is verified by simulation results done in MATLAB, where it clearly depicts that the total numbers of rounds before the network dies out are maximum compared to other existing protocols.

  4. Coupling effect of nodes popularity and similarity on social network persistence

    Science.gov (United States)

    Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

    2017-02-01

    Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

  5. Multi-index algorithm of identifying important nodes in complex networks based on linear discriminant analysis

    Science.gov (United States)

    Hu, Fang; Liu, Yuhua

    2015-02-01

    The evaluation of node importance has great significance to complex network, so it is important to seek and protect important nodes to ensure the security and stability of the entire network. At present, most evaluation algorithms of node importance adopt the single-index methods, which are incomplete and limited, and cannot fully reflect the complex situation of network. In this paper, after synthesizing multi-index factors of node importance, including eigenvector centrality, betweenness centrality, closeness centrality, degree centrality, mutual-information, etc., the authors are proposing a new multi-index evaluation algorithm of identifying important nodes in complex networks based on linear discriminant analysis (LDA). In order to verify the validity of this algorithm, a series of simulation experiments have been done. Through comprehensive analysis, the simulation results show that the new algorithm is more rational, effective, integral and accurate.

  6. Impact of hierarchical modular structure on ranking of individual nodes in directed networks

    Energy Technology Data Exchange (ETDEWEB)

    Masuda, Naoki [Graduate School of Information Science and Technology, University of Tokyo, 7-3-1 Hongo, Bunkyo, Tokyo 113-8656 (Japan); Kawamura, Yoji [Institute for Research on Earth Evolution, Japan Agency for Marine-Earth Science and Technology, 3173-25 Showa-machi, Kanazawa-ku, Yokohama, Kanagawa 236-0001 (Japan); Kori, Hiroshi [PRESTO, Japan Science and Technology Agency, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012 (Japan)], E-mail: masuda@mist.i.u-tokyo.ac.jp

    2009-11-15

    Many systems, ranging from biological and engineering systems to social systems, can be modeled as directed networks, with links representing directed interaction between two nodes. To assess the importance of a node in a directed network, various centrality measures based on different criteria have been proposed. However, calculating the centrality of a node is often difficult because of the overwhelming size of the network or because the information held about the network is incomplete. Thus, developing an approximation method for estimating centrality measures is needed. In this study, we focus on modular networks; many real-world networks are composed of modules, where connection is dense within a module and sparse across different modules. We show that ranking-type centrality measures, including the PageRank, can be efficiently estimated once the modular structure of a network is extracted. We develop an analytical method to evaluate the centrality of nodes by combining the local property (i.e. indegree and outdegree of nodes) and the global property (i.e. centrality of modules). The proposed method is corroborated by real data. Our results provide a linkage between the ranking-type centrality values of modules and those of individual nodes. They also reveal the hierarchical structure of networks in the sense of subordination (not nestedness) laid out by connectivity among modules of different relative importance. The present study raises a novel motive for identifying modules in networks.

  7. A Family of Algorithms for Computing Consensus about Node State from Network Data

    Science.gov (United States)

    Brush, Eleanor R.; Krakauer, David C.; Flack, Jessica C.

    2013-01-01

    Biological and social networks are composed of heterogeneous nodes that contribute differentially to network structure and function. A number of algorithms have been developed to measure this variation. These algorithms have proven useful for applications that require assigning scores to individual nodes–from ranking websites to determining critical species in ecosystems–yet the mechanistic basis for why they produce good rankings remains poorly understood. We show that a unifying property of these algorithms is that they quantify consensus in the network about a node's state or capacity to perform a function. The algorithms capture consensus by either taking into account the number of a target node's direct connections, and, when the edges are weighted, the uniformity of its weighted in-degree distribution (breadth), or by measuring net flow into a target node (depth). Using data from communication, social, and biological networks we find that that how an algorithm measures consensus–through breadth or depth– impacts its ability to correctly score nodes. We also observe variation in sensitivity to source biases in interaction/adjacency matrices: errors arising from systematic error at the node level or direct manipulation of network connectivity by nodes. Our results indicate that the breadth algorithms, which are derived from information theory, correctly score nodes (assessed using independent data) and are robust to errors. However, in cases where nodes “form opinions” about other nodes using indirect information, like reputation, depth algorithms, like Eigenvector Centrality, are required. One caveat is that Eigenvector Centrality is not robust to error unless the network is transitive or assortative. In these cases the network structure allows the depth algorithms to effectively capture breadth as well as depth. Finally, we discuss the algorithms' cognitive and computational demands. This is an important consideration in systems in which

  8. Node deployment algorithm based on viscous fluid model for wireless sensor networks.

    Science.gov (United States)

    Chen, Jiguang; Qian, Huanyan

    2014-01-01

    With the scale expands, traditional deployment algorithms are becoming increasingly complicated than before, which are no longer fit for sensor networks. In order to reduce the complexity, we propose a node deployment algorithm based on viscous fluid model. In wireless sensor networks, sensor nodes are abstracted as fluid particles. Similar to the diffusion and self-propagation behavior of fluid particles, sensor nodes realize deployment in unknown region following the motion rules of fluid. Simulation results show that our algorithm archives good coverage rate and homogeneity in large-scale sensor networks.

  9. Node Deployment Algorithm Based on Connected Tree for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng Jiang

    2015-07-01

    Full Text Available Designing an efficient deployment method to guarantee optimal monitoring quality is one of the key topics in underwater sensor networks. At present, a realistic approach of deployment involves adjusting the depths of nodes in water. One of the typical algorithms used in such process is the self-deployment depth adjustment algorithm (SDDA. This algorithm mainly focuses on maximizing network coverage by constantly adjusting node depths to reduce coverage overlaps between two neighboring nodes, and thus, achieves good performance. However, the connectivity performance of SDDA is irresolute. In this paper, we propose a depth adjustment algorithm based on connected tree (CTDA. In CTDA, the sink node is used as the first root node to start building a connected tree. Finally, the network can be organized as a forest to maintain network connectivity. Coverage overlaps between the parent node and the child node are then reduced within each sub-tree to optimize coverage. The hierarchical strategy is used to adjust the distance between the parent node and the child node to reduce node movement. Furthermore, the silent mode is adopted to reduce communication cost. Simulations show that compared with SDDA, CTDA can achieve high connectivity with various communication ranges and different numbers of nodes. Moreover, it can realize coverage as high as that of SDDA with various sensing ranges and numbers of nodes but with less energy consumption. Simulations under sparse environments show that the connectivity and energy consumption performances of CTDA are considerably better than those of SDDA. Meanwhile, the connectivity and coverage performances of CTDA are close to those depth adjustment algorithms base on connected dominating set (CDA, which is an algorithm similar to CTDA. However, the energy consumption of CTDA is less than that of CDA, particularly in sparse underwater environments.

  10. Energy Consumption Evaluation for Wireless Sensor Network Nodes Based on Queuing Petri Net

    OpenAIRE

    Li, J.; Zhou, H. Y.; D. C. Zuo; Hou, K. M.; Xie, H. P.; Zhou, P.

    2014-01-01

    Due to the large scale of wireless sensor networks (WSN) and the huge density of WSN nodes, classical performance evaluation techniques face new challenges in view of the complexity and diversity in WSN applications. This paper presents a “state-event-transition” formal description for WSN nodes and proposes an event-driven QPN-based modeling technique to simulate the energy behaviors of nodes. Besides, the framework architecture of a dedicated energy evaluation platform has been introduced, ...

  11. In-Network Processing on Low-Cost IOT Nodes for Maritime Surveillance

    Science.gov (United States)

    2017-03-01

    PROCESSING ON LOW-COST IOT NODES FOR MARITIME SURVEILLANCE by Andrew R. Belding March 2017 Thesis Advisor: Gurminder Singh Co-Advisor: John H...DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE IN-NETWORK PROCESSING ON LOW-COST IOT NODES FOR MARITIME SURVEILLANCE 5. FUNDING NUMBERS 6...PROCESSING ON LOW-COST IOT NODES FOR MARITIME SURVEILLANCE Andrew R. Belding Lieutenant Commander, United States Navy B.S., United States Naval

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

    Science.gov (United States)

    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.

  13. Identifying influential nodes based on graph signal processing in complex networks

    Science.gov (United States)

    Zhao, Jia; Yu, Li; Li, Jing-Ru; Zhou, Peng

    2015-05-01

    Identifying influential nodes in complex networks is of both theoretical and practical importance. Existing methods identify influential nodes based on their positions in the network and assume that the nodes are homogeneous. However, node heterogeneity (i.e., different attributes such as interest, energy, age, and so on) ubiquitously exists and needs to be taken into consideration. In this paper, we conduct an investigation into node attributes and propose a graph signal processing based centrality (GSPC) method to identify influential nodes considering both the node attributes and the network topology. We first evaluate our GSPC method using two real-world datasets. The results show that our GSPC method effectively identifies influential nodes, which correspond well with the underlying ground truth. This is compatible to the previous eigenvector centrality and principal component centrality methods under circumstances where the nodes are homogeneous. In addition, spreading analysis shows that the GSPC method has a positive effect on the spreading dynamics. Project supported by the National Natural Science Foundation of China (Grant No. 61231010) and the Fundamental Research Funds for the Central Universities, China (Grant No. HUST No. 2012QN076).

  14. Effects of maximum node degree on computer virus spreading in scale-free networks

    Science.gov (United States)

    Bamaarouf, O.; Ould Baba, A.; Lamzabi, S.; Rachadi, A.; Ez-Zahraouy, H.

    2017-10-01

    The increase of the use of the Internet networks favors the spread of viruses. In this paper, we studied the spread of viruses in the scale-free network with different topologies based on the Susceptible-Infected-External (SIE) model. It is found that the network structure influences the virus spreading. We have shown also that the nodes of high degree are more susceptible to infection than others. Furthermore, we have determined a critical maximum value of node degree (Kc), below which the network is more resistible and the computer virus cannot expand into the whole network. The influence of network size is also studied. We found that the network with low size is more effective to reduce the proportion of infected nodes.

  15. Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks.

    Directory of Open Access Journals (Sweden)

    Mahendra Piraveenan

    Full Text Available A number of centrality measures are available to determine the relative importance of a node in a complex network, and betweenness is prominent among them. However, the existing centrality measures are not adequate in network percolation scenarios (such as during infection transmission in a social network of individuals, spreading of computer viruses on computer networks, or transmission of disease over a network of towns because they do not account for the changing percolation states of individual nodes. We propose a new measure, percolation centrality, that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states. The measure can be extended to include random walk based definitions, and its computational complexity is shown to be of the same order as that of betweenness centrality. We demonstrate the usage of percolation centrality by applying it to a canonical network as well as simulated and real world scale-free and random networks.

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

    Science.gov (United States)

    Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

    2016-04-01

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

  17. Improved Relay Node Placement Algorithm for Wireless Sensor Networks Application in Wind Farm

    DEFF Research Database (Denmark)

    Chen, Qinyin; Hu, Y.; Chen, Zhe

    2013-01-01

    An emergent application of Wireless Sensor Network (WSN) technology is in the area of Wind Farm Monitoring (WFM), in which relays are used to connect sensors. Key problems to solve in WFM include how to balance loads across relay nodes and how to place relay nodes for redundancy and fault...

  18. An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Amir Khan

    2014-01-01

    Full Text Available Recently, wireless sensor network (WSN applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results.

  19. An energy efficient simultaneous-node repositioning algorithm for mobile sensor networks.

    Science.gov (United States)

    Khan, Muhammad Amir; Hasbullah, Halabi; Nazir, Babar; Khan, Imran Ali

    2014-01-01

    Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results.

  20. Distribution of shortest path lengths in a class of node duplication network models

    Science.gov (United States)

    Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

    2017-09-01

    We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

  1. Quantitative methods of identifying the key nodes in the illegal wildlife trade network.

    Science.gov (United States)

    Patel, Nikkita Gunvant; Rorres, Chris; Joly, Damien O; Brownstein, John S; Boston, Ray; Levy, Michael Z; Smith, Gary

    2015-06-30

    Innovative approaches are needed to combat the illegal trade in wildlife. Here, we used network analysis and a new database, HealthMap Wildlife Trade, to identify the key nodes (countries) that support the illegal wildlife trade. We identified key exporters and importers from the number of shipments a country sent and received and from the number of connections a country had to other countries over a given time period. We used flow betweenness centrality measurements to identify key intermediary countries. We found the set of nodes whose removal from the network would cause the maximum disruption to the network. Selecting six nodes would fragment 89.5% of the network for elephants, 92.3% for rhinoceros, and 98.1% for tigers. We then found sets of nodes that would best disseminate an educational message via direct connections through the network. We would need to select 18 nodes to reach 100% of the elephant trade network, 16 nodes for rhinoceros, and 10 for tigers. Although the choice of locations for interventions should be customized for the animal and the goal of the intervention, China was the most frequently selected country for network fragmentation and information dissemination. Identification of key countries will help strategize illegal wildlife trade interventions.

  2. A Nup133-dependent NPC-anchored network tethers centrosomes to the nuclear envelope in prophase.

    Science.gov (United States)

    Bolhy, Stéphanie; Bouhlel, Imène; Dultz, Elisa; Nayak, Tania; Zuccolo, Michela; Gatti, Xavier; Vallee, Richard; Ellenberg, Jan; Doye, Valérie

    2011-03-07

    Centrosomes are closely associated with the nuclear envelope (NE) throughout the cell cycle and this association is maintained in prophase when they separate to establish the future mitotic spindle. At this stage, the kinetochore constituents CENP-F, NudE, NudEL, dynein, and dynactin accumulate at the NE. We demonstrate here that the N-terminal domain of the nuclear pore complex (NPC) protein Nup133, although largely dispensable for NPC assembly, is required for efficient anchoring of the dynein/dynactin complex to the NE in prophase. Nup133 exerts this function through an interaction network via CENP-F and NudE/EL. We show that this molecular chain is critical for maintaining centrosome association with the NE at mitotic entry and contributes to this process without interfering with the previously described RanBP2-BICD2-dependent pathway of centrosome anchoring. Finally, our study reveals that tethering of centrosomes to the nuclear surface at the G2/M transition contributes, along with other cellular mechanisms, to early stages of bipolar spindle assembly.

  3. Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Saoucene Mahfoudh

    2010-08-01

    Full Text Available Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

  4. Jasmonate Signalling Network in Arabidopsis thaliana: Crucial Regulatory Nodes and New Physiological Scenarios

    National Research Council Canada - National Science Library

    Virginia Balbi; Alessandra Devoto

    2008-01-01

    .... In this review, we focus on the latest published work on jasmonate (JA) signalling components and new regulatory nodes in the transcriptional network that regulates a number of diverse plant responses to developmental and environmental cues...

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

    Science.gov (United States)

    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.

  6. Macroscopic description of complex adaptive networks co-evolving with dynamic node states

    CERN Document Server

    Wiedermann, Marc; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

    2015-01-01

    In many real-world complex systems, the time-evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here, we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the co-evolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we show that in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability play a crucial role for the sustainability of the system's equilibrium state. We derive a macroscopic description of the system which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network and is applicable to many fields of study, such as epidemic spreading or social modeling.

  7. DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for LossyWireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jaewan Seo

    2010-03-01

    Full Text Available Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

  8. Key node selection in minimum-cost control of complex networks

    Science.gov (United States)

    Ding, Jie; Wen, Changyun; Li, Guoqi

    2017-11-01

    Finding the key node set that is connected with a given number of external control sources for driving complex networks from initial state to any predefined state with minimum cost, known as minimum-cost control problem, is critically important but remains largely open. By defining an importance index for each node, we propose revisited projected gradient method extension (R-PGME) in Monte-Carlo scenario to determine key node set. It is found that the importance index of a node is strongly correlated to occurrence rate of that node to be selected as a key node in Monte-Carlo realizations for three elementary topologies, Erdős-Rényi and scale-free networks. We also discover the distribution patterns of key nodes when the control cost reaches its minimum. Specifically, the importance indices of all nodes in an elementary stem show a quasi-periodic distribution with high peak values in the beginning and end of a quasi-period while they approach to a uniform distribution in an elementary cycle. We further point out that an elementary dilation can be regarded as two elementary stems whose lengths are the closest, and the importance indices in each stem present similar distribution as in an elementary stem. Our results provide a better understanding and deep insight of locating the key nodes in different topologies with minimum control cost.

  9. NASA's International Lunar Network Anchor Nodes and Robotic Lunar Lander Project Update

    Science.gov (United States)

    Cohen, Barbara A.; Bassler, Julie A.; Ballard, Benjamin; Chavers, Greg; Eng, Doug S.; Hammond, Monica S.; Hill, Larry A.; Harris, Danny W.; Hollaway, Todd A.; Kubota, Sanae; hide

    2010-01-01

    NASA Marshall Space Flight Center and The Johns Hopkins University Applied Physics Laboratory have been conducting mission studies and performing risk reduction activities for NASA's robotic lunar lander flight projects. Additional mission studies have been conducted to support other objectives of the lunar science and exploration community and extensive risk reduction design and testing has been performed to advance the design of the lander system and reduce development risk for flight projects.

  10. k-CONNECTED HYBRID RELAY NODE PLACEMENT IN WIRELESS SENSOR NETWORK FOR RESTORING CONNECTIVITY

    Directory of Open Access Journals (Sweden)

    Vijayvignesh Selvaraj

    2014-06-01

    Full Text Available Wireless Sensor Network (WSN consists of a number of sensor nodes for monitoring the environment. Scenario like floods, volcanic eruptions, earthquakes, tsunamis, avalanches, hailstorms and blizzards causes the sensor nodes to be damaged. In such worst case scenario, the deployed nodes in the monitoring area may split up into several segments. As a result sensor nodes in the network cannot communicate with each other due to partitions. Our algorithm investigates a strategy for restoring such kind of damage through either placement of Relay Nodes (RN’s or repositioning the existing nodes in the network. Unlike traditional schemes like minimum spanning tree, our proposed approach generates a different topology called as spider web. In this approach, both stationary and mobile relay nodes are used. Thus we are making our topology as a hybrid one. Though the numbers of relay nodes are increased, the robust connectivity and the balanced traffic load can be ensured. The validation of the proposed approach has been simulated and verified by QualNet Developer 5.0.2.

  11. Fluid-flow modeling of a relay node in an IEEE 802.11 wireless ad-hoc network

    NARCIS (Netherlands)

    Roijers, F.; Berg, J.L. van den; Mandjes, M.

    2007-01-01

    Wireless ad-hoc networks are based on shared medium technology where the nodes arrange access to the medium in a distributed way independent of their current traffic demand. This has the inherent drawback that a node that serves as a relay node for transmissions of multiple neighboring nodes is

  12. Effect of node attributes on the temporal dynamics of network structure

    Science.gov (United States)

    Momeni, Naghmeh; Fotouhi, Babak

    2017-03-01

    Many natural and social networks evolve in time and their structures are dynamic. In most networks, nodes are heterogeneous, and their roles in the evolution of structure differ. This paper focuses on the role of individual attributes on the temporal dynamics of network structure. We focus on a basic model for growing networks that incorporates node attributes (which we call "quality"), and we focus on the problem of forecasting the structural properties of the network in arbitrary times for an arbitrary initial network. That is, we address the following question: If we are given a certain initial network with given arbitrary structure and known node attributes, then how does the structure change in time as new nodes with given distribution of attributes join the network? We solve the model analytically and obtain the quality-degree joint distribution and degree correlations. We characterize the role of individual attributes in the position of individual nodes in the hierarchy of connections. We confirm the theoretical findings with Monte Carlo simulations.

  13. FemtoNode: Reconfigurable and Customizable Architecture for Wireless Sensor Networks

    Science.gov (United States)

    Allgayer, Rodrigo Schmidt; Götz, Marcelo; Pereira, Carlos Eduardo

    With the growth and the development of new applications for Wireless Sensor Networks (WSN), sensor nodes are able to handle more complex events that require higher processing performance and hardware flexibility. These new features intend to meet the requirements of various applications, as well as to provide customized platforms that have only the needed resources. WSNs often need a flexible architecture able to adapt to design and environment changes. The use of reconfigurable architectures is an alternative to bring more flexibility and more processing capability for the sensor node. This paper proposes a reconfigurable and customizable sensor node called FemtoNode which has a reconfigurable platform and a wireless module to support applications for WSNs, using an object-oriented language Java as specification language of its architecture. The proposed concepts were validated with a case study of an heterogeneous wireless sensor network composed of sensors nodes based on different platforms, whose results are described in this work.

  14. A Survey on Node Clustering in Cognitive Radio Wireless Sensor Networks.

    Science.gov (United States)

    Joshi, Gyanendra Prasad; Kim, Sung Won

    2016-09-10

    Cognitive radio wireless sensor networks (CR-WSNs) have attracted a great deal of attention recently due to the emerging spectrum scarcity issue. This work attempts to provide a detailed analysis of the role of node clustering in CR-WSNs. We outline the objectives, requirements, and advantages of node clustering in CR-WSNs. We describe how a CR-WSN with node clustering differs from conventional wireless sensor networks, and we discuss its characteristics, architecture, and topologies. We survey the existing clustering algorithms and compare their objectives and features. We suggest how clustering issues and challenges can be handled.

  15. Node making process in network meta-analysis of non-pharmacological treatment are poorly reported.

    Science.gov (United States)

    James, Arthur; Yavchitz, Amélie; Ravaud, Philippe; Boutron, Isabelle

    2017-11-28

    Identify methods to support the node-making process in network meta-analyses (NMAs) of non-pharmacological treatments. We proceeded in two stages. First, we conducted a literature review of guidelines and methodological articles about NMAs to identify methods proposed to lump interventions into nodes. Second, we conducted a systematic review of NMAs of non-pharmacological treatments to extract methods used by authors to support their node-making process. MEDLINE and Google Scholar were searched to identify articles assessing NMA guidelines or methodology intended for NMA authors. MEDLINE, CENTRAL and EMBASE were searched to identify reports of NMAs including at least one non-pharmacological treatment. Both searches involved articles available from database inception to March 2016. From the methodological review, we identified and extracted methods proposed to lump interventions into nodes. From the systematic review, the reporting of the network was assessed as long as the method described supported the node-making process. Among the 116 articles retrieved in the literature review, 12 (10%) discussed the concept of lumping or splitting interventions in NMAs. No consensual method was identified during the methodological review, and expert consensus was the only method proposed to support the node-making process. Among 5187 references for the systematic review, we included 110 reports of NMAs published between 2007 and 2016. The nodes were described in the introduction section of 88 reports (80%), which suggested that the node content might have been a priori decided before the systematic review. Nine reports (8.1%) described a specific process or justification to build nodes for the network. Two methods were identified: 1) fit a previously published classification and 2) expert consensus. Despite the importance of NMA in the delivery of evidence when several interventions are available for a single indication, recommendations on the reporting of the node

  16. A bio-inspired methodology of identifying influential nodes in complex networks.

    Directory of Open Access Journals (Sweden)

    Cai Gao

    Full Text Available How to identify influential nodes is a key issue in complex networks. The degree centrality is simple, but is incapable to reflect the global characteristics of networks. Betweenness centrality and closeness centrality do not consider the location of nodes in the networks, and semi-local centrality, leaderRank and pageRank approaches can be only applied in unweighted networks. In this paper, a bio-inspired centrality measure model is proposed, which combines the Physarum centrality with the K-shell index obtained by K-shell decomposition analysis, to identify influential nodes in weighted networks. Then, we use the Susceptible-Infected (SI model to evaluate the performance. Examples and applications are given to demonstrate the adaptivity and efficiency of the proposed method. In addition, the results are compared with existing methods.

  17. Research on backbone node deployment for Wireless Mesh Networks in dynamic environments

    Science.gov (United States)

    Li, Meiyi; Cao, Shengling

    2017-08-01

    Wireless Mesh Network is a type of wireless networks in which demands of bandwidth for users has mobility. The backbone node placement of wireless mesh networks in a dynamic scenario is investigated, and the TSDPSO algorithm is used to adapt the dynamic environment, which updates node deployment location to adapt to changes in demand if it detects environmental changes at the beginning of the cycle time. In order to meet the demands of bandwidth for users and network connectivity, particle swarm optimization algorithm is employed to select the gateway location, then nodes to the backbone network is added constantly until all requirement is covered. The experimental results show that algorithm could get effective solution in dynamic environment.

  18. Efficient MAC Protocol for Hybrid Wireless Network with Heterogeneous Sensor Nodes

    Directory of Open Access Journals (Sweden)

    Md. Nasre Alam

    2016-01-01

    Full Text Available Although several Directional Medium Access Control (DMAC protocols have been designed for use with homogeneous networks, it can take a substantial amount of time to change sensor nodes that are equipped with an omnidirectional antenna for sensor nodes with a directional antenna. Thus, we require a novel MAC protocol for use with an intermediate wireless network that consists of heterogeneous sensor nodes equipped with either an omnidirectional antenna or a directional antenna. The MAC protocols that have been designed for use in homogeneous networks are not suitable for use in a hybrid network due to deaf, hidden, and exposed nodes. Therefore, we propose a MAC protocol that exploits the characteristics of a directional antenna and can also work efficiently with omnidirectional nodes in a hybrid network. In order to address the deaf, hidden, and exposed node problems, we define RTS/CTS for the neighbor (RTSN/CTSN and Neighbor Information (NIP packets. The performance of the proposed MAC protocol is evaluated through a numerical analysis using a Markov model. In addition, the analytical results of the MAC protocol are verified through an OPNET simulation.

  19. Redirecting a client device from a first gateway to a second gateway for accessing a network node function

    NARCIS (Netherlands)

    Strijkers, R.J.; Norp, A.H.J.

    2014-01-01

    The present invention enables a network operator to select a gateway that provides desirable operational parameters to access a network node function in a network node requested by a client. A network service provider detects what service a client device is requesting or using and selects a gateway

  20. Self-organization of nodes in mobile ad hoc networks using evolutionary games and genetic algorithms

    Directory of Open Access Journals (Sweden)

    Janusz Kusyk

    2011-07-01

    Full Text Available In this paper, we present a distributed and scalable evolutionary game played by autonomous mobile ad hoc network (MANET nodes to place themselves uniformly over a dynamically changing environment without a centralized controller. A node spreading evolutionary game, called NSEG, runs at each mobile node, autonomously makes movement decisions based on localized data while the movement probabilities of possible next locations are assigned by a forced-based genetic algorithm (FGA. Because FGA takes only into account the current position of the neighboring nodes, our NSEG, combining FGA with game theory, can find better locations. In NSEG, autonomous node movement decisions are based on the outcome of the locally run FGA and the spatial game set up among it and the nodes in its neighborhood. NSEG is a good candidate for the node spreading class of applications used in both military tasks and commercial applications. We present a formal analysis of our NSEG to prove that an evolutionary stable state is its convergence point. Simulation experiments demonstrate that NSEG performs well with respect to network area coverage, uniform distribution of mobile nodes, and convergence speed.

  1. Synchronous Wearable Wireless Body Sensor Network Composed of Autonomous Textile Nodes

    Science.gov (United States)

    Vanveerdeghem, Peter; Van Torre, Patrick; Stevens, Christiaan; Knockaert, Jos; Rogier, Hendrik

    2014-01-01

    A novel, fully-autonomous, wearable, wireless sensor network is presented, where each flexible textile node performs cooperative synchronous acquisition and distributed event detection. Computationally efficient situational-awareness algorithms are implemented on the low-power microcontroller present on each flexible node. The detected events are wirelessly transmitted to a base station, directly, as well as forwarded by other on-body nodes. For each node, a dual-polarized textile patch antenna serves as a platform for the flexible electronic circuitry. Therefore, the system is particularly suitable for comfortable and unobtrusive integration into garments. In the meantime, polarization diversity can be exploited to improve the reliability and energy-efficiency of the wireless transmission. Extensive experiments in realistic conditions have demonstrated that this new autonomous, body-centric, textile-antenna, wireless sensor network is able to correctly detect different operating conditions of a firefighter during an intervention. By relying on four network nodes integrated into the protective garment, this functionality is implemented locally, on the body, and in real time. In addition, the received sensor data are reliably transferred to a central access point at the command post, for more detailed and more comprehensive real-time visualization. This information provides coordinators and commanders with situational awareness of the entire rescue operation. A statistical analysis of measured on-body node-to-node, as well as off-body person-to-person channels is included, confirming the reliability of the communication system. PMID:25302808

  2. The spreading ability of nodes towards localized targets in complex networks

    CERN Document Server

    Sun, Ye; Zeng, An; Wang, Wen-Xu

    2015-01-01

    As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and medicine science the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, t...

  3. Synchronous Wearable Wireless Body Sensor Network Composed of Autonomous Textile Nodes

    Directory of Open Access Journals (Sweden)

    Peter Vanveerdeghem

    2014-10-01

    Full Text Available A novel, fully-autonomous, wearable, wireless sensor network is presented, where each flexible textile node performs cooperative synchronous acquisition and distributed event detection. Computationally efficient situational-awareness algorithms are implemented on the low-power microcontroller present on each flexible node. The detected events are wirelessly transmitted to a base station, directly, as well as forwarded by other on-body nodes. For each node, a dual-polarized textile patch antenna serves as a platform for the flexible electronic circuitry. Therefore, the system is particularly suitable for comfortable and unobtrusive integration into garments. In the meantime, polarization diversity can be exploited to improve the reliability and energy-efficiency of the wireless transmission. Extensive experiments in realistic conditions have demonstrated that this new autonomous, body-centric, textile-antenna, wireless sensor network is able to correctly detect different operating conditions of a firefighter during an intervention. By relying on four network nodes integrated into the protective garment, this functionality is implemented locally, on the body, and in real time. In addition, the received sensor data are reliably transferred to a central access point at the command post, for more detailed and more comprehensive real-time visualization. This information provides coordinators and commanders with situational awareness of the entire rescue operation. A statistical analysis of measured on-body node-to-node, as well as off-body person-to-person channels is included, confirming the reliability of the communication system.

  4. The use of nodes attributes in social network analysis with an application to an international trade network

    Science.gov (United States)

    de Andrade, Ricardo Lopes; Rêgo, Leandro Chaves

    2018-02-01

    The social network analysis (SNA) studies the interactions among actors in a network formed through some relationship (friendship, cooperation, trade, among others). The SNA is constantly approached from a binary point of view, i.e., it is only observed if a link between two actors is present or not regardless of the strength of this link. It is known that different information can be obtained in weighted and unweighted networks and that the information extracted from weighted networks is more accurate and detailed. Another rarely discussed approach in the SNA is related to the individual attributes of the actors (nodes), because such analysis is usually focused on the topological structure of networks. Features of the nodes are not incorporated in the SNA what implies that there is some loss or misperception of information in those analyze. This paper aims at exploring more precisely the complexities of a social network, initially developing a method that inserts the individual attributes in the topological structure of the network and then analyzing the network in four different ways: unweighted, edge-weighted and two methods for using both edge-weights and nodes' attributes. The international trade network was chosen in the application of this approach, where the nodes represent the countries, the links represent the cash flow in the trade transactions and countries' GDP were chosen as nodes' attributes. As a result, it is possible to observe which countries are most connected in the world economy and with higher cash flows, to point out the countries that are central to the intermediation of the wealth flow and those that are most benefited from being included in this network. We also made a principal component analysis to study which metrics are more influential in describing the data variability, which turn out to be mostly the weighted metrics which include the nodes' attributes.

  5. Critical Nodes Identification of Power Systems Based on Controllability of Complex Networks

    Directory of Open Access Journals (Sweden)

    Yu-Shuai Li

    2015-09-01

    Full Text Available This paper proposes a new method for assessing the vulnerability of power systems based on the controllability theories of complex networks. A novel controllability index is established, taking into consideration the full controllability of the power systems, for identifying critical nodes. The network controllability model is used to calculate the minimum number of driver nodes (ND, which can solve the computable problems of the controllability of power systems. The proposed approach firstly applies the network controllability theories to research the power systems' vulnerability, which can not only effectively reveal the important nodes but also maintain full control of the power systems. Meanwhile, the method can also overcome the limitation of the hypothesis that the weight of each link or transmission line must be known compared with the existing literature. In addition, the power system is considered as a directed network and the power system model is also redefined. The proposed methodology is then used to identify critical nodes of the IEEE 118 and 300 bus system. The results show that the failure of the critical nodes can clearly increase ND and lead a significant driver node shift. Thus, the rationality and validity are verified.

  6. BFL: a node and edge betweenness based fast layout algorithm for large scale networks

    Science.gov (United States)

    Hashimoto, Tatsunori B; Nagasaki, Masao; Kojima, Kaname; Miyano, Satoru

    2009-01-01

    Background Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e.g. more than 10000 elements. Results To overcome these problems, we propose the use of a biologically important graph metric, betweenness, a measure of network flow. This metric is highly correlated with many biological phenomena such as lethality and clusters. We devise a new fast parallel algorithm calculating betweenness to minimize the preprocessing cost. Using this metric, we also invent a node and edge betweenness based fast layout algorithm (BFL). BFL places the high-betweenness nodes to optimal positions and allows the low-betweenness nodes to reach suboptimal positions. Furthermore, BFL reduces the runtime by combining a sequential insertion algorim with betweenness. For a graph with n nodes, this approach reduces the expected runtime of the algorithm to O(n2) when considering edge crossings, and to O(n log n) when considering only density and edge lengths. Conclusion Our BFL algorithm is compared against fast graph layout algorithms and approaches requiring intensive optimizations. For gene networks, we show that our algorithm is faster than all layout algorithms tested while providing readability on par with intensive optimization algorithms. We achieve a 1.4 second runtime for a graph with 4000 nodes and 12000 edges on a standard desktop computer. PMID:19146673

  7. Oscillatory Behavior on a Three-Node Neural Network Model with Discrete and Distributed Delays

    Directory of Open Access Journals (Sweden)

    Chunhua Feng

    2014-01-01

    Full Text Available This paper investigates the oscillatory behavior of the solutions for a three-node neural network with discrete and distributed delays. Two theorems are provided to determine the conditions for oscillating solutions of the model. The criteria for selecting the parameters in this network are derived. Some simulation examples are presented to illustrate the effectiveness of the results.

  8. Communication method for high density wireless networks, terminal, cluster master device, central node, and system therefor

    NARCIS (Netherlands)

    Havinga, Paul J.M.; van Hoesel, L.F.W.; Bijwaard, D.

    2009-01-01

    Large-scale wireless sensor and actuator networks(LWSANs) are networks that consist of many sensor and/or actuator devices (i.e. >1,000 devices). These sensor and/or actuator devices (also called nodes) communicate wirelessly to deliver their sensor readings to one or more gateway devices in the

  9. Bridges over troubled water: suppliers as connective nodes in global supply networks

    DEFF Research Database (Denmark)

    Christensen, Poul Rind; Andersen, Poul Houman

    2005-01-01

    Increasingly, industrial selling and purchasing is embedded in supplier networks extending national borders. The internationalisation of supply activities adds considerable complexity to the coordination tasks performed by suppliers. Traditionally, supply chain management was upstream......-oriented, focusing on the leading contractor's supply chain management. However, the increased demand for flexibility echoes down in supply network, decentralising the coordination task. We focus on subcontractors as connective nodes in supply networks and outline how coordinative roles are linked to the diversity...... of exchange nodes. We develop a typology for the coordinating roles taken on by subcontractors and use case studies to ground our explorative efforts empirically. Udgivelsesdato: Sep...

  10. Vulnerability assessment in social networks under cascade-based node departures

    Science.gov (United States)

    Malliaros, Fragkiskos D.; Vazirgiannis, Michalis

    2015-06-01

    In social networks, new users decide to become members, but also current users depart from the network or stop being active in the activities of their community. The departure of a user may affect the engagement of its neighbors in the graph, that successively may also decide to leave, leading to a disengagement epidemic. We propose a model to capture this cascading effect, based on recent studies about the engagement dynamics of social networks. We introduce a new concept of vulnerability assessment under cascades triggered by the departure of nodes based on their engagement level. Our results indicate that social networks are robust under cascades triggered by randomly selected nodes but highly vulnerable in cascades caused by targeted departures of nodes with high engagement level.

  11. Some scale-free networks could be robust under selective node attacks

    Science.gov (United States)

    Zheng, Bojin; Huang, Dan; Li, Deyi; Chen, Guisheng; Lan, Wenfei

    2011-04-01

    It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers. This phenomenon is different from the deduction of the idea above because this idea assumes the same cost to delete an arbitrary node. Hence this paper discusses the behaviors of the scale-free network under the selective node attack with different cost. Through the experiments on five complex networks, we show that the scale-free network is possibly robust under the selective node attacks; furthermore, the more compact the network is, and the larger the average degree is, then the more robust the network is; with the same average degrees, the more compact the network is, the more robust the network is. This result would enrich the theory of the invulnerability of the network, and can be used to build robust social, technological and biological networks, and also has the potential to find the target of drugs.

  12. Node-based learning of differential networks from multi-platform gene expression data.

    Science.gov (United States)

    Ou-Yang, Le; Zhang, Xiao-Fei; Wu, Min; Li, Xiao-Li

    2017-10-01

    Recovering gene regulatory networks and exploring the network rewiring between two different disease states are important for revealing the mechanisms behind disease progression. The advent of high-throughput experimental techniques has enabled the possibility of inferring gene regulatory networks and differential networks using computational methods. However, most of existing differential network analysis methods are designed for single-platform data analysis and assume that differences between networks are driven by individual edges. Therefore, they cannot take into account the common information shared across different data platforms and may fail in identifying driver genes that lead to the change of network. In this study, we develop a node-based multi-view differential network analysis model to simultaneously estimate multiple gene regulatory networks and their differences from multi-platform gene expression data. Our model can leverage the strength across multiple data platforms to improve the accuracy of network inference and differential network estimation. Simulation studies demonstrate that our model can obtain more accurate estimations of gene regulatory networks and differential networks than other existing state-of-the-art models. We apply our model on TCGA ovarian cancer samples to identify network rewiring associated with drug resistance. We observe from our experiments that the hub nodes of our identified differential networks include known drug resistance-related genes and potential targets that are useful to improve the treatment of drug resistant tumors. Copyright © 2017 Elsevier Inc. All rights reserved.

  13. A New Method for Node Fault Detection in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng Jiang

    2009-02-01

    Full Text Available Wireless sensor networks (WSNs are an important tool for monitoring distributed remote environments. As one of the key technologies involved in WSNs, node fault detection is indispensable in most WSN applications. It is well known that the distributed fault detection (DFD scheme checks out the failed nodes by exchanging data and mutually testing among neighbor nodes in this network., but the fault detection accuracy of a DFD scheme would decrease rapidly when the number of neighbor nodes to be diagnosed is small and the node’s failure ratio is high. In this paper, an improved DFD scheme is proposed by defining new detection criteria. Simulation results demonstrate that the improved DFD scheme performs well in the above situation and can increase the fault detection accuracy greatly.

  14. Lifetime optimization of wireless sensor network by a better nodes positioning and energy distribution

    Science.gov (United States)

    Lebreton, J. M.; Murad, N. M.

    2014-10-01

    The purpose of this paper is to propose a method of energy distribution on a Wireless Sensor Network (WSN). Nodes are randomly positioned and the sink is placed at the centre of the surface. Simulations show that relay nodes around the sink are too much requested to convey data, which substantially reduces their lifetime. So, several algorithmic solutions are presented to optimize the energy distribution on each node, compared to the classical uniform energy distribution. Their performance is discussed in terms of failure rate of data transmission and network lifetime. Moreover, the total energy distributed on all nodes before the deployment is invariable and some non-uniform energy distributions are created. Finally, simulations show that every energy distributions greatly improve the WSN lifetime and decrease the failure rate of data transmission.

  15. Intrusions Detection System Based on Ubiquitous Network Nodes

    OpenAIRE

    Sellami, Lynda; IDOUGHI, Djilali; Baadache, Abderahmane

    2014-01-01

    Ubiquitous computing allows to make data and services within the reach of users anytime and anywhere. This makes ubiquitous networks vulnerable to attacks coming from either inside or outside the network. To ensure and enhance networks security, several solutions have been implemented. These solutions are inefficient and or incomplete. Solving these challenges in security with new requirement of Ubicomp, could provide a potential future for such systems towards better mobility and higher conf...

  16. The Efficacy of Epidemic Algorithms on Detecting Node Replicas in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Narasimha Shashidhar

    2015-12-01

    Full Text Available A node replication attack against a wireless sensor network involves surreptitious efforts by an adversary to insert duplicate sensor nodes into the network while avoiding detection. Due to the lack of tamper-resistant hardware and the low cost of sensor nodes, launching replication attacks takes little effort to carry out. Naturally, detecting these replica nodes is a very important task and has been studied extensively. In this paper, we propose a novel distributed, randomized sensor duplicate detection algorithm called Discard to detect node replicas in group-deployed wireless sensor networks. Our protocol is an epidemic, self-organizing duplicate detection scheme, which exhibits emergent properties. Epidemic schemes have found diverse applications in distributed computing: load balancing, topology management, audio and video streaming, computing aggregate functions, failure detection, network and resource monitoring, to name a few. To the best of our knowledge, our algorithm is the first attempt at exploring the potential of this paradigm to detect replicas in a wireless sensor network. Through analysis and simulation, we show that our scheme achieves robust replica detection with substantially lower communication, computational and storage requirements than prior schemes in the literature.

  17. Empirical Research on the Topological Properties of Internet+ Information Resources Network Nodes

    OpenAIRE

    Wu Bin; Wu Ping; Ma Ji-Tao; Guo Ting-Ting; Li Jun; Liu Wei

    2017-01-01

    The “Internet+” is the product of the Internet development, and its network topology isn’t the same as the traditional Internet. The relevance of the average daily visiting data and the daily page viewing data are studied empirically, the rich-club coefficient and the node access probability are redefined, and the topological entropy model to measure the degree of nodes information aggregation is built by using the entropy theory. The experimental results showed that the calculation model sca...

  18. Multi-objective optimization model and evolutional solution of network node matching problem

    Science.gov (United States)

    Yao, Xiangjuan; Gong, Dunwei; Wang, Peipei; Chen, Lina

    2017-10-01

    In reality, many systems can be abstracted as a network. The research results show that there are close relations between different networks. How to find out the corresponding relationship between the nodes of different networks, i.e. the node matching problem, is a topic worthy of further study. The existing network node matching methods often use a single criteria to measure the matching precision of two networks, therefore may obtain inaccurate results. In fact, the matching accuracy of two networks can be measured using different structural information, so as to improve the reliability and accuracy of the matching method. In view of this, this paper establishes a multi-objective optimization model of network node matching problem in which the matching accuracy is measured by multiple criteria. When using evolutionary algorithm to solve the model, the multiple objectives are unified into a fitness function. The experimental results show that this method can obtain better matching accuracy than single-objective method and the random method while using less running time.

  19. The spreading of opposite opinions on online social networks with authoritative nodes

    Science.gov (United States)

    Yan, Shu; Tang, Shaoting; Pei, Sen; Jiang, Shijin; Zhang, Xiao; Ding, Wenrui; Zheng, Zhiming

    2013-09-01

    The study of opinion dynamics, such as spreading and controlling of rumors, has become an important issue on social networks. Numerous models have been devised to describe this process, including epidemic models and spin models, which mainly focus on how opinions spread and interact with each other, respectively. In this paper, we propose a model that combines the spreading stage and the interaction stage for opinions to illustrate the process of dispelling a rumor. Moreover, we set up authoritative nodes, which disseminate positive opinion to counterbalance the negative opinion prevailing on online social networking sites. With analysis of the relationship among positive opinion proportion, opinion strength and the density of authoritative nodes in networks with different topologies, we demonstrate that the positive opinion proportion grows with the density of authoritative nodes until the positive opinion prevails in the entire network. In particular, the relationship is linear in homogeneous topologies. Besides, it is also noteworthy that initial locations of the negative opinion source and authoritative nodes do not influence positive opinion proportion in homogeneous networks but have a significant impact on heterogeneous networks. The results are verified by numerical simulations and are helpful to understand the mechanism of two different opinions interacting with each other on online social networking sites.

  20. Improving the readability of clustered social networks using node duplication.

    Science.gov (United States)

    Henr, Nathalie; Bezerianos, Anastasia; Fekete, Jean-Daniel

    2008-01-01

    Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads to actors belonging to one and only one cluster, whereas in real life a person can belong to several communities. As a solution we propose duplicating actors in social networks and discuss potential impact of such a move. Several visual duplication designs are discussed and a controlled experiment comparing network visualization with and without duplication is performed, using 6 tasks that are important for graph readability and visual interpretation of social networks. We show that in our experiment, duplications significantly improve community-related tasks but sometimes interfere with other graph readability tasks. Finally, we propose a set of guidelines for deciding when to duplicate actors and choosing candidates for duplication, and alternative ways to render them in social network representations.

  1. An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity.

    Science.gov (United States)

    Hong, Changki; Hwang, Jeewon; Cho, Kwang-Hyun; Shin, Insik

    2015-01-01

    Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The

  2. An Integrated Hybrid Energy Harvester for Autonomous Wireless Sensor Network Nodes

    Directory of Open Access Journals (Sweden)

    Mukter Zaman

    2014-01-01

    Full Text Available Profiling environmental parameter using a large number of spatially distributed wireless sensor network (WSN NODEs is an extensive illustration of advanced modern technologies, but high power requirement for WSN NODEs limits the widespread deployment of these technologies. Currently, WSN NODEs are extensively powered up using batteries, but the battery has limitation of lifetime, power density, and environmental concerns. To overcome this issue, energy harvester (EH is developed and presented in this paper. Solar-based EH has been identified as the most viable source of energy to be harvested for autonomous WSN NODEs. Besides, a novel chemical-based EH is reported as the potential secondary source for harvesting energy because of its uninterrupted availability. By integrating both solar-based EH and chemical-based EH, a hybrid energy harvester (HEH is developed to power up WSN NODEs. Experimental results from the real-time deployment shows that, besides supporting the daily operation of WSN NODE and Router, the developed HEH is capable of producing a surplus of 971 mA·hr equivalent energy to be stored inside the storage for NODE and 528.24 mA·hr equivalent energy for Router, which is significantly enough for perpetual operation of autonomous WSN NODEs used in environmental parameter profiling.

  3. Connectivity of vehicular ad hoc networks with continuous node distribution patterns

    OpenAIRE

    Jin, W L; Wang, Bruce

    2010-01-01

    The connectivity of vehicular ad hoc networks (VANets) can be affected by the special distribution patterns, usually dependent and non-uniform, of vehicles in a transportation network. In this study, we introduce a new framework for computing the connectivity in a VANet for continuous distribution patterns of communication nodes on a line in a transportation network. Such distribution patterns can be estimated from traffic densities obtained through loop detectors or other detectors. When com...

  4. Analysis and Design of Adaptive Synchronization of a Complex Dynamical Network with Time-Delayed Nodes and Coupling Delays

    Directory of Open Access Journals (Sweden)

    Yu Miao

    2017-01-01

    Full Text Available This paper is devoted to the study of synchronization problems in uncertain dynamical networks with time-delayed nodes and coupling delays. First, a complex dynamical network model with time-delayed nodes and coupling delays is given. Second, for a complex dynamical network with known or unknown but bounded nonlinear couplings, an adaptive controller is designed, which can ensure that the state of a dynamical network asymptotically synchronizes at the individual node state locally or globally in an arbitrary specified network. Then, the Lyapunov-Krasovskii stability theory is employed to estimate the network coupling parameters. The main results provide sufficient conditions for synchronization under local or global circumstances, respectively. Finally, two typical examples are given, using the M-G system as the nodes of the ring dynamical network and second-order nodes in the dynamical network with time-varying communication delays and switching communication topologies, which illustrate the effectiveness of the proposed controller design methods.

  5. An Experimental Wireless Mesh Network Node Based on AVR ATmega16 Microcontroller and RFM12B Radio Module

    Science.gov (United States)

    Olejnik, Remigiusz

    The paper describes a simple node designed to act as part of an experimental wireless mesh network. The node is based on Atmel AVR ATmega16 microcontroller and Hope Microelectronics RFM12B radio module. Along with technical details of the node, the network layer (addressing scheme and routing algorithms) is presented. Fundamental principles on wireless mesh networks are also presented. Experimental results summarize the paper and prove limited usability of the project.

  6. Artificial neural networks as classification and diagnostic tools for lymph node-negative breast cancers

    Energy Technology Data Exchange (ETDEWEB)

    Eswari J, Satya; Chandrakar, Neha [National Institute of Technology Raipur, Raipur (India)

    2016-04-15

    Artificial neural networks (ANNs) can be used to develop a technique to classify lymph node negative breast cancer that is prone to distant metastases based on gene expression signatures. The neural network used is a multilayered feed forward network that employs back propagation algorithm. Once trained with DNA microarraybased gene expression profiles of genes that were predictive of distant metastasis recurrence of lymph node negative breast cancer, the ANNs became capable of correctly classifying all samples and recognizing the genes most appropriate to the classification. To test the ability of the trained ANN models in recognizing lymph node negative breast cancer, we analyzed additional idle samples that were not used beforehand for the training procedure and obtained the correctly classified result in the validation set. For more substantial result, bootstrapping of training and testing dataset was performed as external validation. This study illustrates the potential application of ANN for breast tumor diagnosis and the identification of candidate targets in patients for therapy.

  7. A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes

    Science.gov (United States)

    Agha Mohammad Ali Kermani, Mehrdad; Fatemi Ardestani, Seyed Farshad; Aliahmadi, Alireza; Barzinpour, Farnaz

    2017-01-01

    Influence maximization deals with identification of the most influential nodes in a social network given an influence model. In this paper, a game theoretic framework is developed that models a competitive influence maximization problem. A novel competitive influence model is additionally proposed that incorporates user heterogeneity, message content, and network structure. The proposed game-theoretic model is solved using Nash Equilibrium in a real-world dataset. It is shown that none of the well-known strategies are stable and at least one player has the incentive to deviate from the proposed strategy. Moreover, violation of Nash equilibrium strategy by each player leads to their reduced payoff. Contrary to previous works, our results demonstrate that graph topology, as well as the nodes' sociability and initial tendency measures have an effect on the determination of the influential node in the network.

  8. Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density

    Directory of Open Access Journals (Sweden)

    Qiuming Liu

    2016-03-01

    Full Text Available In this paper, we study the throughput capacity of wireless networks considering the selfish feature of interaction between nodes. In our proposed network model, each node has a probability of cooperating to relay transmission. According to the extent of selfishness, we, by the application of percolation theory, construct a series of highways crossing the network. The transmission strategy is then divided into three consecutive phases. Comparing the rate in each phase, we find the bottleneck of rate is always in the highway phase. Finally, the result reveals that the node’s selfishness degrades the throughput with a factor of square root of the cooperative probability, whereas the node density has trivial impact on the throughput.

  9. System for Malicious Node Detection in IPv6-Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kresimir Grgic

    2016-01-01

    Full Text Available The trend of implementing the IPv6 into wireless sensor networks (WSNs has recently occurred as a consequence of a tendency of their integration with other types of IP-based networks. The paper deals with the security aspects of these IPv6-based WSNs. A brief analysis of security threats and attacks which are present in the IPv6-based WSN is given. The solution to an adaptive distributed system for malicious node detection in the IPv6-based WSN is proposed. The proposed intrusion detection system is based on distributed algorithms and a collective decision-making process. It introduces an innovative concept of probability estimation for malicious behaviour of sensor nodes. The proposed system is implemented and tested through several different scenarios in three different network topologies. Finally, the performed analysis showed that the proposed system is energy efficient and has a good capability to detect malicious nodes.

  10. Node and layer eigenvector centralities for multiplex networks

    OpenAIRE

    Tudisco, Francesco; Arrigo, Francesca; Gautier, Antoine

    2017-01-01

    Eigenvector-based centrality measures are among the most popular centrality measures in network science. The underlying idea is intuitive and the mathematical description is extremely simple in the framework of standard, mono-layer networks. Moreover, several efficient computational tools are available for their computation. Moving up in dimensionality, several efforts have been made in the past to describe an eigenvector-based centrality measure that generalizes Bonacich index to the case of...

  11. Antimony nanoparticles anchored in three-dimensional carbon network as promising sodium-ion battery anode

    Science.gov (United States)

    Luo, Wen; Zhang, Pengfei; Wang, Xuanpeng; Li, Qidong; Dong, Yifan; Hua, Jingchen; Zhou, Liang; Mai, Liqiang

    2016-02-01

    A novel composite with antimony (Sb) nanoparticles anchored in three-dimensional carbon network (denoted as SbNPs@3D-C) is successfully synthesized via a NaCl template-assisted self-assembly strategy, followed by freeze-drying and one-step in-situ carbonization. The three-dimensional interconnected macroporous carbon framework can not only stabilize the architecture and buffer the volume expansion for Sb nanoparticles, but also provide high electrical conductivity for the whole electrode. Consequently, as a sodium-ion battery anode, the SbNPs@3D-C delivers a high reversible capacity (456 mAh g-1 at 100 mA g-1), stable cycling performance (94.3% capacity retention after 500 cycles at 100 mA g-1) as well as superior rate capability (270 mAh g-1 at 2000 mA g-1). When compared with commercial Sb particles, the SbNPs@3D-C exhibits dramatically enhanced electrochemical performance. Free from expensive template sources and complex manipulation, this work might shed some light on the synthesis of low-cost and high-performance materials for the next ;beyond lithium; battery generation.

  12. Network module detection: Affinity search technique with the multi-node topological overlap measure

    Directory of Open Access Journals (Sweden)

    Horvath Steve

    2009-07-01

    Full Text Available Abstract Background Many clustering procedures only allow the user to input a pairwise dissimilarity or distance measure between objects. We propose a clustering method that can input a multi-point dissimilarity measure d(i1, i2, ..., iP where the number of points P can be larger than 2. The work is motivated by gene network analysis where clusters correspond to modules of highly interconnected nodes. Here, we define modules as clusters of network nodes with high multi-node topological overlap. The topological overlap measure is a robust measure of interconnectedness which is based on shared network neighbors. In previous work, we have shown that the multi-node topological overlap measure yields biologically meaningful results when used as input of network neighborhood analysis. Findings We adapt network neighborhood analysis for the use of module detection. We propose the Module Affinity Search Technique (MAST, which is a generalized version of the Cluster Affinity Search Technique (CAST. MAST can accommodate a multi-node dissimilarity measure. Clusters grow around user-defined or automatically chosen seeds (e.g. hub nodes. We propose both local and global cluster growth stopping rules. We use several simulations and a gene co-expression network application to argue that the MAST approach leads to biologically meaningful results. We compare MAST with hierarchical clustering and partitioning around medoid clustering. Conclusion Our flexible module detection method is implemented in the MTOM software which can be downloaded from the following webpage: http://www.genetics.ucla.edu/labs/horvath/MTOM/

  13. Anchoring behavior, orientational order, and reorientation dynamics of nematic liquid crystal droplets dispersed in cross-linked polymer networks.

    Science.gov (United States)

    Roussel, Frédérick; Fung, Bing M

    2003-04-01

    The orientational ordering and the electro-optical properties of nematic liquid crystal (LC) droplets confined to cross-linked polymer networks are investigated as a function of the anchoring conditions at the polymer-liquid crystal interface. Normal alignment (homeotropic) or parallel alignment (planar) inside LC droplets was controlled by using acrylate polymers with appropriate side chains. Drastic changes in the reorientation dynamics of the confined nematic liquid crystal phase are observed, as well as in the orientational ordering of the phase-separated LC which was investigated by 13C-NMR (nuclear magnetic resonance) spectroscopy. The cross-link density of the polymer network also affects the orientational ordering and the electro-optical properties of the confined LC phase. Faster switching times and higher-order parameters were found for samples with LC droplets exhibiting planar anchoring.

  14. Multiplexed entanglement generation over quantum networks using multi-qubit nodes

    Science.gov (United States)

    van Dam, Suzanne B.; Humphreys, Peter C.; Rozpędek, Filip; Wehner, Stephanie; Hanson, Ronald

    2017-09-01

    Quantum networks distributed over distances greater than a few kilometres will be limited by the time required for information to propagate between nodes. We analyse protocols that are able to circumvent this bottleneck by employing multi-qubit nodes and multiplexing. For each protocol, we investigate the key network parameters that determine its performance. We model achievable entangling rates based on the anticipated near-term performance of nitrogen-vacancy centres and other promising network platforms. This analysis allows us to compare the potential of the proposed multiplexed protocols in different regimes. Moreover, by identifying the gains that may be achieved by improving particular network parameters, our analysis suggests the most promising avenues for research and development of prototype quantum networks.

  15. Controllable and fast quantum-information transfer between distant nodes in two-dimensional networks.

    Science.gov (United States)

    Zhong, Zhi-Rong

    2016-12-05

    We construct shortcuts to adiabatic passage to achieve controllable and fast quantum-information transfer (QIT) between arbitrary two distant nodes in a two-dimensional (2D) quantum network. Through suitable designing of time-dependent Rabi frequencies, we show that perfect QIT between arbitrary two distant nodes can be rapidly achieved. Numerical simulations demonstrate that the proposal is robust to the decoherence caused by atomic spontaneous emission and cavity photon leakage. Additionally, the proposed scheme is also insensitive to the variations of the experimental parameters. Thus, the proposed scheme provides a new perspective on robust quantum information processing in 2D quantum networks.

  16. Achieving sink node anonymity in tactical wireless sensor networks using a reactive routing protocol

    Science.gov (United States)

    2017-06-01

    Due to its essential role in the network, the sink node is a high priority target for an attacker who wishes to disable a WSN. In this thesis, we...its essential role in the network, the sink node is a high priority target for an attacker who wishes to disable a WSN. In this thesis, we focus on...her love, support and patience throughout the long hours of studying, research, and writing over these past two years. I would also like to thank my

  17. Analyzing Social Media Networks with NodeXL Insights from a Connected World

    CERN Document Server

    Hansen, Derek; Smith, Marc A

    2010-01-01

    Businesses, entrepreneurs, individuals, and government agencies alike are looking to social network analysis (SNA) tools for insight into trends, connections, and fluctuations in social media. Microsoft's NodeXL is a free, open-source SNA plug-in for use with Excel. It provides instant graphical representation of relationships of complex networked data. But it goes further than other SNA tools -- NodeXL was developed by a multidisciplinary team of experts that bring together information studies, computer science, sociology, human-computer interaction, and over 20 years of visual analytic theor

  18. Importance of small-degree nodes in assortative networks with degree-weight correlations

    Science.gov (United States)

    Ma, Sijuan; Feng, Ling; Monterola, Christopher Pineda; Lai, Choy Heng

    2017-10-01

    It has been known that assortative network structure plays an important role in spreading dynamics for unweighted networks. Yet its influence on weighted networks is not clear, in particular when weight is strongly correlated with the degrees of the nodes as we empirically observed in Twitter. Here we use the self-consistent probability method and revised nonperturbative heterogenous mean-field theory method to investigate this influence on both susceptible-infective-recovered (SIR) and susceptible-infective-susceptible (SIS) spreading dynamics. Both our simulation and theoretical results show that while the critical threshold is not significantly influenced by the assortativity, the prevalence in the supercritical regime shows a crossover under different degree-weight correlations. In particular, unlike the case of random mixing networks, in assortative networks, the negative degree-weight correlation leads to higher prevalence in their spreading beyond the critical transmissivity than that of the positively correlated. In addition, the previously observed inhibition effect on spreading velocity by assortative structure is not apparent in negatively degree-weight correlated networks, while it is enhanced for that of the positively correlated. Detailed investigation into the degree distribution of the infected nodes reveals that small-degree nodes play essential roles in the supercritical phase of both SIR and SIS spreadings. Our results have direct implications in understanding viral information spreading over online social networks and epidemic spreading over contact networks.

  19. Fluid-Flow Modeling of a Relay Node in an IEEE 802.11 Wireless Ad-Hoc Network

    NARCIS (Netherlands)

    Roijers, F.; van den Berg, H; Mandjes, M.R.H.

    2007-01-01

    Abstract Wireless ad-hoc networks are based on shared medium technology where the nodes arrange access to the medium in a distributed way independent of their current traffic demand. This has the inherent drawback that a node that serves as a relay node for transmissions of multiple neighboring

  20. Fluid-flow modeling of a relay node in an IEEE 802.11 wireless ad-hoc network

    NARCIS (Netherlands)

    F. Roijers (Frank); J.L. van den Berg (Hans); M.R.H. Mandjes (Michel)

    2007-01-01

    textabstractWireless ad-hoc networks are based on shared medium technology where the nodes arrange access to the medium in a distributed way independent of their current traffic demand. This has the inherent drawback that a node that serves as a relay node for transmissions of multiple neighboring

  1. GTRF: a game theory approach for regulating node behavior in real-time wireless sensor networks.

    Science.gov (United States)

    Lin, Chi; Wu, Guowei; Pirozmand, Poria

    2015-06-04

    The selfish behaviors of nodes (or selfish nodes) cause packet loss, network congestion or even void regions in real-time wireless sensor networks, which greatly decrease the network performance. Previous methods have focused on detecting selfish nodes or avoiding selfish behavior, but little attention has been paid to regulating selfish behavior. In this paper, a Game Theory-based Real-time & Fault-tolerant (GTRF) routing protocol is proposed. GTRF is composed of two stages. In the first stage, a game theory model named VA is developed to regulate nodes' behaviors and meanwhile balance energy cost. In the second stage, a jumping transmission method is adopted, which ensures that real-time packets can be successfully delivered to the sink before a specific deadline. We prove that GTRF theoretically meets real-time requirements with low energy cost. Finally, extensive simulations are conducted to demonstrate the performance of our scheme. Simulation results show that GTRF not only balances the energy cost of the network, but also prolongs network lifetime.

  2. Node Identification Using Inter-Regional Correlation Analysis for Mapping Detailed Connections in Resting State Networks

    Directory of Open Access Journals (Sweden)

    Yong Jeong

    2017-05-01

    Full Text Available Brain function is often characterized by the connections and interactions between highly interconnected brain regions. Pathological disruptions in these networks often result in brain dysfunction, which manifests as brain disease. Typical analysis investigates disruptions in network connectivity based correlations between large brain regions. To obtain a more detailed description of disruptions in network connectivity, we propose a new method where functional nodes are identified in each region based on their maximum connectivity to another brain region in a given network. Since this method provides a unique approach to identifying functionally relevant nodes in a given network, we can provide a more detailed map of brain connectivity and determine new measures of network connectivity. We applied this method to resting state fMRI of Alzheimer's disease patients to validate our method and found decreased connectivity within the default mode network. In addition, new measure of network connectivity revealed a more detailed description of how the network connections deteriorate with disease progression. This suggests that analysis using key relative network hub regions based on regional correlation can be used to detect detailed changes in resting state network connectivity.

  3. Mechanism of asymmetric software structures: A complex network perspective from behaviors of new nodes

    Science.gov (United States)

    Wang, Lei; Wang, Yu; Zhao, Yulong

    2014-11-01

    Studying the function call graphs in complex software can provide significant insights into the software evolution process. We found node in- and out-degree distributions asymmetric in the call graphs of 223 versions of Linux kernel modules (V1.1.0 to V2.4.35). Nodes newly introduced in these modules tended to attach to themselves (clustering) and existing high in-degree nodes. We proposed the αβ Model to generate call graphs for different kernel modules. The model preserved asymmetry in the degree distributions and simulated the new node behaviors. Last, we discussed how the αβ Model could be used effectively to study the robustness of complex networks.

  4. Kinetics of network formation by telechelic polypeptides with trimeric nodes

    NARCIS (Netherlands)

    Skrzeszewska, P.J.; Wolf, de F.A.; Cohen Stuart, M.A.; Gucht, van der J.

    2010-01-01

    We study the kinetics of transient network formation by monodisperse telechelic polypeptides with collagen-like end blocks and a random coil middle block. Upon cooling, the end blocks associate reversibly into triple helices, leading to gels with well-defined, trimeric crosslinks. Formation of

  5. Individual nodeʼs contribution to the mesoscale of complex networks

    Science.gov (United States)

    Klimm, Florian; Borge-Holthoefer, Javier; Wessel, Niels; Kurths, Jürgen; Zamora-López, Gorka

    2014-12-01

    The analysis of complex networks is devoted to the statistical characterization of the topology of graphs at different scales of organization in order to understand their functionality. While the modular structure of networks has become an essential element to better apprehend their complexity, the efforts to characterize the mesoscale of networks have focused on the identification of the modules rather than describing the mesoscale in an informative manner. Here we propose a framework to characterize the position every node takes within the modular configuration of complex networks and to evaluate their function accordingly. For illustration, we apply this framework to a set of synthetic networks, empirical neural networks, and to the transcriptional regulatory network of the Mycobacterium tuberculosis. We find that the architecture of both neuronal and transcriptional networks are optimized for the processing of multisensory information with the coexistence of well-defined modules of specialized components and the presence of hubs conveying information from and to the distinct functional domains.

  6. Empirical Research on the Topological Properties of Internet+ Information Resources Network Nodes

    Directory of Open Access Journals (Sweden)

    Wu Bin

    2017-01-01

    Full Text Available The “Internet+” is the product of the Internet development, and its network topology isn’t the same as the traditional Internet. The relevance of the average daily visiting data and the daily page viewing data are studied empirically, the rich-club coefficient and the node access probability are redefined, and the topological entropy model to measure the degree of nodes information aggregation is built by using the entropy theory. The experimental results showed that the calculation model scaled the degree of information aggregation of the nodes in the “Internet+” topology efficiently. It provides an available computational model for the observation of resource access behaviors in the “Internet+” network.

  7. Dealing with Wormhole Attacks in Wireless Sensor Networks Through Discovering Separate Routes Between Nodes

    Directory of Open Access Journals (Sweden)

    F. Rezaei

    2017-08-01

    Full Text Available One of the most common attacks against Wireless Sensor Networks is the wormhole attack. In this attack, the enemy deploys two malicious nodes in two different areas of the network and establishes a high-speed dedicated channel between these two. This will cause the normal nodes in two different areas wrongly think that they are two-hop neighbors. Therefore, this attack will greatly affect the routing algorithms. In this paper, a new distributed algorithm is provided to deal with the wormhole attack. The main idea of the proposed algorithm is to discover separate routes between pairs of two-hop neighboring nodes. The proposed algorithm was implemented and evaluated in terms of true and false detection rate by performing a series of experiments and the results were compared with the base algorithm. The test results showed that the proposed algorithm has desirable efficacy.

  8. Graph Theory-Based Analysis of the Lymph Node Fibroblastic Reticular Cell Network.

    Science.gov (United States)

    Novkovic, Mario; Onder, Lucas; Bocharov, Gennady; Ludewig, Burkhard

    2017-01-01

    Secondary lymphoid organs have developed segregated niches that are able to initiate and maintain effective immune responses. Such global organization requires tight control of diverse cellular components, specifically those that regulate lymphocyte trafficking. Fibroblastic reticular cells (FRCs) form a densely interconnected network in lymph nodes and provide key factors necessary for T cell migration and retention, and foster subsequent interactions between T cells and dendritic cells. Development of integrative systems biology approaches has made it possible to elucidate this multilevel complexity of the immune system. Here, we present a graph theory-based analysis of the FRC network in murine lymph nodes, where generation of the network topology is performed using high-resolution confocal microscopy and 3D reconstruction. This approach facilitates the analysis of physical cell-to-cell connectivity, and estimation of topological robustness and global behavior of the network when it is subjected to perturbation in silico.

  9. Link prediction in social network based on local information and attributes of nodes

    Science.gov (United States)

    Liang, Yingying; Huang, Lan; Wang, Zhe

    2017-08-01

    Link prediction is essential to both research areas and practical applications. In order to make full use of information of the network, we proposed a new method to predict links in the social network. Firstly, we extracted topological information and attributes of nodes in the social network. Secondly, we integrated them into feature vectors. Finally, we used XGB classifier to predict links using feature vectors. Through expanding information source, experiments on a co-authorship network suggest that our method can improve the accuracy of link prediction significantly.

  10. A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes.

    Science.gov (United States)

    Zhang, Ying; Chen, Wei; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming

    2015-12-01

    It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes' mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network.

  11. Service and device discovery of nodes in a wireless sensor network

    NARCIS (Netherlands)

    Östmark, Å.; Lindgren, P.; van Halteren, Aart; Meppelink, L.

    2006-01-01

    Emerging wireless communication standards and more capable sensors and actuators have pushed further development of wireless sensor networks. Deploying a large number of sensor nodes requires a high-level framework enabling the devices to present themselves and the resources they hold. The device

  12. Optimization of Wireless Node Discovery in an IoT Network

    DEFF Research Database (Denmark)

    Vasilev, Vladislav; Iliev, Georgi; Poulkov, Vladimir

    2015-01-01

    in the decrease in discovery costs. The proposed model covers well the dynamics of the complex sensor network, such as the one that maybe employed in an Internet of Things (IoT) scenario, where nodes need to act autonomously during the communication process. We apply the Lotka-Voltera model to increase...

  13. Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation

    Energy Technology Data Exchange (ETDEWEB)

    Wolfe, Noah; Carothers, Christopher; Mubarak, Misbah; Ross, Robert; Carns, Philip

    2016-05-15

    As supercomputers close in on exascale performance, the increased number of processors and processing power translates to an increased demand on the underlying network interconnect. The Slim Fly network topology, a new lowdiameter and low-latency interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this paper, we present a high-fidelity Slim Fly it-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate our Slim Fly model with the Kathareios et al. Slim Fly model results provided at moderately sized network scales. We further scale the model size up to n unprecedented 1 million compute nodes; and through visualization of network simulation metrics such as link bandwidth, packet latency, and port occupancy, we get an insight into the network behavior at the million-node scale. We also show linear strong scaling of the Slim Fly model on an Intel cluster achieving a peak event rate of 36 million events per second using 128 MPI tasks to process 7 billion events. Detailed analysis of the underlying discrete-event simulation performance shows that a million-node Slim Fly model simulation can execute in 198 seconds on the Intel cluster.

  14. A Multi-hop Topology Control Based on Inter-node Range Measurement for Wireless Sensor Networks Node Localization

    Directory of Open Access Journals (Sweden)

    Ali Husein ALASIRY

    2011-10-01

    Full Text Available In centralized range-based localization techniques, sufficiency of inter-node range information received by the base station strongly affects node position estimation results. Successful data aggregation is influenced by link stability of each connection of routes, especially in a multi-hop topology model. In general, measuring the inter-node range is only performed for position determination purposes. This research introduces the use of inter-node range measurement information for link selection in a multi-hop route composition in order to increase the rate of data aggregation. Due to irregularity problems of wireless media, two areas of node communication have been considered. The regular communication area is the area in which other nodes are able to perform symmetrical communication to the node without failure. The irregular area is the area in which other nodes are seldom able to communicate. Due to its instability, some existing methods tried to avoid the irregular area completely. The proposed method, named Virtual Boundaries (VBs prioritizes these areas. The regular communication area’s nodes have high priority to be selected as link vertices; however, when there is no link candidate inside this area, nodes within the irregular area will be selected with respect to their range to the parent node. This technique resulted in a more robust multi-hop topology that can reduce isolated node numbers and increase the percentage of data collected by the base station accordingly.

  15. The architecture of antagonistic networks: Node degree distribution, compartmentalization and nestedness

    Directory of Open Access Journals (Sweden)

    Savannah Nuwagaba

    2015-12-01

    Full Text Available Describing complex ecosystems as networks of interacting components has proved fruitful - revealing many distinctive patterns and dynamics of ecological systems. Of these patterns, three have often been brought up in literature, including species degree distribution, compartmentalization and nestedness, due largely to their implications for the functionality and stability of communities. Here, using 61 empirical antagonistic networks, we aim to settle the inconsistency in literature by (i fitting their node degree distributions to five different parametric models and identifying the one fits the best, (ii measuring the levels of nestedness and compartmentalization of these 61 networks and testing their significance using different null models, and (iii exploring how network connectance affects these three network architecture metrics. This research showed that most antagonistic networks do not display power law degree distributions and that resource species are generally uniformly distributed. We also clearly showed that the conclusion of whether a network is significantly compartmentalized or nested depends largely on the null model used.

  16. MUSIC algorithm DoA estimation for cooperative node location in mobile ad hoc networks

    Science.gov (United States)

    Warty, Chirag; Yu, Richard Wai; ElMahgoub, Khaled; Spinsante, Susanna

    In recent years the technological development has encouraged several applications based on distributed communications network without any fixed infrastructure. The problem of providing a collaborative early warning system for multiple mobile nodes against a fast moving object. The solution is provided subject to system level constraints: motion of nodes, antenna sensitivity and Doppler effect at 2.4 GHz and 5.8 GHz. This approach consists of three stages. The first phase consists of detecting the incoming object using a highly directive two element antenna at 5.0 GHz band. The second phase consists of broadcasting the warning message using a low directivity broad antenna beam using 2× 2 antenna array which then in third phase will be detected by receiving nodes by using direction of arrival (DOA) estimation technique. The DOA estimation technique is used to estimate the range and bearing of the incoming nodes. The position of fast arriving object can be estimated using the MUSIC algorithm for warning beam DOA estimation. This paper is mainly intended to demonstrate the feasibility of early detection and warning system using a collaborative node to node communication links. The simulation is performed to show the behavior of detecting and broadcasting antennas as well as performance of the detection algorithm. The idea can be further expanded to implement commercial grade detection and warning system

  17. Hole patching strategy with the least mobile nodes in wireless sensor network of agriculture

    Science.gov (United States)

    Feng, Yong; Liu, Jian; Xu, Hongyan; Yuan, Ye

    Wireless Sensor Network (WSN) can be used in agriculture management. But hole can be produced in WSN due to the factors such as fault, energy depletion and so on, which can cause agricultural data incomplete. This fault can be repaired by deploying the mobile sensor nodes to patch the hole. The main optimization goal of this paper is to deploy the least mobile sensor nodes to make the cost of hole patching minimization. A hole patching strategy with the least mobile sensor nodes in WSN is proposed in this paper. Firstly, analyze geometric characteristics of the hole through detecting the hole. Next, deploy the mobile sensor nodes on the appropriate location to patch the hole according to the geometric characteristics. The strategy given in this paper includes two steps: (1) Choose the key intersection points from the set of intersection points of arc. (2) Determine the patching position of the mobile nodes to patch the hole. Finally, verify the effective of the strategy using a simulation experiment and analyze the performance based on the comparison of the experimental results. Using the hole patching strategy with the least mobile nodes in WSN can patch the hole completely and make the reparation cost minimization.

  18. An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Aries Pratiarso

    2015-06-01

    Full Text Available In wireless sensor network applications, the position of nodes is randomly distributed following the contour of the observation area. A simple solution without any measurement tools is provided by range-free method. However, this method yields the coarse estimating position of the nodes. In this paper, we propose Adaptive Connectivity-based (ACC algorithm. This algorithm is a combination of Centroid as range-free based algorithm, and hop-based connectivity algorithm. Nodes have a possibility to estimate their own position based on the connectivity level between them and their reference nodes. Each node divides its communication range into several regions where each of them has a certain weight depends on the received signal strength. The weighted value is used to obtain the estimated position of nodes. Simulation result shows that the proposed algorithm has up to 3 meter error of estimated position on 100x100 square meter observation area, and up to 3 hop counts for 80 meters' communication range. The proposed algorithm performs an average error positioning up to 10 meters better than Weighted Centroid algorithm. Keywords: adaptive, connectivity, centroid, range-free.

  19. Identifying influential nodes in large-scale directed networks: the role of clustering.

    Directory of Open Access Journals (Sweden)

    Duan-Bing Chen

    Full Text Available Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node's neighbors but do not directly make use of the interactions among it's neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about [Formula: see text] nodes, more than 15 times faster than PageRank.

  20. Identifying influential nodes in large-scale directed networks: the role of clustering.

    Science.gov (United States)

    Chen, Duan-Bing; Gao, Hui; Lü, Linyuan; Zhou, Tao

    2013-01-01

    Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node's neighbors but do not directly make use of the interactions among it's neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR) spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about [Formula: see text] nodes, more than 15 times faster than PageRank.

  1. PROTOCOLS FOR INCREASING THE LIFETIME OF NODES OF AD HOC WIRELESS NETWORKS

    Directory of Open Access Journals (Sweden)

    B.Malarkodi

    2010-03-01

    Full Text Available Power consumption of nodes in ad hoc networks is a critical issue as they predominantly operate on batteries. In order to improve the lifetime of an ad hoc network, all the nodes must be utilized evenly and the power required for connections must be minimized. Energy management deals with the process of managing energy resources by means of controlling the battery discharge, adjusting the transmission power and scheduling of power sources so as to increase the lifetime of the nodes of an ad hoc wireless network. In this paper, two protocols are proposed to improve the lifetime of the nodes. The first protocol assumes smart battery packages with L cells and uses dynamic programming (DP to optimally select the set of cells used to satisfy a request for power. The second one proposes a MAC layer protocol denoted as Power Aware medium Access Control (PAMAC protocol which enables the network layer to select a route with minimum total power requirement among the possible routes between a source and a destination provided all nodes in the routes have battery capacity above a threshold. The life time of the nodes using the DP based scheduling policy is found through simulation and compared with that obtained using the techniques reported in the literature. It is found that DP based policy increases the lifetime of the mobile nodes by a factor of 1.15 to 1.8. The life expectancy, the average power consumption and throughput of the network using PAMAC protocol are computed through simulation and compared with that of the other MAC layer protocols 802.11, MACA, and CSMA. Besides this, the life expectancy and average power consumption of the network for different values of threshold are also compared. From the simulation results, it is observed that PAMAC consumes the least power and provides the longest lifetime among the various MAC Layer protocols. Moreover, using PAMAC as the MAC layer protocol, the performance obtained using different routing layer

  2. Anchors for Education Reforms

    Science.gov (United States)

    Alok, Kumar

    2012-01-01

    Education reforms, considering their significance, deserve better methods than mere "trial and error." This article conceptualizes a network of six anchors for education reforms: education policy, education system, curriculum, pedagogy, assessment, and teacher education. It establishes the futility to reform anchors in isolation and…

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2018-01-30

    Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

  4. Identification of influential nodes in complex networks: Method from spreading probability viewpoint

    Science.gov (United States)

    Bao, Zhong-Kui; Ma, Chuang; Xiang, Bing-Bing; Zhang, Hai-Feng

    2017-02-01

    The problem of identifying influential nodes in complex networks has attracted much attention owing to its wide applications, including how to maximize the information diffusion, boost product promotion in a viral marketing campaign, prevent a large scale epidemic and so on. From spreading viewpoint, the probability of one node propagating its information to one other node is closely related to the shortest distance between them, the number of shortest paths and the transmission rate. However, it is difficult to obtain the values of transmission rates for different cases, to overcome such a difficulty, we use the reciprocal of average degree to approximate the transmission rate. Then a semi-local centrality index is proposed to incorporate the shortest distance, the number of shortest paths and the reciprocal of average degree simultaneously. By implementing simulations in real networks as well as synthetic networks, we verify that our proposed centrality can outperform well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, k-shell centrality, and nonbacktracking centrality. In particular, our findings indicate that the performance of our method is the most significant when the transmission rate nears to the epidemic threshold, which is the most meaningful region for the identification of influential nodes.

  5. Fuzzy Based Advanced Hybrid Intrusion Detection System to Detect Malicious Nodes in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Rupinder Singh

    2017-01-01

    Full Text Available In this paper, an Advanced Hybrid Intrusion Detection System (AHIDS that automatically detects the WSNs attacks is proposed. AHIDS makes use of cluster-based architecture with enhanced LEACH protocol that intends to reduce the level of energy consumption by the sensor nodes. AHIDS uses anomaly detection and misuse detection based on fuzzy rule sets along with the Multilayer Perceptron Neural Network. The Feed Forward Neural Network along with the Backpropagation Neural Network are utilized to integrate the detection results and indicate the different types of attackers (i.e., Sybil attack, wormhole attack, and hello flood attack. For detection of Sybil attack, Advanced Sybil Attack Detection Algorithm is developed while the detection of wormhole attack is done by Wormhole Resistant Hybrid Technique. The detection of hello flood attack is done by using signal strength and distance. An experimental analysis is carried out in a set of nodes; 13.33% of the nodes are determined as misbehaving nodes, which classified attackers along with a detection rate of the true positive rate and false positive rate. Sybil attack is detected at a rate of 99,40%; hello flood attack has a detection rate of 98, 20%; and wormhole attack has a detection rate of 99, 20%.

  6. Effects of fading and spatial correlation on node selection for estimation in Wireless Sensor Networks

    KAUST Repository

    Al-Murad, Tamim M.

    2010-06-01

    In densely deployed sensor networks, correlation among measurements may be high. Spatial sampling through node selection is usually used to minimize this correlation and to save energy consumption. However because of the fading nature of the wireless channels, extra care should be taken when performing this sampling. In this paper, we develop expressions for the distortion which include the channel effects. The asymptotic behavior of the distortion as the number of sensors or total transmit power increase without bound is also investigated. Further, based on the channel and position information we propose and test several node selection schemes.

  7. An efficient schedule based data aggregation using node mobility for wireless sensor network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Pawar, Pranav M.; Prasad, Neeli R.

    2014-01-01

    In the Wireless Sensor Networks, (WSNs) a key challenge is to schedule the activities of the mobile node for improvement in throughput, energy consumption and delay. This paper proposes efficient schedule based data aggregation algorithm using node mobility (SDNM). It considers the cluster-based...... myopic and non-myopic scheduling scheme for conflict free schedule based on the current and next state. It uses TDMA as the MAC layer protocol and schedules the aggregated packets with consecutive slots. Simulation results show that, SDNM is energy efficient, has less delay as compared with state...

  8. Pseudoinverse of the Laplacian and best spreader node in a network

    Science.gov (United States)

    Van Mieghem, P.; Devriendt, K.; Cetinay, H.

    2017-09-01

    Determining a set of "important" nodes in a network constitutes a basic endeavor in network science. Inspired by electrical flows in a resistor network, we propose the best conducting node j in a graph G as the minimizer of the diagonal element Qjj † of the pseudoinverse matrix Q† of the weighted Laplacian matrix of the graph G . We propose a new graph metric that complements the effective graph resistance RG and that specifies the heterogeneity of the nodal spreading capacity in a graph. Various formulas and bounds for the diagonal element Qjj † are presented. Finally, we compute the pseudoinverse matrix of the Laplacian of star, path, and cycle graphs and derive an expansion and lower bound of the effective graph resistance RG based on the complement of the graph G .

  9. A modified evidential methodology of identifying influential nodes in weighted networks

    Science.gov (United States)

    Gao, Cai; Wei, Daijun; Hu, Yong; Mahadevan, Sankaran; Deng, Yong

    2013-11-01

    How to identify influential nodes in complex networks is still an open hot issue. In the existing evidential centrality (EVC), node degree distribution in complex networks is not taken into consideration. In addition, the global structure information has also been neglected. In this paper, a new Evidential Semi-local Centrality (ESC) is proposed by modifying EVC in two aspects. Firstly, the Basic Probability Assignment (BPA) of degree generated by EVC is modified according to the actual degree distribution, rather than just following uniform distribution. BPA is the generation of probability in order to model uncertainty. Secondly, semi-local centrality combined with modified EVC is extended to be applied in weighted networks. Numerical examples are used to illustrate the efficiency of the proposed method.

  10. Effect of anti-virus software on infectious nodes in computer network: A mathematical model

    Science.gov (United States)

    Mishra, Bimal Kumar; Pandey, Samir Kumar

    2012-07-01

    An e-epidemic model of malicious codes in the computer network through vertical transmission is formulated. We have observed that if the basic reproduction number is less than unity, the infected proportion of computer nodes disappear and malicious codes die out and also the malicious codes-free equilibrium is globally asymptotically stable which leads to its eradication. Effect of anti-virus software on the removal of the malicious codes from the computer network is critically analyzed. Analysis and simulation results show some managerial insights that are helpful for the practice of anti-virus in information sharing networks.

  11. A new betweenness centrality measure based on an algorithm for ranking the nodes of a network

    OpenAIRE

    Agryzkov, Taras; Oliver, Jose L.; Tortosa Grau, Leandro; Vicent, Jose F.

    2014-01-01

    We propose and discuss a new centrality index for urban street patterns represented as networks in geographical space. This centrality measure, that we call ranking-betweenness centrality, combines the idea behind the random-walk betweenness centrality measure and the idea of ranking the nodes of a network produced by an adapted PageRank algorithm. We initially use a PageRank algorithm in which we are able to transform some information of the network that we want to analyze into numerical val...

  12. Precise calculation of a bond percolation transition and survival rates of nodes in a complex network.

    Science.gov (United States)

    Kawamoto, Hirokazu; Takayasu, Hideki; Jensen, Henrik Jeldtoft; Takayasu, Misako

    2015-01-01

    Through precise numerical analysis, we reveal a new type of universal loopless percolation transition in randomly removed complex networks. As an example of a real-world network, we apply our analysis to a business relation network consisting of approximately 3,000,000 links among 300,000 firms and observe the transition with critical exponents close to the mean-field values taking into account the finite size effect. We focus on the largest cluster at the critical point, and introduce survival probability as a new measure characterizing the robustness of each node. We also discuss the relation between survival probability and k-shell decomposition.

  13. Developing a New HSR Switching Node (SwitchBox for Improving Traffic Performance in HSR Networks

    Directory of Open Access Journals (Sweden)

    Nguyen Xuan Tien

    2016-01-01

    Full Text Available High availability is crucial for industrial Ethernet networks as well as Ethernet-based control systems such as automation networks and substation automation systems (SAS. Since standard Ethernet does not support fault tolerance capability, the high availability of Ethernet networks can be increased by using redundancy protocols. Various redundancy protocols for Ethernet networks have been developed and standardized, such as rapid spanning tree protocol (RSTP, media redundancy protocol (MRP, parallel redundancy protocol (PRP, high-availability seamless redundancy (HSR and others. RSTP and MRP have switchover delay drawbacks. PRP provides zero recovery time, but requires a duplicate network infrastructure. HSR operation is similar to PRP, but HSR uses a single network. However, the standard HSR protocol is mainly applied to ring-based topologies and generates excessively unnecessary redundant traffic in the network. In this paper, we develop a new switching node for the HSR protocol, called SwitchBox, which is used in HSR networks in order to support any network topology and significantly reduce redundant network traffic, including unicast, multicast and broadcast traffic, compared with standard HSR. By using the SwitchBox, HSR not only provides seamless communications with zero switchover time in case of failure, but it is also easily applied to any network topology and significantly reduces unnecessary redundant traffic in HSR networks.

  14. HyberLoc: Providing Physical Layer Location Privacy in Hybrid Sensor Networks

    CERN Document Server

    El-Badry, Rania; Youssef, Moustafa

    2010-01-01

    In many hybrid wireless sensor networks' applications, sensor nodes are deployed in hostile environments where trusted and un-trusted nodes co-exist. In anchor-based hybrid networks, it becomes important to allow trusted nodes to gain full access to the location information transmitted in beacon frames while, at the same time, prevent un-trusted nodes from using this information. The main challenge is that un-trusted nodes can measure the physical signal transmitted from anchor nodes, even if these nodes encrypt their transmission. Using the measured signal strength, un-trusted nodes can still tri-laterate the location of anchor nodes. In this paper, we propose HyberLoc, an algorithm that provides anchor physical layer location privacy in anchor-based hybrid sensor networks. The idea is for anchor nodes to dynamically change their transmission power following a certain probability distribution, degrading the localization accuracy at un-trusted nodes while maintaining high localization accuracy at trusted node...

  15. A Wireless Real-Time Monitoring Node of the Physiological Signals for Unrestrained Dairy Cattle Using Wireless Sensor Network

    Science.gov (United States)

    Zhang, Xihai; Zhang, Changli; Fang, Junlong; Fan, Yongcun

    A newly developed smart sensor node that can monitor physiological signals for unrestrained dairy cattle is designed through modular design and its advantages are compact structure and small volume. This sensor node is based on a MSP430F133 micro-controller; the digital sensor includes temperature sensor (DS18B20-America) and vibration-displacement sensor (DN series China); transmission of the digital data uses the nRF903. The results show that this node can collect physiological signals for unrestrained dairy cattle and then send it to upper network node. This research can provide better hardware platform for further researching the communication protocols of wireless sensor networks.

  16. Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks

    Science.gov (United States)

    Xu, Shuang; Wang, Pei; Lü, Jinhu

    2017-01-01

    Designing node influence ranking algorithms can provide insights into network dynamics, functions and structures. Increasingly evidences reveal that node’s spreading ability largely depends on its neighbours. We introduce an iterative neighbourinformation gathering (Ing) process with three parameters, including a transformation matrix, a priori information and an iteration time. The Ing process iteratively combines priori information from neighbours via the transformation matrix, and iteratively assigns an Ing score to each node to evaluate its influence. The algorithm appropriates for any types of networks, and includes some traditional centralities as special cases, such as degree, semi-local, LeaderRank. The Ing process converges in strongly connected networks with speed relying on the first two largest eigenvalues of the transformation matrix. Interestingly, the eigenvector centrality corresponds to a limit case of the algorithm. By comparing with eight renowned centralities, simulations of susceptible-infected-removed (SIR) model on real-world networks reveal that the Ing can offer more exact rankings, even without a priori information. We also observe that an optimal iteration time is always in existence to realize best characterizing of node influence. The proposed algorithms bridge the gaps among some existing measures, and may have potential applications in infectious disease control, designing of optimal information spreading strategies.

  17. A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes

    Directory of Open Access Journals (Sweden)

    Ying Zhang

    2015-12-01

    Full Text Available It is expected that in the near future wireless sensor network (WSNs will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs for marine monitoring and mobile robots for environmental investigation. The sensor nodes’ mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network.

  18. Node Deployment with k-Connectivity in Sensor Networks for Crop Information Full Coverage Monitoring

    Directory of Open Access Journals (Sweden)

    Naisen Liu

    2016-12-01

    Full Text Available Wireless sensor networks (WSNs are suitable for the continuous monitoring of crop information in large-scale farmland. The information obtained is great for regulation of crop growth and achieving high yields in precision agriculture (PA. In order to realize full coverage and k-connectivity WSN deployment for monitoring crop growth information of farmland on a large scale and to ensure the accuracy of the monitored data, a new WSN deployment method using a genetic algorithm (GA is here proposed. The fitness function of GA was constructed based on the following WSN deployment criteria: (1 nodes must be located in the corresponding plots; (2 WSN must have k-connectivity; (3 WSN must have no communication silos; (4 the minimum distance between node and plot boundary must be greater than a specific value to prevent each node from being affected by the farmland edge effect. The deployment experiments were performed on natural farmland and on irregular farmland divided based on spatial differences of soil nutrients. Results showed that both WSNs gave full coverage, there were no communication silos, and the minimum connectivity of nodes was equal to k. The deployment was tested for different values of k and transmission distance (d to the node. The results showed that, when d was set to 200 m, as k increased from 2 to 4 the minimum connectivity of nodes increases and is equal to k. When k was set to 2, the average connectivity of all nodes increased in a linear manner with the increase of d from 140 m to 250 m, and the minimum connectivity does not change.

  19. Node Deployment with k-Connectivity in Sensor Networks for Crop Information Full Coverage Monitoring

    Science.gov (United States)

    Liu, Naisen; Cao, Weixing; Zhu, Yan; Zhang, Jingchao; Pang, Fangrong; Ni, Jun

    2016-01-01

    Wireless sensor networks (WSNs) are suitable for the continuous monitoring of crop information in large-scale farmland. The information obtained is great for regulation of crop growth and achieving high yields in precision agriculture (PA). In order to realize full coverage and k-connectivity WSN deployment for monitoring crop growth information of farmland on a large scale and to ensure the accuracy of the monitored data, a new WSN deployment method using a genetic algorithm (GA) is here proposed. The fitness function of GA was constructed based on the following WSN deployment criteria: (1) nodes must be located in the corresponding plots; (2) WSN must have k-connectivity; (3) WSN must have no communication silos; (4) the minimum distance between node and plot boundary must be greater than a specific value to prevent each node from being affected by the farmland edge effect. The deployment experiments were performed on natural farmland and on irregular farmland divided based on spatial differences of soil nutrients. Results showed that both WSNs gave full coverage, there were no communication silos, and the minimum connectivity of nodes was equal to k. The deployment was tested for different values of k and transmission distance (d) to the node. The results showed that, when d was set to 200 m, as k increased from 2 to 4 the minimum connectivity of nodes increases and is equal to k. When k was set to 2, the average connectivity of all nodes increased in a linear manner with the increase of d from 140 m to 250 m, and the minimum connectivity does not change. PMID:27941704

  20. R2NA: Received Signal Strength (RSS Ratio-Based Node Authentication for Body Area Network

    Directory of Open Access Journals (Sweden)

    Yang Wu

    2013-12-01

    Full Text Available The body area network (BAN is an emerging branch of wireless sensor networks for personalized applications. The services in BAN usually have a high requirement on security, especially for the medical diagnosis. One of the fundamental directions to ensure security in BAN is how to provide node authentication. Traditional research using cryptography relies on prior secrets shared among nodes, which leads to high resource cost. In addition, most existing non-cryptographic solutions exploit out-of-band (OOB channels, but they need the help of additional hardware support or significant modifications to the system software. To avoid the above problems, this paper presents a proximity-based node authentication scheme, which only uses wireless modules equipped on sensors. With only one sensor and one control unit (CU in BAN, we could detect a unique physical layer characteristic, namely, the difference between the received signal strength (RSS measured on different devices in BAN. Through the above-mentioned particular difference, we can tell whether the sender is close enough to be legitimate. We validate our scheme through both theoretical analysis and experiments, which are conducted on the real Shimmer nodes. The results demonstrate that our proposed scheme has a good security performance.

  1. R2NA: Received Signal Strength (RSS) Ratio-Based Node Authentication for Body Area Network

    Science.gov (United States)

    Wu, Yang; Wang, Kai; Sun, Yongmei; Ji, Yuefeng

    2013-01-01

    The body area network (BAN) is an emerging branch of wireless sensor networks for personalized applications. The services in BAN usually have a high requirement on security, especially for the medical diagnosis. One of the fundamental directions to ensure security in BAN is how to provide node authentication. Traditional research using cryptography relies on prior secrets shared among nodes, which leads to high resource cost. In addition, most existing non-cryptographic solutions exploit out-of-band (OOB) channels, but they need the help of additional hardware support or significant modifications to the system software. To avoid the above problems, this paper presents a proximity-based node authentication scheme, which only uses wireless modules equipped on sensors. With only one sensor and one control unit (CU) in BAN, we could detect a unique physical layer characteristic, namely, the difference between the received signal strength (RSS) measured on different devices in BAN. Through the above-mentioned particular difference, we can tell whether the sender is close enough to be legitimate. We validate our scheme through both theoretical analysis and experiments, which are conducted on the real Shimmer nodes. The results demonstrate that our proposed scheme has a good security performance.

  2. Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering

    Science.gov (United States)

    Chen, Duan-Bing; Gao, Hui; Lü, Linyuan; Zhou, Tao

    2013-01-01

    Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node’s neighbors but do not directly make use of the interactions among it’s neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors’ influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR) spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about nodes, more than 15 times faster than PageRank. PMID:24204833

  3. Energy-efficient boarder node medium access control protocol for wireless sensor networks.

    Science.gov (United States)

    Razaque, Abdul; Elleithy, Khaled M

    2014-03-12

    This paper introduces the design, implementation, and performance analysis of the scalable and mobility-aware hybrid protocol named boarder node medium access control (BN-MAC) for wireless sensor networks (WSNs), which leverages the characteristics of scheduled and contention-based MAC protocols. Like contention-based MAC protocols, BN-MAC achieves high channel utilization, network adaptability under heavy traffic and mobility, and low latency and overhead. Like schedule-based MAC protocols, BN-MAC reduces idle listening time, emissions, and collision handling at low cost at one-hop neighbor nodes and achieves high channel utilization under heavy network loads. BN-MAC is particularly designed for region-wise WSNs. Each region is controlled by a boarder node (BN), which is of paramount importance. The BN coordinates with the remaining nodes within and beyond the region. Unlike other hybrid MAC protocols, BN-MAC incorporates three promising models that further reduce the energy consumption, idle listening time, overhearing, and congestion to improve the throughput and reduce the latency. One of the models used with BN-MAC is automatic active and sleep (AAS), which reduces the ideal listening time. When nodes finish their monitoring process, AAS lets them automatically go into the sleep state to avoid the idle listening state. Another model used in BN-MAC is the intelligent decision-making (IDM) model, which helps the nodes sense the nature of the environment. Based on the nature of the environment, the nodes decide whether to use the active or passive mode. This decision power of the nodes further reduces energy consumption because the nodes turn off the radio of the transceiver in the passive mode. The third model is the least-distance smart neighboring search (LDSNS), which determines the shortest efficient path to the one-hop neighbor and also provides cross-layering support to handle the mobility of the nodes. The BN-MAC also incorporates a semi

  4. Energy-Efficient Boarder Node Medium Access Control Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Abdul Razaque

    2014-03-01

    Full Text Available This paper introduces the design, implementation, and performance analysis of the scalable and mobility-aware hybrid protocol named boarder node medium access control (BN-MAC for wireless sensor networks (WSNs, which leverages the characteristics of scheduled and contention-based MAC protocols. Like contention-based MAC protocols, BN-MAC achieves high channel utilization, network adaptability under heavy traffic and mobility, and low latency and overhead. Like schedule-based MAC protocols, BN-MAC reduces idle listening time, emissions, and collision handling at low cost at one-hop neighbor nodes and achieves high channel utilization under heavy network loads. BN-MAC is particularly designed for region-wise WSNs. Each region is controlled by a boarder node (BN, which is of paramount importance. The BN coordinates with the remaining nodes within and beyond the region. Unlike other hybrid MAC protocols, BN-MAC incorporates three promising models that further reduce the energy consumption, idle listening time, overhearing, and congestion to improve the throughput and reduce the latency. One of the models used with BN-MAC is automatic active and sleep (AAS, which reduces the ideal listening time. When nodes finish their monitoring process, AAS lets them automatically go into the sleep state to avoid the idle listening state. Another model used in BN-MAC is the intelligent decision-making (IDM model, which helps the nodes sense the nature of the environment. Based on the nature of the environment, the nodes decide whether to use the active or passive mode. This decision power of the nodes further reduces energy consumption because the nodes turn off the radio of the transceiver in the passive mode. The third model is the least-distance smart neighboring search (LDSNS, which determines the shortest efficient path to the one-hop neighbor and also provides cross-layering support to handle the mobility of the nodes. The BN-MAC also incorporates a semi

  5. Identifying Driver Nodes in the Human Signaling Network Using Structural Controllability Analysis.

    Science.gov (United States)

    Liu, Xueming; Pan, Linqiang

    2015-01-01

    Cell signaling governs the basic cellular activities and coordinates the actions in cell. Abnormal regulations in cell signaling processing are responsible for many human diseases, such as diabetes and cancers. With the accumulation of massive data related to human cell signaling, it is feasible to obtain a human signaling network. Some studies have shown that interesting biological phenomenon and drug-targets could be discovered by applying structural controllability analysis to biological networks. In this work, we apply structural controllability to a human signaling network and detect driver nodes, providing a systematic analysis of the role of different proteins in controlling the human signaling network. We find that the proteins in the upstream of the signaling information flow and the low in-degree proteins play a crucial role in controlling the human signaling network. Interestingly, inputting different control signals on the regulators of the cancer-associated genes could cost less than controlling the cancer-associated genes directly in order to control the whole human signaling network in the sense that less drive nodes are needed. This research provides a fresh perspective for controlling the human cell signaling system.

  6. Robust node estimation and topology discovery for large-scale networks

    KAUST Repository

    Alouini, Mohamed-Slim

    2017-02-23

    Various examples are provided for node estimation and topology discovery for networks. In one example, a method includes receiving a packet having an identifier from a first node; adding the identifier to another transmission packet based on a comparison between the first identifier and existing identifiers associated with the other packet; adjusting a transmit probability based on the comparison; and transmitting the other packet based on a comparison between the transmit probability and a probability distribution. In another example, a system includes a network device that can adds an identifier received in a packet to a list including existing identifiers and adjust a transmit probability based on a comparison between the identifiers; and transmit another packet based on a comparison between the transmit probability and a probability distribution. In another example, a method includes determining a quantity of sensor devices based on a plurality of identifiers received in a packet.

  7. Sensor Node Deployment Approach in Wireless Sensor Network Based on Multi-objective Flower Pollination Algorithm

    Directory of Open Access Journals (Sweden)

    Faten Hajjej

    2017-06-01

    Full Text Available Wireless Sensor Network (WSN is one of the most dominant technology trends in the upcoming decades. Due to the lack of communication infrastructure, designing a WSN has posed a real challenge to the designers. WSNs should capture information from the environment, acquired, receive and retransmit them while having enough lifetime to reach many decades without external intervention. Thus, optimizing some objective functions, like energy consumption and coverage at the levels of nodes deployment is required to enhance the performances. In this work, deployment issue has been modeled as a constrained multi-objective optimization (MOO problem. The aim of this work was to find the optimal sensor nodes positions in the area of interest in terms of coverage, energy consumption and network connectivity. A new multi-objective optimization approach based on Flower Pollination Algorithm (FPA was introduced. The simulation results show that the proposed approach improve both coverage and energy consumption compared with other multi objective approaches.

  8. Dynamic fair node spectrum allocation for ad hoc networks using random matrices

    Science.gov (United States)

    Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

    2015-05-01

    Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

  9. Efficient and Stable Routing Algorithm Based on User Mobility and Node Density in Urban Vehicular Network

    Science.gov (United States)

    Al-Mayouf, Yusor Rafid Bahar; Ismail, Mahamod; Abdullah, Nor Fadzilah; Wahab, Ainuddin Wahid Abdul; Mahdi, Omar Adil; Khan, Suleman; Choo, Kim-Kwang Raymond

    2016-01-01

    Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destination node via multi-hop routing techniques. An appropriate, efficient, and stable routing algorithm must be developed for various VANET applications to address the issues of dynamic topology and intermittent connectivity. Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). The proposed algorithm can adapt to significant changes that may occur in the urban vehicular environment. This algorithm works by selecting an optimal route on the basis of hop count and link duration for delivering data from source to destination, thereby satisfying various quality of service considerations. The validity of the proposed algorithm is investigated by its comparison with ARP-QD protocol, which works on the mechanism of optimal route finding in VANETs in urban environments. Simulation results reveal that the proposed ESRA-MD algorithm shows remarkable improvement in terms of delivery ratio, delivery delay, and communication overhead. PMID:27855165

  10. An efficient approach to node localisation and tracking in wireless sensor networks

    CSIR Research Space (South Africa)

    Mwila, MK

    2014-12-01

    Full Text Available algorithm is implemented in Matlab. Simulation results show that the proposed approach increases the accuracy of existing methods using RSSI by up to 59%. Index Terms—Antenna Radiation Pattern, Node Localisation, Sensor Data Fusion, Gauss-Newton Optimisation... radiation patterns are proposed to provide an initial estimate from which the final position can be refined in few steps using an optimisation method such as the Gauss-Newton method. Globecom 2014 - Ad Hoc and Sensor Networking Symposium 978...

  11. Performance Evaluation of AODV, DSDV & DSR for Quasi Random Deployment of Sensor Nodes in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Kulkarni, Nandkumar P.; Prasad, Ramjee; Cornean, Horia

    2011-01-01

    Sensor deployment is one of the key topics addressed in Wireless Sensor Network (WSN). This paper proposes a new deployment technique of sensor nodes for WSN called as Quasi Random Deployment (QRD). The novel approach to deploy sensor nodes in QRD fashion is to improve the energy efficiency...... of the WSN in order to increase the network life time and coverage. The QRD produces highly uniform coordinates and it systematically fills the specified area. Along with Random Deployment (RD) pattern of wireless sensor node QRD is analysed in this study. The network is simulated using NS-2 simulator...... energy consumption, coverage area. The simulation results show that the conventional routing protocols like DSR have a best performance for both RD and QRD of the sensor nodes when there is no mobility of the sensor nodes as compared to AODV and DSDV. Among AODV and DSDV, AODV performs better as compared...

  12. A novel ingress node design for video streaming over optical burst switching networks.

    Science.gov (United States)

    Askar, S; Zervas, G; Hunter, D K; Simeonidou, D

    2011-12-12

    This paper introduces a novel ingress node design which takes advantage of video data partitioning in order to deliver enhanced video streaming quality when using H.264/AVC codec over optical burst switching networks. Ns2 simulations show that the proposed scheme delivers improved video traffic quality without affecting other traffic, such as best effort traffic. Although the extra network load is comparatively small, the average gain in video PSNR was 5 dB over existing burst cloning schemes, with a maximum end-to-end delay of 17 ms, and jitter of less than 0.35 ms. © 2011 Optical Society of America

  13. [Advances in sensor node and wireless communication technology of body sensor network].

    Science.gov (United States)

    Lin, Weibing; Lei, Sheng; Wei, Caihong; Li, Chunxiang; Wang, Cang

    2012-06-01

    With the development of the wireless communication technology, implantable biosensor technology, and embedded system technology, Body Sensor Network (BSN) as one branch of wireless sensor networks and important part of the Internet of things has caught more attention of researchers and enterprises. This paper offers the basic concept of the BSN and analyses the related research. We focus on sensor node and wireless communication technology from perspectives of technology challenges, research advance and development trend in the paper. Besides, we also present a relative overview of domestic and overseas projects for the BSN.

  14. Metabolic anchor reactions for robust biorefining.

    Science.gov (United States)

    Jouhten, Paula; Huerta-Cepas, Jaime; Bork, Peer; Patil, Kiran Raosaheb

    2017-03-01

    Microbial cell factories based on renewable carbon sources are fundamental to a sustainable bio-economy. The economic feasibility of producer cells requires robust performance balancing growth and production. However, the inherent competition between these two objectives often leads to instability and reduces productivity. While algorithms exist to design metabolic network reduction strategies for aligning these objectives, the biochemical basis of the growth-product coupling has remained unresolved. Here, we reveal key reactions in the cellular biochemical repertoire as universal anchor reactions for aligning cell growth and production. A necessary condition for a reaction to be an anchor is that it splits a substrate into two or more molecules. By searching the currently known biochemical reaction space, we identify 62 C-C cleaving anchor reactions, such as isocitrate lyase (EC 4.1.3.1) and L-tryptophan indole-lyase (EC 4.1.99.1), which are relevant for biorefining. The here identified anchor reactions mark network nodes for basing growth-coupled metabolic engineering and novel pathway designs. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

  15. A point-based angular analysis model for identifying attributes of spaces at nodes in street networks

    Science.gov (United States)

    Jeong, Sang Kyu; Ban, Yong Un

    2016-05-01

    The effects of the axial map as the key representation of the original space syntax have been questioned by some researchers because of the map's discontinuity. To address this concern, angular segment analysis (ASA) was introduced. ASA calculates spatial depths by considering the turning angles of path segments in a street network. However, ASA cannot calculate the attributes of nodes connected to path segments in the network because it analyzes spaces by linear representation, as in the original space syntax. Because the attributes of the two ends (nodes) of a given path segment (link) are not equal to each other, and because they can affect pedestrian and vehicle movement and land use in a street network, the identification of the attributes at nodes (points) would be helpful in the detailed analysis of spaces in the network consisting of nodes and the segments connecting them. Accordingly, this study aims to develop an extended analysis model that can calculate the attributes of spaces at the nodes, including terminuses, bends, and junctions, in the network. To achieve this end, in this study we developed algorithms for a point-based angular analysis (PAA) to find the attributes of spaces at nodes (points), in contrast to ASA, which analyzes spaces using linear representations. As a result, this methodology can obtain distinct values for the attributes of two nodes at the ends of a path segment, through the calculation of spatial depths weighted by considering the turning angles and distances (lengths) along consecutive nodes for a route in the network. Through our methodology, it was identified that spatial configurations of street network affect the social and symbolic centralities of nodes in the network.

  16. Efficient randomization of biological networks while preserving functional characterization of individual nodes.

    Science.gov (United States)

    Iorio, Francesco; Bernardo-Faura, Marti; Gobbi, Andrea; Cokelaer, Thomas; Jurman, Giuseppe; Saez-Rodriguez, Julio

    2016-12-20

    Networks are popular and powerful tools to describe and model biological processes. Many computational methods have been developed to infer biological networks from literature, high-throughput experiments, and combinations of both. Additionally, a wide range of tools has been developed to map experimental data onto reference biological networks, in order to extract meaningful modules. Many of these methods assess results' significance against null distributions of randomized networks. However, these standard unconstrained randomizations do not preserve the functional characterization of the nodes in the reference networks (i.e. their degrees and connection signs), hence including potential biases in the assessment. Building on our previous work about rewiring bipartite networks, we propose a method for rewiring any type of unweighted networks. In particular we formally demonstrate that the problem of rewiring a signed and directed network preserving its functional connectivity (F-rewiring) reduces to the problem of rewiring two induced bipartite networks. Additionally, we reformulate the lower bound to the iterations' number of the switching-algorithm to make it suitable for the F-rewiring of networks of any size. Finally, we present BiRewire3, an open-source Bioconductor package enabling the F-rewiring of any type of unweighted network. We illustrate its application to a case study about the identification of modules from gene expression data mapped on protein interaction networks, and a second one focused on building logic models from more complex signed-directed reference signaling networks and phosphoproteomic data. BiRewire3 it is freely available at https://www.bioconductor.org/packages/BiRewire/ , and it should have a broad application as it allows an efficient and analytically derived statistical assessment of results from any network biology tool.

  17. Replica Node Detection Using Enhanced Single Hop Detection with Clonal Selection Algorithm in Mobile Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    L. S. Sindhuja

    2016-01-01

    Full Text Available Security of Mobile Wireless Sensor Networks is a vital challenge as the sensor nodes are deployed in unattended environment and they are prone to various attacks. One among them is the node replication attack. In this, the physically insecure nodes are acquired by the adversary to clone them by having the same identity of the captured node, and the adversary deploys an unpredictable number of replicas throughout the network. Hence replica node detection is an important challenge in Mobile Wireless Sensor Networks. Various replica node detection techniques have been proposed to detect these replica nodes. These methods incur control overheads and the detection accuracy is low when the replica is selected as a witness node. This paper proposes to solve these issues by enhancing the Single Hop Detection (SHD method using the Clonal Selection algorithm to detect the clones by selecting the appropriate witness nodes. The advantages of the proposed method include (i increase in the detection ratio, (ii decrease in the control overhead, and (iii increase in throughput. The performance of the proposed work is measured using detection ratio, false detection ratio, packet delivery ratio, average delay, control overheads, and throughput. The implementation is done using ns-2 to exhibit the actuality of the proposed work.

  18. Inference of targeted interactions of networks with data of driving and driven nodes only by applying fast-varying noise signals

    Science.gov (United States)

    Zhang, Chaoyang; Chen, Yang; Hu, Gang

    2017-08-01

    Most complex social, biological and technological systems can be described by dynamic networks. Reconstructing network structures from measurable data is a fundamental problem in almost all interdisciplinary fields. Network nodes interact to each other, therefore, the accurate reconstruction of any interaction to a node requires data measurements of all its neighboring nodes. When networks are large, these data are often unavailable and thus network inference turns to be difficult. Here, we propose a method to use fast-varying noise driving (FVND) to enhance targeted interactions. With applications of noise driving we can infer any interaction from a driving node to a driven node with known data of these two nodes only while all other nodes are hidden, though the driven node may be actually driven by a large number of hidden nodes. Analytical derivation of the FVND method is conducted and numerical simulations perfectly justify the theoretical derivation.

  19. A fluid model for a relay node in an ad-hoc network: the case of heavy-tailed input

    NARCIS (Netherlands)

    R. Bekker (Rene); M.R.H. Mandjes (Michel)

    2007-01-01

    textabstractRelay nodes in an ad-hoc network can be modelled as fluid queues, in which the available service capacity is shared by the input and output. In this paper such a relay node is considered; jobs arrive according to a Poisson process and bring along a random amount of work. The total

  20. Well-dispersed sulfur anchored on interconnected polypyrrole nanofiber network as high performance cathode for lithium-sulfur batteries

    Science.gov (United States)

    Yin, Fuxing; Liu, Xinyi; Zhang, Yongguang; Zhao, Yan; Menbayeva, Almagul; Bakenov, Zhumabay; Wang, Xin

    2017-04-01

    Preparation of novel sulfur/polypyrrole (S/PPy) composite consisting well-dispersed sulfur particles anchored on interconnected PPy nanowire network was demonstrated. In such hybrid structure, the as-prepared PPy clearly displays a three-dimensionally cross-linked and hierarchical porous structure, which was utilized in the composite cathode as a conductive network trapping soluble polysulfide intermediates and enhancing the overall electrochemical performance of the system. Benefiting from this unique structure, the S/PPy composite demonstrated excellent cycling stability, resulting in a discharge capacity of 931 mAh g-1 at the second cycle and retained about 54% of this value over 100 cycles at 0.1 C. Furthermore, the S/PPy composite cathode exhibits a good rate capability with a discharge capacity of 584 mAh g-1 at 1 C.

  1. Effects in the network topology due to node aggregation: Empirical evidence from the domestic maritime transportation in Greece

    Science.gov (United States)

    Tsiotas, Dimitrios; Polyzos, Serafeim

    2018-02-01

    This article studies the topological consistency of spatial networks due to node aggregation, examining the changes captured between different network representations that result from nodes' grouping and they refer to the same socioeconomic system. The main purpose of this study is to evaluate what kind of topological information remains unalterable due to node aggregation and, further, to develop a framework for linking the data of an empirical network with data of its socioeconomic environment, when the latter are available for hierarchically higher levels of aggregation, in an effort to promote the interdisciplinary research in the field of complex network analysis. The research question is empirically tested on topological and socioeconomic data extracted from the Greek Maritime Network (GMN) that is modeled as a non-directed multilayer (bilayer) graph consisting of a port-layer, where nodes represent ports, and a prefecture-layer, where nodes represent coastal and insular prefectural groups of ports. The analysis highlights that the connectivity (degree) of the GMN is the most consistent aspect of this multilayer network, which preserves both the topological and the socioeconomic information through node aggregation. In terms of spatial analysis and regional science, such effects illustrate the effectiveness of the prefectural administrative division for the functionality of the Greek maritime transportation system. Overall, this approach proposes a methodological framework that can enjoy further applications about the grouping effects induced on the network topology, providing physical, technical, socioeconomic, strategic or political insights.

  2. Centroid Localization of Uncooperative Nodes in Wireless Networks Using a Relative Span Weighting Method

    Directory of Open Access Journals (Sweden)

    Christine Laurendeau

    2010-01-01

    Full Text Available Increasingly ubiquitous wireless technologies require novel localization techniques to pinpoint the position of an uncooperative node, whether the target is a malicious device engaging in a security exploit or a low-battery handset in the middle of a critical emergency. Such scenarios necessitate that a radio signal source be localized by other network nodes efficiently, using minimal information. We propose two new algorithms for estimating the position of an uncooperative transmitter, based on the received signal strength (RSS of a single target message at a set of receivers whose coordinates are known. As an extension to the concept of centroid localization, our mechanisms weigh each receiver's coordinates based on the message's relative RSS at that receiver, with respect to the span of RSS values over all receivers. The weights may decrease from the highest RSS receiver either linearly or exponentially. Our simulation results demonstrate that for all but the most sparsely populated wireless networks, our exponentially weighted mechanism localizes a target node within the regulations stipulated for emergency services location accuracy.

  3. A trust evaluation algorithm for wireless sensor networks based on node behaviors and D-S evidence theory.

    Science.gov (United States)

    Feng, Renjian; Xu, Xiaofeng; Zhou, Xiang; Wan, Jiangwen

    2011-01-01

    For wireless sensor networks (WSNs), many factors, such as mutual interference of wireless links, battlefield applications and nodes exposed to the environment without good physical protection, result in the sensor nodes being more vulnerable to be attacked and compromised. In order to address this network security problem, a novel trust evaluation algorithm defined as NBBTE (Node Behavioral Strategies Banding Belief Theory of the Trust Evaluation Algorithm) is proposed, which integrates the approach of nodes behavioral strategies and modified evidence theory. According to the behaviors of sensor nodes, a variety of trust factors and coefficients related to the network application are established to obtain direct and indirect trust values through calculating weighted average of trust factors. Meanwhile, the fuzzy set method is applied to form the basic input vector of evidence. On this basis, the evidence difference is calculated between the indirect and direct trust values, which link the revised D-S evidence combination rule to finally synthesize integrated trust value of nodes. The simulation results show that NBBTE can effectively identify malicious nodes and reflects the characteristic of trust value that 'hard to acquire and easy to lose'. Furthermore, it is obvious that the proposed scheme has an outstanding advantage in terms of illustrating the real contribution of different nodes to trust evaluation.

  4. A Centralized Detection of Sinkhole Attacks Based on Energy Level of the Nodes on Cluster-Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Merve Nilay Aydın

    2017-10-01

    Full Text Available Wireless Sensor Networks is consist of thousands of small and low-cost devices, which communicate over wireless medium. Due to locating in harsh environment and having limited resources, WSN is prone to various attacks. One of the most dangerous attacks threatening WSN is the sinkhole attack. In this paper, sinkhole attack is modelled on a cluster-based WSN, and a centralized detection algorithm based on the remaining energies of the nodes is proposed. The simulations were run for different values of energy thresholds and various numbers of nodes. The performance of the system was investigated over total energy consumption in the system, the number of packets arrived at base station and true detection rate of the sinkhole node(s. The results showed that the proposed method is energy-efficient and detects the malicious nodes with a 100% accuracy for all number of nodes.

  5. Predicting the connectivity of primate cortical networks from topological and spatial node properties

    Directory of Open Access Journals (Sweden)

    Kaiser Marcus

    2007-03-01

    Full Text Available Abstract Background The organization of the connectivity between mammalian cortical areas has become a major subject of study, because of its important role in scaffolding the macroscopic aspects of animal behavior and intelligence. In this study we present a computational reconstruction approach to the problem of network organization, by considering the topological and spatial features of each area in the primate cerebral cortex as subsidy for the reconstruction of the global cortical network connectivity. Starting with all areas being disconnected, pairs of areas with similar sets of features are linked together, in an attempt to recover the original network structure. Results Inferring primate cortical connectivity from the properties of the nodes, remarkably good reconstructions of the global network organization could be obtained, with the topological features allowing slightly superior accuracy to the spatial ones. Analogous reconstruction attempts for the C. elegans neuronal network resulted in substantially poorer recovery, indicating that cortical area interconnections are relatively stronger related to the considered topological and spatial properties than neuronal projections in the nematode. Conclusion The close relationship between area-based features and global connectivity may hint on developmental rules and constraints for cortical networks. Particularly, differences between the predictions from topological and spatial properties, together with the poorer recovery resulting from spatial properties, indicate that the organization of cortical networks is not entirely determined by spatial constraints.

  6. Relay selection in underlay cognitive networks with fixed transmission power nodes

    KAUST Repository

    Hussain, Syed Imtiaz

    2013-07-31

    Underlay cognitive networks operate simultaneously with primary networks satisfying stringent interference constraints, which reduces their transmission power and coverage area. To reach remote destinations, secondary sources use relaying techniques. Selecting the best relay among the available ones is a well known technique. Recently, selective cooperation is investigated in cognitive networks where the secondary nodes can adapt their transmission power to always satisfy the interference threshold. In this paper, we investigate a situation where the secondary nodes have a fixed transmission power and may violate the interference threshold. We present two relay selection schemes; the first one excludes the relays not satisfying the interference constraint and then picks up a relay from the remaining ones that can provide the maximum signal-to-noise ratio (SNR). The other scheme uses a quotient of the relay link SNR and the interference from the relay to the primary user and optimizes it to maximise the relay link SNR. We derive closed form expressions for outage probability, bit error rate, channel capacity and diversity of the system for both schemes by using tight approximations. We also study mutual effects of interference. Simulation results confirm the analytical results and reveal that the relay selection is feasible at low SNRs. Copyright © 2013 John Wiley & Sons, Ltd.

  7. A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks

    Science.gov (United States)

    Liu, Dong; Jing, Yun; Zhao, Jing; Wang, Wenjun; Song, Guojie

    2017-02-01

    One of the key problems in social network analysis is influence maximization, which has great significance both in theory and practical applications. Given a complex network and a positive integer k, and asks the k nodes to trigger the largest expected number of the remaining nodes. Many mature algorithms are mainly divided into propagation-based algorithms and topology- based algorithms. The propagation-based algorithms are based on optimization of influence spread process, so the influence spread of them significantly outperforms the topology-based algorithms. But these algorithms still takes days to complete on large networks. Contrary to propagation based algorithms, the topology-based algorithms are based on intuitive parameter statistics and static topology structure properties. Their running time are extremely short but the results of influence spread are unstable. In this paper, we propose a novel topology-based algorithm based on local index rank (LIR). The influence spread of our algorithm is close to the propagation-based algorithm and sometimes over them. Moreover, the running time of our algorithm is millions of times shorter than that of propagation-based algorithms. Our experimental results show that our algorithm has a good and stable performance in IC and LT model.

  8. Multi-Channel Multi-Radio Using 802.11 Based Media Access for Sink Nodes in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kok-Keong Loo

    2011-05-01

    Full Text Available The next generation surveillance and multimedia systems will become increasingly deployed as wireless sensor networks in order to monitor parks, public places and for business usage. The convergence of data and telecommunication over IP-based networks has paved the way for wireless networks. Functions are becoming more intertwined by the compelling force of innovation and technology. For example, many closed-circuit TV premises surveillance systems now rely on transmitting their images and data over IP networks instead of standalone video circuits. These systems will increase their reliability in the future on wireless networks and on IEEE 802.11 networks. However, due to limited non-overlapping channels, delay, and congestion there will be problems at sink nodes. In this paper we provide necessary conditions to verify the feasibility of round robin technique in these networks at the sink nodes by using a technique to regulate multi-radio multichannel assignment. We demonstrate through simulations that dynamic channel assignment scheme using multi-radio, and multichannel configuration at a single sink node can perform close to optimal on the average while multiple sink node assignment also performs well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

  9. A Novel Topology Link-Controlling Approach for Active Defense of a Node in a Network

    Directory of Open Access Journals (Sweden)

    Jun Li

    2017-03-01

    Full Text Available With the rapid development of virtual machine technology and cloud computing, distributed denial of service (DDoS attacks, or some peak traffic, poses a great threat to the security of the network. In this paper, a novel topology link control technique and mitigation attacks in real-time environments is proposed. Firstly, a non-invasive method of deploying virtual sensors in the nodes is built, which uses the resource manager of each monitored node as a sensor. Secondly, a general topology-controlling approach of resisting the tolerant invasion is proposed. In the proposed approach, a prediction model is constructed by using copula functions for predicting the peak of a resource through another resource. The result of prediction determines whether or not to initiate the active defense. Finally, a minority game with incomplete strategy is employed to suppress attack flows and improve the permeability of the normal flows. The simulation results show that the proposed approach is very effective in protecting nodes.

  10. A Novel Topology Link-Controlling Approach for Active Defense of a Node in a Network.

    Science.gov (United States)

    Li, Jun; Hu, HanPing; Ke, Qiao; Xiong, Naixue

    2017-03-09

    With the rapid development of virtual machine technology and cloud computing, distributed denial of service (DDoS) attacks, or some peak traffic, poses a great threat to the security of the network. In this paper, a novel topology link control technique and mitigation attacks in real-time environments is proposed. Firstly, a non-invasive method of deploying virtual sensors in the nodes is built, which uses the resource manager of each monitored node as a sensor. Secondly, a general topology-controlling approach of resisting the tolerant invasion is proposed. In the proposed approach, a prediction model is constructed by using copula functions for predicting the peak of a resource through another resource. The result of prediction determines whether or not to initiate the active defense. Finally, a minority game with incomplete strategy is employed to suppress attack flows and improve the permeability of the normal flows. The simulation results show that the proposed approach is very effective in protecting nodes.

  11. Localisation of Sensor Nodes with Hybrid Measurements in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Muhammad W. Khan

    2016-07-01

    Full Text Available Localisation in wireless networks faces challenges such as high levels of signal attenuation and unknown path-loss exponents, especially in urban environments. In response to these challenges, this paper proposes solutions to localisation problems in noisy environments. A new observation model for localisation of static nodes is developed based on hybrid measurements, namely angle of arrival and received signal strength data. An approach for localisation of sensor nodes is proposed as a weighted linear least squares algorithm. The unknown path-loss exponent associated with the received signal strength is estimated jointly with the coordinates of the sensor nodes via the generalised pattern search method. The algorithm’s performance validation is conducted both theoretically and by simulation. A theoretical mean square error expression is derived, followed by the derivation of the linear Cramer-Rao bound which serves as a benchmark for the proposed location estimators. Accurate results are demonstrated with 25%–30% improvement in estimation accuracy with a weighted linear least squares algorithm as compared to linear least squares solution.

  12. Interpenetrating graphene networks: Three-dimensional node-line semimetals with massive negative linear compressibilities

    Science.gov (United States)

    Lin, Yangzheng; Zhao, Zhisheng; Strobel, Timothy A.; Cohen, R. E.

    2016-12-01

    We investigated the stability and mechanical and electronic properties of 15 metastable mixed s p2-s p3 carbon allotropes in the family of interpenetrating graphene networks (IGNs) using density functional theory (DFT). IGN allotropes exhibit nonmonotonic bulk and linear compressibilities before their structures irreversibly transform into new configurations under large hydrostatic compression. The maximum bulk compressibilities vary widely between structures and range from 3.6 to 306 TPa-1. We find all the IGN allotropes have negative linear compressibilities with maximum values varying from -0.74 to -133 TPa-1. The maximal negative linear compressibility of Z33 (-133 TPa-1 at 3.4 GPa) exceeds previously reported values at pressures higher than 1.0 GPa. IGN allotropes can be classified as either armchair or zigzag type, and these two types of IGNs exhibit different electronic properties. Zigzag-type IGNs are node-line semimetals, while armchair-type IGNs are either semiconductors or node-loop or node-line semimetals. Experimental synthesis of these IGN allotropes might be realized since their formation enthalpies relative to graphite are only 0.1-0.5 eV/atom (that of C60 fullerene is about 0.4 eV/atom), and energetically feasible binary compound pathways are possible.

  13. An energy-efficient and compact clustering scheme with temporary support nodes for cognitive radio sensor networks.

    Science.gov (United States)

    Salim, Shelly; Moh, Sangman; Choi, Dongmin; Chung, Ilyong

    2014-08-11

    A cognitive radio sensor network (CRSN) is a wireless sensor network whose sensor nodes are equipped with cognitive radio capability. Clustering is one of the most challenging issues in CRSNs, as all sensor nodes, including the cluster head, have to use the same frequency band in order to form a cluster. However, due to the nature of heterogeneous channels in cognitive radio, it is difficult for sensor nodes to find a cluster head. This paper proposes a novel energy-efficient and compact clustering scheme named clustering with temporary support nodes (CENTRE). CENTRE efficiently achieves a compact cluster formation by adopting two-phase cluster formation with fixed duration. By introducing a novel concept of temporary support nodes to improve the cluster formation, the proposed scheme enables sensor nodes in a network to find a cluster head efficiently. The performance study shows that not only is the clustering process efficient and compact but it also results in remarkable energy savings that prolong the overall network lifetime. In addition, the proposed scheme decreases both the clustering overhead and the average distance between cluster heads and their members.

  14. ANALISIS TRANSFER RATE PENAMBAHAN NODE PADA INFRASTRUKTUR MOBILE ADHOC NETWORK (MANET UNTUK FILE SERVER

    Directory of Open Access Journals (Sweden)

    Rudi Kurniawan

    2017-05-01

    Full Text Available Teknologi Wireless Network sudah lama ditemukan dan seiring waktu juga mengalami perkembangan, Namun sifat teknologi ini menggantungkan diri pada infrastruktur jaringan yang ada. Hal ini bias menjadi kelemahan tersendiri saat kondisi infrastruktur jaringan sedang mengalami gangguan, karena setiap komunikasi yang melewati infrastruktur jaringan tersebut tidak akan sampai pada tujuan. Teknologi jaringan Mobile Ad-hoc Network (MANET diciptakan sebagai antisipasi jika infrastruktur jaringan sedang mengalami gangguan. Dengan jaringan MANET sistem komunikasi yang dilakukan tidak membutuhkan infrastruktur jaringan karena tiap node pada jaringan tersebut bersifat mobile. Untuk menguji kemampuan MANET, pada penelitian ini akan menerapkan File Transfer Protocol (FTP sebagai media untuk melakukan komunikasi data file transfer yang diimplementasi pada jaringan MANET. Dari pengujian yang telah dilakukan diperoleh hasil bahwa File Transfer dapat berfungsi dengan baik saat diterapkan pada jaringan MANET.

  15. Stromal Cell Networks Regulate Lymphocyte Entry, Migration, and Territoriality in Lymph Nodes

    Science.gov (United States)

    Bajénoff, Marc; Egen, Jackson; Koo, Lily Y.; Laugier, Jean Pierre; Brau, Frédéric; Glaichenhaus, Nicolas; Germain, Ronald N.

    2009-01-01

    Summary Following entry into lymph nodes (LNs), B cells migrate to follicles, whereas T cells remain in the paracortex, with each lymphocyte type showing apparently random migration within these distinct areas. Other than chemokines, the factors contributing to this spatial segregation and to the observed patterns of lymphocyte movement are poorly characterized. By combining confocal, electron, and intravital microscopy, we show here that the fibroblastic reticular cell (FRC) network regulates naïve T cell access to the paracortex and also supports and defines the limits of T cell movement within this domain, whereas a distinct follicular dendritic cell (FDC) network similarly serves as the substratum for movement of follicular B cells. These results highlight the central role of stromal microanatomy in orchestrating cell migration within the LN. PMID:17112751

  16. Seeking the Important Nodes of Complex Networks in Product R&D Team Based on Fuzzy AHP and TOPSIS

    Directory of Open Access Journals (Sweden)

    Wei Zhang

    2013-01-01

    Full Text Available How to seek the important nodes of complex networks in product research and development (R&D team is particularly important for companies engaged in creativity and innovation. The previous literature mainly uses several single indicators to assess the node importance; this paper proposes a multiple attribute decision making model to tentatively solve these problems. Firstly, choose eight indicators as the evaluation criteria, four from centralization of complex networks: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality and four from structural holes of complex networks: effective size, efficiency, constraint, and hierarchy. Then, use fuzzy analytic hierarchy process (AHP to obtain the weights of these indicators and use technique for order preference by similarity to an ideal solution (TOPSIS to assess the importance degree of each node of complex networks. Finally, taking a product R&D team of a game software company as a research example, test the effectiveness, operability, and efficiency of the method we established.

  17. A Method with Node Autonomy to Preserve QoS in Networks with Per- Route Admission

    Directory of Open Access Journals (Sweden)

    Mateos-Papis

    2013-01-01

    Full Text Available This paper presents a method called the Short Term Protection (STP which is applied to fixed networks whereflows1 are constrained to follow specific routes, where the admission-process is distributed, per-route, and wherethe traffic is sensitive to delay (like MPEG4 traffic. The share of bandwidth of any route is protected, in the shortterm,against the traffic-increment of its intersecting-routes. In the long term, in every congested link, the share ofbandwidth between the routes that intersect at that link is proportional to the average relative measured demandsof those routes. The nodes act autonomously, without central administration. This method is expected to: 1 helpnetwork administrators to have confidence, within a time-frame , about the amount of bandwidth they count on forevery route; 2 allow a simple bandwidth management in the network, with prospect to be scalable to at least tensof nodes. This paper presents the general and detailed operation of the method, the evaluation of the method, bysimulations, including a comparison with other method, a discussion of a possible scenario of application,conclusions and possible paths for further research.

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

    Science.gov (United States)

    Ko, Teresa H [Castro Valley, CA; Berry, Nina M [Tracy, CA

    2011-09-20

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

  19. Correlated Spatio-Temporal Data Collection in Wireless Sensor Networks Based on Low Rank Matrix Approximation and Optimized Node Sampling

    Directory of Open Access Journals (Sweden)

    Xinglin Piao

    2014-12-01

    Full Text Available The emerging low rank matrix approximation (LRMA method provides an energy efficient scheme for data collection in wireless sensor networks (WSNs by randomly sampling a subset of sensor nodes for data sensing. However, the existing LRMA based methods generally underutilize the spatial or temporal correlation of the sensing data, resulting in uneven energy consumption and thus shortening the network lifetime. In this paper, we propose a correlated spatio-temporal data collection method for WSNs based on LRMA. In the proposed method, both the temporal consistence and the spatial correlation of the sensing data are simultaneously integrated under a new LRMA model. Moreover, the network energy consumption issue is considered in the node sampling procedure. We use Gini index to measure both the spatial distribution of the selected nodes and the evenness of the network energy status, then formulate and resolve an optimization problem to achieve optimized node sampling. The proposed method is evaluated on both the simulated and real wireless networks and compared with state-of-the-art methods. The experimental results show the proposed method efficiently reduces the energy consumption of network and prolongs the network lifetime with high data recovery accuracy and good stability.

  20. Adaptive multi-node multiple input and multiple output (MIMO) transmission for mobile wireless multimedia sensor networks.

    Science.gov (United States)

    Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

    2013-10-02

    Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase.

  1. Adaptive Multi-Node Multiple Input and Multiple Output (MIMO) Transmission for Mobile Wireless Multimedia Sensor Networks

    Science.gov (United States)

    Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

    2013-01-01

    Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase. PMID:24152920

  2. Hypothalamus-Anchored Resting Brain Network Changes before and after Sertraline Treatment in Major Depression

    Directory of Open Access Journals (Sweden)

    Rui Yang

    2014-01-01

    Full Text Available Sertraline, one of the oldest antidepressants, remains to be the most efficacious treatment for depression. However, major depression disorder (MDD is characterized by altered emotion processing and deficits in cognitive control. In cognitive interference tasks, patients with MDD have shown excessive hypothalamus activity. The purpose of this study was to examine the effects of antidepressant treatment (sertraline on hypothalamus-anchored resting brain circuitry. Functional magnetic resonance imaging was conducted on depressed patients (n=12 both before and after antidepressant treatment. After eight weeks of antidepressant treatment, patients with depression showed significantly increased connectivity between the hypothalamus and dorsolateral prefrontal cortex, orbitofrontal cortex, anterior cingulate cortex, insula, putamen, caudate, and claustrum. By contrast, decreased connectivity of the hypothalamus-related areas was primarily located in the inferior frontal gyrus, medial frontal gyrus, cingulated gyrus, precuneus, thalamus, and cerebellum. After eight weeks of antidepressant therapy, 8 out of the 12 depressed subjects achieved 70% reduction or better in depressive symptoms, as measured on the Hamilton depression rating scale. Our findings may infer that antidepressant treatment can alter the functional connectivity of the hypothalamus resting brain to achieve its therapeutic effect.

  3. Scalable Node-Centric Route Mutation for Defense of Large-Scale Software-Defined Networks

    Directory of Open Access Journals (Sweden)

    Yang Zhou

    2017-01-01

    Full Text Available Exploiting software-defined networking techniques, randomly and instantly mutating routes can disguise strategically important infrastructure and protect the integrity of data networks. Route mutation has been to date formulated as NP-complete constraint satisfaction problem where feasible sets of routes need to be generated with exponential computational complexities, limiting algorithmic scalability to large-scale networks. In this paper, we propose a novel node-centric route mutation method which interprets route mutation as a signature matching problem. We formulate the route mutation problem as a three-dimensional earth mover’s distance (EMD model and solve it by using a binary branch and bound method. Considering the scalability, we further propose that a heuristic method yields significantly lower computational complexities with marginal loss of robustness against eavesdropping. Simulation results show that our proposed methods can effectively disguise key infrastructure by reducing the difference of historically accumulative traffic among different switches. With significantly reduced complexities, our algorithms are of particular interest to safeguard large-scale networks.

  4. Micro-grid platform based on NODE.JS architecture, implemented in electrical network instrumentation

    Science.gov (United States)

    Duque, M.; Cando, E.; Aguinaga, A.; Llulluna, F.; Jara, N.; Moreno, T.

    2016-05-01

    In this document, I propose a theory about the impact of systems based on microgrids in non-industrialized countries that have the goal to improve energy exploitation through alternatives methods of a clean and renewable energy generation and the creation of the app to manage the behavior of the micro-grids based on the NodeJS, Django and IOJS technologies. The micro-grids allow the optimal way to manage energy flow by electric injection directly in electric network small urban's cells in a low cost and available way. In difference from conventional systems, micro-grids can communicate between them to carry energy to places that have higher demand in accurate moments. This system does not require energy storage, so, costs are lower than conventional systems like fuel cells, solar panels or else; even though micro-grids are independent systems, they are not isolated. The impact that this analysis will generate, is the improvement of the electrical network without having greater control than an intelligent network (SMART-GRID); this leads to move to a 20% increase in energy use in a specified network; that suggest there are others sources of energy generation; but for today's needs, we need to standardize methods and remain in place to support all future technologies and the best option are the Smart Grids and Micro-Grids.

  5. A Collaborative Approach for Monitoring Nodes Behavior during Spectrum Sensing to Mitigate Multiple Attacks in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    Mahmoud Khasawneh

    2017-01-01

    Full Text Available Spectrum sensing is the first step to overcome the spectrum scarcity problem in Cognitive Radio Networks (CRNs wherein all unutilized subbands in the radio environment are explored for better spectrum utilization. Adversary nodes can threaten these spectrum sensing results by launching passive and active attacks that prevent legitimate nodes from using the spectrum efficiently. Securing the spectrum sensing process has become an important issue in CRNs in order to ensure reliable and secure spectrum sensing and fair management of resources. In this paper, a novel collaborative approach during spectrum sensing process is proposed. It monitors the behavior of sensing nodes and identifies the malicious and misbehaving sensing nodes. The proposed approach measures the node’s sensing reliability using a value called belief level. All the sensing nodes are grouped into a specific number of clusters. In each cluster, a sensing node is selected as a cluster head that is responsible for collecting sensing-reputation reports from different cognitive nodes about each node in the same cluster. The cluster head analyzes information to monitor and judge the nodes’ behavior. By simulating the proposed approach, we showed its importance and its efficiency for achieving better spectrum security by mitigating multiple passive and active attacks.

  6. A data management proposal to connect in a hierarchical way nodes of the Spanish Long Term Ecological Research (LTER) network

    Science.gov (United States)

    Fuentes, Daniel; Pérez-Luque, Antonio J.; Bonet García, Francisco J.; Moreno-LLorca, Ricardo A.; Sánchez-Cano, Francisco M.; Suárez-Muñoz, María

    2017-04-01

    The Long Term Ecological Research (LTER) network aims to provide the scientific community, policy makers, and society with the knowledge and predictive understanding necessary to conserve, protect, and manage the ecosystems. LTER is organized into networks ranging from the global to national scale. In the top of network, the International Long Term Ecological Research (ILTER) Network coordinates among ecological researchers and LTER research networks at local, regional and global scales. In Spain, the Spanish Long Term Ecological Research (LTER-Spain) network was built to foster the collaboration and coordination between longest-lived ecological researchers and networks on a local scale. Currently composed by nine nodes, this network facilitates the data exchange, documentation and preservation encouraging the development of cross-disciplinary works. However, most nodes have no specific information systems, tools or qualified personnel to manage their data for continued conservation and there are no harmonized methodologies for long-term monitoring protocols. Hence, the main challenge is to place the nodes in its correct position in the network, providing the best tools that allow them to manage their data autonomously and make it easier for them to access information and knowledge in the network. This work proposes a connected structure composed by four LTER nodes located in southern Spain. The structure is built considering hierarchical approach: nodes that create information which is documented using metadata standards (such as Ecological Metadata Language, EML); and others nodes that gather metadata and information. We also take into account the capacity of each node to manage their own data and the premise that the data and metadata must be maintained where it is generated. The current state of the nodes is a follows: two of them have their own information management system (Sierra Nevada-Granada and Doñana Long-Term Socio-ecological Research Platform) and

  7. The Node Deployment of Intelligent Sensor Networks Based on the Spatial Difference of Farmland Soil.

    Science.gov (United States)

    Liu, Naisen; Cao, Weixing; Zhu, Yan; Zhang, Jingchao; Pang, Fangrong; Ni, Jun

    2015-11-11

    Considering that agricultural production is characterized by vast areas, scattered fields and long crop growth cycles, intelligent wireless sensor networks (WSNs) are suitable for monitoring crop growth information. Cost and coverage are the most key indexes for WSN applications. The differences in crop conditions are influenced by the spatial distribution of soil nutrients. If the nutrients are distributed evenly, the crop conditions are expected to be approximately uniform with little difference; on the contrary, there will be great differences in crop conditions. In accordance with the differences in the spatial distribution of soil information in farmland, fuzzy c-means clustering was applied to divide the farmland into several areas, where the soil fertility of each area is nearly uniform. Then the crop growth information in the area could be monitored with complete coverage by deploying a sensor node there, which could greatly decrease the deployed sensor nodes. Moreover, in order to accurately judge the optimal cluster number of fuzzy c-means clustering, a discriminant function for Normalized Intra-Cluster Coefficient of Variation (NICCV) was established. The sensitivity analysis indicates that NICCV is insensitive to the fuzzy weighting exponent, but it shows a strong sensitivity to the number of clusters.

  8. Optimal Energy Efficiency Fairness of Nodes in Wireless Powered Communication Networks.

    Science.gov (United States)

    Zhang, Jing; Zhou, Qingjie; Ng, Derrick Wing Kwan; Jo, Minho

    2017-09-15

    In wireless powered communication networks (WPCNs), it is essential to research energy efficiency fairness in order to evaluate the balance of nodes for receiving information and harvesting energy. In this paper, we propose an efficient iterative algorithm for optimal energy efficiency proportional fairness in WPCN. The main idea is to use stochastic geometry to derive the mean proportionally fairness utility function with respect to user association probability and receive threshold. Subsequently, we prove that the relaxed proportionally fairness utility function is a concave function for user association probability and receive threshold, respectively. At the same time, a sub-optimal algorithm by exploiting alternating optimization approach is proposed. Through numerical simulations, we demonstrate that our sub-optimal algorithm can obtain a result close to optimal energy efficiency proportional fairness with significant reduction of computational complexity.

  9. Coverage-Guaranteed Sensor Node Deployment Strategies for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chao Sha

    2010-03-01

    Full Text Available Deployment quality and cost are two conflicting aspects in wireless sensor networks. Random deployment, where the monitored field is covered by randomly and uniformly deployed sensor nodes, is an appropriate approach for large-scale network applications. However, their successful applications depend considerably on the deployment quality that uses the minimum number of sensors to achieve a desired coverage. Currently, the number of sensors required to meet the desired coverage is based on asymptotic analysis, which cannot meet deployment quality due to coverage overestimation in real applications. In this paper, we first investigate the coverage overestimation and address the challenge of designing coverage-guaranteed deployment strategies. To overcome this problem, we propose two deployment strategies, namely, the Expected-area Coverage Deployment (ECD and BOundary Assistant Deployment (BOAD. The deployment quality of the two strategies is analyzed mathematically. Under the analysis, a lower bound on the number of deployed sensor nodes is given to satisfy the desired deployment quality. We justify the correctness of our analysis through rigorous proof, and validate the effectiveness of the two strategies through extensive simulation experiments. The simulation results show that both strategies alleviate the coverage overestimation significantly. In addition, we also evaluate two proposed strategies in the context of target detection application. The comparison results demonstrate that if the target appears at the boundary of monitored region in a given random deployment, the average intrusion distance of BOAD is considerably shorter than that of ECD with the same desired deployment quality. In contrast, ECD has better performance in terms of the average intrusion distance when the invasion of intruder is from the inside of monitored region.

  10. Cooperative Anchor-Free Position Estimation for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Fu-Kai Chan

    2010-02-01

    Full Text Available This paper proposes a distributed algorithm for establishing connectivity and location estimation in cluster-based wireless sensor networks. The algorithm exploits the information flow while coping with distributed signal processing and the requirements of network scalability. Once the estimation procedure and communication protocol are performed, sensor clusters can be merged to establish a single global coordinate system without GPS sensors using only distance information. In order to adjust the sensor positions, the refinement schemes and cooperative fusion approaches are applied to reduce the estimation error and improve the measurement accuracy. This paper outlines the technical foundations of the localization techniques and presents the tradeoffs in algorithm design. The feasibility of the proposed schemes is shown to be effective under certain assumptions and the analysis is supported by simulation and numerical studies.

  11. Multi-Radio Mobile Device in Role of Hybrid Node Between WiFi and LTE networks

    Directory of Open Access Journals (Sweden)

    Pavel Masek

    2015-05-01

    Full Text Available With the ubiquitous wireless network coverage, Machine-Type Communications (MTC is emerging to enable data transfers using devices/sensors without need for human interaction. In this paper we, we introduce a comprehensive simulation scenario for modeling and analysis for heterogeneous MTC. We demonstrate the most expected scenario of MTC communication using the IEEE 802.11 standard for direct communication between sensors and for transmitting data between individual sensor and Machine-Type Communication Gateway (MTCG. The MTCG represents the hybrid node serving as bridge between two heterogeneous networks (WiFi and LTE. Following the idea of hybrid node, two active interfaces must be implemented on this node together with mechanism for handling the incoming traffic (from WiFi network to LTE network. As a simulation tool, the Network Simulator 3 (NS-3 with implemented LTE/EPC Network Simulator (LENA framework was used. The major contribution of this paper therefore lies in the implementation of logic for interconnection of two heterogeneous networks in simulation environment NS-3.

  12. Mobility Assisted Sensor Node Self-Deployment for Maximizing the Coverage of Wireless Sensor Networks using A Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    VV Juli

    2013-12-01

    Full Text Available Wireless sensor networks extend the capability to monitor and control far-flung environments. However, sensor nodes must be deployed appropriately to reach an adequate coverage level for the successful acquisition of data. Modern sensing devices are able to move from one place to another for different purposes and constitute the mobile sensor network. This mobile sensor capability could be used to enhance the coverage of the sensor network. Since mobile sensor nodes have limited capabilities and power constraints, the algorithms which drive the sensors to optimal locations should extend the coverage. It should also reduce the power needed to move the sensors efficiently. In this paper, a genetic algorithm- (GA based sensor deployment scheme is proposed to maximize network coverage, and the performance was studied with the random deployment using a Matlab simulation.

  13. Three faces of node importance in network epidemiology: Exact results for small graphs

    Science.gov (United States)

    Holme, Petter

    2017-12-01

    We investigate three aspects of the importance of nodes with respect to susceptible-infectious-removed (SIR) disease dynamics: influence maximization (the expected outbreak size given a set of seed nodes), the effect of vaccination (how much deleting nodes would reduce the expected outbreak size), and sentinel surveillance (how early an outbreak could be detected with sensors at a set of nodes). We calculate the exact expressions of these quantities, as functions of the SIR parameters, for all connected graphs of three to seven nodes. We obtain the smallest graphs where the optimal node sets are not overlapping. We find that (i) node separation is more important than centrality for more than one active node, (ii) vaccination and influence maximization are the most different aspects of importance, and (iii) the three aspects are more similar when the infection rate is low.

  14. Optimal Power Allocation of Relay Sensor Node Capable of Energy Harvesting in Cooperative Cognitive Radio Network.

    Science.gov (United States)

    Son, Pham Ngoc; Har, Dongsoo; Cho, Nam Ik; Kong, Hyung Yun

    2017-03-21

    A cooperative cognitive radio scheme exploiting primary signals for energy harvesting is proposed. The relay sensor node denoted as the secondary transmitter (ST) harvests energy from the primary signal transmitted from the primary transmitter, and then uses it to transmit power superposed codes of the secrecy signal of the secondary network (SN) and of the primary signal of the primary network (PN). The harvested energy is split into two parts according to a power splitting ratio, one for decoding the primary signal and the other for charging the battery. In power superposition coding, the amount of fractional power allocated to the primary signal is determined by another power allocation parameter (e.g., the power sharing coefficient). Our main concern is to investigate the impact of the two power parameters on the performances of the PN and the SN. Analytical or mathematical expressions of the outage probabilities of the PN and the SN are derived in terms of the power parameters, location of the ST, channel gain, and other system related parameters. A jointly optimal power splitting ratio and power sharing coefficient for achieving target outage probabilities of the PN and the SN, are found using these expressions and validated by simulations.

  15. Sparsity-Based Optimization of the Sensors Positions in Radar Networks with Separated Transmit and Receive Nodes

    NARCIS (Netherlands)

    Ivashko, I.M.; Krasnov, O.A.; Yarovoy, A.G.

    2016-01-01

    A sparsity-based approach for the joint optimization of the transmit and the receive nodes positions in the radar network with widely distributed antennas is proposed in this paper. The optimization problem is formulated as minimization of the number of radars that meet fixed target localization

  16. Equal opportunity for low-degree network nodes: a PageRank-based method for protein target identification in metabolic graphs.

    Science.gov (United States)

    Bánky, Dániel; Iván, Gábor; Grolmusz, Vince

    2013-01-01

    Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks) that compensates for the low degree (non-hub) vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges) of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well), but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus), and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures importance in the

  17. Equal opportunity for low-degree network nodes: a PageRank-based method for protein target identification in metabolic graphs.

    Directory of Open Access Journals (Sweden)

    Dániel Bánky

    Full Text Available Biological network data, such as metabolic-, signaling- or physical interaction graphs of proteins are increasingly available in public repositories for important species. Tools for the quantitative analysis of these networks are being developed today. Protein network-based drug target identification methods usually return protein hubs with large degrees in the networks as potentially important targets. Some known, important protein targets, however, are not hubs at all, and perturbing protein hubs in these networks may have several unwanted physiological effects, due to their interaction with numerous partners. Here, we show a novel method applicable in networks with directed edges (such as metabolic networks that compensates for the low degree (non-hub vertices in the network, and identifies important nodes, regardless of their hub properties. Our method computes the PageRank for the nodes of the network, and divides the PageRank by the in-degree (i.e., the number of incoming edges of the node. This quotient is the same in all nodes in an undirected graph (even for large- and low-degree nodes, that is, for hubs and non-hubs as well, but may differ significantly from node to node in directed graphs. We suggest to assign importance to non-hub nodes with large PageRank/in-degree quotient. Consequently, our method gives high scores to nodes with large PageRank, relative to their degrees: therefore non-hub important nodes can easily be identified in large networks. We demonstrate that these relatively high PageRank scores have biological relevance: the method correctly finds numerous already validated drug targets in distinct organisms (Mycobacterium tuberculosis, Plasmodium falciparum and MRSA Staphylococcus aureus, and consequently, it may suggest new possible protein targets as well. Additionally, our scoring method was not chosen arbitrarily: its value for all nodes of all undirected graphs is constant; therefore its high value captures

  18. Multiscale River Hydraulic and Water Quality Observations Combining Stationary and Mobile Sensor Network Nodes

    Science.gov (United States)

    Harmon, T. C.; Fisher, J. C.; Kaiser, W. J.

    2006-05-01

    Increasing demands on water supplies, non-point source pollution, and water quality-based ecological concerns all point to the need for observing stream flow perturbations and pollutant discharges at higher resolution than was practical in the past. This work presents the results from a test of a rapidly deployable river observational approach consisting of four components: (1) existing geospatial data and federal, state, and private river gauging infrastructure for identifying key river reaches and critical sampling times, (2) human- actuated sensor deployments for broad spatial characterization of the targeted river reach, (3) stationary sensors embedded in the river and its sediments for longer term spatiotemporal observations within the targeted reach, and (4) the robotic Networked Infomechanical System (NIMS RD) for high resolution scanning of spatiotemporal hydraulic and chemical properties at specific points along the reach. The approach is demonstrated for a test bed deployment at the confluence of the Merced and San Joaquin Rivers in Central California. After identifying a suitable reach for the test deployment, a network of on-line gauging stations, accessed through the California Data Exchange Center (CDEC), is used to coordinate the timing of the subsequent three deployment aspects based on flow and river stage forecasts. Kayak-mounted sonar and water quality sensors are used to rapidly survey the test zone bathymetry and basic water quality parameters (temperature, salinity). Results from the rapid survey are then used to guide locations of the sediment- anchored sensor arrays (javelins) which include temperature, water pressure (depth) and water quality sensors distributed vertically at screened intervals. The NIMS RD is comprised of two supporting towers and a suspension cable delivering power and Internet connectivity for controlling and actuating the tram-like NIMS unit. The NIMS unit is capable of raising and lowering a payload of sensors

  19. A Topology Evolution Model Based on Revised PageRank Algorithm and Node Importance for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xiaogang Qi

    2015-01-01

    Full Text Available Wireless sensor network (WSN is a classical self-organizing communication network, and its topology evolution currently becomes one of the attractive issues in this research field. Accordingly, the problem is divided into two subproblems: one is to design a new preferential attachment method and the other is to analyze the dynamics of the network topology evolution. To solve the first subproblem, a revised PageRank algorithm, called Con-rank, is proposed to evaluate the node importance upon the existing node contraction, and then a novel preferential attachment is designed based on the node importance calculated by the proposed Con-rank algorithm. To solve the second one, we firstly analyze the network topology evolution dynamics in a theoretical way and then simulate the evolution process. Theoretical analysis proves that the network topology evolution of our model agrees with power-law distribution, and simulation results are well consistent with our conclusions obtained from the theoretical analysis and simultaneously show that our topology evolution model is superior to the classic BA model in the average path length and the clustering coefficient, and the network topology is more robust and can tolerate the random attacks.

  20. Coupled dynamics of node and link states in complex networks: a model for language competition

    Science.gov (United States)

    Carro, Adrián; Toral, Raúl; San Miguel, Maxi

    2016-11-01

    Inspired by language competition processes, we present a model of coupled evolution of node and link states. In particular, we focus on the interplay between the use of a language and the preference or attitude of the speakers towards it, which we model, respectively, as a property of the interactions between speakers (a link state) and as a property of the speakers themselves (a node state). Furthermore, we restrict our attention to the case of two socially equivalent languages and to socially inspired network topologies based on a mechanism of triadic closure. As opposed to most of the previous literature, where language extinction is an inevitable outcome of the dynamics, we find a broad range of possible asymptotic configurations, which we classify as: frozen extinction states, frozen coexistence states, and dynamically trapped coexistence states. Moreover, metastable coexistence states with very long survival times and displaying a non-trivial dynamics are found to be abundant. Interestingly, a system size scaling analysis shows, on the one hand, that the probability of language extinction vanishes exponentially for increasing system sizes and, on the other hand, that the time scale of survival of the non-trivial dynamical metastable states increases linearly with the size of the system. Thus, non-trivial dynamical coexistence is the only possible outcome for large enough systems. Finally, we show how this coexistence is characterized by one of the languages becoming clearly predominant while the other one becomes increasingly confined to ‘ghetto-like’ structures: small groups of bilingual speakers arranged in triangles, with a strong preference for the minority language, and using it for their intra-group interactions while they switch to the predominant language for communications with the rest of the population.

  1. Innovative energy resourceful merged layer technique (MLT of node deployment to enhance the lifetime of wireless sensor networks

    Directory of Open Access Journals (Sweden)

    S.G. Susila

    2015-03-01

    Full Text Available A wireless sensor network (WSN is consisting of anthology of large number of small sensor nodes which are deployed in a defined area to observe the surroundings parameters. Since, energy consumption is significant challenge in WSN. As sensor nodes are equipped with battery which has limited energy. Energy efficient information processing is most importance for many routing protocols were proposed to increase the lifetime of WSN. In order to improve the lifetime of WSN, the proposed MLT routing protocol has implemented where the sensor nodes are randomly deployed in the field. The merged layer node deployment pattern of the sensor nodes system operation maximizes the working time of full coverage in a given WSN. MLT provides energy-balancing while selecting cluster head (CH for each round. The cluster head selection mechanism is essential and has same procedure like Low Energy Adaptive Clustering Hierarchy (LEACH in MLT protocol. The main idea of this paper is combine two layers of sensor nodes which are belonging to the same set but in different group to improve the lifetime of WSN. MATLAB simulations are performed to analyze and compare the performance of MLT with LEACH protocol. The obtained simulation output has enhanced results and superfluous lifetime compared to other protocols.

  2. Hub nodes in the network of human Mitogen-Activated Protein Kinase (MAPK pathways: Characteristics and potential as drug targets

    Directory of Open Access Journals (Sweden)

    V.K. MD Aksam

    2017-01-01

    Full Text Available Proteins involved in the cross-talk between ERK1/2, ERK5, JNK, and P38 signalling pathways integrate the network of Mitogen-Activated Protein Kinase (MAPK pathways. Graph theory-based approach is used to construct the network of MAPK pathways, and to observe the network organisational principles. Connectivity pattern reveals rich-club among the hubs, enabling structural ordering. A positive correlation between the degree of the nodes and percentage of essential protein showed hubs are central to the network architecture and function. Furthermore, attributes like connectivity, inter/intra-pathway class, position in the pathway, protein type and subcellular localization of the essential and non-essential proteins are characterizing complex functional roles. Shared properties of 34 cancerous essential proteins lack to be drug targets. We identified the seven nodes overlapping properties of the hub, essential and causing side effects on targeting them. We exploit the strategy of cancerous, non-hub and non-essential proteins as potential drug targets and identified 4EBP1, BAD, CHOP10, GADD45, HSP27, MKP1, RNPK, MLTKa/b, cPLA2, eEF2K and elF4E. We have illustrated the implication of targeting hub nodes and proposed network-based drug targets which would cause less side effect.

  3. An improved power flow method based on extended chain-table storage structure for distribution network with PV nodes

    DEFF Research Database (Denmark)

    Chen, Shuheng; Wang, Xiongfei; Su, Chi

    2014-01-01

    Based on an extended chain-table storage structure, an improved power flow method is presented, which can be applied to a distribution network with multi PV nodes. The extended chain-table storage structure is designed on the basis of address-pointer technology describing the radial topology...... with a reduced memory size. The voltage error of each PV node is adjusted by a reactive power adjusting strategy. The adjusting strategy is based on a multi-variable linear function with an accelerating factor. Finally, this new improved power flow method is realized by the software system developed in VC...

  4. Application of artificial neural networks for predicting presence of non-sentinel lymph node metastases in breast cancer patients with positive sentinel lymph node biopsies.

    Science.gov (United States)

    Nowikiewicz, Tomasz; Wnuk, Paweł; Małkowski, Bogdan; Kurylcio, Andrzej; Kowalewski, Janusz; Zegarski, Wojciech

    2017-10-01

    The aim of this study was to present a new predictive tool for non-sentinel lymph node (nSLN) metastases. One thousand five hundred eighty-three patients with early-stage breast cancer were subjected to sentinel lymph node biopsy (SLNB) between 2004 and 2012. Metastatic SLNs were found in 348 patients - the retrospective group. Selective axillary lymph node dissection (ALND) was performed in 94% of cases. Involvement of the nSLNs was identified in 32.1% of patients following ALND. The correlation between nSLN involvement and selected epidemiological data, primary tumor features and details of the diagnostic and therapeutic management was examined in metastatic SLN group. Multivariate analysis was performed using an artificial neural network to create a new nomogram. The new test was validated using the overall study population consisting of the prospective group (365 patients - SLNB between 01-07.2013). Accuracy of the new test was calculated using area under the receiver operating characteristics curve (AUC). We obtained AUC coefficient equal to 0.87 (95% confidence interval: 0.81-0.92). Sensitivity amounted to 69%, specificity to 86%, accuracy - 80% (retrospective group) and 77%, 46%, 66% (validation group), respectively. The Memorial Sloan-Kettering Cancer Center (MSKCC) nomogram the calculated AUC value was 0.71, for Stanford - 0.68, for Tenon - 0.67. In the analyzed group only the MSKCC nomogram and the new model showed AUC values exceeding the expected level of 0.70. Our nomogram performs well in prospective validation on patient series. The overall assessment of clinical usefulness of this test will be possible after testing it on different patient populations.

  5. Cost Benefit Analysis of Utilising Mobile Nodes in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Mathur, Prateek; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

    2015-01-01

    . As they are expensive compared to static nodes in terms of manufactur- ing and mobility cost. This paper evaluates the utility of mobile nodes for use in WSNs in comparison with static nodes. Novel geometric models to rep- resent the various functionalities for which mobile could be used have been proposed, they have...... been utilised for the techno-economic evaluation based on cost benet analysis. The models have been designed such that they give a generic representation of the functionalities, and enable a fair comparison between them. On the basis of the analysis it is concluded that apart from the functional...... utility, mobile nodes are economically benecial for use in WSNs....

  6. The Performance Evaluation of an IEEE 802.11 Network Containing Misbehavior Nodes under Different Backoff Algorithms

    Directory of Open Access Journals (Sweden)

    Trong-Minh Hoang

    2017-01-01

    Full Text Available Security of any wireless network is always an important issue due to its serious impacts on network performance. Practically, the IEEE 802.11 medium access control can be violated by several native or smart attacks that result in downgrading network performance. In recent years, there are several studies using analytical model to analyze medium access control (MAC layer misbehavior issue to explore this problem but they have focused on binary exponential backoff only. Moreover, a practical condition such as the freezing backoff issue is not included in the previous models. Hence, this paper presents a novel analytical model of the IEEE 802.11 MAC to thoroughly understand impacts of misbehaving node on network throughput and delay parameters. Particularly, the model can express detailed backoff algorithms so that the evaluation of the network performance under some typical attacks through numerical simulation results would be easy.

  7. Ground wave emergency network environmental assessment for northwestern Colorado relay node site number RN 8C924CO

    Science.gov (United States)

    1993-02-01

    The Ground Wave Emergency Network (GWEN) is a radio communication system designed to relay emergency messages between strategic military areas in the continental United States. The system is immune to the effects of high-altitude electromagnetic pulse (HEMP) energy surges caused by nuclear bursts in the ionosphere that would disrupt conventional communications equipment such as telephones and shortwave radios. A failure of such equipment would prevent timely communications among top military and civilian leaders and strategic Air Force locations and prevent U.S. assessment and retaliation during an attack. GWEN is an essential part of a defense modernization program to upgrade and improve our nation's communications system, thereby strengthening deterrence. The GWEN system consists of a network of relay nodes, receive-only stations, and input/output stations. Each relay node, such as the one proposed in southern Nevada consists of a guyed radio tower facility similar to those used by commercial AM broadcast transmitters.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-08-27

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

  9. Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

    Science.gov (United States)

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

    Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.

  10. Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Madhumathy Perumal

    2015-01-01

    Full Text Available Data gathering and optimal path selection for wireless sensor networks (WSN using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS. This protocol finds the rendezvous point for optimal transmission of data using a “splitting tree” technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the “Biased Random Walk” model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR protocol to prove that there is increase in the network lifetime compared with other routing protocols.

  11. Anchor Modeling

    Science.gov (United States)

    Regardt, Olle; Rönnbäck, Lars; Bergholtz, Maria; Johannesson, Paul; Wohed, Petia

    Maintaining and evolving data warehouses is a complex, error prone, and time consuming activity. The main reason for this state of affairs is that the environment of a data warehouse is in constant change, while the warehouse itself needs to provide a stable and consistent interface to information spanning extended periods of time. In this paper, we propose a modeling technique for data warehousing, called anchor modeling, that offers non-destructive extensibility mechanisms, thereby enabling robust and flexible management of changes in source systems. A key benefit of anchor modeling is that changes in a data warehouse environment only require extensions, not modifications, to the data warehouse. This ensures that existing data warehouse applications will remain unaffected by the evolution of the data warehouse, i.e. existing views and functions will not have to be modified as a result of changes in the warehouse model.

  12. Experimental Demonstration of Multidimensional Switching Nodes for All-Optical Data Center Networks

    DEFF Research Database (Denmark)

    Kamchevska, Valerija; Medhin, Ashenafi Kiros; Da Ros, Francesco

    2016-01-01

    This paper reports on a novel ring-based data center architecture composed of multidimensional switching nodes. The nodes are interconnected with multicore fibers and can provide switching in three different physical, hierarchically overlaid dimensions (space, wavelength, and time). The proposed...... by increasing the transmission capacity to 1 Tbit/s/core equivalent to 7 Tbit/s total throughput in a single seven-core multicore fiber. The error-free performance (BER centers and accommodate...

  13. Pinning dynamic systems of networks with Markovian switching couplings and controller-node set

    OpenAIRE

    Han, Yujuan; Lu, Wenlian; Li, Zhe; Chen, Tianping

    2014-01-01

    In this paper, we study pinning control problem of coupled dynamical systems with stochastically switching couplings and stochastically selected controller-node set. Here, the coupling matrices and the controller-node sets change with time, induced by a continuous-time Markovian chain. By constructing Lyapunov functions, we establish tractable sufficient conditions for exponentially stability of the coupled system. Two scenarios are considered here. First, we prove that if each subsystem in t...

  14. A Fluid Model for a Relay Node in an Ad Hoc Network: Evaluation of Resource Sharing Policies

    Directory of Open Access Journals (Sweden)

    Werner Scheinhardt

    2008-07-01

    Full Text Available Fluid queues offer a natural framework for analyzing waiting times in a relay node of an ad hoc network. Because of the resource sharing policy applied, the input and output of these queues are coupled. More specifically, when there are n users who wish to transmit data through a specific node, each of them obtains a share 1/(n+w of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction w/(n+w is used to serve the queue; here w>0 is a free design parameter. Assume now that jobs arrive at the relay node according to a Poisson process, and that they bring along exponentially distributed amounts of data. The case w=1 has been addressed before; the present paper focuses on the intrinsically harder case w>1, that is, policies that give more weight to serving the queue. Four performance metrics are considered: (i the stationary workload of the queue, (ii the queueing delay, that is, the delay of a “packet” (a fluid particle that arrives at an arbitrary point in time, (iii the flow transfer delay, (iv the sojourn time, that is, the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. We explicitly compute the Laplace transforms of these random variables.

  15. Live and Dead Nodes

    DEFF Research Database (Denmark)

    Jørgensen, Sune Lehman; Jackson, A. D.

    2005-01-01

    In this paper, we explore the consequences of a distinction between `live' and `dead' network nodes; `live' nodes are able to acquire new links whereas `dead' nodes are static. We develop an analytically soluble growing network model incorporating this distinction and show that it can provide...... a quantitative description of the empirical network composed of citations and references (in- and out-links) between papers (nodes) in the SPIRES database of scientific papers in high energy physics. We also demonstrate that the death mechanism alone can result in power law degree distributions for the resulting...... network....

  16. mproved Correction Localization Algorithm Based on Dynamic Weighted Centroid for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xuejiao Chen

    2014-08-01

    Full Text Available For wireless sensor network applications that require location information for sensor nodes, locations of nodes can be estimated by a number of localization algorithms. However, precise location information may be unavailable due to the constraint in energy, computation, or terrain. An improved correction localization algorithm based on dynamic weighted centroid for wireless sensor networks was proposed in this paper. The idea is that each anchor node computes its position error through its neighbor anchor nodes in its range, the position error will be transform to distance error, according the distance between unknown node and anchor node and the anchor node’s distance error, the dynamic weighted value will be computed. For each unknown node, it can use the coordinate of anchor node in its range and the dynamic weighted value to compute it’s coordinate. Simulation results show that the localization accuracy of the proposed algorithm is better than the traditional centroid localization algorithm and weighted centroid localization algorithm, the position error of three algorithms is decreased along radius increasing, where the decreased trend of our algorithm is significant.

  17. Coverage extension and balancing the transmitted power of the moving relay node at LTE-A cellular network.

    Science.gov (United States)

    Aldhaibani, Jaafar A; Yahya, Abid; Ahmad, R Badlishah

    2014-01-01

    The poor capacity at cell boundaries is not enough to meet the growing demand and stringent design which required high capacity and throughput irrespective of user's location in the cellular network. In this paper, we propose new schemes for an optimum fixed relay node (RN) placement in LTE-A cellular network to enhance throughput and coverage extension at cell edge region. The proposed approach mitigates interferences between all nodes and ensures optimum utilization with the optimization of transmitted power. Moreover, we proposed a new algorithm to balance the transmitted power of moving relay node (MR) over cell size and providing required SNR and throughput at the users inside vehicle along with reducing the transmitted power consumption by MR. The numerical analysis along with the simulation results indicates that an improvement in capacity for users is 40% increment at downlink transmission from cell capacity. Furthermore, the results revealed that there is saving nearly 75% from transmitted power in MR after using proposed balancing algorithm. ATDI simulator was used to verify the numerical results, which deals with real digital cartographic and standard formats for terrain.

  18. An Activity Recognition Model Using Inertial Sensor Nodes in a Wireless Sensor Network for Frozen Shoulder Rehabilitation Exercises

    Directory of Open Access Journals (Sweden)

    Hsueh-Chun Lin

    2015-01-01

    Full Text Available This paper proposes a model for recognizing motions performed during rehabilitation exercises for frozen shoulder conditions. The model consists of wearable wireless sensor network (WSN inertial sensor nodes, which were developed for this study, and enables the ubiquitous measurement of bodily motions. The model employs the back propagation neural network (BPNN algorithm to compute motion data that are formed in the WSN packets; herein, six types of rehabilitation exercises were recognized. The packets sent by each node are converted into six components of acceleration and angular velocity according to three axes. Motor features such as basic acceleration, angular velocity, and derivative tilt angle were input into the training procedure of the BPNN algorithm. In measurements of thirteen volunteers, the accelerations and included angles of nodes were adopted from possible features to demonstrate the procedure. Five exercises involving simple swinging and stretching movements were recognized with an accuracy of 85%–95%; however, the accuracy with which exercises entailing spiral rotations were recognized approximately 60%. Thus, a characteristic space and enveloped spectrum improving derivative features were suggested to enable identifying customized parameters. Finally, a real-time monitoring interface was developed for practical implementation. The proposed model can be applied in ubiquitous healthcare self-management to recognize rehabilitation exercises.

  19. Backpropagation-Based Cooperative Localization of Primary User for Avoiding Hidden-Node Problem in Cognitive Networks

    Directory of Open Access Journals (Sweden)

    Lin Liu

    2010-01-01

    Full Text Available Cognitive radio (CR is a technology to implement opportunistic spectrum sharing to improve the spectrum utilization. However, there exists a hidden-node problem, which can be a big challenge to solve especially when the primary receiver is passive listening. We aim to provide a solution to the hidden-node problem for passive-listening receiver based on cooperation of multiple CRs. Specifically, we consider a cooperative GPS-enabled cognitive network. Once the existence of PU is detected, a localization algorithm will be employed to first estimate the path loss model for the environment based on backpropagation method and then to locate the position of PU. Finally, a disable region is identified taking into account the communication range of both the PU and the CR. The CRs within the disabled region are prohibited to transmit in order to avoid interfering with the primary receiver. Both analysis and simulation results are provided.

  20. Joint Power Allocation and Beamforming in Amplify-and-Forward Relay Networks under Per-Node Power Constraint

    Directory of Open Access Journals (Sweden)

    Farzin Azami

    2017-01-01

    Full Text Available Two-way relay networks (TWRN have been intensively investigated over the past decade due to their ability to enhance the performance assessment of networks in terms of cellular coverage and spectral efficiency. Yet, power control in such systems is a nontrivial issue, particularly in multirelay networks where relays are deployed to ensure a required Quality of Service (QoS. In this paper, we envision to address this critical issue by minimizing the sum-power with respect to per-node power consumption and acceptable users’ rates. To tackle this, we employ a variable transformation to turn the fractional quadratically constrained quadratic problem (QCQP into semidefinite programming (SDP. This algorithm is also extended to a distributed format. Simulation results of deploying 10 relay stations reveal that the total power consumption will decrease to approximately 8 dBW for 6 bps/Hz sum-rate.

  1. Which Brain Regions are Important for Seizure Dynamics in Epileptic Networks? Influence of Link Identification and EEG Recording Montage on Node Centralities.

    Science.gov (United States)

    Geier, Christian; Lehnertz, Klaus

    2017-02-01

    Nodes in large-scale epileptic networks that are crucial for seizure facilitation and termination can be regarded as potential targets for individualized focal therapies. Graph-theoretical approaches based on centrality concepts can help to identify such important nodes, however, they may be influenced by the way networks are derived from empirical data. Here we investigate evolving functional epileptic brain networks during 82 focal seizures with different anatomical onset locations that we derive from multichannel intracranial electroencephalographic recordings from 51 patients. We demonstrate how the various methodological steps (from the recording montage via node and link inference to the assessment of node centralities) affect importance estimation and discuss their impact on the interpretability of findings in the context of pathophysiological aspects of seizure dynamics.

  2. Modeling complex metabolic reactions, ecological systems, and financial and legal networks with MIANN models based on Markov-Wiener node descriptors.

    Science.gov (United States)

    Duardo-Sánchez, Aliuska; Munteanu, Cristian R; Riera-Fernández, Pablo; López-Díaz, Antonio; Pazos, Alejandro; González-Díaz, Humberto

    2014-01-27

    The use of numerical parameters in Complex Network analysis is expanding to new fields of application. At a molecular level, we can use them to describe the molecular structure of chemical entities, protein interactions, or metabolic networks. However, the applications are not restricted to the world of molecules and can be extended to the study of macroscopic nonliving systems, organisms, or even legal or social networks. On the other hand, the development of the field of Artificial Intelligence has led to the formulation of computational algorithms whose design is based on the structure and functioning of networks of biological neurons. These algorithms, called Artificial Neural Networks (ANNs), can be useful for the study of complex networks, since the numerical parameters that encode information of the network (for example centralities/node descriptors) can be used as inputs for the ANNs. The Wiener index (W) is a graph invariant widely used in chemoinformatics to quantify the molecular structure of drugs and to study complex networks. In this work, we explore for the first time the possibility of using Markov chains to calculate analogues of node distance numbers/W to describe complex networks from the point of view of their nodes. These parameters are called Markov-Wiener node descriptors of order k(th) (W(k)). Please, note that these descriptors are not related to Markov-Wiener stochastic processes. Here, we calculated the W(k)(i) values for a very high number of nodes (>100,000) in more than 100 different complex networks using the software MI-NODES. These networks were grouped according to the field of application. Molecular networks include the Metabolic Reaction Networks (MRNs) of 40 different organisms. In addition, we analyzed other biological and legal and social networks. These include the Interaction Web Database Biological Networks (IWDBNs), with 75 food webs or ecological systems and the Spanish Financial Law Network (SFLN). The calculated W

  3. microRNA Expression in Sentinel Nodes from Progressing Melanoma Patients Identifies Networks Associated with Dysfunctional Immune Response

    Directory of Open Access Journals (Sweden)

    Viviana Vallacchi

    2016-12-01

    Full Text Available Sentinel node biopsy (SNB is a main staging biomarker in melanoma and is the first lymph node to drain the tumor, thus representing the immunological site where anti-tumor immune dysfunction is established and where potential prognostic immune markers can be identified. Here we analyzed microRNA (miR profiles in archival tumor-positive SNBs derived from melanoma patients with different outcomes and performed an integrated analysis of transcriptional data to identify deregulated immune signaling networks. Twenty-six miRs were differentially expressed in melanoma-positive SNB samples between patients with disease progression and non-progressing patients, the majority being previously reported in the regulation of immune responses. A significant variation in miR expression levels was confirmed in an independent set of SNB samples. Integrated information from genome-wide transcriptional profiles and in vitro assessment in immune cells led to the identification of miRs associated with the regulation of the TNF receptor superfamily member 8 (TNFRSF8 gene encoding the CD30 receptor, a marker increased in lymphocytes of melanoma patients with progressive disease. These findings indicate that miRs are involved in the regulation of pathways leading to immune dysfunction in the sentinel node and may provide valuable markers for developing prognostic molecular signatures for the identification of stage III melanoma patients at risk of recurrence.

  4. National Waterway Network (node), Geographic WGS84, BTS (2006) [usace_nav_waterway_nod_BTS_2006

    Data.gov (United States)

    Louisiana Geographic Information Center — The National Waterway Network is a comprehensive network database of the nation's navigable waterways. The data set covers the 48 contiguous states plus the District...

  5. Monitoring urban air quality using a high-density network of low-cost sensor nodes in Oslo, Norway.

    Science.gov (United States)

    Castell, Nuria; Schneider, Philipp; Vogt, Matthias; Dauge, Franck R.; Lahoz, William; Bartonova, Alena

    2017-04-01

    Urban air quality represents a major public health burden and is a long-standing concern to citizens. Air pollution is associated with a range of diseases, symptoms and conditions that impair health and quality of life. In Oslo, traffic, especially exhaust from heavy-duty and private diesel vehicles and dust resuspension from studded tyres, together with wood burning in winter, are the main sources of pollution. Norway, as part of the European Economic Area, is obliged to comply with the European air quality regulations and ensure clean air. Despite this, Oslo has exceeded both the NO2 and PM10 thresholds for health protection defined in the Directive 2008/50/EC. The air quality in the Oslo area is continuously monitored in 12 compliance monitoring stations. These stations provide reliable and accurate data but their density is too low to provide a detailed spatial distribution of air quality. The emergence of low-cost nodes enables observations at high spatial resolution, providing the opportunity to enhance existing monitoring systems. However, the data generated by these nodes is significantly less accurate and precise than the data provided by reference equipment. We have conducted an evaluation of low-cost nodes to monitor NO2 and PM10, comparing the data collected with low-cost nodes against CEN (European Standardization Organization) reference analysers. During January and March 2016, a network of 24 nodes was deployed in Oslo. During January, high NO2 levels were observed for several days in a row coinciding with the formation of a thermal inversion. During March, we observed an episode with high PM10 levels due to road dust resuspension. Our results show that there is a major technical challenge associated with current commercial low-cost sensors, regarding the sensor robustness and measurement repeatability. Despite this, low-cost sensor nodes are able to reproduce the NO2 and PM10 variability. The data from the sensors was employed to generate detailed

  6. Hop-distance relationship analysis with quasi-UDG model for node localization in wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Chen Ping

    2011-01-01

    Full Text Available Abstract In wireless sensor networks (WSNs, location information plays an important role in many fundamental services which includes geographic routing, target tracking, location-based coverage, topology control, and others. One promising approach in sensor network localization is the determination of location based on hop counts. A critical priori of this approach that directly influences the accuracy of location estimation is the hop-distance relationship. However, most of the related works on the hop-distance relationship assume the unit-disk graph (UDG model that is unrealistic in a practical scenario. In this paper, we formulate the hop-distance relationship for quasi-UDG model in WSNs where sensor nodes are randomly and independently deployed in a circular region based on a Poisson point process. Different from the UDG model, quasi-UDG model has the non-uniformity property for connectivity. We derive an approximated recursive expression for the probability of the hop count with a given geographic distance. The border effect and dependence problem are also taken into consideration. Furthermore, we give the expressions describing the distribution of distance with known hop counts for inner nodes and those suffered from the border effect where we discover the insignificance of the border effect. The analytical results are validated by simulations showing the accuracy of the employed approximation. Besides, we demonstrate the localization application of the formulated relationship and show the accuracy improvement in the WSN localization.

  7. Multiple node remote messaging

    Energy Technology Data Exchange (ETDEWEB)

    Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton on Hudson, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Ohmacht, Martin (Yorktown Heights, NY); Salapura, Valentina (Chappaqua, NY); Steinmacher-Burow, Burkhard (Esslingen, DE); Vranas, Pavlos (Danville, CA)

    2010-08-31

    A method for passing remote messages in a parallel computer system formed as a network of interconnected compute nodes includes that a first compute node (A) sends a single remote message to a remote second compute node (B) in order to control the remote second compute node (B) to send at least one remote message. The method includes various steps including controlling a DMA engine at first compute node (A) to prepare the single remote message to include a first message descriptor and at least one remote message descriptor for controlling the remote second compute node (B) to send at least one remote message, including putting the first message descriptor into an injection FIFO at the first compute node (A) and sending the single remote message and the at least one remote message descriptor to the second compute node (B).

  8. Multi-objective clustering technique based on k-nodes update policy and similarity matrix for mining communities in social networks

    Science.gov (United States)

    Shang, Ronghua; Liu, Huan; Jiao, Licheng

    2017-11-01

    This paper proposes a relatively all-purpose network clustering technique based on the framework of multi-objective evolutionary algorithms, which can effectively dispose the issue of community detection in unsigned social networks, as well as in signed social networks. Firstly, we formulate a generalized similarity function to construct a similarity matrix, and then a pre-partitioning strategy is projected according to the similarity matrix. The pre-partitioning strategy merely considers nodes with high similarity values, which avoids the interference of noise nodes during the label update phase. In this way, at the initial phase of the algorithm, nodes with strong connections are fleetly gathered into sub-communities. Secondly, we elaborately devise a crossover operator, called cross-merging operator, to merge sub-communities generated by the pre-partitioning technique. Moreover, a special mutation operator, based on the similarity matrix of nodes, is implemented to adjust boundary nodes connecting different communities. Finally, to handle different types of networks, we, therefore, have presented the novel multi-objective optimization models for this issue. Through a bulk of rigorous experiments on both unsigned and signed social networks, the preeminent clustering performance illustrate that the proposed algorithm is capable of mining communities effectively.

  9. Organization of networks with tagged nodes and biased links: a priori distinct communities. The case of Intelligent Design Proponents and Darwinian Evolution Defenders

    CERN Document Server

    Rotundo, G

    2010-01-01

    Among topics of opinion formation it is of interest to observe the characteristics of networks with a priori distinct communities. As an illustration, we report on the citation network(s) unfolded in the recent decades through web available works belonging to selected members of the Neocreationist and Intelligent Design Proponents (IDP) and the Darwinian Evolution Defenders (DED) communities. An adjacency matrix of tagged nodes is first constructed; it is not symmetric. A generalization of considerations pertaining to the case of networks with biased links, directed or undirected, is thus presented. The main characteristic coefficients describing the structure of such partially directed networks with tagged nodes are outlined. The structural features are discussed searching for statistical aspects, equivalence or not of subnetworks through the degree distributions, each network assortativity, the global and local clustering coefficients and the Average Overlap Indices. The various closed and open triangles ma...

  10. SDN control of optical nodes in metro networks for high capacity inter-datacentre links

    Science.gov (United States)

    Magalhães, Eduardo; Perry, Philip; Barry, Liam

    2017-11-01

    Worldwide demand for bandwidth has been growing fast for some years and continues to do so. To cover this, mega datacentres need scalable connectivity to provide rich connectivity to handle the heavy traffic across them. Therefore, hardware infrastructures must be able to play different roles according to service and traffic requirements. In this context, software defined networking (SDN) decouples the network control and forwarding functions enabling the network control to become directly programmable and the underlying infrastructure to be abstracted for applications and network services. In addition, elastic optical networking (EON) technologies enable efficient spectrum utilization by allocating variable bandwidth to each user according to their actual needs. In particular, flexible transponders and reconfigurable optical add/drop multiplexers (ROADMs) are key elements since they can offer degrees of freedom to self adapt accordingly. Thus, it is crucial to design control methods in order to optimize the hardware utilization and offer high reconfigurability, flexibility and adaptability. In this paper, we propose and analyze, using a simulation framework, a method of capacity maximization through optical power profile manipulation for inter datacentre links that use existing metropolitan optical networks by exploiting the global network view afforded by SDN. Results show that manipulating the loss profiles of the ROADMs in the metro-network can yield optical signal-to-noise ratio (OSNR) improvements up to 10 dB leading to an increase in 112% in total capacity.

  11. Ultrasonic/Sonic Anchor

    Science.gov (United States)

    Bar-Cohen, Yoseph; Sherrit, Stewart

    2009-01-01

    The ultrasonic/sonic anchor (U/S anchor) is an anchoring device that drills a hole for itself in rock, concrete, or other similar material. The U/S anchor is a recent addition to a series of related devices, the first of which were reported in "Ultrasonic/Sonic Drill/Corers With Integrated Sensors"

  12. Integrated analysis of transcript-level regulation of metabolism reveals disease-relevant nodes of the human metabolic network

    Science.gov (United States)

    Galhardo, Mafalda; Sinkkonen, Lasse; Berninger, Philipp; Lin, Jake; Sauter, Thomas; Heinäniemi, Merja

    2014-01-01

    Metabolic diseases and comorbidities represent an ever-growing epidemic where multiple cell types impact tissue homeostasis. Here, the link between the metabolic and gene regulatory networks was studied through experimental and computational analysis. Integrating gene regulation data with a human metabolic network prompted the establishment of an open-sourced web portal, IDARE (Integrated Data Nodes of Regulation), for visualizing various gene-related data in context of metabolic pathways. Motivated by increasing availability of deep sequencing studies, we obtained ChIP-seq data from widely studied human umbilical vein endothelial cells. Interestingly, we found that association of metabolic genes with multiple transcription factors (TFs) enriched disease-associated genes. To demonstrate further extensions enabled by examining these networks together, constraint-based modeling was applied to data from human preadipocyte differentiation. In parallel, data on gene expression, genome-wide ChIP-seq profiles for peroxisome proliferator-activated receptor (PPAR) γ, CCAAT/enhancer binding protein (CEBP) α, liver X receptor (LXR) and H3K4me3 and microRNA target identification for miR-27a, miR-29a and miR-222 were collected. Disease-relevant key nodes, including mitochondrial glycerol-3-phosphate acyltransferase (GPAM), were exposed from metabolic pathways predicted to change activity by focusing on association with multiple regulators. In both cell types, our analysis reveals the convergence of microRNAs and TFs within the branched chain amino acid (BCAA) metabolic pathway, possibly providing an explanation for its downregulation in obese and diabetic conditions. PMID:24198249

  13. Integrated analysis of transcript-level regulation of metabolism reveals disease-relevant nodes of the human metabolic network.

    Science.gov (United States)

    Galhardo, Mafalda; Sinkkonen, Lasse; Berninger, Philipp; Lin, Jake; Sauter, Thomas; Heinäniemi, Merja

    2014-02-01

    Metabolic diseases and comorbidities represent an ever-growing epidemic where multiple cell types impact tissue homeostasis. Here, the link between the metabolic and gene regulatory networks was studied through experimental and computational analysis. Integrating gene regulation data with a human metabolic network prompted the establishment of an open-sourced web portal, IDARE (Integrated Data Nodes of Regulation), for visualizing various gene-related data in context of metabolic pathways. Motivated by increasing availability of deep sequencing studies, we obtained ChIP-seq data from widely studied human umbilical vein endothelial cells. Interestingly, we found that association of metabolic genes with multiple transcription factors (TFs) enriched disease-associated genes. To demonstrate further extensions enabled by examining these networks together, constraint-based modeling was applied to data from human preadipocyte differentiation. In parallel, data on gene expression, genome-wide ChIP-seq profiles for peroxisome proliferator-activated receptor (PPAR) γ, CCAAT/enhancer binding protein (CEBP) α, liver X receptor (LXR) and H3K4me3 and microRNA target identification for miR-27a, miR-29a and miR-222 were collected. Disease-relevant key nodes, including mitochondrial glycerol-3-phosphate acyltransferase (GPAM), were exposed from metabolic pathways predicted to change activity by focusing on association with multiple regulators. In both cell types, our analysis reveals the convergence of microRNAs and TFs within the branched chain amino acid (BCAA) metabolic pathway, possibly providing an explanation for its downregulation in obese and diabetic conditions.

  14. An Efficient Approach for Node Localisation and Tracking in Wireless Sensor Networks

    CSIR Research Space (South Africa)

    Mwila, Martin K

    2014-08-01

    Full Text Available Wireless technologies have been rapidly spreading all around the world and have become embedded in most of our modern technologies. Mobility, portability, low cost, and the ease of network installation are the key features that have recently...

  15. Achievable capacity limit of high performance nodes for wireless mesh networks

    CSIR Research Space (South Africa)

    Olwal, T

    2012-08-01

    Full Text Available have the ability to simultaneously communicate with many neighbours using multiple radios over orthogonal channels thereby improving effective and "online" channel utilisation. Many such networks emerging from standards such as IEEE 802.11 a...

  16. Capacity of Byzantine Agreement: Complete Characterization of Four-Node Networks

    Science.gov (United States)

    2010-04-06

    network. Technical Report, CSL, UIUC, February 2010. [18] N. A. Lynch. Distributed algorithms. Morgan Kaufmann Publishers, 1995. [19] T. Mizrahi and Y...Moses. Continuous consensus via common knowledge. In TARK’05, 2005. [20] T. Mizrahi and Y. Moses. Continuous consensus with ambiguous failures...Distributed Computing and Networking (Lecture Notes in Computer Science), 4904/2008:73–85, 2008. [21] T. Mizrahi and Y. Moses. Continuous consensus with

  17. SISL and SIRL: Two knowledge dissemination models with leader nodes on cooperative learning networks

    Science.gov (United States)

    Li, Jingjing; Zhang, Yumei; Man, Jiayu; Zhou, Yun; Wu, Xiaojun

    2017-02-01

    Cooperative learning is one of the most effective teaching methods, which has been widely used. Students' mutual contact forms a cooperative learning network in this process. Our previous research demonstrated that the cooperative learning network has complex characteristics. This study aims to investigating the dynamic spreading process of the knowledge in the cooperative learning network and the inspiration of leaders in this process. To this end, complex network transmission dynamics theory is utilized to construct the knowledge dissemination model of a cooperative learning network. Based on the existing epidemic models, we propose a new susceptible-infected-susceptible-leader (SISL) model that considers both students' forgetting and leaders' inspiration, and a susceptible-infected-removed-leader (SIRL) model that considers students' interest in spreading and leaders' inspiration. The spreading threshold λcand its impact factors are analyzed. Then, numerical simulation and analysis are delivered to reveal the dynamic transmission mechanism of knowledge and leaders' role. This work is of great significance to cooperative learning theory and teaching practice. It also enriches the theory of complex network transmission dynamics.

  18. A novel approach to smart grid technology for electrical power transmission lines by a self-organized optical network node based on optical bistability

    Science.gov (United States)

    Nakanishi, Soichiro; Sasaki, Wakao

    2011-01-01

    In this work, we have demonstrated a new smart grid model by our novel green photonics technology based on selforganized optical networks realizing an autonomous peer-to-peer electric power transmissions without centralized control for the power grid. In this optical network, we introduced an adaptive algorithm for concurrent peer-to-peer communications, by utilizing optical nonlinearity depending only on the signal strength passing through the network. This method is applicable for autonomous organization of functions for ad-hoc electric power distribution systems for the power grid. For this purpose, a simple optical- electrical hybrid bistable circuit composed of such as light emitting diode (LED) and photo diode (PD), has been incorporated into the network node. In the experiment, the method uses a simple, local adaptation of transmission weights at each network node, which enables self-organizing functions of the network, such as self-routing, self-optimization, self-recovery and self-protection. Based on this method, we have demonstrated experimentally a new smart grid model applicable for ad-hoc electric power distribution systems mediated by power comsumptions. In this model, electric power flow is controlled autonomously through the self-organized network nodes associated with individual power facilities having photovoltaics and electric storage devices, etc., and the nodes convert the amounts of electric power supply and/or comsumption to the light intensity values using above mentioned transmission weights at each node. As a consequence, we have experimentally demonstrated a simple shorthaul system model for ad-hoc electric power distribution with a self-organized optical network as a novel green photonics technology application for smart grid.

  19. 4,6-connected fsb topology networks obtained through two-step crystal engineering of decorated trigonal prismatic nodes

    KAUST Repository

    Schoedel, Alexander

    2014-05-07

    A two-step crystal engineering strategy has been utilized to synthesize a new and versatile class of metal-organic materials, the first to exhibit 4,6-connected fsb topology. The new fsb networks are constructed from simple and inexpensive nodes (4-connected Zn(CO2)(py)2 tetrahedra; 6-connected Cr(μ3-O)(RCO2)6 trigonal prisms) and linker ligands (isonicotinate and various dicarboxylates). Further, since interpenetration is precluded, they can exhibit extra-large void volumes. These fsb nets are prototypal for what should ultimately become a large family of related structures given the ready availability of functionalized and/or expanded variants of both linker ligands. The fsb nets described herein therefore represent platforms or blueprints for a new family of ultrahigh surface area porous materials. © 2014 American Chemical Society.

  20. A genomic approach to identify regulatory nodes in the transcriptional network of systemic acquired resistance in plants.

    Science.gov (United States)

    Wang, Dong; Amornsiripanitch, Nita; Dong, Xinnian

    2006-11-01

    Many biological processes are controlled by intricate networks of transcriptional regulators. With the development of microarray technology, transcriptional changes can be examined at the whole-genome level. However, such analysis often lacks information on the hierarchical relationship between components of a given system. Systemic acquired resistance (SAR) is an inducible plant defense response involving a cascade of transcriptional events induced by salicylic acid through the transcription cofactor NPR1. To identify additional regulatory nodes in the SAR network, we performed microarray analysis on Arabidopsis plants expressing the NPR1-GR (glucocorticoid receptor) fusion protein. Since nuclear translocation of NPR1-GR requires dexamethasone, we were able to control NPR1-dependent transcription and identify direct transcriptional targets of NPR1. We show that NPR1 directly upregulates the expression of eight WRKY transcription factor genes. This large family of 74 transcription factors has been implicated in various defense responses, but no specific WRKY factor has been placed in the SAR network. Identification of NPR1-regulated WRKY factors allowed us to perform in-depth genetic analysis on a small number of WRKY factors and test well-defined phenotypes of single and double mutants associated with NPR1. Among these WRKY factors we found both positive and negative regulators of SAR. This genomics-directed approach unambiguously positioned five WRKY factors in the complex transcriptional regulatory network of SAR. Our work not only discovered new transcription regulatory components in the signaling network of SAR but also demonstrated that functional studies of large gene families have to take into consideration sequence similarity as well as the expression patterns of the candidates.

  1. A genomic approach to identify regulatory nodes in the transcriptional network of systemic acquired resistance in plants.

    Directory of Open Access Journals (Sweden)

    Dong Wang

    2006-11-01

    Full Text Available Many biological processes are controlled by intricate networks of transcriptional regulators. With the development of microarray technology, transcriptional changes can be examined at the whole-genome level. However, such analysis often lacks information on the hierarchical relationship between components of a given system. Systemic acquired resistance (SAR is an inducible plant defense response involving a cascade of transcriptional events induced by salicylic acid through the transcription cofactor NPR1. To identify additional regulatory nodes in the SAR network, we performed microarray analysis on Arabidopsis plants expressing the NPR1-GR (glucocorticoid receptor fusion protein. Since nuclear translocation of NPR1-GR requires dexamethasone, we were able to control NPR1-dependent transcription and identify direct transcriptional targets of NPR1. We show that NPR1 directly upregulates the expression of eight WRKY transcription factor genes. This large family of 74 transcription factors has been implicated in various defense responses, but no specific WRKY factor has been placed in the SAR network. Identification of NPR1-regulated WRKY factors allowed us to perform in-depth genetic analysis on a small number of WRKY factors and test well-defined phenotypes of single and double mutants associated with NPR1. Among these WRKY factors we found both positive and negative regulators of SAR. This genomics-directed approach unambiguously positioned five WRKY factors in the complex transcriptional regulatory network of SAR. Our work not only discovered new transcription regulatory components in the signaling network of SAR but also demonstrated that functional studies of large gene families have to take into consideration sequence similarity as well as the expression patterns of the candidates.

  2. Artificial microtubule cytoskeleton construction, manipulation, and modeling via holographic trapping of network nodes

    Science.gov (United States)

    Bergman, J.; Doval, F.; Vershinin, M.

    2016-09-01

    Cytoskeletal networks are 3D arrangements of filaments whose complex spatial structure contributes significantly to their intracellular functions, e.g. biomechanics and cargo motility. Microtubule networks in cells are a particular challenge for in vitro modeling because they are sparse and possess overall structure and so cannot be approximated experimentally as a random hydrogel. We have used holographic optical trapping to precisely position and hold multiple microtubule filaments in an in vitro assay, where chemical and environmental variables can be carefully controlled. Below we describe the relevant practical details of the approach and demonstrate how our approach can scale to accommodate modeling of molecular motor transport and biomechanics experiments.

  3. Mobile Handsets as Sensing Nodes in an Auto-Configured Hierarchical Cognitive Radio Network Scheme for Immediate Post-Disaster Communications

    Science.gov (United States)

    Majid, Sonia; Ahmed, Kazi

    A critical problem after a natural/manmade disaster is to provide immediate post-disaster communication links between the disaster victims and some overlay networks. This paper proposes a novel scheme that uses the surviving Mobile handSets (MS) as sensing nodes to form an auto-configured Hierarchical Cognitive Radio Network (H-CRN). The implementation of this H-CRN is explained through detailed problem scenario statement and step-by-step implementation of automatic identification of emergency situation by the MS nodes. An overview of the cross-layer framework used by the MS nodes is also presented. This novel scheme is tested through some hypothesis along with probability calculations for successful identification of emergency situation, formation of ad hoc group and Emergency Beacon Message (EBM) transmission.

  4. Effectiveness of a Littoral Combat Ship as a Major Node in a Wireless Mesh Network

    Science.gov (United States)

    2017-03-01

    Ship: An Examination of its Possible Concepts of Operation, a study conducted by the Center for Strategic and Budgetary Assessments (CSBA), the...antenna houses three individual antennas, providing 360- degree coverage and each antenna covers a 120-degree area, directing transmissions in a...in Phase I consisted of three main components: Wi-Fi, Oceus Networks 4G LTE bubble , and O3b Satellite services. The experiment required the

  5. Online Learning Algorithm for Time Series Forecasting Suitable for Low Cost Wireless Sensor Networks Nodes

    Directory of Open Access Journals (Sweden)

    Juan Pardo

    2015-04-01

    Full Text Available Time series forecasting is an important predictive methodology which can be applied to a wide range of problems. Particularly, forecasting the indoor temperature permits an improved utilization of the HVAC (Heating, Ventilating and Air Conditioning systems in a home and thus a better energy efficiency. With such purpose the paper describes how to implement an Artificial Neural Network (ANN algorithm in a low cost system-on-chip to develop an autonomous intelligent wireless sensor network. The present paper uses a Wireless Sensor Networks (WSN to monitor and forecast the indoor temperature in a smart home, based on low resources and cost microcontroller technology as the 8051MCU. An on-line learning approach, based on Back-Propagation (BP algorithm for ANNs, has been developed for real-time time series learning. It performs the model training with every new data that arrive to the system, without saving enormous quantities of data to create a historical database as usual, i.e., without previous knowledge. Consequently to validate the approach a simulation study through a Bayesian baseline model have been tested in order to compare with a database of a real application aiming to see the performance and accuracy. The core of the paper is a new algorithm, based on the BP one, which has been described in detail, and the challenge was how to implement a computational demanding algorithm in a simple architecture with very few hardware resources.

  6. Online learning algorithm for time series forecasting suitable for low cost wireless sensor networks nodes.

    Science.gov (United States)

    Pardo, Juan; Zamora-Martínez, Francisco; Botella-Rocamora, Paloma

    2015-04-21

    Time series forecasting is an important predictive methodology which can be applied to a wide range of problems. Particularly, forecasting the indoor temperature permits an improved utilization of the HVAC (Heating, Ventilating and Air Conditioning) systems in a home and thus a better energy efficiency. With such purpose the paper describes how to implement an Artificial Neural Network (ANN) algorithm in a low cost system-on-chip to develop an autonomous intelligent wireless sensor network. The present paper uses a Wireless Sensor Networks (WSN) to monitor and forecast the indoor temperature in a smart home, based on low resources and cost microcontroller technology as the 8051MCU. An on-line learning approach, based on Back-Propagation (BP) algorithm for ANNs, has been developed for real-time time series learning. It performs the model training with every new data that arrive to the system, without saving enormous quantities of data to create a historical database as usual, i.e., without previous knowledge. Consequently to validate the approach a simulation study through a Bayesian baseline model have been tested in order to compare with a database of a real application aiming to see the performance and accuracy. The core of the paper is a new algorithm, based on the BP one, which has been described in detail, and the challenge was how to implement a computational demanding algorithm in a simple architecture with very few hardware resources.

  7. mTORC1 Is a Major Regulatory Node in the FGF21 Signaling Network in Adipocytes

    Directory of Open Access Journals (Sweden)

    Annabel Y. Minard

    2016-09-01

    Full Text Available FGF21 improves the metabolic profile of obese animals through its actions on adipocytes. To elucidate the signaling network responsible for mediating these effects, we quantified dynamic changes in the adipocyte phosphoproteome following acute exposure to FGF21. FGF21 regulated a network of 821 phosphosites on 542 proteins. A major FGF21-regulated signaling node was mTORC1/S6K. In contrast to insulin, FGF21 activated mTORC1 via MAPK rather than through the canonical PI3K/AKT pathway. Activation of mTORC1/S6K by FGF21 was surprising because this is thought to contribute to deleterious metabolic effects such as obesity and insulin resistance. Rather, mTORC1 mediated many of the beneficial actions of FGF21 in vitro, including UCP1 and FGF21 induction, increased adiponectin secretion, and enhanced glucose uptake without any adverse effects on insulin action. This study provides a global view of FGF21 signaling and suggests that mTORC1 may act to facilitate FGF21-mediated health benefits in vivo.

  8. B cells as a critical node in the microbiota-host immune system network.

    Science.gov (United States)

    Slack, Emma; Balmer, Maria L; Macpherson, Andrew J

    2014-07-01

    Mutualism with our intestinal microbiota is a prerequisite for healthy existence. This requires physical separation of the majority of the microbiota from the host (by secreted antimicrobials, mucus, and the intestinal epithelium) and active immune control of the low numbers of microbes that overcome these physical and chemical barriers, even in healthy individuals. In this review, we address how B-cell responses to members of the intestinal microbiota form a robust network with mucus, epithelial integrity, follicular helper T cells, innate immunity, and gut-associated lymphoid tissues to maintain host-microbiota mutualism. © 2014 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

  9. Summary Time Oriented Record (STOR)—A Node in a Local Area Network

    Science.gov (United States)

    Whiting-O'Keefe, QE; Simborg, DW; Warger, A; Harden, G

    1983-01-01

    The STOR ambulatory record system remains committed to its original principles of prioritization of information, time orientation, and interphysician communication. It has been expanded to provide a sophisticated user help system, to provide extensive interactive access to its database to augment its hardcopy output, and to function as an interface to the UCSF distributed hospital information system. The complex and difficult application level issues of effectively using a distributed database accessed through a local area network are being dealt with. In a limited context, the major question of whether physicians would accept the change STOR imposes on the way they record and display clinical data has been answered.

  10. Derivation of Surface Net Radiation at the Valencia Anchor Station from Top of the Atmosphere Gerb Fluxes by Means of Linear Models and Neural Networks

    Science.gov (United States)

    Geraldo Ferreira, A.; Lopez-Baeza, Ernesto; Velazquez Blazquez, Almudena; Soria-Olivas, Emilio; Serrano Lopez, Antonio J.; Gomez Chova, Juan

    2012-07-01

    In this work, Linear Models (LM) and Artificial Neural Networks (ANN) have been developed to estimate net radiation (RN) at the surface. The models have been developed and evaluated by using the synergy between Geostationary Earth Radiation Budget (GERB-1) and Spinning Enhanced Visible and Infrared Imager (SEVIRI) data, both instruments onboard METEOSAT-9, and ``in situ'' measurements. The data used in this work, corresponding to August 2006 and June to August 2007, proceed from Top of the Atmosphere (TOA) broadband fluxes from GERB-1, every 15 min, and from net radiation at the surface measured, every 10 min, at the Valencia Anchor Station (VAS) area, having measured independently the shortwave and the longwave radiation components (downwelling and upwelling) for different land uses and land cover. The adjustment of both temporal resolutions for the satellite and in situ data was achieved by linear interpolation that showed less standard deviation than the cubic one. The LMs were developed and validated by using satellite TOA RN and ground station surface RN measurements, only considering cloudy free days selected from the ground data. The ANN model was developed both for cloudy and cloudy-free conditions using seven input variables selected for the training/validation sets, namely, hour, day, month, surface RN, solar zenith angle and TOA shortwave and longwave fluxes. Both, LMs and ANNs show remarkably good agreement when compared to surface RN measurements. Therefore, this methodology can be successfully applied to estimate RN at surface from GERB/SEVIRI data.

  11. Self-Similarity Superresolution for Resource-Constrained Image Sensor Node in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yuehai Wang

    2014-01-01

    Full Text Available Wireless sensor networks, in combination with image sensors, open up a grand sensing application field. It is a challenging problem to recover a high resolution (HR image from its low resolution (LR counterpart, especially for low-cost resource-constrained image sensors with limited resolution. Sparse representation-based techniques have been developed recently and increasingly to solve this ill-posed inverse problem. Most of these solutions are based on an external dictionary learned from huge image gallery, consequently needing tremendous iteration and long time to match. In this paper, we explore the self-similarity inside the image itself, and propose a new combined self-similarity superresolution (SR solution, with low computation cost and high recover performance. In the self-similarity image super resolution model (SSIR, a small size sparse dictionary is learned from the image itself by the methods such as KSVD. The most similar patch is searched and specially combined during the sparse regulation iteration. Detailed information, such as edge sharpness, is preserved more faithfully and clearly. Experiment results confirm the effectiveness and efficiency of this double self-learning method in the image super resolution.

  12. Optimized Node Deployment Algorithm and Parameter Investigation in a Mobile Sensor Network for Robotic Systems

    Directory of Open Access Journals (Sweden)

    Rongxin Tang

    2015-10-01

    Full Text Available Mobile sensor networks are an important part of modern robotics systems and are widely used in robotics applications. Therefore, sensor deployment is a key issue in current robotics systems research. Since it is one of the most popular deployment methods, in recent years the virtual force algorithm has been studied in detail by many scientists. In this paper, we focus on the virtual force algorithm and present a corresponding parameter investigation for mobile sensor deployment. We introduce an optimized virtual force algorithm based on the exchange force, in which a new shielding rule grounded in Delaunay triangulation is adopted. The algorithm employs a new performance metric called ‘pair-correlation diversion', designed to evaluate the uniformity and topology of the sensor distribution. We also discuss the implementation of the algorithm's computation and analyse the influence of experimental parameters on the algorithm. Our results indicate that the area ratio, φs, and the exchange force constant, G, influence the final performance of the sensor deployment in terms of the coverage rate, the convergence time and topology uniformity. Using simulations, we were able to verify the effectiveness of our algorithm and we obtained an optimal region for the (φs, G-parameter space which, in the future, could be utilized as an aid for experiments in robotic sensor deployment.

  13. Elevator Group Supervisory Control System Using Genetic Network Programming with Macro Nodes and Reinforcement Learning

    Science.gov (United States)

    Zhou, Jin; Yu, Lu; Mabu, Shingo; Hirasawa, Kotaro; Hu, Jinglu; Markon, Sandor

    Elevator Group Supervisory Control System (EGSCS) is a very large scale stochastic dynamic optimization problem. Due to its vast state space, significant uncertainty and numerous resource constraints such as finite car capacities and registered hall/car calls, it is hard to manage EGSCS using conventional control methods. Recently, many solutions for EGSCS using Artificial Intelligence (AI) technologies have been reported. Genetic Network Programming (GNP), which is proposed as a new evolutionary computation method several years ago, is also proved to be efficient when applied to EGSCS problem. In this paper, we propose an extended algorithm for EGSCS by introducing Reinforcement Learning (RL) into GNP framework, and an improvement of the EGSCS' performances is expected since the efficiency of GNP with RL has been clarified in some other studies like tile-world problem. Simulation tests using traffic flows in a typical office building have been made, and the results show an actual improvement of the EGSCS' performances comparing to the algorithms using original GNP and conventional control methods. Furthermore, as a further study, an importance weight optimization algorithm is employed based on GNP with RL and its efficiency is also verified with the better performances.

  14. Microgravity Drill and Anchor System

    Science.gov (United States)

    Parness, Aaron; Frost, Matthew A.; King, Jonathan P.

    2013-01-01

    This work is a method to drill into a rock surface regardless of the gravitational field or orientation. The required weight-on-bit (WOB) is supplied by a self-contained anchoring mechanism. The system includes a rotary percussive coring drill, forming a complete sampling instrument usable by robot or human. This method of in situ sample acquisition using micro - spine anchoring technology enables several NASA mission concepts not currently possible with existing technology, including sampling from consolidated rock on asteroids, providing a bolt network for astronauts visiting a near-Earth asteroid, and sampling from the ceilings or vertical walls of lava tubes and cliff faces on Mars. One of the most fundamental parameters of drilling is the WOB; essentially, the load applied to the bit that allows it to cut, creating a reaction force normal to the surface. In every drilling application, there is a minimum WOB that must be maintained for the system to function properly. In microgravity (asteroids and comets), even a small WOB could not be supported conventionally by the weight of the robot or astronaut. An anchoring mechanism would be needed to resist the reactions, or the robot or astronaut would push themselves off the surface and into space. The ability of the system to anchor itself to a surface creates potential applications that reach beyond use in low gravity. The use of these anchoring mechanisms as end effectors on climbing robots has the potential of vastly expanding the scope of what is considered accessible terrain. Further, because the drill is supported by its own anchor rather than by a robotic arm, the workspace is not constrained by the reach of such an arm. Yet, if the drill is on a robotic arm, it has the benefit of not reflecting the forces of drilling back to the arm s joints. Combining the drill with the anchoring feet will create a highly mobile, highly stable, and highly reliable system. The drilling system s anchor uses hundreds of

  15. Achieving Congestion Mitigation Using Distributed Power Control for Spectrum Sensor Nodes in Sensor Network-Aided Cognitive Radio Ad Hoc Networks.

    Science.gov (United States)

    Zhang, Long; Xu, Haitao; Zhuo, Fan; Duan, Hucai

    2017-09-15

    The data sequence of spectrum sensing results injected from dedicated spectrum sensor nodes (SSNs) and the data traffic from upstream secondary users (SUs) lead to unpredictable data loads in a sensor network-aided cognitive radio ad hoc network (SN-CRN). As a result, network congestion may occur at a SU acting as fusion center when the offered data load exceeds its available capacity, which degrades network performance. In this paper, we present an effective approach to mitigate congestion of bottlenecked SUs via a proposed distributed power control framework for SSNs over a rectangular grid based SN-CRN, aiming to balance resource load and avoid excessive congestion. To achieve this goal, a distributed power control framework for SSNs from interior tier (IT) and middle tier (MT) is proposed to achieve the tradeoff between channel capacity and energy consumption. In particular, we firstly devise two pricing factors by considering stability of local spectrum sensing and spectrum sensing quality for SSNs. By the aid of pricing factors, the utility function of this power control problem is formulated by jointly taking into account the revenue of power reduction and the cost of energy consumption for IT or MT SSN. By bearing in mind the utility function maximization and linear differential equation constraint of energy consumption, we further formulate the power control problem as a differential game model under a cooperation or noncooperation scenario, and rigorously obtain the optimal solutions to this game model by employing dynamic programming. Then the congestion mitigation for bottlenecked SUs is derived by alleviating the buffer load over their internal buffers. Simulation results are presented to show the effectiveness of the proposed approach under the rectangular grid based SN-CRN scenario.

  16. Achieving Congestion Mitigation Using Distributed Power Control for Spectrum Sensor Nodes in Sensor Network-Aided Cognitive Radio Ad Hoc Networks

    Science.gov (United States)

    Zhuo, Fan; Duan, Hucai

    2017-01-01

    The data sequence of spectrum sensing results injected from dedicated spectrum sensor nodes (SSNs) and the data traffic from upstream secondary users (SUs) lead to unpredictable data loads in a sensor network-aided cognitive radio ad hoc network (SN-CRN). As a result, network congestion may occur at a SU acting as fusion center when the offered data load exceeds its available capacity, which degrades network performance. In this paper, we present an effective approach to mitigate congestion of bottlenecked SUs via a proposed distributed power control framework for SSNs over a rectangular grid based SN-CRN, aiming to balance resource load and avoid excessive congestion. To achieve this goal, a distributed power control framework for SSNs from interior tier (IT) and middle tier (MT) is proposed to achieve the tradeoff between channel capacity and energy consumption. In particular, we firstly devise two pricing factors by considering stability of local spectrum sensing and spectrum sensing quality for SSNs. By the aid of pricing factors, the utility function of this power control problem is formulated by jointly taking into account the revenue of power reduction and the cost of energy consumption for IT or MT SSN. By bearing in mind the utility function maximization and linear differential equation constraint of energy consumption, we further formulate the power control problem as a differential game model under a cooperation or noncooperation scenario, and rigorously obtain the optimal solutions to this game model by employing dynamic programming. Then the congestion mitigation for bottlenecked SUs is derived by alleviating the buffer load over their internal buffers. Simulation results are presented to show the effectiveness of the proposed approach under the rectangular grid based SN-CRN scenario. PMID:28914803

  17. An Electronic-Nose Sensor Node Based on a Polymer-Coated Surface Acoustic Wave Array for Wireless Sensor Network Applications

    Directory of Open Access Journals (Sweden)

    Kea-Tiong Tang

    2011-04-01

    Full Text Available This study developed an electronic-nose sensor node based on a polymer-coated surface acoustic wave (SAW sensor array. The sensor node comprised an SAW sensor array, a frequency readout circuit, and an Octopus II wireless module. The sensor array was fabricated on a large K2 128° YX LiNbO3 sensing substrate. On the surface of this substrate, an interdigital transducer (IDT was produced with a Cr/Au film as its metallic structure. A mixed-mode frequency readout application specific integrated circuit (ASIC was fabricated using a TSMC 0.18 μm process. The ASIC output was connected to a wireless module to transmit sensor data to a base station for data storage and analysis. This sensor node is applicable for wireless sensor network (WSN applications.

  18. An electronic-nose sensor node based on a polymer-coated surface acoustic wave array for wireless sensor network applications.

    Science.gov (United States)

    Tang, Kea-Tiong; Li, Cheng-Han; Chiu, Shih-Wen

    2011-01-01

    This study developed an electronic-nose sensor node based on a polymer-coated surface acoustic wave (SAW) sensor array. The sensor node comprised an SAW sensor array, a frequency readout circuit, and an Octopus II wireless module. The sensor array was fabricated on a large K(2) 128° YX LiNbO3 sensing substrate. On the surface of this substrate, an interdigital transducer (IDT) was produced with a Cr/Au film as its metallic structure. A mixed-mode frequency readout application specific integrated circuit (ASIC) was fabricated using a TSMC 0.18 μm process. The ASIC output was connected to a wireless module to transmit sensor data to a base station for data storage and analysis. This sensor node is applicable for wireless sensor network (WSN) applications.

  19. High Interlaminar Shear Strength Enhancement of Carbon Fiber/Epoxy Composite through Fiber- and Matrix-Anchored Carbon Nanotube Networks.

    Science.gov (United States)

    Wang, Yilei; Raman Pillai, Suresh Kumar; Che, Jianfei; Chan-Park, Mary B

    2017-03-15

    To improve the interlaminar shear strength (ILSS) of carbon fiber reinforced epoxy composite, networks of multiwalled carbon nanotubes (MWNTs) were grown on micron-sized carbon fibers and single-walled carbon nanotubes (SWNTs) were dispersed into the epoxy matrix so that these two types of carbon nanotubes entangle at the carbon fiber (CF)/epoxy matrix interface. The MWNTs on the CF fiber (CF-MWNTs) were grown by chemical vapor deposition (CVD), while the single-walled carbon nanotubes (SWNTs) were finely dispersed in the epoxy matrix precursor with the aid of a dispersing agent polyimide-graft-bisphenol A diglyceryl acrylate (PI-BDA) copolymer. Using vacuum assisted resin transfer molding, the SWNT-laden epoxy matrix precursor was forced into intimate contact with the "hairy" surface of the CF-MWNT fiber. The tube density and the average tube length of the MWNT layer on CF was controlled by the CVD growth time. The ILSS of the CF-MWNT/epoxy resin composite was examined using the short beam shear test. With addition of MWNTs onto the CF surface as well as SWNTs into the epoxy matrix, the ILSS of CF/epoxy resin composite was 47.59 ± 2.26 MPa, which represented a ∼103% increase compared with the composite made with pristine CF and pristine epoxy matrix (without any SWNT filler). FESEM established that the enhanced composite did not fail at the CF/epoxy matrix interface.

  20. Node security

    CERN Document Server

    Barnes, Dominic

    2013-01-01

    A practical and fast-paced guide that will give you all the information you need to secure your Node applications.If you are a developer who wishes to secure your Node applications, whether you are already using Node Security in production, or are considering using it for your next project, then this book will enable you to ensure security of your applications. An understanding of JavaScript is a prerequisite, and some experience with Node is recommended, though not required.

  1. Hypersensitivity to Suture Anchors

    Directory of Open Access Journals (Sweden)

    Masafumi Goto

    2013-01-01

    Full Text Available Hypersensitivity to suture anchor is extremely rare. Herein, we present a case in which hypersensitivity to suture anchor was strongly suspected. The right rotator cuff of a 50-year-old woman was repaired with a metal suture anchor. Three weeks after the surgery, she developed erythema around her face, trunk, and hands, accompanied by itching. Infection was unlikely because no abnormalities were detected by blood testing or by medical examination. Suspicious of a metallic allergy, a dermatologist performed a patch testing 6 months after the first surgery. The patient had negative reactions to tests for titanium, aluminum, and vanadium, which were the principal components of the suture anchor. The anchor was removed 7 months after the first surgery, and the erythema disappeared immediately. When allergic symptoms occur and persist after the use of a metal anchor, removal should be considered as a treatment option even if the patch test result is negative.

  2. Hypersensitivity to Suture Anchors

    OpenAIRE

    Masafumi Goto; Masafumi Gotoh; Yasuhiro Mitsui; Ryo Tanesue; Takahiro Okawa; Fujio Higuchi; Naoto Shiba

    2013-01-01

    Hypersensitivity to suture anchor is extremely rare. Herein, we present a case in which hypersensitivity to suture anchor was strongly suspected. The right rotator cuff of a 50-year-old woman was repaired with a metal suture anchor. Three weeks after the surgery, she developed erythema around her face, trunk, and hands, accompanied by itching. Infection was unlikely because no abnormalities were detected by blood testing or by medical examination. Suspicious of a metallic allergy, a dermatolo...

  3. Node cookbook

    CERN Document Server

    Clements, David Mark

    2014-01-01

    In Node Cookbook Second Edition, each chapter focuses on a different aspect of working with Node. Following a Cookbook structure, the recipes are written in an easy-to-understand language. Readers will find it easier to grasp even the complex recipes which are backed by lots of illustrations, tips, and hints.If you have some knowledge of JavaScript and want to build fast, efficient, scalable client-server solutions, then Node Cookbook Second Edition is for you. Knowledge of Node will be an advantage but is not required. Experienced users of Node will be able to improve their skills.

  4. Ground wave emergency network final operational capability: Environmental assessment for northwestern Nebraska relay node, site number RN 8C930NE

    Science.gov (United States)

    1993-02-01

    The Ground Wave Emergency Network (GWEN) is a radio communication system designed to relay emergency messages between strategic military areas in the continental United States. The system is immune to the effects of high-altitude electromagnetic pulse (HEMP) energy surges caused by nuclear bursts in the ionosphere that would disrupt conventional communications equipment such as telephones and shortwave radios. A failure of such equipment would prevent timely communications among top military and civilian leaders and strategic Air Force locations and prevent U.S. assessment and retaliation during an attack. GWEN is an essential part of a defense modernization program to upgrade and improve our nation's communications system, thereby strengthening deterrence. The GWEN system consists of a network of relay nodes, receive-only stations, and input/output stations. Each relay node, such as the one proposed in northwestern Nebraska, consists of a guyed radio tower facility similar to those used by commercial AM broadcast transmitters.

  5. Ground wave emergency network final operational capability: Environmental assessment for southern Nevada relay node site number RN 8W918NV

    Science.gov (United States)

    1993-03-01

    The Ground Wave Emergency Network (GWEN) is a radio communication system designed to relay emergency messages between strategic military areas in the continental United States. The system is immune to the effects of high-altitude electromagnetic pulse (HEMP) energy surges caused by nuclear bursts in the ionosphere that would disrupt conventional communications equipment such as telephones and shortwave radios. A failure of such equipment would prevent timely communications among top military and civilian leaders and strategic Air Force locations and prevent U.S. assessment and retaliation during an attack. GWEN is an essential part of a defense modernization program to upgrade and improve our nation's communications system, thereby strengthening deterrence. The GWEN system consists of a network of relay nodes, receive-only stations, and input/output stations. Each relay node, such as the one proposed in southern Nevada consists of a guyed radio tower facility similar to those used by commercial AM broadcast transmitters.

  6. Node seniority ranking

    CERN Document Server

    Fioriti, Vincenzo

    2014-01-01

    Recent advances in graph theory suggest that is possible to identify the oldest nodes of a network using only the graph topology. Here we report on applications to heterogeneous real world networks. To this end, and in order to gain new insights, we propose the theoretical framework of the Estrada communicability. We apply it to two technological networks (an underground, the diffusion of a software worm in a LAN) and to a third network representing a cholera outbreak. In spite of errors introduced in the adjacency matrix of their graphs, the identification of the oldest nodes is feasible, within a small margin of error, and extremely simple. Utilizations include the search of the initial disease-spreader (patient zero problem), rumors in social networks, malware in computer networks, triggering events in blackouts, oldest urban sites recognition.

  7. Research nodes and networks

    DEFF Research Database (Denmark)

    Matthiessen, Christian Wichmann; Schwarz, Annette Winkel; Find, Søren

    2011-01-01

    Analysis of the spatial distribution and connectivity of scientific research, using linkages between academic units (institutions and business)to assess the relative weight of the worlds metropolitan regions. The findings support Richard Floridas assertion that the world is "spiky" rather than flat...

  8. Research nodes and networks

    DEFF Research Database (Denmark)

    Matthiessen, Christian Wichmann; Schwarz, Annette Winkel; Find, Søren

    2011-01-01

    Analysis of the spatial distribution and connectivity of scientific research, using linkages between academic units (institutions and business)to assess the relative weight of the worlds metropolitan regions. The findings support Richard Floridas assertion that the world is "spiky" rather than flat......, and that the scientific world is even spikier that other spatial configurations. It is shown that there is a great deal of path dependence in the spatial structure of science, with northwestern Europe and north America hosting most of the leading creative metropolitan regions. But there is also a disimination tendency...

  9. Localization in Self-Healing Autonomous Sensor Networks (SASNet): Studies on Cooperative Localization of Sensor Nodes using Distributed Maps

    National Research Council Canada - National Science Library

    Li, Li

    2008-01-01

    .... The cooperative localization scheme adopted in this study computes a local map for each sensor node using all the available link metric constraints, and then merges the local maps into a global...

  10. Ultrastructural localization of extracellular matrix proteins of the lymph node cortex: evidence supporting the reticular network as a pathway for lymphocyte migration

    Directory of Open Access Journals (Sweden)

    Sobocinski Gregg P

    2010-08-01

    Full Text Available Abstract Background The lymph node (LN is a crossroads of blood and lymphatic vessels allowing circulating lymphocytes to efficiently recognize foreign molecules displayed on antigen presenting cells. Increasing evidence indicates that after crossing high endothelial venules, lymphocytes migrate within the node along the reticular network (RN, a scaffold of fibers enwrapped by fibroblastic reticular cells (FRC. Light microscopy has shown that the RN contains specific extracellular matrix (ECM proteins, which are putative molecular "footholds" for migration, and are known ligands for lymphocyte integrin adhesion receptors. Results To investigate whether ECM proteins of the RN are present on the outer surface of the FRC and are thus accessible to migrating lymphocytes, ultrastructural immunohistochemical staining of cynomolgus monkey LN was performed using antibodies to human ECM proteins that were successfully employed at the light microscopic level. The fibrillar collagens I and III were observed primarily within the reticular network fibers themselves. In contrast, the matrix proteins laminin, fibronectin, collagen IV, and tenascin were observed within the reticular fibers and also on the outer membrane surface of the FRC. Conclusions These findings suggest a molecular basis for how the RN functions as a pathway for lymphocyte migration within the lymph node.

  11. Anchor Trial Launch

    Science.gov (United States)

    NCI has launched a multicenter phase III clinical trial called the ANCHOR Study -- Anal Cancer HSIL (High-grade Squamous Intraepithelial Lesion) Outcomes Research Study -- to determine if treatment of HSIL in HIV-infected individuals can prevent anal canc

  12. Localization in Self-Healing Autonomous Sensor Networks (SASNet): Studies on Cooperative Localization of Sensor Nodes using Distributed Maps

    Science.gov (United States)

    2008-01-01

    as represented by the Minister of National Defence, 2008 © Sa Majesté la Reine (en droit du Canada), telle que représentée par le ministre de la...Savkin, A. and Jha, S. “Node localization using mobile robots in delay-tolerant sensor networks”, IEEE Trans. on Mobile Computing, Vol. 4, No. 3, May

  13. Optimization of the transmission system for wavelength routed optical network: trade-off between node complexity and transmission channel utilization

    DEFF Research Database (Denmark)

    Limal, Emmanuel; Hjelme, Dag Roar; Stubkjær, Kristian Elmholdt

    1998-01-01

    We study the influence of the number of wavelengths per fibre and the line bit rate on network dimensions and transmission capacity utilisation for wavelength routed optical transport networks. The networks considered are of European scale, and the traffic matrices used are projections of a traffic...

  14. Network diversity through decoration of trigonal-prismatic nodes: Two-step crystal engineering of cationic metal-organic materials

    KAUST Repository

    Schoedel, Alexander

    2011-10-05

    MOMs the word! In a two-step process, first a trigonal-prismatic Primary Molecular Building Block ([Cr3O(isonic)6]+, tp-PMBB-1) was formed and then it was connected to linear linkers or square-planar nodes to afford three novel highly charged cationic metal-organic materials (MOMs) with snx, snw, and stp topologies. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  15. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

    Science.gov (United States)

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-06-15

    In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

  16. Dynamic Fuzzy-Logic Based Path Planning for Mobility-Assisted Localization in Wireless Sensor Networks.

    Science.gov (United States)

    Alomari, Abdullah; Phillips, William; Aslam, Nauman; Comeau, Frank

    2017-08-18

    Mobile anchor path planning techniques have provided as an alternative option for node localization in wireless sensor networks (WSNs). In such context, path planning is a movement pattern where a mobile anchor node's movement is designed in order to achieve a maximum localization ratio possible with a minimum error rate. Typically, the mobility path planning is designed in advance, which is applicable when the mobile anchor has sufficient sources of energy and time. However, when the mobility movement is restricted or limited, a dynamic path planning design is needed. This paper proposes a novel distributed range-free movement mechanism for mobility-assisted localization in WSNs when the mobile anchor's movement is limited. The designed movement is formed in real-time pattern using a fuzzy-logic approach based on the information received from the network and the nodes' deployment. Our proposed model, Fuzzy-Logic based Path Planning for mobile anchor-assisted Localization in WSNs (FLPPL), offers superior results in several metrics including both localization accuracy and localization ratio in comparison to other similar works.

  17. Color filtering localization for three-dimensional underwater acoustic sensor networks.

    Science.gov (United States)

    Liu, Zhihua; Gao, Han; Wang, Wuling; Chang, Shuai; Chen, Jiaxing

    2015-03-12

    Accurate localization of mobile nodes has been an important and fundamental problem in underwater acoustic sensor networks (UASNs). The detection information returned from a mobile node is meaningful only if its location is known. In this paper, we propose two localization algorithms based on color filtering technology called PCFL and ACFL. PCFL and ACFL aim at collaboratively accomplishing accurate localization of underwater mobile nodes with minimum energy expenditure. They both adopt the overlapping signal region of task anchors which can communicate with the mobile node directly as the current sampling area. PCFL employs the projected distances between each of the task projections and the mobile node, while ACFL adopts the direct distance between each of the task anchors and the mobile node. The proportion factor of distance is also proposed to weight the RGB values. By comparing the nearness degrees of the RGB sequences between the samples and the mobile node, samples can be filtered out. The normalized nearness degrees are considered as the weighted standards to calculate the coordinates of the mobile nodes. The simulation results show that the proposed methods have excellent localization performance and can localize the mobile node in a timely way. The average localization error of PCFL is decreased by about 30.4% compared to the AFLA method.

  18. IONCAP Prediction-Based Automatic Link Establishment (ALE) Frequency Selection for a Ten-Node Australian High-Frequency Network

    Science.gov (United States)

    1994-07-11

    sunspot number of 150. Figure 3 is a map showing HF- radio coverage contours of SNR-per-bit with the Darwin node as the transmit site. The Darwin site (node...Ch m% -A "Ř r- r 9 f- % D D o 3 i~nU’% p gnU n n% I q p L% qp ~ ~ ~ ~ ~ . 0% 0wq "q " q h % 0% 0% a% 0%00% a%4 0% "MmN N DM N Sf a NMMMo %D0ŘSn s- 0...ot - cl 0 P~O4 M M 4 u C0 C 0% (4 󈧄% 00% Ch doO O tn 0’mP’o ,O’o,% nL Lnc0 4’ 4) %0 % sDr -nn Vý %0w4 v0pvk w4 Ch Uy (h 0% -F’ 0% a% (n Ch m V %o

  19. Wireless Smart Sensor Network System Using SmartBridge Sensor Nodes for Structural Health Monitoring of Existing Concrete Bridges

    Science.gov (United States)

    Gaviña, J. R.; Uy, F. A.; Carreon, J. D.

    2017-06-01

    There are over 8000 bridges in the Philippines today according to the Department of Public Works and Highways (DPWH). Currently, visual inspection is the most common practice in monitoring the structural integrity of bridges. However, visual inspections have proven to be insufficient in determining the actual health or condition of a bridge. Structural Health Monitoring (SHM) aims to give, in real-time, a diagnosis of the actual condition of the bridge. In this study, SmartBridge Sensor Nodes were installed on an existing concrete bridge with American Association of State Highway and Transportation Officials (AASHTO) Type IV Girders to gather vibration of the elements of the bridge. Also, standards on the effective installation of SmartBridge Sensor Nodes, such as location and orientation was determined. Acceleration readings from the sensor were then uploaded to a server, wherein they are monitored against certain thresholds, from which, the health of the bridge will be derived. Final output will be a portal or webpage wherein the information, health, and acceleration readings of the bridge will be available for viewing. With levels of access set for different types of users, the main users will have access to download data and reports. Data transmission and webpage access are available online, making the SHM system wireless.

  20. A Wireless Sensor Network with Soft Computing Localization Techniques for Track Cycling Applications

    OpenAIRE

    Sadik Kamel Gharghan; Rosdiadee Nordin; Mahamod Ismail

    2016-01-01

    In this paper, we propose two soft computing localization techniques for wireless sensor networks (WSNs). The two techniques, Neural Fuzzy Inference System (ANFIS) and Artificial Neural Network (ANN), focus on a range-based localization method which relies on the measurement of the received signal strength indicator (RSSI) from the three ZigBee anchor nodes distributed throughout the track cycling field. The soft computing techniques aim to estimate the distance between bicycles moving on the...

  1. A Collaborative Secure Localization Algorithm Based on Trust Model in Underwater Wireless Sensor Networks.

    Science.gov (United States)

    Han, Guangjie; Liu, Li; Jiang, Jinfang; Shu, Lei; Rodrigues, Joel J P C

    2016-02-16

    Localization is one of the hottest research topics in Underwater Wireless Sensor Networks (UWSNs), since many important applications of UWSNs, e.g., event sensing, target tracking and monitoring, require location information of sensor nodes. Nowadays, a large number of localization algorithms have been proposed for UWSNs. How to improve location accuracy are well studied. However, few of them take location reliability or security into consideration. In this paper, we propose a Collaborative Secure Localization algorithm based on Trust model (CSLT) for UWSNs to ensure location security. Based on the trust model, the secure localization process can be divided into the following five sub-processes: trust evaluation of anchor nodes, initial localization of unknown nodes, trust evaluation of reference nodes, selection of reference node, and secondary localization of unknown node. Simulation results demonstrate that the proposed CSLT algorithm performs better than the compared related works in terms of location security, average localization accuracy and localization ratio.

  2. A Collaborative Secure Localization Algorithm Based on Trust Model in Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Guangjie Han

    2016-02-01

    Full Text Available Localization is one of the hottest research topics in Underwater Wireless Sensor Networks (UWSNs, since many important applications of UWSNs, e.g., event sensing, target tracking and monitoring, require location information of sensor nodes. Nowadays, a large number of localization algorithms have been proposed for UWSNs. How to improve location accuracy are well studied. However, few of them take location reliability or security into consideration. In this paper, we propose a Collaborative Secure Localization algorithm based on Trust model (CSLT for UWSNs to ensure location security. Based on the trust model, the secure localization process can be divided into the following five sub-processes: trust evaluation of anchor nodes, initial localization of unknown nodes, trust evaluation of reference nodes, selection of reference node, and secondary localization of unknown node. Simulation results demonstrate that the proposed CSLT algorithm performs better than the compared related works in terms of location security, average localization accuracy and localization ratio.

  3. Geographic Location of a Computer Node Examining a Time-to-Location Algorithm and Multiple Autonomous System Networks

    Science.gov (United States)

    2004-03-01

    OPENT Simulation Model...................................................................................4-4 Figure 4.5 80% Paretto Distribution for...States, Figure 4.4 shows the MCI Network model. Figure 4.4 MCI Fast Ethernet OPENT Simulation Model Background traffic arrives according to

  4. Prediction of lymph node parasite load from clinical data in dogs with leishmaniasis: An application of radial basis artificial neural networks.

    Science.gov (United States)

    Torrecilha, Rafaela Beatriz Pintor; Utsunomiya, Yuri Tani; Batista, Luís Fábio da Silva; Bosco, Anelise Maria; Nunes, Cáris Maroni; Ciarlini, Paulo César; Laurenti, Márcia Dalastra

    2017-01-30

    Quantification of Leishmania infantum load via real-time quantitative polymerase chain reaction (qPCR) in lymph node aspirates is an accurate tool for diagnostics, surveillance and therapeutics follow-up in dogs with leishmaniasis. However, qPCR requires infrastructure and technical training that is not always available commercially or in public services. Here, we used a machine learning technique, namely Radial Basis Artificial Neural Network, to assess whether parasite load could be learned from clinical data (serological test, biochemical markers and physical signs). By comparing 18 different combinations of input clinical data, we found that parasite load can be accurately predicted using a relatively small reference set of 35 naturally infected dogs and 20 controls. In the best case scenario (use of all clinical data), predictions presented no bias or inflation and an accuracy (i.e., correlation between true and predicted values) of 0.869, corresponding to an average error of ±38.2 parasites per unit of volume. We conclude that reasonable estimates of L. infantum load from lymph node aspirates can be obtained from clinical records when qPCR services are not available. Copyright © 2016 Elsevier B.V. All rights reserved.

  5. Untraceable Mobile Node Authentication in WSN

    Directory of Open Access Journals (Sweden)

    Kyusuk Han

    2010-04-01

    Full Text Available Mobility of sensor node in Wireless Sensor Networks (WSN brings security issues such as re-authentication and tracing the node movement. However, current security researches on WSN are insufficient to support such environments since their designs only considered the static environments. In this paper, we propose the efficient node authentication and key exchange protocol that reduces the overhead in node re-authentication and also provides untraceability of mobile nodes. Compared with previous protocols, our protocol has only a third of communication and computational overhead. We expect our protocol to be the efficient solution that increases the lifetime of sensor network.

  6. The response of the prostate to circulating cholesterol: activating transcription factor 3 (ATF3 as a prominent node in a cholesterol-sensing network.

    Directory of Open Access Journals (Sweden)

    Jayoung Kim

    Full Text Available Elevated circulating cholesterol is a systemic risk factor for cardiovascular disease and metabolic syndrome, however the manner in which the normal prostate responds to variations in cholesterol levels is poorly understood. In this study we addressed the molecular and cellular effects of elevated and suppressed levels of circulating cholesterol on the normal prostate. Integrated bioinformatic analysis was performed using DNA microarray data from two experimental formats: (1 ventral prostate from male mice with chronically elevated circulating cholesterol and (2 human prostate cells exposed acutely to cholesterol depletion. A cholesterol-sensitive gene expression network was constructed from these data and the transcription factor ATF3 was identified as a prominent node in the network. Validation experiments confirmed that elevated cholesterol reduced ATF3 expression and enhanced proliferation of prostate cells, while cholesterol depletion increased ATF3 levels and inhibited proliferation. Cholesterol reduction in vivo alleviated dense lymphomononuclear infiltrates in the periprostatic adipose tissue, which were closely associated with nerve tracts and blood vessels. These findings open new perspectives on the role of cholesterol in prostate health, and provide a novel role for ATF3, and associated proteins within a large signaling network, as a cholesterol-sensing mechanism.

  7. Comparison of Three Non-Imaging Angle-Diversity Receivers as Input Sensors of Nodes for Indoor Infrared Wireless Sensor Networks: Theory and Simulation

    Directory of Open Access Journals (Sweden)

    Beatriz R. Mendoza

    2016-07-01

    Full Text Available In general, the use of angle-diversity receivers makes it possible to reduce the impact of ambient light noise, path loss and multipath distortion, in part by exploiting the fact that they often receive the desired signal from different directions. Angle-diversity detection can be performed using a composite receiver with multiple detector elements looking in different directions. These are called non-imaging angle-diversity receivers. In this paper, a comparison of three non-imaging angle-diversity receivers as input sensors of nodes for an indoor infrared (IR wireless sensor network is presented. The receivers considered are the conventional angle-diversity receiver (CDR, the sectored angle-diversity receiver (SDR, and the self-orienting receiver (SOR, which have been proposed or studied by research groups in Spain. To this end, the effective signal-collection area of the three receivers is modelled and a Monte-Carlo-based ray-tracing algorithm is implemented which allows us to investigate the effect on the signal to noise ratio and main IR channel parameters, such as path loss and rms delay spread, of using the three receivers in conjunction with different combination techniques in IR links operating at low bit rates. Based on the results of the simulations, we show that the use of a conventional angle-diversity receiver in conjunction with the equal-gain combining technique provides the solution with the best signal to noise ratio, the lowest computational capacity and the lowest transmitted power requirements, which comprise the main limitations for sensor nodes in an indoor infrared wireless sensor network.

  8. Comparison of Three Non-Imaging Angle-Diversity Receivers as Input Sensors of Nodes for Indoor Infrared Wireless Sensor Networks: Theory and Simulation.

    Science.gov (United States)

    Mendoza, Beatriz R; Rodríguez, Silvestre; Pérez-Jiménez, Rafael; Ayala, Alejandro; González, Oswaldo

    2016-07-14

    In general, the use of angle-diversity receivers makes it possible to reduce the impact of ambient light noise, path loss and multipath distortion, in part by exploiting the fact that they often receive the desired signal from different directions. Angle-diversity detection can be performed using a composite receiver with multiple detector elements looking in different directions. These are called non-imaging angle-diversity receivers. In this paper, a comparison of three non-imaging angle-diversity receivers as input sensors of nodes for an indoor infrared (IR) wireless sensor network is presented. The receivers considered are the conventional angle-diversity receiver (CDR), the sectored angle-diversity receiver (SDR), and the self-orienting receiver (SOR), which have been proposed or studied by research groups in Spain. To this end, the effective signal-collection area of the three receivers is modelled and a Monte-Carlo-based ray-tracing algorithm is implemented which allows us to investigate the effect on the signal to noise ratio and main IR channel parameters, such as path loss and rms delay spread, of using the three receivers in conjunction with different combination techniques in IR links operating at low bit rates. Based on the results of the simulations, we show that the use of a conventional angle-diversity receiver in conjunction with the equal-gain combining technique provides the solution with the best signal to noise ratio, the lowest computational capacity and the lowest transmitted power requirements, which comprise the main limitations for sensor nodes in an indoor infrared wireless sensor network.

  9. Improved Correction Localization Algorithm Based on Wave Direction Spectrum for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhang Ming

    2014-09-01

    Full Text Available Localization is an important topic in the underwater wireless sensor networks (UWSN because sensor nodes are randomly scattered over a region and can get connected into a network on their own. In this paper, we proposed an improved correction localization algorithm based on wave direction spectrum for underwater wireless sensor networks. First, we use the length of anchor nodes and depth of nodes to compute the radius and achieve the initial positioning. Second, we estimate the moving distance of nodes through analyzing the wave direction spectrum, the correction coefficient was computed for X-axis, Y-axis, Z-axis respectively to correct the coordinate. Simulation shows that the localization accuracy of the proposed algorithm is better under the same time and speed environment than USP algorithm and SLMP algorithm.

  10. Comparative transcription analysis of different Antirrhinum phyllotaxy nodes identifies major signal networks involved in vegetative-reproductive transition.

    Directory of Open Access Journals (Sweden)

    Dongliang Wang

    Full Text Available Vegetative-reproductive phase change is an indispensable event which guarantees several aspects of successful meristem behaviour and organ development. Antirrhinum majus undergoes drastic changes of shoot architecture during the phase change, including phyllotactic change and leaf type alteration from opposite decussate to spiral. However, the regulation mechanism in both of phyllotactic morphology changes is still unclear. Here, the Solexa/Illumina RNA-seq high-throughput sequencing was used to evaluate the global changes of transcriptome levels among four node regions during phyllotactic development. More than 86,315,782 high quality reads were sequenced and assembled into 58,509 unigenes. These differentially expressed genes (DEGs were classified into 118 pathways described in the KEGG database. Based on the heat-map analysis, a large number of DEGs were overwhelmingly distributed in the hormone signal pathway as well as the carbohydrate biosynthesis and metabolism. The quantitative real time (qRT-PCR results indicated that most of DEGs were highly up-regulated in the swapping regions of phyllotactic morphology. Moreover, transcriptions factors (TFs with high transcripts were also identified, controlling the phyllotactic morphology by the regulation of hormone and sugar-metabolism signal pathways. A number of DEGs did not align with any databases and might be novel genes involved in the phyllotactic development. These genes will serve as an invaluable genetic resource for understanding the molecular mechanism of the phyllotactic development.

  11. Improving Spectral Capacity and Wireless Network Coverage by Cognitive Radio Technology and Relay Nodes in Cellular Systems

    DEFF Research Database (Denmark)

    Frederiksen, Flemming Bjerge

    2008-01-01

    Methods to enhance the use of the frequency spectrum by automatical spectrum sensing plus spectrum sharing in a cognitive radio technology context have been presented and discussed in this paper. Ideas to improve the wireless transmission by orthogonal OFDM-based communication and to increase the...... the coverage of cellular systems by future wireless networks, relay channels, relay stations and collaborate radio have been presented as well. A revised hierarchical deployment of the future wireless and wired networks are shortly discussed.......Methods to enhance the use of the frequency spectrum by automatical spectrum sensing plus spectrum sharing in a cognitive radio technology context have been presented and discussed in this paper. Ideas to improve the wireless transmission by orthogonal OFDM-based communication and to increase...

  12. Managing Supply Chain Networks: A Framework for Achieving Superior Performance through Leadership Capabilities Development in Supply Chain Node

    OpenAIRE

    Cooper, Sharp; Watson, Derek; Worrall, Rob

    2016-01-01

    Leadership capability is acknowledged as a major challenge for organizations and a pre-requisite for sustaining high levels of organizational performance and supply chain competitiveness. Recent research highlights how globalisation has led to the extension of domestic supply chains, particularly SME ones, to include both suppliers and customers globally. This paper examines the role capabilities development in managers and leaders as nexus of their supply chain networks have to play in achie...

  13. SensoTube: A Scalable Hardware Design Architecture for Wireless Sensors and Actuators Networks Nodes in the Agricultural Domain

    OpenAIRE

    Piromalis, Dimitrios; Arvanitis, Konstantinos

    2016-01-01

    Wireless Sensor and Actuators Networks (WSANs) constitute one of the most challenging technologies with tremendous socio-economic impact for the next decade. Functionally and energy optimized hardware systems and development tools maybe is the most critical facet of this technology for the achievement of such prospects. Especially, in the area of agriculture, where the hostile operating environment comes to add to the general technological and technical issues, reliable and robust WSAN system...

  14. Metagenomic profiling of a microbial assemblage associated with the California mussel: a node in networks of carbon and nitrogen cycling.

    Directory of Open Access Journals (Sweden)

    Catherine A Pfister

    Full Text Available Mussels are conspicuous and often abundant members of rocky shores and may constitute an important site for the nitrogen cycle due to their feeding and excretion activities. We used shotgun metagenomics of the microbial community associated with the surface of mussels (Mytilus californianus on Tatoosh Island in Washington state to test whether there is a nitrogen-based microbial assemblage associated with mussels. Analyses of both tidepool mussels and those on emergent benches revealed a diverse community of Bacteria and Archaea with approximately 31 million bp from 6 mussels in each habitat. Using MG-RAST, between 22.5-25.6% were identifiable using the SEED non-redundant database for proteins. Of those fragments that were identifiable through MG-RAST, the composition was dominated by Cyanobacteria and Alpha- and Gamma-proteobacteria. Microbial composition was highly similar between the tidepool and emergent bench mussels, suggesting similar functions across these different microhabitats. One percent of the proteins identified in each sample were related to nitrogen cycling. When normalized to protein discovery rate, the high diversity and abundance of enzymes related to the nitrogen cycle in mussel-associated microbes is as great or greater than that described for other marine metagenomes. In some instances, the nitrogen-utilizing profile of this assemblage was more concordant with soil metagenomes in the Midwestern U.S. than for open ocean system. Carbon fixation and Calvin cycle enzymes further represented 0.65 and 1.26% of all proteins and their abundance was comparable to a number of open ocean marine metagenomes. In sum, the diversity and abundance of nitrogen and carbon cycle related enzymes in the microbes occupying the shells of Mytilus californianus suggest these mussels provide a node for microbial populations and thus biogeochemical processes.

  15. Lymph node biopsy

    Science.gov (United States)

    Biopsy - lymph nodes; Open lymph node biopsy; Fine needle aspiration biopsy; Sentinel lymph node biopsy ... A lymph node biopsy is done in an operating room in a hospital. Or, it is done at an outpatient surgical center. The ...

  16. The gene expression profiling of hepatocellular carcinoma by a network analysis approach shows a dominance of intrinsically disordered proteins (IDPs) between hub nodes.

    Science.gov (United States)

    Singh, Sakshi; Colonna, Giovanni; Di Bernardo, Giovanni; Bergantino, Francesca; Cammarota, Marcella; Castello, Giuseppe; Costantini, Susan

    2015-11-01

    the net nodes but an inherent functional versatility to the whole metabolic net. Thus, our present article provides a novel way of targeting the intrinsic disorder in HCC networks to dampen the cancer effects and provides new insight into the potential mechanisms of HCC. Taken together, the present findings suggest novel targets to design strategies for drug design and may support a rational intervention in the pharmacotherapy of HCC and other associated diseases.

  17. National Rail Network 1:2,000,000 (node), Geographic WGS84, BTS (2006) [us_rail_network_100k_nd_BTS_2006

    Data.gov (United States)

    Louisiana Geographic Information Center — The Rail Network is a comprehensive database of the nation's railway system at the 1:100,000 scale. The data set covers all 50 States plus the District of Columbia.

  18. The use of Gene Ontology terms for predicting highly-connected 'hub' nodes in protein-protein interaction networks

    Directory of Open Access Journals (Sweden)

    Cherkasov Artem

    2008-09-01

    Full Text Available Abstract Background Protein-protein interactions mediate a wide range of cellular functions and responses and have been studied rigorously through recent large-scale proteomics experiments and bioinformatics analyses. One of the most important findings of those endeavours was the observation that 'hub' proteins participate in significant numbers of protein interactions and play critical roles in the organization and function of cellular protein interaction networks (PINs 12. It has also been demonstrated that such hub proteins may constitute an important pool of attractive drug targets. Thus, it is crucial to be able to identify hub proteins based not only on experimental data but also by means of bioinformatics predictions. Results A hub protein classifier has been developed based on the available interaction data and Gene Ontology (GO annotations for proteins in the Escherichia coli, Saccharomyces cerevisiae, Drosophila melanogaster and Homo sapiens genomes. In particular, by utilizing the machine learning method of boosting trees we were able to create a predictive bioinformatics tool for the identification of proteins that are likely to play the role of a hub in protein interaction networks. Testing the developed hub classifier on external sets of experimental protein interaction data in Methicillin-resistant Staphylococcus aureus (MRSA 252 and Caenorhabditis elegans demonstrated that our approach can predict hub proteins with a high degree of accuracy. A practical application of the developed bioinformatics method has been illustrated by the effective protein bait selection for large-scale pull-down experiments that aim to map complete protein-protein interaction networks for several species. Conclusion The successful development of an accurate hub classifier demonstrated that highly-connected proteins tend to share certain relevant functional properties reflected in their Gene Ontology annotations. It is anticipated that the developed

  19. Anchoring visions in organizations

    DEFF Research Database (Denmark)

    Simonsen, Jesper

    1999-01-01

    as by those involved in the actual implementation. A model depicting a recent trend within systems development is presented: Organizations rely on purchasing generic software products and/or software development outsourced to external contractors. A contemporary method for participatory design, where......This paper introduces the term 'anchoring' within systems development: Visions, developed through early systems design within an organization, need to be deeply rooted in the organization. A vision's rationale needs to be understood by those who decide if the vision should be implemented as well...

  20. Career anchors of dentist leaders.

    Science.gov (United States)

    Tuononen, Tiina; Lammintakanen, Johanna; Suominen, Anna Liisa

    2016-08-01

    The work of a health care leader is demanding; in order to cope, leaders need motivation and support. The occurrence of intrinsic factors called career anchors (combination of one's competence, motives and values) could be a contributing factor in dentist leaders' career decisions. The aim of our study was to identify dentist leaders' career anchors and their association to dentist leaders' retention or turnover of the leadership position. Materials were gathered in 2014 via an electronic questionnaire from 156 current (Leaders) or former (Leavers) Finnish dentist leaders. Career anchor evaluation was conducted by the questionnaire and scoring-table taken from Edgar Schein's Career Anchors Self-Assessment. Both the most and the least important career anchors were detected by the highest and lowest scores and their occurrence reported as percentages. Associations between career anchor scores and tendency to stay were analyzed with logistic regression. 'Technical/Functional Competence' and 'Lifestyle' were most frequently reported as the most important and 'Entrepreneurial Creativity' and 'General Managerial Competence' as the least important career anchors. However, a higher level of 'General Managerial Competence' anchor was most significantly associated with staying in a leadership position. Instead, 'Pure Challenge' and 'Lifestyle' decreased the odds to stay. The knowledge of the important and essential career anchors of dentist leaders' and individuals' could perform crucial part in career choices and also in planning education, work opportunities and human resource policies promoting retention of dentist leaders and probably also other health care leaders.

  1. Lightness, brightness, and anchoring.

    Science.gov (United States)

    Anderson, Barton L; Whitbread, Michael; de Silva, Chamila

    2014-08-07

    The majority of work in lightness perception has evaluated the perception of lightness using flat, matte, two-dimensional surfaces. In such contexts, the amount of light reaching the eye contains a conflated mixture of the illuminant and surface lightness. A fundamental puzzle of lightness perception is understanding how it is possible to experience achromatic surfaces as specific achromatic shades in the face of this ambiguity. It has been argued that the perception of lightness in such contexts implies that the visual system imposes an "anchoring rule" whereby a specific relative luminance (the highest) serves as a fixed point in the mapping of image luminance onto the lightness scale ("white"). We conducted a series of experiments to explicitly test this assertion in contexts where this mapping seemed most unlikely-namely, low-contrast images viewed in dim illumination. Our results provide evidence that the computational ambiguity in mapping luminance onto lightness is reflected in perceptual experience. The perception of the highest luminance in a two-dimensional Mondrian display varied monotonically with its brightness, ranging from midgray to white. Similar scaling occurred for the lowest luminance and, by implication, all other luminance values. We conclude that the conflation between brightness and lightness in two-dimensional Mondrian displays is reflected in perception and find no support for the claim that any specific relative luminance value acts as a fixed anchor point in this mapping function. © 2014 ARVO.

  2. SensoTube: A Scalable Hardware Design Architecture for Wireless Sensors and Actuators Networks Nodes in the Agricultural Domain

    Science.gov (United States)

    Piromalis, Dimitrios; Arvanitis, Konstantinos

    2016-01-01

    Wireless Sensor and Actuators Networks (WSANs) constitute one of the most challenging technologies with tremendous socio-economic impact for the next decade. Functionally and energy optimized hardware systems and development tools maybe is the most critical facet of this technology for the achievement of such prospects. Especially, in the area of agriculture, where the hostile operating environment comes to add to the general technological and technical issues, reliable and robust WSAN systems are mandatory. This paper focuses on the hardware design architectures of the WSANs for real-world agricultural applications. It presents the available alternatives in hardware design and identifies their difficulties and problems for real-life implementations. The paper introduces SensoTube, a new WSAN hardware architecture, which is proposed as a solution to the various existing design constraints of WSANs. The establishment of the proposed architecture is based, firstly on an abstraction approach in the functional requirements context, and secondly, on the standardization of the subsystems connectivity, in order to allow for an open, expandable, flexible, reconfigurable, energy optimized, reliable and robust hardware system. The SensoTube implementation reference model together with its encapsulation design and installation are analyzed and presented in details. Furthermore, as a proof of concept, certain use cases have been studied in order to demonstrate the benefits of migrating existing designs based on the available open-source hardware platforms to SensoTube architecture. PMID:27527180

  3. Exploitation of an atmospheric lidar network node in single-shot mode for the classification of aerofauna

    Science.gov (United States)

    Jansson, Samuel; Brydegaard, Mikkel; Papayannis, Alexandros; Tsaknakis, Georgios; Åkesson, Susanne

    2017-07-01

    The migration of aerofauna is a seasonal phenomenon of global scale, engaging billions of individuals in long-distance movements every year. Multiband lidar systems are commonly employed for the monitoring of aerosols and atmospheric gases, and a number of systems are operated regularly across Europe in the framework of the European Aerosol Lidar Network (EARLINET). This work examines the feasibility of utilizing EARLINET for the monitoring and classification of migratory fauna based on their pigmentation. An EARLINET Raman lidar system in Athens transmits laser pulses in three bands. By installing a four-channel digital oscilloscope on the system, the backscattered light from single-laser shots is measured. Roughly 100 h of data were gathered in the summer of 2013. The data were examined for aerofauna observations, and a total of 1735 observations interpreted as airborne organisms intercepting the laser beam were found during the study period in July to August 2013. The properties of the observations were analyzed spectrally and intercompared. A spectral multimodality that could be related to different observed species is shown. The system used in this pilot study is located in Athens, Greece. It is concluded that monitoring aerial migration using it and other similar systems is feasible with minor modifications, and that in-flight species classification could be possible.

  4. SensoTube: A Scalable Hardware Design Architecture for Wireless Sensors and Actuators Networks Nodes in the Agricultural Domain.

    Science.gov (United States)

    Piromalis, Dimitrios; Arvanitis, Konstantinos

    2016-08-04

    Wireless Sensor and Actuators Networks (WSANs) constitute one of the most challenging technologies with tremendous socio-economic impact for the next decade. Functionally and energy optimized hardware systems and development tools maybe is the most critical facet of this technology for the achievement of such prospects. Especially, in the area of agriculture, where the hostile operating environment comes to add to the general technological and technical issues, reliable and robust WSAN systems are mandatory. This paper focuses on the hardware design architectures of the WSANs for real-world agricultural applications. It presents the available alternatives in hardware design and identifies their difficulties and problems for real-life implementations. The paper introduces SensoTube, a new WSAN hardware architecture, which is proposed as a solution to the various existing design constraints of WSANs. The establishment of the proposed architecture is based, firstly on an abstraction approach in the functional requirements context, and secondly, on the standardization of the subsystems connectivity, in order to allow for an open, expandable, flexible, reconfigurable, energy optimized, reliable and robust hardware system. The SensoTube implementation reference model together with its encapsulation design and installation are analyzed and presented in details. Furthermore, as a proof of concept, certain use cases have been studied in order to demonstrate the benefits of migrating existing designs based on the available open-source hardware platforms to SensoTube architecture.

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

    Science.gov (United States)

    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.

  6. Soil water and carbon management for agricultural resilience in a key node in the global virtual water trade network: Mato Grosso, Brazil

    Science.gov (United States)

    Johnson, M. S.; Speratti, A. B.; Lathuilliere, M. J.; Dalmagro, H. J.; Couto, E. G.

    2015-12-01

    The Amazon region is globally connected through agricultural exports, with the Brazilian state of Mato Grosso in particular emerging as a key node in the global virtual water trade network in recent years, based largely on rainfed agriculture. The anticipated growth in the world's population suggests that virtual water trade will only become more important to global food security. In this presentation we will evaluate strategies for improving the resilience of rainfed agriculture in the region, particularly for the nearly 12 million hectares of sandy soil with low water holding capacity within Mato Grosso that has largely been converted to agricultural use. We will review land use change trajectories and present results from soil water balance modeling and carbon fluxes for a range of future scenarios, including continued agricultural extensification, potential strategies for agricultural intensification, and novel water and carbon management strategies including biochar use in sandy soils to improve soil water holding capacities and soil carbon sequestration. We will also consider the role that irrigation might play in the future in the Amazon for improving agricultural resilience to climate change and feedbacks between irrigation and land use change pressures, noting that groundwater resources in the region are presently among the least exploited on the planet.

  7. Epstein on Anchors and Grounds

    Directory of Open Access Journals (Sweden)

    Guala Francesco

    2016-03-01

    Full Text Available The distinction between anchors and grounds is one of the most innovative contributions of The Ant Trap. In this commentary I will argue that the distinction suffers from an ambiguity between tokens and types. This leads Epstein to endorse pluralism about anchors and grounds, a position that is not justified in the book and to which there are plausible alternatives.

  8. Neural networks for nodal staging of non-small cell lung cancer with FDG PET and CT: importance of combining uptake values and sizes of nodes and primary tumor.

    Science.gov (United States)

    Toney, Lauren K; Vesselle, Hubert J

    2014-01-01

    To evaluate the effect of adding lymph node size to three previously explored artificial neural network (ANN) input parameters (primary tumor maximum standardized uptake value or tumor uptake, tumor size, and nodal uptake at N1, N2, and N3 stations) in the structure of the ANN. The goal was to allow the resulting ANN structure to relate lymph node uptake for size to primary tumor uptake for size in the determination of the status of nodes as human readers do. This prospective study was approved by the institutional review board, and informed consent was obtained from all participants. The authors developed a back-propagation ANN with one hidden layer and eight processing units. The data set used to train the network included node and tumor size and uptake from 133 patients with non-small cell lung cancer with surgically proved N status. Statistical analysis was performed with the paired t test. The ANN correctly predicted the N stage in 99.2% of cases, compared with 72.4% for the expert reader (P < .001). In categorization of N0 and N1 versus N2 and N3 disease, the ANN performed with 99.2% accuracy versus 92.2% for the expert reader (P < .001). The ANN is 99.2% accurate in predicting surgical-pathologic nodal status with use of four fluorine 18 fluorodeoxyglucose (FDG) positron emission tomography (PET)/computed tomography (CT)-derived parameters. Malignant and benign inflammatory lymph nodes have overlapping appearances at FDG PET/CT but can be differentiated by ANNs when the crucial input of node size is used. © RSNA, 2013.

  9. Not all Anchors Weigh Equally.

    Science.gov (United States)

    Greenstein, Michael; Velazquez, Alexandra

    2017-11-01

    The anchoring bias is a reliable effect wherein a person's judgments are affected by initially presented information, but it is unknown specifically why this effect occurs. Research examining this bias suggests that elements of both numeric and semantic priming may be involved. To examine this, the present research used a phenomenon wherein people treat numeric information presented differently in Arabic numeral or verbal formats. We presented participants with one of many forms of an anchor that represented the same value (e.g., twelve hundred or 1,200). Thus, we could examine how a concept's meaning and its absolute numeric value affect anchoring. Experiments 1 and 2 showed that people respond to Arabic and verbal anchors differently. Experiment 3 showed that these differences occurred largely because people tend to think of numbers in digit format. This suggests that one's conceptual understanding of the anchored information matters more than its strict numeric value.

  10. Intelligent Educational Systems for Anchored Instruction?

    Science.gov (United States)

    Kumar, David D.

    1995-01-01

    Explores the potential for using Intelligent Educational Systems (IES) for anchoring instruction in macro contexts in science education. Topics include anchored instruction; situated cognition; problem solving; cognitivism; interactive video environments; and examples of combining IES and anchored instruction. (LRW)

  11. Strong anchors for a safe and reliable network in the Netherlands; Stevige ankers voor een veilig en betrouwbaar netbeheer in Nederland

    Energy Technology Data Exchange (ETDEWEB)

    Hebben, R.J.

    2005-11-15

    In the last decade radical changes and developments took place in the energy sector in the Netherlands: scaling-up as a result of mergers and take-overs, separation of energy supply and networks and the liberalization of the markets for electricity and natural gas. Those developments also resulted in more responsibility for network owners and managers to facilitate the market, implementation of automated systems and new legislation and regulations. One of their responsibilities is maintenance of the safety and reliability of the networks, distribution and transmission systems for electricity and natural gas. The growing responsibility also resulted in increased consciousness with regard to choices whether or not to invest in networks to maintain and/or improve the quality of the networks and at the same time to increase the tariffs for the consumers. [Dutch] In de afgelopen tien jaar hebben er ingrijpende ontwikkelingen plaatsgevonden in de energiesector en binnen de energiebedrijven. Deze zijn terug te voeren op de schaalvergroting die heeft plaatsgevonden als gevolg van fusies en overnames, de organisatorische splitsing in handelsbedrijven en netbeheerders en uiteraard de liberalisering van de markten voor elektriciteit en gas. Door deze ontwikkeling zijn de netbeheerders ook verantwoordelijk geworden voor het faciliteren van de markt. Hierdoor hebben zij te maken gehad met ingrijpende reorganisaties, implementatie van nieuwe geautomatiseerde systemen en werkwijzen en voortdurende introductie van nieuwe wet- en regelgeving. Daarnaast hebben netbeheerders hun reeds lang bestaande taak voor het veilig en betrouwbaar uitvoeren van het fysieke transport en de fysieke levering van elektriciteit en gas. De liberalisering en de daarmee gepaard gaande veranderingen en onvermijdelijke opstartproblemen hebben ertoe bijgedragen dat er in de maatschappij meer aandacht is voor het functioneren van de netbeheerder en daarmee ook voor incidenten op het gebied van de

  12. Functionalized Nanostructures: Redox-Active Porphyrin Anchors for Supramolecular DNA Assemblies

    KAUST Repository

    Börjesson, Karl

    2010-09-28

    We have synthesized and studied a supramolecular system comprising a 39-mer DNA with porphyrin-modified thymidine nucleosides anchored to the surface of large unilamellar vesicles (liposomes). Liposome porphyrin binding characteristics, such as orientation, strength, homogeneity, and binding site size, was determined, suggesting that the porphyrin is well suited as a photophysical and redox-active lipid anchor, in comparison to the inert cholesterol anchor commonly used today. Furthermore, the binding characteristics and hybridization capabilities were studied as a function of anchor size and number of anchoring points, properties that are of importance for our future plans to use the addressability of these redox-active nodes in larger DNA-based nanoconstructs. Electron transfer from photoexcited porphyrin to a lipophilic benzoquinone residing in the lipid membrane was characterized by steady-state and time-resolved fluorescence and verified by femtosecond transient absorption. © 2010 American Chemical Society.

  13. Node.js by example

    CERN Document Server

    Tsonev, Krasimir

    2015-01-01

    If you are a JavaScript developer with no experience with Node.js or server-side web development, this book is for you. It will lead you through creating a fairly complex social network. You will learn how to work with a database and create real-time communication channels.

  14. Critical nodes in signalling pathways

    DEFF Research Database (Denmark)

    Taniguchi, Cullen M; Emanuelli, Brice; Kahn, C Ronald

    2006-01-01

    Physiologically important cell-signalling networks are complex, and contain several points of regulation, signal divergence and crosstalk with other signalling cascades. Here, we use the concept of 'critical nodes' to define the important junctions in these pathways and illustrate their unique role...... using insulin signalling as a model system....

  15. Career anchors of dentist leaders

    OpenAIRE

    Tuononen Tiina; Lammintakanen Johanna; Suominen Anna Liisa

    2016-01-01

    Objective: The work of a health care leader is demanding; in order to cope, leaders need motivation and support. The occurrence of intrinsic factors called career anchors (combination of one’s competence, motives and values) could be a contributing factor in dentist leaders’ career decisions. The aim of our study was to identify dentist leaders’ career anchors and their association to dentist leaders’ retention or turnover of the leadership position. Material and methods: Materials were g...

  16. The Holding Power of Anchors

    Indian Academy of Sciences (India)

    The essential principle in the action of all anchors is that a surface set at an acute angle to the ground will dig in if pulled horizontally. In order that an anchor may function properly it must satisfy two conditions. The first is that in whatever position it may fall as it strikes the sea floor, it must begin to dig in as soon as the pull ...

  17. 77 FR 65496 - Commercial Acquisition; Anchor Tenancy

    Science.gov (United States)

    2012-10-29

    ... SPACE ADMINISTRATION 48 CFR Part 1812 RIN 2700-AD64 Commercial Acquisition; Anchor Tenancy AGENCY... limited conditions, to issue Anchor Tenancy contracts. Anchor Tenancy means ``an arrangement in which the... inaccurate prohibition on anchor tenancy contracts. The prohibition is included in the NFS based on The Space...

  18. Collaborative localization algorithms for wireless sensor networks with reduced localization error.

    Science.gov (United States)

    Sahoo, Prasan Kumar; Hwang, I-Shyan

    2011-01-01

    Localization is an important research issue in Wireless Sensor Networks (WSNs). Though Global Positioning System (GPS) can be used to locate the position of the sensors, unfortunately it is limited to outdoor applications and is costly and power consuming. In order to find location of sensor nodes without help of GPS, collaboration among nodes is highly essential so that localization can be accomplished efficiently. In this paper, novel localization algorithms are proposed to find out possible location information of the normal nodes in a collaborative manner for an outdoor environment with help of few beacons and anchor nodes. In our localization scheme, at most three beacon nodes should be collaborated to find out the accurate location information of any normal node. Besides, analytical methods are designed to calculate and reduce the localization error using probability distribution function. Performance evaluation of our algorithm shows that there is a tradeoff between deployed number of beacon nodes and localization error, and average localization time of the network can be increased with increase in the number of normal nodes deployed over a region.

  19. Schedule-based sequential localization in asynchronous wireless networks

    Science.gov (United States)

    Zachariah, Dave; De Angelis, Alessio; Dwivedi, Satyam; Händel, Peter

    2014-12-01

    In this paper, we consider the schedule-based network localization concept, which does not require synchronization among nodes and does not involve communication overhead. The concept makes use of a common transmission sequence, which enables each node to perform self-localization and to localize the entire network, based on noisy propagation-time measurements. We formulate the schedule-based localization problem as an estimation problem in a Bayesian framework. This provides robustness with respect to uncertainty in such system parameters as anchor locations and timing devices. Moreover, we derive a sequential approximate maximum a posteriori (AMAP) estimator. The estimator is fully decentralized and copes with varying noise levels. By studying the fundamental constraints given by the considered measurement model, we provide a system design methodology which enables a scalable solution. Finally, we evaluate the performance of the proposed AMAP estimator by numerical simulations emulating an impulse-radio ultra-wideband (IR-UWB) wireless network.

  20. Optimal Placement of Wavelength Converting Nodes

    DEFF Research Database (Denmark)

    Belotti, Pietro; Stidsen, Thomas K.

    2001-01-01

    The all optical network using WDM and optical nodes (OXC's) seems to be a possibility in a near future. The consensus to day seems to be that optical wavelength conversions is un-realistic for several decades, hence wavelength blocking will happen in the all optical networks. A possible solution...... to this problem could be to include digital nodes (DXC's) in the network at the right places. In this article we present a linear programming model which optimizes the placement of these more expensive DXC's in the network....

  1. Anchoring International sets new water depth record

    Energy Technology Data Exchange (ETDEWEB)

    Noble, H.J.

    1983-07-01

    Santa Barbara Channel has a history steeped in firsts in techniques for the production of offshore oil. Landscaped drilling and production islands, production piers, and directional drilling from land rigs to production under the channel, to name a few. The latest such project was handled by Anchoring International, Inc., a pipe line anchoring company headquartered in Houston, Texas. Contracted by Healy Tibbets Construction Company, prime contractor, Anchoring was commissioned to handle a new deep water record breaking anchoring job. The job was to anchor J-tube extensions in 820 feet of water--the deepest pipe line anchoring job ever undertaken. In most shallow water pipe line anchoring jobs, anchors and anchor installation unit placement over the pipe line is handled from a crane topside with visual assist from divers. However, due to the extreme depth of this project, the installation unit with anchors had to be modified for submersible operator-assisted placement capability. Anchoring International handled the anchor design and installation equipment, and submersible operator assistance was furnished by Oceaneering, International. WASP and JIM atmospheric diving systems were used. All ocean bottom activities were monitored topside with the JERED video-equipped remote controlled vehicle. Since the weight of the anchor sets and power installation unit are minimum, the entire operation was conducted from a small boat sufficient to carry dive equipment and the anchor installation unit power supply. A small pedestal crane was used to lower and retrieve the anchor installation unit.

  2. mRNA chip-based analysis on transcription factor regulatory network central nodes of protection targets of Deproteinized Extract of Calf Blood on acute liver injury in mice.

    Science.gov (United States)

    Xu, Guangyu; Xu, Jinhe; Han, Xiao; Li, Hongyu; Yuan, Guangxin; An, Liping; Du, Peige

    2018-01-27

    Our previous study found that Deproteinized Extract of Calf Blood (DECB) could protect the acute liver injury induced by carbon tetrachloride in mice, but the target-related transcription factors and their regulatory networks were not comprehensively studied. Based on the mRNA expression microarray data obtained in the previous study, the mRNA transcription factor regulatory networks were constructed by screening the transcription factors of differentially expressed genes and their corresponding target proteins, and the analysis on the functions and pathways of the regulatory network central nodes was performed. Eight genes Ltf, Tnf, Il6, Jun, Il12b, Stat3, Rel and Crem could regulate the inflammatory factors, and TNF signaling pathway and Jak-STAT signaling pathway might play an important role in the mechanism through which DECB protected the liver of mice. DECB can not only inhibit the apoptosis of hepatocytes, but also inhibit the inflammatory cytokines. Copyright © 2018. Published by Elsevier B.V.

  3. Network analysis of eight industrial symbiosis systems

    Science.gov (United States)

    Zhang, Yan; Zheng, Hongmei; Shi, Han; Yu, Xiangyi; Liu, Gengyuan; Su, Meirong; Li, Yating; Chai, Yingying

    2016-06-01

    Industrial symbiosis is the quintessential characteristic of an eco-industrial park. To divide parks into different types, previous studies mostly focused on qualitative judgments, and failed to use metrics to conduct quantitative research on the internal structural or functional characteristics of a park. To analyze a park's structural attributes, a range of metrics from network analysis have been applied, but few researchers have compared two or more symbioses using multiple metrics. In this study, we used two metrics (density and network degree centralization) to compare the degrees of completeness and dependence of eight diverse but representative industrial symbiosis networks. Through the combination of the two metrics, we divided the networks into three types: weak completeness, and two forms of strong completeness, namely "anchor tenant" mutualism and "equality-oriented" mutualism. The results showed that the networks with a weak degree of completeness were sparse and had few connections among nodes; for "anchor tenant" mutualism, the degree of completeness was relatively high, but the affiliated members were too dependent on core members; and the members in "equality-oriented" mutualism had equal roles, with diverse and flexible symbiotic paths. These results revealed some of the systems' internal structure and how different structures influenced the exchanges of materials, energy, and knowledge among members of a system, thereby providing insights into threats that may destabilize the network. Based on this analysis, we provide examples of the advantages and effectiveness of recent improvement projects in a typical Chinese eco-industrial park (Shandong Lubei).

  4. Node Resource Tape

    Science.gov (United States)

    2001-01-01

    This video shows footage from the construction of the International Space Station's Node 1 at Marshall Space Flight Center. The Expedition 1 crew, William Shepherd, Yuri Gidzenko, and Sergei Krikalev, inspects the Node.

  5. Objects, Components, Architectures, Services and Applications for a Networked World : International Conference NetObjectDays, NODe 2002, Erfurt, Germany, October 7-10, 2002, Revised Papers

    NARCIS (Netherlands)

    Aksit, Mehmet; Menzini, Mira; Unland, Rainer

    2003-01-01

    The contents of this volume can best be described by an excerpt from the original Call for Papers for NODe 2002. Ever evolving and increasingly powerful information and communication technologies have substantially changed the nature of global relationships, the sources of competitive advantage, and

  6. Related Drupal Nodes Block

    NARCIS (Netherlands)

    Van der Vegt, Wim

    2010-01-01

    Related Drupal Nodes Block This module exposes a block that uses Latent Semantic Analysis (Lsa) internally to suggest three nodes that are relevant to the node a user is viewing. This module performs three tasks. 1) It periodically indexes a Drupal site and generates a Lsa Term Document Matrix.

  7. Bone Anchored Hearing Aid

    Science.gov (United States)

    2002-01-01

    Executive Summary Objective The objective of this health technology policy assessment was to determine the effectiveness and cost-effectiveness of bone-anchored hearing aid (BAHA) in improving the hearing of people with conduction or mixed hearing loss. The Technology The (BAHA) is a bone conduction hearing device that includes a titanium fixture permanently implanted into the mastoid bone of the skull and an external percutaneous sound processor. The sound processor is attached to the fixture by means of a skin penetrating abutment. Because the device bypasses the middle ear and directly stimulates the cochlea, it has been recommended for individuals with conduction hearing loss or discharging middle ear infection. The titanium implant is expected to last a lifetime while the external sound processor is expected to last 5 years. The total initial device cost is approximately $5,300 and the external sound processor costs approximately $3,500. Review of BAHA by the Medical Advisory Secretariat The Medical Advisory Secretariat’s review is a descriptive synthesis of findings from 36 research articles published between January 1990 and May 2002. Summary of Findings No randomized controlled studies were found. The evidence was derived from level 4 case series with relative small sample sizes (ranging from 30-188). The majority of the studies have follow-up periods of eight years or longer. All except one study were based on monaural BAHA implant on the side with the best bone conduction threshold. Safety Level 4 evidence showed that BAHA has been be implanted safely in adults and children with success rates of 90% or higher in most studies. No mortality or life threatening morbidity has been reported. Revision rates for tissue reduction or resiting were generally under 10% for adults but have been reported to be as high as 25% in pediatric studies. Adverse skin reaction around the skin penetration site was the most common complication reported. Most of these

  8. Experimental demonstration of EON node supporting reconfigurable optical superchannel multicasting

    National Research Council Canada - National Science Library

    Zhu, Paikun; Li, Juhao; Chen, Yuanxiang; Chen, Xin; Wu, Zhongying; Ge, Dawei; Chen, Zhangyuan; He, Yongqi

    2015-01-01

    Elastic optical networks (EON) based on optical superchannel enables higher spectral flexibility, in which the network nodes should provide multiple all-optical functionalities to manipulate bandwidth-variable data traffic...

  9. Nodes Placement for reducing Energy Consumption in Multimedia Transmissions

    OpenAIRE

    Pace, Pasquale; Loscri, Valeria; Natalizio, Enrico; Razafindralambo, Tahiry

    2011-01-01

    International audience; Power consumption is an essential issue in wireless multimedia sensor networks (WMSNs) due to the elevated processing capabilities requested by the video acquisition hardware installed on the generic sensor node. Hence, node placement scheme in WMSNs greatly impacts the overall network lifetime. In this context, the paper first proposes a suitable hardware architecture to implement a feasible WMS node based on off-the-shelf technology, then it evaluates the energy cons...

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

    Science.gov (United States)

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

    2009-06-23

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

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

    Science.gov (United States)

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-11-16

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

  12. A new device for bone anchor fixation in laparoscopic sacrocolpopexy: the Franciscan laparoscopic bone anchor inserter.

    NARCIS (Netherlands)

    Weiden, R.M. van der; Withagen, M.I.J.; Bergkamp, A.B.; Mannaerts, G.H.

    2005-01-01

    BACKGROUND: A laparoscopic modification of the sacrocolpopexy procedure with mesh and bone anchor fixation with the Franciscan laparoscopic bone anchor inserter was developed. METHODS: We developed a laparoscopic bone anchor inserter for the placement of a titanium bone anchor in sacral segment 3 as

  13. 76 FR 30301 - Commercial Acquisition; Anchor Tenancy

    Science.gov (United States)

    2011-05-25

    ...-AD64 Commercial Acquisition; Anchor Tenancy AGENCY: National Aeronautics and Space Administration... Competitiveness Act (CSCA) of 1992. NASA may enter into multi-year anchor tenancy contracts for commercial space goods or services. Anchor Tenancy means ``an arrangement in which the United States Government agrees to...

  14. 21 CFR 872.3130 - Preformed anchor.

    Science.gov (United States)

    2010-04-01

    ... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Preformed anchor. 872.3130 Section 872.3130 Food... DEVICES DENTAL DEVICES Prosthetic Devices § 872.3130 Preformed anchor. (a) Identification. A preformed anchor is a device made of austenitic alloys or alloys containing 75 percent or greater gold or metals of...

  15. On the Theory of Ground Anchors

    Science.gov (United States)

    1975-01-01

    the A.B. Chance Company (Fig. 57). These anchors were geometrically similar to the familiar Never-Creep anchors on the market today. However, in an...1. part ’. Sandegren. E.. P.O. Sahlstrom and If. Sutile (1973) Behavior of anchored sheet-pile %.til exposed to frost action. Sartryck och

  16. Asymmetric development of dorsal and ventral attention networks in the human brain.

    Science.gov (United States)

    Farrant, Kristafor; Uddin, Lucina Q

    2015-04-01

    Two neural systems for goal-directed and stimulus-driven attention have been described in the adult human brain; the dorsal attention network (DAN) centered in the frontal eye fields (FEF) and intraparietal sulcus (IPS), and the ventral attention network (VAN) anchored in the temporoparietal junction (TPJ) and ventral frontal cortex (VFC). Little is known regarding the processes governing typical development of these attention networks in the brain. Here we use resting state functional MRI data collected from thirty 7 to 12 year-old children and thirty 18 to 31 year-old adults to examine two key regions of interest from the dorsal and ventral attention networks. We found that for the DAN nodes (IPS and FEF), children showed greater functional connectivity with regions within the network compared with adults, whereas adults showed greater functional connectivity between the FEF and extra-network regions including the posterior cingulate cortex. For the VAN nodes (TPJ and VFC), adults showed greater functional connectivity with regions within the network compared with children. Children showed greater functional connectivity between VFC and nodes of the salience network. This asymmetric pattern of development of attention networks may be a neural signature of the shift from over-representation of bottom-up attention mechanisms to greater top-down attentional capacities with development. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.

  17. Asymmetric development of dorsal and ventral attention networks in the human brain

    Directory of Open Access Journals (Sweden)

    Kristafor Farrant

    2015-04-01

    Full Text Available Two neural systems for goal-directed and stimulus-driven attention have been described in the adult human brain; the dorsal attention network (DAN centered in the frontal eye fields (FEF and intraparietal sulcus (IPS, and the ventral attention network (VAN anchored in the temporoparietal junction (TPJ and ventral frontal cortex (VFC. Little is known regarding the processes governing typical development of these attention networks in the brain. Here we use resting state functional MRI data collected from thirty 7 to 12 year-old children and thirty 18 to 31 year-old adults to examine two key regions of interest from the dorsal and ventral attention networks. We found that for the DAN nodes (IPS and FEF, children showed greater functional connectivity with regions within the network compared with adults, whereas adults showed greater functional connectivity between the FEF and extra-network regions including the posterior cingulate cortex. For the VAN nodes (TPJ and VFC, adults showed greater functional connectivity with regions within the network compared with children. Children showed greater functional connectivity between VFC and nodes of the salience network. This asymmetric pattern of development of attention networks may be a neural signature of the shift from over-representation of bottom-up attention mechanisms to greater top-down attentional capacities with development.

  18. Diagnosis of traction electric motor at irregularity in speed of anchor rotation

    Directory of Open Access Journals (Sweden)

    D.V. Cyernyayev

    2013-06-01

    Full Text Available Purpose. To offer a complex diagnostic parameter (or system of parameters that would allow determining the fault of electric traction motor as well as electromagnetic and mechanical nature. Methodology. Technology transition to maintenance and repair of equipment in accordance with its actual condition are developed rapidly in the world practice in recent years. Control of equipment and forecasting of its technical condition with the use of non-destructive testing and diagnosis in-place methods is the basis of such technologies. In operation the reliability level of electrical machines including traction electric motor is very difficult to maintain. Analyzing failures of rolling stock, which arise from the operation, we can see that traction electric motors are the least reliable nodes. Diagnostics of traction electric motor at irregularity in speed of anchor rotation is proposed. A measurement device for irregularity in speed of anchor rotation was developed. Findings. An experimental research in order to determine the irregularity in speed of anchor armature shaft rotation and coupling of irregularity in speed of anchor rotation with traction electric motors nodes failures was executed. The experimental dependence of the waveform uneven rotation anchor for engines with different technical conditions. Originality. A method for diagnosis of traction electric motors at irregularity in speed of anchor armature shaft rotation was first proposed. This method after further improvement can be used at bench test of engines in their work without load and for the quality of the repair. Practical value. The device for detecting defects of the traction electric motor nodes as well as electromagnetic and mechanical nature without engine disassembly may be used for control of engine assembly after repair, and at testing of traction electric motor without load.

  19. Anchoring bias in online voting

    Science.gov (United States)

    Yang, Zimo; Zhang, Zi-Ke; Zhou, Tao

    2012-12-01

    Voting online with explicit ratings could largely reflect people's preferences and objects' qualities, but ratings are always irrational, because they may be affected by many unpredictable factors like mood, weather and other people's votes. By analyzing two real systems, this paper reveals a systematic bias embedding in the individual decision-making processes, namely people tend to give a low rating after a low rating, as well as a high rating following a high rating. This so-called anchoring bias is validated via extensive comparisons with null models, and numerically speaking, the extent of bias decays with voting interval in a logarithmic form. Our findings could be applied in the design of recommender systems and considered as important complementary materials to previous knowledge about anchoring effects on financial trades, performance judgments, auctions, and so on.

  20. Anchoring Vignettes and Response Consistency

    OpenAIRE

    Arie Kapteyn; Smith, James P.; Arthur van Soest

    2011-01-01

    The use of anchoring vignettes to correct for differential item functioning rests upon two identifying assumptions: vignette equivalence and response consistency. To test the second assumption the authors conduct an experiment in which respondents in an Internet panel are asked to both describe their health in a number of domains and rate their health in these domains. In a subsequent interview respondents are shown vignettes that are in fact descriptions of their own health. Under response c...

  1. Sensor Network-Based Localization for Continuous Tracking Applications: Implementation and Performance Evaluation

    Directory of Open Access Journals (Sweden)

    Franco Davoli

    2008-10-01

    Full Text Available The increasing interest in systems able to provide users with immersive services (e.g., domotics, context-aware applications, and immersive distance learning tools has encouraged the development of cheap and effective platforms aimed at tracking objects and people within a certain space. In this context, wireless sensor networks (WSNs can play a very important role, since specialized sensors can be fruitfully exploited in order to generate/receive signals by means of which the WSN can derive the position of nodes joined to the objects to be tracked. The paper presents an original localization platform that exploits a single-hop WSN, based on a Microchip MCU and a Cypress RF device, to track its moving nodes. Specifically, the nodes of the network are divided into three sets: the first set consists of anchor nodes that, according to the commands from the sink (the central node of the WSN, generate ultrasonic pulses. These pulses are received by the second set of (moving nodes, which estimate the pulse time trip and communicate it to the sink. Finally, the last set is constituted by general purpose nodes that collect any kind of data from the surrounding field. The sink gathers all the data, computes the position of moving nodes, and transfers information to external users on the Internet. The algorithms adopted to manage the network and to localize moving nodes are discussed. A working prototype based upon the hardware platform, software, and protocol described in this paper has been deployed and tested, and some results are shown. Simulation results of the localization system are presented to show system scalability.

  2. Electrostatically anchored branched brush layers.

    Science.gov (United States)

    Liu, Xiaoyan; Dedinaite, Andra; Rutland, Mark; Thormann, Esben; Visnevskij, Ceslav; Makuska, Ricardas; Claesson, Per M

    2012-11-06

    A novel type of block copolymer has been synthesized. It consists of a linear cationic block and an uncharged bottle-brush block. The nonionic bottle-brush block contains 45 units long poly(ethylene oxide) side chains. This polymer was synthesized with the intention of creating branched brush layers firmly physisorbed to negatively charged surfaces via the cationic block, mimicking the architecture (but not the chemistry) of bottle-brush molecules suggested to be present on the cartilage surface, and contributing to the efficient lubrication of synovial joints. The adsorption properties of the diblock copolymer as well as of the two blocks separately were studied on silica surfaces using quartz crystal microbalance with dissipation monitoring (QCM-D) and optical reflectometry. The adsorption kinetics data highlight that the diblock copolymers initially adsorb preferentially parallel to the surface with both the cationic block and the uncharged bottle-brush block in contact with the surface. However, as the adsorption proceeds, a structural change occurs within the layer, and the PEO bottle-brush block extends toward solution, forming a surface-anchored branched brush layer. As the adsorption plateau is reached, the diblock copolymer layer is 46-48 nm thick, and the water content in the layer is above 90 wt %. The combination of strong electrostatic anchoring and highly hydrated branched brush structures provide strong steric repulsion, low friction forces, and high load bearing capacity. The strong electrostatic anchoring also provides high stability of preadsorbed layers under different ionic strength conditions.

  3. Multi-hop localization algorithm based on grid-scanning for wireless sensor networks.

    Science.gov (United States)

    Wan, Jiangwen; Guo, Xiaolei; Yu, Ning; Wu, Yinfeng; Feng, Renjian

    2011-01-01

    For large-scale wireless sensor networks (WSNs) with a minority of anchor nodes, multi-hop localization is a popular scheme for determining the geographical positions of the normal nodes. However, in practice existing multi-hop localization methods suffer from various kinds of problems, such as poor adaptability to irregular topology, high computational complexity, low positioning accuracy, etc. To address these issues in this paper, we propose a novel Multi-hop Localization algorithm based on Grid-Scanning (MLGS). First, the factors that influence the multi-hop distance estimation are studied and a more realistic multi-hop localization model is constructed. Then, the feasible regions of the normal nodes are determined according to the intersection of bounding square rings. Finally, a verifiably good approximation scheme based on grid-scanning is developed to estimate the coordinates of the normal nodes. Additionally, the positioning accuracy of the normal nodes can be improved through neighbors' collaboration. Extensive simulations are performed in isotropic and anisotropic networks. The comparisons with some typical algorithms of node localization confirm the effectiveness and efficiency of our algorithm.

  4. Lymph node culture

    Science.gov (United States)

    ... get infected and you may need to take antibiotics) Nerve injury if the biopsy is done on a lymph node close to nerves (the numbness usually goes away in a few months) Alternative Names Culture - lymph node Images Lymphatic system Lymph ...

  5. Deploying Node.js

    CERN Document Server

    Pasquali, Sandro

    2015-01-01

    If you are an intermediate or advanced developer deploying your Node.js applications, then this book is for you. If you have already built a Node application or module and want to take your knowledge to the next level, this book will help you find your way.

  6. A Least Square-Based Self-Adaptive Localization Method for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Baoguo Yu

    2016-01-01

    Full Text Available In the wireless sensor network (WSN localization methods based on Received Signal Strength Indicator (RSSI, it is usually required to determine the parameters of the radio signal propagation model before estimating the distance between the anchor node and an unknown node with reference to their communication RSSI value. And finally we use a localization algorithm to estimate the location of the unknown node. However, this localization method, though high in localization accuracy, has weaknesses such as complex working procedure and poor system versatility. Concerning these defects, a self-adaptive WSN localization method based on least square is proposed, which uses the least square criterion to estimate the parameters of radio signal propagation model, which positively reduces the computation amount in the estimation process. The experimental results show that the proposed self-adaptive localization method outputs a high processing efficiency while satisfying the high localization accuracy requirement. Conclusively, the proposed method is of definite practical value.

  7. Anchor handling tug operations: a practical guide to the operation of modern anchor handling tugs engaged in anchor handling and towing operations

    National Research Council Canada - National Science Library

    Clark, I.C; Hancox, M

    2012-01-01

    ... --Turning and manoeuvring modern anchor handling vessels --The AHTS design and towing operations --The dangers of very high speed loads during deep water anchor handling operations --The dangers...

  8. Long range node-strut analysis of trabecular bone microarchitecture

    DEFF Research Database (Denmark)

    Schmah, Tanya; Marwan, Norbert; Thomsen, Jesper Skovhus

    2011-01-01

    PURPOSE: We present a new morphometric measure of trabecular bone microarchitecture, called mean node strength (NdStr), which is part of a newly developed approach called long range node-strut analysis. Our general aim is to describe and quantify the apparent "latticelike" microarchitecture...... of the trabecular bone network. METHODS: Similar in some ways to the topological node-strut analysis introduced by Garrahan et al. [J. Microsc. 142, 341-349 (1986)], our method is distinguished by an emphasis on long-range trabecular connectivity. Thus, while the topological classification of a pixel (after...... method produces a continuous variable, node strength. The node strength is averaged over a region of interest to produce the mean node strength of the region. RESULTS: We have applied our long range node-strut analysis to a set of 26 high-resolution peripheral quantitative computed tomography (p...

  9. Dynamics of excitable nodes on random graphs

    Indian Academy of Sciences (India)

    ogy and dynamics of excitable nodes on Erd˝os–Rényi (ER) [16] random graphs. Our focus is on rhythmic dynamics, namely periodic solutions, in this representative model. Since the network topology plays an important role, the question of how different growth rules. DOI: 10.1007/s12043-011-0180-6; ePublication: 31 ...

  10. 33 CFR 164.19 - Requirements for vessels at anchor.

    Science.gov (United States)

    2010-07-01

    ... anchor. 164.19 Section 164.19 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND... vessels at anchor. The master or person in charge of each vessel that is anchored shall ensure that: (a) A proper anchor watch is maintained; (b) Procedures are followed to detect a dragging anchor; and (c...

  11. 24 CFR 3285.402 - Ground anchor installations.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 5 2010-04-01 2010-04-01 false Ground anchor installations. 3285....402 Ground anchor installations. (a) Ground anchor certification and testing. Each ground anchor must... registered architect must certify, the ground anchor for use in a classified soil (refer to § 3285.202...

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

    Science.gov (United States)

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

    2008-06-03

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

  13. Improvement of the SEP protocol based on community structure of node degree

    Science.gov (United States)

    Li, Donglin; Wei, Suyuan

    2017-05-01

    Analyzing the Stable election protocol (SEP) in wireless sensor networks and aiming at the problem of inhomogeneous cluster-heads distribution and unreasonable cluster-heads selectivity and single hop transmission in the SEP, a SEP Protocol based on community structure of node degree (SEP-CSND) is proposed. In this algorithm, network node deployed by using grid deployment model, and the connection between nodes established by setting up the communication threshold. The community structure constructed by node degree, then cluster head is elected in the community structure. On the basis of SEP, the node's residual energy and node degree is added in cluster-heads election. The information is transmitted with mode of multiple hops between network nodes. The simulation experiments showed that compared to the classical LEACH and SEP, this algorithm balances the energy consumption of the entire network and significantly prolongs network lifetime.

  14. Anchor Bolt Position in Base Plate In Terms Of T and J Anchor Bolt

    Directory of Open Access Journals (Sweden)

    b Osman Mohamad Hairi

    2017-01-01

    Full Text Available Generally, L anchor bolt system has been used for a long period of time in construction industry as one of the distributing load structures. However, there are some weaknesses in L anchor bolt which may straighten and pullup when charged with tensile load. Current practices prefer to use other types of anchor bolt systems, such as headed studs anchor bolt system to replace the L anchor bolt design. There has been lack of studies to prove that it is more effective in terms of performance. A new T anchor bolt which was basically modified from headed studs anchor bolt was proposed in this study to compare its performance of tensile loading in concrete failure to typical L design. This study aims to determine whether the T anchor bolt system gives better performance as compared to an L anchor bolt system. The performance was rated based on tensile loading on concrete failure pattern. A pullout test was conducted on two different anchor bolt systems, namely L and T. The anchor bolt embedded depth, h in concrete were varied according to their hook or bend radius. Each sample was repeated twice. There were totally eight samples. The hook or bend radius used were 50 mm and 57.5 mm for sample L1 and L2, respectively. 90-degree bend were used on sample T1 and T2. Based on test results, it can be seen that the performance of concrete failure pattern under tensile load on both L and T anchor bolt design samples with 200 mm embedment depth was better than deeper embedment depth of 230 mm. But the L anchor bolt design gives the best results as compared to T design. Although T anchor bolt design shows higher resistance before first bond failure to the concrete sample. T anchor bolt was analysed and needed deeper embedment depth to allow formation of cone pull-out shape to acquire better performance.

  15. Robustness Envelopes of Networks

    NARCIS (Netherlands)

    Trajanovski, S.; Martín-Hernández, J.; Winterbach, W.; Van Mieghem, P.

    2013-01-01

    We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case

  16. Observed Score Equating Using a Mini-Version Anchor and an Anchor with Less Spread of Difficulty: A Comparison Study

    Science.gov (United States)

    Liu, Jinghua; Sinharay, Sandip; Holland, Paul; Feigenbaum, Miriam; Curley, Edward

    2011-01-01

    Two different types of anchors are investigated in this study: a mini-version anchor and an anchor that has a less spread of difficulty than the tests to be equated. The latter is referred to as a midi anchor. The impact of these two different types of anchors on observed score equating are evaluated and compared with respect to systematic error…

  17. Coordination of Industrial Symbiosis through Anchoring

    Directory of Open Access Journals (Sweden)

    Li Sun

    2017-04-01

    Full Text Available This paper aims to contribute to understanding the dynamics of industrial symbiosis. More specifically, we focus on the dynamics of anchoring as they can be observed in the Chinese context of eco-industrial development. We define anchoring as those activities that (typically local actors perform to create local physical and institutional conditions conducive to the emergence and further development of industrial symbiosis in a specific regional industrial system. We argue that, in the study of industrial symbiosis dynamics, it is conceptually more useful to focus on anchoring as an activity, rather than anchor tenants as actors. Based on a systematic literature review, we distinguish two types of anchoring activities: institutional and physical. We analyze anchoring dynamics in the case of Qijiang Industrial Symbiosis (Chongqing Municipality in China. We have identified the physical and institutional anchoring activities, the actors responsible for these activities, and how different anchoring activities build on each other over time. Our case study shows that the attempt to bring about industrial symbiosis in the Qijiang industrial park can be described in a richer way than just ‘governmental planning’.

  18. Anchoring of proteins to lactic acid bacteria

    NARCIS (Netherlands)

    Leenhouts, K; Buist, Girbe; Kok, Jan

    1999-01-01

    The anchoring of proteins to the cell surface of lactic acid bacteria (LAB) using genetic techniques is an exciting and emerging research area that holds great promise for a wide variety of biotechnological applications. This paper reviews five different types of anchoring domains that have been

  19. Coordination of industrial symbiosis through anchoring

    NARCIS (Netherlands)

    Sun, Li; Spekkink, Wouter; Cuppen, E.H.W.J.; Korevaar, G.

    2017-01-01

    This paper aims to contribute to understanding the dynamics of industrial symbiosis. More specifically, we focus on the dynamics of anchoring as they can be observed in the Chinese context of eco-industrial development. We define anchoring as those activities that (typically local) actors perform

  20. Method of fabrication of anchored nanostructure materials

    Science.gov (United States)

    Seals, Roland D; Menchhofer, Paul A; Howe, Jane Y; Wang, Wei

    2013-11-26

    Methods for fabricating anchored nanostructure materials are described. The methods include heating a nano-catalyst under a protective atmosphere to a temperature ranging from about 450.degree. C. to about 1500.degree. C. and contacting the heated nano-catalysts with an organic vapor to affix carbon nanostructures to the nano-catalysts and form the anchored nanostructure material.

  1. Surgical-site infection following lymph node excision indicates susceptibility for lymphedema

    DEFF Research Database (Denmark)

    Jørgensen, Mads Gustaf; Toyserkani, Navid Mohamadpour; Thomsen, Jørn Bo

    2018-01-01

    BACKGROUND AND OBJECTIVES: Cancer-related lymphedema is a common complication following lymph node excision. Prevention of lymphedema is essential, as treatment options are limited. Known risk factors are firmly anchored to the cancer treatment itself; however potentially preventable factors such...

  2. Active patterning and asymmetric transport in a model actomyosin network

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Shenshen [Department of Chemical Engineering and Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States); Wolynes, Peter G. [Department of Chemistry and Center for Theoretical Biological Physics, Rice University, Houston, Texas 77005 (United States)

    2013-12-21

    Cytoskeletal networks, which are essentially motor-filament assemblies, play a major role in many developmental processes involving structural remodeling and shape changes. These are achieved by nonequilibrium self-organization processes that generate functional patterns and drive intracellular transport. We construct a minimal physical model that incorporates the coupling between nonlinear elastic responses of individual filaments and force-dependent motor action. By performing stochastic simulations we show that the interplay of motor processes, described as driving anti-correlated motion of the network vertices, and the network connectivity, which determines the percolation character of the structure, can indeed capture the dynamical and structural cooperativity which gives rise to diverse patterns observed experimentally. The buckling instability of individual filaments is found to play a key role in localizing collapse events due to local force imbalance. Motor-driven buckling-induced node aggregation provides a dynamic mechanism that stabilizes the two-dimensional patterns below the apparent static percolation limit. Coordinated motor action is also shown to suppress random thermal noise on large time scales, the two-dimensional configuration that the system starts with thus remaining planar during the structural development. By carrying out similar simulations on a three-dimensional anchored network, we find that the myosin-driven isotropic contraction of a well-connected actin network, when combined with mechanical anchoring that confers directionality to the collective motion, may represent a novel mechanism of intracellular transport, as revealed by chromosome translocation in the starfish oocyte.

  3. Ringstone anchors from Gujarat, west coast of India

    Digital Repository Service at National Institute of Oceanography (India)

    Gaur, A.S.; Sundaresh; Tripati, S.; Bandodkar, S.N.

    of Dwarka and Somanath have yielded several ringstone anchors along with other stone anchors such as triangular and grapnel types. The raw material used for these ring stones comprises basalt, sandstone and limestone. Earlier, these anchors were identified...

  4. The effect of accuracy motivation on anchoring and adjustment: do people adjust from provided anchors?

    Science.gov (United States)

    Simmons, Joseph P; LeBoeuf, Robyn A; Nelson, Leif D

    2010-12-01

    Increasing accuracy motivation (e.g., by providing monetary incentives for accuracy) often fails to increase adjustment away from provided anchors, a result that has led researchers to conclude that people do not effortfully adjust away from such anchors. We challenge this conclusion. First, we show that people are typically uncertain about which way to adjust from provided anchors and that this uncertainty often causes people to believe that they have initially adjusted too far away from such anchors (Studies 1a and 1b). Then, we show that although accuracy motivation fails to increase the gap between anchors and final estimates when people are uncertain about the direction of adjustment, accuracy motivation does increase anchor-estimate gaps when people are certain about the direction of adjustment, and that this is true regardless of whether the anchors are provided or self-generated (Studies 2, 3a, 3b, and 5). These results suggest that people do effortfully adjust away from provided anchors but that uncertainty about the direction of adjustment makes that adjustment harder to detect than previously assumed. This conclusion has important theoretical implications, suggesting that currently emphasized distinctions between anchor types (self-generated vs. provided) are not fundamental and that ostensibly competing theories of anchoring (selective accessibility and anchoring-and-adjustment) are complementary. PsycINFO Database Record (c) 2010 APA, all rights reserved.

  5. The auditory cortex hosts network nodes influential for emotion processing: An fMRI study on music-evoked fear and joy.

    Science.gov (United States)

    Koelsch, Stefan; Skouras, Stavros; Lohmann, Gabriele

    2018-01-01

    Sound is a potent elicitor of emotions. Auditory core, belt and parabelt regions have anatomical connections to a large array of limbic and paralimbic structures which are involved in the generation of affective activity. However, little is known about the functional role of auditory cortical regions in emotion processing. Using functional magnetic resonance imaging and music stimuli that evoke joy or fear, our study reveals that anterior and posterior regions of auditory association cortex have emotion-characteristic functional connectivity with limbic/paralimbic (insula, cingulate cortex, and striatum), somatosensory, visual, motor-related, and attentional structures. We found that these regions have remarkably high emotion-characteristic eigenvector centrality, revealing that they have influential positions within emotion-processing brain networks with "small-world" properties. By contrast, primary auditory fields showed surprisingly strong emotion-characteristic functional connectivity with intra-auditory regions. Our findings demonstrate that the auditory cortex hosts regions that are influential within networks underlying the affective processing of auditory information. We anticipate our results to incite research specifying the role of the auditory cortex-and sensory systems in general-in emotion processing, beyond the traditional view that sensory cortices have merely perceptual functions.

  6. Network testbed creation and validation

    Energy Technology Data Exchange (ETDEWEB)

    Thai, Tan Q.; Urias, Vincent; Van Leeuwen, Brian P.; Watts, Kristopher K.; Sweeney, Andrew John

    2017-03-21

    Embodiments of network testbed creation and validation processes are described herein. A "network testbed" is a replicated environment used to validate a target network or an aspect of its design. Embodiments describe a network testbed that comprises virtual testbed nodes executed via a plurality of physical infrastructure nodes. The virtual testbed nodes utilize these hardware resources as a network "fabric," thereby enabling rapid configuration and reconfiguration of the virtual testbed nodes without requiring reconfiguration of the physical infrastructure nodes. Thus, in contrast to prior art solutions which require a tester manually build an emulated environment of physically connected network devices, embodiments receive or derive a target network description and build out a replica of this description using virtual testbed nodes executed via the physical infrastructure nodes. This process allows for the creation of very large (e.g., tens of thousands of network elements) and/or very topologically complex test networks.

  7. Network testbed creation and validation

    Science.gov (United States)

    Thai, Tan Q.; Urias, Vincent; Van Leeuwen, Brian P.; Watts, Kristopher K.; Sweeney, Andrew John

    2017-04-18

    Embodiments of network testbed creation and validation processes are described herein. A "network testbed" is a replicated environment used to validate a target network or an aspect of its design. Embodiments describe a network testbed that comprises virtual testbed nodes executed via a plurality of physical infrastructure nodes. The virtual testbed nodes utilize these hardware resources as a network "fabric," thereby enabling rapid configuration and reconfiguration of the virtual testbed nodes without requiring reconfiguration of the physical infrastructure nodes. Thus, in contrast to prior art solutions which require a tester manually build an emulated environment of physically connected network devices, embodiments receive or derive a target network description and build out a replica of this description using virtual testbed nodes executed via the physical infrastructure nodes. This process allows for the creation of very large (e.g., tens of thousands of network elements) and/or very topologically complex test networks.

  8. Mobility and Cooperation to Thwart Node Capture Attacks in MANETs

    Directory of Open Access Journals (Sweden)

    Mauro Conti

    2009-01-01

    Full Text Available The nature of mobile ad hoc networks (MANETs, often unattended, makes this type of networks subject to some unique security issues. In particular, one of the most vexing problem for MANETs security is the node capture attack: an adversary can capture a node from the network eventually acquiring all the cryptographic material stored in it. Further, the captured node can be reprogrammed by the adversary and redeployed in the network in order to perform malicious activities. In this paper, we address the node capture attack in MANETs. We start from the intuition that mobility, in conjunction with a reduced amount of local cooperation, helps computing effectively and with a limited resource usage network global security properties. Then, we develop this intuition and use it to design a mechanism to detect the node capture attack. We support our proposal with a wide set of experiments showing that mobile networks can leverage mobility to compute global security properties, like node capture detection, with a small overhead.

  9. Lymph node retrieval rates in melanoma: a quality assessment parameter.

    Science.gov (United States)

    Berger-Richardson, D; Cordeiro, E; Ernjakovic, M; Easson, A M

    2017-08-01

    Regional lymph node dissection (rlnd) for melanoma with nodal metastasis is a specialized procedure that is associated with improved disease-specific survival in selected patients. Furthermore, there is evidence that a higher lymph node retrieval rate (lnrr) is associated with improved local control. Currently, no consensus has been reached on the definition of an adequate lnrr. A minimum lnrr has been proposed as a quality assessment parameter that has to be validated. We conducted a retrospective cohort analysis at the Princess Margaret Cancer Centre (University Health Network, Toronto, ON). The lnrrs for all patients who underwent rlnd for malignant cutaneous melanoma during 2000-2010 were recorded. Indications for rlnd were a positive sentinel lymph node biopsy or clinical lymphadenopathy (palpable or radiologically detected). Of the 207 identified rlnds, 146 (70.5%) were subsequent to a positive sentinel lymph node biopsy, and 61 (29.5%) were performed for clinical lymphadenopathy. The median lnrr was 24 nodes (range: 9-47 nodes; 10th percentile: 14 nodes) for axillary rlnd, 12 nodes (range: 5-30 nodes; 10th percentile: 8 nodes) for inguinal rlnd, and 16 nodes (range: 10-21 nodes; 10th percentile: 11 nodes) for ilioinguinal rlnd. The results were similar when comparing patients with positive sentinel lymph nodes and those with clinical lymphadenopathy, and the same surgical techniques were used in both groups. The lnrrs at our institution are similar to rates reported at other tertiary-care melanoma centres. A minimum acceptable lnrr can be considered a quality assessment parameter in the surgical management of melanoma with nodal metastasis.

  10. Visualization of Social Networks

    NARCIS (Netherlands)

    Boertjes, E.M.; Kotterink, B.; Jager, E.J.

    2011-01-01

    Current visualizations of social networks are mostly some form of node-link diagram. Depending on the type of social network, this can be some treevisualization with a strict hierarchical structure or a more generic network visualization.

  11. Anchoring Revisited: The Role of the Comparative Question

    Science.gov (United States)

    Grau, Ina; Bohner, Gerd

    2014-01-01

    When people estimate a numeric value after judging whether it is larger or smaller than a high or low anchor value (comparative question), estimates are biased in the direction of the anchor. One explanation for this anchoring effect is that people selectively access knowledge consistent with the anchor value as part of a positive test strategy. Two studies (total N = 184) supported the alternative explanation that people access knowledge consistent with their own answer to the comparative question. Specifically, anchoring effects emerged when the answer to the comparative question was unexpected (lower than the low anchor or higher than the high anchor). For expected answers (lower than the high anchor or higher than the low anchor), however, anchoring effects were attenuated or reversed. The anchor value itself was almost never reported as an absolute estimate. PMID:24454953

  12. Stone anchors from Minicoy Island, Lakshadweep, India

    Digital Repository Service at National Institute of Oceanography (India)

    Tripati, S.

    mariners. The logo of the Nautical Archaeology Society, seen on the cover of IJNA, has been taken from a bichrome Cypriot jug of the 7th century BC. It depicts a vessel with two oars, with a helmsman at the stern, and another crewman raising or lowering... a ring-stone anchor at the bow (Fig. 9) (Fenwick, 2000). This anchor is tied with a rope, without a wooden stock, and the size of the hole appears to be wide. In the Maldives, such anchors are made of round coral stones with a forked timber...

  13. Anchored nanostructure materials and method of fabrication

    Science.gov (United States)

    Seals, Roland D; Menchhofer, Paul A; Howe, Jane Y; Wang, Wei

    2012-11-27

    Anchored nanostructure materials and methods for their fabrication are described. The anchored nanostructure materials may utilize nano-catalysts that include powder-based or solid-based support materials. The support material may comprise metal, such as NiAl, ceramic, a cermet, or silicon or other metalloid. Typically, nanoparticles are disposed adjacent a surface of the support material. Nanostructures may be formed as anchored to nanoparticles that are adjacent the surface of the support material by heating the nano-catalysts and then exposing the nano-catalysts to an organic vapor. The nanostructures are typically single wall or multi-wall carbon nanotubes.

  14. Sutures and suture anchors--update 2006.

    Science.gov (United States)

    Barber, F Alan; Herbert, Morley A; Coons, David A; Boothby, Michael H

    2006-10-01

    To evaluate recently introduced sutures and suture anchors for single pull load to failure strength and failure mode. Suture anchors were tested in fresh porcine metaphyseal cortex and cancellous troughs with the use of an established protocol. An Instron machine applied tensile loads parallel to the axis of insertion at a rate of 12.5 mm/sec until failure, and mean anchor failure strengths were calculated. The mode of failure (anchor pull-out, suture eyelet cut-out, or suture failure) was recorded. Anchors tested included the BioRaptor 2.9, BioZip, Super Revo, Impact, Allograft cortical anchor, SpiraLok, Herculon, AxyaLoop titanium anchors 3, 5, and 6.5 mm, AxyaLoop bioabsorbable anchors 3, 5, and 6.5, ParaFix titanium anchors 3, 5, and 6.5, ParaSorb BioAnchors 3, 5.5, and 6.5, and Bio-Corkscrew FT. Sutures were also tested through an established protocol for load to failure. Sutures tested consisted of Orthocord, Ultrabraid (White and CoBraid), ForceFiber, Hi-Fi, MagnumWire, and Maxbraid Polyethylene Plus. Mean failure loads were as follows: BioRaptor 238 N, BioZip 366 N, double-loaded Super Revo 486 N, triple-loaded Super Revo 362 N, Impact 202 N, Allograft cortical anchor 240 N, SpiraLok 289 N, Herculon 819 N, AxyaLoop titanium anchors 3.0 (335 N), 5.0 (485 N), and 6.5 mm (465 N), AxyaLoop bioabsorbable anchors 3 (143 N), 5 (395 N), and 6.5 (369 N), ParaFix titanium anchors 3 (335 N), 5 (485 N), and 6.5 (465 N), ParaSorb BioAnchors 3 (143 N), 5.5 (395 N), and 6.5 (369 N), and Bio-Corkscrew FT (260 N). The sutures all broke at the mid point of their tested strands away from the grips. Mean suture strength for No. 2 Orthocord was 92 N; for No. 2 Ultrabraid CoBraid and White, strengths were 265 N and 280 N, respectively; strength for No. 2 Force Fiber was 289 N, for No. 2 Hi-Fi 250 N, for No. 2 MagnumWire 303 N, and for No. 2 Maxbraid Polyethylene Plus 256 N. Newer suture products showed significant improvements in load to failure values when compared with braided

  15. Vulnerability of critical infrastructures : identifying critical nodes.

    Energy Technology Data Exchange (ETDEWEB)

    Cox, Roger Gary; Robinson, David Gerald

    2004-06-01

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

  16. Secondary anchor targeted cell release.

    Science.gov (United States)

    Ansari, Ali; Lee-Montiel, Felipe T; Amos, Jennifer R; Imoukhuede, P I

    2015-11-01

    Personalized medicine offers the promise of tailoring therapy to patients, based on their cellular biomarkers. To achieve this goal, cellular profiling systems are needed that can quickly and efficiently isolate specific cell types without disrupting cellular biomarkers. Here we describe the development of a unique platform that facilitates gentle cell capture via a secondary, surface-anchoring moiety, and cell release. The cellular capture system consists of a glass surface functionalized with APTES, d-desthiobiotin, and streptavidin. Biotinylated mCD11b and hIgG antibodies are used to capture mouse macrophages (RAW 264.7) and human breast cancer (MCF7-GFP) cell lines, respectively. The surface functionalization is optimized by altering assay components, such as streptavidin, d-desthiobiotin, and APTES, to achieve cell capture on 80% of the functionalized surface and cell release upon biotin treatment. We also demonstrate an ability to capture 50% of target cells within a dual-cell mixture. This engineering advancement is a critical step towards achieving cell isolation platforms for personalized medicine. © 2015 Wiley Periodicals, Inc.

  17. On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model.

    Science.gov (United States)

    Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco

    2015-06-30

    Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called "anchor" nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results

  18. Starting point anchoring effects in choice experiments

    DEFF Research Database (Denmark)

    Ladenburg, Jacob; Olsen, Søren Bøye

    Anchoring is acknowledged as a potential source of considerable bias in Dichotomous Choice Contingent Valuation studies. Recently, another stated preference method known as Choice Experiments has gained in popularity as well as the number of applied studies. However, as the elicitation...... of preferences in Choice Experiments resembles the Dichotomous Choice format, there is reason to suspect that Choice Experiments are equally vulnerable to anchoring bias. Employing different sets of price levels in a so-called Instruction Choice Set presented prior to the actual choice sets, the present study...... finds that preferences elicited by Choice Experiments can be subject to starting point anchoring bias. Different price levels provoked significantly different distributions of choice in two otherwise identical choice set designs. On a more specific level, the results indicate that the anchoring...

  19. One-Time Sensors: A Novel Concept to Mitigate Node Capture Attacks,

    NARCIS (Netherlands)

    Bicakci, K.; Gamage, C.D.; Crispo, B.; Tanenbaum, A.S.

    2005-01-01

    Dealing with captured nodes is generally accepted as the most difficult challenge to wireless sensor network security. By utilizing the low-cost property of sensor nodes, we introduce the novel concept of one-time sensors to mitigate node-capture attacks. The basic idea is to load each sensor with

  20. Robustness of weighted networks

    Science.gov (United States)

    Bellingeri, Michele; Cassi, Davide

    2018-01-01

    Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency). We find that: (i) the efficiency of the attack strategies changed using binary or weighted network functioning measures, both for real-world or model networks; (ii) in some cases, removing nodes according to weighted rank produced the highest damage when functioning was measured by the weighted efficiency; (iii) adopting weighted measure for the network damage changed the efficacy of the attack strategy with respect the binary analyses. Our results show that if the weighted structure of complex networks is not taken into account, this may produce misleading models to forecast the system response to node failure, i.e. consider binary links may not unveil the real damage induced in the system. Last, once weighted measures are introduced, in order to discover the best attack strategy, it is important to analyze the network response to node loss using nodes rank accounting the intensity of the links to the node.