WorldWideScience

Sample records for network anchor nodes

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

  2. Protocol for multiple node network

    Science.gov (United States)

    Kirkham, Harold (Inventor)

    1995-01-01

    The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs an antibody recognition message termination process performed by all remote nodes and a remote node polling process performed by other nodes which are master units controlling remote nodes in respective zones of the network assigned to respective master nodes. Each remote node repeats only those messages originated in the local zone, to provide isolation among the master nodes.

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

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

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

    OpenAIRE

    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 server (e.g. application server, a proxy server, cloud location, router). Examples of the second network node are an application server, a cloud location or a router. The available resources may b...

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

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

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

  9. Defining nodes in complex brain networks

    Directory of Open Access Journals (Sweden)

    Matthew Lawrence Stanley

    2013-11-01

    Full Text Available Network science holds great promise for expanding our understanding of the human brain in health, disease, development, and aging. Network analyses are quickly becoming the method of choice for analyzing functional MRI data. However, many technical issues have yet to be confronted in order to optimize results. One particular issue that remains controversial in functional brain network analyses is the definition of a network node. In functional brain networks a node represents some predefined collection of brain tissue, and an edge measures the functional connectivity between pairs of nodes. The characteristics of a node, chosen by the researcher, vary considerably in the literature. This manuscript reviews the current state of the art based on published manuscripts and highlights the strengths and weaknesses of three main methods for defining nodes. Voxel-wise networks are constructed by assigning a node to each, equally sized brain area (voxel. The fMRI time-series recorded from each voxel is then used to create the functional network. Anatomical methods utilize atlases to define the nodes based on brain structure. The fMRI time-series from all voxels within the anatomical area are averaged and subsequently used to generate the network. Functional activation methods rely on data from traditional fMRI activation studies, often from databases, to identify network nodes. Such methods identify the peaks or centers of mass from activation maps to determine the location of the nodes. Small (~10-20 millimeter diameter spheres located at the coordinates of the activation foci are then applied to the data being used in the network analysis. The fMRI time-series from all voxels in the sphere are then averaged, and the resultant time series is used to generate the network. We attempt to clarify the discussion and move the study of complex brain networks forward. While the correct method to be used remains an open, possibly unsolvable question that

  10. Resilience against Misbehaving Nodes in Asynchronous Networks

    OpenAIRE

    Senejohnny, D.; Sundaram, S.; De Persis, C.; Tesi, P.

    2018-01-01

    Network systems are one of the most active research areas in the engineering community as they feature a paradigm shift from centralized to distributed control and computation. When dealing with network systems, a fundamental challenge is to ensure their functioning even when some of the network nodes do not operate as intended due to faults or attacks. The objective of this paper is to address the problem of resilient consensus in a context where the nodes have their own clocks, possibly ope...

  11. A random network based, node attraction facilitated network evolution method

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2016-03-01

    Full Text Available In present study, I present a method of network evolution that based on random network, and facilitated by node attraction. In this method, I assume that the initial network is a random network, or a given initial network. When a node is ready to connect, it tends to link to the node already owning the most connections, which coincides with the general rule (Barabasi and Albert, 1999 of node connecting. In addition, a node may randomly disconnect a connection i.e., the addition of connections in the network is accompanied by the pruning of some connections. The dynamics of network evolution is determined of the attraction factor Lamda of nodes, the probability of node connection, the probability of node disconnection, and the expected initial connectance. The attraction factor of nodes, the probability of node connection, and the probability of node disconnection are time and node varying. Various dynamics can be achieved by adjusting these parameters. Effects of simplified parameters on network evolution are analyzed. The changes of attraction factor Lamda can reflect various effects of the node degree on connection mechanism. Even the changes of Lamda only will generate various networks from the random to the complex. Therefore, the present algorithm can be treated as a general model for network evolution. Modeling results show that to generate a power-law type of network, the likelihood of a node attracting connections is dependent upon the power function of the node's degree with a higher-order power. Matlab codes for simplified version of the method are provided.

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

  13. Anchor-free localization method for mobile targets in coal mine wireless sensor networks.

    Science.gov (United States)

    Pei, Zhongmin; Deng, Zhidong; Xu, Shuo; Xu, Xiao

    2009-01-01

    Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS) and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes' location. Finally, an improved sequence-based localization algorithm is presented to complete precise localization for mobile targets. The proposed method is tested through simulations with 100 nodes, outdoor experiments with 15 ZigBee physical nodes, and the experiments in the mine gas explosion laboratory with 12 ZigBee nodes. Experimental results show that our method has better localization accuracy and is more robust in underground mines.

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

  15. Research on mobile strategy of anchor node based on weighted virtual force model%基于加权虚拟力模型的锚节点移动策略的研究

    Institute of Scientific and Technical Information of China (English)

    魏连锁; 蔡绍滨; 潘实

    2017-01-01

    The existing mobility strategy of the anchor node in wireless sensor network (WSN) has the shortcomings of too long moving path and low positioning accuracy when the anchor node traverses the network voids area. A new mobility strategy of WSN anchor node was proposed based on an improved virtual forces model. The number of neighbor nodes and the distance between the neighbor nodes to the anchor nodes were introduced as their own dense weight attributes. The unknown nodes in-tensity was used as weights to improve the traditional virtual force model. Meantime the distance-measuring errorε was taken into account. The optimal distribution, direction selection, shift step length and fallback strategy of anchor node could be ana-lyzed by the trilateration. Using the number of virtual beacon received by the unknown node and the distance between the un-known node to the anchor node calculate the virtual force. Then according to the virtual force, the direction was chosen and the anchor nodes were moved. Simulation experiments show that the strategy can make the anchor nodes move according to the specific circumstances of unknown node distribution. It has a high positioning accuracy and strong adaptability. It can success-fully shorten the path of the anchor node movement and reduce the number of virtual beacon. Moreover it can effectively avoid the anchor node to enter the network voids area and reduce the number of collinear virtual anchor nodes.%针对现有无线传感器网络(WSN)锚节点移动策略不能有效避免遍历网络空洞区域时引起的移动路径过长、定位精度低等缺点,提出一种基于改进虚拟力模型的无线传感器网络锚节点移动策略.将未知节点的邻居节点数量及其到邻居节点的距离作为自身的密集权重属性,利用未知节点的密集度作为权值来改进传统的虚拟力模型.同时考虑测距误差ε的大小,利用三边测量法分析锚节点的最优分布情况、方向选择、

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

  17. Anchor-Free Localization Method for Mobile Targets in Coal Mine Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xiao Xu

    2009-04-01

    Full Text Available Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes’ location. Finally, an improved sequence-based localization algorithm is presented to complete precise localization for mobile targets. The proposed method is tested through simulations with 100 nodes, outdoor experiments with 15 ZigBee physical nodes, and the experiments in the mine gas explosion laboratory with 12 ZigBee nodes. Experimental results show that our method has better localization accuracy and is more robust in underground mines.

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

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

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

  1. Network structure exploration in networks with node attributes

    Science.gov (United States)

    Chen, Yi; Wang, Xiaolong; Bu, Junzhao; Tang, Buzhou; Xiang, Xin

    2016-05-01

    Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

  2. Node clustering for wireless sensor networks

    International Nuclear Information System (INIS)

    Bhatti, S.; Qureshi, I.A.; Memon, S.

    2012-01-01

    Recent years have witnessed considerable growth in the development and deployment of clustering methods which are not only used to maintain network resources but also increases the reliability of the WSNs (Wireless Sensor Network) and the facts manifest by the wide range of clustering solutions. Node clustering by selecting key parameters to tackle the dynamic behaviour of resource constraint WSN is a challenging issue. This paper highlights the recent progress which has been carried out pertaining to the development of clustering solutions for the WSNs. The paper presents classification of node clustering methods and their comparison based on the objectives, clustering criteria and methodology. In addition, the potential open issues which need to be considered for future work are high lighted. Keywords: Clustering, Sensor Network, Static, Dynamic

  3. Temporal node centrality in complex networks

    Science.gov (United States)

    Kim, Hyoungshick; Anderson, Ross

    2012-02-01

    Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.

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

  5. Node-pair reliability of network systems with small distances between adjacent nodes

    International Nuclear Information System (INIS)

    Malinowski, Jacek

    2007-01-01

    A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the 'sliding window' technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes' numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity-O(n), where n denotes the number of nodes

  6. Node design in optical packet switched networks

    DEFF Research Database (Denmark)

    Nord, Martin

    2006-01-01

    The thesis discusses motivation, realisation and performance of the Optical Packet Switching (OPS) network paradigm. The work includes proposals for designs and methods to efficiently use both the wavelength- and time domain for contention resolution in asynchronous operation. The project has also......S parameter. Finally, the thesis includes a proposal for a node design and associated MAC protocol for an OPS ring topology metropolitan area network with high throughput and fairness, also for unbalanced traffic....... proposed parallel designs to overcome scalability constraints and to support migration scenarios. Furthermore, it has proposed and demonstrated optical input processing schemes for hybrids networks to simultaneously support OPS and Optical Circuit Switching. Quality of Service (QoS) differentiation enables...

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

  8. Research on centrality of urban transport network nodes

    Science.gov (United States)

    Wang, Kui; Fu, Xiufen

    2017-05-01

    Based on the actual data of urban transport in Guangzhou, 19,150 bus stations in Guangzhou (as of 2014) are selected as nodes. Based on the theory of complex network, the network model of Guangzhou urban transport is constructed. By analyzing the degree centrality index, betweenness centrality index and closeness centrality index of nodes in the network, the level of centrality of each node in the network is studied. From a different point of view to determine the hub node of Guangzhou urban transport network, corresponding to the city's key sites and major transfer sites. The reliability of the network is determined by the stability of some key nodes (transport hub station). The research of network node centralization can provide a theoretical basis for the rational allocation of urban transport network sites and public transport system planning.

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

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

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

  12. Effects of node buffer and capacity on network traffic

    International Nuclear Information System (INIS)

    Ling Xiang; Ding Jian-Xun; Hu Mao-Bin

    2012-01-01

    In this paper, we study the optimization of network traffic by considering the effects of node buffer ability and capacity. Two node buffer settings are considered. The node capacity is considered to be proportional to its buffer ability. The node effects on network traffic systems are studied with the shortest path protocol and an extension of the optimal routing [Phys. Rev. E 74 046106 (2006)]. In the diagrams of flux—density relationships, it is shown that a nodes buffer ability and capacity have profound effects on the network traffic

  13. Suppressing epidemics on networks by exploiting observer nodes.

    Science.gov (United States)

    Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

    2014-07-01

    To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

  14. Suppressing epidemics on networks by exploiting observer nodes

    Science.gov (United States)

    Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

    2014-07-01

    To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

  15. Financial fluctuations anchored to economic fundamentals: A mesoscopic network approach.

    Science.gov (United States)

    Sharma, Kiran; Gopalakrishnan, Balagopal; Chakrabarti, Anindya S; Chakraborti, Anirban

    2017-08-14

    We demonstrate the existence of an empirical linkage between nominal financial networks and the underlying economic fundamentals, across countries. We construct the nominal return correlation networks from daily data to encapsulate sector-level dynamics and infer the relative importance of the sectors in the nominal network through measures of centrality and clustering algorithms. Eigenvector centrality robustly identifies the backbone of the minimum spanning tree defined on the return networks as well as the primary cluster in the multidimensional scaling map. We show that the sectors that are relatively large in size, defined with three metrics, viz., market capitalization, revenue and number of employees, constitute the core of the return networks, whereas the periphery is mostly populated by relatively smaller sectors. Therefore, sector-level nominal return dynamics are anchored to the real size effect, which ultimately shapes the optimal portfolios for risk management. Our results are reasonably robust across 27 countries of varying degrees of prosperity and across periods of market turbulence (2008-09) as well as periods of relative calmness (2012-13 and 2015-16).

  16. Eviction of Misbehaving and Faulty Nodes in Vehicular Networks

    OpenAIRE

    Raya, Maxim; Papadimitratos, Panagiotis; Aad, Imad; Jungels, Daniel; Hubaux, Jean-Pierre

    2007-01-01

    Vehicular Networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to be detected and prevented from disrupting network operation, a problem particularly hard to address in the life-critical VN environment. Existing networks rely mainly on node certificate revocation for attacker eviction, but the lack of an ...

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

  18. Implementation of Multiple Host Nodes in Wireless Sensing Node Network System for Landslide Monitoring

    International Nuclear Information System (INIS)

    Bin Abas, Faizulsalihin; Takayama, Shigeru

    2015-01-01

    This paper proposes multiple host nodes in Wireless Sensing Node Network System (WSNNS) for landslide monitoring. As landslide disasters damage monitoring system easily, one major demand in landslide monitoring is the flexibility and robustness of the system to evaluate the current situation in the monitored area. For various reasons WSNNS can provide an important contribution to reach that aim. In this system, acceleration sensors and GPS are deployed in sensing nodes. Location information by GPS, enable the system to estimate network topology and enable the system to perceive the location in emergency by monitoring the node mode. Acceleration sensors deployment, capacitate this system to detect slow mass movement that can lead to landslide occurrence. Once deployed, sensing nodes self-organize into an autonomous wireless ad hoc network. The measurement parameter data from sensing nodes is transmitted to Host System via host node and ''Cloud'' System. The implementation of multiple host nodes in Local Sensing Node Network System (LSNNS), improve risk- management of the WSNNS for real-time monitoring of landslide disaster

  19. Implementation of Multiple Host Nodes in Wireless Sensing Node Network System for Landslide Monitoring

    Science.gov (United States)

    Abas, Faizulsalihin bin; Takayama, Shigeru

    2015-02-01

    This paper proposes multiple host nodes in Wireless Sensing Node Network System (WSNNS) for landslide monitoring. As landslide disasters damage monitoring system easily, one major demand in landslide monitoring is the flexibility and robustness of the system to evaluate the current situation in the monitored area. For various reasons WSNNS can provide an important contribution to reach that aim. In this system, acceleration sensors and GPS are deployed in sensing nodes. Location information by GPS, enable the system to estimate network topology and enable the system to perceive the location in emergency by monitoring the node mode. Acceleration sensors deployment, capacitate this system to detect slow mass movement that can lead to landslide occurrence. Once deployed, sensing nodes self-organize into an autonomous wireless ad hoc network. The measurement parameter data from sensing nodes is transmitted to Host System via host node and "Cloud" System. The implementation of multiple host nodes in Local Sensing Node Network System (LSNNS), improve risk- management of the WSNNS for real-time monitoring of landslide disaster.

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

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

    DEFF Research Database (Denmark)

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

    2016-01-01

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

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

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

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

  5. On Identifying which Intermediate Nodes Should Code in Multicast Networks

    DEFF Research Database (Denmark)

    Pinto, Tiago; Roetter, Daniel Enrique Lucani; Médard, Muriel

    2013-01-01

    the data packets. Previous work has shown that in lossless wireline networks, the performance of tree-packing mechanisms is comparable to network coding, albeit with added complexity at the time of computing the trees. This means that most nodes in the network need not code. Thus, mechanisms that identify...... intermediate nodes that do require coding is instrumental for the efficient operation of coded networks and can have a significant impact in overall energy consumption. We present a distributed, low complexity algorithm that allows every node to identify if it should code and, if so, through what output link...

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

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

  8. Adaptive filtering for hidden node detection and tracking in networks.

    Science.gov (United States)

    Hamilton, Franz; Setzer, Beverly; Chavez, Sergio; Tran, Hien; Lloyd, Alun L

    2017-07-01

    The identification of network connectivity from noisy time series is of great interest in the study of network dynamics. This connectivity estimation problem becomes more complicated when we consider the possibility of hidden nodes within the network. These hidden nodes act as unknown drivers on our network and their presence can lead to the identification of false connections, resulting in incorrect network inference. Detecting the parts of the network they are acting on is thus critical. Here, we propose a novel method for hidden node detection based on an adaptive filtering framework with specific application to neuronal networks. We consider the hidden node as a problem of missing variables when model fitting and show that the estimated system noise covariance provided by the adaptive filter can be used to localize the influence of the hidden nodes and distinguish the effects of different hidden nodes. Additionally, we show that the sequential nature of our algorithm allows for tracking changes in the hidden node influence over time.

  9. Compressive sensing of high betweenness centrality nodes in networks

    Science.gov (United States)

    Mahyar, Hamidreza; Hasheminezhad, Rouzbeh; Ghalebi K., Elahe; Nazemian, Ali; Grosu, Radu; Movaghar, Ali; Rabiee, Hamid R.

    2018-05-01

    Betweenness centrality is a prominent centrality measure expressing importance of a node within a network, in terms of the fraction of shortest paths passing through that node. Nodes with high betweenness centrality have significant impacts on the spread of influence and idea in social networks, the user activity in mobile phone networks, the contagion process in biological networks, and the bottlenecks in communication networks. Thus, identifying k-highest betweenness centrality nodes in networks will be of great interest in many applications. In this paper, we introduce CS-HiBet, a new method to efficiently detect top- k betweenness centrality nodes in networks, using compressive sensing. CS-HiBet can perform as a distributed algorithm by using only the local information at each node. Hence, it is applicable to large real-world and unknown networks in which the global approaches are usually unrealizable. The performance of the proposed method is evaluated by extensive simulations on several synthetic and real-world networks. The experimental results demonstrate that CS-HiBet outperforms the best existing methods with notable improvements.

  10. The generation of random directed networks with prescribed 1-node and 2-node degree correlations

    Energy Technology Data Exchange (ETDEWEB)

    Zamora-Lopez, Gorka; Kurths, Juergen [Institute of Physics, University of Potsdam, PO Box 601553, 14415 Potsdam (Germany); Zhou Changsong [Department of Physics, Hong Kong Baptist University, Kowloon Tong, Hong Kong (China); Zlatic, Vinko [Rudjer Boskovic Institute, PO Box 180, HR-10002 Zagreb (Croatia)

    2008-06-06

    The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations.

  11. The generation of random directed networks with prescribed 1-node and 2-node degree correlations

    International Nuclear Information System (INIS)

    Zamora-Lopez, Gorka; Kurths, Juergen; Zhou Changsong; Zlatic, Vinko

    2008-01-01

    The generation of random networks is a very common problem in complex network research. In this paper, we have studied the correlation nature of several real networks and found that, typically, a large number of links are deterministic, i.e. they cannot be randomized. This finding permits fast generation of ensembles of maximally random networks with prescribed 1-node and 2-node degree correlations. When the introduction of self-loops or multiple-links are not desired, random network generation methods typically reach blocked states. Here, a mechanism is proposed, the 'force-and-drop' method, to overcome such states. Our algorithm can be easily simplified for undirected graphs and reduced to account for any subclass of 2-node degree correlations

  12. Information spreading in Delay Tolerant Networks based on nodes' behaviors

    Science.gov (United States)

    Wu, Yahui; Deng, Su; Huang, Hongbin

    2014-07-01

    Information spreading in DTNs (Delay Tolerant Networks) adopts a store-carry-forward method, and nodes receive the message from others directly. However, it is hard to judge whether the information is safe in this communication mode. In this case, a node may observe other nodes' behaviors. At present, there is no theoretical model to describe the varying rule of the nodes' trusting level. In addition, due to the uncertainty of the connectivity in DTN, a node is hard to get the global state of the network. Therefore, a rational model about the node's trusting level should be a function of the node's own observing result. For example, if a node finds k nodes carrying a message, it may trust the information with probability p(k). This paper does not explore the real distribution of p(k), but instead presents a unifying theoretical framework to evaluate the performance of the information spreading in above case. This framework is an extension of the traditional SI (susceptible-infected) model, and is useful when p(k) conforms to any distribution. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Finally, we explore the impact of the nodes' behaviors based on certain special distributions through numerical results.

  13. Deployment of check-in nodes in complex networks

    Science.gov (United States)

    Jiang, Zhong-Yuan; Ma, Jian-Feng

    2017-01-01

    In many real complex networks such as the city road networks and highway networks, vehicles often have to pass through some specially functioned nodes to receive check-in like services such as gas supplement at gas stations. Based on existing network structures, to guarantee every shortest path including at least a check-in node, the location selection of all check-in nodes is very essential and important to make vehicles to easily visit these check-in nodes, and it is still remains an open problem in complex network studies. In this work, we aim to find possible solutions for this problem. We first convert it into a set cover problem which is NP-complete and propose to employ the greedy algorithm to achieve an approximate result. Inspired by heuristic information of network structure, we discuss other four check-in node location deployment methods including high betweenness first (HBF), high degree first (HDF), random and low degree first (LDF). Finally, we compose extensive simulations in classical scale-free networks, random networks and real network models, and the results can well confirm the effectiveness of the greedy algorithm. This work has potential applications into many real networks.

  14. On Node Replication Attack in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mumtaz Qabulio

    2016-04-01

    Full Text Available WSNs (Wireless Sensor Networks comprise a large number of small, inexpensive, low power and memory constrained sensing devices (called sensor nodes that are densely deployed to measure a given physical phenomenon. Since WSNs are commonly deployed in a hostile and unattended environment, it is easy for an adversary to physically capture one or more legitimate sensor nodes, re-program and redeploy them in the network. As a result, the adversary becomes able to deploy several identical copies of physically captured nodes in the network in order to perform illegitimate activities. This type of attack is referred to as Node Replication Attack or Clone Node Attack. By launching node replication attack, an adversary can easily get control on the network which consequently is the biggest threat to confidentiality, integrity and availability of data and services. Thus, detection and prevention of node replication attack in WSNs has become an active area of research and to date more than two dozen schemes have been proposed, which address this issue. In this paper, we present a comprehensive review, classification and comparative analysis of twenty five of these schemes which help to detect and/or prevent node replication attack in WSNs

  15. On node replication attack in wireless sensor networks

    International Nuclear Information System (INIS)

    Qabulio, M.; Malkani, Y.A.

    2015-01-01

    WSNs (Wireless Sensor Networks) comprise a large number of small, inexpensive, low power and memory constrained sensing devices (called sensor nodes) that are densely deployed to measure a given physical phenomenon. Since WSNs are commonly deployed in a hostile and unattended environment, it is easy for an adversary to physically capture one or more legitimate sensor nodes, re-program and redeploy them in the network. As a result, the adversary becomes able to deploy several identical copies of physically captured nodes in the network in order to perform illegitimate activities. This type of attack is referred to as Node Replication Attack or Clone Node Attack. By launching node replication attack, an adversary can easily get control on the network which consequently is the biggest threat to confidentiality, integrity and availability of data and services. Thus, detection and prevention of node replication attack in WSNs has become an active area of research and to date more than two dozen schemes have been proposed, which address this issue. In this paper, we present a comprehensive review, classification and comparative analysis of twenty five of these schemes which help to detect and/or prevent node replication attack in WSNs. (author)

  16. Information loss method to measure node similarity in networks

    Science.gov (United States)

    Li, Yongli; Luo, Peng; Wu, Chong

    2014-09-01

    Similarity measurement for the network node has been paid increasing attention in the field of statistical physics. In this paper, we propose an entropy-based information loss method to measure the node similarity. The whole model is established based on this idea that less information loss is caused by seeing two more similar nodes as the same. The proposed new method has relatively low algorithm complexity, making it less time-consuming and more efficient to deal with the large scale real-world network. In order to clarify its availability and accuracy, this new approach was compared with some other selected approaches on two artificial examples and synthetic networks. Furthermore, the proposed method is also successfully applied to predict the network evolution and predict the unknown nodes' attributions in the two application examples.

  17. A local-world node deleting evolving network model

    International Nuclear Information System (INIS)

    Gu Yuying; Sun Jitao

    2008-01-01

    A new type network growth rule which comprises node addition with the concept of local-world connectivity and node deleting is studied. A series of theoretical analysis and numerical simulation to the LWD network are conducted in this Letter. Firstly, the degree distribution p(k) of this network changes no longer pure scale free but truncates by an exponential tail and the truncation in p(k) increases as p a decreases. Secondly, the connectivity is tighter, as the local-world size M increases. Thirdly, the average path length L increases and the clustering coefficient decreases as generally node deleting increases. Finally, trends up when the local-world size M increases, so as to k max . Hence, the expanding local-world can compensate the infection of the node deleting

  18. A local-world node deleting evolving network model

    Energy Technology Data Exchange (ETDEWEB)

    Gu Yuying [Department of Mathematics, Tongji University, Shanghai 200092 (China); Sun Jitao [Department of Mathematics, Tongji University, Shanghai 200092 (China)], E-mail: sunjt@sh163.net

    2008-06-16

    A new type network growth rule which comprises node addition with the concept of local-world connectivity and node deleting is studied. A series of theoretical analysis and numerical simulation to the LWD network are conducted in this Letter. Firstly, the degree distribution p(k) of this network changes no longer pure scale free but truncates by an exponential tail and the truncation in p(k) increases as p{sub a} decreases. Secondly, the connectivity is tighter, as the local-world size M increases. Thirdly, the average path length L increases and the clustering coefficient decreases as generally node deleting increases. Finally, trends up when the local-world size M increases, so as to k{sub max}. Hence, the expanding local-world can compensate the infection of the node deleting.

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

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

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

    Science.gov (United States)

    Parlos, Alexander G. (Inventor); Atiya, Amir F. (Inventor); Fernandez, Benito (Inventor); Tsai, Wei K. (Inventor); Chong, Kil T. (Inventor)

    1995-01-01

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

  2. 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...tolerant networks, peer-to-peer networks, amongst others. Because of their unique properties, many algorithms that are normally time- consuming perform...a quadratic binary equation, each higher order term must be replaced with several new variables. While this is possible, it is a time- consuming and

  3. Temporal-varying failures of nodes in networks

    Science.gov (United States)

    Knight, Georgie; Cristadoro, Giampaolo; Altmann, Eduardo G.

    2015-08-01

    We consider networks in which random walkers are removed because of the failure of specific nodes. We interpret the rate of loss as a measure of the importance of nodes, a notion we denote as failure centrality. We show that the degree of the node is not sufficient to determine this measure and that, in a first approximation, the shortest loops through the node have to be taken into account. We propose approximations of the failure centrality which are valid for temporal-varying failures, and we dwell on the possibility of externally changing the relative importance of nodes in a given network by exploiting the interference between the loops of a node and the cycles of the temporal pattern of failures. In the limit of long failure cycles we show analytically that the escape in a node is larger than the one estimated from a stochastic failure with the same failure probability. We test our general formalism in two real-world networks (air-transportation and e-mail users) and show how communities lead to deviations from predictions for failures in hubs.

  4. Node counting in wireless ad-hoc networks

    NARCIS (Netherlands)

    Evers, J.H.M.; Kiss, D.; Kowalczyk, W.; Navilarekallu, T.; Renger, D.R.M.; Sella, L.; Timperio, V.; Viorel, A.; Wijk, van A.C.C.; Yzelman, A.J.; Planqué, B.; Bhulai, S.; Hulshof, J.; Kager, W.; Rot, T.

    2012-01-01

    We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct

  5. Analysis of Network Vulnerability Under Joint Node and Link Attacks

    Science.gov (United States)

    Li, Yongcheng; Liu, Shumei; Yu, Yao; Cao, Ting

    2018-03-01

    The security problem of computer network system is becoming more and more serious. The fundamental reason is that there are security vulnerabilities in the network system. Therefore, it’s very important to identify and reduce or eliminate these vulnerabilities before they are attacked. In this paper, we are interested in joint node and link attacks and propose a vulnerability evaluation method based on the overall connectivity of the network to defense this attack. Especially, we analyze the attack cost problem from the attackers’ perspective. The purpose is to find the set of least costs for joint links and nodes, and their deletion will lead to serious network connection damage. The simulation results show that the vulnerable elements obtained from the proposed method are more suitable for the attacking idea of the malicious persons in joint node and link attack. It is easy to find that the proposed method has more realistic protection significance.

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

    Science.gov (United States)

    Yang, Hui; Tang, Ming; Gross, Thilo

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

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

  8. Recalcitrant deep and shallow nodes in Aristolochia (Aristolochiaceae) illuminated using anchored hybrid enrichment.

    Science.gov (United States)

    Wanke, Stefan; Granados Mendoza, Carolina; Müller, Sebastian; Paizanni Guillén, Anna; Neinhuis, Christoph; Lemmon, Alan R; Lemmon, Emily Moriarty; Samain, Marie-Stéphanie

    2017-12-01

    Recalcitrant relationships are characterized by very short internodes that can be found among shallow and deep phylogenetic scales all over the tree of life. Adding large amounts of presumably informative sequences, while decreasing systematic error, has been suggested as a possible approach to increase phylogenetic resolution. The development of enrichment strategies, coupled with next generation sequencing, resulted in a cost-effective way to facilitate the reconstruction of recalcitrant relationships. By applying the anchored hybrid enrichment (AHE) genome partitioning strategy to Aristolochia using an universal angiosperm probe set, we obtained 231-233 out of 517 single or low copy nuclear loci originally contained in the enrichment kit, resulting in a total alignment length of 154,756bp to 160,150bp. Since Aristolochia (Piperales; magnoliids) is distantly related to any angiosperm species whose genome has been used for the plant AHE probe design (Amborella trichopoda being the closest), it serves as a proof of universality for this probe set. Aristolochia comprises approximately 500 species grouped in several clades (OTUs), whose relationships to each other are partially unknown. Previous phylogenetic studies have shown that these lineages branched deep in time and in quick succession, seen as short-deep internodes. Short-shallow internodes are also characteristic of some Aristolochia lineages such as Aristolochia subsection Pentandrae, a clade of presumably recent diversification. This subsection is here included to test the performance of AHE at species level. Filtering and subsampling loci using the phylogenetic informativeness method resolves several recalcitrant phylogenetic relationships within Aristolochia. By assuming different ploidy levels during bioinformatics processing of raw data, first hints are obtained that polyploidization contributed to the evolution of Aristolochia. Phylogenetic results are discussed in the light of current systematics and

  9. Assessing node risk and vulnerability in epidemics on networks

    Science.gov (United States)

    Rogers, T.

    2015-01-01

    Which nodes are most vulnerable to an epidemic spreading through a network, and which carry the highest risk of causing a major outbreak if they are the source of the infection? Here we show how these questions can be answered to good approximation using the cavity method. Several curious properties of node vulnerability and risk are explored: some nodes are more vulnerable than others to weaker infections, yet less vulnerable to stronger ones; a node is always more likely to be caught in an outbreak than it is to start one, except when the disease has a deterministic lifetime; the rank order of node risk depends on the details of the distribution of infectious periods.

  10. Node-node correlations and transport properties in scale-free networks

    Science.gov (United States)

    Obregon, Bibiana; Guzman, Lev

    2011-03-01

    We study some transport properties of complex networks. We focus our attention on transport properties of scale-free and small-world networks and compare two types of transport: Electric and max-flow cases. In particular, we construct scale-free networks, with a given degree sequence, to estimate the distribution of conductances for different values of assortative/dissortative mixing. For the electric case we find that the distributions of conductances are affect ed by the assortative mixing of the network whereas for the max-flow case, the distributions almost do not show changes when node-node correlations are altered. Finally, we compare local and global transport in terms of the average conductance for the small-world (Watts-Strogatz) model

  11. Node-based measures of connectivity in genetic networks.

    Science.gov (United States)

    Koen, Erin L; Bowman, Jeff; Wilson, Paul J

    2016-01-01

    At-site environmental conditions can have strong influences on genetic connectivity, and in particular on the immigration and settlement phases of dispersal. However, at-site processes are rarely explored in landscape genetic analyses. Networks can facilitate the study of at-site processes, where network nodes are used to model site-level effects. We used simulated genetic networks to compare and contrast the performance of 7 node-based (as opposed to edge-based) genetic connectivity metrics. We simulated increasing node connectivity by varying migration in two ways: we increased the number of migrants moving between a focal node and a set number of recipient nodes, and we increased the number of recipient nodes receiving a set number of migrants. We found that two metrics in particular, the average edge weight and the average inverse edge weight, varied linearly with simulated connectivity. Conversely, node degree was not a good measure of connectivity. We demonstrated the use of average inverse edge weight to describe the influence of at-site habitat characteristics on genetic connectivity of 653 American martens (Martes americana) in Ontario, Canada. We found that highly connected nodes had high habitat quality for marten (deep snow and high proportions of coniferous and mature forest) and were farther from the range edge. We recommend the use of node-based genetic connectivity metrics, in particular, average edge weight or average inverse edge weight, to model the influences of at-site habitat conditions on the immigration and settlement phases of dispersal. © 2015 John Wiley & Sons Ltd.

  12. Identifying Controlling Nodes in Neuronal Networks in Different Scales

    Science.gov (United States)

    Tang, Yang; Gao, Huijun; Zou, Wei; Kurths, Jürgen

    2012-01-01

    Recent studies have detected hubs in neuronal networks using degree, betweenness centrality, motif and synchronization and revealed the importance of hubs in their structural and functional roles. In addition, the analysis of complex networks in different scales are widely used in physics community. This can provide detailed insights into the intrinsic properties of networks. In this study, we focus on the identification of controlling regions in cortical networks of cats’ brain in microscopic, mesoscopic and macroscopic scales, based on single-objective evolutionary computation methods. The problem is investigated by considering two measures of controllability separately. The impact of the number of driver nodes on controllability is revealed and the properties of controlling nodes are shown in a statistical way. Our results show that the statistical properties of the controlling nodes display a concave or convex shape with an increase of the allowed number of controlling nodes, revealing a transition in choosing driver nodes from the areas with a large degree to the areas with a low degree. Interestingly, the community Auditory in cats’ brain, which has sparse connections with other communities, plays an important role in controlling the neuronal networks. PMID:22848475

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

  14. Ranking important nodes in complex networks by simulated annealing

    International Nuclear Information System (INIS)

    Sun Yu; Yao Pei-Yang; Shen Jian; Zhong Yun; Wan Lu-Jun

    2017-01-01

    In this paper, based on simulated annealing a new method to rank important nodes in complex networks is presented. First, the concept of an importance sequence (IS) to describe the relative importance of nodes in complex networks is defined. Then, a measure used to evaluate the reasonability of an IS is designed. By comparing an IS and the measure of its reasonability to a state of complex networks and the energy of the state, respectively, the method finds the ground state of complex networks by simulated annealing. In other words, the method can construct a most reasonable IS. The results of experiments on real and artificial networks show that this ranking method not only is effective but also can be applied to different kinds of complex networks. (paper)

  15. Resource aware sensor nodes in wireless sensor networks

    International Nuclear Information System (INIS)

    Merrett, G V; Al-Hashimi, B M; White, N M; Harris, N R

    2005-01-01

    Wireless sensor networks are continuing to receive considerable research interest due, in part, to the range of possible applications. One of the greatest challenges facing researchers is in overcoming the limited network lifetime inherent in the small locally powered sensor nodes. In this paper, we propose IDEALS, a system to manage a wireless sensor network using a combination of information management, energy harvesting and energy monitoring, which we label resource awareness. Through this, IDEALS is able to extend the network lifetime for important messages, by controlling the degradation of the network to maximise information throughput

  16. On imperfect node protection in complex communication networks

    International Nuclear Information System (INIS)

    Xiao Shi; Xiao Gaoxi

    2011-01-01

    Motivated by recent research on complex networks, we study enhancing complex communication networks against intentional attack which takes down network nodes in a decreasing order of their degrees. Specifically, we evaluate an effect which has been largely ignored in existing studies; many real-life systems, especially communication systems, have protection mechanisms for their important components. Due to the existence of such protection, it is generally quite difficult to totally crash a protected node, though partially paralyzing it may still be feasible. Our analytical and simulation results show that such 'imperfect' protections generally speaking still help significantly enhance network robustness. Such insight may be helpful for the future developments of efficient network attack and protection schemes.

  17. Controllability of Weighted and Directed Networks with Nonidentical Node Dynamics

    Directory of Open Access Journals (Sweden)

    Linying Xiang

    2013-01-01

    Full Text Available The concept of controllability from control theory is applied to weighted and directed networks with heterogenous linear or linearized node dynamics subject to exogenous inputs, where the nodes are grouped into leaders and followers. Under this framework, the controllability of the controlled network can be decomposed into two independent problems: the controllability of the isolated leader subsystem and the controllability of the extended follower subsystem. Some necessary and/or sufficient conditions for the controllability of the leader-follower network are derived based on matrix theory and graph theory. In particular, it is shown that a single-leader network is controllable if it is a directed path or cycle, but it is uncontrollable for a complete digraph or a star digraph in general. Furthermore, some approaches to improving the controllability of a heterogenous network are presented. Some simulation examples are given for illustration and verification.

  18. On imperfect node protection in complex communication networks

    Energy Technology Data Exchange (ETDEWEB)

    Xiao Shi [Hubei Province Key Laboratory of Intelligent Robot and School of Computer Science and Engineering, Wuhan Institute of Technology, Wuhan 430073 (China); Xiao Gaoxi, E-mail: xiao_moon2002@yahoo.com.cn, E-mail: egxxiao@ntu.edu.sg [Division of Communication Engineering, School of Electrical and Electronic Engineering, Nanyang Technological University, 639798 (Singapore)

    2011-02-04

    Motivated by recent research on complex networks, we study enhancing complex communication networks against intentional attack which takes down network nodes in a decreasing order of their degrees. Specifically, we evaluate an effect which has been largely ignored in existing studies; many real-life systems, especially communication systems, have protection mechanisms for their important components. Due to the existence of such protection, it is generally quite difficult to totally crash a protected node, though partially paralyzing it may still be feasible. Our analytical and simulation results show that such 'imperfect' protections generally speaking still help significantly enhance network robustness. Such insight may be helpful for the future developments of efficient network attack and protection schemes.

  19. Programmable multi-node quantum network design and simulation

    Science.gov (United States)

    Dasari, Venkat R.; Sadlier, Ronald J.; Prout, Ryan; Williams, Brian P.; Humble, Travis S.

    2016-05-01

    Software-defined networking offers a device-agnostic programmable framework to encode new network functions. Externally centralized control plane intelligence allows programmers to write network applications and to build functional network designs. OpenFlow is a key protocol widely adopted to build programmable networks because of its programmability, flexibility and ability to interconnect heterogeneous network devices. We simulate the functional topology of a multi-node quantum network that uses programmable network principles to manage quantum metadata for protocols such as teleportation, superdense coding, and quantum key distribution. We first show how the OpenFlow protocol can manage the quantum metadata needed to control the quantum channel. We then use numerical simulation to demonstrate robust programmability of a quantum switch via the OpenFlow network controller while executing an application of superdense coding. We describe the software framework implemented to carry out these simulations and we discuss near-term efforts to realize these applications.

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

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

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

    Science.gov (United States)

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

    2015-01-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. PMID:26492958

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

  4. Link Prediction in Evolving Networks Based on Popularity of Nodes.

    Science.gov (United States)

    Wang, Tong; He, Xing-Sheng; Zhou, Ming-Yang; Fu, Zhong-Qian

    2017-08-02

    Link prediction aims to uncover the underlying relationship behind networks, which could be utilized to predict missing edges or identify the spurious edges. The key issue of link prediction is to estimate the likelihood of potential links in networks. Most classical static-structure based methods ignore the temporal aspects of networks, limited by the time-varying features, such approaches perform poorly in evolving networks. In this paper, we propose a hypothesis that the ability of each node to attract links depends not only on its structural importance, but also on its current popularity (activeness), since active nodes have much more probability to attract future links. Then a novel approach named popularity based structural perturbation method (PBSPM) and its fast algorithm are proposed to characterize the likelihood of an edge from both existing connectivity structure and current popularity of its two endpoints. Experiments on six evolving networks show that the proposed methods outperform state-of-the-art methods in accuracy and robustness. Besides, visual results and statistical analysis reveal that the proposed methods are inclined to predict future edges between active nodes, rather than edges between inactive nodes.

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

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

  7. Impulsive Cluster Synchronization in Community Network with Nonidentical Nodes

    International Nuclear Information System (INIS)

    Deng Liping; Wu Zhaoyan

    2012-01-01

    In this paper, cluster synchronization in community network with nonidentical nodes and impulsive effects is investigated. Community networks with two kinds of topological structure are investigated. Positive weighted network is considered first and external pinning controllers are designed for achieving cluster synchronization. Cooperative and competitive network under some assumptions is investigated as well and can achieve cluster synchronization with only impulsive controllers. Based on the stability analysis of impulsive differential equation and the Lyapunov stability theory, several simple and useful synchronization criteria are derived. Finally, numerical simulations are provided to verify the effectiveness of the derived results.

  8. Wireless Sensing Node Network Management for Monitoring Landslide Disaster

    International Nuclear Information System (INIS)

    Takayama, S; Akiyama, J; Fujiki, T; Mokhtar, N A B

    2013-01-01

    This paper shows the network management and operation to monitor landslide disaster at slop of mountain and hill. Natural disasters damage a measuring system easily. It is necessary for the measuring system to be flexible and robust. The measuring network proposed in this paper is the telemetry system consisted of host system (HS) and local sensing nodes network system (LSNNS). LSNNS operates autonomously and sometimes is controlled by commands from HS. HS collects data/information of landslide disaster from LSNNS, and controls LSNNS remotely. HS and LSNNS are communicated by using 'cloud' system. The dual communication is very effective and convenient to manage a network system operation

  9. In-node cognitive power control in Wireless Sensor Networks

    NARCIS (Netherlands)

    Chincoli, Michele; Liotta, Antonio

    2017-01-01

    Reliability, interoperability and efficiency are fundamental in Wireless Sensor Network deployment. Herein we look at how transmission power control may be used to reduce interference, which is particularly problematic in high-density conditions. We adopt a distributed approach where every node has

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

  11. Synchronization of complex delayed dynamical networks with nonlinearly coupled nodes

    International Nuclear Information System (INIS)

    Liu Tao; Zhao Jun; Hill, David J.

    2009-01-01

    In this paper, we study the global synchronization of nonlinearly coupled complex delayed dynamical networks with both directed and undirected graphs. Via Lyapunov-Krasovskii stability theory and the network topology, we investigate the global synchronization of such networks. Under the assumption that coupling coefficients are known, a family of delay-independent decentralized nonlinear feedback controllers are designed to globally synchronize the networks. When coupling coefficients are unavailable, an adaptive mechanism is introduced to synthesize a family of delay-independent decentralized adaptive controllers which guarantee the global synchronization of the uncertain networks. Two numerical examples of directed and undirected delayed dynamical network are given, respectively, using the Lorenz system as the nodes of the networks, which demonstrate the effectiveness of proposed results.

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

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

  14. A Balancing Algorithm in Wireless Sensor Network Based on the Assistance of Approaching Nodes

    Directory of Open Access Journals (Sweden)

    Chengpei Tang

    2013-03-01

    Full Text Available Sensor node in wireless sensor network is a micro-embedded system with limited memory, energy and communication capabilities. Some nodes will run out of energy and exit the network earlier than other nodes because of the uneven energy consumption. This will lead to partial or complete paralysis of the whole wireless sensor network. A balancing algorithm based on the assistance of approaching nodes is proposed. Via the set theory, notes are divided into neighbor nodes set and approaching nodes set. Approaching nodes will help weaker nodes forward part of massages to balance energy consumption. Simulation result has verified the rationality and feasibility of the balancing algorithm.

  15. Toward the Structure of Dynamic Membrane-Anchored Actin Networks

    Science.gov (United States)

    Weber, Igor

    2007-01-01

    In the cortex of a motile cell, membrane-anchored actin filaments assemble into structures of varying shape and function. Filopodia are distinguished by a core of bundled actin filaments within finger-like extensions of the membrane. In a recent paper by Medalia et al1 cryo-electron tomography has been used to reconstruct, from filopodia of Dictyostelium cells, the 3-dimensional organization of actin filaments in connection with the plasma membrane. A special arrangement of short filaments converging toward the filopod's tip has been called a “terminal cone”. In this region force is applied for protrusion of the membrane. Here we discuss actin organization in the filopodia of Dictyostelium in the light of current views on forces that are generated by polymerizing actin filaments, and on the resistance of membranes against deformation that counteracts these forces. PMID:19262130

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

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

  2. Wireless motion sensor network for monitoring motion in a process, wireless sensor node, reasoning node, and feedback and/or actuation node for such wireless motion sensor network

    NARCIS (Netherlands)

    Havinga, Paul J.M.; Marin Perianu, Raluca; Marin Perianu, Mihai

    2010-01-01

    Wireless motion sensor network for monitoring motion in a process comprising at least one wireless sensor node for measuring at least one physical quantity related to motion or orientation, feature extraction means for deriving a feature for the measured quantities, a wireless transmitter connected

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

  4. Detecting Boundary Nodes and Coverage Holes in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Li-Hui Zhao

    2016-01-01

    Full Text Available The emergence of coverage holes in wireless sensor networks (WSNs means that some special events have broken out and the function of WSNs will be seriously influenced. Therefore, the issues of coverage holes have attracted considerable attention. In this paper, we focus on the identification of boundary nodes and coverage holes, which is crucially important to preventing the enlargement of coverage holes and ensuring the transmission of data. We define the problem of coverage holes and propose two novel algorithms to identify the coverage holes in WSNs. The first algorithm, Distributed Sector Cover Scanning (DSCS, can be used to identify the nodes on hole borders and the outer boundary of WSNs. The second scheme, Directional Walk (DW, can locate the coverage holes based on the boundary nodes identified with DSCS. We implement the algorithms in various scenarios and fully evaluate their performance. The simulation results show that the boundary nodes can be accurately detected by DSCS and the holes enclosed by the detected boundary nodes can be identified by DW. The comparisons confirm that the proposed algorithms outperform the existing ones.

  5. Node vulnerability of water distribution networks under cascading failures

    International Nuclear Information System (INIS)

    Shuang, Qing; Zhang, Mingyuan; Yuan, Yongbo

    2014-01-01

    Water distribution networks (WDNs) are important in modern lifeline system. Its stability and reliability are critical for guaranteeing high living quality and continuous operation of urban functions. The aim of this paper is to evaluate the nodal vulnerability of WDNs under cascading failures. Vulnerability is defined to analyze the effects of the consequent failures. A cascading failure is a step-by-step process which is quantitatively investigated by numerical simulation with intentional attack. Monitored pressures in different nodes and flows in different pipes have been used to estimate the network topological structure and the consequences of nodal failure. Based on the connectivity loss of topological structure, the nodal vulnerability has been evaluated. A load variation function is established to record the nodal failure reason and describe the relative differences between the load and the capacity. The proposed method is validated by an illustrative example. The results revealed that the network vulnerability should be evaluated with the consideration of hydraulic analysis and network topology. In the case study, 70.59% of the node failures trigger the cascading failures with different failure processes. It is shown that the cascading failures result in severe consequences in WDNs. - Highlights: • The aim of this paper is to evaluate the nodal vulnerability of water distribution networks under cascading failures. • Monitored pressures and flows have been used to estimate the network topological structure and the consequences of nodal failure. • Based on the connectivity loss of topological structure, the nodal vulnerability has been evaluated. • A load variation function is established to record the failure reason and describe the relative differences between load and capacity. • The results show that 70.59% of the node failures trigger the cascading failures with different failure processes

  6. A Nodes Deployment Algorithm in Wireless Sensor Network Based on Distribution

    Directory of Open Access Journals (Sweden)

    Song Yuli

    2014-07-01

    Full Text Available Wireless sensor network coverage is a basic problem of wireless sensor network. In this paper, we propose a wireless sensor network node deployment algorithm base on distribution in order to form an efficient wireless sensor network. The iteratively greedy algorithm is used in this paper to choose priority nodes into active until the entire network is covered by wireless sensor nodes, the whole network to multiply connected. The simulation results show that the distributed wireless sensor network node deployment algorithm can form a multiply connected wireless sensor network.

  7. Node fingerprinting: an efficient heuristic for aligning biological networks.

    Science.gov (United States)

    Radu, Alex; Charleston, Michael

    2014-10-01

    With the continuing increase in availability of biological data and improvements to biological models, biological network analysis has become a promising area of research. An emerging technique for the analysis of biological networks is through network alignment. Network alignment has been used to calculate genetic distance, similarities between regulatory structures, and the effect of external forces on gene expression, and to depict conditional activity of expression modules in cancer. Network alignment is algorithmically complex, and therefore we must rely on heuristics, ideally as efficient and accurate as possible. The majority of current techniques for network alignment rely on precomputed information, such as with protein sequence alignment, or on tunable network alignment parameters, which may introduce an increased computational overhead. Our presented algorithm, which we call Node Fingerprinting (NF), is appropriate for performing global pairwise network alignment without precomputation or tuning, can be fully parallelized, and is able to quickly compute an accurate alignment between two biological networks. It has performed as well as or better than existing algorithms on biological and simulated data, and with fewer computational resources. The algorithmic validation performed demonstrates the low computational resource requirements of NF.

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

  9. On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks

    Science.gov (United States)

    Li, Qiao-Qin; Gong, Haigang; Liu, Ming; Yang, Mei; Zheng, Jun

    2011-01-01

    This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures. PMID:22163809

  10. Anchor-Free Localization Method for Mobile Targets in Coal Mine Wireless Sensor Networks

    OpenAIRE

    Pei, Zhongmin; Deng, Zhidong; Xu, Shuo; Xu, Xiao

    2009-01-01

    Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS) and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes’ location. Fi...

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

  12. Network resilience against intelligent attacks constrained by the degree-dependent node removal cost

    International Nuclear Information System (INIS)

    Annibale, A; Coolen, A C C; Bianconi, G

    2010-01-01

    We study the resilience of complex networks against attacks in which nodes are targeted intelligently, but where disabling a node has a cost to the attacker which depends on its degree. Attackers have to meet these costs with limited resources, which constrains their actions. A network's integrity is quantified in terms of the efficacy of the process that it supports. We calculate how the optimal attack strategy and the most attack-resistant network degree statistics depend on the node removal cost function and the attack resources. The resilience of networks against intelligent attacks is found to depend strongly on the node removal cost function faced by the attacker. In particular, if node removal costs increase sufficiently fast with the node degree, power law networks are found to be more resilient than Poissonian ones, even against optimized intelligent attacks. For cost functions increasing quadratically in the node degrees, intelligent attackers cannot damage the network more than random damages would.

  13. Approach to sensor node calibration for efficient localisation in wireless sensor networks in realistic scenarios

    CSIR Research Space (South Africa)

    Mwila, MK

    2014-06-01

    Full Text Available Localisation or position determination is one of the most important applications for the wireless sensor networks. Numerous current techniques for localisation of sensor nodes use the Received Signal Strength Indicator (RSSI) from sensor nodes...

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

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

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

  18. Exponential synchronization of complex networks with nonidentical time-delayed dynamical nodes

    International Nuclear Information System (INIS)

    Cai Shuiming; He Qinbin; Hao Junjun; Liu Zengrong

    2010-01-01

    In this Letter, exponential synchronization of a complex network with nonidentical time-delayed dynamical nodes is considered. Two effective control schemes are proposed to drive the network to synchronize globally exponentially onto any smooth goal dynamics. By applying open-loop control to all nodes and adding some intermittent controllers to partial nodes, some simple criteria for exponential synchronization of such network are established. Meanwhile, a pinning scheme deciding which nodes need to be pinned and a simply approximate formula for estimating the least number of pinned nodes are also provided. By introducing impulsive effects to the open-loop controlled network, another synchronization scheme is developed for the network with nonidentical time-delayed dynamical nodes, and an estimate of the upper bound of impulsive intervals ensuring global exponential stability of the synchronization process is also given. Numerical simulations are presented finally to demonstrate the effectiveness of the theoretical results.

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

  20. Node localization algorithm of wireless sensor networks 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 monito...

  1. Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

    Science.gov (United States)

    McIntire, John P.; Osesina, O. Isaac; Bartley, Cecilia; Tudoreanu, M. Eduard; Havig, Paul R.; Geiselman, Eric E.

    2012-06-01

    Ensuring the proper and effective ways to visualize network data is important for many areas of academia, applied sciences, the military, and the public. Fields such as social network analysis, genetics, biochemistry, intelligence, cybersecurity, neural network modeling, transit systems, communications, etc. often deal with large, complex network datasets that can be difficult to interact with, study, and use. There have been surprisingly few human factors performance studies on the relative effectiveness of different graph drawings or network diagram techniques to convey information to a viewer. This is particularly true for weighted networks which include the strength of connections between nodes, not just information about which nodes are linked to other nodes. We describe a human factors study in which participants performed four separate network analysis tasks (finding a direct link between given nodes, finding an interconnected node between given nodes, estimating link strengths, and estimating the most densely interconnected nodes) on two different network visualizations: an adjacency matrix with a heat-map versus a node-link diagram. The results should help shed light on effective methods of visualizing network data for some representative analysis tasks, with the ultimate goal of improving usability and performance for viewers of network data displays.

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

  3. DHT-Based Detection of Node Clone in Wireless Sensor Networks

    Science.gov (United States)

    Li, Zhijun; Gong, Guang

    Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left unattended. Several distributed protocols have been proposed for detecting clone. However, some protocols rely on an implicit assumption that every node is aware of all other nodes' existence; other protocols using an geographic hash table require that nodes know the general network deployment graph. Those assumptions hardly hold for many sensor networks. In this paper, we present a novel node clone detection protocol based on Distributed Hash Table (DHT). DHT provides good distributed properties and our protocol is practical for every kind of sensor networks. We analyze the protocol performance theoretically. Moreover, we implement our protocol in the OMNeT++ simulation framework. The extensive simulation results show that our protocol can detect clone efficiently and holds strong resistance against adversaries.

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

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

  6. Counterpart synchronization of duplex networks with delayed nodes and noise perturbation

    International Nuclear Information System (INIS)

    Wei, Xiang; Wu, Xiaoqun; Lu, Jun-an; Zhao, Junchan

    2015-01-01

    In the real world, many complex systems are represented not by single networks but rather by sets of interdependent ones. In these specific networks, nodes in one network mutually interact with nodes in other networks. This paper focuses on a simple representative case of two-layer networks (the so-called duplex networks) with unidirectional inter-layer couplings. That is, each node in one network depends on a counterpart in the other network. Accordingly, the former network is called the response layer and the latter network is the drive layer. Specifically, synchronization between each node in the drive layer and its counterpart in the response layer (counterpart synchronization (CS)) in these kinds of duplex networks with delayed nodes and noise perturbation is investigated. Based on the LaSalle-type invariance principle, a control technique is proposed and a sufficient condition is developed for realizing CS of duplex networks. Furthermore, two corollaries are derived as special cases. In addition, node dynamics within each layer can be varied and topologies of the two layers are not necessarily identical. Therefore, the proposed synchronization method can be applied to a wide range of multiplex networks. Numerical examples are provided to illustrate the feasibility and effectiveness of the results. (paper)

  7. Active node determination for correlated data gathering in wireless sensor networks

    OpenAIRE

    Karasabun, Efe

    2009-01-01

    Ankara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2009. Thesis (Master's) -- Bilkent University, 2009. Includes bibliographical references leaves 53-55. In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. However, the sensor nodes that are selected as active should form a co...

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

    Mobile nodes have been found useful for improving performance of network parameters such as coverage, data latency and load balancing in wireless sensor networks (WSNs). In spite of the benets which mobile nodes could oer when used in WSNs, they have been often stated as infeasible for use...

  9. Automated Construction of Node Software Using Attributes in a Ubiquitous Sensor Network Environment

    Science.gov (United States)

    Lee, Woojin; Kim, Juil; Kang, JangMook

    2010-01-01

    In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric—the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment. PMID:22163678

  10. Automated Construction of Node Software Using Attributes in a Ubiquitous Sensor Network Environment

    Directory of Open Access Journals (Sweden)

    JangMook Kang

    2010-09-01

    Full Text Available In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric—the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment.

  11. SPRINT-SELF: Social-Based Routing and Selfish Node Detection in Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Radu Ioan Ciobanu

    2015-01-01

    Full Text Available Since mobile devices nowadays have become ubiquitous, several types of networks formed over such devices have been proposed. One such approach is represented by opportunistic networking, which is based on a store-carry-and-forward paradigm, where nodes store data and carry it until they reach a suitable node for forwarding. The problem in such networks is how to decide what the next hop will be, since nodes do not have a global view of the network. We propose using the social network information of a node when performing routing, since a node is more likely to encounter members of its own social community than other nodes. In addition, we approximate a node’s contact as a Poisson distribution and show that we can predict its future behavior based on the contact history. Furthermore, since opportunistic network nodes may be selfish, we improve our solution by adding a selfish node detection and avoidance mechanism, which can help reduce the number of unnecessary messages sent in the network, and thus avoid congestion and decrease battery consumption. We show that our algorithm outperforms existing solutions such as BUBBLE Rap and Epidemic in terms of delivery cost and hit rate, as well as the rate of congestion introduced in the network, by testing in various realistic scenarios.

  12. Automated construction of node software using attributes in a ubiquitous sensor network environment.

    Science.gov (United States)

    Lee, Woojin; Kim, Juil; Kang, JangMook

    2010-01-01

    In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric-the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment.

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

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

  15. Reliability-Aware Cooperative Node Sleeping and Clustering in Duty-Cycled Sensors Networks

    Directory of Open Access Journals (Sweden)

    Jeungeun Song

    2018-01-01

    Full Text Available Duty-cycled sensor networks provide a new perspective for improvement of energy efficiency and reliability assurance of multi-hop cooperative sensor networks. In this paper, we consider the energy-efficient cooperative node sleeping and clustering problems in cooperative sensor networks where clusters of relay nodes jointly transmit sensory data to the next hop. Our key idea for guaranteeing reliability is to exploit the on-demand number of cooperative nodes, facilitating the prediction of personalized end-to-end (ETE reliability. Namely, a novel reliability-aware cooperative routing (RCR scheme is proposed to select k-cooperative nodes at every hop (RCR-selection. After selecting k cooperative nodes at every hop, all of the non-cooperative nodes will go into sleep status. In order to solve the cooperative node clustering problem, we propose the RCR-based optimal relay assignment and cooperative data delivery (RCR-delivery scheme to provide a low-communication-overhead data transmission and an optimal duty cycle for a given number of cooperative nodes when the network is dynamic, which enables part of cooperative nodes to switch into idle status for further energy saving. Through the extensive OPNET-based simulations, we show that the proposed scheme significantly outperforms the existing geographic routing schemes and beaconless geographic routings in wireless sensor networks with a highly dynamic wireless channel and controls energy consumption, while ETE reliability is effectively guaranteed.

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

    Science.gov (United States)

    Napolitano, Jr., Leonard M.

    1995-01-01

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

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

  18. Maximizing survivability of acyclic transmission networks with multi-state retransmitters and vulnerable nodes

    International Nuclear Information System (INIS)

    Levitin, Gregory

    2002-01-01

    In this paper, an algorithm for optimal allocation of multi-state elements (MEs) in acyclic transmission networks (ATNs) with vulnerable nodes is suggested. The ATNs consist of a number of positions (nodes) in which MEs capable of receiving and sending a signal are allocated. Each network has a root position where the signal source is located, a number of leaf positions that can only receive a signal, and a number of intermediate positions containing MEs capable of transmitting the received signal to some other nodes. Each ME that is located in a nonleaf node can have different states determined by a set of nodes receiving the signal directly from this ME. The probability of each state is assumed to be known for each ME. Each ATN node with all the MEs allocated at this node can be destroyed by external impact (common cause failure) with a given probability. The ATN survivability is defined as the probability that a signal from the root node is transmitted to each leaf node. The optimal distribution of MEs with different characteristics among ATN positions provides the greatest possible ATN survivability. It is shown that the node vulnerability index affects the optimal distribution. The suggested algorithm is based on using a universal generating function technique for network survivability evaluation. A genetic algorithm is used as the optimization tool. Illustrative examples are presented

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

    International Nuclear Information System (INIS)

    Derr, Kurt; Manic, Milos

    2015-01-01

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

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

  1. Control range: a controllability-based index for node significance in directed networks

    International Nuclear Information System (INIS)

    Wang, Bingbo; Gao, Lin; Gao, Yong

    2012-01-01

    While a large number of methods for module detection have been developed for undirected networks, it is difficult to adapt them to handle directed networks due to the lack of consensus criteria for measuring the node significance in a directed network. In this paper, we propose a novel structural index, the control range, motivated by recent studies on the structural controllability of large-scale directed networks. The control range of a node quantifies the size of the subnetwork that the node can effectively control. A related index, called the control range similarity, is also introduced to measure the structural similarity between two nodes. When applying the index of control range to several real-world and synthetic directed networks, it is observed that the control range of the nodes is mainly influenced by the network's degree distribution and that nodes with a low degree may have a high control range. We use the index of control range similarity to detect and analyze functional modules in glossary networks and the enzyme-centric network of homo sapiens. Our results, as compared with other approaches to module detection such as modularity optimization algorithm, dynamic algorithm and clique percolation method, indicate that the proposed indices are effective and practical in depicting structural and modular characteristics of sparse directed networks

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

    International Nuclear Information System (INIS)

    Masuda, Naoki; Kawamura, Yoji; Kori, Hiroshi

    2009-01-01

    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.

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

  4. Projective synchronization of a complex network with different fractional order chaos nodes

    International Nuclear Information System (INIS)

    Wang Ming-Jun; Wang Xing-Yuan; Niu Yu-Jun

    2011-01-01

    Based on the stability theory of the linear fractional order system, projective synchronization of a complex network is studied in the paper, and the coupling functions of the connected nodes are identified. With this method, the projective synchronization of the network with different fractional order chaos nodes can be achieved, besides, the number of the nodes does not affect the stability of the whole network. In the numerical simulations, the chaotic fractional order Lü system, Liu system and Coullet system are chosen as examples to show the effectiveness of the scheme. (general)

  5. Experimental realization of synchronization in complex networks with Chua's circuits like nodes

    International Nuclear Information System (INIS)

    Posadas-Castillo, C.; Cruz-Hernandez, C.; Lopez-Gutierrez, R.M.

    2009-01-01

    In this paper, an experimental study on practical realization of synchronization in globally coupled networks with Chua's circuits like nodes is presented. Synchronization of coupled multiple Chua's circuits is achieved by appealing to results from complex systems theory. In particular, we design and implement electronically complex dynamical networks composed by three coupled Chua's circuits, considering two scenarios: (i) without master node, and (ii) with (periodic and chaotic) master node. The interactions in the networks are defined by coupling the first state of each Chua's circuit.

  6. Experimental realization of synchronization in complex networks with Chua's circuits like nodes

    Energy Technology Data Exchange (ETDEWEB)

    Posadas-Castillo, C. [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103, Carretera Tijuana-Ensenada, 22860 Ensenada, BC (Mexico); Engineering Mechanic and Electric Faculty of Nuevo Leon Autonomous University (UANL), Pedro de Alba, S.N., Cd. Universitaria, San Nicolas de los Garza, NL (Mexico); Cruz-Hernandez, C. [Electronics and Telecommunications Department, Scientific Research and Advanced Studies of Ensenada (CICESE), Km. 107, Carretera Tijuana-Ensenada, 22860 Ensenada, BC (Mexico)], E-mail: ccruz@cicese.mx; Lopez-Gutierrez, R.M. [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103, Carretera Tijuana-Ensenada, 22860 Ensenada, BC (Mexico)

    2009-05-30

    In this paper, an experimental study on practical realization of synchronization in globally coupled networks with Chua's circuits like nodes is presented. Synchronization of coupled multiple Chua's circuits is achieved by appealing to results from complex systems theory. In particular, we design and implement electronically complex dynamical networks composed by three coupled Chua's circuits, considering two scenarios: (i) without master node, and (ii) with (periodic and chaotic) master node. The interactions in the networks are defined by coupling the first state of each Chua's circuit.

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

  8. 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. PMID:26426701

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

    Directory of Open Access Journals (Sweden)

    Thirumoorthy Palanisamy

    Full Text Available 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.

  10. Finding influential nodes for integration in brain networks using optimal percolation theory.

    Science.gov (United States)

    Del Ferraro, Gino; Moreno, Andrea; Min, Byungjoon; Morone, Flaviano; Pérez-Ramírez, Úrsula; Pérez-Cervera, Laura; Parra, Lucas C; Holodny, Andrei; Canals, Santiago; Makse, Hernán A

    2018-06-11

    Global integration of information in the brain results from complex interactions of segregated brain networks. Identifying the most influential neuronal populations that efficiently bind these networks is a fundamental problem of systems neuroscience. Here, we apply optimal percolation theory and pharmacogenetic interventions in vivo to predict and subsequently target nodes that are essential for global integration of a memory network in rodents. The theory predicts that integration in the memory network is mediated by a set of low-degree nodes located in the nucleus accumbens. This result is confirmed with pharmacogenetic inactivation of the nucleus accumbens, which eliminates the formation of the memory network, while inactivations of other brain areas leave the network intact. Thus, optimal percolation theory predicts essential nodes in brain networks. This could be used to identify targets of interventions to modulate brain function.

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

  12. Critical node lifetimes in random networks via the Chen-Stein method

    NARCIS (Netherlands)

    Franceschetti, M.; Meester, R.W.J.

    2006-01-01

    This correspondence considers networks where nodes are connected randomly and can fail at random times. It provides scaling laws that allow to find the critical time at which isolated nodes begin to appear in the system as its size tends to infinity. Applications are in the areas of sensor and

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

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

    Science.gov (United States)

    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. PMID:25152924

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

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

  17. An Efficient Approach for Node Localisation and Tracking in Wireless Sensor Networks

    CSIR Research Space (South Africa)

    Mwila, Martin

    2014-08-01

    Full Text Available -1 An Efficient Approach for Node Localisation and Tracking in Wireless Sensor Networks Martin K. Mwila Submitted in partial fulfilment of the requirements for the degree Magister Technologiae: Electrical Engineering in the Department of Electrical Engineering...

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

    Science.gov (United States)

    2017-06-01

    node anonymity, base station anonymity, Wireless Sensor Networks (WSN), Mobile Ad hoc Network (MANET), Lightweight Ad hoc On-Demand – Next Generation ... Generation (LOADng) reactive-routing protocol to achieve anonymity. This modified protocol prevents an attacker from identifying the sink node without...within the constraints of WSN communication protocols, specifically IEEE 802.15.4. We use and modify the Lightweight Ad hoc On-Demand – Next Generation

  19. Geographically Locating an Internet Node Using Network Latency Measurement

    National Research Council Canada - National Science Library

    Turnbaugh, Eugene

    2004-01-01

    .... The difficulties include accurate latency measure, network address translation (NAT) masking, service blocking, disparate physical configuration, dissimilar network hardware, and inaccurate and limited measuring tools...

  20. DRDT: distributed and reliable data transmission with cooperative nodes for lossy wireless sensor networks.

    Science.gov (United States)

    Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung

    2010-01-01

    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.

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

  2. Efficient and Adaptive Node Selection for Target Tracking in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Juan Feng

    2016-01-01

    Full Text Available In target tracking wireless sensor network, choosing the proper working nodes can not only minimize the number of active nodes, but also satisfy the tracking reliability requirement. However, most existing works focus on selecting sensor nodes which are the nearest to the target for tracking missions and they did not consider the correlation of the location of the sensor nodes so that these approaches can not meet all the goals of the network. This work proposes an efficient and adaptive node selection approach for tracking a target in a distributed wireless sensor network. The proposed approach combines the distance-based node selection strategy and particle filter prediction considering the spatial correlation of the different sensing nodes. Moreover, a joint distance weighted measurement is proposed to estimate the information utility of sensing nodes. Experimental results show that EANS outperformed the state-of-the-art approaches by reducing the energy cost and computational complexity as well as guaranteeing the tracking accuracy.

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

    Science.gov (United States)

    Li, Ai; Horvath, Steve

    2009-07-20

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

  4. Faulty node detection in wireless sensor networks using a recurrent neural network

    Science.gov (United States)

    Atiga, Jamila; Mbarki, Nour Elhouda; Ejbali, Ridha; Zaied, Mourad

    2018-04-01

    The wireless sensor networks (WSN) consist of a set of sensors that are more and more used in surveillance applications on a large scale in different areas: military, Environment, Health ... etc. Despite the minimization and the reduction of the manufacturing costs of the sensors, they can operate in places difficult to access without the possibility of reloading of battery, they generally have limited resources in terms of power of emission, of processing capacity, data storage and energy. These sensors can be used in a hostile environment, such as, for example, on a field of battle, in the presence of fires, floods, earthquakes. In these environments the sensors can fail, even in a normal operation. It is therefore necessary to develop algorithms tolerant and detection of defects of the nodes for the network of sensor without wires, therefore, the faults of the sensor can reduce the quality of the surveillance if they are not detected. The values that are measured by the sensors are used to estimate the state of the monitored area. We used the Non-linear Auto- Regressive with eXogeneous (NARX), the recursive architecture of the neural network, to predict the state of a node of a sensor from the previous values described by the functions of time series. The experimental results have verified that the prediction of the State is enhanced by our proposed model.

  5. Node-making process in network meta-analysis of nonpharmacological treatment are poorly reported.

    Science.gov (United States)

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

    2018-05-01

    To identify methods to support the node-making process in network meta-analyses (NMAs) of nonpharmacological 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 nonpharmacological 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 nonpharmacological 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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-07-15

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

  7. An efficient routing algorithm for event based monitoring in a plant using virtual sink nodes in a wireless sensor network

    International Nuclear Information System (INIS)

    Jain, Sanjay Kumar; Vietla, Srinivas; Roy, D.A.; Biswas, B.B.; Pithawa, C.K.

    2010-01-01

    A Wireless Sensor Network is a collection of wireless sensor nodes arranged in a self-forming network without aid of any infrastructure or administration. The individual nodes have limited resources and hence efficient communication mechanisms between the nodes have to be devised for continued operation of the network in a plant environment. In wireless sensor networks a sink node or base station at one end acts as the recipient of information gathered by all other sensor nodes in the network and the information arrives at the sink through multiple hops across the nodes of the network. A routing algorithm has been developed in which a virtual sink node is generated whenever hop count of an ordinary node crosses a certain specified value. The virtual sink node acts as a recipient node for data of all neighboring nodes. This virtual sink helps in reducing routing overhead, especially when the sensor network is scaled to a larger network. The advantages with this scheme are less energy consumption, reduced congestion in the network and longevity of the network. The above algorithm is suitable for event based or interval based monitoring systems in nuclear plants. This paper describes the working of the proposed algorithm and provides its implementation details. (author)

  8. A new centrality measure for identifying influential nodes in social networks

    Science.gov (United States)

    Rhouma, Delel; Ben Romdhane, Lotfi

    2018-04-01

    The identification of central nodes has been a key problem in the field of social network analysis. In fact, it is a measure that accounts the popularity or the visibility of an actor within a network. In order to capture this concept, various measures, either sample or more elaborate, has been developed. Nevertheless, many of "traditional" measures are not designed to be applicable to huge data. This paper sets out a new node centrality index suitable for large social network. It uses the amount of the neighbors of a node and connections between them to characterize a "pivot" node in the graph. We presented experimental results on real data sets which show the efficiency of our proposal.

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

  10. Backoff-stage synchronization in three-hop string-topology wireless networks with hidden nodes

    Science.gov (United States)

    Sanada, Kosuke; Sekiya, Hiroo; Komuro, Nobuyoshi; Sakata, Shiro

    In IEEE 802.11 wireless multi-hop networks, each node works individually and their individual operations generate entire network dynamics. It is important to clarify the network dynamics in wireless multi-hop networks for designing and constructing multi-hop communication networks. This paper presents the network-dynamics investigations for three-hop string-topology wireless network in detail. From the investigations, a “backoff-stage synchronization” phenomenon, which is mutuality between hidden nodes, is found. The mechanism of the backoff-stage synchronization is expressed and the sufficient conditions for the synchronization occurrence are given. This phenomenon gives some impacts on the IEEE 802.11 multi-hop-network communications.

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

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

    Science.gov (United States)

    Napolitano, L.M. Jr.

    1995-11-28

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

  13. Free-anchored Nb2O5@graphene networks for ultrafast-stable lithium storage

    Science.gov (United States)

    Deng, Qinglin; Li, Mengjiao; Wang, Junyong; Jiang, Kai; Hu, Zhigao; Chu, Junhao

    2018-05-01

    Orthorhombic Nb2O5 (T-Nb2O5) has structural merit but poor electrical conductivity, limiting their applications in energy storage. Although graphene is frequently adopted to effectively improve its electrochemical properties, the ordinary modified methods cannot meet the growing demands for high-performance. Here, we demonstrate that different graphene modified routes play a vital role in affecting the electrochemical performances of T-Nb2O5. By only manual shaking within one minute, Nb2O5 nano-particles can be rapidly adsorbed onto graphene, then the free-anchored T-Nb2O5@graphene three-dimensional networks can be successfully prepared based on hydrogel method. As for the application in lithium-ion batteries, it performs outstanding rate character (129 mA h g-1 (25C rate), 110 mA h g-1 (50C rate) and 90 mA h g-1 (100C rate), correspond to 79%, 67% and 55% capacity of 0.5C rate, respectively) and excellent long-term cycling feature (˜70% capacity retention after 20000 cycles). Moreover, it still maintains similar ultrafast-stable lithium storage performances when Cu foil is substituted by Al foil as current collector. In addition, relevant kinetics mechanisms are also expounded. This work provides a versatile strategy for the preparation of graphene modified Nb2O5 or other types of nanoparticles.

  14. Data delivery method based on neighbor nodes' information in a mobile ad hoc network.

    Science.gov (United States)

    Kashihara, Shigeru; Hayashi, Takuma; Taenaka, Yuzo; Okuda, Takeshi; Yamaguchi, Suguru

    2014-01-01

    This paper proposes a data delivery method based on neighbor nodes' information to achieve reliable communication in a mobile ad hoc network (MANET). In a MANET, it is difficult to deliver data reliably due to instabilities in network topology and wireless network condition which result from node movement. To overcome such unstable communication, opportunistic routing and network coding schemes have lately attracted considerable attention. Although an existing method that employs such schemes, MAC-independent opportunistic routing and encoding (MORE), Chachulski et al. (2007), improves the efficiency of data delivery in an unstable wireless mesh network, it does not address node movement. To efficiently deliver data in a MANET, the method proposed in this paper thus first employs the same opportunistic routing and network coding used in MORE and also uses the location information and transmission probabilities of neighbor nodes to adapt to changeable network topology and wireless network condition. The simulation experiments showed that the proposed method can achieve efficient data delivery with low network load when the movement speed is relatively slow.

  15. 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-10-09

    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.

  16. Attractive target wave patterns in complex networks consisting of excitable nodes

    International Nuclear Information System (INIS)

    Zhang Li-Sheng; Mi Yuan-Yuan; Liao Xu-Hong; Qian Yu; Hu Gang

    2014-01-01

    This review describes the investigations of oscillatory complex networks consisting of excitable nodes, focusing on the target wave patterns or say the target wave attractors. A method of dominant phase advanced driving (DPAD) is introduced to reveal the dynamic structures in the networks supporting oscillations, such as the oscillation sources and the main excitation propagation paths from the sources to the whole networks. The target center nodes and their drivers are regarded as the key nodes which can completely determine the corresponding target wave patterns. Therefore, the center (say node A) and its driver (say node B) of a target wave can be used as a label, (A,B), of the given target pattern. The label can give a clue to conveniently retrieve, suppress, and control the target waves. Statistical investigations, both theoretically from the label analysis and numerically from direct simulations of network dynamics, show that there exist huge numbers of target wave attractors in excitable complex networks if the system size is large, and all these attractors can be labeled and easily controlled based on the information given by the labels. The possible applications of the physical ideas and the mathematical methods about multiplicity and labelability of attractors to memory problems of neural networks are briefly discussed. (topical review - statistical physics and complex systems)

  17. Adaptive control of structural balance for complex dynamical networks based on dynamic coupling of nodes

    Science.gov (United States)

    Gao, Zilin; Wang, Yinhe; Zhang, Lili

    2018-02-01

    In the existing research results of the complex dynamical networks controlled, the controllers are mainly used to guarantee the synchronization or stabilization of the nodes’ state, and the terms coupled with connection relationships may affect the behaviors of nodes, this obviously ignores the dynamic common behavior of the connection relationships between the nodes. In fact, from the point of view of large-scale system, a complex dynamical network can be regarded to be composed of two time-varying dynamic subsystems, which can be called the nodes subsystem and the connection relationships subsystem, respectively. Similar to the synchronization or stabilization of the nodes subsystem, some characteristic phenomena can be also emerged in the connection relationships subsystem. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. This paper focuses on the structural balance in dynamic complex networks. Generally speaking, the state of the connection relationships subsystem is difficult to be measured accurately in practical applications, and thus it is not easy to implant the controller directly into the connection relationships subsystem. It is noted that the nodes subsystem and the relationships subsystem are mutually coupled, which implies that the state of the connection relationships subsystem can be affected by the controllable state of nodes subsystem. Inspired by this observation, by using the structural balance theory of triad, the controller with the parameter adaptive law is proposed for the nodes subsystem in this paper, which may ensure the connection relationship matrix to approximate a given structural balance matrix in the sense of the uniformly ultimately bounded (UUB). That is, the structural balance may be obtained by employing the controlling state of the nodes subsystem. Finally, the simulations are used to show the validity of the method in this paper.

  18. Efficient Hybrid Detection of Node Replication Attacks in Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ze Wang

    2017-01-01

    Full Text Available The node replication attack is one of the notorious attacks that can be easily launched by adversaries in wireless sensor networks. A lot of literatures have studied mitigating the node replication attack in static wireless sensor networks. However, it is more difficult to detect the replicas in mobile sensor networks because of their node mobility. Considering the limitations of centralized detection schemes for static wireless sensor networks, a few distributed solutions have been recently proposed. Some existing schemes identified replicated attacks by sensing mobile nodes with identical ID but different locations. To facilitate the discovery of contradictory conflicts, we propose a hybrid local and global detection method. The local detection is performed in a local area smaller than the whole deployed area to improve the meeting probability of contradictory nodes, while the distant replicated nodes in larger area can also be efficiently detected by the global detection. The complementary two levels of detection achieve quick discovery by searching of the replicas with reasonable overhead.

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

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

  1. Selection of hidden layer nodes in neural networks by statistical tests

    International Nuclear Information System (INIS)

    Ciftcioglu, Ozer

    1992-05-01

    A statistical methodology for selection of the number of hidden layer nodes in feedforward neural networks is described. The method considers the network as an empirical model for the experimental data set subject to pattern classification so that the selection process becomes a model estimation through parameter identification. The solution is performed for an overdetermined estimation problem for identification using nonlinear least squares minimization technique. The number of the hidden layer nodes is determined as result of hypothesis testing. Accordingly the redundant network structure with respect to the number of parameters is avoided and the classification error being kept to a minimum. (author). 11 refs.; 4 figs.; 1 tab

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

    International Nuclear Information System (INIS)

    Zhang, Jianbao; Ma, Zhongjun; Zhang, Gang

    2013-01-01

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

  3. Research on TCP/IP network communication based on Node.js

    Science.gov (United States)

    Huang, Jing; Cai, Lixiong

    2018-04-01

    In the face of big data, long connection and high synchronization, TCP/IP network communication will cause performance bottlenecks due to its blocking multi-threading service model. This paper presents a method of TCP/IP network communication protocol based on Node.js. On the basis of analyzing the characteristics of Node.js architecture and asynchronous non-blocking I/O model, the principle of its efficiency is discussed, and then compare and analyze the network communication model of TCP/IP protocol to expound the reasons why TCP/IP protocol stack is widely used in network communication. Finally, according to the large data and high concurrency in the large-scale grape growing environment monitoring process, a TCP server design based on Node.js is completed. The results show that the example runs stably and efficiently.

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

    Science.gov (United States)

    Zhang, Jianbao; Ma, Zhongjun; Zhang, Gang

    2013-12-01

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

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

  6. Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Wang Tao

    2014-04-01

    Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.

  7. Efficient Deployment of Key Nodes for Optimal Coverage of Industrial Mobile Wireless Networks

    Science.gov (United States)

    Li, Xiaomin; Li, Di; Dong, Zhijie; Hu, Yage; Liu, Chengliang

    2018-01-01

    In recent years, industrial wireless networks (IWNs) have been transformed by the introduction of mobile nodes, and they now offer increased extensibility, mobility, and flexibility. Nevertheless, mobile nodes pose efficiency and reliability challenges. Efficient node deployment and management of channel interference directly affect network system performance, particularly for key node placement in clustered wireless networks. This study analyzes this system model, considering both industrial properties of wireless networks and their mobility. Then, static and mobile node coverage problems are unified and simplified to target coverage problems. We propose a novel strategy for the deployment of clustered heads in grouped industrial mobile wireless networks (IMWNs) based on the improved maximal clique model and the iterative computation of new candidate cluster head positions. The maximal cliques are obtained via a double-layer Tabu search. Each cluster head updates its new position via an improved virtual force while moving with full coverage to find the minimal inter-cluster interference. Finally, we develop a simulation environment. The simulation results, based on a performance comparison, show the efficacy of the proposed strategies and their superiority over current approaches. PMID:29439439

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

  9. Efficient Deployment of Key Nodes for Optimal Coverage of Industrial Mobile Wireless Networks.

    Science.gov (United States)

    Li, Xiaomin; Li, Di; Dong, Zhijie; Hu, Yage; Liu, Chengliang

    2018-02-10

    In recent years, industrial wireless networks (IWNs) have been transformed by the introduction of mobile nodes, and they now offer increased extensibility, mobility, and flexibility. Nevertheless, mobile nodes pose efficiency and reliability challenges. Efficient node deployment and management of channel interference directly affect network system performance, particularly for key node placement in clustered wireless networks. This study analyzes this system model, considering both industrial properties of wireless networks and their mobility. Then, static and mobile node coverage problems are unified and simplified to target coverage problems. We propose a novel strategy for the deployment of clustered heads in grouped industrial mobile wireless networks (IMWNs) based on the improved maximal clique model and the iterative computation of new candidate cluster head positions. The maximal cliques are obtained via a double-layer Tabu search. Each cluster head updates its new position via an improved virtual force while moving with full coverage to find the minimal inter-cluster interference. Finally, we develop a simulation environment. The simulation results, based on a performance comparison, show the efficacy of the proposed strategies and their superiority over current approaches.

  10. Scheme for teleporting an unknown atomic state to any node in a quantum communication network

    Institute of Scientific and Technical Information of China (English)

    宋克慧; 张为俊; 郭光灿

    2002-01-01

    We propose a scheme for teleporting an unknown atomic state. In order to realize the teleportation to any node ina quantum communication network, an n-atom Greenberger-Horne-Zeilinger (GHZ) state is needed, which is utilizedas the quantum channel. From this n-atom GHZ state, two-node entanglement of processing and receiving teleportedstates can be obtained through the quantum logic gate manipulation. Finally, for the unequally weighted GHZ state,probabilistic teleportation is shown.

  11. Proficient Node Scheduling Protocol for Homogeneous and Heterogeneous Wireless Sensor Networks

    OpenAIRE

    R. Saravanakumar; N. Mohankumar; J. Raja

    2013-01-01

    Recent communications in wireless sensor networks (WSNs) have much new energy-efficient protocols specifically designed, where energy awareness is an essential consideration. In WSNs, large numbers of tiny sensor nodes are used as an effective way of data gathering in various environments. Since the sensor nodes operate on battery of limited power, it is a great challenging aim to design an energy-efficient routing protocol, which can minimize the delay while offering high-energy efficiency a...

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

  13. Tunable locally-optimal geographical forwarding in wireless sensor networks with sleep-wake cycling nodes

    OpenAIRE

    Naveen, K. P.; Kumar, A.

    2009-01-01

    We consider a wireless sensor network whose main function is to detect certain infrequent alarm events, and to forward alarm packets to a base station, using geographical forwarding. The nodes know their locations, and they sleep-wake cycle, waking up periodically but not synchronously. In this situation, when a node has a packet to forward to the sink, there is a trade-off between how long this node waits for a suitable neighbor to wake up and the progress the packet makes towards the sink o...

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

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

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

  16. On Throughput Improvement of Wireless Ad Hoc Networks with Hidden Nodes

    Science.gov (United States)

    Choi, Hong-Seok; Lim, Jong-Tae

    In this letter, we present the throughput analysis of the wireless ad hoc networks based on the IEEE 802.11 MAC (Medium Access Control). Especially, our analysis includes the case with the hidden node problem so that it can be applied to the multi-hop networks. In addition, we suggest a new channel access control algorithm to maximize the network throughput and show the usefulness of the proposed algorithm through simulations.

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

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

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

  20. Optimal Node Placement in Underwater Wireless Sensor Networks

    KAUST Repository

    Felamban, M.; Shihada, Basem; Jamshaid, K.

    2013-01-01

    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

  1. Studying Pensions Funds Through an Infinite Servers Nodes Network: A Theoretical Problem

    International Nuclear Information System (INIS)

    Ferreira, M A M; Andrade, M; Filipe, J A

    2012-01-01

    This study intends to present a representation of a pensions fund through a stochastic network with two infinite servers nodes. With this representation it is allowed to deduce an equilibrium condition of the system with basis on the identity of the random rates expected values, for which the contributions arrive to the fund and the pensions are paid by the fund. In our study a stochastic network is constructed where traffic is represented. This network allows to study the equilibrium in the system and it is admissible to get a balance to a pensions fund. A specific case is studied. When the arrivals from outside at nodes A and B are according to a Poisson process, with rates λ A and λ B , respectively, the system may be seen as a two nodes network where the first node is a M/G/∞ queue and second a M t /G/∞ queue. For this case in the long term the conditions of equilibrium are as follows: m A λ A α A = m B (ρλ A + λ B )α B . In this formula it is established a relationship among the two nodes. Several examples are given in the study.

  2. Search for all MCs in networks with unreliable nodes and arcs

    International Nuclear Information System (INIS)

    Yeh, W.-C.

    2003-01-01

    A simple method is proposed to search for all minimal cutsets (MCs ) for imperfect networks reliability subject to both arc and node failures under the condition that all of the MCs in the network with perfect nodes are given in advance. The proposed method does not require re-enumeration for all of the MCs for additional node failure consideration. All of the MC candidates found in the proposed algorithm are actual MCs without any need for further verification. This algorithm is more effective than the existing algorithm in which every MC candidate is not verified as a MC. No identical MCs are found using the proposed algorithm, which does not duplicate MCs and is more efficient than the existing methods. Only simple concepts are used to implement the proposed algorithm, which makes it easier to understand and implement. With considering unreliable nodes, the proposed method is also more realistic and valuable for reliability analysis in an existing network. The correctness of the proposed algorithm will be analyzed and proven. One example is used to illustrate how all MCs are generated in a network with arc and node failures solved using the proposed algorithm

  3. Using LTI Dynamics to Identify the Influential Nodes in a Network.

    Directory of Open Access Journals (Sweden)

    Goran Murić

    Full Text Available Networks are used for modeling numerous technical, social or biological systems. In order to better understand the system dynamics, it is a matter of great interest to identify the most important nodes within the network. For a large set of problems, whether it is the optimal use of available resources, spreading information efficiently or even protection from malicious attacks, the most important node is the most influential spreader, the one that is capable of propagating information in the shortest time to a large portion of the network. Here we propose the Node Imposed Response (NiR, a measure which accurately evaluates node spreading power. It outperforms betweenness, degree, k-shell and h-index centrality in many cases and shows the similar accuracy to dynamics-sensitive centrality. We utilize the system-theoretic approach considering the network as a Linear Time-Invariant system. By observing the system response we can quantify the importance of each node. In addition, our study provides a robust tool set for various protective strategies.

  4. Slave nodes and the controllability of metabolic networks

    International Nuclear Information System (INIS)

    Kim, Dong-Hee; Motter, Adilson E

    2009-01-01

    Recent work on synthetic rescues has shown that the targeted deletion of specific metabolic genes can often be used to rescue otherwise non-viable mutants. This raises a fundamental biophysical question: to what extent can the whole-cell behavior of a large metabolic network be controlled by constraining the flux of one or more reactions in the network? This touches upon the issue of the number of degrees of freedom contained by one such network. Using the metabolic network of Escherichia coli as a model system, here we address this question theoretically by exploring not only reaction deletions, but also a continuum of all possible reaction expression levels. We show that the behavior of the metabolic network can be largely manipulated by the pinned expression of a single reaction. In particular, a relevant fraction of the metabolic reactions exhibits canalizing interactions, in that the specification of one reaction flux determines cellular growth as well as the fluxes of most other reactions in optimal steady states. The activity of individual reactions can thus be used as surrogates to monitor and possibly control cellular growth and other whole-cell behaviors. In addition to its implications for the study of control processes, our methodology provides a new approach to study how the integrated dynamics of the entire metabolic network emerges from the coordinated behavior of its component parts.

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

  6. Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes

    International Nuclear Information System (INIS)

    Liu, M; Bassler, K E

    2011-01-01

    Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.

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

  8. A Risk Based Approach to Node Insertion Within Social Networks

    Science.gov (United States)

    2015-03-26

    with a directed network where Aij is not always equivalent to Aji . When this occurs, the indegree and outdegree become nontrivial. In a scale free...piqmjq] ∀ q 6= i, j (13a) piq = Aiq + Aqi∑ j(Aij + Aji ) ∀ i 6= j (13b) mjq = Ajq + Aqj maxk(Ajk + Akj) ∀ j 6= k (13c) 29 piq is the ith, qth entry in...scenario and their associated utility. The average utility for the network is shown by the red line. The black line is representative of zero utility

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

  10. A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks

    Directory of Open Access Journals (Sweden)

    Tong Qiao

    2018-04-01

    Full Text Available Measuring centrality has recently attracted increasing attention, with algorithms ranging from those that simply calculate the number of immediate neighbors and the shortest paths to those that are complicated iterative refinement processes and objective dynamical approaches. Indeed, vital nodes identification allows us to understand the roles that different nodes play in the structure of a network. However, quantifying centrality in complex networks with various topological structures is not an easy task. In this paper, we introduce a novel definition of entropy-based centrality, which can be applicable to weighted directed networks. By design, the total power of a node is divided into two parts, including its local power and its indirect power. The local power can be obtained by integrating the structural entropy, which reveals the communication activity and popularity of each node, and the interaction frequency entropy, which indicates its accessibility. In addition, the process of influence propagation can be captured by the two-hop subnetworks, resulting in the indirect power. In order to evaluate the performance of the entropy-based centrality, we use four weighted real-world networks with various instance sizes, degree distributions, and densities. Correspondingly, these networks are adolescent health, Bible, United States (US airports, and Hep-th, respectively. Extensive analytical results demonstrate that the entropy-based centrality outperforms degree centrality, betweenness centrality, closeness centrality, and the Eigenvector centrality.

  11. Percolation-theoretic bounds on the cache size of nodes in mobile opportunistic networks.

    Science.gov (United States)

    Yuan, Peiyan; Wu, Honghai; Zhao, Xiaoyan; Dong, Zhengnan

    2017-07-18

    The node buffer size has a large influence on the performance of Mobile Opportunistic Networks (MONs). This is mainly because each node should temporarily cache packets to deal with the intermittently connected links. In this paper, we study fundamental bounds on node buffer size below which the network system can not achieve the expected performance such as the transmission delay and packet delivery ratio. Given the condition that each link has the same probability p to be active in the next time slot when the link is inactive and q to be inactive when the link is active, there exists a critical value p c from a percolation perspective. If p > p c , the network is in the supercritical case, where we found that there is an achievable upper bound on the buffer size of nodes, independent of the inactive probability q. When p network is in the subcritical case, and there exists a closed-form solution for buffer occupation, which is independent of the size of the network.

  12. A Novel Topology Control Approach to Maintain the Node Degree in Dynamic Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yuanjiang Huang

    2014-03-01

    Full Text Available Topology control is an important technique to improve the connectivity and the reliability of Wireless Sensor Networks (WSNs by means of adjusting the communication range of wireless sensor nodes. In this paper, a novel Fuzzy-logic Topology Control (FTC is proposed to achieve any desired average node degree by adaptively changing communication range, thus improving the network connectivity, which is the main target of FTC. FTC is a fully localized control algorithm, and does not rely on location information of neighbors. Instead of designing membership functions and if-then rules for fuzzy-logic controller, FTC is constructed from the training data set to facilitate the design process. FTC is proved to be accurate, stable and has short settling time. In order to compare it with other representative localized algorithms (NONE, FLSS, k-Neighbor and LTRT, FTC is evaluated through extensive simulations. The simulation results show that: firstly, similar to k-Neighbor algorithm, FTC is the best to achieve the desired average node degree as node density varies; secondly, FTC is comparable to FLSS and k-Neighbor in terms of energy-efficiency, but is better than LTRT and NONE; thirdly, FTC has the lowest average maximum communication range than other algorithms, which indicates that the most energy-consuming node in the network consumes the lowest power.

  13. A novel topology control approach to maintain the node degree in dynamic wireless sensor networks.

    Science.gov (United States)

    Huang, Yuanjiang; Martínez, José-Fernán; Díaz, Vicente Hernández; Sendra, Juana

    2014-03-07

    Topology control is an important technique to improve the connectivity and the reliability of Wireless Sensor Networks (WSNs) by means of adjusting the communication range of wireless sensor nodes. In this paper, a novel Fuzzy-logic Topology Control (FTC) is proposed to achieve any desired average node degree by adaptively changing communication range, thus improving the network connectivity, which is the main target of FTC. FTC is a fully localized control algorithm, and does not rely on location information of neighbors. Instead of designing membership functions and if-then rules for fuzzy-logic controller, FTC is constructed from the training data set to facilitate the design process. FTC is proved to be accurate, stable and has short settling time. In order to compare it with other representative localized algorithms (NONE, FLSS, k-Neighbor and LTRT), FTC is evaluated through extensive simulations. The simulation results show that: firstly, similar to k-Neighbor algorithm, FTC is the best to achieve the desired average node degree as node density varies; secondly, FTC is comparable to FLSS and k-Neighbor in terms of energy-efficiency, but is better than LTRT and NONE; thirdly, FTC has the lowest average maximum communication range than other algorithms, which indicates that the most energy-consuming node in the network consumes the lowest power.

  14. Trade-offs between driving nodes and time-to-control in complex networks

    Science.gov (United States)

    Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

    2017-01-01

    Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks.

  15. Boarding Team Networking on the Move: Applying Unattended Relay Nodes

    Science.gov (United States)

    2014-09-01

    Operations MPU Man Portable Unit NATO North Atlantic Treaty Organization NOC Network Operations Center OSI Open Source Initiative RHIB Rigid Hull...portion of world trade, while by economic value containerized goods form the largest portion [3]. Although economical value containers are most often...back of technological and logistical obstacles to inspect all containers, it is neither feasible nor economical to inspect every container entering

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

  17. Dissecting molecular stress networks: identifying nodes of divergence between life-history phenotypes.

    Science.gov (United States)

    Schwartz, Tonia S; Bronikowski, Anne M

    2013-02-01

    The complex molecular network that underlies physiological stress response is comprised of nodes (proteins, metabolites, mRNAs, etc.) whose connections span cells, tissues and organs. Variable nodes are points in the network upon which natural selection may act. Thus, identifying variable nodes will reveal how this molecular stress network may evolve among populations in different habitats and how it might impact life-history evolution. Here, we use physiological and genetic assays to test whether laboratory-born juveniles from natural populations of garter snakes (Thamnophis elegans), which have diverged in their life-history phenotypes, vary concomitantly at candidate nodes of the stress response network, (i) under unstressed conditions and (ii) in response to an induced stress. We found that two common measures of stress (plasma corticosterone and liver gene expression of heat shock proteins) increased under stress in both life-history phenotypes. In contrast, the phenotypes diverged at four nodes both under unstressed conditions and in response to stress: circulating levels of reactive oxygen species (superoxide, H(2)O(2)); liver gene expression of GPX1 and erythrocyte DNA damage. Additionally, allele frequencies for SOD2 diverge from neutral markers, suggesting diversifying selection on SOD2 alleles. This study supports the hypothesis that these life-history phenotypes have diverged at the molecular level in how they respond to stress, particularly in nodes regulating oxidative stress. Furthermore, the differences between the life-history phenotypes were more pronounced in females. We discuss the responses to stress in the context of the associated life-history phenotype and the evolutionary pressures thought to be responsible for divergence between the phenotypes. © 2012 Blackwell Publishing Ltd.

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

  19. Automated generation of node-splitting models for assessment of inconsistency in network meta-analysis.

    Science.gov (United States)

    van Valkenhoef, Gert; Dias, Sofia; Ades, A E; Welton, Nicky J

    2016-03-01

    Network meta-analysis enables the simultaneous synthesis of a network of clinical trials comparing any number of treatments. Potential inconsistencies between estimates of relative treatment effects are an important concern, and several methods to detect inconsistency have been proposed. This paper is concerned with the node-splitting approach, which is particularly attractive because of its straightforward interpretation, contrasting estimates from both direct and indirect evidence. However, node-splitting analyses are labour-intensive because each comparison of interest requires a separate model. It would be advantageous if node-splitting models could be estimated automatically for all comparisons of interest. We present an unambiguous decision rule to choose which comparisons to split, and prove that it selects only comparisons in potentially inconsistent loops in the network, and that all potentially inconsistent loops in the network are investigated. Moreover, the decision rule circumvents problems with the parameterisation of multi-arm trials, ensuring that model generation is trivial in all cases. Thus, our methods eliminate most of the manual work involved in using the node-splitting approach, enabling the analyst to focus on interpreting the results. © 2015 The Authors Research Synthesis Methods Published by John Wiley & Sons Ltd.

  20. Network neighborhood analysis with the multi-node topological overlap measure.

    Science.gov (United States)

    Li, Ai; Horvath, Steve

    2007-01-15

    The goal of neighborhood analysis is to find a set of genes (the neighborhood) that is similar to an initial 'seed' set of genes. Neighborhood analysis methods for network data are important in systems biology. If individual network connections are susceptible to noise, it can be advantageous to define neighborhoods on the basis of a robust interconnectedness measure, e.g. the topological overlap measure. Since the use of multiple nodes in the seed set may lead to more informative neighborhoods, it can be advantageous to define multi-node similarity measures. The pairwise topological overlap measure is generalized to multiple network nodes and subsequently used in a recursive neighborhood construction method. A local permutation scheme is used to determine the neighborhood size. Using four network applications and a simulated example, we provide empirical evidence that the resulting neighborhoods are biologically meaningful, e.g. we use neighborhood analysis to identify brain cancer related genes. An executable Windows program and tutorial for multi-node topological overlap measure (MTOM) based analysis can be downloaded from the webpage (http://www.genetics.ucla.edu/labs/horvath/MTOM/).

  1. Response times in a two-node queueing network with feedback

    NARCIS (Netherlands)

    van der Mei, R.D.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, J.L.

    2002-01-01

    The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

  2. Response times in a two-node queueing network with feedback

    NARCIS (Netherlands)

    van der Mei, R.D.; Gijsen, B.M.M.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, Hans Leo

    The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

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

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

  5. Macroscopic description of complex adaptive networks coevolving with dynamic node states

    Science.gov (United States)

    Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

    2015-05-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 coevolution 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 mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

  6. Probabilistic prosumer node modeling for estimating planning parameters in distribution networks with renewable energy sources

    DEFF Research Database (Denmark)

    Millar, Robert John; Ekstrom, Jussi; Lehtonen, Matti

    With the increase in distributed generation, the demand-only nature of many secondary substation nodes in medium voltage networks is becoming a mix of temporally varying consumption and generation with significant stochastic components. Traditional planning, however, has often assumed that the ma...

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

    OpenAIRE

    Razaque, Abdul; Elleithy, Khaled M.

    2014-01-01

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

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

  9. Sandwich node architecture for agile wireless sensor networks for real-time structural health monitoring applications

    Science.gov (United States)

    Wang, Zi; Pakzad, Shamim; Cheng, Liang

    2012-04-01

    In recent years, wireless sensor network (WSN), as a powerful tool, has been widely applied to structural health monitoring (SHM) due to its low cost of deployment. Several commercial hardware platforms of wireless sensor networks (WSN) have been developed and used for structural monitoring applications [1,2]. A typical design of a node includes a sensor board and a mote connected to it. Sensing units, analog filters and analog-to-digital converters (ADCs) are integrated on the sensor board and the mote consists of a microcontroller and a wireless transceiver. Generally, there are a set of sensor boards compatible with the same model of mote and the selection of the sensor board depends on the specific applications. A WSN system based on this node lacks the capability of interrupting its scheduled task to start a higher priority task. This shortcoming is rooted in the hardware architecture of the node. The proposed sandwich-node architecture is designed to remedy the shortcomings of the existing one for task preemption. A sandwich node is composed of a sensor board and two motes. The first mote is dedicated to managing the sensor board and processing acquired data. The second mote controls the first mote via commands. A prototype has been implemented using Imote2 and verified by an emulation in which one mote is triggered by a remote base station and then preempts the running task at the other mote for handling an emergency event.

  10. Privacy-preserving data aggregation in two-tiered wireless sensor networks with mobile nodes.

    Science.gov (United States)

    Yao, Yonglei; Liu, Jingfa; Xiong, Neal N

    2014-11-10

    Privacy-preserving data aggregation in wireless sensor networks (WSNs) with mobile nodes is a challenging problem, as an accurate aggregation result should be derived in a privacy-preserving manner, under the condition that nodes are mobile and have no pre-specified keys for cryptographic operations. In this paper, we focus on the SUM aggregation function and propose two privacy-preserving data aggregation protocols for two-tiered sensor networks with mobile nodes: Privacy-preserving Data Aggregation against non-colluded Aggregator and Sink (PDAAS) and Privacy-preserving Data Aggregation against Colluded Aggregator and Sink (PDACAS). Both protocols guarantee that the sink can derive the SUM of all raw sensor data but each sensor's raw data is kept confidential. In PDAAS, two keyed values are used, one shared with the sink and the other shared with the aggregator. PDAAS can protect the privacy of sensed data against external eavesdroppers, compromised sensor nodes, the aggregator or the sink, but fails if the aggregator and the sink collude. In PDACAS, multiple keyed values are used in data perturbation, which are not shared with the aggregator or the sink. PDACAS can protect the privacy of sensor nodes even the aggregator and the sink collude, at the cost of a little more overhead than PDAAS. Thorough analysis and experiments are conducted, which confirm the efficacy and efficiency of both schemes.

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

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

  13. Quantum-entanglement storage and extraction in quantum network node

    Science.gov (United States)

    Shan, Zhuoyu; Zhang, Yong

    Quantum computing and quantum communication have become the most popular research topic. Nitrogen-vacancy (NV) centers in diamond have been shown the great advantage of implementing quantum information processing. The generation of entanglement between NV centers represents a fundamental prerequisite for all quantum information technologies. In this paper, we propose a scheme to realize the high-fidelity storage and extraction of quantum entanglement information based on the NV centers at room temperature. We store the entangled information of a pair of entangled photons in the Bell state into the nuclear spins of two NV centers, which can make these two NV centers entangled. And then we illuminate how to extract the entangled information from NV centers to prepare on-demand entangled states for optical quantum information processing. The strategy of engineering entanglement demonstrated here maybe pave the way towards a NV center-based quantum network.

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

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

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

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

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

  19. Detecting unknown attacks in wireless sensor networks that contain mobile nodes.

    Science.gov (United States)

    Banković, Zorana; Fraga, David; Moya, José M; Vallejo, Juan Carlos

    2012-01-01

    As wireless sensor networks are usually deployed in unattended areas, security policies cannot be updated in a timely fashion upon identification of new attacks. This gives enough time for attackers to cause significant damage. Thus, it is of great importance to provide protection from unknown attacks. However, existing solutions are mostly concentrated on known attacks. On the other hand, mobility can make the sensor network more resilient to failures, reactive to events, and able to support disparate missions with a common set of sensors, yet the problem of security becomes more complicated. In order to address the issue of security in networks with mobile nodes, we propose a machine learning solution for anomaly detection along with the feature extraction process that tries to detect temporal and spatial inconsistencies in the sequences of sensed values and the routing paths used to forward these values to the base station. We also propose a special way to treat mobile nodes, which is the main novelty of this work. The data produced in the presence of an attacker are treated as outliers, and detected using clustering techniques. These techniques are further coupled with a reputation system, in this way isolating compromised nodes in timely fashion. The proposal exhibits good performances at detecting and confining previously unseen attacks, including the cases when mobile nodes are compromised.

  20. An IEEE 802.11 EDCA Model with Support for Analysing Networks with Misbehaving Nodes

    Directory of Open Access Journals (Sweden)

    Szott Szymon

    2010-01-01

    Full Text Available We present a novel model of IEEE 802.11 EDCA with support for analysing networks with misbehaving nodes. In particular, we consider backoff misbehaviour. Firstly, we verify the model by extensive simulation analysis and by comparing it to three other IEEE 802.11 models. The results show that our model behaves satisfactorily and outperforms other widely acknowledged models. Secondly, a comparison with simulation results in several scenarios with misbehaving nodes proves that our model performs correctly for these scenarios. The proposed model can, therefore, be considered as an original contribution to the area of EDCA models and backoff misbehaviour.

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

  2. Increasing the coverage area through relay node deployment in long term evolution advanced cellular networks

    Science.gov (United States)

    Aldhaibani, Jaafar A.; Ahmad, R. B.; Yahya, A.; Azeez, Suzan A.

    2015-05-01

    Wireless multi-hop relay networks have become very important technologies in mobile communications. These networks ensure high throughput and coverage extension with a low cost. The poor capacity at cell edges is not enough to meet with growing demand of high capacity and throughput irrespective of user's placement in the cellular network. In this paper we propose optimal placement of relay node that provides maximum achievable rate at users and enhances the throughput and coverage at cell edge region. The proposed scheme is based on the outage probability at users and taken on account the interference between nodes. Numerical analyses along with simulation results indicated there are an improvement in capacity for users at the cell edge is 40% increment from all cell capacity.

  3. Choosing a heuristic and root node for edge ordering in BDD-based network reliability analysis

    International Nuclear Information System (INIS)

    Mo, Yuchang; Xing, Liudong; Zhong, Farong; Pan, Zhusheng; Chen, Zhongyu

    2014-01-01

    In the Binary Decision Diagram (BDD)-based network reliability analysis, heuristics have been widely used to obtain a reasonably good ordering of edge variables. Orderings generated using different heuristics can lead to dramatically different sizes of BDDs, and thus dramatically different running times and memory usages for the analysis of the same network. Unfortunately, due to the nature of the ordering problem (i.e., being an NP-complete problem) no formal guidelines or rules are available for choosing a good heuristic or for choosing a high-performance root node to perform edge searching using a particular heuristic. In this work, we make novel contributions by proposing heuristic and root node selection methods based on the concept of boundary sets for the BDD-based network reliability analysis. Empirical studies show that the proposed selection methods can help to generate high-performance edge ordering for most of studied cases, enabling the efficient BDD-based reliability analysis of large-scale networks. The proposed methods are demonstrated on different types of networks, including square lattice networks, torus lattice networks and de Bruijn networks

  4. Curcumin Protects Neurons from Glutamate-Induced Excitotoxicity by Membrane Anchored AKAP79-PKA Interaction Network

    Directory of Open Access Journals (Sweden)

    Kui Chen

    2015-01-01

    Full Text Available Now stimulation of AMPA receptor as well as its downstream pathways is considered as potential central mediators in antidepressant mechanisms. As a signal integrator which binds to AMPA receptor, A-kinase anchoring protein 79-(AKAP79- PKA complex is regarded as a potential drug target to exert neuroprotective effects. A well-tolerated and multitarget drug curcumin has been confirmed to exert antidepressant-like effects. To explore whether AKAP79-PKA complex is involved in curcumin-mediated antiexcitotoxicity, we detected calcium signaling, subcellular location of AKAP79-PKA complex, phosphorylation of glutamate receptor, and ERK and AKT cascades. In this study, we found that curcumin protected neurons from glutamate insult by reducing Ca2+ influx and blocking the translocation of AKAP79 from cytomembrane to cytoplasm. In parallel, curcumin enhanced the phosphorylation of AMPA receptor and its downstream pathways in PKA-dependent manner. If we pretreated cells with PKA anchoring inhibitor Ht31 to disassociate PKA from AKAP79, no neuroprotective effects were observed. In conclusion, our results show that AKAP79-anchored PKA facilitated the signal relay from AMPA receptor to AKT and ERK cascades, which may be crucial for curcumin-mediated antiexcitotoxicity.

  5. Data Collection Method for Mobile Control Sink Node in Wireless Sensor Network Based on Compressive Sensing

    Directory of Open Access Journals (Sweden)

    Ling Yongfa

    2016-01-01

    Full Text Available The paper proposes a mobile control sink node data collection method in the wireless sensor network based on compressive sensing. This method, with regular track, selects the optimal data collection points in the monitoring area via the disc method, calcu-lates the shortest path by using the quantum genetic algorithm, and hence determines the data collection route. Simulation results show that this method has higher network throughput and better energy efficiency, capable of collecting a huge amount of data with balanced energy consumption in the network.

  6. Detecting Malicious Nodes in Medical Smartphone Networks Through Euclidean Distance-Based Behavioral Profiling

    DEFF Research Database (Denmark)

    Meng, Weizhi; Li, Wenjuan; Wang, Yu

    2017-01-01

    and healthcare personnel. The underlying network architecture to support such devices is also referred to as medical smartphone networks (MSNs). Similar to other networks, MSNs also suffer from various attacks like insider attacks (e.g., leakage of sensitive patient information by a malicious insider......). In this work, we focus on MSNs and design a trust-based intrusion detection approach through Euclidean distance-based behavioral profiling to detect malicious devices (or called nodes). In the evaluation, we collaborate with healthcare organizations and implement our approach in a real simulated MSN...

  7. Social representations of electricity network technologies: exploring processes of anchoring and objectification through the use of visual research methods.

    Science.gov (United States)

    Devine-Wright, Hannah; Devine-Wright, Patrick

    2009-06-01

    The aim of this study was to explore everyday thinking about the UK electricity network, in light of government policy to increase the generation of electricity from renewable energy sources. Existing literature on public perceptions of electricity network technologies was broadened by adopting a more socially embedded conception of the construction of knowledge using the theory of social representations (SRT) to explore symbolic associations with network technologies. Drawing and association tasks were administered within nine discussion groups held in two places: a Scottish town where significant upgrades to the local transmission network were planned and an English city with no such plans. Our results illustrate the ways in which network technologies, such as high voltage (HV) pylons, are objectified in talk and drawings. These invoked positive as well as negative symbolic and affective associations, both at the level of specific pylons, and the 'National Grid' as a whole and are anchored in understanding of other networks such as mobile telecommunications. We conclude that visual methods are especially useful for exploring beliefs about technologies that are widespread, proximal to our everyday experience but nevertheless unfamiliar topics of everyday conversation.

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

  9. A comparative study on the reliability of co-authorship networks with emphases on edges and nodes

    Directory of Open Access Journals (Sweden)

    Sandra Cristina de Oliveira

    2016-06-01

    Full Text Available A scientific co-authorship network may be modeled by a graph G composed of k nodes and m edges. Researchers that make up this network may be interpreted as its nodes and the link between these agents (co-authored papers as its edges. Current work evaluated and compared the reliability measure of networks with two emphases: 1 On nodes (perfectly reliable edges and 2 On edges (perfectly reliable nodes. Specifically, the reliability of a fictitious co-authorship network at a given time t was analyzed taking into account, first, the reliability of nodes (researchers equal and different, and, second, the reliability of edges (co-authorship relations, equal and different. Additionally, centrality measures of nodes were obtained to identify situations where the insertion of an edge significantly increased the reliability of the network. Results showed that the reliability of the co-authorship network focusing on edges is more sensitive to changes in individual reliabilities than the reliability of the network focusing on nodes. Additionally, the use of centrality measures was viable to identify possible insertions of edges or co-authorship relations to increase the reliability of the network in the two approaches.

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

  11. Axillary Lymph Node Evaluation Utilizing Convolutional Neural Networks Using MRI Dataset.

    Science.gov (United States)

    Ha, Richard; Chang, Peter; Karcich, Jenika; Mutasa, Simukayi; Fardanesh, Reza; Wynn, Ralph T; Liu, Michael Z; Jambawalikar, Sachin

    2018-04-25

    The aim of this study is to evaluate the role of convolutional neural network (CNN) in predicting axillary lymph node metastasis, using a breast MRI dataset. An institutional review board (IRB)-approved retrospective review of our database from 1/2013 to 6/2016 identified 275 axillary lymph nodes for this study. Biopsy-proven 133 metastatic axillary lymph nodes and 142 negative control lymph nodes were identified based on benign biopsies (100) and from healthy MRI screening patients (42) with at least 3 years of negative follow-up. For each breast MRI, axillary lymph node was identified on first T1 post contrast dynamic images and underwent 3D segmentation using an open source software platform 3D Slicer. A 32 × 32 patch was then extracted from the center slice of the segmented tumor data. A CNN was designed for lymph node prediction based on each of these cropped images. The CNN consisted of seven convolutional layers and max-pooling layers with 50% dropout applied in the linear layer. In addition, data augmentation and L2 regularization were performed to limit overfitting. Training was implemented using the Adam optimizer, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments. Code for this study was written in Python using the TensorFlow module (1.0.0). Experiments and CNN training were done on a Linux workstation with NVIDIA GTX 1070 Pascal GPU. Two class axillary lymph node metastasis prediction models were evaluated. For each lymph node, a final softmax score threshold of 0.5 was used for classification. Based on this, CNN achieved a mean five-fold cross-validation accuracy of 84.3%. It is feasible for current deep CNN architectures to be trained to predict likelihood of axillary lymph node metastasis. Larger dataset will likely improve our prediction model and can potentially be a non-invasive alternative to core needle biopsy and even sentinel lymph node

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

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

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

    Science.gov (United States)

    Razaque, Abdul; Elleithy, Khaled M.

    2014-01-01

    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

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

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

  17. Evidence for the additions of clustered interacting nodes during the evolution of protein interaction networks from network motifs

    Directory of Open Access Journals (Sweden)

    Guo Hao

    2011-05-01

    Full Text Available Abstract Background High-throughput screens have revealed large-scale protein interaction networks defining most cellular functions. How the proteins were added to the protein interaction network during its growth is a basic and important issue. Network motifs represent the simplest building blocks of cellular machines and are of biological significance. Results Here we study the evolution of protein interaction networks from the perspective of network motifs. We find that in current protein interaction networks, proteins of the same age class tend to form motifs and such co-origins of motif constituents are affected by their topologies and biological functions. Further, we find that the proteins within motifs whose constituents are of the same age class tend to be densely interconnected, co-evolve and share the same biological functions, and these motifs tend to be within protein complexes. Conclusions Our findings provide novel evidence for the hypothesis of the additions of clustered interacting nodes and point out network motifs, especially the motifs with the dense topology and specific function may play important roles during this process. Our results suggest functional constraints may be the underlying driving force for such additions of clustered interacting nodes.

  18. How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach

    Directory of Open Access Journals (Sweden)

    Tong Qiao

    2017-11-01

    Full Text Available Centrality is one of the most studied concepts in network analysis. Despite an abundance of methods for measuring centrality in social networks has been proposed, each approach exclusively characterizes limited parts of what it implies for an actor to be “vital” to the network. In this paper, a novel mechanism is proposed to quantitatively measure centrality using the re-defined entropy centrality model, which is based on decompositions of a graph into subgraphs and analysis on the entropy of neighbor nodes. By design, the re-defined entropy centrality which describes associations among node pairs and captures the process of influence propagation can be interpreted explained as a measure of actor potential for communication activity. We evaluate the efficiency of the proposed model by using four real-world datasets with varied sizes and densities and three artificial networks constructed by models including Barabasi-Albert, Erdos-Renyi and Watts-Stroggatz. The four datasets are Zachary’s karate club, USAir97, Collaboration network and Email network URV respectively. Extensive experimental results prove the effectiveness of the proposed method.

  19. Attractor controllability of Boolean networks by flipping a subset of their nodes

    Science.gov (United States)

    Rafimanzelat, Mohammad Reza; Bahrami, Fariba

    2018-04-01

    The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.

  20. Fixed-time synchronization of complex networks with nonidentical nodes and stochastic noise perturbations

    Science.gov (United States)

    Zhang, Wanli; Li, Chuandong; Huang, Tingwen; Huang, Junjian

    2018-02-01

    This paper investigates the fixed-time synchronization of complex networks (CNs) with nonidentical nodes and stochastic noise perturbations. By designing new controllers, constructing Lyapunov functions and using the properties of Weiner process, different synchronization criteria are derived according to whether the node systems in the CNs or the goal system satisfies the corresponding conditions. Moreover, the role of the designed controllers is analyzed in great detail by constructing a suitable comparison system and a new method is presented to estimate the settling time by utilizing the comparison system. Results of this paper can be applied to both directed and undirected weighted networks. Numerical simulations are offered to verify the effectiveness of our new results.

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

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

    KAUST Repository

    Alouini, Mohamed-Slim; Douik, Ahmed S.; Aly, Salah A.; Al-Naffouri, Tareq Y.

    2017-01-01

    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.

  3. Combined centralised and distributed mechanism for utilisation of node association in broadband wireless network

    Science.gov (United States)

    Ulvan, A.; Ulvan, M.; Pranoto, H.

    2018-02-01

    Mobile broadband wireless access system has the stations that might be fixed, nomadic or mobile. Regarding the mobility, the node association procedure is critical for network entry as well as network re-entry during handover. The flexibility and utilisation of MAC protocols scheduling have an important role. The standard provides the Partition Scheme as the scheduling mechanism which separates the allocation of minislots for scheduling. However, minislots cannot be flexibly reserved for centralised and distributed scheduling. In this paper we analysed the scheduling mechanism to improve the utilisation of minislots allocation during the exchange of MAC massages. The centralised and distributed scheduling is implemented in some topology scenarios. The result shows the proposed mechanism has better performance for node association than partition scheme.

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

  5. An Agent-Based Approach To Nodes Misbehaviour Detection In Mobile Ad-Hoc Networks

    Directory of Open Access Journals (Sweden)

    Otor Samera U.

    2017-02-01

    Full Text Available Existing Misbehaviour Detection Systems in Mobile Ad-hoc Networks MANETs are challenged with routing overhead and high latency resulting from complexity and failure to isolate and block misbehaving nodes for the reason that it is difficult to detect them as they participate fully in route finding. In this work a Mobile Agent-Based Acknowledgement scheme MAACK was formulated to address this problem using an object oriented algorithm deployed to report misbehaving nodes to the source and destination by registering the Internet Protocol IP address of misbehaving nodes in their header. The scheme was simulated using Network Simulator-3 NS-3 and results benchmarked with an existing scheme the Enhanced Adaptive Acknowledgment EAACK using packet delivery ratio routing overhead and latency as performance metrics in the two scenarios. The results showed that the MAACK paradigm guaranteed a higher packet delivery ratio lower latency and routing overhead than the EAACK scheme. The model can be adapted by Ad-Hoc network protocol developers.

  6. Traffic Management by Using Admission Control Methods in Multiple Node IMS Network

    Directory of Open Access Journals (Sweden)

    Filip Chamraz

    2016-01-01

    Full Text Available The paper deals with Admission Control methods (AC as a possible solution for traffic management in IMS networks (IP Multimedia Subsystem - from the point of view of an efficient redistribution of the available network resources and keeping the parameters of Quality of Service (QoS. The paper specifically aims at the selection of the most appropriate method for the specific type of traffic and traffic management concept using AC methods on multiple nodes. The potential benefit and disadvantage of the used solution is evaluated.

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

  8. A transmission power optimization with a minimum node degree for energy-efficient wireless sensor networks with full-reachability.

    Science.gov (United States)

    Chen, Yi-Ting; Horng, Mong-Fong; Lo, Chih-Cheng; Chu, Shu-Chuan; Pan, Jeng-Shyang; Liao, Bin-Yih

    2013-03-20

    Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments.

  9. A Transmission Power Optimization with a Minimum Node Degree for Energy-Efficient Wireless Sensor Networks with Full-Reachability

    Science.gov (United States)

    Chen, Yi-Ting; Horng, Mong-Fong; Lo, Chih-Cheng; Chu, Shu-Chuan; Pan, Jeng-Shyang; Liao, Bin-Yih

    2013-01-01

    Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments. PMID:23519351

  10. Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics.

    Directory of Open Access Journals (Sweden)

    István A Kovács

    Full Text Available BACKGROUND: Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. METHODOLOGY/PRINCIPAL FINDINGS: Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1 determine persvasively overlapping modules with high resolution; (2 uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3 allow the determination of key network nodes and (4 help to predict network dynamics. CONCLUSIONS/SIGNIFICANCE: The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction.

  11. Effects of salience-network-node neurofeedback training on affective biases in major depressive disorder.

    Science.gov (United States)

    Hamilton, J Paul; Glover, Gary H; Bagarinao, Epifanio; Chang, Catie; Mackey, Sean; Sacchet, Matthew D; Gotlib, Ian H

    2016-03-30

    Neural models of major depressive disorder (MDD) posit that over-response of components of the brain's salience network (SN) to negative stimuli plays a crucial role in the pathophysiology of MDD. In the present proof-of-concept study, we tested this formulation directly by examining the affective consequences of training depressed persons to down-regulate response of SN nodes to negative material. Ten participants in the real neurofeedback group saw, and attempted to learn to down-regulate, activity from an empirically identified node of the SN. Ten other participants engaged in an equivalent procedure with the exception that they saw SN-node neurofeedback indices from participants in the real neurofeedback group. Before and after scanning, all participants completed tasks assessing emotional responses to negative scenes and to negative and positive self-descriptive adjectives. Compared to participants in the sham-neurofeedback group, from pre- to post-training, participants in the real-neurofeedback group showed a greater decrease in SN-node response to negative stimuli, a greater decrease in self-reported emotional response to negative scenes, and a greater decrease in self-reported emotional response to negative self-descriptive adjectives. Our findings provide support for a neural formulation in which the SN plays a primary role in contributing to negative cognitive biases in MDD. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

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

  13. An Analysis of QoS in ZigBee Network Based on Deviated Node Priority

    Directory of Open Access Journals (Sweden)

    Md. Jaminul Haque Biddut

    2016-01-01

    Full Text Available ZigBee is an IEEE 802.15.4 standardized communication protocol. It forms a flawless Wireless Sensor Network (WSN standard for interoperability at all levels of the network, particularly the application level which most closely touches the user. A large number of devices from different vendors can work seamlessly. These devices act as a network and send huge data traffic to the Coordinator. End devices at different zones have different roles in communication with each other. There has been a lack in executing their requests in a synchronized way based on task priority. This lack leads to massive data traffic loss and degrades the Quality of Service (QoS. One of the challenges is to analyze the QoS parameters in ZigBee network that help to detect the overall network performance. The contribution of this paper is twofold; first, a ZigBee Network is implemented based on node priority. It demonstrates a method to generate a new priority of devices with respect to their existing priority and zones’ priority as well. Second, the QoS is analyzed based on the new priority status for tasks preference purposes. The outcome of this paper shows that the QoS of the network is more conspicuous than non-priority based network.

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

  15. A Trust Evaluation Algorithm for Wireless Sensor Networks Based on Node Behaviors and D-S Evidence Theory

    Directory of Open Access Journals (Sweden)

    Jiangwen Wan

    2011-01-01

    Full Text Available 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.

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

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

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

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

  20. Traffic grooming in WDM optical network with grooming resources at Max Connectivity nodes

    Science.gov (United States)

    Paul, Partha; Rawat, Balbeer Singh; Ghorai, S. K.

    2012-12-01

    In this paper, we propose Max Connectivity grooming in WDM mesh networks under static lightpath connection requests. The grooming and wavelength conversion resources are placed at the nodes having maximum connections. We propose a heuristic genetic algorithm (GA) model to solve grooming, routing and wavelength assignment. The GA algorithm has been used to optimize the cost of grooming and wavelength conversion resources. The blocking probability has been investigated under different lightpath connections. The performance of Max Connectivity grooming has been compared with other grooming policies. Our results indicate the improvement of resource utilization with minimum blocking probability.

  1. Epidemic Spreading in Complex Networks with Resilient Nodes: Applications to FMD

    Directory of Open Access Journals (Sweden)

    Pilwon Kim

    2018-01-01

    Full Text Available At the outbreak of the animal epidemic disease, farms that recover quickly from partially infected state can delay or even suppress the wide spreading of the infection over farm networks. In this work, we focus on how the spatial transmission of the infection is affected by both factors, the topology of networks and the internal resilience mechanism of nodes. We first develop an individual farm model to examine the influence of initial number of infected individuals and vaccination rate on the transmission in a single farm. Based on such intrafarm model, the farm network is constructed which reflects disease transmission between farms at various stages. We explore the impact of the farms vaccinated at low rates on the disease transmission into entire farm network and investigate the effect of the control on hub farms on the transmission over the farm network. It is shown that intensive control on the farms vaccinated at low rates and hub farms effectively reduces the potential risk of foot-and-mouth disease (FMD outbreak on the farm network.

  2. A novel algorithm for finding optimal driver nodes to target control complex networks and its applications for drug targets identification.

    Science.gov (United States)

    Guo, Wei-Feng; Zhang, Shao-Wu; Shi, Qian-Qian; Zhang, Cheng-Ming; Zeng, Tao; Chen, Luonan

    2018-01-19

    The advances in target control of complex networks not only can offer new insights into the general control dynamics of complex systems, but also be useful for the practical application in systems biology, such as discovering new therapeutic targets for disease intervention. In many cases, e.g. drug target identification in biological networks, we usually require a target control on a subset of nodes (i.e., disease-associated genes) with minimum cost, and we further expect that more driver nodes consistent with a certain well-selected network nodes (i.e., prior-known drug-target genes). Therefore, motivated by this fact, we pose and address a new and practical problem called as target control problem with objectives-guided optimization (TCO): how could we control the interested variables (or targets) of a system with the optional driver nodes by minimizing the total quantity of drivers and meantime maximizing the quantity of constrained nodes among those drivers. Here, we design an efficient algorithm (TCOA) to find the optional driver nodes for controlling targets in complex networks. We apply our TCOA to several real-world networks, and the results support that our TCOA can identify more precise driver nodes than the existing control-fucus approaches. Furthermore, we have applied TCOA to two bimolecular expert-curate networks. Source code for our TCOA is freely available from http://sysbio.sibcb.ac.cn/cb/chenlab/software.htm or https://github.com/WilfongGuo/guoweifeng . In the previous theoretical research for the full control, there exists an observation and conclusion that the driver nodes tend to be low-degree nodes. However, for target control the biological networks, we find interestingly that the driver nodes tend to be high-degree nodes, which is more consistent with the biological experimental observations. Furthermore, our results supply the novel insights into how we can efficiently target control a complex system, and especially many evidences on the

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

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

  5. Multi-channel multi-radio using 802.11 based media access for sink nodes in wireless sensor networks.

    Science.gov (United States)

    Campbell, Carlene E-A; Khan, Shafiullah; Singh, Dhananjay; Loo, Kok-Keong

    2011-01-01

    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.

  6. An evaluation of the multi-state node networks reliability using the traditional binary-state networks reliability algorithm

    International Nuclear Information System (INIS)

    Yeh, W.-C.

    2003-01-01

    A system where the components and system itself are allowed to have a number of performance levels is called the Multi-state system (MSS). A multi-state node network (MNN) is a generalization of the MSS without satisfying the flow conservation law. Evaluating the MNN reliability arises at the design and exploitation stage of many types of technical systems. Up to now, the known existing methods can only evaluate a special MNN reliability called the multi-state node acyclic network (MNAN) in which no cyclic is allowed. However, no method exists for evaluating the general MNN reliability. The main purpose of this article is to show first that each MNN reliability can be solved using any the traditional binary-state networks (TBSN) reliability algorithm with a special code for the state probability. A simple heuristic SDP algorithm based on minimal cuts (MC) for estimating the MNN reliability is presented as an example to show how the TBSN reliability algorithm is revised to solve the MNN reliability problem. To the author's knowledge, this study is the first to discuss the relationships between MNN and TBSN and also the first to present methods to solve the exact and approximated MNN reliability. One example is illustrated to show how the exact MNN reliability is obtained using the proposed algorithm

  7. Adaptive LINE-P: An Adaptive Linear Energy Prediction Model for Wireless Sensor Network Nodes.

    Science.gov (United States)

    Ahmed, Faisal; Tamberg, Gert; Le Moullec, Yannick; Annus, Paul

    2018-04-05

    In the context of wireless sensor networks, energy prediction models are increasingly useful tools that can facilitate the power management of the wireless sensor network (WSN) nodes. However, most of the existing models suffer from the so-called fixed weighting parameter, which limits their applicability when it comes to, e.g., solar energy harvesters with varying characteristics. Thus, in this article we propose the Adaptive LINE-P (all cases) model that calculates adaptive weighting parameters based on the stored energy profiles. Furthermore, we also present a profile compression method to reduce the memory requirements. To determine the performance of our proposed model, we have used real data for the solar and wind energy profiles. The simulation results show that our model achieves 90-94% accuracy and that the compressed method reduces memory overheads by 50% as compared to state-of-the-art models.

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

  9. How single node dynamics enhances synchronization in neural networks with electrical coupling

    International Nuclear Information System (INIS)

    Bonacini, E.; Burioni, R.; Di Volo, M.; Groppi, M.; Soresina, C.; Vezzani, A.

    2016-01-01

    The stability of the completely synchronous state in neural networks with electrical coupling is analytically investigated applying both the Master Stability Function approach (MSF), developed by Pecora and Carroll (1998), and the Connection Graph Stability method (CGS) proposed by Belykh et al. (2004). The local dynamics is described by Morris–Lecar model for spiking neurons and by Hindmarsh–Rose model in spike, burst, irregular spike and irregular burst regimes. The combined application of both CGS and MSF methods provides an efficient estimate of the synchronization thresholds, namely bounds for the coupling strength ranges in which the synchronous state is stable. In all the considered cases, we observe that high values of coupling strength tend to synchronize the system. Furthermore, we observe a correlation between the single node attractor and the local stability properties given by MSF. The analytical results are compared with numerical simulations on a sample network, with excellent agreement.

  10. Complex behavior in a network with time-dependent connections and silent nodes

    International Nuclear Information System (INIS)

    Marro, J; Torres, J J; Cortes, J M

    2008-01-01

    We studied, both analytically and numerically, excitable networks in which connections are time-dependent and some of the nodes remain silent at each time step, and we show that these two features may induce intriguing functional complexity. More specifically, we consider (a) a heterogeneous distribution of connection weights such that, depending on the current degree of order, some connections are reinforced/weakened with strength Φ on short timescales, and (b) that only a fraction ρ of nodes are simultaneously active. The resulting dynamics has attractors which, for a range of Φ values and ρ exceeding a threshold, become unstable, the instability depending critically on the value of ρ. We observe that (i) the activity describes a trajectory in which the close neighborhood of some of the attractors is constantly visited, (ii) the number of attractors visited increases with ρ, and (iii) the trajectory may change from regular to chaotic and vice versa as ρ is, even slightly modified. Furthermore, (iv) time series show a power-law spectra under conditions in which the attractors' space tends to be most efficiently explored. We argue on the possible qualitative relevance of this phenomenology to networks in several natural contexts

  11. Collaborative Area Monitoring Using Wireless Sensor Networks with Stationary and Mobile Nodes

    Directory of Open Access Journals (Sweden)

    Theofanis P. Lambrou

    2009-01-01

    Full Text Available Monitoring a large area with stationary sensor networks requires a very large number of nodes which with current technology implies a prohibitive cost. The motivation of this work is to develop an architecture where a set of mobile sensors will collaborate with the stationary sensors in order to reliably detect and locate an event. The main idea of this collaborative architecture is that the mobile sensors should sample the areas that are least covered (monitored by the stationary sensors. Furthermore, when stationary sensors have a “suspicion” that an event may have occurred, they report it to a mobile sensor that can move closer to the suspected area and can confirm whether the event has occurred or not. An important component of the proposed architecture is that the mobile nodes autonomously decide their path based on local information (their own beliefs and measurements as well as information collected from the stationary sensors in a neighborhood around them. We believe that this approach is appropriate in the context of wireless sensor networks since it is not feasible to have an accurate global view of the state of the environment.

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

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

  14. Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times

    Directory of Open Access Journals (Sweden)

    Preiss Bruno

    2011-01-01

    Full Text Available With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In our previous research, we presented a supernode system architecture that employs the delay-tolerant network (DTN concept to provide seamless communications for roaming users over interconnected heterogeneous wireless networks. Mobile ad hoc networks (MANETs are considered a key component of the supernode system for services over an area not covered by other wireless networks. Within the super node system, a dominating-set routing technique is proposed to improve message delivery over MANETs and to achieve better resource utilization. The performance of the dominating-set routing technique depends on estimation accuracy of the probability of a future contact between nodes. This paper studies how node mobility can be modeled and used to better estimate the probability of a contact. We derive a distribution for the node-to-node intermeeting time and present numerical results to demonstrate that the distribution can be used to improve the dominating-set routing technique performance. Moreover, we investigate how the distribution can be employed to relax the constraints of selecting the dominating-set members in order to improve the system resource utilization.

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

  16. Adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions

    International Nuclear Information System (INIS)

    Dai Hao; Jia Li-Xin; Zhang Yan-Bin

    2012-01-01

    The adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions is investigated in this paper. Based on Lyapunov stability theory and Barbalat's lemma, generalized matrix projective lag synchronization criteria are derived by using the adaptive control method. Furthermore, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. In addition, numerical simulation results are presented to illustrate the effectiveness of this method, showing that the synchronization speed is sensitively influenced by the adaptive law strength, the network size, and the network topological structure. (general)

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

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

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

  20. Localization-Free Detection of Replica Node Attacks in Wireless Sensor Networks Using Similarity Estimation with Group Deployment Knowledge

    Directory of Open Access Journals (Sweden)

    Chao Ding

    2017-01-01

    Full Text Available Due to the unattended nature and poor security guarantee of the wireless sensor networks (WSNs, adversaries can easily make replicas of compromised nodes, and place them throughout the network to launch various types of attacks. Such an attack is dangerous because it enables the adversaries to control large numbers of nodes and extend the damage of attacks to most of the network with quite limited cost. To stop the node replica attack, we propose a location similarity-based detection scheme using deployment knowledge. Compared with prior solutions, our scheme provides extra functionalities that prevent replicas from generating false location claims without deploying resource-consuming localization techniques on the resource-constraint sensor nodes. We evaluate the security performance of our proposal under different attack strategies through heuristic analysis, and show that our scheme achieves secure and robust replica detection by increasing the cost of node replication. Additionally, we evaluate the impact of network environment on the proposed scheme through theoretic analysis and simulation experiments, and indicate that our scheme achieves effectiveness and efficiency with substantially lower communication, computational, and storage overhead than prior works under different situations and attack strategies.

  1. A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes

    International Nuclear Information System (INIS)

    Yeh, W.-C.

    2004-01-01

    A MP/minimal cutset (MC) is a path/cut set such that if any edge is removed from this path/cut set, then the remaining set is no longer a path/cut set. An intuitive method is proposed to evaluate the reliability in terms of MCs in a stochastic-flow network subject to both edge and node failures under the condition that all of the MCs are given in advance. This is an extension of the best of known algorithms for solving the d-MC (a special MC but formatted in a system-state vector, where d is the lower bound points of the system capacity level) problem from the stochastic-flow network without unreliable nodes to with unreliable nodes by introducing some simple concepts. These concepts were first developed in the literature to implement the proposed algorithm to reduce the number of d-MC candidates. This method is more efficient than the best of known existing algorithms regardless if the network has or does not have unreliable nodes. Two examples are illustrated to show how the reliability is determined using the proposed algorithm in the network with or without unreliable nodes. The computational complexity of the proposed algorithm is analyzed and compared with the existing methods

  2. A fractional-N frequency synthesizer for wireless sensor network nodes

    International Nuclear Information System (INIS)

    Ma Xiao; Du Zhankun; Liu Chang; Liu Ke; Yan Yuepeng; Ye Tianchun

    2014-01-01

    This paper presents a fractional-N frequency synthesizer for wireless sensor network (WSN) nodes. The proposed frequency synthesizer adopts a phase locked loop (PLL) based structure, which employs an LC voltage-controlled oscillator (VCO) with small VCO gain (K VCO ) and frequency step (f step ) variations, a charge pump (CP) with current changing in proportion with the division ratio and a 20-bit ΔΣ modulator, etc. To realize constant K VCO and f step , a novel capacitor sub-bands grouping method is proposed. The VCO sub-groups' sizes are arranged according to the maximal allowed K VCO variation of the system. Besides, a current mode logic divide-by-2 circuit with inside-loop buffers ensures the synthesizer generates I/Q quadrature signals robustly. This synthesizer is implemented in a 0.13 μm CMOS process. Measurement results show that the frequency synthesizer has a frequency span from 2.07 to 3.11 GHz and the typical phase noise is −86.34 dBc/Hz at 100 kHz offset and −114.17 dBc/Hz at 1 MHz offset with a loop bandwidth of about 200 kHz, which meet the WSN nodes' requirements. (semiconductor integrated circuits)

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

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

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

    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......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...... and the corresponding case study has been done. The experimental data and the further analysis have proved that this method can calculate the power flow of a distribution network with multi PV nodes precisely and fast. © 2014 IEEE....

  6. Logical and physical resource management in the common node of a distributed function laboratory computer network

    International Nuclear Information System (INIS)

    Stubblefield, F.W.

    1976-01-01

    A scheme for managing resources required for transaction processing in the common node of a distributed function computer system has been given. The scheme has been found to be satisfactory for all common node services provided so far

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

  8. Wireless Sensor Network Localization Research

    OpenAIRE

    Liang Xin

    2014-01-01

    DV-Hop algorithm is one of the important range-free localization algorithms. It performs better in isotropic density senor networks, however, it brings larger location errors in random distributed networks. According to the localization principle of the DV-Hop algorithm, this paper improves the estimation of average single hop distance by using the Least Equal Square Error, and revises the estimated distance between the unknown node and the anchor node with compensation coefficient considerin...

  9. Identifying diabetes knowledge network nodes as sites for a diabetes prevention program.

    Science.gov (United States)

    Gesler, Wilbert M; Arcury, Thomas A; Skelly, Anne H; Nash, Sally; Soward, April; Dougherty, Molly

    2006-12-01

    This paper reports on the methods used and results of a study that identified specific places within a community that have the potential to be sites for a diabetes prevention program. These sites, termed diabetes knowledge network nodes (DKNNs), are based on the concept of socio-spatial knowledge networks (SSKNs), the web of social relationships within which people obtain knowledge about type 2 diabetes. The target population for the study was working poor African Americans, Latinos, and European Americans of both sexes in a small rural southern town who had not been diagnosed with diabetes. Information was collected from a sample of 121 respondents on the places they visited in carrying out their daily activities. Data on number of visits to specific sites, degree of familiarity with these sites, and ratings of sites as places to receive diabetes information were used to develop three categories of DKNNs for six subgroups based on ethnicity and sex. Primary potential sites of importance to one or more subgroups included churches, grocery stores, drugstores, the local library, a beauty salon, laundromats, a community service agency, and a branch of the County Health Department. Secondary potential sites included gas stations, restaurants, banks, and post offices. Latent potential sites included three medical facilities. Most of the DKNNs were located either in the downtown area or in one of two shopping areas along the most used highway that passed through the town. The procedures used in this study can be generalized to other communities and prevention programs for other chronic diseases.

  10. Coverage improvement in clustered wireless sensor networks by relocating mobile nodes based on waypoints

    DEFF Research Database (Denmark)

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

    2013-01-01

    by clusters with relocation of mobile nodes between the clusters. Mobile nodes are guided by waypoints between source and destination clusters without use of localization services. The simulation results have been presented which state the effectiveness of the proposed approach. Mobile node relocation has...

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

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

  13. Higher frequency network activity flow predicts lower frequency node activity in intrinsic low-frequency BOLD fluctuations.

    Science.gov (United States)

    Bajaj, Sahil; Adhikari, Bhim Mani; Dhamala, Mukesh

    2013-01-01

    The brain remains electrically and metabolically active during resting conditions. The low-frequency oscillations (LFO) of the blood oxygen level-dependent (BOLD) signal of functional magnetic resonance imaging (fMRI) coherent across distributed brain regions are known to exhibit features of this activity. However, these intrinsic oscillations may undergo dynamic changes in time scales of seconds to minutes during resting conditions. Here, using wavelet-transform based time-frequency analysis techniques, we investigated the dynamic nature of default-mode networks from intrinsic BOLD signals recorded from participants maintaining visual fixation during resting conditions. We focused on the default-mode network consisting of the posterior cingulate cortex (PCC), the medial prefrontal cortex (mPFC), left middle temporal cortex (LMTC) and left angular gyrus (LAG). The analysis of the spectral power and causal flow patterns revealed that the intrinsic LFO undergo significant dynamic changes over time. Dividing the frequency interval 0 to 0.25 Hz of LFO into four intervals slow-5 (0.01-0.027 Hz), slow-4 (0.027-0.073 Hz), slow-3 (0.073-0.198 Hz) and slow-2 (0.198-0.25 Hz), we further observed significant positive linear relationships of slow-4 in-out flow of network activity with slow-5 node activity, and slow-3 in-out flow of network activity with slow-4 node activity. The network activity associated with respiratory related frequency (slow-2) was found to have no relationship with the node activity in any of the frequency intervals. We found that the net causal flow towards a node in slow-3 band was correlated with the number of fibers, obtained from diffusion tensor imaging (DTI) data, from the other nodes connecting to that node. These findings imply that so-called resting state is not 'entirely' at rest, the higher frequency network activity flow can predict the lower frequency node activity, and the network activity flow can reflect underlying structural

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

    International Nuclear Information System (INIS)

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

    2016-01-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. (paper)

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

  16. Node-Splitting Generalized Linear Mixed Models for Evaluation of Inconsistency in Network Meta-Analysis.

    Science.gov (United States)

    Yu-Kang, Tu

    2016-12-01

    Network meta-analysis for multiple treatment comparisons has been a major development in evidence synthesis methodology. The validity of a network meta-analysis, however, can be threatened by inconsistency in evidence within the network. One particular issue of inconsistency is how to directly evaluate the inconsistency between direct and indirect evidence with regard to the effects difference between two treatments. A Bayesian node-splitting model was first proposed and a similar frequentist side-splitting model has been put forward recently. Yet, assigning the inconsistency parameter to one or the other of the two treatments or splitting the parameter symmetrically between the two treatments can yield different results when multi-arm trials are involved in the evaluation. We aimed to show that a side-splitting model can be viewed as a special case of design-by-treatment interaction model, and different parameterizations correspond to different design-by-treatment interactions. We demonstrated how to evaluate the side-splitting model using the arm-based generalized linear mixed model, and an example data set was used to compare results from the arm-based models with those from the contrast-based models. The three parameterizations of side-splitting make slightly different assumptions: the symmetrical method assumes that both treatments in a treatment contrast contribute to inconsistency between direct and indirect evidence, whereas the other two parameterizations assume that only one of the two treatments contributes to this inconsistency. With this understanding in mind, meta-analysts can then make a choice about how to implement the side-splitting method for their analysis. Copyright © 2016 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

  17. Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

    Science.gov (United States)

    Bellingeri, Michele; Lu, Zhe-Ming; Cassi, Davide; Scotognella, Francesco

    2018-02-01

    Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

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

  19. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs

    International Nuclear Information System (INIS)

    Lin, Y.-K.

    2002-01-01

    This paper deals with a stochastic-flow network in which each node and arc has a designated capacity, which will have different lower levels due to various partial and complete failures. We try to evaluate the system reliability that the maximum flow of the network is not less than a demand (d+1). A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for d, and then the system reliability can be calculated in terms of such points. The upper boundary point for d is a maximal vector, which represents the capacity of each component (arc or node), such that the maximum flow of the network is d. A computer example is shown to illustrate the solution procedure

  20. Data Fusion Based on Node Trust Evaluation in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhou Jianming

    2014-01-01

    Full Text Available Abnormal behavior detection and trust evaluation mode of traditional sensor node have a single function without considering all the factors, and the trust value algorithm is relatively complicated. To avoid these above disadvantages, a trust evaluation model based on the autonomous behavior of sensor node is proposed in this paper. Each sensor node has the monitoring privilege and obligation. Neighboring sensor nodes can monitor each other. Their direct and indirect trust values can be achieved by using a relatively simple calculation method, the synthesis trust value of which could be got according to the composition rule of D-S evidence theory. Firstly, the cluster head assigns different weighted value for the data from each sensor node, then the weight vector is set according to the synthesis trust value, the data fusion processing is executed, and finally the cluster head sensor node transmits the fused result to the base station. Simulation experiment results demonstrate that the trust evaluation model can rapidly, exactly, and effectively recognize malicious sensor node and avoid malicious sensor node becoming cluster head sensor node. The proposed algorithm can greatly increase the safety and accuracy of data fusion, improve communication efficiency, save energy of sensor node, suit different application fields, and deploy environments.

  1. Node Scheduling Strategies for Achieving Full-View Area Coverage in Camera Sensor Networks

    Science.gov (United States)

    Wu, Peng-Fei; Xiao, Fu; Sha, Chao; Huang, Hai-Ping; Wang, Ru-Chuan; Xiong, Nai-Xue

    2017-01-01

    Unlike conventional scalar sensors, camera sensors at different positions can capture a variety of views of an object. Based on this intrinsic property, a novel model called full-view coverage was proposed. We study the problem that how to select the minimum number of sensors to guarantee the full-view coverage for the given region of interest (ROI). To tackle this issue, we derive the constraint condition of the sensor positions for full-view neighborhood coverage with the minimum number of nodes around the point. Next, we prove that the full-view area coverage can be approximately guaranteed, as long as the regular hexagons decided by the virtual grid are seamlessly stitched. Then we present two solutions for camera sensor networks in two different deployment strategies. By computing the theoretically optimal length of the virtual grids, we put forward the deployment pattern algorithm (DPA) in the deterministic implementation. To reduce the redundancy in random deployment, we come up with a local neighboring-optimal selection algorithm (LNSA) for achieving the full-view coverage. Finally, extensive simulation results show the feasibility of our proposed solutions. PMID:28587304

  2. Node Scheduling Strategies for Achieving Full-View Area Coverage in Camera Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng-Fei Wu

    2017-06-01

    Full Text Available Unlike conventional scalar sensors, camera sensors at different positions can capture a variety of views of an object. Based on this intrinsic property, a novel model called full-view coverage was proposed. We study the problem that how to select the minimum number of sensors to guarantee the full-view coverage for the given region of interest (ROI. To tackle this issue, we derive the constraint condition of the sensor positions for full-view neighborhood coverage with the minimum number of nodes around the point. Next, we prove that the full-view area coverage can be approximately guaranteed, as long as the regular hexagons decided by the virtual grid are seamlessly stitched. Then we present two solutions for camera sensor networks in two different deployment strategies. By computing the theoretically optimal length of the virtual grids, we put forward the deployment pattern algorithm (DPA in the deterministic implementation. To reduce the redundancy in random deployment, we come up with a local neighboring-optimal selection algorithm (LNSA for achieving the full-view coverage. Finally, extensive simulation results show the feasibility of our proposed solutions.

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

  4. Exploratory Visual Analytics of a Dynamically Built Network of Nodes in a WebGL-Enabled Browser

    Science.gov (United States)

    2014-01-01

    dimensionality reduction, feature extraction, high-dimensional data, t-distributed stochastic neighbor embedding, neighbor retrieval visualizer, visual...WebGL-enabled rendering is supported natively by browsers such as the latest Mozilla Firefox , Google Chrome, and Microsoft Internet Explorer 11. At the...appropriate names. The resultant 26-node network is displayed in a Mozilla Firefox browser in figure 2 (also see appendix B). 3 Figure 1. The

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

  6. Software Defined Network Monitoring Scheme Using Spectral Graph Theory and Phantom Nodes

    Science.gov (United States)

    2014-09-01

    networks is the emergence of software - defined networking ( SDN ) [1]. SDN has existed for the...Chapter III for network monitoring. A. SOFTWARE DEFINED NETWORKS SDNs provide a new and innovative method to simplify network hardware by logically...and R. Giladi, “Performance analysis of software - defined networking ( SDN ),” in Proc. of IEEE 21st International Symposium on Modeling, Analysis

  7. Statistical identification of stimulus-activated network nodes in multi-neuron voltage-sensitive dye optical recordings.

    Science.gov (United States)

    Fathiazar, Elham; Anemuller, Jorn; Kretzberg, Jutta

    2016-08-01

    Voltage-Sensitive Dye (VSD) imaging is an optical imaging method that allows measuring the graded voltage changes of multiple neurons simultaneously. In neuroscience, this method is used to reveal networks of neurons involved in certain tasks. However, the recorded relative dye fluorescence changes are usually low and signals are superimposed by noise and artifacts. Therefore, establishing a reliable method to identify which cells are activated by specific stimulus conditions is the first step to identify functional networks. In this paper, we present a statistical method to identify stimulus-activated network nodes as cells, whose activities during sensory network stimulation differ significantly from the un-stimulated control condition. This method is demonstrated based on voltage-sensitive dye recordings from up to 100 neurons in a ganglion of the medicinal leech responding to tactile skin stimulation. Without relying on any prior physiological knowledge, the network nodes identified by our statistical analysis were found to match well with published cell types involved in tactile stimulus processing and to be consistent across stimulus conditions and preparations.

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

    Science.gov (United States)

    2017-03-01

    Paho-MQTT is the Python library used to interface with the Mosquitto client software [29]. To enable VPN connectivity for each node, the OpenVPN ...back online. 2. VPN Server The VPN server is created using PiVPN, an adaptation of OpenVPN developed for ease of implementation on a Raspberry Pi [30...node, as well as the system controller, is loaded with unique OpenVPN configuration files allowing connections to the server. This enables a wider

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

    Directory of Open Access Journals (Sweden)

    Michel Mandjes

    2008-01-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 users who wish to transmit data through a specific node, each of them obtains a share 1/(+ of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction /(+ is used to serve the queue; here >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 =1 has been addressed before; the present paper focuses on the intrinsically harder case >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.

  10. An activity recognition model using inertial sensor nodes in a wireless sensor network for frozen shoulder rehabilitation exercises.

    Science.gov (United States)

    Lin, Hsueh-Chun; Chiang, Shu-Yin; Lee, Kai; Kan, Yao-Chiang

    2015-01-19

    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.

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

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

  13. [Analysis of the Characteristics of Infantile Small World Neural Network Node Properties Correlated with the Influencing Factors].

    Science.gov (United States)

    Qu, Haibo; Lu, Su; Zhang, Wenjing; Xiao, Yuan; Ning, Gang; Sun, Huaiqiang

    2016-10-01

    We applied resting-state functional magnetic resonance imaging(rfMRI)combined with graph theory to analyze 90 regions of the infantile small world neural network of the whole brain.We tried to get the following two points clear:1 whether the parameters of the node property of the infantile small world neural network are correlated with the level of infantile intelligence development;2 whether the parameters of the infantile small world neural network are correlated with the children’s baseline parameters,i.e.,the demographic parameters such as gender,age,parents’ education level,etc.Twelve cases of healthy infants were included in the investigation(9males and 3females with the average age of 33.42±8.42 months.)We then evaluated the level of infantile intelligence of all the cases and graded by Gesell Development Scale Test.We used a Siemens 3.0T Trio imaging system to perform resting-state(rs)EPI scans,and collected the BOLD functional Magnetic Resonance Imaging(fMRI)data.We performed the data processing with Statistical Parametric Mapping 5(SPM5)based on Matlab environment.Furthermore,we got the attributes of the whole brain small world and node attributes of 90 encephalic regions of templates of Anatomatic Automatic Labeling(ALL).At last,we carried out correlation study between the above-mentioned attitudes,intelligence scale parameters and demographic data.The results showed that many node attributes of small world neural network were closely correlated with intelligence scale parameters.Betweeness was mainly centered in thalamus,superior frontal gyrus,and occipital lobe(negative correlation).The r value of superior occipital gyrus associated with the individual and social intelligent scale was-0.729(P=0.007);degree was mainly centered in amygdaloid nucleus,superior frontal gyrus,and inferior parietal gyrus(positive correlation).The r value of inferior parietal gyrus associated with the gross motor intelligent scale was 0.725(P=0.008);efficiency was mainly

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

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

    -tolerance. Each wind turbine has a potentially large number of data points needing to be monitored and collected, as farms continue to increase in scale; distances between turbines can reach several hundred meters. Optimal placement of relays in a large farm requires an efficient algorithmic solution. A relay...... node placement algorithm is proposed in this paper to approximate the optimal position for relays connecting each turbine. However, constraints are then required to prevent relay nodes being overloaded in 3-dimensions. The algorithm is extended to 3-dimensional Euclidean space for this optimal relay...

  16. A parameter-free community detection method based on centrality and dispersion of nodes in complex networks

    Science.gov (United States)

    Li, Yafang; Jia, Caiyan; Yu, Jian

    2015-11-01

    K-means is a simple and efficient clustering algorithm to detect communities in networks. However, it may suffer from a bad choice of initial seeds (also called centers) that seriously affect the clustering accuracy and the convergence rate. Additionally, in K-means, the number of communities should be specified in advance. Till now, it is still an open problem on how to select initial seeds and how to determine the number of communities. In this study, a new parameter-free community detection method (named K-rank-D) was proposed. First, based on the fact that good initial seeds usually have high importance and are dispersedly located in a network, we proposed a modified PageRank centrality to evaluate the importance of a node, and drew a decision graph to depict the importance and the dispersion of nodes. Then, the initial seeds and the number of communities were selected from the decision graph actively and intuitively as the 'start' parameter of K-means. Experimental results on synthetic and real-world networks demonstrate the superior performance of our approach over competing methods for community detection.

  17. 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 and efficient localisation method that makes use of an improved RSSI distance estimation model by including the antenna radiation pattern as well as nodes orientations is presented. Mathematical models for distance estimation, cost function and gradient of cost...

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

  19. Impact of Sink Node Placement onto Wireless Sensor Networks Performance Regarding Clustering Routing and Compressive Sensing Theory

    Directory of Open Access Journals (Sweden)

    Shima Pakdaman Tirani

    2016-01-01

    Full Text Available Wireless Sensor Networks (WSNs consist of several sensor nodes with sensing, computation, and wireless communication capabilities. The energy constraint is one of the most important issues in these networks. Thus, the data-gathering process should be carefully designed to conserve the energy. In this situation, a load balancing strategy can enhance the resources utilization, and consequently, increase the network lifetime. Furthermore, recently, the sparse nature of data in WSNs has been motivated the use of the compressive sensing as an efficient data gathering technique. Using the compressive sensing theory significantly leads to decreasing the volume of the transmitted data. Taking the above challenges into account, the main goal of this paper is to jointly consider the compressive sensing method and the load-balancing in WSNs. In this regards, using the conventional network model, we analyze the network performance in several different states. These states challenge the sink location in term of the number of transmissions. Numerical results demonstrate the efficiency of the load-balancing in the network performance.

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

  1. Effectiveness of a Littoral Combat Ship as a Major Node in a Wireless Mesh Network

    Science.gov (United States)

    2017-03-01

    responsible for connection management, handover control and measurement control (Scalable Network Technologies, 2014c). The final layer in the LTE ...26 2. Oceus Networks 4G LTE ...32 2. LTE Library .................................................................................32 3

  2. Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network

    OpenAIRE

    Bhavana Butani; Piyush Kumar Shukla; Sanjay Silakari

    2014-01-01

    Wireless sensor networks (WSNs) are novel large-scale wireless networks that consist of distributed, self organizing, low-power, low-cost, tiny sensor devices to cooperatively collect information through infrastructure less wireless networks. These networks are envisioned to play a crucial role in variety of applications like critical military surveillance applications, forest fire monitoring, commercial applications such as building security monitoring, traffic surveillance, habitat monitori...

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

  4. Connecting the Dots and Nodes: A Survey of Skills Requested by Employers for Network Administrators

    Science.gov (United States)

    Morris, Gerard; Fustos, Janos; Haga, Wayne

    2018-01-01

    One definition of a network administrator describes a person who works with computer infrastructures with an emphasis on networking. To determine the specific skills required of a network administrator by employers, data was collected from 698 nationwide job advertisements on Dice.com. The data collection focused on technical skills rather than…

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

  6. Factorization of Constrained Energy K-Network Reliability with Perfect Nodes

    OpenAIRE

    Burgos, Juan Manuel

    2013-01-01

    This paper proves a new general K-network constrained energy reliability global factorization theorem. As in the unconstrained case, beside its theoretical mathematical importance the theorem shows how to do parallel processing in exact network constrained energy reliability calculations in order to reduce the processing time of this NP-hard problem. Followed by a new simple factorization formula for its calculation, we propose a new definition of constrained energy network reliability motiva...

  7. The Ogden Anchor.

    Science.gov (United States)

    Knudson, W E; Cerniglia, M W; Carro, A

    1998-06-01

    Many procedures performed by podiatric surgeons today require the use of a soft-tissue anchoring device. In recent years, many new anchoring devices have become available for use in the foot and ankle. The authors introduce a new soft-tissue anchoring device that has yet to be described in the podiatric literature and present two cases in which the new anchor was used.

  8. Importance Sampling Simulation of Population Overflow in Two-node Tandem Networks

    NARCIS (Netherlands)

    Nicola, V.F.; Zaburnenko, T.S.; Baier, C; Chiola, G.; Smirni, E.

    2005-01-01

    In this paper we consider the application of importance sampling in simulations of Markovian tandem networks in order to estimate the probability of rare events, such as network population overflow. We propose a heuristic methodology to obtain a good approximation to the 'optimal' state-dependent

  9. Structural Observability and Sensor Node Selection for Complex Networks Governed by Nonlinear Balance Equations

    NARCIS (Netherlands)

    Kawano, Yu; Cao, Ming

    2017-01-01

    We define and then study the structural observability for a class of complex networks whose dynamics are governed by the nonlinear balance equations. Although related notions of observability of such complex networks have been studied before and in particular, necessary conditions have been reported

  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. A Hybrid DV-Hop Algorithm Using RSSI for Localization in Large-Scale Wireless Sensor Networks.

    Science.gov (United States)

    Cheikhrouhou, Omar; M Bhatti, Ghulam; Alroobaea, Roobaea

    2018-05-08

    With the increasing realization of the Internet-of-Things (IoT) and rapid proliferation of wireless sensor networks (WSN), estimating the location of wireless sensor nodes is emerging as an important issue. Traditional ranging based localization algorithms use triangulation for estimating the physical location of only those wireless nodes that are within one-hop distance from the anchor nodes. Multi-hop localization algorithms, on the other hand, aim at localizing the wireless nodes that can physically be residing at multiple hops away from anchor nodes. These latter algorithms have attracted a growing interest from research community due to the smaller number of required anchor nodes. One such algorithm, known as DV-Hop (Distance Vector Hop), has gained popularity due to its simplicity and lower cost. However, DV-Hop suffers from reduced accuracy due to the fact that it exploits only the network topology (i.e., number of hops to anchors) rather than the distances between pairs of nodes. In this paper, we propose an enhanced DV-Hop localization algorithm that also uses the RSSI values associated with links between one-hop neighbors. Moreover, we exploit already localized nodes by promoting them to become additional anchor nodes. Our simulations have shown that the proposed algorithm significantly outperforms the original DV-Hop localization algorithm and two of its recently published variants, namely RSSI Auxiliary Ranging and the Selective 3-Anchor DV-hop algorithm. More precisely, in some scenarios, the proposed algorithm improves the localization accuracy by almost 95%, 90% and 70% as compared to the basic DV-Hop, Selective 3-Anchor, and RSSI DV-Hop algorithms, respectively.

  12. Ecological Networks in Stored Grain: Key Postharvest Nodes for Emerging Pests, Pathogens, and Mycotoxins.

    Science.gov (United States)

    Hernandez Nopsa, John F; Daglish, Gregory J; Hagstrum, David W; Leslie, John F; Phillips, Thomas W; Scoglio, Caterina; Thomas-Sharma, Sara; Walter, Gimme H; Garrett, Karen A

    2015-10-01

    Wheat is at peak quality soon after harvest. Subsequently, diverse biota use wheat as a resource in storage, including insects and mycotoxin-producing fungi. Transportation networks for stored grain are crucial to food security and provide a model system for an analysis of the population structure, evolution, and dispersal of biota in networks. We evaluated the structure of rail networks for grain transport in the United States and Eastern Australia to identify the shortest paths for the anthropogenic dispersal of pests and mycotoxins, as well as the major sources, sinks, and bridges for movement. We found important differences in the risk profile in these two countries and identified priority control points for sampling, detection, and management. An understanding of these key locations and roles within the network is a new type of basic research result in postharvest science and will provide insights for the integrated pest management of high-risk subpopulations, such as pesticide-resistant insect pests.

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

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

  15. Biomarker Identification for Prostate Cancer and Lymph Node Metastasis from Microarray Data and Protein Interaction Network Using Gene Prioritization Method

    Directory of Open Access Journals (Sweden)

    Carlos Roberto Arias

    2012-01-01

    Full Text Available Finding a genetic disease-related gene is not a trivial task. Therefore, computational methods are needed to present clues to the biomedical community to explore genes that are more likely to be related to a specific disease as biomarker. We present biomarker identification problem using gene prioritization method called gene prioritization from microarray data based on shortest paths, extended with structural and biological properties and edge flux using voting scheme (GP-MIDAS-VXEF. The method is based on finding relevant interactions on protein interaction networks, then scoring the genes using shortest paths and topological analysis, integrating the results using a voting scheme and a biological boosting. We applied two experiments, one is prostate primary and normal samples and the other is prostate primary tumor with and without lymph nodes metastasis. We used 137 truly prostate cancer genes as benchmark. In the first experiment, GP-MIDAS-VXEF outperforms all the other state-of-the-art methods in the benchmark by retrieving the truest related genes from the candidate set in the top 50 scores found. We applied the same technique to infer the significant biomarkers in prostate cancer with lymph nodes metastasis which is not established well.

  16. The Appalachian Tri-State Node Experiences with the National Institute on Drug Abuse Clinical Trials Network.

    Science.gov (United States)

    Kelly, Thomas M; Daley, Dennis C; Byrne, Mimmie; Demarzo, Larry; Smith, Doris; Madl, Stephanie

    2011-07-01

    The National Institute on Drug Abuse (NIDA)-sponsored Clinical Trial Network (CTN) recently celebrated 10 years of conducting "real world" research into the treatment of addiction. This article reviews the history and results of the most recent CTN studies and describes the experiences of one of the 13 participating research affiliates, the Appalachian Tri-State (ATS) Node. We discuss our "bidirectional" collaboration with multiple community treatment programs (CTPs) on research and dissemination activities and include their experiences as a member of our ATS Node.Results of CTN clinical trials have found unexpectedly that treatment as usual (TAU) is often almost as good as evidence-based interventions such as Motivational Interviewing (MI), possibly due to the difficulty in implementing evidence-based practices most effectively among divergent treatment sites and heterogeneous clinical populations. Some expected findings from the reviewed research are that severity of addiction and comorbidity moderate treatment outcomes and must be accounted for in future CTN-sponsored studies. Notwithstanding these results, much has been learned and recommendations are suggested for changes in CTN research designs that will address methodological limitations and increase treatment effectiveness in future CTN studies.

  17. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

    OpenAIRE

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-01-01

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

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

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

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

  1. Information Estimation with Node Placement Strategy in 3D Wireless Sensor Networks

    OpenAIRE

    Karjee, Jyotirmoy; Jamadagni, H. S

    2017-01-01

    The cluster formation in Three Dimensional Wireless Sensor Networks (3D-WSN) give rise to overlapping of signals due to spherical sensing range which leads to information redundancy in the network. To address this problem, we develop a sensing algorithm for 3D-WSN based on dodecahedron topology which we call Three Dimensional Distributed Clustering (3D-DC) algorithm. Using 3D-DC algorithm in 3D-WSN, accurate information extraction appears to be a major challenge due to the environmental noise...

  2. An Integrated Online Library System as a Node in a Local Area Network: The Mitre Experience.

    Science.gov (United States)

    Kidwell, Mary Coyle

    1987-01-01

    Discusses the Mitre Corporation's implementation of OCLC's LS/2000 integrated library system using a local area network (LAN). LAN issues--requirements, equipment, reliability, growth, security, and traffic--are covered in general and as they relate to Mitre. Installation of the LAN/system interface and benefits and drawbacks of using a LAN for…

  3. Distributed push-pull estimation for node localization in wireless sensor networks

    NARCIS (Netherlands)

    Dang, Viet-Hung; Le Viet Duc, L Duc; Lee, Young-Koo; Lee, Sungyoung

    A great deal of research achievements on localization in wireless sensor networks (WSNs) has been obtained in recent years. Nevertheless, its interesting challenges in terms of cost-reduction, accuracy improvement, scalability, and distributed ability design have led to the development of a new

  4. Managing Epileptic Seizures by Controlling the Brain Driver Nodes: A Complex Network View

    Energy Technology Data Exchange (ETDEWEB)

    Bakouie, Fatemeh, E-mail: fbakouie@aut.ac.ir [Neural and Cognitive Sciences Laboratory, Biomedical Engineering Faculty, Amirkabir University of Technology, Tehran (Iran, Islamic Republic of); Cybernetics and Modeling of Biological Systems Laboratory, Biomedical Engineering Faculty, Amirkabir University of Technology, Tehran (Iran, Islamic Republic of); Gharibzadeh, Shahriar, E-mail: fbakouie@aut.ac.ir [Neural and Cognitive Sciences Laboratory, Biomedical Engineering Faculty, Amirkabir University of Technology, Tehran (Iran, Islamic Republic of); Towhidkhah, Farzad [Cybernetics and Modeling of Biological Systems Laboratory, Biomedical Engineering Faculty, Amirkabir University of Technology, Tehran (Iran, Islamic Republic of)

    2013-12-12

    The brain is a complex biological organization. In its hierarchy, different components, from neurons to functional cognitive circuits are interacting with each other. As a result of cooperation between neurons in the lower levels of this hierarchy, high level cognitive functions emerge (Stam and Reijneveld, 2007). In order to uncover the complexity of these higher functions, understanding the interaction rules in the lower level may be useful. In this level, there are lots of components which connect to each other (with a special structure) and exchange their information (in a specific manner). In this regard, complex network approach will be an influential way to study brain organization. The brain connectivity structure is suggested as a basis for emergence of its complex functions (Rubinov et al., 2009). For example, brain network analysis shows that its connectivity has the “small-worldness” feature, i.e., low characteristic path length and high clustering coefficient (Sporns et al., 2004). It has been seen that “synchronization” (as a collective dynamical behavior) occurs more rapidly in networks with small-world structure (Watts and Strogatz, 1998). Hence, we are able to use structural information (i.e., the pattern of connectivity between elements of the system) for understanding the functional pattern of the organization. Moreover, it is suggested that synchronization is the main mechanism for information exchange between different brain regions (Womelsdorf et al.,).

  5. Managing Epileptic Seizures by Controlling the Brain Driver Nodes: A Complex Network View

    International Nuclear Information System (INIS)

    Bakouie, Fatemeh; Gharibzadeh, Shahriar; Towhidkhah, Farzad

    2013-01-01

    The brain is a complex biological organization. In its hierarchy, different components, from neurons to functional cognitive circuits are interacting with each other. As a result of cooperation between neurons in the lower levels of this hierarchy, high level cognitive functions emerge (Stam and Reijneveld, 2007). In order to uncover the complexity of these higher functions, understanding the interaction rules in the lower level may be useful. In this level, there are lots of components which connect to each other (with a special structure) and exchange their information (in a specific manner). In this regard, complex network approach will be an influential way to study brain organization. The brain connectivity structure is suggested as a basis for emergence of its complex functions (Rubinov et al., 2009). For example, brain network analysis shows that its connectivity has the “small-worldness” feature, i.e., low characteristic path length and high clustering coefficient (Sporns et al., 2004). It has been seen that “synchronization” (as a collective dynamical behavior) occurs more rapidly in networks with small-world structure (Watts and Strogatz, 1998). Hence, we are able to use structural information (i.e., the pattern of connectivity between elements of the system) for understanding the functional pattern of the organization. Moreover, it is suggested that synchronization is the main mechanism for information exchange between different brain regions (Womelsdorf et al.,).

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

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

    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. PMID:25905698

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

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

  10. Dynamic behavior of acrylic acid clusters as quasi-mobile nodes in a model of hydrogel network

    Science.gov (United States)

    Zidek, Jan; Milchev, Andrey; Vilgis, Thomas A.

    2012-12-01

    Using a molecular dynamics simulation, we study the thermo-mechanical behavior of a model hydrogel subject to deformation and change in temperature. The model is found to describe qualitatively poly-lactide-glycolide hydrogels in which acrylic acid (AA)-groups are believed to play the role of quasi-mobile nodes in the formation of a network. From our extensive analysis of the structure, formation, and disintegration of the AA-groups, we are able to elucidate the relationship between structure and viscous-elastic behavior of the model hydrogel. Thus, in qualitative agreement with observations, we find a softening of the mechanical response at large deformations, which is enhanced by growing temperature. Several observables as the non-affinity parameter A and the network rearrangement parameter V indicate the existence of a (temperature-dependent) threshold degree of deformation beyond which the quasi-elastic response of the model system turns over into plastic (ductile) one. The critical stretching when the affinity of the deformation is lost can be clearly located in terms of A and V as well as by analysis of the energy density of the system. The observed stress-strain relationship matches that of known experimental systems.

  11. Asymptotic expansion for the resistance between two maximally separated nodes on an M by N resistor network.

    Science.gov (United States)

    Izmailian, N Sh; Huang, Ming-Chang

    2010-07-01

    We analyze the exact formulas for the resistance between two arbitrary notes in a rectangular network of resistors under free, periodic and cylindrical boundary conditions obtained by Wu [J. Phys. A 37, 6653 (2004)]. Based on such expression, we then apply the algorithm of Ivashkevich, Izmailian, and Hu [J. Phys. A 35, 5543 (2002)] to derive the exact asymptotic expansions of the resistance between two maximally separated nodes on an M×N rectangular network of resistors with resistors r and s in the two spatial directions. Our results is 1/s (R(M×N))(r,s) = c(ρ)ln S + c(0)(ρ,ξ) + ∑(p=1)(∞) (c(2p)(ρ,ξ))/S(p) with S = MN, ρ = r/s and ξ = M/N. The all coefficients in this expansion are expressed through analytical functions. We have introduced the effective aspect ratio ξeff = square root(ρ)ξ for free and periodic boundary conditions and ξeff = square root(ρ)ξ/2 for cylindrical boundary condition and show that all finite-size correction terms are invariant under transformation ξeff→1/ξeff.

  12. Study of Hybrid Localization Noncooperative Scheme in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Irfan Dwiguna Sumitra

    2017-01-01

    Full Text Available In this paper, we evaluated the experiment and analysis measurement accuracy to determine object location based on wireless sensor network (WSN. The algorithm estimates the position of sensor nodes employing received signal strength (RSS from scattered nodes in the environment, in particular for the indoor building. Besides that, we considered another algorithm based on weight centroid localization (WCL. In particular testbed, we combined both RSS and WCL as hybrid localization in case of noncooperative scheme with considering that source nodes directly communicate only with anchor nodes. Our experimental result shows localization accuracy of more than 90% and obtained the estimation error reduction to 4% compared to existing algorithms.

  13. Hop limited epidemic-like information spreading in mobile social networks with selfish nodes

    Science.gov (United States)

    Wu, Yahui; Deng, Su; Huang, Hongbin

    2013-07-01

    Similar to epidemics, information can be transmitted directly among users in mobile social networks. Different from epidemics, we can control the spreading process by adjusting the corresponding parameters (e.g., hop count) directly. This paper proposes a theoretical model to evaluate the performance of an epidemic-like spreading algorithm, in which the maximal hop count of the information is limited. In addition, our model can be used to evaluate the impact of users’ selfish behavior. Simulations show the accuracy of our theoretical model. Numerical results show that the information hop count can have an important impact. In addition, the impact of selfish behavior is related to the information hop count.

  14. Hop limited epidemic-like information spreading in mobile social networks with selfish nodes

    International Nuclear Information System (INIS)

    Wu, Yahui; Deng, Su; Huang, Hongbin

    2013-01-01

    Similar to epidemics, information can be transmitted directly among users in mobile social networks. Different from epidemics, we can control the spreading process by adjusting the corresponding parameters (e.g., hop count) directly. This paper proposes a theoretical model to evaluate the performance of an epidemic-like spreading algorithm, in which the maximal hop count of the information is limited. In addition, our model can be used to evaluate the impact of users’ selfish behavior. Simulations show the accuracy of our theoretical model. Numerical results show that the information hop count can have an important impact. In addition, the impact of selfish behavior is related to the information hop count. (paper)

  15. Growing the Data Refuge Project into a Local Libraries+ Network Node

    Science.gov (United States)

    Janz, M.

    2017-12-01

    The Data Refuge project began as concerns were raised about the vulnerability of federal climate and environmental data. The concern stemmed from the idea that if the federal agency that curates the data lost funding, and with it staff and infrastructure, that the data could be lost. The team worked to determine what factors contributed to the vulnerability of these data and how we might mitigate their risks. After speaking with many partners and collaborators around the country who all had different roles and perspectives working with these data, we saw the landscape of government data in new ways. We began seeing potential in various initiatives to ensure continued access to these data regardless of political, technological, or other risks. One recurring theme in our assessment was that libraries would be natural backup stewards for federal data.From and with our partners, we learned just how complicated the problem of creating networks of backup stewards for government data would be, but also how important it is to make the effort. As Data Refuge moves into its next stages into the Libraries+ Network, we're making plans to work with our partners on federal, state, and local projects that address different aspects of the problem space. These projects are examples of ways to approach this problem in concert with a variety of stakeholders.

  16. TWO-LEVEL HIERARCHICAL COORDINATION QUEUING METHOD FOR TELECOMMUNICATION NETWORK NODES

    Directory of Open Access Journals (Sweden)

    M. V. Semenyaka

    2014-07-01

    Full Text Available The paper presents hierarchical coordination queuing method. Within the proposed method a queuing problem has been reduced to optimization problem solving that was presented as two-level hierarchical structure. The required distribution of flows and bandwidth allocation was calculated at the first level independently for each macro-queue; at the second level solutions obtained on lower level for each queue were coordinated in order to prevent probable network link overload. The method of goal coordination has been determined for multilevel structure managing, which makes it possible to define the order for consideration of queue cooperation restrictions and calculation tasks distribution between levels of hierarchy. Decisions coordination was performed by the method of Lagrange multipliers. The study of method convergence has been carried out by analytical modeling.

  17. Susceptibility to anchoring effects

    Directory of Open Access Journals (Sweden)

    Todd McElroy

    2007-02-01

    Full Text Available Previous research on anchoring has shown this heuristic to be a very robust psychological phenomenon ubiquitous across many domains of human judgment and decision-making. Despite the prevalence of anchoring effects, researchers have only recently begun to investigate the underlying factors responsible for how and in what ways a person is susceptible to them. This paper examines how one such factor, the Big-Five personality trait of openness-to-experience, influences the effect of previously presented anchors on participants' judgments. Our findings indicate that participants high in openness-to-experience were significantly more influenced by anchoring cues relative to participants low in this trait. These findings were consistent across two different types of anchoring tasks providing convergent evidence for our hypothesis.

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

  19. SWIM: a computational tool to unveiling crucial nodes in complex biological networks.

    Science.gov (United States)

    Paci, Paola; Colombo, Teresa; Fiscon, Giulia; Gurtner, Aymone; Pavesi, Giulio; Farina, Lorenzo

    2017-03-20

    SWItchMiner (SWIM) is a wizard-like software implementation of a procedure, previously described, able to extract information contained in complex networks. Specifically, SWIM allows unearthing the existence of a new class of hubs, called "fight-club hubs", characterized by a marked negative correlation with their first nearest neighbors. Among them, a special subset of genes, called "switch genes", appears to be characterized by an unusual pattern of intra- and inter-module connections that confers them a crucial topological role, interestingly mirrored by the evidence of their clinic-biological relevance. Here, we applied SWIM to a large panel of cancer datasets from The Cancer Genome Atlas, in order to highlight switch genes that could be critically associated with the drastic changes in the physiological state of cells or tissues induced by the cancer development. We discovered that switch genes are found in all cancers we studied and they encompass protein coding genes and non-coding RNAs, recovering many known key cancer players but also many new potential biomarkers not yet characterized in cancer context. Furthermore, SWIM is amenable to detect switch genes in different organisms and cell conditions, with the potential to uncover important players in biologically relevant scenarios, including but not limited to human cancer.

  20. Interference-Based Decode and Forward Scheme Using Relay Nodes in Heterogeneous Networks

    Directory of Open Access Journals (Sweden)

    Kentaro Nishimori

    2012-01-01

    Full Text Available This paper proposes interference-based decode and forward scheme that utilizes relay stations (RSs. In Long-Term-Evolution (LTE- Advanced, heterogeneous networks in which femto- and picocells are overlaid onto macrocells are extensively discussed. However, interference between macro- and pico(femtocells arises due to their different transmit power levels. Unlike conventional cooperative transmission schemes, the RS decodes interference in the first transmit timing period and forwards it to the user equipment (UE in the second period. Moreover, cooperative transmission can be achieved without stopping the transmission from the base station (BS to UE when forwarding the interference from the RS to the UE by utilizing the fact that signal-to-noise power ratio (SNR between the RS and UE is much greater than that between the BS and UE. The basic performance of the proposed method is shown based on computer simulation. Moreover, the interference temperature and shadowing effect are measured when considering the coexistence between macro- and femtocells, and the performance of the proposed method is verified using measured shadowing effect.

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

  2. Word embeddings and recurrent neural networks based on Long-Short Term Memory nodes in supervised biomedical word sense disambiguation.

    Science.gov (United States)

    Jimeno Yepes, Antonio

    2017-09-01

    Word sense disambiguation helps identifying the proper sense of ambiguous words in text. With large terminologies such as the UMLS Metathesaurus ambiguities appear and highly effective disambiguation methods are required. Supervised learning algorithm methods are used as one of the approaches to perform disambiguation. Features extracted from the context of an ambiguous word are used to identify the proper sense of such a word. The type of features have an impact on machine learning methods, thus affect disambiguation performance. In this work, we have evaluated several types of features derived from the context of the ambiguous word and we have explored as well more global features derived from MEDLINE using word embeddings. Results show that word embeddings improve the performance of more traditional features and allow as well using recurrent neural network classifiers based on Long-Short Term Memory (LSTM) nodes. The combination of unigrams and word embeddings with an SVM sets a new state of the art performance with a macro accuracy of 95.97 in the MSH WSD data set. Copyright © 2017 Elsevier Inc. All rights reserved.

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

  4. 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 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. PMID:22163865

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

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

  7. Research nodes and networks

    DEFF Research Database (Denmark)

    Matthiessen, Christian Wichmann; Schwarz, Annette Winkel; Find, Søren

    2011-01-01

    of higher gropwth rates of Asian and Sourthern European cities. The chapter is the key empirical contribution to the comprehensive handbook of creative citieswhere experts including Åke E. Andersson, Richard Florida and Dean Simonton extend their insight with a varied set of theoretical and empirical tools....

  8. Geographic Location of a Computer Node Examining a Time-to-Location Algorithm and Multiple Autonomous System Networks

    National Research Council Canada - National Science Library

    Sorgaard, Duane

    2004-01-01

    .... A time-to-location algorithm can successfully resolve a geographic location of a computer node using only latency information from known sites and mathematically calculating the Euclidean distance...

  9. Prognostic Value of Histology and Lymph Node Status in Bilharziasis-Bladder Cancer: Outcome Prediction Using Neural Networks

    National Research Council Canada - National Science Library

    Ji, W

    2001-01-01

    .... Throughout the analysis of the prognostic feature combinations, two features, histological type and lymph node status, have been identified as the important indicators for outcome prediction of this type of cancer...

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

  11. One node driving synchronisation

    Science.gov (United States)

    Wang, Chengwei; Grebogi, Celso; Baptista, Murilo S.

    2015-12-01

    Abrupt changes of behaviour in complex networks can be triggered by a single node. This work describes the dynamical fundamentals of how the behaviour of one node affects the whole network formed by coupled phase-oscillators with heterogeneous coupling strengths. The synchronisation of phase-oscillators is independent of the distribution of the natural frequencies, weakly depends on the network size, but highly depends on only one key oscillator whose ratio between its natural frequency in a rotating frame and its coupling strength is maximum. This result is based on a novel method to calculate the critical coupling strength with which the phase-oscillators emerge into frequency synchronisation. In addition, we put forward an analytical method to approximately calculate the phase-angles for the synchronous oscillators.

  12. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Mostafa Monowar

    2015-06-01

    Full Text Available 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.

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

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

    OpenAIRE

    Campbell, Carlene E.-A.; Khan, Shafiullah; Singh, Dhananjay; Loo, Kok-Keong

    2011-01-01

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

  15. High optical label switching add-drop multiplexer nodes with nanoseconds latency for 5G metro/access networks

    NARCIS (Netherlands)

    Calabretta, N.; Miao, W.; De Waardt, H.

    2016-01-01

    We present a novel optical add-drop multiplexer for next-generation metro/access networks by exploiting optical label switching technology. Experimental results of a ring network show nanoseconds add/drop operation including multicasting and power equalization of 50Gb/s data.

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

  17. Developments for a passive optical node network for deployment in deep sea enabling time synchronous data readout

    International Nuclear Information System (INIS)

    Heine, Eric; Hoek, Mar van der; Hogenbirk, Jelle; Jansweijer, Peter; Mos, Sander; Peek, Henk

    2009-01-01

    An overview of an optical network design for a Very Large Volume neutrino Telescope (VLVnT) [Proceedings of the Workshop on Technical aspects of a VLVnT in the Mediterranean Sea, ISBN90-6488-026-3] residing on the seabed is presented. The passive optical network transports all data to shore in a synchronous way without data congestion. Due to fixed propagation delay and low jitter over the fiber network an accurate event time stamp can be generated onshore. The determined signal propagation can also serve for detector calibration. The results of a proto type vertical cable test are presented.

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

  19. 76 FR 10627 - Assumption Buster Workshop: Trust Anchors Are Invulnerable

    Science.gov (United States)

    2011-02-25

    ... day-long workshop on the pros and cons of the use and implementation of trust anchors. The workshop... National Coordination Office (NCO) for the Networking and Information Technology Research and Development... Coordination Office for the Networking and Information Technology Research and Development (NITRD) Program on...

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

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

    Directory of Open Access Journals (Sweden)

    José Meseguer

    2010-09-01

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

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

  3. The Holding Power of Anchors

    Indian Academy of Sciences (India)

    The efficiency of an anchor may be expressed as the ratio (holding force + weight of anchor). In dry sand .... the market at the beginning of the coming season in three sizes, namely 20, 35 and. 60 lb. These are ... Taylor frozen-flow hypothesis.

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

  5. A monopoly pricing model for diffusion maximization based on heterogeneous nodes and negative network externalities (Case study: A novel product

    Directory of Open Access Journals (Sweden)

    Aghdas Badiee

    2018-10-01

    Full Text Available Social networks can provide sellers across the world with invaluable information about the structure of possible influences among different members of a network, whether positive or negative, and can be used to maximize diffusion in the network. Here, a novel mathematical monopoly product pricing model is introduced for maximization of market share in noncompetitive environment. In the proposed model, a customer’s decision to buy a product is not only based on the price, quality and need time for the product but also on the positive and negative influences of his/her neighbors. Therefore, customers are considered heterogeneous and a referral bonus is granted to every customer whose neighbors also buy the product. Here, the degree of influence is directly related to the intensity of the customers’ relationships. Finally, using the proposed model for a real case study, the optimal policy for product sales that is the ratio of product sale price in comparison with its cost and also the optimal amounts of referral bonus per customer is achieved.

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

    2010-05-01

    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.

  7. Analysis of Anchoring Mechanism of Fully Grouted Prestressed Anchor

    Directory of Open Access Journals (Sweden)

    WEN Zhi-jie

    2014-01-01

    Full Text Available Some researchers have been carried out on analysis of the influence of the full grouted prestressed anchor shape of borehole wall on its carrying capacity. Based on the self-affine fractal feature of anchor borehole wall structural plane, the relation equation among structural plane shear strength, liquid injection pressure, tensile load and structural plane fractal dimension D was built, the instability judgment criterion of anchoring bearing strata and rock structural plane was determined, the solving equations of disintegrated rock support density were derived. Based on the experimental results, the theoretical basis of support design under the disintegrated rock condition was offered.

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

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

  10. Nodes and biological processes identified on the basis of network analysis in the brain of the senescence accelerated mice as an Alzheimer’s disease animal model

    Directory of Open Access Journals (Sweden)

    Xiao-Rui eCheng

    2013-10-01

    Full Text Available Harboring the behavioral and histopathological signatures of Alzheimer’s disease (AD, senescence accelerated mouse-prone 8 (SAMP8 mice are currently considered a robust model for studying AD. However, the underlying mechanisms, prioritized pathways and genes in SAMP8 mice linked to AD remain unclear. In this study, we provide a biological interpretation of the molecular underpinnings of SAMP8 mice. Our results were derived from differentially expressed genes in the hippocampus and cerebral cortex of SAMP8 mice compared to age-matched SAMR1 mice at 2, 6, and 12 months of age using cDNA microarray analysis. On the basis of PPI, MetaCore and the co-expression network, we constructed a distinct genetic sub-network in the brains of SAMP8 mice. Next, we determined that the regulation of synaptic transmission and apoptosis were disrupted in the brains of SAMP8 mice. We found abnormal gene expression of RAF1, MAPT, PTGS2, CDKN2A, CAMK2A, NTRK2, AGER, ADRBK1, MCM3AP and STUB1, which may have initiated the dysfunction of biological processes in the brains of SAMP8 mice. Specifically, we found microRNAs, including miR-20a, miR-17, miR-34a, miR-155, miR-18a, miR-22, miR-26a, miR-101, miR-106b and miR-125b, that might regulate the expression of nodes in the sub-network. Taken together, these results provide new insights into the biological and genetic mechanisms of SAMP8 mice and add an important dimension to our understanding of the neuro-pathogenesis in SAMP8 mice from a systems perspective.

  11. Hill functions for stochastic gene regulatory networks from master equations with split nodes and time-scale separation

    Science.gov (United States)

    Lipan, Ovidiu; Ferwerda, Cameron

    2018-02-01

    The deterministic Hill function depends only on the average values of molecule numbers. To account for the fluctuations in the molecule numbers, the argument of the Hill function needs to contain the means, the standard deviations, and the correlations. Here we present a method that allows for stochastic Hill functions to be constructed from the dynamical evolution of stochastic biocircuits with specific topologies. These stochastic Hill functions are presented in a closed analytical form so that they can be easily incorporated in models for large genetic regulatory networks. Using a repressive biocircuit as an example, we show by Monte Carlo simulations that the traditional deterministic Hill function inaccurately predicts time of repression by an order of two magnitudes. However, the stochastic Hill function was able to capture the fluctuations and thus accurately predicted the time of repression.

  12. Objective sleep disturbances are associated with greater waking resting-state connectivity between the retrosplenial cortex/ hippocampus and various nodes of the default mode network.

    Science.gov (United States)

    Regen, Wolfram; Kyle, Simon D; Nissen, Christoph; Feige, Bernd; Baglioni, Chiara; Hennig, Jürgen; Riemann, Dieter; Spiegelhalder, Kai

    2016-08-01

    Psychological models highlight the bidirectional role of self-referential processing, introspection, worry and rumination in the development and maintenance of insomnia; however, little is known about the underlying neural substrates. Default mode network (DMN) functional connectivity has been previously linked to these cognitive processes. We used fMRI to investigate waking DMN functional connectivity in a well-characterized sample of patients with primary insomnia (PI) and good sleeper controls. We included 20 patients with PI (8 men and 12 women, mean age 42.7 ± 13.4 yr) and 20 controls (8 men and 12 women, mean age 44.1 ± 10.6 yr) in our study. While no between-group differences in waking DMN connectivity were observed, exploratory analyses across all participants suggested that greater waking connectivity between the retrosplenial cortex/hippocampus and various nodes of the DMN was associated with lower sleep efficiency, lower amounts of rapid eye movement sleep and greater sleep-onset latency. Owing to the cross-sectional nature of the study, conclusions about causality cannot be drawn. As sleep disturbances represent a transdiagnostic symptom that is characteristic of nearly all psychiatric disorders, our results may hold particular relevance to previous findings of increased DMN connectivity levels in patients with psychiatric disorders.

  13. Desired crystal oriented LiFePO4 nanoplatelets in situ anchored on a graphene cross-linked conductive network for fast lithium storage.

    Science.gov (United States)

    Wang, Bo; Liu, Anmin; Abdulla, Wael Al; Wang, Dianlong; Zhao, X S

    2015-05-21

    Electron transfer and lithium ion diffusion rates are the key factors limiting the lithium ion storage in anisotropic LiFePO4 electrodes. In this work, we employed a facile solvothermal method to synthesize a "platelet-on-sheet" LiFePO4/graphene composite (LFP@GNs), which is LiFePO4 nanoplatelets in situ grown on graphene sheets with highly oriented (010) facets of LiFePO4 crystals. Such a two-phase contact mode with graphene sheets cross-linked to form a three-dimensional porous network is favourable for both fast lithium ion and electron transports. As a result, the designed LFP@GNs displayed a high rate capability (∼56 mA h g(-1) at 60 C) and long life cycling stability (∼87% capacity retention over 1000 cycles at 10 C). For comparison purposes, samples ex situ modified with graphene (LFP/GNs) as well as pure LiFePO4 platelets (LFP) were also prepared and investigated. More importantly, the obtained LFP@GNs can be used as a basic unit for constructing more complex structures to further improve electrochemical performance, such as coating the exposed LFP surface with a thin layer of carbon to build a C@LFP@GN composite to further enhance its cycling stability (∼98% capacity retention over 1000 cycles at 10 C).

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

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

  16. Network node for peripheral sharing

    International Nuclear Information System (INIS)

    Bobbitt, J.; Johnson, M.

    1977-01-01

    A module which enables several independent computer systems to share the peripherals (graphics display and line printer) of a PDP-11 computer is described. The module requires no software support in the PDP-11

  17. Data driven CAN node reliability assessment for manufacturing system

    Science.gov (United States)

    Zhang, Leiming; Yuan, Yong; Lei, Yong

    2017-01-01

    The reliability of the Controller Area Network(CAN) is critical to the performance and safety of the system. However, direct bus-off time assessment tools are lacking in practice due to inaccessibility of the node information and the complexity of the node interactions upon errors. In order to measure the mean time to bus-off(MTTB) of all the nodes, a novel data driven node bus-off time assessment method for CAN network is proposed by directly using network error information. First, the corresponding network error event sequence for each node is constructed using multiple-layer network error information. Then, the generalized zero inflated Poisson process(GZIP) model is established for each node based on the error event sequence. Finally, the stochastic model is constructed to predict the MTTB of the node. The accelerated case studies with different error injection rates are conducted on a laboratory network to demonstrate the proposed method, where the network errors are generated by a computer controlled error injection system. Experiment results show that the MTTB of nodes predicted by the proposed method agree well with observations in the case studies. The proposed data driven node time to bus-off assessment method for CAN networks can successfully predict the MTTB of nodes by directly using network error event data.

  18. The Holding Power of Anchors

    Indian Academy of Sciences (India)

    as the chain begins to drag along the ground; and it also serves, by lying flat on the ground, to keep the palm set at the correct angle as it buries itself. In stockless anchors there are two digging blades set on opposite sides of the shank, and hinged to it by a horizontal hinge which allows them to set themselves at the correct.

  19. Distributed Power Allocation for Wireless Sensor Network Localization: A Potential Game Approach.

    Science.gov (United States)

    Ke, Mingxing; Li, Ding; Tian, Shiwei; Zhang, Yuli; Tong, Kaixiang; Xu, Yuhua

    2018-05-08

    The problem of distributed power allocation in wireless sensor network (WSN) localization systems is investigated in this paper, using the game theoretic approach. Existing research focuses on the minimization of the localization errors of individual agent nodes over all anchor nodes subject to power budgets. When the service area and the distribution of target nodes are considered, finding the optimal trade-off between localization accuracy and power consumption is a new critical task. To cope with this issue, we propose a power allocation game where each anchor node minimizes the square position error bound (SPEB) of the service area penalized by its individual power. Meanwhile, it is proven that the power allocation game is an exact potential game which has one pure Nash equilibrium (NE) at least. In addition, we also prove the existence of an ϵ -equilibrium point, which is a refinement of NE and the better response dynamic approach can reach the end solution. Analytical and simulation results demonstrate that: (i) when prior distribution information is available, the proposed strategies have better localization accuracy than the uniform strategies; (ii) when prior distribution information is unknown, the performance of the proposed strategies outperforms power management strategies based on the second-order cone program (SOCP) for particular agent nodes after obtaining the estimated distribution of agent nodes. In addition, proposed strategies also provide an instructional trade-off between power consumption and localization accuracy.

  20. Nominal Anchors in the CIS

    OpenAIRE

    Peter M Keller; Thomas J Richardson

    2003-01-01

    Monetary policy has become increasingly important in the countries of the Commonwealth of Independent States (CIS) as fiscal adjustment and structural reforms have taken root. Inflation has been brought down to relatively low levels in almost all of these countries, raising the question of what should be the appropriate nominal anchor at this stage. Formally, almost all CIS countries have floating exchange rate regimes, yet in practice they manage their exchange rates very heavily, perhaps be...

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

  2. Efficient Graph Computation for Node2Vec

    OpenAIRE

    Zhou, Dongyan; Niu, Songjie; Chen, Shimin

    2018-01-01

    Node2Vec is a state-of-the-art general-purpose feature learning method for network analysis. However, current solutions cannot run Node2Vec on large-scale graphs with billions of vertices and edges, which are common in real-world applications. The existing distributed Node2Vec on Spark incurs significant space and time overhead. It runs out of memory even for mid-sized graphs with millions of vertices. Moreover, it considers at most 30 edges for every vertex in generating random walks, causin...

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

  4. Experimental testing of anchoring devices for bottom rails in partially anchored timber frame shear walls

    OpenAIRE

    Caprolu, Giuseppe

    2011-01-01

    Källsner and Girhammar have presented a new plastic design method of wood-framed shear walls at ultimate limit state. This method allows the designer to calculate the load-carrying capacity of shear walls partially anchored, where the leading stud is not anchored against the uplift.The anchorage system of shear walls is provided from anchor bolts and hold downs. Anchor bolts provide horizontal shear continuity between the bottom rail and the foundation. Hold downs are directly connected from ...

  5. Characterization of the C-terminal ER membrane anchor of PTP1B

    International Nuclear Information System (INIS)

    Anderie, Ines; Schulz, Irene; Schmid, Andreas

    2007-01-01

    The tyrosine phosphatase PTP1B is an important regulator of cell function. In living cells PTP1B activity is restricted to the vicinity of the endoplasmic reticulum (ER) by post-translational C-terminal attachment of PTP1B to the ER membrane network. In our study we investigated the membrane anchor of PTP1B by use of EGFP fusion proteins. We demonstrate that the membrane anchor of PTP1B cannot be narrowed down to a unique amino acid sequence with a defined start and stop point but rather is moveable within several amino acids. Removal of up to seven amino acids from the C-terminus, as well as exchange of single amino acids in the putative transmembrane sequence did not influence subcellular localization of PTP1B. With the method of bimolecular fluorescence complementation we could demonstrate dimerization of PTP1B in vivo. Homodimerization was, in contrast to other tail-anchored proteins, not dependent on the membrane anchor. Our data demonstrate that the C-terminal membrane anchor of PTP1B is formed by a combination of a single stretch transmembrane domain (TMD) followed by a tail. TMD and tail length are variable and there are no sequence-specific features. Our data for PTP1B are consistent with a concept that explains the ER membrane anchor of tail-anchored proteins as a physicochemical structure

  6. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... with changing and increasing demands. Two-layer networks consist of one backbone network, which interconnects cluster networks. The clusters consist of nodes and links, which connect the nodes. One node in each cluster is a hub node, and the backbone interconnects the hub nodes of each cluster and thus...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks...

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

  8. An agent-based signal processing in-node environment for real-time human activity monitoring based on wireless body sensor networks

    NARCIS (Netherlands)

    Aiello, F.; Bellifemine, F.L.; Fortino, G.; Galzarano, S.; Gravina, R.

    2011-01-01

    Nowadays wireless body sensor networks (WBSNs) have great potential to enable a broad variety of assisted living applications such as human biophysical/biochemical control and activity monitoring for health care, e-fitness, emergency detection, emotional recognition for social networking, security,

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

  10. Link Anchors in Images: Is there Truth?

    NARCIS (Netherlands)

    Aly, Robin; McGuinness, Kevin; Kleppe, Martijn; Ordelman, Roeland J.F.; O'Connor, Noel; de Jong, Franciska M.G.

    2012-01-01

    While automatic linking in text collections is well understood, little is known about links in images. In this work, we investigate two aspects of anchors, the origin of a link, in images: 1) the requirements of users for such anchors, e.g. the things users would like more information on, and 2)

  11. 76 FR 30301 - Commercial Acquisition; Anchor Tenancy

    Science.gov (United States)

    2011-05-25

    ... NATIONAL AERONAUTICS AND SPACE ADMINISTRATION 48 CFR Part 1812 RIN 2700-AD64 Commercial... consistent with NASA's authority under Section 401 of the Commercial Space Competitiveness Act (CSCA) of 1992. NASA may enter into multi-year anchor tenancy contracts for commercial space goods or services. Anchor...

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

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

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

  15. Node Immunization with Time-Sensitive Restrictions

    Directory of Open Access Journals (Sweden)

    Wen Cui

    2016-12-01

    Full Text Available When we encounter a malicious rumor or an infectious disease outbreak, immunizing k nodes of the relevant network with limited resources is always treated as an extremely effective method. The key challenge is how we can insulate limited nodes to minimize the propagation of those contagious things. In previous works, the best k immunised nodes are selected by learning the initial status of nodes and their strategies even if there is no feedback in the propagation process, which eventually leads to ineffective performance of their solutions. In this paper, we design a novel vaccines placement strategy for protecting much more healthy nodes from being infected by infectious nodes. The main idea of our solution is that we are not only utilizing the status of changing nodes as auxiliary knowledge to adjust our scheme, but also comparing the performance of vaccines in various transmission slots. Thus, our solution has a better chance to get more benefit from these limited vaccines. Extensive experiments have been conducted on several real-world data sets and the results have shown that our algorithm has a better performance than previous works.

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

  17. Functional Connectivity Between Anterior Insula and Key Nodes of Frontoparietal Executive Control and Salience Networks Distinguish Bipolar Depression From Unipolar Depression and Healthy Control Subjects.

    Science.gov (United States)

    Ellard, Kristen K; Zimmerman, Jared P; Kaur, Navneet; Van Dijk, Koene R A; Roffman, Joshua L; Nierenberg, Andrew A; Dougherty, Darin D; Deckersbach, Thilo; Camprodon, Joan A

    2018-05-01

    Patients with bipolar depression are characterized by dysregulation across the full spectrum of mood, differentiating them from patients with unipolar depression. The ability to switch neural resources among the default mode network, salience network, and executive control network (ECN) has been proposed as a key mechanism for adaptive mood regulation. The anterior insula is implicated in the modulation of functional network switching. Differential connectivity between anterior insula and functional networks may provide insights into pathophysiological differences between bipolar and unipolar mood disorders, with implications for diagnosis and treatment. Resting-state functional magnetic resonance imaging data were collected from 98 subjects (35 unipolar, 24 bipolar, and 39 healthy control subjects). Pearson correlations were computed between bilateral insula seed regions and a priori defined target regions from the default mode network, salience network, and ECN. After r-to-z transformation, a one-way multivariate analysis of covariance was conducted to identify significant differences in connectivity between groups. Post hoc pairwise comparisons were conducted and Bonferroni corrections were applied. Receiver-operating characteristics were computed to assess diagnostic sensitivity. Patients with bipolar depression evidenced significantly altered right anterior insula functional connectivity with the inferior parietal lobule of the ECN relative to patients with unipolar depression and control subjects. Right anterior insula-inferior parietal lobule connectivity significantly discriminated patients with bipolar depression. Impaired functional connectivity between the anterior insula and the inferior parietal lobule of the ECN distinguishes patients with bipolar depression from those with unipolar depression and healthy control subjects. This finding highlights a pathophysiological mechanism with potential as a therapeutic target and a clinical biomarker for bipolar

  18. Improving Network Performance with Affinity based Mobility Model in Opportunistic Network

    OpenAIRE

    Suvadip Batabyal; Parama Bhaumik

    2012-01-01

    Opportunistic network is a type of Delay Tolerant Network which is characterized by intermittent connectivity amongst the nodes and communication largely depends upon the mobility of the participating nodes. The network being highly dynamic, traditional MANET protocols cannot be applied and the nodes must adhere to store-carry-forward mechanism. Nodes do not have the information about the network topology, number of participating nodes and the location of the destination node. Hence, message ...

  19. Intelligent Mission Controller Node

    National Research Council Canada - National Science Library

    Perme, David

    2002-01-01

    The goal of the Intelligent Mission Controller Node (IMCN) project was to improve the process of translating mission taskings between real-world Command, Control, Communications, Computers, and Intelligence (C41...

  20. Lymph node culture

    Science.gov (United States)

    Culture - lymph node ... or viruses grow. This process is called a culture. Sometimes, special stains are also used to identify specific cells or microorganisms before culture results are available. If needle aspiration does not ...

  1. Integrated network analysis identifies fight-club nodes as a class of hubs encompassing key putative switch genes that induce major transcriptome reprogramming during grapevine development.

    Science.gov (United States)

    Palumbo, Maria Concetta; Zenoni, Sara; Fasoli, Marianna; Massonnet, Mélanie; Farina, Lorenzo; Castiglione, Filippo; Pezzotti, Mario; Paci, Paola

    2014-12-01

    We developed an approach that integrates different network-based methods to analyze the correlation network arising from large-scale gene expression data. By studying grapevine (Vitis vinifera) and tomato (Solanum lycopersicum) gene expression atlases and a grapevine berry transcriptomic data set during the transition from immature to mature growth, we identified a category named "fight-club hubs" characterized by a marked negative correlation with the expression profiles of neighboring genes in the network. A special subset named "switch genes" was identified, with the additional property of many significant negative correlations outside their own group in the network. Switch genes are involved in multiple processes and include transcription factors that may be considered master regulators of the previously reported transcriptome remodeling that marks the developmental shift from immature to mature growth. All switch genes, expressed at low levels in vegetative/green tissues, showed a significant increase in mature/woody organs, suggesting a potential regulatory role during the developmental transition. Finally, our analysis of tomato gene expression data sets showed that wild-type switch genes are downregulated in ripening-deficient mutants. The identification of known master regulators of tomato fruit maturation suggests our method is suitable for the detection of key regulators of organ development in different fleshy fruit crops. © 2014 American Society of Plant Biologists. All rights reserved.

  2. Transaction processing in the common node of a distributed function laboratory computer system

    International Nuclear Information System (INIS)

    Stubblefield, F.W.; Dimmler, D.G.

    1975-01-01

    A computer network architecture consisting of a common node processor for managing peripherals and files and a number of private node processors for laboratory experiment control is briefly reviewed. Central to the problem of private node-common node communication is the concept of a transaction. The collection of procedures and the data structure associated with a transaction are described. The common node properties assigned to a transaction and procedures required for its complete processing are discussed. (U.S.)

  3. Dynamic Frequency Control in Power Networks

    OpenAIRE

    Zhao, Changhong; Mallada Garcia, Enrique; Low, Steven H.

    2016-01-01

    Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the proces...

  4. Anchoring effects on early autobiographical memories.

    Science.gov (United States)

    Greenberg, Daniel L; Bishara, Anthony J; Mugayar-Baldocchi, Marino A

    2017-10-01

    Studies of childhood memory typically show that our earliest memories come from between three and four years of age. This finding is not universal, however. The age estimate varies across cultures and is affected by social influences. Research from the judgments and decision-making literature suggests that these estimates might also involve a judgment under uncertainty. Therefore, they might be susceptible to less social influences such as heuristics and biases. To investigate this possibility, we conducted two experiments that used anchoring paradigms to influence participants' estimates of their age during early autobiographical memories. In Experiment 1, participants answered either a high-anchor or a low-anchor question, and were warned that the anchor was uninformative; they went on to estimate their age during their earliest autobiographical memory. In Experiment 2, we replicated Experiment 1 and extended the design to examine additional early autobiographical memories. In both experiments, participants in the low-anchor condition gave earlier age estimates than those in the high-anchor condition. These results provide new insights into the methods used to investigate autobiographical memory. Moreover, they show that reports of early autobiographical memories can be influenced by a relatively light touch - a change to a single digit in a single question.

  5. Improving performance by anchoring movement and "nerves".

    Science.gov (United States)

    Iso-Ahola, Seppo E; Dotson, Charles O; Jagodinsky, Adam E; Clark, Lily C; Smallwood, Lorraine L; Wilburn, Christopher; Weimar, Wendi H; Miller, Matthew W

    2016-10-01

    Golf's governing bodies' recent decision to ban all putting styles "anchoring one end of the club against the body" bridges an important practical problem with psychological theory. We report the first experiment testing whether anchoring provides technical and/or psychological advantage in competitive performance. Many "greats" of professional golf from Arnold Palmer and Jack Nicklaus to Tiger Woods have argued against anchoring, believing that it takes "nerves" out of competitive performance and therefore artificially levels the playing field. To shed more light on the issue, we tested participants' performance with anchored and unanchored putters under low and high pressure when controlling for the putter length. We found no statistically significant evidence for a technical advantage due to anchoring but a clear psychological advantage: participants who anchored their putters significantly outperformed unanchored counterparts under high, but not low, pressure. Results provide tentative evidence for the ban's justification from a competitive standpoint. However, before any definite conclusions can be made, more research is needed when using high-level golfers. Copyright © 2016 Elsevier B.V. All rights reserved.

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

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

  8. The Use of Comics-Based Cases in Anchored Instruction

    Science.gov (United States)

    Kneller, Matthew F.

    2009-01-01

    The primary purpose of this research was to understand how comics fulfill the role of anchor in an anchored instruction learning environment. Anchored instruction addresses the inert knowledge problem through the use of realistic multimedia stories, or "anchors," that embed a problem and the necessary data to solve it within the narrative. In the…

  9. An earth anchor system: installation and design guide.

    Science.gov (United States)

    R.L. Copstead; D.D. Studier

    1990-01-01

    A system for anchoring the guylines and skylines of cable yarding equipment is presented. A description of three types of tipping plate anchors is given. Descriptions of the installation equipment and methods specific to each type are given. Procedures for determining the correct number of anchors to install are included, as are guidelines for installing the anchors so...

  10. 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 as seroma and surgical-site infection (SSI) have yet to be asserted. METHODS: All malignant melanoma patients treated with sentinel lymph node biopsy (SNB) and/or complete lymph node dissection (CLND) in the axilla or groin between January 2008 and December 2014 were retrospectively identified. Identified...

  11. Thoracic lymph node station recognition on CT images based on automatic anatomy recognition with an optimal parent strategy

    Science.gov (United States)

    Xu, Guoping; Udupa, Jayaram K.; Tong, Yubing; Cao, Hanqiang; Odhner, Dewey; Torigian, Drew A.; Wu, Xingyu

    2018-03-01

    Currently, there are many papers that have been published on the detection and segmentation of lymph nodes from medical images. However, it is still a challenging problem owing to low contrast with surrounding soft tissues and the variations of lymph node size and shape on computed tomography (CT) images. This is particularly very difficult on low-dose CT of PET/CT acquisitions. In this study, we utilize our previous automatic anatomy recognition (AAR) framework to recognize the thoracic-lymph node stations defined by the International Association for the Study of Lung Cancer (IASLC) lymph node map. The lymph node stations themselves are viewed as anatomic objects and are localized by using a one-shot method in the AAR framework. Two strategies have been taken in this paper for integration into AAR framework. The first is to combine some lymph node stations into composite lymph node stations according to their geometrical nearness. The other is to find the optimal parent (organ or union of organs) as an anchor for each lymph node station based on the recognition error and thereby find an overall optimal hierarchy to arrange anchor organs and lymph node stations. Based on 28 contrast-enhanced thoracic CT image data sets for model building, 12 independent data sets for testing, our results show that thoracic lymph node stations can be localized within 2-3 voxels compared to the ground truth.

  12. Anchors as Semantic Primes in Value Construction: An EEG Study of the Anchoring Effect.

    Directory of Open Access Journals (Sweden)

    Qingguo Ma

    Full Text Available Previous research regarding anchoring effects has demonstrated that human judgments are often assimilated to irrelevant information. Studies have demonstrated that anchors influence the economic valuation of various products and experiences; however, the cognitive explanations of this effect remain controversial, and its neural mechanisms have rarely been explored. In the current study, we conducted an electroencephalography (EEG experiment to investigate the anchoring effect on willingness to accept (WTA for an aversive hedonic experience and the role of anchors in this judgment heuristic. The behavioral results demonstrated that random numbers affect participants' WTA for listening to pieces of noise. The participants asked for higher pay after comparing their WTA with higher numbers. The EEG results indicated that anchors also influenced the neural underpinnings of the valuation process. Specifically, when a higher anchor number was drawn, larger P2 and late positive potential amplitudes were elicited, reflecting the anticipation of more intensive pain from the subsequent noise. Moreover, higher anchors induced a stronger theta band power increase compared with lower anchors when subjects listened to the noises, indicating that the participants felt more unpleasant during the actual experience of the noise. The levels of unpleasantness during both anticipation and experience were consistent with the semantic information implied by the anchors. Therefore, these data suggest that a semantic priming process underlies the anchoring effect in WTA. This study provides proof for the robustness of the anchoring effect and neural evidence of the semantic priming model. Our findings indicate that activated contextual information, even seemingly irrelevant, can be embedded in the construction of economic value in the brain.

  13. Two Phases Authentication Level (TPAL) protocol for nodes ...

    African Journals Online (AJOL)

    ... node may contain sensitive informations such as military data and monitoring data. ... LLN is a kind of Internet of Things (IoT) network with limited power source ... Current authentication Internet protocols cannot be adopted directly into LLN ...

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

  15. An open data repository for steady state analysis of a 100-node electricity distribution network with moderate connection of renewable energy sources.

    Science.gov (United States)

    Lazarou, Stavros; Vita, Vasiliki; Ekonomou, Lambros

    2018-02-01

    The data of this article represent a real electricity distribution network on twenty kilovolts (20 kV) at medium voltage level of the Hellenic electricity distribution system [1]. This network has been chosen as suitable for smart grid analysis. It demonstrates moderate penetration of renewable sources and it has capability in part of time for reverse power flows. It is suitable for studies of load aggregation, storage, demand response. It represents a rural line of fifty-five kilometres (55 km) total length, a typical length for this type. It serves forty-five (45) medium to low voltage transformers and twenty-four (24) connections to photovoltaic plants. The total installed load capacity is twelve mega-volt-ampere (12 MVA), however the maximum observed load is lower. The data are ready to perform load flow simulation on Matpower [2] for the maximum observed load power on the half production for renewables. The simulation results and processed data for creating the source code are also provided on the database available at http://dx.doi.org/10.7910/DVN/1I6MKU.

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

  17. Modeling Network Interdiction Tasks

    Science.gov (United States)

    2015-09-17

    118 xiii Table Page 36 Computation times for weighted, 100-node random networks for GAND Approach testing in Python ...in Python . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 38 Accuracy measures for weighted, 100-node random networks for GAND...networks [15:p. 1]. A common approach to modeling network interdiction is to formulate the problem in terms of a two-stage strategic game between two

  18. Active sensing and its application to sensor node reconfiguration.

    Science.gov (United States)

    Lee, Sooyong

    2014-10-08

    This paper presents a perturbation/correlation-based active sensing method and its application to sensor node configuration for environment monitoring. Sensor networks are widely used as data measurement tools, especially in dangerous environments. For large scale environment monitoring, a large number of nodes is required. For optimal measurements, the placement of nodes is very important. Nonlinear spring force-based configuration is introduced. Perturbation/correlation-based estimation of the gradient is developed and it is much more robust because it does not require any differentiation. An algorithm for tuning the stiffness using the estimated gradient for node reconfiguration is presented. The performance of the proposed algorithm is discussed with simulation results.

  19. Erasure code-based low storage blockchain node

    OpenAIRE

    Perard, Doriane; Lacan, Jérôme; Bachy, Yann; Detchart, Jonathan

    2018-01-01

    The concept of a decentralized ledger usually implies that each node of a blockchain network stores the entire blockchain. However, in the case of popular blockchains, which each weigh several hundreds of GB, the large amount of data to be stored can incite new or low-capacity nodes to run lightweight clients. Such nodes do not participate to the global storage effort and can result in a centralization of the blockchain by very few nodes, which is contrary to the basic concepts of a blockchai...

  20. Instant node package module

    CERN Document Server

    Ali, Juzer

    2013-01-01

    Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. A practical exploration of the lifecycle of creating node modules as well as learning all of the top features that npm has to offer.Intended for readers who want to create their first node.js modules. The programming paradigm of JavaScript is not covered so a foundation in these concepts would be beneficial.

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

  2. Career anchors and learning plan (part one

    Directory of Open Access Journals (Sweden)

    Daniela Brečko

    2006-12-01

    Full Text Available The article is divided into three parts. The first part concentrates on how important career is for an individual, organization and society. The author establishes that understanding of career has changed dramatically and does not only refer to climbing up the career ladder, but also moving off or even down the career ladder. The notion of career, as a lifelong and professional path, encompasses all aspects of human personality and their roles acquired through one's life. On basis of vast and longitudinal research, where the author has studied career anchors of individuals, it is the objective of the author to find out on basis of what grounds do the individuals decide to take certain directions in their careers and how learning contributes to such decisions. As a source the author has used Shein's theory of career anchors. Part one describes in greater detail 8 different career anchors and introduces their main features with the findings of the research, which refer to the analysis of professions (work positions and established career anchors. The author thus verifies the hypothesis that career anchors do exist in our area.

  3. Edge- and Node-Disjoint Paths in P Systems

    Directory of Open Access Journals (Sweden)

    Michael J. Dinneen

    2010-10-01

    Full Text Available In this paper, we continue our development of algorithms used for topological network discovery. We present native P system versions of two fundamental problems in graph theory: finding the maximum number of edge- and node-disjoint paths between a source node and target node. We start from the standard depth-first-search maximum flow algorithms, but our approach is totally distributed, when initially no structural information is available and each P system cell has to even learn its immediate neighbors. For the node-disjoint version, our P system rules are designed to enforce node weight capacities (of one, in addition to edge capacities (of one, which are not readily available in the standard network flow algorithms.

  4. Silver nanoparticles anchored reduced graphene oxide for enhanced electrocatalytic activity towards methanol oxidation

    Science.gov (United States)

    Kumar, Sanjeev; Mahajan, Mani; Singh, Rajinder; Mahajan, Aman

    2018-02-01

    In this report, silver nanoparticles (Ag NPs) anchored reduced graphene oxide (rGO) sheets (rGO/Ag) nanohybrid has been explored as anode material in direct methanol fuel cells (DMFCs). The synthesized rGO/Ag nanohybrid is characterized by XRD, XPS, FTIR spectroscopy and HRTEM techniques. Cyclic voltammograms demonstrate that the rGO/Ag nanohybrid exhibits higher electrocatalytic activity in comparison to rGO sheets for methanol oxidation reaction (MOR). This enhancement is attributed to the synergetic effect produced by the presence of more active sites provided by Ag NPs anchored on a conducting network of large surface area rGO sheets.

  5. Error Control in Distributed Node Self-Localization

    Directory of Open Access Journals (Sweden)

    Ying Zhang

    2008-03-01

    Full Text Available Location information of nodes in an ad hoc sensor network is essential to many tasks such as routing, cooperative sensing, and service delivery. Distributed node self-localization is lightweight and requires little communication overhead, but often suffers from the adverse effects of error propagation. Unlike other localization papers which focus on designing elaborate localization algorithms, this paper takes a different perspective, focusing on the error propagation problem, addressing questions such as where localization error comes from and how it propagates from node to node. To prevent error from propagating and accumulating, we develop an error-control mechanism based on characterization of node uncertainties and discrimination between neighboring nodes. The error-control mechanism uses only local knowledge and is fully decentralized. Simulation results have shown that the active selection strategy significantly mitigates the effect of error propagation for both range and directional sensors. It greatly improves localization accuracy and robustness.

  6. Ultimate load capacities of expansion anchor bolts

    International Nuclear Information System (INIS)

    Czarnecki, R.M.; Manrique, M.A.; Samaddar, S.K.

    1993-01-01

    A summary of available experimental expansion anchor bolt test data is presented. These data were collected as part of programs by the nuclear industry to address generic issues related to verification of seismic adequacy of equipment in nuclear power plants. Some of the data presented are suitable for use in seismic probabilistic risk assessments. For example, mean values of ultimate strength, along with their standard deviation and coefficients of variation, for a range of most typical expansion anchor bolt sizes are presented. Effects of interaction between shear and tension, edge distance, spacing, and cracking of the concrete are presented in a manner that is more suitable for use in deterministic evaluations. Related industry programs to derive anchor bolt capacities are briefly discussed. Recommendations for areas of further investigation are also presented

  7. Anchoring Proteins as Regulators of Signaling Pathways

    Science.gov (United States)

    Perino, Alessia; Ghigo, Alessandra; Scott, John D.; Hirsch, Emilio

    2012-01-01

    Spatial and temporal organization of signal transduction is coordinated through the segregation of signaling enzymes in selected cellular compartments. This highly evolved regulatory mechanism ensures the activation of selected enzymes only in the vicinity of their target proteins. In this context, cAMP-responsive triggering of protein kinase A is modulated by a family of scaffold proteins referred to as A-kinase anchoring proteins. A-kinase anchoring proteins form the core of multiprotein complexes and enable simultaneous but segregated cAMP signaling events to occur in defined cellular compartments. In this review we will focus on the description of A-kinase anchoring protein function in the regulation of cardiac physiopathology. PMID:22859670

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

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

  10. Ultraweak azimuthal anchoring of a nematic liquid crystal on a planar orienting photopolymer

    International Nuclear Information System (INIS)

    Nespoulous, Mathieu; Blanc, Christophe; Nobili, Maurizio

    2007-01-01

    The search of weak anchoring is an important issue for a whole class of liquid crystal displays. In this paper we present an orienting layer showing unreached weak planar azimuthal anchoring for 4-n-pentyl-4 ' -cyanobiphenyl nematic liquid crystal (5CB). Azimuthal extrapolation lengths as large as 80 μm are easily obtained. Our layers are made with the commercial photocurable polymer Norland optical adhesive 60. The anisotropy of the film is induced by the adsorption of oriented liquid crystal molecules under a 2 T magnetic field applied parallel to the surfaces. We use the width of surface π-walls and a high-field electro-optical method to measure, respectively, the azimuthal and the zenithal anchorings. The azimuthal anchoring is extremely sensitive to the ultraviolet (UV) dose and it also depends on the magnetic field application duration. On the opposite, the zenithal anchoring is only slightly sensitive to the preparation parameters. All these results are discussed in terms of the adsorption/desorption mechanisms of the liquid crystal molecules on the polymer layer and of the flexibility of the polymer network

  11. Developmental maturation of dynamic causal control signals in higher-order cognition: a neurocognitive network model.

    Directory of Open Access Journals (Sweden)

    Kaustubh Supekar

    2012-02-01

    Full Text Available Cognitive skills undergo protracted developmental changes resulting in proficiencies that are a hallmark of human cognition. One skill that develops over time is the ability to problem solve, which in turn relies on cognitive control and attention abilities. Here we use a novel multimodal neurocognitive network-based approach combining task-related fMRI, resting-state fMRI and diffusion tensor imaging (DTI to investigate the maturation of control processes underlying problem solving skills in 7-9 year-old children. Our analysis focused on two key neurocognitive networks implicated in a wide range of cognitive tasks including control: the insula-cingulate salience network, anchored in anterior insula (AI, ventrolateral prefrontal cortex and anterior cingulate cortex, and the fronto-parietal central executive network, anchored in dorsolateral prefrontal cortex and posterior parietal cortex (PPC. We found that, by age 9, the AI node of the salience network is a major causal hub initiating control signals during problem solving. Critically, despite stronger AI activation, the strength of causal regulatory influences from AI to the PPC node of the central executive network was significantly weaker and contributed to lower levels of behavioral performance in children compared to adults. These results were validated using two different analytic methods for estimating causal interactions in fMRI data. In parallel, DTI-based tractography revealed weaker AI-PPC structural connectivity in children. Our findings point to a crucial role of AI connectivity, and its causal cross-network influences, in the maturation of dynamic top-down control signals underlying cognitive development. Overall, our study demonstrates how a unified neurocognitive network model when combined with multimodal imaging enhances our ability to generalize beyond individual task-activated foci and provides a common framework for elucidating key features of brain and cognitive

  12. Comparison of Suture-Based Anchors and Traditional Bioabsorbable Anchors in Foot and Ankle Surgery.

    Science.gov (United States)

    Hembree, W Chad; Tsai, Michael A; Parks, Brent G; Miller, Stuart D

    We compared the pullout strength of a suture-based anchor versus a bioabsorbable anchor in the distal fibula and calcaneus and evaluated the relationship between bone mineral density and peak load to failure. Eight paired cadaveric specimens underwent a modified Broström procedure and Achilles tendon reattachment. The fibula and calcaneus in the paired specimens received either a suture-based anchor or a bioabsorbable suture anchor. The fibular and calcaneal specimens were loaded to failure, defined as a substantial decrease in the applied load or pullout from the bone. In the fibula, the peak load to failure was significantly greater with the suture-based versus the bioabsorbable anchors (133.3 ± 41.8 N versus 76.8 ± 35.3 N; p = .002). No significant difference in load with 5 mm of displacement was found between the 2 groups. In the calcaneus, no difference in the peak load to failure was found between the 2 groups, and the peak load to failure with 5 mm of displacement was significantly lower with the suture-based than with the bioabsorbable anchors (52.2 ± 9.8 N versus 75.9 ± 12.4 N; p = .003). Bone mineral density and peak load to failure were significantly correlated in the fibula with the suture-based anchor. An innovative suture-based anchor had a greater peak load to failure compared with a bioabsorbable anchor in the fibula. In the calcaneus, the load at 5 mm of displacement was significantly lower in the suture-based than in the bioabsorbable group. The correlation findings might indicate the need for a cortical bone shelf with the suture-based anchor. Suture-based anchors could be a viable alternative to bioabsorbable anchors for certain foot and ankle procedures. Copyright © 2016 American College of Foot and Ankle Surgeons. Published by Elsevier Inc. All rights reserved.

  13. Involved Node Radiation Therapy

    DEFF Research Database (Denmark)

    Maraldo, Maja V; Aznar, Marianne C; Vogelius, Ivan R

    2012-01-01

    PURPOSE: The involved node radiation therapy (INRT) strategy was introduced for patients with Hodgkin lymphoma (HL) to reduce the risk of late effects. With INRT, only the originally involved lymph nodes are irradiated. We present treatment outcome in a retrospective analysis using this strategy...... to 36 Gy). Patients attended regular follow-up visits until 5 years after therapy. RESULTS: The 4-year freedom from disease progression was 96.4% (95% confidence interval: 92.4%-100.4%), median follow-up of 50 months (range: 4-71 months). Three relapses occurred: 2 within the previous radiation field......, and 1 in a previously uninvolved region. The 4-year overall survival was 94% (95% confidence interval: 88.8%-99.1%), median follow-up of 58 months (range: 4-91 months). Early radiation therapy toxicity was limited to grade 1 (23.4%) and grade 2 (13.8%). During follow-up, 8 patients died, none from HL, 7...

  14. Monogenean anchor morphometry: systematic value, phylogenetic signal, and evolution

    Science.gov (United States)

    Soo, Oi Yoon Michelle; Tan, Wooi Boon; Lim, Lee Hong Susan

    2016-01-01

    Background. Anchors are one of the important attachment appendages for monogenean parasites. Common descent and evolutionary processes have left their mark on anchor morphometry, in the form of patterns of shape and size variation useful for systematic and evolutionary studies. When combined with morphological and molecular data, analysis of anchor morphometry can potentially answer a wide range of biological questions. Materials and Methods. We used data from anchor morphometry, body size and morphology of 13 Ligophorus (Monogenea: Ancyrocephalidae) species infecting two marine mugilid (Teleostei: Mugilidae) fish hosts: Moolgarda buchanani (Bleeker) and Liza subviridis (Valenciennes) from Malaysia. Anchor shape and size data (n = 530) were generated using methods of geometric morphometrics. We used 28S rRNA, 18S rRNA, and ITS1 sequence data to infer a maximum likelihood phylogeny. We discriminated species using principal component and cluster analysis of shape data. Adams’s Kmult was used to detect phylogenetic signal in anchor shape. Phylogeny-correlated size and shape changes were investigated using continuous character mapping and directional statistics, respectively. We assessed morphological constraints in anchor morphometry using phylogenetic regression of anchor shape against body size and anchor size. Anchor morphological integration was studied using partial least squares method. The association between copulatory organ morphology and anchor shape and size in phylomorphospace was used to test the Rohde-Hobbs hypothesis. We created monogeneaGM, a new R package that integrates analyses of monogenean anchor geometric morphometric data with morphological and phylogenetic data. Results. We discriminated 12 of the 13 Ligophorus species using anchor shape data. Significant phylogenetic signal was detected in anchor shape. Thus, we discovered new morphological characters based on anchor shaft shape, the length between the inner root point and the outer root

  15. Analytical and Algorithmic Approaches to Determine the Number of Sensor Nodes for Minimum Power Consumption in LWSNs

    Directory of Open Access Journals (Sweden)

    Ali Soner Kilinc

    2017-08-01

    Full Text Available A Linear Wireless Sensor Network (LWSN is a kind of wireless sensor network where the nodes are deployed in a line. Since the sensor nodes are energy restricted, energy efficiency becomes one of the most significant design issues for LWSNs as well as wireless sensor networks. With the proper deployment, the power consumption could be minimized by adjusting the distance between the sensor nodes which is known as hop length. In this paper, analytical and algorithmic approaches are presented to determine the number of hops and sensor nodes for minimum power consumption in a linear wireless sensor network including equidistantly placed sensor nodes.

  16. Node web development

    CERN Document Server

    Herron, David

    2013-01-01

    Presented in a simple, step-by-step format, this book is an introduction to web development with Node.This book is for anybody looking for an alternative to the ""P"" languages (Perl, PHP, Python), or anyone looking for a new paradigm of server-side application development.The reader should have at least a rudimentary understanding of JavaScript and web application development.

  17. Chemical biology of Glycosylphosphatidylinositol (GPI) anchors

    Indian Academy of Sciences (India)

    Admin

    CSIR-IIIM. Chemical biology of. Glycosylphosphatidylinositol (GPI) anchors. Ram Vishwakarma. CSIR-Indian Institute of Integrative Medicine, Jammu. N ti l I tit t f I l. N. D lhi. National Institute of Immunology, New Delhi. Piramal Life Sciences Ltd, Mumbai ...

  18. Method and apparatus for dismantling mechanical anchors

    Energy Technology Data Exchange (ETDEWEB)

    Dubovskiy, Yu P; Chendev, F S; Gritsayuk, B I; Gubin, N I; Osipov, S P

    1982-01-01

    This apparatus is designed to reduce the amount of labor required to dismantle mechanical anchors while at the same time lowering expenditures for lumber. Longwall beams and timber skips are used to support the cap and any fractured rock faces. The apparatus itself has grooves, vertical guides, and a drive system to position the longwall beams.

  19. Final report for the mobile node authentication LDRD project.

    Energy Technology Data Exchange (ETDEWEB)

    Michalski, John T.; Lanzone, Andrew J.

    2005-09-01

    In hostile ad hoc wireless communication environments, such as battlefield networks, end-node authentication is critical. In a wired infrastructure, this authentication service is typically facilitated by a centrally-located ''authentication certificate generator'' such as a Certificate Authority (CA) server. This centralized approach is ill-suited to meet the needs of mobile ad hoc networks, such as those required by military systems, because of the unpredictable connectivity and dynamic routing. There is a need for a secure and robust approach to mobile node authentication. Current mechanisms either assign a pre-shared key (shared by all participating parties) or require that each node retain a collection of individual keys that are used to communicate with other individual nodes. Both of these approaches have scalability issues and allow a single compromised node to jeopardize the entire mobile node community. In this report, we propose replacing the centralized CA with a distributed CA whose responsibilities are shared between a set of select network nodes. To that end, we develop a protocol that relies on threshold cryptography to perform the fundamental CA duties in a distributed fashion. The protocol is meticulously defined and is implemented it in a series of detailed models. Using these models, mobile wireless scenarios were created on a communication simulator to test the protocol in an operational environment and to gather statistics on its scalability and performance.

  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.

  1. Influence of Anchoring on Burial Depth of Submarine Pipelines.

    Directory of Open Access Journals (Sweden)

    Yuan Zhuang

    Full Text Available Since the beginning of the twenty-first century, there has been widespread construction of submarine oil-gas transmission pipelines due to an increase in offshore oil exploration. Vessel anchoring operations are causing more damage to submarine pipelines due to shipping transportation also increasing. Therefore, it is essential that the influence of anchoring on the required burial depth of submarine pipelines is determined. In this paper, mathematical models for ordinary anchoring and emergency anchoring have been established to derive an anchor impact energy equation for each condition. The required effective burial depth for submarine pipelines has then been calculated via an energy absorption equation for the protection layer covering the submarine pipelines. Finally, the results of the model calculation have been verified by accident case analysis, and the impact of the anchoring height, anchoring water depth and the anchor weight on the required burial depth of submarine pipelines has been further analyzed.

  2. Stone anchors from the Okhamandal region, Gujarat Coast, India

    Digital Repository Service at National Institute of Oceanography (India)

    Sundaresh; Gaur, A.S.; Gudigar, P.; Tripati, S.; Vora, K.H.; Bandodkar, S.N.

    During marine archaeological explorations since 1983, off Dwarka, a large number of stone anchors were discovered and dated to 1400 BC, comparing with anchors found in Mediterranean waters. In recent archaeological explorations off Dwarka, Bet...

  3. Influence of Anchoring on Burial Depth of Submarine Pipelines.

    Science.gov (United States)

    Zhuang, Yuan; Li, Yang; Su, Wei

    2016-01-01

    Since the beginning of the twenty-first century, there has been widespread construction of submarine oil-gas transmission pipelines due to an increase in offshore oil exploration. Vessel anchoring operations are causing more damage to submarine pipelines due to shipping transportation also increasing. Therefore, it is essential that the influence of anchoring on the required burial depth of submarine pipelines is determined. In this paper, mathematical models for ordinary anchoring and emergency anchoring have been established to derive an anchor impact energy equation for each condition. The required effective burial depth for submarine pipelines has then been calculated via an energy absorption equation for the protection layer covering the submarine pipelines. Finally, the results of the model calculation have been verified by accident case analysis, and the impact of the anchoring height, anchoring water depth and the anchor weight on the required burial depth of submarine pipelines has been further analyzed.

  4. Status of lymph node staging

    NARCIS (Netherlands)

    Nieweg, O. E.; Estourgie, S. H.; Deurloo, E. E.; Rutgers, E. J. Th; Kroon, B. B. R.

    2002-01-01

    Sentinel node biopsy has the potential to provide more accurate staging information than axillary node dissection. Given the considerable morbidity of axillary node dissection this less invasive approach is attractive. However, there are a number of issues to be resolved before the best technique of

  5. Bayesian Networks for Modeling Dredging Decisions

    Science.gov (United States)

    2011-10-01

    years, that algorithms have been developed to solve these problems efficiently. Most modern Bayesian network software uses junction tree (a.k.a. join... software was used to develop the network . This is by no means an exhaustive list of Bayesian network applications, but it is representative of recent...characteristic node (SCN), state- defining node ( SDN ), effect node (EFN), or value node. The five types of nodes can be described as follows: ERDC/EL TR-11

  6. Functional Testing of Wireless Sensor Node Designs

    DEFF Research Database (Denmark)

    Virk, Kashif M.; Madsen, Jan

    2007-01-01

    Wireless sensor networks are networked embedded computer systems with stringent power, performance, cost and form-factor requirements along with numerous other constraints related to their pervasiveness and ubiquitousness. Therefore, only a systematic design methdology coupled with an efficient...... test approach can enable their conformance to design and deployment specifications. We discuss off-line, hierarchical, functional testing of complete wireless sensor nodes containing configurable logic through a combination of FPGA-based board test and Software-Based Self-Test (SBST) techniques...

  7. Synchronization of networks

    Indian Academy of Sciences (India)

    We study the synchronization of coupled dynamical systems on networks. The dynamics is governed by a local nonlinear oscillator for each node of the network and interactions connecting different nodes via the links of the network. We consider existence and stability conditions for both single- and multi-cluster ...

  8. Bluetooth-based wireless sensor networks

    Science.gov (United States)

    You, Ke; Liu, Rui Qiang

    2007-11-01

    In this work a Bluetooth-based wireless sensor network is proposed. In this bluetooth-based wireless sensor networks, information-driven star topology and energy-saved mode are used, through which a blue master node can control more than seven slave node, the energy of each sensor node is reduced and secure management of each sensor node is improved.

  9. AnchorDock: Blind and Flexible Anchor-Driven Peptide Docking.

    Science.gov (United States)

    Ben-Shimon, Avraham; Niv, Masha Y

    2015-05-05

    The huge conformational space stemming from the inherent flexibility of peptides is among the main obstacles to successful and efficient computational modeling of protein-peptide interactions. Current peptide docking methods typically overcome this challenge using prior knowledge from the structure of the complex. Here we introduce AnchorDock, a peptide docking approach, which automatically targets the docking search to the most relevant parts of the conformational space. This is done by precomputing the free peptide's structure and by computationally identifying anchoring spots on the protein surface. Next, a free peptide conformation undergoes anchor-driven simulated annealing molecular dynamics simulations around the predicted anchoring spots. In the challenging task of a completely blind docking test, AnchorDock produced exceptionally good results (backbone root-mean-square deviation ≤ 2.2Å, rank ≤15) for 10 of 13 unbound cases tested. The impressive performance of AnchorDock supports a molecular recognition pathway that is driven via pre-existing local structural elements. Copyright © 2015 Elsevier Ltd. All rights reserved.

  10. Lymph node detection in IASLC-defined zones on PET/CT images

    Science.gov (United States)

    Song, Yihua; Udupa, Jayaram K.; Odhner, Dewey; Tong, Yubing; Torigian, Drew A.

    2016-03-01

    Lymph node detection is challenging due to the low contrast between lymph nodes as well as surrounding soft tissues and the variation in nodal size and shape. In this paper, we propose several novel ideas which are combined into a system to operate on positron emission tomography/ computed tomography (PET/CT) images to detect abnormal thoracic nodes. First, our previous Automatic Anatomy Recognition (AAR) approach is modified where lymph node zones predominantly following International Association for the Study of Lung Cancer (IASLC) specifications are modeled as objects arranged in a hierarchy along with key anatomic anchor objects. This fuzzy anatomy model built from diagnostic CT images is then deployed on PET/CT images for automatically recognizing the zones. A novel globular filter (g-filter) to detect blob-like objects over a specified range of sizes is designed to detect the most likely locations and sizes of diseased nodes. Abnormal nodes within each automatically localized zone are subsequently detected via combined use of different items of information at various scales: lymph node zone model poses found at recognition indicating the geographic layout at the global level of node clusters, g-filter response which hones in on and carefully selects node-like globular objects at the node level, and CT and PET gray value but within only the most plausible nodal regions for node presence at the voxel level. The models are built from 25 diagnostic CT scans and refined for an object hierarchy based on a separate set of 20 diagnostic CT scans. Node detection is tested on an additional set of 20 PET/CT scans. Our preliminary results indicate node detection sensitivity and specificity at around 90% and 85%, respectively.

  11. Career Paths, Images and Anchors: A Study with Brazilian Professionals

    Science.gov (United States)

    Kilimnik, Zelia Miranda; de Oliveira, Luiz Claudio Vieira; Sant'anna, Anderson De Souza; Barros, Delba Teixeira Rodrigues

    2011-01-01

    This article analyses career anchors changes associated to images and professionals trajectories. Its main question: Do anchors careers change through time? We conducted twelve interviews involving professionals from the Administration Area, applying Schein's Career Anchors Inventory (1993). We did the same two years later. In both of them, the…

  12. Experimental Research on Destruction Mode and Anchoring Performance of Carbon Fiber Phyllostachys pubescens Anchor Rod with Different Forms

    Directory of Open Access Journals (Sweden)

    Wang Yulan

    2018-01-01

    Full Text Available The anchoring technology is extensively applied in reinforcing protection of the earth relics. Now that no specification is available for different new anchor rods in earth relics protection due to diversified destruction modes of earth relics and complexity of engineering technology conditions, it is urgent to guide reinforcing design and construction with a complete detailed anchor rod research document. With the new carbon fiber Phyllostachys pubescens anchor rod as the research object, six lots of in situ tests are designed to, respectively, study the destruction mode and anchoring performance of the carbon fiber Phyllostachys pubescens anchor rod under different anchor length L, anchor rod diameter D, bore diameter H, grouting material S, rib spacing R, and inclination angle A in this paper. By studying load shift curve experiment in drawing of the anchor rod, the destruction mode and ultimate bearing capacity of the carbon fiber Phyllostachys pubescens anchor rod in different experiment lots are obtained, and the concept of permitted application value N in anchor rod design is proposed. By studying strain distribution characteristics of anchor rods in experimental lots along the length direction under action of the permitted application value N and combining the existing destruction mode and ultimate bearing capacity, this paper analyzes influences of L, D, H, S, R, and A on anchoring effect of the carbon fiber Phyllostachys pubescens anchor rod; gives the reasonable value range of L, D, H, and R when the carbon fiber Phyllostachys pubescens anchor rod is used for reinforcing design of the earth relics; and provides favorable experiment basis for reinforcing design of the earth relics based on the carbon fiber Phyllostachys pubescens anchor rod.

  13. Cognitive Scout Node for Communication in Disaster Scenarios

    Directory of Open Access Journals (Sweden)

    Rajesh K. Sharma

    2012-01-01

    highly desired to manage unexpected situations that may happen in a disaster scenario. The scout node proposed in this paper is an extended concept based on a powerful CR node in a heterogeneous nodes environment which takes a leading role for highly flexible, fast, and robust establishment of cooperative wireless links in a disaster situation. This node should have two components: one is a passive sensor unit that collects and stores the technical knowledge about the electromagnetic environment in a data processing unit so-called “radio environment map” in the form of a dynamically updated database, and other is an active transceiver unit which can automatically be configured either as a secondary node for opportunistic communication or as a cooperative base station or access point for primary network in emergency communications. Scout solution can be viable by taking advantage of the technologies used by existing radio surveillance systems in the context of CR.

  14. Location of terminals in a communications network

    DEFF Research Database (Denmark)

    2015-01-01

    A method (400, 500) of identifying nodes in a communications network is disclosed, the nodes being for use in locating wireless terminals within the network based upon reports from the wireless terminals of transmissions received from the nodes. The method (400, 500) comprises prioritising...... combinations of nodes in which at least three nodes are located around a reference node in a configuration satisfying similarity criteria to an idealised star configuration, wherein an idealised star configuration comprises three nodes evenly angularly distributed around, and at the same distance from......, a reference node. Also disclosed is a method (100, 200) for locating a plurality of wireless terminals in a communications network, the network comprising a plurality of network nodes at known locations, wherein the nodes emit wireless transmissions in an unsynchronised manner, such that a time difference...

  15. Bayesian Network Induction via Local Neighborhoods

    National Research Council Canada - National Science Library

    Margaritis, Dimitris

    1999-01-01

    .... We present an efficient algorithm for learning Bayesian networks from data. Our approach constructs Bayesian networks by first identifying each node's Markov blankets, then connecting nodes in a consistent way...

  16. Comparative Study on Different Slot Forms of Prestressed Anchor Blocks

    Science.gov (United States)

    Fan, Rong; Si, Jianhui; Jian, Zheng

    2018-03-01

    In this paper, two models of prestressed pier, rectangular cavity anchor block and arch hollow anchor block are established. The ABAQUS software was used to calculate the stress of the surface of the neck of the pier and the cavity of the anchor block, through comparative analysis. The results show that compared with the rectangular cavity anchor block, the stress of the pier and the cavity can be effectively reduced when the arch hole is used, and the amount of prestressed anchor can be reduced, so as to obtain obvious economic benefits.

  17. Sensors for Detection of Misbehaving Nodes in MANETs

    OpenAIRE

    Klenk, Andreas; Kragl, Frank; Schlott, Stefan; Weber, Michael

    2004-01-01

    The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node may exhibit is selfishness. A selfish node wants to preserve its resources while using the services of others and consuming their resources. One way of preventing selfishness in a MANET is a detection and exclusion mechanism. In this paper, we focus on the detection and present different kinds of sensors that wil...

  18. Multi-Source Energy Harvesting for Wireless Sensor Nodes.

    OpenAIRE

    Kang, Kai

    2012-01-01

    The past few years have seen an increasing interest in the development of wireless sensor networks. But the unsatisfactory or limited available energy source is one of the major bottlenecks which are limiting the wireless sensor technology from mass deployment. Ambient energy harvesting is the most promising solution towards autonomous sensor nodes by providing low cost, permanent, and maintenance-free energy source to wireless sensor nodes. In this paper, we first invested available energy s...

  19. Composite materials formed with anchored nanostructures

    Science.gov (United States)

    Seals, Roland D; Menchhofer, Paul A; Howe, Jane Y; Wang, Wei

    2015-03-10

    A method of forming nano-structure composite materials that have a binder material and a nanostructure fiber material is described. A precursor material may be formed using a mixture of at least one metal powder and anchored nanostructure materials. The metal powder mixture may be (a) Ni powder and (b) NiAl powder. The anchored nanostructure materials may comprise (i) NiAl powder as a support material and (ii) carbon nanotubes attached to nanoparticles adjacent to a surface of the support material. The process of forming nano-structure composite materials typically involves sintering the mixture under vacuum in a die. When Ni and NiAl are used in the metal powder mixture Ni.sub.3Al may form as the binder material after sintering. The mixture is sintered until it consolidates to form the nano-structure composite material.

  20. A scale distortion theory of anchoring.

    Science.gov (United States)

    Frederick, Shane W; Mochon, Daniel

    2012-02-01

    We propose that anchoring is often best interpreted as a scaling effect--that the anchor changes how the response scale is used, not how the focal stimulus is perceived. Of importance, we maintain that this holds true even for so-called objective scales (e.g., pounds, calories, meters, etc.). In support of this theory of scale distortion, we show that prior exposure to a numeric standard changes respondents' use of that specific response scale but does not generalize to conceptually affiliated judgments rendered on similar scales. Our findings highlight the necessity of distinguishing response language effects from representational effects in places where the need for that distinction has often been assumed away.