Robustness of cooperation on scale-free networks under continuous topological change
Ichinose, Genki; Tanizawa, Toshihiro
2013-01-01
In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where their network topologies change by continuous removal and addition of nodes. Each of these removal and addition can be either random or intentional. We therefore have four different strategies in changing network topology: random removal and random addition (RR), random removal and preferential addition (RP), targeted removal and random addition (TR), and targeted removal and preferential addition (TP). We find that cooperation clusters are the most fragile against TR, while they are the most robust against RP even in high temptation coefficients for defect. The effect of the degree mixing pattern of the network is not the primary factor for the robustness of cooperation under continuous change in network topology due to consequential removal and addition of nodes, which is quite different from the cases observed in static networks. Cooperation clusters become more robust...
Learning and innovative elements of strategy adoption rules expand cooperative network topologies.
Directory of Open Access Journals (Sweden)
Shijun Wang
Full Text Available Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoner's Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.
Directory of Open Access Journals (Sweden)
Ning Li
2017-05-01
Full Text Available The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs project is to make autonomous underwater vehicles (AUVs, remote operated vehicles (ROVs and unmanned surface vehicles (USVs more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV’s parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the
Wang, Shuai; Liu, Jing
2016-07-01
The emergence of cooperation is one of the key metaphors behind many social disciplines and phenomena. Existing studies show that intentional attacks on nodes damage the robustness of cooperation distinctly, and the heterogeneity among nodes promotes the emergence of cooperation. However, the impact of link-based attacks and the connectivity of networks on the cooperative mechanism is still unclear. In this paper, we focus on the effect of edge removal on the emergence of cooperation together with the connectivity of networks. The results show that malicious attacks evaluated by edge-degree are efficient to invade cooperators, and heterogeneous networks tend to perform poorly when attacks arise. Furthermore, we analyze the performance of several recovering strategies, and conclude that the connectivity is crucial to the recovery of functionality of whole networks.
Quist, Daniel A.; Gavrilov, Eugene M.; Fisk, Michael E.
2008-01-15
A method enables the topology of an acyclic fully propagated network to be discovered. A list of switches that comprise the network is formed and the MAC address cache for each one of the switches is determined. For each pair of switches, from the MAC address caches the remaining switches that see the pair of switches are located. For each pair of switches the remaining switches are determined that see one of the pair of switches on a first port and the second one of the pair of switches on a second port. A list of insiders is formed for every pair of switches. It is determined whether the insider for each pair of switches is a graph edge and adjacent ones of the graph edges are determined. A symmetric adjacency matrix is formed from the graph edges to represent the topology of the data link network.
OPTIMAL NETWORK TOPOLOGY DESIGN
Yuen, J. H.
1994-01-01
This program was developed as part of a research study on the topology design and performance analysis for the Space Station Information System (SSIS) network. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. It is intended that this new design technique consider all important performance measures explicitly and take into account the constraints due to various technical feasibilities. In the current program, technical constraints are taken care of by the user properly forming the starting set of candidate components (e.g. nonfeasible links are not included). As subsets are generated, they are tested to see if they form an acceptable network by checking that all requirements are satisfied. Thus the first acceptable subset encountered gives the cost-optimal topology satisfying all given constraints. The user must sort the set of "feasible" link elements in increasing order of their costs. The program prompts the user for the following information for each link: 1) cost, 2) connectivity (number of stations connected by the link), and 3) the stations connected by that link. Unless instructed to stop, the program generates all possible acceptable networks in increasing order of their total costs. The program is written only to generate topologies that are simply connected. Tests on reliability, delay, and other performance measures are discussed in the documentation, but have not been incorporated into the program. This program is written in PASCAL for interactive execution and has been implemented on an IBM PC series computer operating under PC DOS. The disk contains source code only. This program was developed in 1985.
Directory of Open Access Journals (Sweden)
Daniel Litinski
2017-09-01
Full Text Available We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall–superconductor hybrids.
Transportation Network Topologies
Holmes, Bruce J.; Scott, John
2004-01-01
A discomforting reality has materialized on the transportation scene: our existing air and ground infrastructures will not scale to meet our nation's 21st century demands and expectations for mobility, commerce, safety, and security. The consequence of inaction is diminished quality of life and economic opportunity in the 21st century. Clearly, new thinking is required for transportation that can scale to meet to the realities of a networked, knowledge-based economy in which the value of time is a new coin of the realm. This paper proposes a framework, or topology, for thinking about the problem of scalability of the system of networks that comprise the aviation system. This framework highlights the role of integrated communication-navigation-surveillance systems in enabling scalability of future air transportation networks. Scalability, in this vein, is a goal of the recently formed Joint Planning and Development Office for the Next Generation Air Transportation System. New foundations for 21st thinking about air transportation are underpinned by several technological developments in the traditional aircraft disciplines as well as in communication, navigation, surveillance and information systems. Complexity science and modern network theory give rise to one of the technological developments of importance. Scale-free (i.e., scalable) networks represent a promising concept space for modeling airspace system architectures, and for assessing network performance in terms of scalability, efficiency, robustness, resilience, and other metrics. The paper offers an air transportation system topology as framework for transportation system innovation. Successful outcomes of innovation in air transportation could lay the foundations for new paradigms for aircraft and their operating capabilities, air transportation system architectures, and airspace architectures and procedural concepts. The topology proposed considers air transportation as a system of networks, within which
Degree 3 Networks Topological Routing
DEFF Research Database (Denmark)
Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Pedersen, Jens Myrup;
2009-01-01
Topological routing is a table free alternative to traditional routing methods. It is specially well suited for organized network interconnection schemes. Topological routing algorithms correspond to the type O(1), constant complexity, being very attractive for large scale networks. It has been...... proposed for many topologies and this work compares the algorithms for three degree three topologies using a more analytical approach than previous studies....
Effects of Topological Randomness on Cooperation in a Deterministic Prisoner's Dilemma Game
Institute of Scientific and Technical Information of China (English)
ZHANG Mei; YANG Jun-Zhong
2011-01-01
In this work, we consider an evolutionary prisoner's dilemma game on a homogeneous random network with the richest-following strategy adoption rule. By constructing homogeneous random networks from a regular ring graph,we investigate the effects of topological randomness on cooperation. In contrast to the ordinary view that the presence of small amount of shortcuts in ring graphs favors cooperation, we find the cooperation inhibition by weak topological randomness. The explanations on the observations are presented.
Cooperation Networks: Endogeneity and Complexity
Angus, S
2006-01-01
Insights from the Complex Systems literature are employed to develop a computational model of truly endogenous strategic network formation. Artificial Adaptive Agents, implemented as Finite State Automata (FSA), play a modified two-player IPD game with an option to further develop the interaction space as part of their strategy. Several insights result from this minor modification: first, I find that network formation is a necessary condition for cooperation to be sustainable but that both the frequency of interaction and the degree to which edge formation impacts agent mixing are both necessary conditions for cooperative networks. Second, within the FSA-modified IPD frame-work, a rich ecology of agents and network topologies is observed and described. Third, the system dynamics are investigated and reveal that initially simple dynamics with small interaction length between agents gives way to complex, a-periodic dynamics with self-organized critical properties when interaction lengths are increased by a sing...
Cooperative Hurricane Network Obs
National Oceanic and Atmospheric Administration, Department of Commerce — Observations from the Cooperative Hurricane Reporting Network (CHURN), a special network of stations that provided observations when tropical cyclones approached the...
Topological Fidelity in Sensor Networks
Chintakunta, Harish; Krim, Hamid
2011-01-01
Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection ...
Topological Fidelity in Sensor Networks
Chintakunta, Harish; Krim, Hamid
2011-01-01
Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection ...
Topological Rankings in Communication Networks
DEFF Research Database (Denmark)
Aabrandt, Andreas; Hansen, Vagn Lundsgaard; Træholt, Chresten
2015-01-01
In the theory of communication the central problem is to study how agents exchange information. This problem may be studied using the theory of connected spaces in topology, since a communication network can be modelled as a topological space such that agents can communicate if and only...... if they belong to the same path connected component of that space. In order to study combinatorial properties of such a communication network, notions from algebraic topology are applied. This makes it possible to determine the shape of a network by concrete invariants, e.g. the number of connected components...
Network modularity promotes cooperation.
Marcoux, Marianne; Lusseau, David
2013-05-01
Cooperation in animals and humans is widely observed even if evolutionary biology theories predict the evolution of selfish individuals. Previous game theory models have shown that cooperation can evolve when the game takes place in a structured population such as a social network because it limits interactions between individuals. Modularity, the natural division of a network into groups, is a key characteristic of all social networks but the influence of this crucial social feature on the evolution of cooperation has never been investigated. Here, we provide novel pieces of evidence that network modularity promotes the evolution of cooperation in 2-person prisoner's dilemma games. By simulating games on social networks of different structures, we show that modularity shapes interactions between individuals favouring the evolution of cooperation. Modularity provides a simple mechanism for the evolution of cooperation without having to invoke complicated mechanisms such as reputation or punishment, or requiring genetic similarity among individuals. Thus, cooperation can evolve over wider social contexts than previously reported.
Topological Fidelity in Sensor Networks
Chintakunta, Harish
2011-01-01
Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection and Localization. We also note these solutions remain coordinate free as no priori localization information of the nodes is assumed. For the coverage hole problem, we follow a "divide and conquer approach", by strategically dissecting the network so that the overall topology is preserved, while efficiently pursuing the detection and localization of failures. The detection of holes, is enabled by first attributing a combinatorial object called a "Rips Complex" to each network segment, and by subsequently checking the exist...
Hierarchical cooperative control for multiagent systems with switching directed topologies.
Hu, Jianqiang; Cao, Jinde
2015-10-01
The hierarchical cooperative control problem is concerned for a two-layer networked multiagent system under switching directed topologies. The group cooperative objective is to achieve finite-time formation control for the upper layer of leaders and containment control for the lower layer of followers. Two kinds of cooperative strategies, including centralized-distributed control and distributed-distributed control, are proposed for two types of switching laws: 1) random switching law with the dwell time and 2) Markov switching law with stationary distribution. Utilizing the state transition matrix methods and matrix measure techniques, some sufficient conditions are derived for asymptotical containment control and exponential almost sure containment control, respectively. Finally, some numerical examples are provided to demonstrate the effectiveness of the proposed control schemes.
A free topology safeguards network
Energy Technology Data Exchange (ETDEWEB)
Kadner, S.P.; Resnik, W.M. [Aquila Technologies Group, Inc., Albuquerque, NM (United States); Schurig, A. [Communications Foundation, Orem, UT (United States)
1995-12-31
Free Topology Network technology provides cost reduction benefits as well as flexibility in safeguards applications. Power line communications technologies have proven viability for transmission and reception of safeguards data, including surveillance photographs, the source of the largest data files. In the future, enhancements will be made to the technology that should boost both performance and flexibility. Work is already underway to achieve higher data rates over power line communications eventually, it should be possible to reach data rates of one million bits per second or higher. Also, the use of technologies such as Novell Embedded Systems Technology (NEST) and Echelon LON technology will allow a greater number of safeguards technologies to become resident on the Free Topology Safeguards Network.
Universal Cyclic Topology in Polymer Networks.
Wang, Rui; Alexander-Katz, Alfredo; Johnson, Jeremiah A; Olsen, Bradley D
2016-05-01
Polymer networks invariably possess topological defects: loops of different orders which have profound effects on network properties. Here, we demonstrate that all cyclic topologies are a universal function of a single dimensionless parameter characterizing the conditions for network formation. The theory is in excellent agreement with both experimental measurements of hydrogel loop fractions and Monte Carlo simulations without any fitting parameters. We demonstrate the superposition of the dilution effect and chain-length effect on loop formation. The one-to-one correspondence between the network topology and primary loop fraction demonstrates that the entire network topology is characterized by measurement of just primary loops, a single chain topological feature. Different cyclic defects cannot vary independently, in contrast to the intuition that the densities of all topological species are freely adjustable. Quantifying these defects facilitates studying the correlations between the topology and properties of polymer networks, providing a key step in overcoming an outstanding challenge in polymer physics.
Topology-aware Overlay Multicast over IP Multicast Networks
Institute of Scientific and Technical Information of China (English)
CHEN Xiao; SHAO Hua-gang; WANG Wei-nong
2008-01-01
Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM),a multicast router is able to receive registration from nearby group members and redirect passing-by join re-quests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.
Topological Indices of Textual Identity Networks.
Leazer, Gregory H.; Furner, Jonathan
1999-01-01
Reports on a continuing investigation of intertextual networks. Describes how intertextual networks can be modeled as directed graphs and extends this to matrix representations. Discusses topological index values of these networks and speculates how topological index values might be used in the estimation of retrieval values in information…
Cooperation in Networks and Scheduling
van Velzen, S.
2005-01-01
This thesis deals with various models of cooperation in networks and scheduling. The main focus is how the benefits of this cooperation should be divided among the participating individuals. A major part of this analysis is concerned with stability of the cooperation. In addition, allocation rules a
Emotional Strategies as Catalysts of Cooperation in Signed Networks
Righi, Simone
2014-01-01
The evolution of unconditional cooperation is one of the key problems of science. We suggest a new solution to this puzzle. We introduce an evolutionary model where agents play the Prisoner's Dilemma on signed networks and the topology is allowed to co-evolve with relational signs as well as with agent strategies. The introduction of conditional strategies, exploiting the emotional content embedded in network signs, can act as catalysts and create favorable conditions for the spread of unconditional cooperation. In line with the literature, evidence is found that evolution of unconditional cooperation is most likely to occur in networks with relatively high chances of rewiring and low likelihood of strategy adoption. However, while some rewiring enhances cooperation too much is shown to limit its diffusion. Furthermore, unlike the non signed network case, cooperation becomes more prevalent in denser topologies.
Cooperative Resource Pricing in Service Overlay Networks for Mobile Agents
Nakano, Tadashi; Okaie, Yutaka
The success of peer-to-peer overlay networks depends on cooperation among participating peers. In this paper, we investigate the degree of cooperation among individual peers required to induce globally favorable properties in an overlay network. Specifically, we consider a resource pricing problem in a market-oriented overlay network where participating peers sell own resources (e.g., CPU cycles) to earn energy which represents some money or rewards in the network. In the resource pricing model presented in this paper, each peer sets the price for own resource based on the degree of cooperation; non-cooperative peers attempt to maximize their own energy gains, while cooperative peers maximize the sum of own and neighbors' energy gains. Simulation results are presented to demonstrate that the network topology is an important factor influencing the minimum degree of cooperation required to increase the network-wide global energy gain.
Small Cell Network Topology Comparison
Directory of Open Access Journals (Sweden)
Jan Oppolzer
2013-01-01
Full Text Available One of the essential problems in a mobile network with small cells is that there is only a limited number of (PCIs available. Due to this fact, operators face the inevitable need for reusing (PCIs. In our contribution, we are dealing with a (PCI assignment to FAPs in three different topologies. The first model places FAPs randomly within the network while respecting overlapping defined. The second model places FAPs in a grid without other restrictions. The third model forms a grid as well, although buildings and roads are taken into account and (FAPs are always inside buildings. The proposed models are compared and a conclusion is made based on simulation results.
Limitations of Passively Mapping Logical Network Topologies
Directory of Open Access Journals (Sweden)
Ayodeji J. Akande
2017-02-01
Full Text Available Understanding logical network connectivity is essential in network topology mapping especially in a fast growing network where knowing what is happening on the network is critical for security purposes and where knowing how network resources are being used is highly important. Mapping logical communication topology is important for network auditing, network maintenance and governance, network optimization, and network security. However, the process of capturing network traffic to generate the logical network topology may have a great influence on the operation of the network. In hierarchically structured networks such as control systems, typical active network mapping techniques are not employable as they can affect time-sensitive cyber-physical processes, hence, passive network mapping is required. Though passive network mapping does not modify or disrupt existing traffic, current passive mapping techniques ignore many practical issues when used to generate logical communication topologies. In this paper, we present a methodology which compares topologies from an idealized mapping process with what is actually achievable using passive network mapping and identify some of the factors that can cause inaccuracies in logical maps derived from passively monitored network traffic. We illustrate these factors using a case study involving a hierarchical control network.
Degree-layer theory of network topology
Zhou, Bin; Zhe, He
2014-01-01
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Therefore, the degree is very important structural parameter of network topology. However, given the number of nodes and the degree of each node in a network, the topology of the network cannot be determined. Therefore, we propose the degree-layer theory of network topology to describe deeply the network topology. First, we propose the concept of degree-tree with the breadth-first search tree. The degrees of all nodes are layered and have a hierarchical structure. Second,the degree-layer theory is described in detail. Two new concepts are defined in the theory. An index is proposed to quantitatively distinguish the two network topologies. It also can quantitatively measure the stability of network topology built by a model mechani...
Emergence of Cooperation in Non-scale-free Networks
Zhang, Yichao; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting
2014-01-01
Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a Prisoner's Dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperati...
Evolutionary pressure on the topology of protein interface interaction networks.
Johnson, Margaret E; Hummer, Gerhard
2013-10-24
The densely connected structure of protein-protein interaction (PPI) networks reflects the functional need of proteins to cooperate in cellular processes. However, PPI networks do not adequately capture the competition in protein binding. By contrast, the interface interaction network (IIN) studied here resolves the modular character of protein-protein binding and distinguishes between simultaneous and exclusive interactions that underlie both cooperation and competition. We show that the topology of the IIN is under evolutionary pressure, and we connect topological features of the IIN to specific biological functions. To reveal the forces shaping the network topology, we use a sequence-based computational model of interface binding along with network analysis. We find that the more fragmented structure of IINs, in contrast to the dense PPI networks, arises in large part from the competition between specific and nonspecific binding. The need to minimize nonspecific binding favors specific network motifs, including a minimal number of cliques (i.e., fully connected subgraphs) and many disconnected fragments. Validating the model, we find that these network characteristics are closely mirrored in the IIN of clathrin-mediated endocytosis. Features unexpected on the basis of our motif analysis are found to indicate either exceptional binding selectivity or important regulatory functions.
Inferring network topology via the propagation process
Zeng, An
2013-01-01
Inferring the network topology from the dynamics is a fundamental problem with wide applications in geology, biology and even counter-terrorism. Based on the propagation process, we present a simple method to uncover the network topology. The numerical simulation on artificial networks shows that our method enjoys a high accuracy in inferring the network topology. We find the infection rate in the propagation process significantly influences the accuracy, and each network is corresponding to an optimal infection rate. Moreover, the method generally works better in large networks. These finding are confirmed in both real social and nonsocial networks. Finally, the method is extended to directed networks and a similarity measure specific for directed networks is designed.
Coalitions in Cooperative Wireless Networks
Mathur, Suhas; Mandayam, Narayan B
2008-01-01
Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coalition structure, i.e., set of coalitions from which users have no incentives to defect, depends on the manner in which the rate gains are apportioned among the cooperating users. Specifically, the stability of the grand coalition (GC), i.e., the coalition of all users, is studied. Transmitter and receiver cooperation in an interference channel (IC) are studied as illustrative cooperative models to determine the stable coalitions for both flexible (transferable) and fixed (non-transferable) apportioning schemes. It is shown that the stable sum-rate optimal coalition when only receivers cooperate by jointly decoding (transferable) is the GC. The stability of the GC depends on the detector when receivers cooperate using linear multiuser detectors (non-transferable). Transmitter cooperation is studied assuming that all receivers coopera...
Fractals on IPv6 Network Topology
Directory of Open Access Journals (Sweden)
Bo Yang
2013-02-01
Full Text Available The coarse-grained renormalization and the fractal analysis of the Internet macroscopic topology can help people better understand the relationship between the part and whole of the Internet, and it is significant for people to understand the essence of the research object through a small amount of information. Aiming at the complexity of Internet IPv6 IP-level topology, we put forward a method of core-threshold coarse-grained to renormalize its topology. By analyzing the degree distribution and degree correlation characteristics in each k-core network topology, the scale invariance of the networks of coarse-grained renormalization was illustrated. The fractal dimension of Internet IPv6 IP-level topology was further computed which shows that the Internet IPv6 IP-level topology has got fractals.
Sie, Rory
2012-01-01
Sie, R. L. L. (2012). COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks (Unpublished doctoral dissertation). September, 28, 2012, Open Universiteit in the Netherlands (CELSTEC), Heerlen, The Netherlands.
Sie, Rory
2012-01-01
Sie, R. L. L. (2012). COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks (Unpublished doctoral dissertation). September, 28, 2012, Open Universiteit in the Netherlands (CELSTEC), Heerlen, The Netherlands.
Symmetric Topological Phases and Tensor Network States
Jiang, Shenghan
Classification and simulation of quantum phases are one of main themes in condensed matter physics. Quantum phases can be distinguished by their symmetrical and topological properties. The interplay between symmetry and topology in condensed matter physics often leads to exotic quantum phases and rich phase diagrams. Famous examples include quantum Hall phases, spin liquids and topological insulators. In this thesis, I present our works toward a more systematically understanding of symmetric topological quantum phases in bosonic systems. In the absence of global symmetries, gapped quantum phases are characterized by topological orders. Topological orders in 2+1D are well studied, while a systematically understanding of topological orders in 3+1D is still lacking. By studying a family of exact solvable models, we find at least some topological orders in 3+1D can be distinguished by braiding phases of loop excitations. In the presence of both global symmetries and topological orders, the interplay between them leads to new phases termed as symmetry enriched topological (SET) phases. We develop a framework to classify a large class of SET phases using tensor networks. For each tensor class, we can write down generic variational wavefunctions. We apply our method to study gapped spin liquids on the kagome lattice, which can be viewed as SET phases of on-site symmetries as well as lattice symmetries. In the absence of topological order, symmetry could protect different topological phases, which are often referred to as symmetry protected topological (SPT) phases. We present systematic constructions of tensor network wavefunctions for bosonic symmetry protected topological (SPT) phases respecting both onsite and spatial symmetries.
Topological Routing in Large-Scale Networks
DEFF Research Database (Denmark)
Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun
2004-01-01
A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues in applying...... Topological Routing to large-scale networks are discussed. Hierarchical extensions are presented along with schemes for shortest path routing, fault handling and path restoration. Further reserach in the area is discussed and perspectives on the prerequisites for practical deployment of Topological Routing...
Topological Routing in Large-Scale Networks
DEFF Research Database (Denmark)
Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun
A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues in applying...... Topological Routing to large-scale networks are discussed. Hierarchical extensions are presented along with schemes for shortest path routing, fault handling and path restoration. Further reserach in the area is discussed and perspectives on the prerequisites for practical deployment of Topological Routing...
A Combinational Perspective in Stimulating Cooperation in Mobile Ad Hoc Networks
Institute of Scientific and Technical Information of China (English)
Mahshid Rahnamay-Naeini; Masoud Sabaei
2011-01-01
In wireless ad hoc networks cooperation among nodes cannot always be assumed since nodes with limited resources and different owners are capable of making independent decisions. Cooperation problems in topology control and packet forwarding tasks have been mostly studied separately but these two tasks are not independent. Considering a joint cooperation problem by taking into account dependencies between tasks will result in more reliable and efficient networks. In this paper topology control definition is extended to cover cooperation problem in both packet forwarding and topology control in a single problem. In this definition nodes have to adjust their transmission power and decide on their relay role. This paper models the interactions of nodes as a potential game with two-dimensional utility function. The presented model, named TCFORCE (Topology Control packet FORwarding Cooperation Enforcement), preserves the network connectivity and reduces the energy consumption by providing cooperative paths between all pairs of nodes in the network.
Spectrum-Based and Collaborative Network Topology Analysis and Visualization
Hu, Xianlin
2013-01-01
Networks are of significant importance in many application domains, such as World Wide Web and social networks, which often embed rich topological information. Since network topology captures the organization of network nodes and links, studying network topology is very important to network analysis. In this dissertation, we study networks by…
Optimising the topology of complex neural networks
Jiang, Fei; Schoenauer, Marc
2007-01-01
In this paper, we study instances of complex neural networks, i.e. neural netwo rks with complex topologies. We use Self-Organizing Map neural networks whose n eighbourhood relationships are defined by a complex network, to classify handwr itten digits. We show that topology has a small impact on performance and robus tness to neuron failures, at least at long learning times. Performance may howe ver be increased (by almost 10%) by artificial evolution of the network topo logy. In our experimental conditions, the evolved networks are more random than their parents, but display a more heterogeneous degree distribution.
Scaling in topological properties of brain networks
Singh, S.S.; Khundrakpam, B.; Reid, A.T.; Lewis, J.D.; Evans, A.C.; Ishrat, R.; Sharma, B.I.; Singh, R.K.B.
2016-01-01
The organization in brain networks shows highly modular features with weak inter-modular interaction. The topology of the networks involves emergence of modules and sub-modules at different levels of constitution governed by fractal laws that are signatures of self-organization in complex networks.
Cooperative Mobile Sensing Networks
Energy Technology Data Exchange (ETDEWEB)
Roberts, R S; Kent, C A; Jones, E D; Cunningham, C T; Armstrong, G W
2003-02-10
A cooperative control architecture is presented that allows a fleet of Unmanned Air Vehicles (UAVs) to collect data in a parallel, coordinated and optimal manner. The architecture is designed to react to a set of unpredictable events thereby allowing data collection to continue in an optimal manner.
Identification of Topological Network Modules in Perturbed Protein Interaction Networks
Sardiu, Mihaela E.; Gilmore, Joshua M.; Groppe, Brad; Florens, Laurence; Washburn, Michael P.
2017-01-01
Biological networks consist of functional modules, however detecting and characterizing such modules in networks remains challenging. Perturbing networks is one strategy for identifying modules. Here we used an advanced mathematical approach named topological data analysis (TDA) to interrogate two perturbed networks. In one, we disrupted the S. cerevisiae INO80 protein interaction network by isolating complexes after protein complex components were deleted from the genome. In the second, we reanalyzed previously published data demonstrating the disruption of the human Sin3 network with a histone deacetylase inhibitor. Here we show that disrupted networks contained topological network modules (TNMs) with shared properties that mapped onto distinct locations in networks. We define TMNs as proteins that occupy close network positions depending on their coordinates in a topological space. TNMs provide new insight into networks by capturing proteins from different categories including proteins within a complex, proteins with shared biological functions, and proteins disrupted across networks. PMID:28272416
Metric-Based Cooperative Routing in Multihop Ad Hoc Networks
Directory of Open Access Journals (Sweden)
Xin He
2012-01-01
Full Text Available Cooperative communication fully leverages the broadcast nature of wireless channels and exploits time/spatial diversity in a distributed manner, thereby achieving significant improvements in system capacity and transmission reliability. Cooperative diversity has been well studied from the physical layer perspective. Thereafter, cooperative MAC design has also drawn much attention recently. However, very little work has addressed cooperation at the routing layer. In this paper, we propose a simple yet efficient scheme for cooperative routing by using cooperative metrics including packet delivery ratio, throughput, and energy consumption efficiency. To make a routing decision based on our scheme, a node needs to first determine whether cooperation on each link is necessary or not, and if necessary, select the optimal cooperative scheme as well as the optimal relay. To do so, we calculate and compare cooperative routing metric values for each potential relay for each different cooperative MAC scheme (C-ARQ and CoopMAC in this study, and further choose the best value and compare it with the noncooperative link metric. Using the final optimal metric value instead of the traditional metric value at the routing layer, new optimal paths are set up in multihop ad hoc networks, by taking into account the cooperative benefits from the MAC layer. The network performance of the cooperative routing solution is demonstrated using a simple network topology.
Monitoring the Topology of Growing Dynamical Networks
Wu, Zhaoyan; Fu, Xinchu; Chen, Guanrong
In this paper, topology monitoring of growing networks is studied. When some new nodes are added into a network, the topology of the network is changed, which needs to be monitored in many applications. Some auxiliary systems (network monitors) are designed to achieve this goal. Both linear feedback control and adaptive strategy are applied to designing such network monitors. Based on the Lyapunov function method via constructing a potential or energy function decreasing along any solution of the system, and the LaSalle's invariance principle, which is a generalization of the Lyapunov function method, some sufficient conditions for achieving topology monitoring are obtained. Illustrative examples are provided to demonstrate the effectiveness of the new method.
Topological Analysis of Urban Drainage Networks
Yang, Soohyun; Paik, Kyungrock; McGrath, Gavan; Rao, Suresh
2016-04-01
Urban drainage networks are an essential component of infrastructure, and comprise the aggregation of underground pipe networks carrying storm water and domestic waste water for eventual discharge to natural stream networks. Growing urbanization has contributed to rapid expansion of sewer networks, vastly increasing their complexity and scale. Importance of sewer networks has been well studied from an engineering perspective, including resilient management, optimal design, and malfunctioning impact. Yet, analysis of the urban drainage networks using complex networks approach are lacking. Urban drainage networks consist of manholes and conduits, which correspond to nodes and edges, analogous to junctions and streams in river networks. Converging water flows in these two networks are driven by elevation gradient. In this sense, engineered urban drainage networks share several attributes of flows in river networks. These similarities between the two directed, converging flow networks serve the basis for us to hypothesize that the functional topology of sewer networks, like river networks, is scale-invariant. We analyzed the exceedance probability distribution of upstream area for practical sewer networks in South Korea. We found that the exceedance probability distributions of upstream area follow power-law, implying that the sewer networks exhibit topological self-similarity. The power-law exponents for the sewer networks were similar, and within the range reported from analysis of natural river networks. Thus, in line with our hypothesis, these results suggest that engineered urban drainage networks share functional topological attributes regardless of their structural dissimilarity or different underlying network evolution processes (natural vs. engineered). Implications of these findings for optimal design of sewer networks and for modeling sewer flows will be discussed.
Decentralized Cooperative Networking
2012-02-24
protocols (such as DSR and AODV ) where route request (RREQ) and route reply (RREP) control packets are transmitted via SISO transmissions. Then, specific... routing . To make the routing protocol scalable, M-group Dis-STBC is applied, and an analysis of the cooperative transmission range is provided to guide...higher throughput in comparison to a Single-Input-Single-Output (SISO) based routing protocol . On the other hand, because LACR is designed to
Automated Network Mapping and Topology Verification
2016-06-01
the Marine Corps. These networks are a cornerstone for modern operations and communication : they must be secure and robust. The requisite proper...protocols in an evolving network community [9]. These protocols are typically implemented by the various operating systems installed on the networked ... Fundamental objectives of a topology mapping application are algorithmic analysis of the available data, accurate representation of the network , and a user
Topology identification of complex dynamical networks
Zhao, Junchan; Li, Qin; Lu, Jun-An; Jiang, Zhong-Ping
2010-06-01
Recently, some researchers investigated the topology identification for complex networks via LaSalle's invariance principle. The principle cannot be directly applied to time-varying systems since the positive limit sets are generally not invariant. In this paper, we study the topology identification problem for a class of weighted complex networks with time-varying node systems. Adaptive identification laws are proposed to estimate the coupling parameters of the networks with and without communication delays. We prove that the asymptotic identification is ensured by a persistently exciting condition. Numerical simulations are given to demonstrate the effectiveness of the proposed approach.
Network-topology-adaptive quantum conference protocols
Institute of Scientific and Technical Information of China (English)
Zhang Sheng; Wang Jian; Tang Chao-Jing; Zhang Quan
2011-01-01
As an important application of the quantum network communication,quantum multiparty conference has made multiparty secret communication possible.Previous quantum multiparty conference schemes based on quantum data encryption are insensitive to network topology.However,the topology of the quantum network significantly affects the communication efficiency,e.g.,parallel transmission in a channel with limited bandwidth.We have proposed two distinctive protocols,which work in two basic network topologies with efficiency higher than the existing ones.We first present a protocol which works in the reticulate network using Greeberger-Horne-Zeilinger states and entanglement swapping.Another protocol,based on quantum multicasting with quantum data compression,which can improve the efficiency of the network,works in the star-like network.The security of our protocols is guaranteed by quantum key distribution and one-time-pad encryption.In general,the two protocols can be applied to any quantum network where the topology can be equivalently transformed to one of the two structures we propose in our protocols.
2016-06-01
effectiveness, and the ability to experimentally manipulate endogenous team processes . She reviewed the results of a set of experiments in the Hidden...Profile paradigm of team research that examine how endogenous communication processes influence emergent network structure and team performance...experimentally manipulate endogenous team processes . She reviewed the results of a set of experiments in the Hidden Profile paradigm of team research
Effect of self-interaction on the evolution of cooperation in complex topologies
Wu, Yu'e.; Zhang, Zhipeng; Chang, Shuhua
2017-09-01
Self-interaction, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this text, we consider a new self-interaction mechanism in the two typical pairwise models including the prisoner's dilemma and the snowdrift games, where the cooperative agents will gain extra bonus for their selfless behavior. We find that under the mechanism the collective cooperation is elevated to a very high level especially after adopting the finite population analogue of replicator dynamics for evolution. The robustness of the new mechanism is tested for different complex topologies for the prisoner's dilemma game. All the presented results demonstrate that the enhancement effects are independent of the structure of the applied spatial networks and the potential evolutionary games, and thus showing a high degree of universality. Our conclusions might shed light on the understanding of the evolution of cooperation in the real world.
Evolution of cooperation under social pressure in multiplex networks
Pereda, María
2016-09-01
In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.
Evolution of cooperation under social pressure in multiplex networks.
Pereda, María
2016-09-01
In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.
Topology Optimisation of Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Thike Aye Min
2016-01-01
Full Text Available Wireless sensor networks are widely used in a variety of fields including industrial environments. In case of a clustered network the location of cluster head affects the reliability of the network operation. Finding of the optimum location of the cluster head, therefore, is critical for the design of a network. This paper discusses the optimisation approach, based on the brute force algorithm, in the context of topology optimisation of a cluster structure centralised wireless sensor network. Two examples are given to verify the approach that demonstrate the implementation of the brute force algorithm to find an optimum location of the cluster head.
Characterization of emergent synaptic topologies in noisy neural networks
Miller, Aaron James
of a LIF neuron subjected to Gaussian white noise (GWN). The system reduces to the Ornstein-Uhlenbeck first passage time problem, the solution of which we build into the mapping method of Chapter 2. We demonstrate that simulations using the stochastic mapping have reduced computation time compared to traditional Runge-Kutta methods by more than a factor of 150. In Chapter 4, we use the stochastic mapping to study the dynamics of emerging synaptic topologies in noisy networks. With the addition of membrane noise, networks with dynamical synapses can admit states in which the distribution of the synaptic weights is static under spontaneous activity, but the random connectivity between neurons is dynamical. The widely cited problem of instabilities in networks with STDP is avoided with the implementation of a synaptic decay and an activation threshold on each synapse. When such networks are presented with stimulus modeled by a focused excitatory current, chain-like networks can emerge with the addition of an axon-remodeling plasticity rule, a topological constraint on the connectivity modeling the finite resources available to each neuron. The emergent topologies are the result of an iterative stochastic process. The dynamics of the growth process suggest a strong interplay between the network topology and the spike sequences they produce during development. Namely, the existence of an embedded spike sequence alters the distribution of synaptic weights through the entire network. The roles of model parameters that affect the interplay between network structure and activity are elucidated. Finally, we propose two mathematical growth models, which are complementary, that capture the essence of the growth dynamics observed in simulations. In Chapter 5, we present an extension of the stochastic mapping that allows the possibility of neuronal cooperation. We demonstrate that synaptic topologies admitting stereotypical sequences can emerge in yet higher, biologically
Impact of Social Punishment on Cooperative Behavior in Complex Networks
Wang, Zhen; Xia, Cheng-Yi; Meloni, Sandro; Zhou, Chang-Song; Moreno, Yamir
2013-10-01
Social punishment is a mechanism by which cooperative individuals spend part of their resources to penalize defectors. In this paper, we study the evolution of cooperation in 2-person evolutionary games on networks when a mechanism for social punishment is introduced. Specifically, we introduce a new kind of role, punisher, which is aimed at reducing the earnings of defectors by applying to them a social fee. Results from numerical simulations show that different equilibria allowing the three strategies to coexist are possible as well as that social punishment further enhance the robustness of cooperation. Our results are confirmed for different network topologies and two evolutionary games. In addition, we analyze the microscopic mechanisms that give rise to the observed macroscopic behaviors in both homogeneous and heterogeneous networks. Our conclusions might provide additional insights for understanding the roots of cooperation in social systems.
Degree Variance and Emotional Strategies Catalyze Cooperation in Dynamic Signed Networks
Righi, Simone
2014-01-01
We study the problem of the emergence of cooperation in dynamic signed networks where agent strategies coevolve with relational signs and network topology. Running simulations based on an agent-based model, we compare results obtained in a regular lattice initialization with those obtained on a comparable random network initialization. We show that the increased degree heterogeneity at the outset enlarges the parametric conditions in which cooperation survives in the long run. Furthermore, we show how the presence of sign-dependent emotional strategies catalyze the evolution of cooperation with both network topology initializations.
Cooperative epidemics on multiplex networks
Azimi-Tafreshi, N
2015-01-01
The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric co-infection model for spreading of two diseases on a 2-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loop-less. Infection with one of the diseases increases the probability to get infected by the other. Using generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called co-infected clusters) in the stationary state, as well as the epidemic spreading thresholds and the phase diagram of the model. With increasing cooperation, we observe a tricritical point and the type of transition changes from continuous to hybrid. Finally we compare the co-infected clusters in the case of co-operating diseases with the so-called viable clusters in networks with dependencies.
Topological structural classes of complex networks
Estrada, Ernesto
2007-01-01
We use theoretical principles to study how complex networks are topologically organized at large scale. Using spectral graph theory we predict the existence of four different topological structural classes of networks. These classes correspond, respectively, to highly homogenous networks lacking structural bottlenecks, networks organized into highly interconnected modules with low inter-community connectivity, networks with a highly connected central core surrounded by a sparser periphery, and networks displaying a combination of highly connected groups (quasicliques) and groups of nodes partitioned into disjoint subsets (quasibipartites). Here we show by means of the spectral scaling method that these classes really exist in real-world ecological, biological, informational, technological, and social networks. We show that neither of three network growth mechanisms—random with uniform distribution, preferential attachment, and random with the same degree sequence as real network—is able to reproduce the four structural classes of complex networks. These models reproduce two of the network classes as a function of the average degree but completely fail in reproducing the other two classes of networks.
Spectral Analysis of Rich Network Topology in Social Networks
Wu, Leting
2013-01-01
Social networks have received much attention these days. Researchers have developed different methods to study the structure and characteristics of the network topology. Our focus is on spectral analysis of the adjacency matrix of the underlying network. Recent work showed good properties in the adjacency spectral space but there are few…
Spectral Analysis of Rich Network Topology in Social Networks
Wu, Leting
2013-01-01
Social networks have received much attention these days. Researchers have developed different methods to study the structure and characteristics of the network topology. Our focus is on spectral analysis of the adjacency matrix of the underlying network. Recent work showed good properties in the adjacency spectral space but there are few…
Network unfairness in dragonfly topologies
Fuentes, Pablo; Vallejo, Enrique; Camarero, Cristóbal; Beivide Palacio, Ramon; Valero Cortés, Mateo
2016-01-01
Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-performance solution for large systems. Non-minimal adaptive routing (adaptive misrouting) is employed to fully exploit the path diversity and increase the performance under adversarial traffic patterns. Network fairness issues arise in the dragonfly for several combinations of traffic pattern, global misrouting and traffic prioritization policy. Such unfairness prevents a balanced use of the res...
DEALING WITH TOPOLOGICAL RELATIONS IN UNDERGROUND NETWORKS
Directory of Open Access Journals (Sweden)
M. Lacroix
2015-01-01
Full Text Available Ten years ago, 25 people died and more than 150 were seriously injured in Ghislenghien (Belgium because of construction damage to a high pressure gas pipeline. Urban networks are invisible because usually buried between 1 and 1.5 meter underground. They should be identified to prevent such accidents which involve workers and public as well. Rural and urban districts, networks concessionary and contractors; everyone could benefit from their networks becoming safer. To develop software which evaluates the risks in managing both uncertainties and topology is the focus of attention. That’s the reason why we firstly propose to determine the topological relationships between networks; secondly we propose to compute the risks taking into account the various uncertainties such as the security radius or the coordinates accuracy, before giving the different required standards for an artificial intelligence tool in order to obtain high security level.
Kitaev spin models from topological nanowire networks
Kells, G.; Lahtinen, V.; Vala, J.
2014-01-01
We show that networks of superconducting topological nanowires can realize the physics of exactly solvable Kitaev spin models on trivalent lattices. This connection arises from the low-energy theory of both systems being described by a tight-binding model of Majorana modes. In Kitaev spin models the
Dynamical networks with topological self-organization
Zak, M.
2001-01-01
Coupled evolution of state and topology of dynamical networks is introduced. Due to the well organized tensor structure, the governing equations are presented in a canonical form, and required attractors as well as their basins can be easily implanted and controlled.
Dynamical networks with topological self-organization
Zak, M.
2001-01-01
Coupled evolution of state and topology of dynamical networks is introduced. Due to the well organized tensor structure, the governing equations are presented in a canonical form, and required attractors as well as their basins can be easily implanted and controlled.
Network Physiology reveals relations between network topology and physiological function
Bashan, Amir; Kantelhardt, Jan W; Havlin, Shlomo; Ivanov, Plamen Ch; 10.1038/ncomms1705
2012-01-01
The human organism is an integrated network where complex physiologic systems, each with its own regulatory mechanisms, continuously interact, and where failure of one system can trigger a breakdown of the entire network. Identifying and quantifying dynamical networks of diverse systems with different types of interactions is a challenge. Here, we develop a framework to probe interactions among diverse systems, and we identify a physiologic network. We find that each physiologic state is characterized by a specific network structure, demonstrating a robust interplay between network topology and function. Across physiologic states the network undergoes topological transitions associated with fast reorganization of physiologic interactions on time scales of a few minutes, indicating high network flexibility in response to perturbations. The proposed system-wide integrative approach may facilitate the development of a new field, Network Physiology.
Energy-efficient cooperative routing in BER constrained multihop networks
Institute of Scientific and Technical Information of China (English)
Behrouz MAHAM; Mérouane DEBBAH; Are HJ(φ)RUNGNES
2009-01-01
Due to the limited energy supplies of nodes, in many applications like wireless sensor networks energy-efficiency is crucial for extending the lifetime of these net-works. We study the routing problem for multihop wireless ad hoc networks based on cooperative transmission. The source node wants to transmit messages to a single destina-tion. Other nodes in the network may operate as relay nodes.In this paper, we propose a cooperative multihop routing for the purpose of power savings, constrained on a required bit error rate (BER) at the destination. We derive analytical re-sults for line and grid network topologies. It is shown that energy savings of 100% are achievable in line and grid net-works with a large number of nodes for BER = 10-4 con-straint at the destination.
The Route towards the ultimate network topology
Rodriguez, German
2016-01-01
In this talk I will try to summarize our quest for a realizable network topology that optimizes performance, cost, power consumption and partitionability. We have explored Fat Trees, Dragonflies, variations of dragonflies, Orthogonal Fat Trees, multi-layer HyperX's, Multi-layer Full Meshes and close-to Moore's (graph) bound topologies in an attempt to decide, with the best routing we could find, for a reasonable task-placement, and for a collection of workloads (synthetic and real-world), whi...
Network Topologies Decoding Cervical Cancer.
Directory of Open Access Journals (Sweden)
Sarika Jalan
Full Text Available According to the GLOBOCAN statistics, cervical cancer is one of the leading causes of death among women worldwide. It is found to be gradually increasing in the younger population, specifically in the developing countries. We analyzed the protein-protein interaction networks of the uterine cervix cells for the normal and disease states. It was found that the disease network was less random than the normal one, providing an insight into the change in complexity of the underlying network in disease state. The study also portrayed that, the disease state has faster signal processing as the diameter of the underlying network was very close to its corresponding random control. This may be a reason for the normal cells to change into malignant state. Further, the analysis revealed VEGFA and IL-6 proteins as the distinctly high degree nodes in the disease network, which are known to manifest a major contribution in promoting cervical cancer. Our analysis, being time proficient and cost effective, provides a direction for developing novel drugs, therapeutic targets and biomarkers by identifying specific interaction patterns, that have structural importance.
Coevolution of synchronization and cooperation in networks of coupled oscillators
Antonioni, Alberto
2016-01-01
Despite the large number of studies on the framework of synchronization, none of the previous research made the hypothesis that synchronization occurs at a given cost for involved individuals. The introduction of costly interactions leads, instead, to the formulation of a dichotomous scenario in which an individual may decide to cooperate and pay the cost in order to get synchronized with the rest of the population. Alternatively, the same individual can decide to free ride, without incurring in any cost, waiting that others get synchronized to her state. The emergence of synchronization may thus be seen as the byproduct of an evolutionary game in which individuals decide their behavior according to the benefit/cost ratio they receive in the past. We study the onset of cooperation/synchronization in networked populations of Kuramoto oscillators and report how topology is essential in order for cooperation to thrive. We display also how different classes of topology foster differently synchronization both at a...
Topology Optimization for Urban Traffic Sensor Network
Institute of Scientific and Technical Information of China (English)
HU Jianming; SONG Jingyan; ZHANG Mingchen; KANG Xiaojing
2008-01-01
This paper presents an optimized topology for urban traffic sensor networks. Small world theory is used to improve the performance of the wireless communication system with a heterogeneous transmission model and an optimal transmission radius. Furthermore, a series of simulations based on the actual road network around the 2nd Ring Road in Beijing demonstrate the practicability of constructing artificial "small worlds". Moreover, the particle swarm optimization method is used to calculate the globally best distribution of the nodes with the large radius. The methods proposed in this paper will be helpful to the sensor nodes deployment of the new urban traffic sensor networks.
Coevolution of Cooperation and Layer Selection Strategy in Multiplex Networks
Directory of Open Access Journals (Sweden)
Katsuki Hayashi
2016-11-01
Full Text Available Recently, the emergent dynamics in multiplex networks, composed of layers of multiple networks, has been discussed extensively in network sciences. However, little is still known about whether and how the evolution of strategy for selecting a layer to participate in can contribute to the emergence of cooperative behaviors in multiplex networks of social interactions. To investigate these issues, we constructed a coevolutionary model of cooperation and layer selection strategies in which each an individual selects one layer from multiple layers of social networks and plays the Prisoner’s Dilemma with neighbors in the selected layer. We found that the proportion of cooperative strategies increased with increasing the number of layers regardless of the degree of dilemma, and this increase occurred due to a cyclic coevolution process of game strategies and layer selection strategies. We also showed that the heterogeneity of links among layers is a key factor for multiplex networks to facilitate the evolution of cooperation, and such positive effects on cooperation were observed regardless of the difference in the stochastic properties of network topologies.
Cooperation-induced topological complexity: a promising road to fault tolerance and Hebbian learning
Directory of Open Access Journals (Sweden)
Malgorzata eTuralska
2012-03-01
Full Text Available According to an increasing number of researchers intelligence emerges from criticality as a consequence of locality breakdown and long-range correlation, well known properties of phase transition processes. We study a model of interacting units, as an idealization of real cooperative systems such as the brain or a flock of birds, for the purpose of discussing the emergence of long-range correlation from the coupling of any unit with its nearest neighbors. We focus on the critical condition that has been recently shown to maximize information transport and we study the topological structure of the network of dynamically linked nodes. Although the topology of this network depends on the arbitrary choice of correlation threshold, namely the correlation intensity selected to establish a link between two nodes; the numerical calculations of this paper afford some important indications on the dynamically induced topology. The first important property is the emergence of a perception length as large as the flock size, thanks to some nodes with a large number of links, thus playing the leadership role. All the units are equivalent and leadership moves in time from one to another set of nodes, thereby insuring fault tolerance. Then we focus on the correlation threshold generating a scale-free topology with power index and we find that if this topological structure is selected to establish consensus through the linked nodes, the control parameter necessary to generate criticality is close to the critical value corresponding to the all-to-all coupling condition. We find that criticality in this case generates also a third state, corresponding to a total lack of consensus. However, we make a numerical analysis of the dynamically induced network, and we find that it consists of two almost independent structures, each of which is equivalent to a network in the all-to-all coupling condition. We argue that these results are compatible with Hebbian learning and
Systemic risk on different interbank network topologies
Lenzu, Simone; Tedeschi, Gabriele
2012-09-01
In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents' performance. By changing the agent's trust on its neighbor's performance, interbank linkages self-organize themselves into very different network architectures, ranging from random to scale-free topologies. We study which network architecture can make the financial system more resilient to random attacks and how systemic risk spreads over the network. To perturb the system, we generate a random attack via a liquidity shock. The hit bank is not automatically eliminated, but its failure is endogenously driven by its incapacity to raise liquidity in the interbank network. Our analysis shows that a random financial network can be more resilient than a scale free one in case of agents' heterogeneity.
Network topology of economic sectors
Djauhari, Maman A.; Gan, Siew Lee
2016-09-01
A lot of studies dealing with stock network analysis, where each individual stock is represented by a univariate time series of its closing price, have been published. In these studies, the similarity of two different stocks is quantified using a Pearson correlation coefficient on the logarithmic price returns. In this paper, we generalize the notion of similarity between univariate time series into multivariate time series which might be of different dimensions. This allows us to deal with economic sector network analysis, where the similarity between economic sectors is defined using Escoufier’s vector correlation RV. To the best of our knowledge, there is no study dealing with this notion of economic sector similarity. Two examples of data from the New York stock exchange will be presented and discussed, and some important results will be highlighted.
Cooperative robots and sensor networks
Khelil, Abdelmajid
2014-01-01
Mobile robots and Wireless Sensor Networks (WSNs) have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and WSNs have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The primary objective of book is to provide a reference for cutting-edge studies and research trends pertaining to robotics and sensor networks, and in particular for the coupling between them. The book consists of five chapters. The first chapter presents a cooperation strategy for teams of multiple autonomous vehicles to solve the rendezvous problem. The second chapter is motivated by the need to improve existing solutions that deal with connectivity prediction, and proposed a genetic machine learning approach for link-quality prediction. The third chapter presents an arch...
International migration network: topology and modeling.
Fagiolo, Giorgio; Mastrorillo, Marina
2013-07-01
This paper studies international migration from a complex-network perspective. We define the international migration network (IMN) as the weighted-directed graph where nodes are world countries and links account for the stock of migrants originated in a given country and living in another country at a given point in time. We characterize the binary and weighted architecture of the network and its evolution over time in the period 1960-2000. We find that the IMN is organized around a modular structure with a small-world binary pattern displaying disassortativity and high clustering, with power-law distributed weighted-network statistics. We also show that a parsimonious gravity model of migration can account for most of observed IMN topological structure. Overall, our results suggest that socioeconomic, geographical, and political factors are more important than local-network properties in shaping the structure of the IMN.
Algebraically contractible topological tensor network states
Denny, S J; Jaksch, D; Clark, S R
2011-01-01
We adapt the bialgebra and Hopf relations to expose internal structure in the ground state of a Hamiltonian with $Z_2$ topological order. Its tensor network description allows for exact contraction through simple diagrammatic rewrite rules. The contraction property does not depend on specifics such as geometry, but rather originates from the non-trivial algebraic properties of the constituent tensors. We then generalise the resulting tensor network from a spin-half lattice to a class of exactly contractible states on spin-S degrees of freedom, yielding the most efficient tensor network description of finite Abelian lattice gauge theories. We gain a new perspective on these states as examples of two-dimensional quantum states with algebraically contractible tensor network representations. The introduction of local perturbations to the network is shown to reduce the von Neumann entropy of string-like regions, creating an unentangled sub-system within the bulk in a certain limit. We also show how perturbations l...
Cooperation on Social Networks and Its Robustness
Antonioni, Alberto
2012-01-01
In this work we have used computer models of social-like networks to show by extensive numerical simulations that cooperation in evolutionary games can emerge and be stable on this class of networks. The amounts of cooperation reached are at least as much as in scale-free networks but here the population model is more realistic. Cooperation is robust with respect to different strategy update rules, population dynamics, and payoff computation. Only when straight average payoff is used or there is high strategy or network noise does cooperation decrease in all games and disappear in the Prisoner's Dilemma.
Network Analysis of Cosmic Structures : Network Centrality and Topological Environment
Hong, Sungryong
2015-01-01
We apply simple analyses techniques developed for the study of complex networks to the study of the cosmic web, the large scale galaxy distribution. In this paper, we measure three network centralities (ranks of topological importance), Degree Centrality (DC), Closeness Centrality (CL), and Betweenness Centrality (BC) from a network built from the Cosmological Evolution Survey (COSMOS) catalog. We define 8 galaxy populations according to the centrality measures; Void, Wall, and Cluster by DC, Main Branch and Dangling Leaf by BC, and Kernel, Backbone, and Fracture by CL. We also define three populations by voronoi tessellation density to compare these with the DC selection. We apply the topological selections to galaxies in the (photometric) redshift range $0.91
Wireless network topology for monitoring mobile agents
Fraser, Matthew J.; James, Daniel A.; Thiel, David V.
2005-02-01
A wireless network of multiple sensor nodes for monitoring large numbers of mobile agents is described and investigated. Wireless monitoring provides time critical information from a number of data sources allowing near real-time analysis of the collected data. The developed wireless network provides a moderate data rate, is able to support many wireless nodes and is a low power solution. Novel network structures have been developed to satisfy all of these requirements. This paper evaluates a number of currently available wireless communication protocols, concluding that a Bluetooth wireless network satisfies the above criteria. To support a large number of devices, topologies using inter-piconet and piconet sharing methods have been developed. These network structures are outlined in detail and have been developed with the current Bluetooth hardware limitations in mind. The proposed wireless networks have been developed to be implemented with current Bluetooth hardware. A summary of network performance is included for each developed network structure, and from these figures an appropriate network structure has been chosen that satisfies the requirements of a wireless sensor network for monitoring mobile agents.
Directory of Open Access Journals (Sweden)
Jia Zhao
2014-01-01
Full Text Available Solutions to the routing strategic conflict between noncooperative P2P overlay and ISP underlay go separate ways: hyperselfishness and cooperation. Unpredictable (possibly adverse impact of the hyperselfish topology awareness, which is adopted in both overlay routing and traffic engineering, has not been sufficiently studied in the literature. Topology-related information exchange in a cooperatively efficient way should be highlighted to alleviate the cross-layer conflict. In this paper, we first illustrate the hyperselfish weakness with two dynamic noncooperative game models in which hyperselfish overlay or underlay has to accept a suboptimal profit. Then we build a synergistic cost-saving (SC game model to reduce the negative effects of noncooperation. In the SC model, through information exchange, that is, the classified path-delay metrics for P2P overlay and peer locations for underlay, P2P overlay selects proximity as well as saving traffic transit cost for underlay, and ISP underlay adjusts routing to optimize network cost as well as indicating short delay paths for P2P. Simulations based on the real and generated topologies validate cost improvement by SC model and find a proper remote threshold value to limit P2P traffic from remote area, cross-AS, or cross-ISP.
Inferring epidemic network topology from surveillance data.
Wan, Xiang; Liu, Jiming; Cheung, William K; Tong, Tiejun
2014-01-01
The transmission of infectious diseases can be affected by many or even hidden factors, making it difficult to accurately predict when and where outbreaks may emerge. One approach at the moment is to develop and deploy surveillance systems in an effort to detect outbreaks as timely as possible. This enables policy makers to modify and implement strategies for the control of the transmission. The accumulated surveillance data including temporal, spatial, clinical, and demographic information, can provide valuable information with which to infer the underlying epidemic networks. Such networks can be quite informative and insightful as they characterize how infectious diseases transmit from one location to another. The aim of this work is to develop a computational model that allows inferences to be made regarding epidemic network topology in heterogeneous populations. We apply our model on the surveillance data from the 2009 H1N1 pandemic in Hong Kong. The inferred epidemic network displays significant effect on the propagation of infectious diseases.
Chen, Qing; Zhang, Jinxiu; Hu, Ze
2017-02-23
This article investigates the dynamic topology control problemof satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites' relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime.
Mutually cooperative epidemics on power-law networks
Cui, Peng-Bi; Colaiori, Francesca; Castellano, Claudio
2017-08-01
The spread of an infectious disease can, in some cases, promote the propagation of other pathogens favoring violent outbreaks, which cause a discontinuous transition to an endemic state. The topology of the contact network plays a crucial role in these cooperative dynamics. We consider a susceptible-infected-removed-type model with two mutually cooperative pathogens: An individual already infected with one disease has an increased probability of getting infected by the other. We present a heterogeneous mean-field theoretical approach to the coinfection dynamics on generic uncorrelated power-law degree-distributed networks and validate its results by means of numerical simulations. We show that, when the second moment of the degree distribution is finite, the epidemic transition is continuous for low cooperativity, while it is discontinuous when cooperativity is sufficiently high. For scale-free networks, i.e., topologies with diverging second moment, the transition is instead always continuous. In this way we clarify the effect of heterogeneity and system size on the nature of the transition, and we validate the physical interpretation about the origin of the discontinuity.
Optimization-based topology identification of complex networks
Institute of Scientific and Technical Information of China (English)
Tang Sheng-Xue; Chen Li; He Yi-Gang
2011-01-01
In many cases,the topological structures of a complex network are unknown or uncertain,and it is of significance to identify the exact topological structure.An optimization-based method of identifying the topological structure of a complex network is proposed in this paper.Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network.Then,an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem.Compared with the previous adaptive synchronizationbased method,the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks.In some cases where the states of a complex network are only partially observable,the exact topological structure of a network can also be identified by using the proposed method.Finally,numerical simulations are provided to show the effectiveness of the proposed method.
Improving resource utilization in hierarchy network by optimizing topological structure
Liu, G. L.; Peng, H. P.; Li, L. X.; Sun, F.; Yang, Y. X.
2012-02-01
We study the performance of peer-to-peer (P2P) network built on the top of hierarchy topological structure of local area networks (LAN). We find that the topological structure of the underlying physical network has significant impacts on the resource utilization of the P2P overlay network. The larger size of the physical network is, the lower resource utilization of the overlay network is. Through optimizing the topological structure of physical network, we propose two novel schemes to improve the resource utilization. The experimental results show that in any case the resource utilization of P2P network can always achieve 100% by these two schemes.
Topological stabilization for synchronized dynamics on networks
Cencetti, Giulia; Bagnoli, Franco; Battistelli, Giorgio; Chisci, Luigi; Di Patti, Francesca; Fanelli, Duccio
2017-01-01
A general scheme is proposed and tested to control the symmetry breaking instability of a homogeneous solution of a spatially extended multispecies model, defined on a network. The inherent discreteness of the space makes it possible to act on the topology of the inter-nodes contacts to achieve the desired degree of stabilization, without altering the dynamical parameters of the model. Both symmetric and asymmetric couplings are considered. In this latter setting the web of contacts is assumed to be balanced, for the homogeneous equilibrium to exist. The performance of the proposed method are assessed, assuming the Complex Ginzburg-Landau equation as a reference model. In this case, the implemented control allows one to stabilize the synchronous limit cycle, hence time-dependent, uniform solution. A system of coupled real Ginzburg-Landau equations is also investigated to obtain the topological stabilization of a homogeneous and constant fixed point.
Novel topological descriptors for analyzing biological networks
Directory of Open Access Journals (Sweden)
Varmuza Kurt K
2010-06-01
Full Text Available Abstract Background Topological descriptors, other graph measures, and in a broader sense, graph-theoretical methods, have been proven as powerful tools to perform biological network analysis. However, the majority of the developed descriptors and graph-theoretical methods does not have the ability to take vertex- and edge-labels into account, e.g., atom- and bond-types when considering molecular graphs. Indeed, this feature is important to characterize biological networks more meaningfully instead of only considering pure topological information. Results In this paper, we put the emphasis on analyzing a special type of biological networks, namely bio-chemical structures. First, we derive entropic measures to calculate the information content of vertex- and edge-labeled graphs and investigate some useful properties thereof. Second, we apply the mentioned measures combined with other well-known descriptors to supervised machine learning methods for predicting Ames mutagenicity. Moreover, we investigate the influence of our topological descriptors - measures for only unlabeled vs. measures for labeled graphs - on the prediction performance of the underlying graph classification problem. Conclusions Our study demonstrates that the application of entropic measures to molecules representing graphs is useful to characterize such structures meaningfully. For instance, we have found that if one extends the measures for determining the structural information content of unlabeled graphs to labeled graphs, the uniqueness of the resulting indices is higher. Because measures to structurally characterize labeled graphs are clearly underrepresented so far, the further development of such methods might be valuable and fruitful for solving problems within biological network analysis.
Evolution of Cooperation on Temporal Networks
Li, Aming; Su, Qi; Cornelius, Sean P; Liu, Yang-Yu; Wang, Long
2016-01-01
The structure of social networks is a key determinant in fostering cooperation and other altruistic behavior among naturally selfish individuals. However, most real social interactions are temporal, being both finite in duration and spread out over time. This raises the question of whether stable cooperation can form despite an intrinsically fragmented social fabric. Here we develop a framework to study the evolution of cooperation on temporal networks in the setting of the classic Prisoner's Dilemma. By analyzing both real and synthetic datasets, we find that temporal networks generally facilitate the evolution of cooperation compared to their static counterparts. More interestingly, we find that the intrinsic human interactive pattern like bursty behavior impedes the evolution of cooperation. Finally, we introduce a measure to quantify the temporality present in networks and demonstrate that there is an intermediate level of temporality that boosts cooperation most. Our results open a new avenue for investi...
Autonomic computing enabled cooperative networked design
Wodczak, Michal
2014-01-01
This book introduces the concept of autonomic computing driven cooperative networked system design from an architectural perspective. As such it leverages and capitalises on the relevant advancements in both the realms of autonomic computing and networking by welding them closely together. In particular, a multi-faceted Autonomic Cooperative System Architectural Model is defined which incorporates the notion of Autonomic Cooperative Behaviour being orchestrated by the Autonomic Cooperative Networking Protocol of a cross-layer nature. The overall proposed solution not only advocates for the inc
Distributed game-theoretic topology control in cognitive networks
van den Berg, Eric; Fecko, Mariusz A.; Samtani, Sunil; Lacatus, Catalin; Patel, Mitesh
2010-04-01
Existing distributed approaches to topology control are poor at exploiting the large configuration space of cognitive radios and use extensive inter-node synchronization to aim at optimality. We have created a framework to design and study distributed topology control algorithms that combine network-formation games with machine learning. In our approach, carefully designed incentive mechanisms drive distributed autonomous agents towards a pre-determined system-wide optimum. The algorithms rely on game players to pursue selfish actions through low-complexity greedy algorithms with low or no signaling overhead. Convergence and stability are ensured through proper mechanism design that eliminates infinite adaptation process. The framework also includes game-theoretic extensions to influence behavior such as fragment merging and preferring links to weakly connected neighbors. Learning allows adaptations that prevent node starvation, reduce link flapping, and minimize routing disruptions by incorporating network layer feedback in cost/utility tradeoffs. The algorithms are implemented in Telcordia Wireless IP Scalable Network Emulator. Using greedy utility maximization as a benchmark, we show improvements of 13-40% for metrics such as the numbers of disconnected fragments and weakly connected nodes, topology stability, and disruption to user flows. The proposed framework is particularly suitable to cognitive radio networks because it can be extended to handle heterogeneous users with different utility functions and conflicting objectives. Desired outcome is then achieved by application of standard cooperation techniques such as utility transfer (payments). Additional cross-layer optimizations are possible by playing games at multiple layers in a highly scalable manner.
The topology of metabolic isotope labeling networks
Directory of Open Access Journals (Sweden)
Wiechert Wolfgang
2007-08-01
Full Text Available Abstract Background Metabolic Flux Analysis (MFA based on isotope labeling experiments (ILEs is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling networks (ILNs contain all essential information required to describe the flow of labeled material in an ILE. Whereas recent experimental progress paves the way for high-throughput MFA, large network investigations and exact statistical methods, these developments are still limited by the poor performance of computational routines used for the evaluation and design of ILEs. In this context, the global analysis of ILN topology turns out to be a clue for realizing large speedup factors in all required computational procedures. Results With a strong focus on the speedup of algorithms the topology of ILNs is investigated using graph theoretic concepts and algorithms. A rigorous determination of all cyclic and isomorphic subnetworks, accompanied by the global analysis of ILN connectivity is performed. Particularly, it is proven that ILNs always brake up into a large number of small strongly connected components (SCCs and, moreover, there are natural isomorphisms between many of these SCCs. All presented techniques are universal, i.e. they do not require special assumptions on the network structure, bidirectionality of fluxes, measurement configuration, or label input. The general results are exemplified with a practically relevant metabolic network which describes the central metabolism of E. coli comprising 10390 isotopomer pools. Conclusion Exploiting the topological features of ILNs leads to a significant speedup of all universal algorithms for ILE evaluation. It is proven in theory and exemplified with the E. coli example that a speedup factor of about 1000 compared to standard algorithms is achieved. This widely opens the door for new high performance algorithms suitable for high throughput applications and large ILNs. Moreover, for the first time the global
Cooperative and networking strategies in small business
Ferreira, João
2017-01-01
The book aims to collect the most recent research and best practices in the cooperative and networking small business field identifying new theoretical models and describing the relationship between cooperation and networks in the small business strategy context. It examines different concepts and analytical techniques better understand the links between cooperative strategies and networks in small business. It also studies the existing economic conditions of network and strategic implications to small business from the point of view of their internal and external consistency. Cooperation and networks is a fashionable topic. It is receiving increasing attention in popular management publications, as well as specialized academic journals. Cooperation between firms and industries is a means of leveraging and aggregating knowledge also generating direct benefits in terms of innovation, productivity and competitiveness. Various options and decisions made within the framework of strategic alliances may be identifi...
Deep community detection in topologically incomplete networks
Xin, Xin; Wang, Chaokun; Ying, Xiang; Wang, Boyang
2017-03-01
In this paper, we consider the problem of detecting communities in topologically incomplete networks (TIN), which are usually observed from real-world networks and where some edges are missing. Existing approaches to community detection always consider the input network as connected. However, more or less, even nearly all, edges are missing in real-world applications, e.g. the protein-protein interaction networks. Clearly, it is a big challenge to effectively detect communities in these observed TIN. At first, we bring forward a simple but useful method to address the problem. Then, we design a structured deep convolutional neural network (CNN) model to better detect communities in TIN. By gradually removing edges of the real-world networks, we show the effectiveness and robustness of our structured deep model on a variety of real-world networks. Moreover, we find that the appropriate choice of hop counts can improve the performance of our deep model in some degree. Finally, experimental results conducted on synthetic data sets also show the good performance of our proposed deep CNN model.
Mobility enhances cooperation in the presence of decision-making mistakes on complex networks
Yu, Wenjian
2011-02-01
Human migration has profound effects on social change. The introduction of success-driven migration to selfish individuals has revealed significant effects on the promotion of cooperation in spatial evolutionary games. In this study, we generalize the interaction structure from a spatial lattice to complex networks, such as Erdős-Renyi random networks and Barabási-Albert scale-free networks. Keeping the topology of networks, we investigate the robustness of cooperation when individuals can make decision errors. Numerical simulations demonstrate the effectiveness of success-driven migration on the enhancement of cooperation confronted with individual decision-making mistakes. In contrast, even a very low probability of decision errors can decrease the level of cooperation without mobility. Statistical analysis further exhibits the relation between network topology and migratory behavior.
Evolution of cooperation in multiplex networks.
Gómez-Gardeñes, Jesús; Reinares, Irene; Arenas, Alex; Floría, Luis Mario
2012-01-01
We study evolutionary game dynamics on structured populations in which individuals take part in several layers of networks of interactions simultaneously. This multiplex of interdependent networks accounts for the different kind of social ties each individual has. By coupling the evolutionary dynamics of a Prisoner's Dilemma game in each of the networks, we show that the resilience of cooperative behaviors for extremely large values of the temptation to defect is enhanced by the multiplex structure. Furthermore, this resilience is intrinsically related to a non-trivial organization of cooperation across the network layers, thus providing a new way out for cooperation to survive in structured populations.
Dissipative Topological Defects in Coupled Laser Networks
Pal, Vishwa; Chriki, Ronen; Friesem, Asher A; Davidson, Nir
2016-01-01
Topologically protected defects have been observed and studied in a wide range of fields, such as cosmology, spin systems, cold atoms and optics as they are quenched across a phase transition into an ordered state. Revealing their origin and control is becoming increasingly important field of research, as they limit the coherence of the system and its ability to approach a fully ordered state. Here, we present dissipative topological defects in a 1-D ring network of phase-locked lasers, and show how their formation is related to the Kibble-Zurek mechanism and is governed in a universal manner by two competing time scales of the lasers, namely the phase locking time and synchronization time of their amplitude fluctuations. The ratio between these two time scales depends on the system parameters such as gain and coupling strength, and thus offers the possibility to control the probability of topological defects in the system. Enabling the system to dissipate to the fully ordered, defect-free state can be exploi...
Algebraically contractible topological tensor network states
Energy Technology Data Exchange (ETDEWEB)
Denny, S J; Jaksch, D; Clark, S R [Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU (United Kingdom); Biamonte, J D, E-mail: s.denny1@physics.ox.ac.uk [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore)
2012-01-13
We adapt the bialgebra and Hopf relations to expose internal structure in the ground state of a Hamiltonian with Z{sub 2} topological order. Its tensor network description allows for exact contraction through simple diagrammatic rewrite rules. The contraction property does not depend on specifics such as geometry, but rather originates from the non-trivial algebraic properties of the constituent tensors. We then generalise the resulting tensor network from a spin-1/2 lattice to a class of exactly contractible states on spin-S degrees of freedom, yielding the most efficient tensor network description of finite Abelian lattice gauge theories. We gain a new perspective on these states as examples of two-dimensional quantum states with algebraically contractible tensor network representations. The introduction of local perturbations to the network is shown to reduce the von Neumann entropy of string-like regions, creating an unentangled sub-system within the bulk in a certain limit. We also show how local perturbations induce finite-range correlations in this system. This class of tensor networks is readily translated onto any lattice, and we differentiate between the physical consequences of bipartite and non-bipartite lattices on the properties of the corresponding quantum states. We explicitly show this on the hexagonal, square, kagome and triangular lattices. (paper)
Topological conformal defects with tensor networks
Hauru, Markus; Evenbly, Glen; Ho, Wen Wei; Gaiotto, Davide; Vidal, Guifre
2016-09-01
The critical two-dimensional classical Ising model on the square lattice has two topological conformal defects: the Z2 symmetry defect Dɛ and the Kramers-Wannier duality defect Dσ. These two defects implement antiperiodic boundary conditions and a more exotic form of twisted boundary conditions, respectively. On the torus, the partition function ZD of the critical Ising model in the presence of a topological conformal defect D is expressed in terms of the scaling dimensions Δα and conformal spins sα of a distinct set of primary fields (and their descendants, or conformal towers) of the Ising conformal field theory. This characteristic conformal data {Δα,sα}D can be extracted from the eigenvalue spectrum of a transfer matrix MD for the partition function ZD. In this paper, we investigate the use of tensor network techniques to both represent and coarse grain the partition functions ZDɛand ZD σ of the critical Ising model with either a symmetry defect Dɛ or a duality defect Dσ. We also explain how to coarse grain the corresponding transfer matrices MDɛand MD σ, from which we can extract accurate numerical estimates of {Δα,sα}Dɛ and {Δα,sα}Dσ. Two key ingredients of our approach are (i) coarse graining of the defect D , which applies to any (i.e., not just topological) conformal defect and yields a set of associated scaling dimensions Δα, and (ii) construction and coarse graining of a generalized translation operator using a local unitary transformation that moves the defect, which only exist for topological conformal defects and yields the corresponding conformal spins sα.
Discovering the Network Topology: An Efficient Approach for SDN
Directory of Open Access Journals (Sweden)
Leonardo OCHOA-ADAY
2016-11-01
Full Text Available Network topology is a physical description of the overall resources in the network. Collecting this information using efficient mechanisms becomes a critical task for important network functions such as routing, network management, quality of service (QoS, among many others. Recent technologies like Software-Defined Networks (SDN have emerged as promising approaches for managing the next generation networks. In order to ensure a proficient topology discovery service in SDN, we propose a simple agents-based mechanism. This mechanism improves the overall efficiency of the topology discovery process. In this paper, an algorithm for a novel Topology Discovery Protocol (SD-TDP is described. This protocol will be implemented in each switch through a software agent. Thus, this approach will provide a distributed solution to solve the problem of network topology discovery in a more simple and efficient way.
Topological evolution of virtual social networks by modeling social activities
Sun, Xin; Dong, Junyu; Tang, Ruichun; Xu, Mantao; Qi, Lin; Cai, Yang
2015-09-01
With the development of Internet and wireless communication, virtual social networks are becoming increasingly important in the formation of nowadays' social communities. Topological evolution model is foundational and critical for social network related researches. Up to present most of the related research experiments are carried out on artificial networks, however, a study of incorporating the actual social activities into the network topology model is ignored. This paper first formalizes two mathematical abstract concepts of hobbies search and friend recommendation to model the social actions people exhibit. Then a social activities based topology evolution simulation model is developed to satisfy some well-known properties that have been discovered in real-world social networks. Empirical results show that the proposed topology evolution model has embraced several key network topological properties of concern, which can be envisioned as signatures of real social networks.
DETECTION OF TOPOLOGICAL PATTERNS IN PROTEIN NETWORKS.
Energy Technology Data Exchange (ETDEWEB)
MASLOV,S.SNEPPEN,K.
2003-11-17
interesting property of many biological networks that was recently brought to attention of the scientific community [3, 4, 5] is an extremely broad distribution of node connectivities defined as the number of immediate neighbors of a given node in the network. While the majority of nodes have just a few edges connecting them to other nodes in the network, there exist some nodes, that we will refer to as ''hubs'', with an unusually large number of neighbors. The connectivity of the most connected hub in such a network is typically several orders of magnitude larger than the average connectivity in the network. Often the distribution of connectivities of individual nodes can be approximated by a scale-free power law form [3] in which case the network is referred to as scale-free. Among biological networks distributions of node connectivities in metabolic [4], protein interaction [5], and brain functional [6] networks can be reasonably approximated by a power law extending for several orders of magnitude. The set of connectivities of individual nodes is an example of a low-level (single-node) topological property of a network. While it answers the question about how many neighbors a given node has, it gives no information about the identity of those neighbors. It is clear that most functional properties of networks are defined at a higher topological level in the exact pattern of connections of nodes to each other. However, such multi-node connectivity patterns are rather difficult to quantify and compare between networks. In this work we concentrate on multi-node topological properties of protein networks. These networks (as any other biological networks) lack the top-down design. Instead, selective forces of biological evolution shape them from raw material provided by random events such as mutations within individual genes, and gene duplications. As a result their connections are characterized by a large degree of randomness. One may wonder which
Interference Cancellation in Cooperative CDMA Networks
Directory of Open Access Journals (Sweden)
A. Rajeswari
2011-01-01
Full Text Available The wireless communication networks are subjected to multi access interference and multipath fading. To minimize the interference cancellation in CDMA networks, multiple user detection schemes and cooperative communication networks are used. consider the uplink of a cooperative CDMA network, where users cooperate by relaying each other’s messages to the base station. When spreading waveforms are not orthogonal, multiple access interference (MAI exists at the relays and the destination, causing cooperative diversity gains to diminish. To overcome this problem, we integrate various multiuser detection (MUD schemes to mitigate MAI in achieving the full advantages of cooperation. Specifically, the relay-assisted decorrelating multiuser detector (RADMUD is proposed to separate interfering signals at the destination with the help of precoding at the relays along with pre-whitening at the destination. In this paper we examined the BER performance of various MUD schemes are analyzed and compared with cooperative system. The advantages of RAD-MUD with co-operative communication shows better BER performance compared with non co-operative wireless communication system and other existing cooperative MUD schemes are also shown through MATLAB Simulations.
Evolution of cooperation on stochastic dynamical networks.
Directory of Open Access Journals (Sweden)
Bin Wu
Full Text Available Cooperative behavior that increases the fitness of others at a cost to oneself can be promoted by natural selection only in the presence of an additional mechanism. One such mechanism is based on population structure, which can lead to clustering of cooperating agents. Recently, the focus has turned to complex dynamical population structures such as social networks, where the nodes represent individuals and links represent social relationships. We investigate how the dynamics of a social network can change the level of cooperation in the network. Individuals either update their strategies by imitating their partners or adjust their social ties. For the dynamics of the network structure, a random link is selected and breaks with a probability determined by the adjacent individuals. Once it is broken, a new one is established. This linking dynamics can be conveniently characterized by a Markov chain in the configuration space of an ever-changing network of interacting agents. Our model can be analytically solved provided the dynamics of links proceeds much faster than the dynamics of strategies. This leads to a simple rule for the evolution of cooperation: The more fragile links between cooperating players and non-cooperating players are (or the more robust links between cooperators are, the more likely cooperation prevails. Our approach may pave the way for analytically investigating coevolution of strategy and structure.
Cooperation and contagion in web-based, networked public goods experiments.
Suri, Siddharth; Watts, Duncan J
2011-03-11
A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.
Cooperation and contagion in web-based, networked public goods experiments.
Directory of Open Access Journals (Sweden)
Siddharth Suri
Full Text Available A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.
Determinants of public cooperation in multiplex networks
Battiston, Federico; Perc, Matjaž; Latora, Vito
2017-07-01
Synergies between evolutionary game theory and statistical physics have significantly improved our understanding of public cooperation in structured populations. Multiplex networks, in particular, provide the theoretical framework within network science that allows us to mathematically describe the rich structure of interactions characterizing human societies. While research has shown that multiplex networks may enhance the resilience of cooperation, the interplay between the overlap in the structure of the layers and the control parameters of the corresponding games has not yet been investigated. With this aim, we consider here the public goods game on a multiplex network, and we unveil the role of the number of layers and the overlap of links, as well as the impact of different synergy factors in different layers, on the onset of cooperation. We show that enhanced public cooperation emerges only when a significant edge overlap is combined with at least one layer being able to sustain some cooperation by means of a sufficiently high synergy factor. In the absence of either of these conditions, the evolution of cooperation in multiplex networks is determined by the bounds of traditional network reciprocity with no enhanced resilience. These results caution against overly optimistic predictions that the presence of multiple social domains may in itself promote cooperation, and they help us better understand the complexity behind prosocial behavior in layered social systems.
Nobelist TD LEE Scientist Cooperation Network and Scientist Innovation Ability Model
2013-01-01
Nobelist TD Lee scientist cooperation network (TDLSCN) and their innovation ability are studied. It is found that the TDLSCN not only has the common topological properties both of scale-free and small-world for a general scientist cooperation networks, but also appears the creation multiple-peak phenomenon for number of published paper with year evolution, which become Nobelist TD Lee’s significant mark distinguished from other scientists. This new phenomenon has not been revealed in the scie...
Nobelist TD Lee Scientist Cooperation Network and Scientist Innovation Ability Model
Institute of Scientific and Technical Information of China (English)
FANG; Jin-qing; LIU; Qiang
2013-01-01
We have studied Nobelist TD Lee scientist cooperation network(TDLSCN)and their innovation ability(Fig.1a).It is found that TDLSCN not only has the common topological properties both of scale-free and small-world for a general scientist cooperation network,but also the number of TD Lee’s published article appears the phenomenon of multiple-peak with year evolution,which becomes Nobelist TD Lee’s
Compressed Sensing-Based Multiuser Cooperative Networks
Institute of Scientific and Technical Information of China (English)
付晓梅; 崔阳然
2016-01-01
To avoid interference, compressed sensing is introduced into multiuser cooperative network. A coopera-tive compressed sensing and amplify-and-forward(CCS-AF)scheme is proposed, and it is proved that the channel capacity increases compared with the traditional cooperative scheme by considering the CCS-AF transmission ma-trix as the measurement matrix. Moreover, a new power allocation algorithm among the relays is proposed to im-prove the channel capacity. Numerical results validate the effectiveness of the proposed scheme.
Topology Identification of General Dynamical Network with Distributed Time Delays
Institute of Scientific and Technical Information of China (English)
WU Zhao-Yan; FU Xin-Chu
2009-01-01
General dynamical networks with distributed time delays are studied. The topology of the networks are viewed as unknown parameters, which need to be identified. Some auxiliary systems (also called the network estimators)are designed to achieve this goal. Both linear feedback control and adaptive strategy are applied in designing these network estimators. Based on linear matrix inequalities and the Lyapunov function method, the sufficient condition for the achievement of topology identification is obtained. This method can also better monitor the switching topology of dynamical networks. Illustrative examples are provided to show the effectiveness of this method.
Topology Optimization for Energy Management in Underwater Sensor Networks
2015-02-01
1 To appear in International Journal of Control as a regular paper Topology Optimization for Energy Management in Underwater Sensor Networks⋆ Devesh... topology that maximizes the probability of successful search (of a target) over a surveillance region. In a two-stage optimization, a genetic algorithm (GA...Adaptation to energy variations across the network is shown to be manifested as a change in the optimal network topology by using sensing and
Dynamic Evolution in Social Cooperation Networks with Node Failure
Yaofeng Zhang; Renbin Xiao
2013-01-01
Social cooperation networks are a kind of social networks in which individuals are linked through cooperation. Interference of economic crises, natural disasters and other emergencies may cause the node fails in social cooperation networks. To further study the influences of node failure on the total fitness degree and the cooperative ratio in social cooperation networks, the update rules of individual strategy and networks self-repair are constructed on the basis of the social cooperation ne...
Reconfiguring the Logical Topology With Performance Guarantees in WDM Networks
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
To improve the network performance after traffic demand changes, reconfiguring the logical topology is necessary. We present an ILP algorithm to find out the least lightpath changes needed with guaranteed network performance.
Identification of Boolean Networks Using Premined Network Topology Information.
Zhang, Xiaohua; Han, Huaxiang; Zhang, Weidong
2017-02-01
This brief aims to reduce the data requirement for the identification of Boolean networks (BNs) by using the premined network topology information. First, a matching table is created and used for sifting the true from the false dependences among the nodes in the BNs. Then, a dynamic extension to matching table is developed to enable the dynamic locating of matching pairs to start as soon as possible. Next, based on the pseudocommutative property of the semitensor product, a position-transform mining is carried out to further improve data utilization. Combining the above, the topology of the BNs can be premined for the subsequent identification. Examples are given to illustrate the efficiency of reducing the data requirement. Some excellent features, such as the online and parallel processing ability, are also demonstrated.
Directory of Open Access Journals (Sweden)
Ping Zhang
2009-01-01
Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including “what is each node's best reaction to maximize its utility?” and “what is the optimal reimbursement to encourage cooperation?” Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.
Modelling cooperative agents in infrastructure networks
Ligtvoet, A.; Chappin, E.J.L.; Stikkelman, R.M.
2010-01-01
This paper describes the translation of concepts of cooperation into an agent-based model of an industrial network. It first addresses the concept of cooperation and how this could be captured as heuristical rules within agents. Then it describes tests using these heuristics in an abstract model of
Benefits of Cooperative Learning in Weblog Networks
Wang, Jenny; Fang, Yuehchiu
2005-01-01
The purpose of this study was to explore the benefits of cooperative learning in weblog networks, focusing particularly on learning outcomes in college writing curriculum integrated with computer-mediated learning tool-weblog. The first section addressed the advantages of using weblogs in cooperative learning structure on teaching and learning.…
COOPERATIVE DYNAMICS OF LOYAL CUSTOMERS IN QUEUEING NETWORKS
Institute of Scientific and Technical Information of China (English)
Olivier GALLAY; Max-Olivier HONGLER
2008-01-01
We consider queueing networks (QN's) with feedback loops roamed by "intelligent" agents, able to select their routing on the basis of their measured waiting times at the QN nodes. This is an idealized model to discuss the dynamics of customers who stay loyal to a service supplier, provided their service time remains below a critical threshold. For these QN's, we show that the traffic flows may exhibit collective patterns typically encountered in multi-agent systems. In simple network topologies, the emergent cooperative behaviors manifest themselves via stable macroscopic temporal oscillations, synchronization of the queue contents and stabilization by noise phenomena. For a wide range of control parameters, the underlying presence of the law of large numbers enables us to use deterministic evolution laws to analytically characterize the cooperative evolution of our multi-agent systems. In particular, we study the case where the servers are sporadically subject to failures altering their ordinary behavior.
NCI’s Cooperative Human Tissue Network
Quality biospecimens are a foundational resource for cancer research. One of NCI’s longest running biospecimen programs is the Cooperative Human Tissue Network, a resource mainly for basic discovery and early translational research.
Opportunistic Cooperation in Cognitive Femtocell Networks
Urgaonkar, Rahul; Neely, Michael J.
2011-01-01
We investigate opportunistic cooperation between unlicensed secondary users and legacy primary users in a cognitive radio network. Specifically, we consider a model of a cognitive network where a secondary user can cooperatively transmit with the primary user in order to improve the latter's effective transmission rate. In return, the secondary user gets more opportunities for transmitting its own data when the primary user is idle. This kind of interaction between the primary and secondary u...
Energy Technology Data Exchange (ETDEWEB)
Weighill, Deborah A [ORNL; Jacobson, Daniel A [ORNL
2017-01-01
We explore the use of a network meta-modeling approach to compare the effects of similarity metrics used to construct biological networks on the topology of the resulting networks. This work reviews various similarity metrics for the construction of networks and various topology measures for the characterization of resulting network topology, demonstrating the use of these metrics in the construction and comparison of phylogenomic and transcriptomic networks.
Weighill, Deborah A; Jacobson, Daniel
2017-01-10
We explore the use of a network meta-modeling approach to compare the effects of similarity metrics used to construct biological networks on the topology of the resulting networks. This work reviews various similarity metrics for the construction of networks and various topology measures for the characterization of resulting network topology, demonstrating the use of these metrics in the construction and comparison of phylogenomic and transcriptomic networks.
Cooperative networking in a heterogeneous wireless medium
Ismail, Muhammad
2013-01-01
This brief focuses on radio resource allocation in a heterogeneous wireless medium. It presents radio resource allocation algorithms with decentralized implementation, which support both single-network and multi-homing services. The brief provides a set of cooperative networking algorithms, which rely on the concepts of short-term call traffic load prediction, network cooperation, convex optimization, and decomposition theory. In the proposed solutions, mobile terminals play an active role in the resource allocation operation, instead of their traditional role as passive service recipients in the networking environment.
Network topology of an experimental futures exchange
Wang, S. C.; Tseng, J. J.; Tai, C. C.; Lai, K. H.; Wu, W. S.; Chen, S. H.; Li, S. P.
2008-03-01
Many systems of different nature exhibit scale free behaviors. Economic systems with power law distribution in the wealth are one of the examples. To better understand the working behind the complexity, we undertook an experiment recording the interactions between market participants. A Web server was setup to administer the exchange of futures contracts whose liquidation prices were coupled to event outcomes. After free registration, participants started trading to compete for the money prizes upon maturity of the futures contracts at the end of the experiment. The evolving `cash' flow network was reconstructed from the transactions between players. We show that the network topology is hierarchical, disassortative and small-world with a power law exponent of 1.02±0.09 in the degree distribution after an exponential decay correction. The small-world property emerged early in the experiment while the number of participants was still small. We also show power law-like distributions of the net incomes and inter-transaction time intervals. Big winners and losers are associated with high degree, high betweenness centrality, low clustering coefficient and low degree-correlation. We identify communities in the network as groups of the like-minded. The distribution of the community sizes is shown to be power-law distributed with an exponent of 1.19±0.16.
Hypergraph topological quantities for tagged social networks
Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido
2009-09-01
Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.
Network-based criterion for the success of cooperation in an evolutionary prisoner's dilemma.
Devlin, Stephen; Treloar, Thomas
2012-08-01
We consider an evolutionary prisoner's dilemma on a random network. We introduce a simple quantitative network-based parameter and show that it effectively predicts the success of cooperation in simulations on the network. The criterion is shown to be accurate on a variety of networks with degree distributions ranging from regular to Poisson to scale free. The parameter allows for comparisons of random networks regardless of their underlying topology. Finally, we draw analogies between the criterion for the success of cooperation introduced here and existing criteria in other contexts.
Reliability Modeling and Analysis of SCI Topological Network
Directory of Open Access Journals (Sweden)
Hongzhe Xu
2012-03-01
Full Text Available The problem of reliability modeling on the Scalable Coherent Interface (SCI rings and topological network is studied. The reliability models of three SCI rings are developed and the factors which influence the reliability of SCI rings are studied. By calculating the shortest path matrix and the path quantity matrix of different types SCI network topology, the communication characteristics of SCI network are obtained. For the situations of the node-damage and edge-damage, the survivability of SCI topological network is studied.
Complex cooperative networks from evolutionary preferential attachment.
Directory of Open Access Journals (Sweden)
Julia Poncela
Full Text Available In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes of a pre-existent network, we study network growth and formation by proposing an evolutionary preferential attachment model, its main feature being that the capacity of a node to attract new links depends on a dynamical variable governed in turn by the node interactions. As a specific example, we focus on the problem of the emergence of cooperation by analyzing the formation of a social network with interactions given by the Prisoner's Dilemma. The resulting networks show many features of real systems, such as scale-free degree distributions, cooperative behavior and hierarchical clustering. Interestingly, results such as the cooperators being located mostly on nodes of intermediate degree are very different from the observations of cooperative behavior on static networks. The evolutionary preferential attachment mechanism points to an evolutionary origin of scale-free networks and may help understand similar feedback problems in the dynamics of complex networks by appropriately choosing the game describing the interaction of nodes.
National Research Council Canada - National Science Library
Cang, Zixuan; Wei, Guowei
2017-01-01
.... This representation reveals hidden structure-function relationships in biomolecules. We further integrate ESPH and deep convolutional neural networks to construct a multichannel topological neural network (TopologyNet...
Novel Concepts of Cooperative Wireless Networking
DEFF Research Database (Denmark)
Zhang, Qi
2008-01-01
; secondly, the increasing density of the wireless devices makes cooperation possible; last, the cost of information exchange (i.e. transmission power, transmission time, spectrum, etc.) is very low if information exchange over short-range link is needed. Cooperation changes the way of information delivery...... for a cognitive radio MAC protocol. Finally, a novel modulation, hierarchical modulation, is used to facilitate the uplink transmission in cooperative networks. Simulation and analytical analysis has been conducted. Great potentials of cooperation are shown in improving the energy effciency, spectrum effciency......Although wireless networks have achieved great success in the lastest two decades, the current wireless networks have difficulties to fulll users' ever-increasing expectations and needs. It is mainly due to available spectrum resource scarcity, limited battery capacity of wireless device...
Topological Effects on the Performance of Transportation Networks
Institute of Scientific and Technical Information of China (English)
ZHAO Xiao-Mei; GAO Zi-You
2007-01-01
@@ We investigate the influence of the network topology on the performance (characterized by the total system cost and maximal traffic volume) of transportation networks, where the weights are not static (constant), but dynamic (a function of the flow on the link). Four classes of networks are used in the simulation, including regular networks, random networks, small-world networks and scale-free networks. The initial simulation results show that topologies play important roles on the performance of transportation networks, and random networks have better performance than other networks. Also, we find that there are distinct difference of the link flow distribution for various networks in both the distribution function form and the span between the minimum and the maximum of the link flow, explaining the difference of the performance among distinct networks. These findings will be useful in network design problems of transportation systems.
Diversity, Coding, and Multiplexing Trade-Off of Network-Coded Cooperative Wireless Networks
Iezzi, Michela; Graziosi, Fabio
2012-01-01
In this paper, we study the performance of network-coded cooperative diversity systems with practical communication constraints. More specifically, we investigate the interplay between diversity, coding, and multiplexing gain when the relay nodes do not act as dedicated repeaters, which only forward data packets transmitted by the sources, but they attempt to pursue their own interest by forwarding packets which contain a network-coded version of received and their own data. We provide a very accurate analysis of the Average Bit Error Probability (ABEP) for two network topologies with three and four nodes, when practical communication constraints, i.e., erroneous decoding at the relays and fading over all the wireless links, are taken into account. Furthermore, diversity and coding gain are studied, and advantages and disadvantages of cooperation and binary Network Coding (NC) are highlighted. Our results show that the throughput increase introduced by NC is offset by a loss of diversity and coding gain. It i...
Green Mobile Clouds: Network Coding and User Cooperation for Improved Energy Efficiency
DEFF Research Database (Denmark)
Heide, Janus; Fitzek, Frank; Pedersen, Morten Videbæk;
2012-01-01
This paper highlights the benefits of user cooperation and network coding for energy saving in cellular networks. It is shown that these techniques allow for reliable and efficient multicast services from both a user and network perspective. The working principles and advantages in terms of energy...... and spectrum usage is explained for user cooperation, network coding and a combination of both. For multicast services it is shown that the proposed approaches can save as much as 90% of the energy on the user side and 66% on network provider side for the topologies under investigation. One interesting finding...... is that user cooperation can be beneficial for the network operator even if some users refuse to cooperate....
Improving gene regulatory network inference using network topology information.
Nair, Ajay; Chetty, Madhu; Wangikar, Pramod P
2015-09-01
Inferring the gene regulatory network (GRN) structure from data is an important problem in computational biology. However, it is a computationally complex problem and approximate methods such as heuristic search techniques, restriction of the maximum-number-of-parents (maxP) for a gene, or an optimal search under special conditions are required. The limitations of a heuristic search are well known but literature on the detailed analysis of the widely used maxP technique is lacking. The optimal search methods require large computational time. We report the theoretical analysis and experimental results of the strengths and limitations of the maxP technique. Further, using an optimal search method, we combine the strengths of the maxP technique and the known GRN topology to propose two novel algorithms. These algorithms are implemented in a Bayesian network framework and tested on biological, realistic, and in silico networks of different sizes and topologies. They overcome the limitations of the maxP technique and show superior computational speed when compared to the current optimal search algorithms.
International Business : cooperation within networks
Delft, Anne van
2011-01-01
Internationalisation is the expansion of a firms operations to foreign markets and includes not only import and export but also foreign direct investments and international cooperation. Today’s globalising economy has resulted in a growing number of small and medium enterprises (SMEs) undertaking in
A New Network Robustness Topology Measure based on Information Theory
Schieber, Tiago A; Frery, Alejandro C; Rosso, Osvaldo A; Pardalos, Panos M; Ravetti, Martin G
2014-01-01
A crucial challenge in network theory is to study how robust a network is when facing failures or attacks. In this work, we propose a novel methodology to measure the topological resilience and robustness of a network based on Information Theory quantifiers. This measure can be used with any probability distribution able to represent the network's properties. In particular, we analyze the efficiency in capturing small perturbations in the network's topology when using the degree and distance distributions. Theoretical examples and real networks are used to study the performance of this methodology. Although both cases show to be able to detect any single topological change, the distance distribution seems to be more consistent to reflect the network structural deviations. In all cases, the novel resilience and robustness measures computed by using the distance distribution reflect better the consequences of the failures, outperforming other methods.
Dynamic Spectrum Leasing to Cooperating Secondary Networks
Li, Cuilian
2008-01-01
We propose and analyze a dynamic implementation of the property-rights model of cognitive radio, whereby a primary link has the possibility to lease the owned spectrum to a MAC network of secondary nodes in exchange for cooperation in the form of distributed space-time coding. On one hand, the primary link attempts to maximize its quality of service in terms of Signal-to-interference-plus-noise ratio (SINR), accounting for the possible contribution from cooperation. On the other hand, nodes in the secondary network compete among themselves for transmission within the leased time-slot following a distributed heterogeneous opportunistic power control mechanism. The cooperation and competition between the primary and secondary network are cast in the framework of sequential game. We give consider both a baseline model with complete information and a more practical version with incomplete information, Using the backward induction approach for the former and providing approximating algorithm for the latter. Analys...
Opportunistic Cooperation in Cognitive Femtocell Networks
Urgaonkar, Rahul
2011-01-01
We investigate opportunistic cooperation between unlicensed secondary users and legacy primary users in a cognitive radio network. Specifically, we consider a model of a cognitive network where a secondary user can cooperatively transmit with the primary user in order to improve the latter's effective transmission rate. In return, the secondary user gets more opportunities for transmitting its own data when the primary user is idle. This kind of interaction between the primary and secondary users is different from the traditional dynamic spectrum access model in which the secondary users try to avoid interfering with the primary users while seeking transmission opportunities on vacant primary channels. In our model, the secondary users need to balance the desire to cooperate more (to create more transmission opportunities) with the need for maintaining sufficient energy levels for their own transmissions. Such a model is applicable in the emerging area of cognitive femtocell networks. We formulate the problem...
Asymmetric evaluation promotes cooperation in network population
Shen, Chen; Li, Xiaoping; Shi, Lei; Deng, Zhenghong
2017-05-01
The evolution of cooperation remains a fundamental challenge in human society. Many previous studies investigated these questions via spatial reciprocity, where players obtain their payoffs by interacting with their direct neighbors. It has also been verified that environmental factors can influence the evolution of cooperation theoretically and empirically. In reality, however, individuals may have the limit knowledge about their indirect neighbors. Inspired by this fact, we consider an asymmetric fitness calculation mechanism, which only integrates the environment factors into the focal player, to explore the evolution of cooperation. Here, the environmental factor is defined as the average payoff of all individual neighbors, which is regulated by a tunable parameter u. Through numerical simulation, we find that, compared with the traditional version (u = 0), that the cooperation level can be greatly enhanced when u is positive. Interestingly, the larger the value of u, the higher the level of cooperation. Finally, to explore the generality of this finding, we have tested the results on different topologies.
SIMULATION OF WIRELESS SENSOR NETWORK WITH HYBRID TOPOLOGY
Directory of Open Access Journals (Sweden)
J. Jaslin Deva Gifty
2016-03-01
Full Text Available The design of low rate Wireless Personal Area Network (WPAN by IEEE 802.15.4 standard has been developed to support lower data rates and low power consuming application. Zigbee Wireless Sensor Network (WSN works on the network and application layer in IEEE 802.15.4. Zigbee network can be configured in star, tree or mesh topology. The performance varies from topology to topology. The performance parameters such as network lifetime, energy consumption, throughput, delay in data delivery and sensor field coverage area varies depending on the network topology. In this paper, designing of hybrid topology by using two possible combinations such as star-tree and star-mesh is simulated to verify the communication reliability. This approach is to combine all the benefits of two network model. The parameters such as jitter, delay and throughput are measured for these scenarios. Further, MAC parameters impact such as beacon order (BO and super frame order (SO for low power consumption and high channel utilization, has been analysed for star, tree and mesh topology in beacon disable mode and beacon enable mode by varying CBR traffic loads.
Cooperative Localization for Mobile Networks
DEFF Research Database (Denmark)
Cakmak, Burak; Urup, Daniel Nygaard; Meyer, Florian;
2016-01-01
We propose a hybrid message passing method for distributed cooperative localization and tracking of mobile agents. Belief propagation and mean field message passing are employed for, respectively, the motion-related and measurementrelated part of the factor graph. Using a Gaussian belief approxim...... approximation, only three real values per message passing iteration have to be broadcast to neighboring agents. Despite these very low communication requirements, the estimation accuracy can be comparable to that of particle-based belief propagation....
International Business: cooperation within networks
Van Delft, Anne
2011-01-01
Internationalisation is the expansion of a firms operations to foreign markets and includes not only import and export but also foreign direct investments and international cooperation. Today’s globalising economy has resulted in a growing number of small and medium enterprises (SMEs) undertaking international activities. Internationalisation has been shown to be very beneficial for firms. Cross-border activities are an important means through which SMEs are able to create value, generate gro...
A Topology Designing System for a Computer Network
Institute of Scientific and Technical Information of China (English)
候正风
1998-01-01
In this paper,some problems on the topology design of network are discussed.An exact formula to calculate the delay of a line will be provided.In the design,the key problem is how to find some efficient heuristic algorithms.To solve this problem,a nonliner-discrete-capacity assignment heuristic and a hybrid perturbation heuristic are suggested.Then,a practical CAD system which helps design the topology of network will be introduced.
Optimal design of virtual topology reconfiguration in WDM optical networks
Institute of Scientific and Technical Information of China (English)
Fengqing Liu(刘逢清); Qingji Zeng(曾庆济); Xu Zhu(朱栩); Shilin Xiao(肖石林)
2003-01-01
Virtual topology of WDM optical networks is often designed for some specific traffic matrix to get thebest network performance. When traffic demand imposed on WDM optical networks changes, the networkperformance may degrade and even become unacceptable. So virtual topology need to be reconfigured.In previous works, virtual topology is reconfigured to achieve the best network performance, in which alarge number of lightpaths need to be set up or torn down. In this paper, we try to get a tradeoff betweenthe network performance and traffic disruption (or implementing cost). The problem of virtual topologyreconfiguration for changing traffic patterns is formulated as an optimization problem and a mixed integerlinear programming (MILP) algorithm is presented. Numerical results show that a large cost reduction ofreconfiguration can be achieved at the expense of network performance.
Extracting labeled topological patterns from samples of networks.
Directory of Open Access Journals (Sweden)
Christoph Schmidt
Full Text Available An advanced graph theoretical approach is introduced that enables a higher level of functional interpretation of samples of directed networks with identical fixed pairwise different vertex labels that are drawn from a particular population. Compared to the analysis of single networks, their investigation promises to yield more detailed information about the represented system. Often patterns of directed edges in sample element networks are too intractable for a direct evaluation and interpretation. The new approach addresses the problem of simplifying topological information and characterizes such a sample of networks by finding its locatable characteristic topological patterns. These patterns, essentially sample-specific network motifs with vertex labeling, might represent the essence of the intricate topological information contained in all sample element networks and provides as well a means of differentiating network samples. Central to the accurateness of this approach is the null model and its properties, which is needed to assign significance to topological patterns. As a proof of principle the proposed approach has been applied to the analysis of networks that represent brain connectivity before and during painful stimulation in patients with major depression and in healthy subjects. The accomplished reduction of topological information enables a cautious functional interpretation of the altered neuronal processing of pain in both groups.
Cooperative Handover Management in Dense Cellular Networks
Arshad, Rabe
2017-02-07
Network densification has always been an important factor to cope with the ever increasing capacity demand. Deploying more base stations (BSs) improves the spatial frequency utilization, which increases the network capacity. However, such improvement comes at the expense of shrinking the BSs\\' footprints, which increases the handover (HO) rate and may diminish the foreseen capacity gains. In this paper, we propose a cooperative HO management scheme to mitigate the HO effect on throughput gains achieved via cellular network densification. The proposed HO scheme relies on skipping HO to the nearest BS at some instances along the user\\'s trajectory while enabling cooperative BS service during HO execution at other instances. To this end, we develop a mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of coverage probability and user throughput. The results show that the proposed cooperative HO scheme outperforms the always best connected based association at high mobility. Also, the value of BS cooperation along with handover skipping is quantified with respect to the HO skipping only that has recently appeared in the literature. Particularly, the proposed cooperative HO scheme shows throughput gains of 12% to 27% and 17% on average, when compared to the always best connected and HO skipping only schemes at user velocity ranging from 80 km/h to 160 Km/h, respectively.
On topological spaces and topological groups with certain local countable networks
Gabriyelyan, S. S.; Kakol, J.
2014-01-01
Being motivated by the study of the space $C_c(X)$ of all continuous real-valued functions on a Tychonoff space $X$ with the compact-open topology, we introduced in [15] the concepts of a $cp$-network and a $cn$-network (at a point $x$) in $X$. In the present paper we describe the topology of $X$ admitting a countable $cp$- or $cn$-network at a point $x\\in X$. This description applies to provide new results about the strong Pytkeev property, already well recognized and applicable concept orig...
SOFM Neural Network Based Hierarchical Topology Control for Wireless Sensor Networks
2014-01-01
Well-designed network topology provides vital support for routing, data fusion, and target tracking in wireless sensor networks (WSNs). Self-organization feature map (SOFM) neural network is a major branch of artificial neural networks, which has self-organizing and self-learning features. In this paper, we propose a cluster-based topology control algorithm for WSNs, named SOFMHTC, which uses SOFM neural network to form a hierarchical network structure, completes cluster head selection by the...
Cooperative Tertiary Interaction Network Guides RNA Folding
Energy Technology Data Exchange (ETDEWEB)
Behrouzi, Reza; Roh, Joon Ho; Kilburn, Duncan; Briber, R.M.; Woodson, Sarah A. (JHU); (Maryland)
2013-04-08
Noncoding RNAs form unique 3D structures, which perform many regulatory functions. To understand how RNAs fold uniquely despite a small number of tertiary interaction motifs, we mutated the major tertiary interactions in a group I ribozyme by single-base substitutions. The resulting perturbations to the folding energy landscape were measured using SAXS, ribozyme activity, hydroxyl radical footprinting, and native PAGE. Double- and triple-mutant cycles show that most tertiary interactions have a small effect on the stability of the native state. Instead, the formation of core and peripheral structural motifs is cooperatively linked in near-native folding intermediates, and this cooperativity depends on the native helix orientation. The emergence of a cooperative interaction network at an early stage of folding suppresses nonnative structures and guides the search for the native state. We suggest that cooperativity in noncoding RNAs arose from natural selection of architectures conducive to forming a unique, stable fold.
Broadcast Network Coverage with Multicell Cooperation
Directory of Open Access Journals (Sweden)
Hongxiang Li
2010-01-01
Full Text Available Multicell cooperation has been identified as one of the underlying principles for future wireless communication systems. This paper studies the benefits of multicell cooperation in broadcast TV network from an information theoretical perspective. We define outage capacity as the figure of merit and derive the broadcast coverage area to evaluate such system. Specifically, we calculate the broadcast coverage area with given common information rate and outage probabilities when multiple base stations collaboratively transmit the broadcast signals. For the general MIMO case where receivers have multiple antennas, we provide simulation results to illustrate the expanded coverage area. In all cases, our results show that the coverage of a TV broadcast network can be significantly improved by multicell cooperation.
Recovering network topologies via Taylor expansion and compressive sensing
Energy Technology Data Exchange (ETDEWEB)
Li, Guangjun; Liu, Juan, E-mail: xqwu@whu.edu.cn, E-mail: liujuanjp@163.com [Computer School, Wuhan University, Hubei 430072 (China); Wu, Xiaoqun, E-mail: xqwu@whu.edu.cn, E-mail: liujuanjp@163.com; Lu, Jun-an [School of Mathematics and Statistics, Wuhan University, Hubei 430072 (China); Guo, Chi [Global Navigation Satellite System Research Center, Wuhan University, Hubei 430072 (China)
2015-04-15
Gaining knowledge of the intrinsic topology of a complex dynamical network is the precondition to understand its evolutionary mechanisms and to control its dynamical and functional behaviors. In this article, a general framework is developed to recover topologies of complex networks with completely unknown node dynamics based on Taylor expansion and compressive sensing. Numerical simulations illustrate the feasibility and effectiveness of the proposed method. Moreover, this method is found to have good robustness to weak stochastic perturbations. Finally, the impact of two major factors on the topology identification performance is evaluated. This method provides a natural and direct point to reconstruct network topologies from measurable data, which is likely to have potential applicability in a wide range of fields.
Recovering network topologies via Taylor expansion and compressive sensing.
Li, Guangjun; Wu, Xiaoqun; Liu, Juan; Lu, Jun-an; Guo, Chi
2015-04-01
Gaining knowledge of the intrinsic topology of a complex dynamical network is the precondition to understand its evolutionary mechanisms and to control its dynamical and functional behaviors. In this article, a general framework is developed to recover topologies of complex networks with completely unknown node dynamics based on Taylor expansion and compressive sensing. Numerical simulations illustrate the feasibility and effectiveness of the proposed method. Moreover, this method is found to have good robustness to weak stochastic perturbations. Finally, the impact of two major factors on the topology identification performance is evaluated. This method provides a natural and direct point to reconstruct network topologies from measurable data, which is likely to have potential applicability in a wide range of fields.
Censored cooperative positioning for dense wireless networks
Das, Kallol; Wymeersch, Henk
Cooperative positioning is an emerging topic in wireless sensor networks and navigation. It can improve the positioning accuracy and coverage in GPS-challenged conditions such as inside tunnels, in urban canyons, and indoors. Different algorithms have been proposed relying on iteratively exchanging
Emotion-Induced Topological Changes in Functional Brain Networks.
Park, Chang-Hyun; Lee, Hae-Kook; Kweon, Yong-Sil; Lee, Chung Tai; Kim, Ki-Tae; Kim, Young-Joo; Lee, Kyoung-Uk
2016-01-01
In facial expression perception, a distributed network is activated according to stimulus context. We proposed that an interaction between brain activation and stimulus context in response to facial expressions could signify a pattern of interactivity across the whole brain network beyond the face processing network. Functional magnetic resonance imaging data were acquired for 19 young healthy subjects who were exposed to either emotionally neutral or negative facial expressions. We constructed group-wise functional brain networks for 12 face processing areas [bilateral inferior occipital gyri (IOG), fusiform gyri (FG), superior temporal sulci (STS), amygdalae (AMG), inferior frontal gyri (IFG), and orbitofrontal cortices (OFC)] and for 73 whole brain areas, based on partial correlation of mean activation across subjects. We compared the topological properties of the networks with respect to functional distance-based measures, global and local efficiency, between the two types of face stimulus. In both face processing and whole brain networks, global efficiency was lower and local efficiency was higher for negative faces relative to neutral faces, indicating that network topology differed according to stimulus context. Particularly in the face processing network, emotion-induced changes in network topology were attributable to interactions between core (bilateral IOG, FG, and STS) and extended (bilateral AMG, IFG, and OFC) systems. These results suggest that changes in brain activation patterns in response to emotional face stimuli could be revealed as changes in the topological properties of functional brain networks for the whole brain as well as for face processing areas.
Exploitation and Cooperation in Networks
A. Galeotti; M. Melendez
2004-01-01
textabstractA fundamental question in social sciences is how trust emerges. We provide an answer which relies on the formation of social and economic relationships. We argue that behind trust lies the fact that individuals invest in connections taking into account the potential externalities network
Computer Network Topology Design in Limelight of Pascal Graph Property
Pal, Sanjay Kumar; 10.5121/ijngn.2010.2103
2010-01-01
Constantly growing demands of high productivity and security of computer systems and computer networks call the interest of specialists in the environment of construction of optimum topologies of computer mediums. In earliest phases of design, the study of the topological influence of the processes that happen in computer systems and computer networks allows to obtain useful information which possesses a significant value in the subsequent design. It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and...
Multiuser Cooperation with Hybrid Network Coding in Wireless Networks
Directory of Open Access Journals (Sweden)
G. Wang
2014-04-01
Full Text Available In this paper a hybrid Network Coding Cooperation (hybrid-NCC system is proposed to achieve both reliable transmission and high throughput in wireless networks. To balance the transmission reliability with throughput, the users are divided into cooperative sub-networks based on the geographical information, and the cooperation is implemented in each sub-network. After receiving signals from the cooperative partners, each user encodes them by exploiting hybrid network coding and then forwards the recoded symbols via the Link-Adaptive Regenerative (LAR relaying. First, the Diversity-Multiplexing Tradeoff (DMT is analyzed to demonstrate that the proposed system is bandwidth-efficient. Second, the Symbol Error Probability (SEP is also derived, which shows that the proposed system achieves a higher reliability as compared to the traditional Complex Field Network Coding Cooperation (CFNCC. Moreover, because dedicated relays are not required, our proposed system can both reduce the costs and enhance the flexibility of the implementation. Finally, the analytical results are supported and validated by numerical simulations.
Topology Control within the Airborne Network Backbone
2009-10-01
protocols resulting in infrequent topology control message exchange at the routing layer. The reactive protocols like ( AODV , TORA etc.) can also...each other. There are several ways MAToC interacts with different routing protocols : MAToC uses the Hello/Ack feedback mechanism of the proactive... routing protocols like OLSR and OSPF for monitoring links. The time dependent topology planned by deliberative MAToC is shared with proactive routing
Network topology of the desert rose
Directory of Open Access Journals (Sweden)
Sigmund Mongstad Hope
2015-09-01
Full Text Available Desert roses are gypsum crystals that consist of intersecting disks. We determine their geometrical structure using computer assisted tomography. By mapping the geometrical structure onto a graph, the topology of the desert rose is analyzed and compared to a model based on diffusion limited aggregation. By comparing the topology, we find that the model gets a number of the features of the real desert rose right, whereas others do not fit so well.
Inferring topologies of complex networks with hidden variables.
Wu, Xiaoqun; Wang, Weihan; Zheng, Wei Xing
2012-10-01
Network topology plays a crucial role in determining a network's intrinsic dynamics and function, thus understanding and modeling the topology of a complex network will lead to greater knowledge of its evolutionary mechanisms and to a better understanding of its behaviors. In the past few years, topology identification of complex networks has received increasing interest and wide attention. Many approaches have been developed for this purpose, including synchronization-based identification, information-theoretic methods, and intelligent optimization algorithms. However, inferring interaction patterns from observed dynamical time series is still challenging, especially in the absence of knowledge of nodal dynamics and in the presence of system noise. The purpose of this work is to present a simple and efficient approach to inferring the topologies of such complex networks. The proposed approach is called "piecewise partial Granger causality." It measures the cause-effect connections of nonlinear time series influenced by hidden variables. One commonly used testing network, two regular networks with a few additional links, and small-world networks are used to evaluate the performance and illustrate the influence of network parameters on the proposed approach. Application to experimental data further demonstrates the validity and robustness of our method.
Synergistic and antagonistic drug combinations depend on network topology.
Yin, Ning; Ma, Wenzhe; Pei, Jianfeng; Ouyang, Qi; Tang, Chao; Lai, Luhua
2014-01-01
Drug combinations may exhibit synergistic or antagonistic effects. Rational design of synergistic drug combinations remains a challenge despite active experimental and computational efforts. Because drugs manifest their action via their targets, the effects of drug combinations should depend on the interaction of their targets in a network manner. We therefore modeled the effects of drug combinations along with their targets interacting in a network, trying to elucidate the relationships between the network topology involving drug targets and drug combination effects. We used three-node enzymatic networks with various topologies and parameters to study two-drug combinations. These networks can be simplifications of more complex networks involving drug targets, or closely connected target networks themselves. We found that the effects of most of the combinations were not sensitive to parameter variation, indicating that drug combinational effects largely depend on network topology. We then identified and analyzed consistent synergistic or antagonistic drug combination motifs. Synergistic motifs encompass a diverse range of patterns, including both serial and parallel combinations, while antagonistic combinations are relatively less common and homogenous, mostly composed of a positive feedback loop and a downstream link. Overall our study indicated that designing novel synergistic drug combinations based on network topology could be promising, and the motifs we identified could be a useful catalog for rational drug combination design in enzymatic systems.
Topological properties of stock market networks: The case of Brazil
Tabak, Benjamin M.; Serra, Thiago R.; Cajueiro, Daniel O.
2010-08-01
This paper investigates the topological properties of the Brazilian stock market networks. We build the minimum spanning tree, which is based on the concept of ultrametricity, using the correlation matrix for a variety of stocks of different sectors. Our results suggest that stocks tend to cluster by sector. We employ a dynamic approach using complex network measures and find that the relative importance of different sectors within the network varies. The financial, energy and material sectors are the most important within the network.
Evolution of Cooperation in Adaptive Social Networks
Segbroeck, Sven Van; Santos, Francisco C.; Traulsen, Arne; Lenaerts, Tom; Pacheco, Jorge M.
Humans are organized in societies, a phenomenon that would never have been possible without the evolution of cooperative behavior. Several mechanisms that foster this evolution have been unraveled over the years, with population structure as a prominent promoter of cooperation. Modern networks of exchange and cooperation are, however, becoming increasingly volatile, and less and less based on long-term stable structure. Here, we address how this change of paradigm aspects the evolution of cooperation. We discuss analytical and numerical models in which individuals can break social ties and create new ones. Interactions are modeled as two-player dilemmas of cooperation. Once a link between two individuals has formed, the productivity of this link is evaluated. Links can be broken off at different rates. This individual capacity of forming new links or severing inconvenient ones can effectively change the nature of the game. We address random formation of new links and local linking rules as well as different individual capacities to maintain social interactions. We conclude by discussing how adaptive social networks can become an important step towards more realistic models of cultural dynamics.
Evolution of cooperative imitators in social networks
Li, Yixiao
2017-02-01
Many evolutionary game models for network reciprocity are based on an imitation dynamics, yet how semirational imitators prevail has seldom been explained. Here we use a model to investigate the coevolutionary dynamics of cooperation and partnership adjustment in a polygenic population of semirational imitators and rational payoff maximizers. A rational individual chooses a strategy best responding to its neighbors when updating strategy and switches to a new partner who can bring it the maximal payoff from all candidates when adjusting the partnership. In contrast, a semirational individual imitates its neighbor's strategy directly and adjusts its partnership based upon a simple reputation rule. Individual-based simulations show that cooperation cannot evolve in a population of all best responders even if they can switch their partners to somebody who can reward them best in game playing. However, when imitators exist, a stable community that consists of cooperative imitators emerges. Further, we show that a birth-death selection mechanism can eliminate all best responders, cultivating a social regime of all cooperative imitators. Compared with parallel simulations that assume fixed networks, cooperative imitators are evolutionarily favored, provided they are able to adjust their partners.
Application and Implementation of Network Coding for Cooperative Wireless Networks
DEFF Research Database (Denmark)
Pedersen, Morten Videbæk
2012-01-01
network coding, which from a theoretical point of view has the potential to make our networks faster, energy-efficient, robust and more secure. In this PhD I provide an experimental platform for network coding in order to evaluate whether these theoretical merits may be transferred to practice. I provide......Today the traditional client-server network architecture is the predominant model in our network infrastructure. However, for the increasing amount of \\live" services such as TV and radio being digitalized and the growing amount of user generated content, the centralized model can provide a poor...... utilization of the available network resources. To efficiently support these services we look towards the field of user cooperation. In order to create the incentive for users to join the cooperation we must make the gain larger than the expense. In this PhD I have suggested two central ways of achieving this...
Gene network interconnectedness and the generalized topological overlap measure
Directory of Open Access Journals (Sweden)
Horvath Steve
2007-01-01
Full Text Available Abstract Background Network methods are increasingly used to represent the interactions of genes and/or proteins. Genes or proteins that are directly linked may have a similar biological function or may be part of the same biological pathway. Since the information on the connection (adjacency between 2 nodes may be noisy or incomplete, it can be desirable to consider alternative measures of pairwise interconnectedness. Here we study a class of measures that are proportional to the number of neighbors that a pair of nodes share in common. For example, the topological overlap measure by Ravasz et al. 1 can be interpreted as a measure of agreement between the m = 1 step neighborhoods of 2 nodes. Several studies have shown that two proteins having a higher topological overlap are more likely to belong to the same functional class than proteins having a lower topological overlap. Here we address the question whether a measure of topological overlap based on higher-order neighborhoods could give rise to a more robust and sensitive measure of interconnectedness. Results We generalize the topological overlap measure from m = 1 step neighborhoods to m ≥ 2 step neighborhoods. This allows us to define the m-th order generalized topological overlap measure (GTOM by (i counting the number of m-step neighbors that a pair of nodes share and (ii normalizing it to take a value between 0 and 1. Using theoretical arguments, a yeast co-expression network application, and a fly protein network application, we illustrate the usefulness of the proposed measure for module detection and gene neighborhood analysis. Conclusion Topological overlap can serve as an important filter to counter the effects of spurious or missing connections between network nodes. The m-th order topological overlap measure allows one to trade-off sensitivity versus specificity when it comes to defining pairwise interconnectedness and network modules.
Evaluation of Topology-Aware Broadcast Algorithms for Dragonfly Networks
Energy Technology Data Exchange (ETDEWEB)
Dorier, Matthieu; Mubarak, Misbah; Ross, Rob; Li, Jianping Kelvin; Carothers, Christopher D.; Ma, Kwan-Liu
2016-09-12
Two-tiered direct network topologies such as Dragonflies have been proposed for future post-petascale and exascale machines, since they provide a high-radix, low-diameter, fast interconnection network. Such topologies call for redesigning MPI collective communication algorithms in order to attain the best performance. Yet as increasingly more applications share a machine, it is not clear how these topology-aware algorithms will react to interference with concurrent jobs accessing the same network. In this paper, we study three topology-aware broadcast algorithms, including one designed by ourselves. We evaluate their performance through event-driven simulation for small- and large-sized broadcasts (in terms of both data size and number of processes). We study the effect of different routing mechanisms on the topology-aware collective algorithms, as well as their sensitivity to network contention with other jobs. Our results show that while topology-aware algorithms dramatically reduce link utilization, their advantage in terms of latency is more limited.
Topology-free querying of protein interaction networks.
Bruckner, Sharon; Hüffner, Falk; Karp, Richard M; Shamir, Ron; Sharan, Roded
2010-03-01
In the network querying problem, one is given a protein complex or pathway of species A and a protein-protein interaction network of species B; the goal is to identify subnetworks of B that are similar to the query in terms of sequence, topology, or both. Existing approaches mostly depend on knowledge of the interaction topology of the query in the network of species A; however, in practice, this topology is often not known. To address this problem, we develop a topology-free querying algorithm, which we call Torque. Given a query, represented as a set of proteins, Torque seeks a matching set of proteins that are sequence-similar to the query proteins and span a connected region of the network, while allowing both insertions and deletions. The algorithm uses alternatively dynamic programming and integer linear programming for the search task. We test Torque with queries from yeast, fly, and human, where we compare it to the QNet topology-based approach, and with queries from less studied species, where only topology-free algorithms apply. Torque detects many more matches than QNet, while giving results that are highly functionally coherent.
Scheduling and Topology Design in Networks with Directional Antennas
2017-05-19
match the topology design and traffic patterns. Specifically, we find that commonly used, suboptimal schedules can lead to greatly reduced network...1/4 (b) Uniform schedule (i) 3/14 (ii) 3/14 (iii) 2/7 (iv) 2/7 (c) Optimal schedule for all-all unicast traffic Fig. 2: Example schedules for a line...same schedule is repeated through the duration of network use. Example schedules for a four-node network with a line topology are shown in Fig. 2. We
Stabilization Strategies of Supply Networks with Stochastic Switched Topology
Directory of Open Access Journals (Sweden)
Shukai Li
2013-01-01
Full Text Available In this paper, a dynamical supply networks model with stochastic switched topology is presented, in which the stochastic switched topology is dependent on a continuous time Markov process. The goal is to design the state-feedback control strategies to stabilize the dynamical supply networks. Based on Lyapunov stability theory, sufficient conditions for the existence of state feedback control strategies are given in terms of matrix inequalities, which ensure the robust stability of the supply networks at the stationary states and a prescribed H∞ disturbance attenuation level with respect to the uncertain demand. A numerical example is given to illustrate the effectiveness of the proposed method.
The effects of degree correlations on network topologies and robustness
Institute of Scientific and Technical Information of China (English)
Zhao Jing; Tao Lin; Yu Hong; Luo Jian-Hua; Cao Zhi-Wei; Li Yi-Xue
2007-01-01
Complex networks have been applied to model numerous interactive nonlinear systems in the real world. Knowledge about network topology is crucial to an understanding of the function, performance and evolution of complex systems. In the last few years, many network metrics and models have been proposed to investigate the network topology, dynamics and evolution. Since these network metrics and models are derived from a wide range of studies, a systematic study is required to investigate the correlations among them. The present paper explores the effect of degree correlation on the other network metrics through studying an ensemble of graphs where the degree sequence (set of degrees) is fixed.We show that to some extent, the characteristic path length, clustering coefficient, modular extent and robustness of networks are directly influenced by the degree correlation.
Complex brain networks: From topological communities to clustered dynamics
Indian Academy of Sciences (India)
Lucia Zemanová; Gorka Zamora-López; Changsong Zhou; Jürgen Kurths
2008-06-01
Recent research has revealed a rich and complicated network topology in the cortical connectivity of mammalian brains. A challenging task is to understand the implications of such network structures on the functional organisation of the brain activities. We investigate synchronisation dynamics on the corticocortical network of the cat by modelling each node of the network (cortical area) with a subnetwork of interacting excitable neurons. We find that this network of networks displays clustered synchronisation behaviour and the dynamical clusters closely coincide with the topological community structures observed in the anatomical network. The correlation between the firing rate of the areas and the areal intensity is additionally examined. Our results provide insights into the relationship between the global organisation and the functional specialisation of the brain cortex.
Dynamics on networks: competition of temporal and topological correlations
Artime, Oriol; Miguel, Maxi San
2016-01-01
Links in many real-world networks activate and deactivate in correspondence to the sporadic interactions between the elements of the system. The activation patterns may be irregular or bursty and play an important role on the dynamics of processes taking place in the network. Social networks and information or disease spreading processes are paradigmatic examples of this situation. Besides the burstiness, several other correlations may appear in the network dynamics. The activation of links connecting to the same node can be synchronized or the existence of communities in the network may mediate the activation patterns of internal an external links. Here we study the competition of topological and temporal correlations in link activation and how they affect the dynamics of systems running on the network. Interestingly, both types of correlations by separate have opposite effects: one (topological) delays the dynamics of processes on the network, while the other (temporal) accelerates it. When they occur toget...
In silico network topology-based prediction of gene essentiality
da Silva, Joao Paulo Muller; Mombach, Jose Carlos Merino; Vieira, Renata; da Silva, Jose Guliherme Camargo; Lemke, Ney; Sinigaglia, Marialva
2007-01-01
The identification of genes essential for survival is important for the understanding of the minimal requirements for cellular life and for drug design. As experimental studies with the purpose of building a catalog of essential genes for a given organism are time-consuming and laborious, a computational approach which could predict gene essentiality with high accuracy would be of great value. We present here a novel computational approach, called NTPGE (Network Topology-based Prediction of Gene Essentiality), that relies on network topology features of a gene to estimate its essentiality. The first step of NTPGE is to construct the integrated molecular network for a given organism comprising protein physical, metabolic and transcriptional regulation interactions. The second step consists in training a decision tree-based machine learning algorithm on known essential and non-essential genes of the organism of interest, considering as learning attributes the network topology information for each of these genes...
Network topology analysis approach on China's QFII stock investment behavior
Zhang, Yongjie; Cao, Xing; He, Feng; Zhang, Wei
2017-05-01
In this paper, the investment behavior of QFII in China stock market from 2004 to 2015 is studied with the network topology method. Based on the nodes topological characteristics, stock holding fluctuations correlation is studied from the micro network level. We conclude that the QFII mutual stock holding network have both scale free and small world properties, which presented mainly small world characteristics from 2005 to 2011, and scale free characteristics from 2012 to 2015. Moreover, fluctuations correlation is different with different nodes topological characteristics. In different economic periods, QFII represented different connection patterns and they reacted to the market crash spontaneously. Thus, this paper provides the first evidence of complex network research on QFII' investment behavior in China as an emerging market.
Exploring Alternative Topologies for Network-on-Chip Architectures
Directory of Open Access Journals (Sweden)
Shafi Patel
2011-01-01
Full Text Available With increase in integration density and complexity of the system-on-Chip (SOC, the conventional interconnects are not suitable to fulfill the demands. The application of traditional network technologies in the form of Network-on-Chip is a potential solution. NoC design space has many variables. Selection of a better topology results in lesser complexities and better power-efficiency. In the proposed work, key research area in Network-on-chip design targeting communication infrastructure specially focusing on optimized topology design is worked upon. The simulation is modeled using a conventional network simulator tool packet tracer 5.3, in which by selecting proposed Topology 35.7 % reduction in traversing the longest path is observed.
Small Worlds in the Tree Topologies of Wireless Sensor Networks
DEFF Research Database (Denmark)
Qiao, Li; Lingguo, Cui; Baihai, Zhang
2010-01-01
In this study, the characteristics of small worlds are investigated in the context of the tree topologies of wireless sensor networks. Tree topologies, which construct spatial graphs with larger characteristic path lengths than random graphs and small clustering coefficients, are ubiquitous...... in wireless sensor networks. Suffering from the link rewiring or the link addition, the characteristic path length of the tree topology reduces rapidly and the clustering coefficient increases greatly. The variety of characteristic path length influences the time synchronization characteristics of wireless...... sensor networks greatly. With the increase of the link rewiring or the link addition probability, the time synchronization error decreases drastically. Two novel protocols named LEACH-SW and TREEPSI-SW are proposed to improve the performances of the sensor networks, in which the small world...
Characterization of Static/Dynamic Topological Routing For Grid Networks
DEFF Research Database (Denmark)
Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir
2009-01-01
Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures. In addition, the high requirements of future services and applications demand more flexible...
Connected Dominating Set Based Topology Control in Wireless Sensor Networks
He, Jing
2012-01-01
Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network.…
Connected Dominating Set Based Topology Control in Wireless Sensor Networks
He, Jing
2012-01-01
Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network.…
Globalization, Education, and the Topology of Social Networks
Vigier, A.
2008-01-01
The present paper suggests a possible framework to analyze the impact of changes to the economic and social environment on the topology of networks formed. Economic (costs) and social (norms) constraints bind individuals in their ability to create ties with others. When global phenomena affect these constraints, the overall shapes of resulting networks naturally alter. I attempt to shed light on this relationship.
Static analysis of topology-dependent broadcast networks
DEFF Research Database (Denmark)
Nanz, Sebastian; Nielson, Flemming; Nielson, Hanne Riis
2010-01-01
changing network topology is a crucial ingredient. In this paper, we develop a static analysis that automatically constructs an abstract transition system, labelled by actions and connectivity information, to yield a mobility-preserving finite abstraction of the behaviour of a network expressed...
Topology design and performance analysis of an integrated communication network
Li, V. O. K.; Lam, Y. F.; Hou, T. C.; Yuen, J. H.
1985-01-01
A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix.
Cooperative robots and sensor networks 2014
Khelil, Abdelmajid
2014-01-01
This book is the second volume on Cooperative Robots and Sensor Networks. The primary objective of this book is to provide an up-to-date reference for cutting-edge studies and research trends related to mobile robots and wireless sensor networks, and in particular for the coupling between them. Indeed, mobile robots and wireless sensor networks have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and wireless sensor networks have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The book consists of ten chapters, organized into four parts. The first part of the book presents three chapters related to localization of mobile robots using wireless sensor networks. Two chapters presented new solutions based Extended Kalman Filter and Particle Fi...
数据中心网络拓扑探讨%Data-Centers Network Topologies
Institute of Scientific and Technical Information of China (English)
丁泽柳
2012-01-01
文章认为数据中心网络的拓扑结构确定其硬件设备的选取标准、设备之间的协同和互联方式、以及数据中心的运行和维护机制.针对各种新的服务需求对数据中心网络提出的更高的结构性要求,业界提出了一些新的数据中心网络拓扑结构.文章介绍并分析了这些拓扑结构,主要有改进树形结构(如Fat-tree、VL2)、递归层次结构(如DCell、FiConn、BCube)、能量比例结构、矩阵结构.%The topology of a data-center network (DCN) determines which device standards are used, how devices cooperate and interconnect, and which 0AM mechanisms are used in the data-center. Diverse services require improved topological performance. To this end, we propose improved tree topologies, such as Fat-tree and VL2; recursively hierarchical topologies, such as DCell, FiConn, and BCube; energy percentage topologies; and matrix topologies,
Chen, Qing; Zhang, Jinxiu; Hu, Ze
2017-01-01
This article investigates the dynamic topology control problem of satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites’ relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime. PMID:28241474
Perspective Application of Passive Optical Network with Optimized Bus Topology
Directory of Open Access Journals (Sweden)
P. Lafata
2012-06-01
Full Text Available Passive optical networks (PONs represent a promising solution for modern access telecommunication networks.These networks are able to meet the increasing demands on transmission rate for demanding multimedia services,while they can offer typical shared transmission speed of 1.25 or 2.5 Gbps. The major role in deploying opticaldistribution networks ODNs plays the maximum attenuable loss, which is caused mainly by passive optical splitters.This paper proposes an innovative application of passive optical networks with optimized bus topology especially forlocal backbone data networks. Due to using only passive components, it is necessary to optimize certain parameters,especially an overall attenuation balance. Considering the possibility of such optimization, the passive optical networkwith optimized bus topology provides several interesting opportunities for specific applications. This paper will presentselected aspects of passive optical networks and splitters with asymmetric splitting ratio. The essential part is focusedon the practical demonstration of their use to optimize the passive optical network with bus topology, which acts as alocal backbone network for structured cabling systems, and for local data networks in large buildings.
Cooperative Spatial Retreat for Resilient Drone Networks.
Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon
2017-05-03
Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes.
Robust network topologies for generating switch-like cellular responses.
Directory of Open Access Journals (Sweden)
Najaf A Shah
2011-06-01
Full Text Available Signaling networks that convert graded stimuli into binary, all-or-none cellular responses are critical in processes ranging from cell-cycle control to lineage commitment. To exhaustively enumerate topologies that exhibit this switch-like behavior, we simulated all possible two- and three-component networks on random parameter sets, and assessed the resulting response profiles for both steepness (ultrasensitivity and extent of memory (bistability. Simulations were used to study purely enzymatic networks, purely transcriptional networks, and hybrid enzymatic/transcriptional networks, and the topologies in each class were rank ordered by parametric robustness (i.e., the percentage of applied parameter sets exhibiting ultrasensitivity or bistability. Results reveal that the distribution of network robustness is highly skewed, with the most robust topologies clustering into a small number of motifs. Hybrid networks are the most robust in generating ultrasensitivity (up to 28% and bistability (up to 18%; strikingly, a purely transcriptional framework is the most fragile in generating either ultrasensitive (up to 3% or bistable (up to 1% responses. The disparity in robustness among the network classes is due in part to zero-order ultrasensitivity, an enzyme-specific phenomenon, which repeatedly emerges as a particularly robust mechanism for generating nonlinearity and can act as a building block for switch-like responses. We also highlight experimentally studied examples of topologies enabling switching behavior, in both native and synthetic systems, that rank highly in our simulations. This unbiased approach for identifying topologies capable of a given response may be useful in discovering new natural motifs and in designing robust synthetic gene networks.
Identifying the topology of networks with discrete-time dynamics
Guo, Shu-Juan; Fu, Xin-Chu
2010-07-01
We suggest a method for identifying the topology of networks with discrete-time dynamics based on the dynamical evolution supported by the networks. The Frobenius matrix norm and Lasalle's invariance principle are used in this work. The network concerned can be directed or undirected, weighted or unweighted, and the local dynamics of each node can be nonidentical. The connections among the nodes can be all unknown or partially known. Finally, several examples are illustrated to verify the theoretical results.
Identifying the topology of networks with discrete-time dynamics
Energy Technology Data Exchange (ETDEWEB)
Guo Shujuan [School of Physics and Mathematics, Changzhou University, Changzhou 213164 (China); Fu Xinchu, E-mail: sjguo1@gmail.co, E-mail: enxcfu@gmail.co [Department of Mathematics, Shanghai University, Shanghai 200444 (China)
2010-07-23
We suggest a method for identifying the topology of networks with discrete-time dynamics based on the dynamical evolution supported by the networks. The Frobenius matrix norm and Lasalle's invariance principle are used in this work. The network concerned can be directed or undirected, weighted or unweighted, and the local dynamics of each node can be nonidentical. The connections among the nodes can be all unknown or partially known. Finally, several examples are illustrated to verify the theoretical results.
Deterministic chaos control in neural networks on various topologies
Neto, A. J. F.; Lima, F. W. S.
2017-01-01
Using numerical simulations, we study the control of deterministic chaos in neural networks on various topologies like Voronoi-Delaunay, Barabási-Albert, Small-World networks and Erdös-Rényi random graphs by "pinning" the state of a "special" neuron. We show that the chaotic activity of the networks or graphs, when control is on, can become constant or periodic.
Molecular network topology and reliability for multipurpose diagnosis
Directory of Open Access Journals (Sweden)
Jalil MA
2011-10-01
Full Text Available MA Jalil1, N Moongfangklang2,3, K Innate4, S Mitatha3, J Ali5, PP Yupapin41Ibnu Sina Institute of Fundamental Science Studies, Nanotechnology Research Alliance, University of Technology Malaysia, Johor Bahru, Malaysia; 2School of Information and Communication Technology, Phayao University, Phayao, Thailand; 3Hybrid Computing Research Laboratory, Faculty of Engineering, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand; 4Nanoscale Science and Engineering Research Alliance, Advanced Research Center for Photonics, Faculty of Science, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand; 5Institute of Advanced Photonics Science, Nanotechnology Research Alliance, University of Technology Malaysia, Johor Bahru, MalaysiaAbstract: This investigation proposes the use of molecular network topology for drug delivery and diagnosis network design. Three modules of molecular network topologies, such as bus, star, and ring networks, are designed and manipulated based on a micro- and nanoring resonator system. The transportation of the trapping molecules by light in the network is described and the theoretical background is reviewed. The quality of the network is analyzed and calculated in terms of signal transmission (ie, signal to noise ratio and crosstalk effects. Results obtained show that a bus network has advantages over star and ring networks, where the use of mesh networks is possible. In application, a thin film network can be fabricated in the form of a waveguide and embedded in artificial bone, which can be connected to the required drug targets. The particular drug/nutrient can be transported to the required targets via the particular network used.Keywords: molecular network, network reliability, network topology, drug network, multi-access network
Topological effects of data incompleteness of gene regulatory networks
Sanz, J; Borge-Holthoefer, J; Moreno, Y
2012-01-01
The topological analysis of biological networks has been a prolific topic in network science during the last decade. A persistent problem with this approach is the inherent uncertainty and noisy nature of the data. One of the cases in which this situation is more marked is that of transcriptional regulatory networks (TRNs) in bacteria. The datasets are incomplete because regulatory pathways associated to a relevant fraction of bacterial genes remain unknown. Furthermore, direction, strengths and signs of the links are sometimes unknown or simply overlooked. Finally, the experimental approaches to infer the regulations are highly heterogeneous, in a way that induces the appearance of systematic experimental-topological correlations. And yet, the quality of the available data increases constantly. In this work we capitalize on these advances to point out the influence of data (in)completeness and quality on some classical results on topological analysis of TRNs, specially regarding modularity at different level...
Topology for efficient information dissemination in ad-hoc networking
Jennings, E.; Okino, C. M.
2002-01-01
In this paper, we explore the information dissemination problem in ad-hoc wirless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bould relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of such events is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination.
Network topology and resilience analysis of South Korean power grid
Kim, Dong Hwan; Eisenberg, Daniel A.; Chun, Yeong Han; Park, Jeryang
2017-01-01
In this work, we present topological and resilience analyses of the South Korean power grid (KPG) with a broad voltage level. While topological analysis of KPG only with high-voltage infrastructure shows an exponential degree distribution, providing another empirical evidence of power grid topology, the inclusion of low voltage components generates a distribution with a larger variance and a smaller average degree. This result suggests that the topology of a power grid may converge to a highly skewed degree distribution if more low-voltage data is considered. Moreover, when compared to ER random and BA scale-free networks, the KPG has a lower efficiency and a higher clustering coefficient, implying that highly clustered structure does not necessarily guarantee a functional efficiency of a network. Error and attack tolerance analysis, evaluated with efficiency, indicate that the KPG is more vulnerable to random or degree-based attacks than betweenness-based intentional attack. Cascading failure analysis with recovery mechanism demonstrates that resilience of the network depends on both tolerance capacity and recovery initiation time. Also, when the two factors are fixed, the KPG is most vulnerable among the three networks. Based on our analysis, we propose that the topology of power grids should be designed so the loads are homogeneously distributed, or functional hubs and their neighbors have high tolerance capacity to enhance resilience.
Defining network topologies that can achieve biochemical adaptation.
Ma, Wenzhe; Trusina, Ala; El-Samad, Hana; Lim, Wendell A; Tang, Chao
2009-08-21
Many signaling systems show adaptation-the ability to reset themselves after responding to a stimulus. We computationally searched all possible three-node enzyme network topologies to identify those that could perform adaptation. Only two major core topologies emerge as robust solutions: a negative feedback loop with a buffering node and an incoherent feedforward loop with a proportioner node. Minimal circuits containing these topologies are, within proper regions of parameter space, sufficient to achieve adaptation. More complex circuits that robustly perform adaptation all contain at least one of these topologies at their core. This analysis yields a design table highlighting a finite set of adaptive circuits. Despite the diversity of possible biochemical networks, it may be common to find that only a finite set of core topologies can execute a particular function. These design rules provide a framework for functionally classifying complex natural networks and a manual for engineering networks. For a video summary of this article, see the PaperFlick file with the Supplemental Data available online.
Competition and cooperation in dynamic replication networks.
Dadon, Zehavit; Wagner, Nathaniel; Alasibi, Samaa; Samiappan, Manickasundaram; Mukherjee, Rakesh; Ashkenasy, Gonen
2015-01-07
The simultaneous replication of six coiled-coil peptide mutants by reversible thiol-thioester exchange reactions is described. Experimental analysis of the time dependent evolution of networks formed by the peptides under different conditions reveals a complex web of molecular interactions and consequent mutant replication, governed by competition for resources and by autocatalytic and/or cross-catalytic template-assisted reactions. A kinetic model, first of its kind, is then introduced, allowing simulation of varied network behaviour as a consequence of changing competition and cooperation scenarios. We suggest that by clarifying the kinetic description of these relatively complex dynamic networks, both at early stages of the reaction far from equilibrium and at later stages approaching equilibrium, one lays the foundation for studying dynamic networks out-of-equilibrium in the near future.
Using the multistage cube network topology in parallel supercomputers
Energy Technology Data Exchange (ETDEWEB)
Siegel, H.J.; Nation, W.G. (Purdue Univ., Lafayette, IN (USA). School of Electrical Engineering); Kruskal, C.P. (Maryland Univ., College Park, MD (USA). Dept. of Computer Science); Napolitano, L.M. Jr. (Sandia National Labs., Livermore, CA (USA))
1989-12-01
A variety of approaches to designing the interconnection network to support communications among the processors and memories of supercomputers employing large-scale parallel processing have been proposed and/or implemented. These approaches are often based on the multistage cube topology. This topology is the subject of much ongoing research and study because of the ways in which the multistage cube can be used. The attributes of the topology that make it useful are described. These include O(N log{sub 2} N) cost for an N input/output network, decentralized control, a variety of implementation options, good data permuting capability to support single instruction stream/multiple data stream (SIMD) parallelism, good throughput to support multiple instruction stream/multiple data stream (MIMD) parallelism, and ability to be partitioned into independent subnetworks to support reconfigurable systems. Examples of existing systems that use multistage cube networks are overviewed. The multistage cube topology can be converted into a single-stage network by associating with each switch in the network a processor (and a memory). Properties of systems that use the multistage cube network in this way are also examined.
Topology control based on quantum genetic algorithm in sensor networks
Institute of Scientific and Technical Information of China (English)
SUN Lijuan; GUO Jian; LU Kai; WANG Ruchuan
2007-01-01
Nowadays,two trends appear in the application of sensor networks in which both multi-service and quality of service (QoS)are supported.In terms of the goal of low energy consumption and high connectivity,the control on topology is crucial.The algorithm of topology control based on quantum genetic algorithm in sensor networks is proposed.An advantage of the quantum genetic algorithm over the conventional genetic algorithm is demonstrated in simulation experiments.The goals of high connectivity and low consumption of energy are reached.
Dynamic Routing Protocol for Computer Networks with Clustering Topology
Institute of Scientific and Technical Information of China (English)
无
1999-01-01
This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.
Data center networks topologies, architectures and fault-tolerance characteristics
Liu, Yang; Veeraraghavan, Malathi; Lin, Dong; Hamdi, Mounir
2013-01-01
This SpringerBrief presents a survey of data center network designs and topologies and compares several properties in order to highlight their advantages and disadvantages. The brief also explores several routing protocols designed for these topologies and compares the basic algorithms to establish connections, the techniques used to gain better performance, and the mechanisms for fault-tolerance. Readers will be equipped to understand how current research on data center networks enables the design of future architectures that can improve performance and dependability of data centers. This con
Robustness Analysis of Real Network Topologies Under Multiple Failure Scenarios
DEFF Research Database (Denmark)
Manzano, M.; Marzo, J. L.; Calle, E.
2012-01-01
on topological characteristics. Recently approaches also consider the services supported by such networks. In this paper we carry out a robustness analysis of five real backbone telecommunication networks under defined multiple failure scenarios, taking into account the consequences of the loss of established......Nowadays the ubiquity of telecommunication networks, which underpin and fulfill key aspects of modern day living, is taken for granted. Significant large-scale failures have occurred in the last years affecting telecommunication networks. Traditionally, network robustness analysis has been focused...
The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks
Greenbury, Sam F.; Johnston, Iain G.; Matthew A Smith; Doye, Jonathan P. K.; Louis, Ard A.
2010-01-01
Abstract We investigate how scale-free (SF) and Erdos-Renyi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we find that networks with SFin topologies, that is SF topology for incoming nodes and ER topology for outgoing nodes, are significantly more evolvable towards specific oscillatory targets than networks with ER topology for both incoming an...
Evolving networks:from topology to dynamics
Institute of Scientific and Technical Information of China (English)
Zhengping FAN; Guanrong CHEN; King Tim KO
2004-01-01
A multi-local-world model is introduced to describe the evolving networks that have a localization property such as the Intemet. Based on this model, we show that the traffic load defined by "betweenness centrality" on the multi-local-world scale-free networks' model also follows a power law form. In this kind of network, a few vertices have heavier loads and so play more important roles than the others in the network.
Topological Embedding Feature Based Resource Allocation in Network Virtualization
Directory of Open Access Journals (Sweden)
Hongyan Cui
2014-01-01
Full Text Available Virtualization provides a powerful way to run multiple virtual networks on a shared substrate network, which needs accurate and efficient mathematical models. Virtual network embedding is a challenge in network virtualization. In this paper, considering the degree of convergence when mapping a virtual network onto substrate network, we propose a new embedding algorithm based on topology mapping convergence-degree. Convergence-degree means the adjacent degree of virtual network’s nodes when they are mapped onto a substrate network. The contributions of our method are as below. Firstly, we map virtual nodes onto the substrate nodes with the maximum convergence-degree. The simulation results show that our proposed algorithm largely enhances the network utilization efficiency and decreases the complexity of the embedding problem. Secondly, we define the load balance rate to reflect the load balance of substrate links. The simulation results show our proposed algorithm achieves better load balance. Finally, based on the feature of star topology, we further improve our embedding algorithm and make it suitable for application in the star topology. The test result shows it gets better performance than previous works.
Exploring complex networks via topological embedding on surfaces.
Aste, Tomaso; Gramatica, Ruggero; Di Matteo, T
2012-09-01
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, to characterize, and to simulate networks with a broad range of properties. Any network can be embedded on a surface with sufficiently high genus and therefore the study of topologically embedded graphs is non-restrictive. We show that the local properties of the network are affected by the surface genus which determines the average degree, which influences the degree distribution, and which controls the clustering coefficient. The global properties of the graph are also strongly affected by the surface genus which is constraining the degree of interwovenness, changing the scaling properties of the network from large-world kind (small genus) to small- and ultrasmall-world kind (large genus). Two elementary moves allow the exploration of all networks embeddable on a given surface and naturally introduce a tool to develop a statistical mechanics description for these networks. Within such a framework, we study the properties of topologically embedded graphs which dynamically tend to lower their energy towards a ground state with a given reference degree distribution. We show that the cooling dynamics between high and low "temperatures" is strongly affected by the surface genus with the manifestation of a glass-like transition occurring when the distance from the reference distribution is low. We prove, with examples, that topologically embedded graphs can be built in a way to contain arbitrary complex networks as subgraphs. This method opens a new avenue to build geometrically embedded networks on hyperbolic manifolds.
Resonant UPS topologies for the emerging hybrid fiber coaxial networks
Energy Technology Data Exchange (ETDEWEB)
Pinheiro, H.
1999-07-01
Uninterruptible power systems (UPS)are essential to the operation of critical equipment such as life-support systems, computers and telecommunications systems. Ideally, UPS topologies, especially for the emerging hybrid fiber-coaxial networks, must be characterized by relatively small size, high input power factor and trapezoidal waveforms. None of the existing topologies meet all these requirements. Consequently, the objective of this study is to design and analyse UPS topologies that meet these requirements. To meet this objective novel UPS topologies and control techniques are proposed to allow operation of high switching frequencies without penalizing converter efficiency. A self-sustained oscillation control method is proposed to ensure soft switching under all operating conditions.
Social networks and cooperation: a bibliometric study
Directory of Open Access Journals (Sweden)
Ana Paula Lopes
2013-05-01
Full Text Available The social network analysis involves social and behavioral science. The decentralization of productive activities, such as the formation of "network organizations" as a result of downsizing of large corporate structures of the past, marked by outsoucing and formation of alliances, shows the importance of this theme. The main objective of this paper is to analyze the theory of cooperation and social networks over a period of 24 years. For this, was performed a bibliometric study with content analysis. The database chosen for the initial sample search was ISI Web of Science. The search topics were “social network” and “cooperation”. Were analyzed 97 articles and their references, through networks of citations. The main identified research groups dealing with issues related to trust, strategic alliances, natural cooperation, game theory, social capital, intensity of interaction, reciprocity and innovation. It was found that the publications occurred in a large number of journals, which indicates that the theme is multidisciplinary, and only five journals published at least three articles. Although the first publication has occurred in 1987, was from 2006 that the publications effectively increased. The areas most related to the theme of the research were performance, evolution, management, graphics, model and game theory.
Topological implications of negative curvature for biological and social networks
Albert, Réka; DasGupta, Bhaskar; Mobasheri, Nasim
2014-03-01
Network measures that reflect the most salient properties of complex large-scale networks are in high demand in the network research community. In this paper we adapt a combinatorial measure of negative curvature (also called hyperbolicity) to parametrized finite networks, and show that a variety of biological and social networks are hyperbolic. This hyperbolicity property has strong implications on the higher-order connectivity and other topological properties of these networks. Specifically, we derive and prove bounds on the distance among shortest or approximately shortest paths in hyperbolic networks. We describe two implications of these bounds to crosstalk in biological networks, and to the existence of central, influential neighborhoods in both biological and social networks.
Greed and Fear in Network Reciprocity: Implications for Cooperation among Organizations
Kitts, James A.; Leal, Diego F.; Felps, Will; Jones, Thomas M.; Berman, Shawn L.
2016-01-01
Extensive interdisciplinary literatures have built on the seminal spatial dilemmas model, which depicts the evolution of cooperation on regular lattices, with strategies propagating locally by relative fitness. In this model agents may cooperate with neighbors, paying an individual cost to enhance their collective welfare, or they may exploit cooperative neighbors and diminish collective welfare. Recent research has extended the model in numerous ways, incorporating behavioral noise, implementing other network topologies or adaptive networks, and employing alternative dynamics of replication. Although the underlying dilemma arises from two distinct dimensions—the gains for exploiting cooperative partners (Greed) and the cost of cooperating with exploitative partners (Fear)–most work following from the spatial dilemmas model has argued or assumed that the dilemma can be represented with a single parameter: This research has typically examined Greed or Fear in isolation, or a composite such as the K-index of Cooperation or the ratio of the benefit to cost of cooperation. We challenge this claim on theoretical grounds—showing that embedding interaction in networks generally leads Greed and Fear to have divergent, interactive, and highly nonlinear effects on cooperation at the macro level, even when individuals respond identically to Greed and Fear. Using computational experiments, we characterize both dynamic local behavior and long run outcomes across regions of this space. We also simulate interventions to investigate changes of Greed and Fear over time, showing how model behavior changes asymmetrically as boundaries in payoff space are crossed, leading some interventions to have irreversible effects on cooperation. We then replicate our experiments on inter-organizational network data derived from links through shared directors among 2,400 large US corporations, thus demonstrating our findings for Greed and Fear on a naturally-occurring network. In closing
Discriminative topological features reveal biological network mechanisms
Directory of Open Access Journals (Sweden)
Levovitz Chaya
2004-11-01
Full Text Available Abstract Background Recent genomic and bioinformatic advances have motivated the development of numerous network models intending to describe graphs of biological, technological, and sociological origin. In most cases the success of a model has been evaluated by how well it reproduces a few key features of the real-world data, such as degree distributions, mean geodesic lengths, and clustering coefficients. Often pairs of models can reproduce these features with indistinguishable fidelity despite being generated by vastly different mechanisms. In such cases, these few target features are insufficient to distinguish which of the different models best describes real world networks of interest; moreover, it is not clear a priori that any of the presently-existing algorithms for network generation offers a predictive description of the networks inspiring them. Results We present a method to assess systematically which of a set of proposed network generation algorithms gives the most accurate description of a given biological network. To derive discriminative classifiers, we construct a mapping from the set of all graphs to a high-dimensional (in principle infinite-dimensional "word space". This map defines an input space for classification schemes which allow us to state unambiguously which models are most descriptive of a given network of interest. Our training sets include networks generated from 17 models either drawn from the literature or introduced in this work. We show that different duplication-mutation schemes best describe the E. coli genetic network, the S. cerevisiae protein interaction network, and the C. elegans neuronal network, out of a set of network models including a linear preferential attachment model and a small-world model. Conclusions Our method is a first step towards systematizing network models and assessing their predictability, and we anticipate its usefulness for a number of communities.
Emergence of Space-Time from Topologically Homogeneous Causal Networks
D'Ariano, Giacomo Mauro
2011-01-01
In this paper we study the emergence of Minkowski space-time from a causal network. Differently from previous approaches, we require the network to be topologically homogeneous, so that the metric is derived from pure event-counting. Emergence from events has an operational motivation in requiring that every physical quantity---including space-time---be defined through precise measurement procedures. Topological homogeneity is a requirement for having space-time metric emergent from the pure topology of causal connections, whereas physically corresponds to the universality of the physical law. We analyze in detail the case of 1+1 dimension. Coordinate systems are established via an Einsteinian protocol, and lead to a digital version of the Lorentz transformations. In a computational analogy, the foliation construction can also be regarded as the synchronization with a global clock of the calls to independent subroutines (corresponding to the causally independent events) in a parallel distributed computation, ...
Consistently weighted measures for complex network topologies
Heitzig, Jobst; Zou, Yong; Marwan, Norbert; Kurths, Jürgen
2011-01-01
When network and graph theory are used in the study of complex systems, a typically finite set of nodes of the network under consideration is frequently either explicitly or implicitly considered representative of a much larger finite or infinite set of objects of interest. The selection procedure, e.g., formation of a subset or some kind of discretization or aggregation, typically results in individual nodes of the studied network representing quite differently sized parts of the domain of interest. This heterogeneity may induce substantial bias and artifacts in derived network statistics. To avoid this bias, we propose an axiomatic scheme based on the idea of {\\em node splitting invariance} to derive consistently weighted variants of various commonly used statistical network measures. The practical relevance and applicability of our approach is demonstrated for a number of example networks from different fields of research, and is shown to be of fundamental importance in particular in the study of climate n...
Early-warning signals of topological collapse in interbank networks
Squartini, Tiziano; Garlaschelli, Diego
2013-01-01
The financial crisis marked a paradigm shift, from traditional studies of individual risk to recent research on the "systemic risk" generated by whole networks of institutions. However, the reverse effects of realized defaults on network topology are poorly understood. Here we analyze the Dutch interbank network over the period 1998-2008, ending with the global crisis. We find that many topological properties, after controlling for overall density effects, display an abrupt change in 2008, thus providing a clear but unpredictable signature of the crisis. By contrast, if the intrinsic heterogeneity of banks is controlled for, the same properties undergo a slow and continuous transition, gradually connecting the crisis period to a much earlier stationary phase. This early-warning signal begins in 2005, and is preceded by an even earlier period of "risk autocatalysis" characterized by anomalous debt loops. These remarkable precursors are undetectable if the network is reconstructed from partial bank-specific inf...
Interplay between Network Topology and Dynamics in Neural Systems
Johnson, Samuel
2013-01-01
This thesis is a compendium of research which brings together ideas from the fields of Complex Networks and Computational Neuroscience to address two questions regarding neural systems: 1) How the activity of neurons, via synaptic changes, can shape the topology of the network they form part of, and 2) How the resulting network structure, in its turn, might condition aspects of brain behaviour. Although the emphasis is on neural networks, several theoretical findings which are relevant for complex networks in general are presented -- such as a method for studying network evolution as a stochastic process, or a theory that allows for ensembles of correlated networks, and sets of dynamical elements thereon, to be treated mathematically and computationally in a model-independent manner. Some of the results are used to explain experimental data -- certain properties of brain tissue, the spontaneous emergence of correlations in all kinds of networks... -- and predictions regarding statistical aspects of the centra...
Custom Topology Generation for Network-on-Chip
DEFF Research Database (Denmark)
Stuart, Matthias Bo; Sparsø, Jens
2007-01-01
This paper compares simulated annealing and tabu search for generating custom topologies for applications with periodic behaviour executing on a network-on-chip. The approach differs from previous work by starting from a fixed mapping of IP-cores to routers and performing design space exploration...
Analysis of Degree 5 Chordal Rings for Network Topologies
DEFF Research Database (Denmark)
Riaz, M. Tahir; Pedersen, Jens Myrup; Bujnowski, Sławomir
2011-01-01
This paper presents an analysis of degree 5 chordal rings, from a network topology point of view. The chordal rings are mainly evaluated with respect to average distance and diameter. We derive approximation expressions for the related ideal graphs, and show that these matches the real chordal ri...
Analysis of Degree 5 Chordal Rings for Network Topologies
DEFF Research Database (Denmark)
Riaz, M. Tahir; Pedersen, Jens Myrup; Bujnowski, Sławomir
2011-01-01
This paper presents an analysis of degree 5 chordal rings, from a network topology point of view. The chordal rings are mainly evaluated with respect to average distance and diameter. We derive approximation expressions for the related ideal graphs, and show that these matches the real chordal...
Phase rotation symmetry and the topology of oriented scattering networks
Delplace, Pierre; Fruchart, Michel; Tauber, Clément
2017-05-01
We investigate the topological properties of dynamical states evolving on periodic oriented graphs. This evolution, which encodes the scattering processes occurring at the nodes of the graph, is described by a single-step global operator, in the spirit of the Ho-Chalker model. When the successive scattering events follow a cyclic sequence, the corresponding scattering network can be equivalently described by a discrete time-periodic unitary evolution, in line with Floquet systems. Such systems may present anomalous topological phases where all the first Chern numbers are vanishing, but where protected edge states appear in a finite geometry. To investigate the origin of such anomalous phases, we introduce the phase rotation symmetry, a generalization of usual symmetries which only occurs in unitary systems (as opposed to Hamiltonian systems). Equipped with this new tool, we explore a possible explanation of the pervasiveness of anomalous phases in scattering network models, and we define bulk topological invariants suited to both equivalent descriptions of the network model, which fully capture the topology of the system. We finally show that the two invariants coincide, again through a phase rotation symmetry arising from the particular structure of the network model.
Topological Structure of Urban Street Networks from the Perspective of Degree Correlations
Jiang, Bin; Lu, Feng; Yang, Tinghong; Zhao, Jing
2013-01-01
Many complex networks demonstrate a phenomenon of striking degree correlations, i.e., a node tends to link to other nodes with similar (or dissimilar) degrees. From the perspective of degree correlations, this paper attempts to characterize topological structures of urban street networks. We adopted six urban street networks (three European and three North American), and converted them into network topologies in which nodes and edges respectively represent individual streets and street intersections, and compared the network topologies to three reference network topologies (biological, technological, and social). The urban street network topologies (with the exception of Manhattan) showed a consistent pattern that distinctly differs from the three reference networks. The topologies of urban street networks lack striking degree correlations in general. Through reshuffling the network topologies towards for example maximum or minimum degree correlations while retaining the initial degree distributions, we found...
LARGE-SCALE TOPOLOGICAL PROPERTIES OF MOLECULAR NETWORKS.
Energy Technology Data Exchange (ETDEWEB)
MASLOV,S.SNEPPEN,K.
2003-11-17
Bio-molecular networks lack the top-down design. Instead, selective forces of biological evolution shape them from raw material provided by random events such as gene duplications and single gene mutations. As a result individual connections in these networks are characterized by a large degree of randomness. One may wonder which connectivity patterns are indeed random, while which arose due to the network growth, evolution, and/or its fundamental design principles and limitations? Here we introduce a general method allowing one to construct a random null-model version of a given network while preserving the desired set of its low-level topological features, such as, e.g., the number of neighbors of individual nodes, the average level of modularity, preferential connections between particular groups of nodes, etc. Such a null-model network can then be used to detect and quantify the non-random topological patterns present in large networks. In particular, we measured correlations between degrees of interacting nodes in protein interaction and regulatory networks in yeast. It was found that in both these networks, links between highly connected proteins are systematically suppressed. This effect decreases the likelihood of cross-talk between different functional modules of the cell, and increases the overall robustness of a network by localizing effects of deleterious perturbations. It also teaches us about the overall computational architecture of such networks and points at the origin of large differences in the number of neighbors of individual nodes.
Topology Design for Directional Range Extension Networks with Antenna Blockage
2016-11-01
Topology Design for Directional Range Extension Networks with Antenna Blockage Thomas Shake MIT Lincoln Laboratory shake@ll.mit.edu Abstract...algorithms that optimize this criterion. ACKNOWLEDGEMENTS The author would like to thank Terrance Gibbons of MIT Lincoln Laboratory’s Tactical...Com- puter Networks, Vol 51, pp. 4237-4251, 2007 [11] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms (3rd ed.). MIT
Communication and cooperation in underwater acoustic networks
Yerramalli, Srinivas
In this thesis, we present a study of several problems related to underwater point to point communications and network formation. We explore techniques to improve the achievable data rate on a point to point link using better physical layer techniques and then study sensor cooperation which improves the throughput and reliability in an underwater network. Robust point-to-point communications in underwater networks has become increasingly critical in several military and civilian applications related to underwater communications. We present several physical layer signaling and detection techniques tailored to the underwater channel model to improve the reliability of data detection. First, a simplified underwater channel model in which the time scale distortion on each path is assumed to be the same (single scale channel model in contrast to a more general multi scale model). A novel technique, which exploits the nature of OFDM signaling and the time scale distortion, called Partial FFT Demodulation is derived. It is observed that this new technique has some unique interference suppression properties and performs better than traditional equalizers in several scenarios of interest. Next, we consider the multi scale model for the underwater channel and assume that single scale processing is performed at the receiver. We then derive optimized front end pre-processing techniques to reduce the interference caused during single scale processing of signals transmitted on a multi-scale channel. We then propose an improvised channel estimation technique using dictionary optimization methods for compressive sensing and show that significant performance gains can be obtained using this technique. In the next part of this thesis, we consider the problem of sensor node cooperation among rational nodes whose objective is to improve their individual data rates. We first consider the problem of transmitter cooperation in a multiple access channel and investigate the stability of
The cooperative game theory of networks and hierarchies
Gilles, Robert P
2010-01-01
This book details standard concepts in cooperative game theory with applications to the analysis of social networks and hierarchical authority organizations. It covers the multi-linear extension, the Core, the Shapley value, and the cooperative potential.
Topological properties of random wireless networks
Indian Academy of Sciences (India)
Srikanth K Iyer; D Manjunath
2006-04-01
Wireless networks in which the node locations are random are best modelled as random geometric graphs (RGGs). In addition to their extensive application in the modelling of wireless networks, RGGs ﬁnd many new applications and are being studied in their own right. In this paper we ﬁrst provide a brief introduction to the issues of interest in random wireless networks. We then discuss some recent results for one-dimensional networks with the nodes distributed uniformly in $(0, z)$.We then discuss some asymptotic results for networks in higher dimensions when the nodes are distributed in a ﬁnite volume. Finally we discuss some recent generalisations in considering non uniform transmission ranges and non uniform node distributions. An annotated bibliography of some of the recent literature is also provided.
Contagion of Cooperation in Static and Fluid Social Networks.
Directory of Open Access Journals (Sweden)
Jillian J Jordan
Full Text Available Cooperation is essential for successful human societies. Thus, understanding how cooperative and selfish behaviors spread from person to person is a topic of theoretical and practical importance. Previous laboratory experiments provide clear evidence of social contagion in the domain of cooperation, both in fixed networks and in randomly shuffled networks, but leave open the possibility of asymmetries in the spread of cooperative and selfish behaviors. Additionally, many real human interaction structures are dynamic: we often have control over whom we interact with. Dynamic networks may differ importantly in the goals and strategic considerations they promote, and thus the question of how cooperative and selfish behaviors spread in dynamic networks remains open. Here, we address these questions with data from a social dilemma laboratory experiment. We measure the contagion of both cooperative and selfish behavior over time across three different network structures that vary in the extent to which they afford individuals control over their network ties. We find that in relatively fixed networks, both cooperative and selfish behaviors are contagious. In contrast, in more dynamic networks, selfish behavior is contagious, but cooperative behavior is not: subjects are fairly likely to switch to cooperation regardless of the behavior of their neighbors. We hypothesize that this insensitivity to the behavior of neighbors in dynamic networks is the result of subjects' desire to attract new cooperative partners: even if many of one's current neighbors are defectors, it may still make sense to switch to cooperation. We further hypothesize that selfishness remains contagious in dynamic networks because of the well-documented willingness of cooperators to retaliate against selfishness, even when doing so is costly. These results shed light on the contagion of cooperative behavior in fixed and fluid networks, and have implications for influence
On Hybrid Cooperation in Underlay Cognitive Radio Networks
DEFF Research Database (Denmark)
Mahmood, Nurul Huda; Yilmaz, Ferkan; Øien, Geir E.
2013-01-01
of opportunistic wireless systems such as cognitive radio networks. In order to balance the performance gains from cooperative communication against the possible over-utilization of resources, we propose and analyze an adaptive-cooperation technique for underlay cognitive radio networks, termed as hybrid......-cooperation. Under the proposed cooperation scheme, secondary users in a cognitive radio network cooperate adaptively to enhance the spectral efficiency and the error performance of the network. The bit error rate, the spectral efficiency and the outage performance of the network under the proposed hybrid...... cooperation scheme with amplify-and-forward relaying are analyzed in this paper, and compared against conventional cooperation technique. Findings of the analytical performance analyses are further validated numerically through selected computer-based Monte-Carlo simulations. The proposed scheme is found...
Finding Quasi-Optimal Network Topologies for Information Transmission in Active Networks
Baptista, Murilo S.; de Carvalho, Josué X.; Hussein, Mahir S.
2008-01-01
This work clarifies the relation between network circuit (topology) and behaviour (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons. PMID:18941516
Finding quasi-optimal network topologies for information transmission in active networks.
Directory of Open Access Journals (Sweden)
Murilo S Baptista
Full Text Available This work clarifies the relation between network circuit (topology and behaviour (information transmission and synchronization in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.
Learning Topology and Dynamics of Large Recurrent Neural Networks
She, Yiyuan; He, Yuejia; Wu, Dapeng
2014-11-01
Large-scale recurrent networks have drawn increasing attention recently because of their capabilities in modeling a large variety of real-world phenomena and physical mechanisms. This paper studies how to identify all authentic connections and estimate system parameters of a recurrent network, given a sequence of node observations. This task becomes extremely challenging in modern network applications, because the available observations are usually very noisy and limited, and the associated dynamical system is strongly nonlinear. By formulating the problem as multivariate sparse sigmoidal regression, we develop simple-to-implement network learning algorithms, with rigorous convergence guarantee in theory, for a variety of sparsity-promoting penalty forms. A quantile variant of progressive recurrent network screening is proposed for efficient computation and allows for direct cardinality control of network topology in estimation. Moreover, we investigate recurrent network stability conditions in Lyapunov's sense, and integrate such stability constraints into sparse network learning. Experiments show excellent performance of the proposed algorithms in network topology identification and forecasting.
Network Topology of the Austrian Airline Flights
Han, D D; Qian, J H
2007-01-01
We analyze the directed, weighted and evolutionary Austrian airline flight network. It is shown that such a specific airline flight network displays features of small-world networks, namely large clustering coefficient and small average shortest-path length. We study the detailed flight information both in a week and on a whole. In both cases, the degree distributions reveal power law with exponent value of 2 $\\sim$ 3 for the small degree branch and a flat tail for the large degree branch. Similarly, the flight weight distributions have power-law for the small weight branch. The degree-degree correlation analysis shows the network has disassortative behavior, i.e. the large airports are likely to link to smaller airports.
A distributed topological camera network representation for tracking applications.
Lobaton, Edgar; Vasudevan, Ramanarayan; Bajcsy, Ruzena; Sastry, Shankar
2010-10-01
Sensor networks have been widely used for surveillance, monitoring, and tracking. Camera networks, in particular, provide a large amount of information that has traditionally been processed in a centralized manner employing a priori knowledge of camera location and of the physical layout of the environment. Unfortunately, these conventional requirements are far too demanding for ad-hoc distributed networks. In this article, we present a simplicial representation of a camera network called the camera network complex ( CN-complex), that accurately captures topological information about the visual coverage of the network. This representation provides a coordinate-free calibration of the sensor network and demands no localization of the cameras or objects in the environment. A distributed, robust algorithm, validated via two experimental setups, is presented for the construction of the representation using only binary detection information. We demonstrate the utility of this representation in capturing holes in the coverage, performing tracking of agents, and identifying homotopic paths.
Topological Effects and Performance Optimization in Transportation Continuous Network Design
Directory of Open Access Journals (Sweden)
Jianjun Wu
2014-01-01
Full Text Available Because of the limitation of budget, in the planning of road works, increased efforts should be made on links that are more critical to the whole traffic system. Therefore, it would be helpful to model and evaluate the vulnerability and reliability of the transportation network when the network design is processing. This paper proposes a bilevel transportation network design model, in which the upper level is to minimize the performance of the network under the given budgets, while the lower level is a typical user equilibrium assignment problem. A new solution approach based on particle swarm optimization (PSO method is presented. The topological effects on the performance of transportation networks are studied with the consideration of three typical networks, regular lattice, random graph, and small-world network. Numerical examples and simulations are presented to demonstrate the proposed model.
On Hybrid Cooperation in Underlay Cognitive Radio Networks
DEFF Research Database (Denmark)
Mahmood, Nurul Huda; Yilmaz, Ferkan; Øien, Geir E.;
2013-01-01
of opportunistic wireless systems such as cognitive radio networks. In order to balance the performance gains from cooperative communication against the possible over-utilization of resources, we propose and analyze an adaptive-cooperation technique for underlay cognitive radio networks, termed as hybrid......-cooperation. Under the proposed cooperation scheme, secondary users in a cognitive radio network cooperate adaptively to enhance the spectral efficiency and the error performance of the network. The bit error rate, the spectral efficiency and the outage performance of the network under the proposed hybrid......Cooperative communication is a promising strategy to enhance the performance of a communication network as it helps to improve the coverage area and the outage performance. However, such enhancement comes at the expense of increased resource utilization, which is undesirable; more so in the case...
Improvement of water distribution networks analysis by topological similarity
Mahavir Singh; Suraj Krishan Kheer; I.K. Pandita
2016-01-01
In this research paper a methodology based on topological similarity is used to obtain starting point of iteration for solving reservoir and pipe network problems. As of now initial starting point for iteration is based on pure guess work which may be supported by experience. Topological similarity concept comes from the Principle of Quasi Work (PQW). In PQW the solution of any one problem of a class is used to solve other complex problems of the same class. This paves way for arriving at a u...
Effects of behavioral patterns and network topology structures on Parrondo’s paradox
Ye, Ye; Cheong, Kang Hao; Cen, Yu-wan; Xie, Neng-gang
2016-01-01
A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed. PMID:27845430
Goodput Maximization in Cooperative Networks with ARQ
Chen, Qing
2010-01-01
In this paper, the average successful throughput, i.e., goodput, of a coded 3-node cooperative network is studied in a Rayleigh fading environment. It is assumed that a simple automatic repeat request (ARQ) technique is employed in the network so that erroneously received codeword is retransmitted until successful delivery. The relay is assumed to operate in either amplify-and-forward (AF) or decode-and-forward (DF) mode. Under these assumptions, retransmission mechanisms and protocols are described, and the average time required to send information successfully is determined. Subsequently, the goodput for both AF and DF relaying is formulated. The tradeoffs and interactions between the goodput, transmission rates, and relay location are investigated and optimal strategies are identified.
On the evolution of cooperation under social pressure in multiplex networks
Pereda, María
2016-01-01
In this work, we aim to contribute to the understanding of the human pro-social behavior by studying the influence that a particular form of social pressure "being watched" has on the evolution of cooperative behavior. We study how cooperation emerge in multiplex complex topologies by analyzing a particular bidirectionally-coupled dynamics on top of a two-layers multiplex network (duplex). The coupled dynamics appears between the Prisoner's Dilemma game in a network, and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes, that impose pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of ...
A Survey on Topology Control and Maintenance in Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Manish Singh
2014-04-01
Full Text Available Wireless Sensor Networks (WSNs consist of devices equipped with radio transceivers that cooperate to form and maintain a fully connected network of sensor nodes. WSNs do not have a fixed infrastructure and do not use centralized methods for organization. This flexibility enables them to be used whenever a fixed infrastructure is unfeasible or inconvenient, hence making them attractive for numerous applications ranging from military, civil, industrial or health. Because of their unique structure, and limited energy storage, computational and memory resources, many of the existing protocols and algorithms designed for wired or wireless ad hoc networks cannot be directly used in WSNs. Beside this, they offer a flexible low cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. Applications of large scale WSNs are becoming a reality example are being a Smart Grid, Machine to Machine communication networks and smart environment. It is expected that a topology control techniques will play an important role in managing the complexity of such highly complicated and distributed systems through self-organization capabilities. WSNs are made of resource constrained wireless devices, which require energy efficient mechanisms, algorithm/protocol. Control on topology is very important for efficient utilization of networks and is composed of two mechanisms, Topology Construction (TC and Topology Maintenance (TM. By using these mechanism various protocols/algorithm have came into existence, like: A3, A3-Coverage (A3-Cov, Simple Tree, Just Tree, etc. This paper provides a full view of the studies of above mentioned algorithms and also provides an analysis of their merits and demerits.
Topology of transcriptional regulatory networks: testing and improving.
Directory of Open Access Journals (Sweden)
Dicle Hasdemir
Full Text Available With the increasing amount and complexity of data generated in biological experiments it is becoming necessary to enhance the performance and applicability of existing statistical data analysis methods. This enhancement is needed for the hidden biological information to be better resolved and better interpreted. Towards that aim, systematic incorporation of prior information in biological data analysis has been a challenging problem for systems biology. Several methods have been proposed to integrate data from different levels of information most notably from metabolomics, transcriptomics and proteomics and thus enhance biological interpretation. However, in order not to be misled by the dominance of incorrect prior information in the analysis, being able to discriminate between competing prior information is required. In this study, we show that discrimination between topological information in competing transcriptional regulatory network models is possible solely based on experimental data. We use network topology dependent decomposition of synthetic gene expression data to introduce both local and global discriminating measures. The measures indicate how well the gene expression data can be explained under the constraints of the model network topology and how much each regulatory connection in the model refuses to be constrained. Application of the method to the cell cycle regulatory network of Saccharomyces cerevisiae leads to the prediction of novel regulatory interactions, improving the information content of the hypothesized network model.
Frequency dependent topological patterns of resting-state brain networks.
Directory of Open Access Journals (Sweden)
Long Qian
Full Text Available The topological organization underlying brain networks has been extensively investigated using resting-state fMRI, focusing on the low frequency band from 0.01 to 0.1 Hz. However, the frequency specificities regarding the corresponding brain networks remain largely unclear. In the current study, a data-driven method named complementary ensemble empirical mode decomposition (CEEMD was introduced to separate the time series of each voxel into several intrinsic oscillation rhythms with distinct frequency bands. Our data indicated that the whole brain BOLD signals could be automatically divided into five specific frequency bands. After applying the CEEMD method, the topological patterns of these five temporally correlated networks were analyzed. The results showed that global topological properties, including the network weighted degree, network efficiency, mean characteristic path length and clustering coefficient, were observed to be most prominent in the ultra-low frequency bands from 0 to 0.015 Hz. Moreover, the saliency of small-world architecture demonstrated frequency-density dependency. Compared to the empirical mode decomposition method (EMD, CEEMD could effectively eliminate the mode-mixing effects. Additionally, the robustness of CEEMD was validated by the similar results derived from a split-half analysis and a conventional frequency division method using the rectangular window band-pass filter. Our findings suggest that CEEMD is a more effective method for extracting the intrinsic oscillation rhythms embedded in the BOLD signals than EMD. The application of CEEMD in fMRI data analysis will provide in-depth insight in investigations of frequency specific topological patterns of the dynamic brain networks.
Cooperation in the prisoner's dilemma game on tunable community networks
Liu, Penghui; Liu, Jing
2017-04-01
Community networks have attracted lots of attention as they widely exist in the real world and are essential to study properties of networks. As the game theory illustrates the competitive relationship among individuals, studying the iterated prisoner's dilemma games (PDG) on community networks is meaningful. In this paper, we focus on investigating the relationship between the cooperation level of community networks and that of their communities in the prisoner's dilemma games. With this purpose in mind, a type of tunable community networks whose communities inherit not only the scale-free property, but also the characteristic of adjustable cooperation level of Holme and Kim (HK) networks is designed. Both uniform and non-uniform community networks are investigated. We find out that cooperation enhancement of communities can improve the cooperation level of the whole networks. Moreover, simulation results indicate that a large community is a better choice than a small community to improve the cooperation level of the whole networks. Thus, improving the cooperation level of community networks can be divided into a number of sub-problems targeting at improving the cooperation level of individual communities, which can save the computation cost and deal with the problem of improving the cooperation level of huge community networks. Moreover, as the larger community is a better choice, it is reasonable to start with large communities, according to the greedy strategy when the number of nodes can participate in the enhancement is limited.
On hybrid cooperation in underlay cognitive radio networks
Mahmood, Nurul Huda
2012-11-01
In wireless systems where transmitters are subject to a strict received power constraint, such as in underlay cognitive radio networks, cooperative communication is a promising strategy to enhance network performance, as it helps to improve the coverage area and outage performance of a network. However, this comes at the expense of increased resource utilization. To balance the performance gain against the possible over-utilization of resources, we propose a hybrid-cooperation technique for underlay cognitive radio networks, where secondary users cooperate only when required. Various performance measures of the proposed hybrid-cooperation technique are analyzed in this paper, and are also further validated numerically. © 2012 IEEE.
Non-interference topology scheme in wireless sensor networks
Institute of Scientific and Technical Information of China (English)
MA Shu-hui; JI Hong; YUE Guang-xin
2007-01-01
A novel topology scheme, cell with multiple mobile sinks method (CMMSM), is proposed in this article for the collection of information and for the environment monitoring in wireless sensor networks. The system consists of many static sensors, scattered in a large scale sensing field and multiple mobile sinks, cruising among the clusters. Conservation of energy and simplification of protocol are important design considerations in this scheme. The noninterference topology scheme largely simplifies the full-distributed communication protocol with the ability of collision avoidance and random routing. The total number of cluster heads in such a topology was analyzed, and then an approximate evaluation of the total energy consumption in one round was carried out Simulation results show that CMMSM can save considerable energy and obtain higher throughput than low-energy adaptive clustering hierarchy (LEACH) and geographical adaptive fidelity (GAF).
Topological Properties of Bank Networks:. the Case of Brazil
Tabak, Benjamin M.; Cajueiro, Daniel O.; Serra, Thiago R.
This paper investigates the topological properties of bank networks. We build the minimum spanning tree, which is based on the concept of ultrametricity, using the correlation matrix for a variety of banking variables. Empirical results suggest that the private and foreign banks tend to form clusters within the network. Furthermore, banks with different sizes are also strongly connected and tend to form clusters. These results are robust to the use of different variables to build the network, such as bank profitability, assets, equity, revenue and loans.
Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks
Wu, Yu’e; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong
2017-01-01
Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world. PMID:28112276
Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks
Wu, Yu’E.; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong
2017-01-01
Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world.
Radiation-Induced Topological Disorder in Irradiated Network Structures
Energy Technology Data Exchange (ETDEWEB)
Hobbs, Linn W.
2002-12-21
This report summarizes results of a research program investigating the fundamental principles underlying the phenomenon of topological disordering in a radiation environment. This phenomenon is known popularly as amorphization, but is more formally described as a process of radiation-induced structural arrangement that leads in crystals to loss of long-range translational and orientational correlations and in glasses to analogous alteration of connectivity topologies. The program focus has been on a set compound ceramic solids with directed bonding exhibiting structures that can be described as networks. Such solids include SiO2, Si3N4, SiC, which are of interest to applications in fusion energy production, nuclear waste storage, and device manufacture involving ion implantation or use in radiation fields. The principal investigative tools comprise a combination of experimental diffraction-based techniques, topological modeling, and molecular-dynamics simulations that have proven a rich source of information in the preceding support period. The results from the present support period fall into three task areas. The first comprises enumeration of the rigidity constraints applying to (1) more complex ceramic structures (such as rutile, corundum, spinel and olivine structures) that exhibit multiply polytopic coordination units or multiple modes of connecting such units, (2) elemental solids (such as graphite, silicon and diamond) for which a correct choice of polytope is necessary to achieve correct representation of the constraints, and (3) compounds (such as spinel and silicon carbide) that exhibit chemical disorder on one or several sublattices. With correct identification of the topological constraints, a unique correlation is shown to exist between constraint and amorphizability which demonstrates that amorphization occurs at a critical constraint loss. The second task involves the application of molecular dynamics (MD) methods to topologically-generated models
Topology dependent epidemic spreading velocity in weighted networks
Duan, Wei; Quax, Rick; Lees, Michael; Qiu, Xiaogang; Sloot, Peter M. A.
2014-12-01
Many diffusive processes occur on structured networks with weighted links, such as disease spread by airplane transport or information diffusion in social networks or blogs. Understanding the impact of weight-connectivity correlations on epidemic spreading in weighted networks is crucial to support decision-making on disease control and other diffusive processes. However, a real understanding of epidemic spreading velocity in weighted networks is still lacking. Here we conduct a numerical study of the velocity of a Reed-Frost epidemic spreading process in various weighted network topologies as a function of the correlations between edge weights and node degrees. We find that a positive weight-connectivity correlation leads to a faster epidemic spreading compared to an unweighted network. In contrast, we find that both uncorrelated and negatively correlated weight distributions lead to slower spreading processes. In the case of positive weight-connectivity correlations, the acceleration of spreading velocity is weak when the heterogeneity of weight distribution increases.
On cooperative and efficient overlay network evolution based on a group selection pattern.
Wang, Yufeng; Nakao, Akihiro
2010-06-01
In overlay networks, the interplay between network structure and dynamics remains largely unexplored. In this paper, we study dynamic coevolution between individual rational strategies (cooperative or defect) and the overlay network structure, that is, the interaction between peer's local rational behaviors and the emergence of the whole network structure. We propose an evolutionary game theory (EGT)-based overlay topology evolution scheme to drive a given overlay into the small-world structure (high global network efficiency and average clustering coefficient). Our contributions are the following threefold: From the viewpoint of peers' local interactions, we explicitly consider the peer's rational behavior and introduce a link-formation game to characterize the social dilemma of forming links in an overlay network. Furthermore, in the evolutionary link-formation phase, we adopt a simple economic process: Each peer keeps one link to a cooperative neighbor in its neighborhood, which can slightly speed up the convergence of cooperation and increase network efficiency; from the viewpoint of the whole network structure, our simulation results show that the EGT-based scheme can drive an arbitrary overlay network into a fully cooperative and efficient small-world structure. Moreover, we compare our scheme with a search-based economic model of network formation and illustrate that our scheme can achieve the experimental and analytical results in the latter model. In addition, we also graphically illustrate the final overlay network structure; finally, based on the group selection model and evolutionary set theory, we theoretically obtain the approximate threshold of cost and draw the conclusion that the small value of the average degree and the large number of the total peers in an overlay network facilitate the evolution of cooperation.
Ni, Shengqiao; Lv, Jiancheng; Cheng, Zhehao; Li, Mao
2015-01-01
This paper presents improvements to the conventional Topology Representing Network to build more appropriate topology relationships. Based on this improved Topology Representing Network, we propose a novel method for online dimensionality reduction that integrates the improved Topology Representing Network and Radial Basis Function Network. This method can find meaningful low-dimensional feature structures embedded in high-dimensional original data space, process nonlinear embedded manifolds, and map the new data online. Furthermore, this method can deal with large datasets for the benefit of improved Topology Representing Network. Experiments illustrate the effectiveness of the proposed method.
Directory of Open Access Journals (Sweden)
Shengqiao Ni
Full Text Available This paper presents improvements to the conventional Topology Representing Network to build more appropriate topology relationships. Based on this improved Topology Representing Network, we propose a novel method for online dimensionality reduction that integrates the improved Topology Representing Network and Radial Basis Function Network. This method can find meaningful low-dimensional feature structures embedded in high-dimensional original data space, process nonlinear embedded manifolds, and map the new data online. Furthermore, this method can deal with large datasets for the benefit of improved Topology Representing Network. Experiments illustrate the effectiveness of the proposed method.
Topology optimisation for energy management in underwater sensor networks
Jha, Devesh K.; Wettergren, Thomas A.; Ray, Asok; Mukherjee, Kushal
2015-09-01
In general, battery-powered sensors in a sensor network are operable as long as they can communicate sensed data to a processing node. In this context, a sensor network has two competing objectives: (1) maximisation of the network performance with respect to the probability of successful search for a specified upper bound on the probability of false alarms, and (2) maximisation of the network's operable life. As both sensing and communication of data consume battery energy at the sensing nodes of the sensor network, judicious use of sensing power and communication power is needed to improve the lifetime of the sensor network. This paper presents an adaptive energy management policy that will optimally allocate the available energy between sensing and communication at each sensing node to maximise the network performance subject to specified constraints. Under the assumptions of fixed total energy allocation for a sensor network operating for a specified time period, the problem is reduced to synthesis of an optimal network topology that maximises the probability of successful search (of a target) over a surveillance region. In a two-stage optimisation, a genetic algorithm-based meta-heuristic search is first used to efficiently explore the global design space, and then a local pattern search algorithm is used for convergence to an optimal solution. The results of performance optimisation are generated on a simulation test bed to validate the proposed concept. Adaptation to energy variations across the network is shown to be manifested as a change in the optimal network topology by using sensing and communication models for underwater environment. The approximate Pareto-optimal surface is obtained as a trade-off between network lifetime and probability of successful search over the surveillance region.
Discriminating topology in galaxy distributions using network analysis
Hong, Sungryong; Coutinho, Bruno C.; Dey, Arjun; Barabási, Albert-L.; Vogelsberger, Mark; Hernquist, Lars; Gebhardt, Karl
2016-07-01
The large-scale distribution of galaxies is generally analysed using the two-point correlation function. However, this statistic does not capture the topology of the distribution, and it is necessary to resort to higher order correlations to break degeneracies. We demonstrate that an alternate approach using network analysis can discriminate between topologically different distributions that have similar two-point correlations. We investigate two galaxy point distributions, one produced by a cosmological simulation and the other by a Lévy walk. For the cosmological simulation, we adopt the redshift z = 0.58 slice from Illustris and select galaxies with stellar masses greater than 108 M⊙. The two-point correlation function of these simulated galaxies follows a single power law, ξ(r) ˜ r-1.5. Then, we generate Lévy walks matching the correlation function and abundance with the simulated galaxies. We find that, while the two simulated galaxy point distributions have the same abundance and two-point correlation function, their spatial distributions are very different; most prominently, filamentary structures, absent in Lévy fractals. To quantify these missing topologies, we adopt network analysis tools and measure diameter, giant component, and transitivity from networks built by a conventional friends-of-friends recipe with various linking lengths. Unlike the abundance and two-point correlation function, these network quantities reveal a clear separation between the two simulated distributions; therefore, the galaxy distribution simulated by Illustris is not a Lévy fractal quantitatively. We find that the described network quantities offer an efficient tool for discriminating topologies and for comparing observed and theoretical distributions.
Network Topology Inference from Spectral Templates
Segarra, Santiago; Mateos, Gonzalo; Ribeiro, Alejandro
2016-01-01
We address the problem of identifying a graph structure from the observation of signals defined on its nodes. Fundamentally, the unknown graph encodes direct relationships between signal elements, which we aim to recover from observable indirect relationships generated by a diffusion process on the graph. The fresh look advocated here permeates benefits from convex optimization and stationarity of graph signals, in order to identify the graph shift operator (a matrix representation of the graph) given only its eigenvectors. These spectral templates can be obtained, e.g., from the sample covariance of independent graph signals diffused on the sought network. The novel idea is to find a graph shift that, while being consistent with the provided spectral information, endows the network with certain desired properties such as sparsity. To that end we develop efficient inference algorithms stemming from provably-tight convex relaxations of natural nonconvex criteria, particularizing the results for two shifts: the...
Signed Networks, Triadic Interactions and the Evolution of Cooperation
Directory of Open Access Journals (Sweden)
Károly Takács
2013-09-01
Full Text Available We outline a model to study the evolution of cooperation in a population of agents playing the prisoner's dilemma in signed networks. We highlight that if only dyadic interactions are taken into account, cooperation never evolves. However, when triadic considerations are introduced, a window of opportunity for emergence of cooperation as a stable behaviour emerges.
Cooperative Jamming for Physical Layer Security in Wireless Sensor Networks
DEFF Research Database (Denmark)
Rohokale, Vandana M.; Prasad, Neeli R.; Prasad, Ramjee
2012-01-01
Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This work proposes a novel cooperative jamming mechanism for scalable networks like Wireless Sensor Networks (WSNs) which makes use of friendly interference to confuse the eavesdropper...
Global network cooperation catalysed by a small prosocial migrant clique
Miller, Steve
2016-01-01
Much research has been carried out to understand the emergence of cooperation in simulated social networks of competing individuals. Such research typically implements a population as a single connected network. Here we adopt a more realistic premise; namely that populations consist of multiple networks, whose members migrate from one to another. Specifically, we isolate the key elements of the scenario where a minority of members from a cooperative network migrate to a network populated by defectors. Using the public goods game to model group-wise cooperation, we find that under certain circumstances, the concerted actions of a trivial number of such migrants will catalyse widespread behavioural change throughout an entire population. Such results support a wider argument: that the general presence of some form of disruption contributes to the emergence of cooperation in social networks, and consequently that simpler models may encode a determinism that precludes the emergence of cooperation.
Trajectory Networks and Their Topological Changes Induced by Geographical Infiltration
Costa, Luciano da Fontoura
2008-01-01
In this article we investigate the topological changes undergone by trajectory networks as a consequence of progressive geographical infiltration. Trajectory networks, a type of knitted network, are obtained by establishing paths between geographically distributed nodes while following an associated vector field. For instance, the nodes could correspond to neurons along the cortical surface and the vector field could correspond to the gradient of neurotrophic factors, or the nodes could represent towns while the vector fields would be given by economical and/or geographical gradients. Therefore trajectory networks are natural models of a large number of geographical structures. The geographical infiltrations correspond to the addition of new local connections between nearby existing nodes. As such, these infiltrations could be related to several real-world processes such as contaminations, diseases, attacks, parasites, etc. The way in which progressive geographical infiltrations affect trajectory networks is ...
Correlations in the degeneracy of structurally controllable topologies for networks
Campbell, Colin; Aucott, Steven; Ruths, Justin; Ruths, Derek; Shea, Katriona; Albert, Réka
2017-04-01
Many dynamic systems display complex emergent phenomena. By directly controlling a subset of system components (nodes) via external intervention it is possible to indirectly control every other component in the system. When the system is linear or can be approximated sufficiently well by a linear model, methods exist to identify the number and connectivity of a minimum set of external inputs (constituting a so-called minimal control topology, or MCT). In general, many MCTs exist for a given network; here we characterize a broad ensemble of empirical networks in terms of the fraction of nodes and edges that are always, sometimes, or never a part of an MCT. We study the relationships between the measures, and apply the methodology to the T-LGL leukemia signaling network as a case study. We show that the properties introduced in this report can be used to predict key components of biological networks, with potentially broad applications to network medicine.
Topology and energy transport in networks of interacting photosynthetic complexes
Allegra, Michele
2012-01-01
We take inspiration from light-harvesting networks present in purple bacteria and simulate an incoherent dissipative energy transfer process on more general and abstract networks, considering both regular structures (Cayley trees and hyperbranched fractals) and randomly-generated ones. We focus on the the two primary light harvesting complexes of purple bacteria, i.e. the LH1 and LH2, and we use network-theoretical centrality measures in order to select different LH1 arrangements. We show that different choices cause significant differences in the transport efficiencies, and that for regular networks centrality measures allow to identify arrangements that ensure transport efficiencies which are better than those obtained with a random disposition of the complexes. The optimal arrangements strongly depend on the dissipative nature of the dynamics and on the topological properties of the networks considered, and depending on the latter they are achieved by using global vs. local centrality measures. Finally, we...
Network synchronization: optimal and pessimal scale-free topologies
Energy Technology Data Exchange (ETDEWEB)
Donetti, Luca [Departamento de Electronica y Tecnologia de Computadores and Instituto de Fisica Teorica y Computacional Carlos I, Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain); Hurtado, Pablo I; Munoz, Miguel A [Departamento de Electromagnetismo y Fisica de la Materia and Instituto Carlos I de Fisica Teorica y Computacional Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain)], E-mail: mamunoz@onsager.ugr.es
2008-06-06
By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.
Topological Analyses of Protein-Ligand Binding: a Network Approach.
Costanzi, Stefano
2016-01-01
Proteins can be conveniently represented as networks of interacting residues, thus allowing the study of several network parameters that can shed light onto several of their structural and functional aspects. With respect to the binding of ligands, which are central for the function of many proteins, network analysis may constitute a possible route to assist the identification of binding sites. As the bulk of this review illustrates, this has generally been easier for enzymes than for non-enzyme proteins, perhaps due to the different topological nature of the binding sites of the former over those of the latter. The article also illustrates how network representations of binding sites can be used to search PDB structures in order to identify proteins that bind similar molecules and, lastly, how codifying proteins as networks can assist the analysis of the conformational changes consequent to ligand binding.
Dynamics on networks: competition of temporal and topological correlations
Artime, Oriol; Ramasco, José J.; San Miguel, Maxi
2017-02-01
Links in many real-world networks activate and deactivate in correspondence to the sporadic interactions between the elements of the system. The activation patterns may be irregular or bursty and play an important role on the dynamics of processes taking place in the network. Information or disease spreading in networks are paradigmatic examples of this situation. Besides burstiness, several correlations may appear in the process of link activation: memory effects imply temporal correlations, but also the existence of communities in the network may mediate the activation patterns of internal an external links. Here we study the competition of topological and temporal correlations in link activation and how they affect the dynamics of systems running on the network. Interestingly, both types of correlations by separate have opposite effects: one (topological) delays the dynamics of processes on the network, while the other (temporal) accelerates it. When they occur together, our results show that the direction and intensity of the final outcome depends on the competition in a non trivial way.
Coarsening kinetics of topologically highly correlated grain boundary networks
Tang, Ming; Reed, Bryan W.; Kumar, Mukul
2012-08-01
We apply phase-field simulations in two dimensions to study the thermal coarsening of grain boundary (GB) networks with high fractions of twin and twin-variant boundaries, which for example are seen in grain-boundary-engineered FCC materials. Two types of grain boundary networks with similar starting special boundary fractions but different topological features were considered as initial conditions for the grain growth simulations. A lattice Monte Carlo method creates polycrystalline microstructures (Reed and Kumar (RK)), which exhibit hierarchical organization of random and special coincidence site lattice boundaries. The other type of microstructures (randomly distributed (RD)) contains random distributions of special boundaries subject only to crystallographic constraints. Under the assumption that random boundaries have larger energy and much higher mobility than special boundaries, simulations show that increasing the initial special boundary fraction in both microstructures slows down grain growth. However, the two starting microstructures exhibit very different behavior in the evolution of GB character and triple junction (TJ) distributions. The RD networks coarsened more slowly than the RK networks with comparable initial fractions of special boundaries. The observed trend in the evolution of the RK microstructures is explained by an extended von Neumann-Mullins analysis. This study demonstrates that the special boundary fraction is not a sufficient indicator of the coarsening behavior of twinned GB networks; the network topology must also be considered to correctly predict the grain growth kinetics.
Analytic description of adaptive network topologies in a steady state.
Wieland, Stefan; Nunes, Ana
2015-06-01
In many complex systems, states and interaction structure coevolve towards a dynamic equilibrium. For the adaptive contact process, we obtain approximate expressions for the degree distributions that characterize the interaction network in such active steady states. These distributions are shown to agree quantitatively with simulations except when rewiring is much faster than state update and used to predict and to explain general properties of steady-state topologies. The method generalizes easily to other coevolutionary dynamics.
Topological isomorphisms of human brain and financial market networks
Directory of Open Access Journals (Sweden)
Petra E Vértes
2011-09-01
Full Text Available Although metaphorical and conceptual connections between the human brain and the financial markets have often been drawn, rigorous physical or mathematical underpinnings of this analogy remain largely unexplored. Here, we apply a statistical and graph theoretic approach to the study of two datasets - the timeseries of 90 stocks from the New York Stock Exchange over a three-year period, and the fMRI-derived timeseries acquired from 90 brain regions over the course of a 10 min-long functional MRI scan of resting brain function in healthy volunteers. Despite the many obvious substantive differences between these two datasets, graphical analysis demonstrated striking commonalities in terms of global network topological properties. Both the human brain and the market networks were non-random, small-world, modular, hierarchical systems with fat-tailed degree distributions indicating the presence of highly connected hubs. These properties could not be trivially explained by the univariate time series statistics of stock price returns. This degree of topological isomorphism suggests that brains and markets can be regarded broadly as members of the same family of networks. The two systems, however, were not topologically identical. The financial market was more efficient and more modular - more highly optimised for information processing - than the brain networks; but also less robust to systemic disintegration as a result of hub deletion. We conclude that the conceptual connections between brains and markets are not merely metaphorical; rather these two information processing systems can be rigorously compared in the same mathematical language and turn out often to share important topological properties in common to some degree. There will be interesting scientific arbitrage opportunities in further work at the graph theoretically-mediated interface between systems neuroscience and the statistical physics of financial markets.
Topological isomorphisms of human brain and financial market networks.
Vértes, Petra E; Nicol, Ruth M; Chapman, Sandra C; Watkins, Nicholas W; Robertson, Duncan A; Bullmore, Edward T
2011-01-01
Although metaphorical and conceptual connections between the human brain and the financial markets have often been drawn, rigorous physical or mathematical underpinnings of this analogy remain largely unexplored. Here, we apply a statistical and graph theoretic approach to the study of two datasets - the time series of 90 stocks from the New York stock exchange over a 3-year period, and the fMRI-derived time series acquired from 90 brain regions over the course of a 10-min-long functional MRI scan of resting brain function in healthy volunteers. Despite the many obvious substantive differences between these two datasets, graphical analysis demonstrated striking commonalities in terms of global network topological properties. Both the human brain and the market networks were non-random, small-world, modular, hierarchical systems with fat-tailed degree distributions indicating the presence of highly connected hubs. These properties could not be trivially explained by the univariate time series statistics of stock price returns. This degree of topological isomorphism suggests that brains and markets can be regarded broadly as members of the same family of networks. The two systems, however, were not topologically identical. The financial market was more efficient and more modular - more highly optimized for information processing - than the brain networks; but also less robust to systemic disintegration as a result of hub deletion. We conclude that the conceptual connections between brains and markets are not merely metaphorical; rather these two information processing systems can be rigorously compared in the same mathematical language and turn out often to share important topological properties in common to some degree. There will be interesting scientific arbitrage opportunities in further work at the graph-theoretically mediated interface between systems neuroscience and the statistical physics of financial markets.
A topological analysis of scientific coauthorship networks
Cardillo, Alessio; Scellato, Salvatore; Latora, Vito
2006-12-01
We study coauthorship networks based on the preprints submitted to the Los Alamos cond-mat database during the period 2000-2005. In our approach two scientists are considered connected if they have coauthored one or more cond-mat preprints together in the same year. We focus on the characterization of the structural properties of the derived graphs and on the time evolution of such properties. The results show that the cond-mat community has grown over the last six years. This is witnessed by an improvement in the connectivity properties of coauthorship graphs over the years, as confirmed by an increasing size of the largest connected component, of the global efficiency and of the clustering coefficient. We have also found that the graphs are characterized by long-tailed degree and betweenness distributions, assortative degree-degree correlations, and a power-law dependence of the clustering coefficient on the node degree.
A HYBRID APPROACH FOR NODE CO-OPERATION BASED CLUSTERING IN MOBILE AD HOC NETWORKS
Directory of Open Access Journals (Sweden)
C. Sathiyakumar
2013-01-01
Full Text Available A Mobile Ad-Hoc Network (MANET is termed as a set of wireless nodes which could be built with infrastructure less environment where network services are afforded by the nodes themselves. In such a situation, if a node refuses to co-operate with other nodes, then it will lead to a considerable diminution in throughput and the network operation decreases to low optimum value. Mobile Ad hoc Networks (MANETs rely on the collaboration of nodes for packet routing ahead. Nevertheless, much of the existing work in MANETs imagines that mobile nodes (probably possessed by selfish users will pursue prearranged protocols without variation. Therefore, implementing the co-operation between the nodes turn out to be an significant issue. The previous work described a secured key model for ad hoc network with efficient node clustering based on reputation and ranking model. But the downside is that the co-operation with the nodes is less results in a communication error. To enhance the security in MANET, in this work, we present a hybrid approach, build a node co-operation among the nodes in MANET by evaluating the weightage of cooperativeness of each node in MANET. With the estimation of normal co-operative nodes, nodes are restructured on its own (self. Then clustering is made with the reorganized nodes to form a secured communication among the nodes in the MANET environment. The Simulation of the proposed Hybrid Approach for Node Cooperation based Clustering (HANCC work is done for varying topology, node size, attack type and intensity with different pause time settings and the performance evaluations are carried over in terms of node cooperativeness, clustering efficiency, communication overhead and compared with an existing secured key model. Compared to an existing secured key model, the proposed HANCC performance is 80-90% high.
On the Evolution of Complex Network Topology Under Network Churn
Karyotis, Vasileios; Stai, Eleni; Papavassiliou, Symeon
2016-01-01
Part 6: Network Modeling; International audience; The future Internet is becoming more diverse, incorporating heterogeneous access networks. The latter are characterized by numerous devices that join/leave the network dynamically, creating intense churn patterns. New approaches to analyze and quantify churn-induced network evolution are required. In this paper, we address such need by introducing a new analysis framework that maps network evolution into trajectories in multi-dimensional vecto...
A versatile framework for cooperative hub network development
Cruijssen, F.C.A.M.; Borm, P.; Dullaert, W.; Hamers, H.
2010-01-01
This paper introduces a framework for cooperative hub network development. Building a joint physical hub for the transshipment of goods is expensive and, therefore, involves considerable risks for cooperating companies. In a practical setting, it is unlikely that an entire network will be built at o
The Practices of Student Network as Cooperative Learning in Ethiopia
Reda, Weldemariam Nigusse; Hagos, Girmay Tsegay
2015-01-01
Student network is a teaching strategy introduced as cooperative learning to all educational levels above the upper primary schools (grade 5 and above) in Ethiopia. The study was, therefore, aimed at investigating to what extent the student network in Ethiopia is actually practiced in line with the principles of cooperative learning. Consequently,…
Security-aware cooperation in cognitive radio networks
Zhang, Ning
2014-01-01
This brief investigates spectrum efficient and energy efficient strategies, known as cognitive radio networks (CRNs), to ensure secure cooperation between licensed and unlicensed users. The authors address issues of spectrum scarcity, spectrum sensing, transmission performance, trust-aware cooperation, and secure communications. Two security-aware cooperation based spectrum access schemes are presented. The first is a trust-aware cooperative framework for CRNs to improve the throughput or energy efficiency of licensed users and offer transmission opportunities to unlicensed users, taking into
Correlation and network topologies in global and local stock indices
Nobi, Ashadun; Lee, Sungmin; Kim, Doo Hwan; Lee, Jae Woo
2014-07-01
We examined how the correlation and network structure of the global indices and local Korean indices have changed during years 2000-2012. The average correlations of the global indices increased with time, while the local indices showed a decreasing trend except for drastic changes during the crises. A significant change in the network topologies was observed due to the financial crises in both markets. The Jaccard similarities identified the change in the market state due to a crisis in both markets. The dynamic change of the Jaccard index can be used as an indicator of systemic risk or precursors of the crisis.
Correlation and network topologies in global and local stock indices
DEFF Research Database (Denmark)
Nobi, A.; Lee, S.; Kim, D. H.;
2014-01-01
the crises. A significant change in the network topologies was observed due to the financial crises in both markets. The Jaccard similarities identified the change in the market state due to a crisis in both markets. The dynamic change of the Jaccard index can be used as an indicator of systemic risk......We examined how the correlation and network structure of the global indices and local Korean indices have changed during years 2000-2012. The average correlations of the global indices increased with time, while the local indices showed a decreasing trend except for drastic changes during...
Transport efficiency in topologically disordered networks with environmentally induced diffusion
Schijven, Petrus; Blumen, Alexander; Muelken, Oliver
2011-01-01
We study transport in topologically disordered networks that are subjected to an environment that induces classical diffusion. The dynamics is phenomenologically described within the framework of the recently introduced quantum stochastic walk, allowing to study the crossover between coherent transport and purely classical diffusion. We find that the coupling to the environment removes all effects of localization and quickly leads to classical transport. Furthermore, we find that on the level of the transport efficiency, the system can be well described by reducing it to a two-node network (a dimer).
A Stochastic-Geometry Approach to Coverage in Cellular Networks with Multi-Cell Cooperation
Huang, Kaibin
2011-01-01
Multi-cell cooperation is a promising approach for mitigating inter-cell interference in dense cellular networks. Quantifying the performance of multi-cell cooperation is challenging as it integrates physical-layer techniques and network topologies. For tractability, existing work typically relies on the over-simplified Wyner-type models. In this paper, we propose a new stochastic-geometry model for a cellular network with multi-cell cooperation, which accounts for practical factors including the irregular locations of base stations (BSs) and the resultant path-losses. In particular, the proposed network-topology model has three key features: i) the cells are modeled using a Poisson random tessellation generated by Poisson distributed BSs, ii) multi-antenna BSs are clustered using a hexagonal lattice and BSs in the same cluster mitigate mutual interference by spatial interference avoidance, iii) BSs near cluster edges access a different sub-channel from that by other BSs, shielding cluster-edge mobiles from s...
Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher
2005-01-01
This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.
Estimating topological properties of weighted networks from limited information
Gabrielli, Andrea; Cimini, Giulio; Garlaschelli, Diego; Squartini, Angelo
A typical problem met when studying complex systems is the limited information available on their topology, which hinders our understanding of their structural and dynamical properties. A paramount example is provided by financial networks, whose data are privacy protected. Yet, the estimation of systemic risk strongly depends on the detailed structure of the interbank network. The resulting challenge is that of using aggregate information to statistically reconstruct a network and correctly predict its higher-order properties. Standard approaches either generate unrealistically dense networks, or fail to reproduce the observed topology by assigning homogeneous link weights. Here we develop a reconstruction method, based on statistical mechanics concepts, that exploits the empirical link density in a highly non-trivial way. Technically, our approach consists in the preliminary estimation of node degrees from empirical node strengths and link density, followed by a maximum-entropy inference based on a combination of empirical strengths and estimated degrees. Our method is successfully tested on the international trade network and the interbank money market, and represents a valuable tool for gaining insights on privacy-protected or partially accessible systems. Acknoweledgement to ``Growthcom'' ICT - EC project (Grant No: 611272) and ``Crisislab'' Italian Project.
On hybrid cooperation in underlay cognitive radio networks
Mahmood, Nurul Huda
2013-09-01
Cooperative communication is a promising strategy to enhance the performance of a communication network as it helps to improve the coverage area and the outage performance. However, such enhancement comes at the expense of increased resource utilization, which is undesirable; more so in the case of opportunistic wireless systems such as cognitive radio networks. In order to balance the performance gains from cooperative communication against the possible over-utilization of resources, we propose and analyze an adaptive-cooperation technique for underlay cognitive radio networks, termed as hybrid-cooperation. Under the proposed cooperation scheme, secondary users in a cognitive radio network cooperate adaptively to enhance the spectral efficiency and the error performance of the network. The bit error rate, the spectral efficiency and the outage performance of the network under the proposed hybrid cooperation scheme with amplify-and-forward relaying are analyzed in this paper, and compared against conventional cooperation technique. Findings of the analytical performance analyses are further validated numerically through selected computer-based Monte-Carlo simulations. The proposed scheme is found to achieve significantly better performance in terms of the spectral efficiency and the bit error rate, compared to the conventional amplify-and-forward cooperation scheme. © 2013 IEEE.
Self-organized topology of recurrence-based complex networks.
Yang, Hui; Liu, Gang
2013-12-01
With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.
Self-organized topology of recurrence-based complex networks
Energy Technology Data Exchange (ETDEWEB)
Yang, Hui, E-mail: huiyang@usf.edu; Liu, Gang [Complex Systems Monitoring, Modeling and Analysis Laboratory, University of South Florida, Tampa, Florida 33620 (United States)
2013-12-15
With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.
Game theory in communication networks cooperative resolution of interactive networking scenarios
Antoniou, Josephina
2012-01-01
A mathematical tool for scientists and researchers who work with computer and communication networks, Game Theory in Communication Networks: Cooperative Resolution of Interactive Networking Scenarios addresses the question of how to promote cooperative behavior in interactive situations between heterogeneous entities in communication networking scenarios. It explores network design and management from a theoretical perspective, using game theory and graph theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities. The book promotes the use of Game T
Topology analysis of social networks extracted from literature.
Waumans, Michaël C; Nicodème, Thibaut; Bersini, Hugues
2015-01-01
In a world where complex networks are an increasingly important part of science, it is interesting to question how the new reading of social realities they provide applies to our cultural background and in particular, popular culture. Are authors of successful novels able to reproduce social networks faithful to the ones found in reality? Is there any common trend connecting an author's oeuvre, or a genre of fiction? Such an analysis could provide new insight on how we, as a culture, perceive human interactions and consume media. The purpose of the work presented in this paper is to define the signature of a novel's story based on the topological analysis of its social network of characters. For this purpose, an automated tool was built that analyses the dialogs in novels, identifies characters and computes their relationships in a time-dependent manner in order to assess the network's evolution over the course of the story.
Topology analysis of social networks extracted from literature.
Directory of Open Access Journals (Sweden)
Michaël C Waumans
Full Text Available In a world where complex networks are an increasingly important part of science, it is interesting to question how the new reading of social realities they provide applies to our cultural background and in particular, popular culture. Are authors of successful novels able to reproduce social networks faithful to the ones found in reality? Is there any common trend connecting an author's oeuvre, or a genre of fiction? Such an analysis could provide new insight on how we, as a culture, perceive human interactions and consume media. The purpose of the work presented in this paper is to define the signature of a novel's story based on the topological analysis of its social network of characters. For this purpose, an automated tool was built that analyses the dialogs in novels, identifies characters and computes their relationships in a time-dependent manner in order to assess the network's evolution over the course of the story.
Uncovering transcriptional regulation of metabolism by using metabolic network topology
DEFF Research Database (Denmark)
Patil, Kiran Raosaheb; Nielsen, Jens
2005-01-01
therefore developed an algorithm that is based on hypothesis-driven data analysis to uncover the transcriptional regulatory architecture of metabolic networks. By using information on the metabolic network topology from genome-scale metabolic reconstruction, we show that it is possible to reveal patterns...... in the metabolic network that follow a common transcriptional response. Thus, the algorithm enables identification of so-called reporter metabolites (metabolites around which the most significant transcriptional changes occur) and a set of connected genes with significant and coordinated response to genetic...... changes induced by complex regulatory mechanisms coordinating the activity of different metabolic pathways. It is difficult to map such global transcriptional responses by using traditional methods, because many genes in the metabolic network have relatively small changes at their transcription level. We...
Motif structure and cooperation in real-world complex networks
Salehi, Mostafa; Rabiee, Hamid R.; Jalili, Mahdi
2010-12-01
Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs’ cooperation properties and their abundance in a number of real-world networks including yeast protein-protein interaction, human brain, protein structure, email communication, dolphins’ social interaction, Zachary karate club and Net-science coauthorship networks. First, the amount of cooperativity for all possible undirected subgraphs with three to six nodes is calculated. To this end, the evolutionary dynamics of the Prisoner’s Dilemma game is considered and the cooperativity of each subgraph is calculated as the percentage of cooperating agents at the end of the simulation time. Then, the three- to six-node motifs are extracted for each network. The significance of the abundance of a motif, represented by a Z-value, is obtained by comparing them with some properly randomized versions of the original network. We found that there is always a group of motifs showing a significant inverse correlation between their cooperativity amount and Z-value, i.e. the more the Z-value the less the amount of cooperativity. This suggests that networks composed of well-structured units do not have good cooperativity properties.
Network physiology reveals relations between network topology and physiological function
Bashan, Amir; Bartsch, Ronny P.; Kantelhardt, Jan W.; Havlin, Shlomo; Ivanov, Plamen Ch.
2012-01-01
The human organism is an integrated network where complex physiological systems, each with its own regulatory mechanisms, continuously interact, and where failure of one system can trigger a breakdown of the entire network. Identifying and quantifying dynamical networks of diverse systems with different types of interactions is a challenge. Here we develop a framework to probe interactions among diverse systems, and we identify a physiological network. We find that each physiological state is...
The interaction of intrinsic dynamics and network topology in determining network burst synchrony.
Gaiteri, Chris; Rubin, Jonathan E
2011-01-01
The pre-Bötzinger complex (pre-BötC), within the mammalian respiratory brainstem, represents an ideal system for investigating the synchronization properties of complex neuronal circuits via the interaction of cell-type heterogeneity and network connectivity. In isolation, individual respiratory neurons from the pre-BötC may be tonically active, rhythmically bursting, or quiescent. Despite this intrinsic heterogeneity, coupled networks of pre-BötC neurons en bloc engage in synchronized bursting that can drive inspiratory motor neuron activation. The region's connection topology has been recently characterized and features dense clusters of cells with occasional connections between clusters. We investigate how the dynamics of individual neurons (quiescent/bursting/tonic) and the betweenness centrality of neurons' positions within the network connectivity graph interact to govern network burst synchrony, by simulating heterogeneous networks of computational model pre-BötC neurons. Furthermore, we compare the prevalence and synchrony of bursting across networks constructed with a variety of connection topologies, analyzing the same collection of heterogeneous neurons in small-world, scale-free, random, and regularly structured networks. We find that several measures of network burst synchronization are determined by interactions of network topology with the intrinsic dynamics of neurons at central network positions and by the strengths of synaptic connections between neurons. Surprisingly, despite the functional role of synchronized bursting within the pre-BötC, we find that synchronized network bursting is generally weakest when we use its specific connection topology, which leads to synchrony within clusters but poor coordination across clusters. Overall, our results highlight the relevance of interactions between topology and intrinsic dynamics in shaping the activity of networks and the concerted effects of connectivity patterns and dynamic heterogeneities.
[Cooperative Cardiovascular Disease Research Network (RECAVA)].
García-Dorado, David; Castro-Beiras, Alfonso; Díez, Javier; Gabriel, Rafael; Gimeno-Blanes, Juan R; Ortiz de Landázuri, Manuel; Sánchez, Pedro L; Fernández-Avilés, Francisco
2008-01-01
Today, cardiovascular disease is the principal cause of death and hospitalization in Spain, and accounts for an annual healthcare budget of more than 4000 million euros. Consequently, early diagnosis, effective prevention, and the optimum treatment of cardiovascular disease present a significant social and healthcare challenge for the country. In this context, combining all available resources to increase the efficacy and healthcare benefits of scientific research is a priority. This rationale prompted the establishment of the Spanish Cooperative Cardiovascular Disease Research Network, or RECAVA (Red Temática de Investigación Cooperativa en Enfermedades Cardiovasculares), 5 years ago. Since its foundation, RECAVA's activities have focused on achieving four objectives: a) to facilitate contacts between basic, clinical and epidemiological researchers; b) to promote the shared use of advanced technological facilities; c) to apply research results to clinical practice, and d) to train a new generation of translational cardiovascular researchers in Spain. At present, RECAVA consists of 41 research groups and seven shared technological facilities. RECAVA's research strategy is based on a scientific design matrix centered on the most important cardiovascular processes. The level of RECAVA's research activity is reflected in the fact that 28 co-authored articles were published in international journals during the first six months of 2007, with each involving contributions from at least two groups in the network. Finally, RECAVA also participates in the work of the Spanish National Center for Cardiovascular Research, or CNIC (Centro Nacional de Investigación Cardiovascular), and some established Biomedical Research Network Centers, or CIBER (Centros de Investigación Biomédica en RED), with the aim of consolidating the development of a dynamic multidisciplinary research framework that is capable of meeting the growing challenge that cardiovascular disease will present
Analyzed Virtual Routing Protocol for Future Networks (MANET & topological network
Directory of Open Access Journals (Sweden)
R. Viswanathan
2012-08-01
Full Text Available The mobile ad-hoc network (MANET is a wireless unstructured network and this has mostly suggested for multimedia streaming efficiency. The hackers attacks are reduce the capacity and efficiency of network in MANET. There are various types of protocol are used for the communication in MANET, but security is lacking in those techniques and some insoluble problems present in MANET. In this paper exhibits, a layered protocol network for secured data transmission called Analyzed Virtual Routing Protocol (AVRP. This protocol used to provide more secured data transmission and this not disturbing data streaming in the network.
Relay vs. User Cooperation in Time-Duplexed Multiaccess Networks
Sankar, Lalitha; Mandayam, Narayan B
2008-01-01
The performance of user-cooperation in a multi-access network is compared to that of using a wireless relay. Using the total transmit and processing power consumed at all nodes as a cost metric, the outage probabilities achieved by dynamic decode-and-forward (DDF) and amplify-and-forward (AF) are compared for the two networks. A geometry-inclusive high signal-to-noise ratio (SNR) outage analysis in conjunction with area-averaged numerical simulations shows that user and relay cooperation achieve a maximum diversity of K and 2 respectively for a K-user multiaccess network under both DDF and AF. However, when accounting for energy costs of processing and communication, relay cooperation can be more energy efficient than user cooperation, i.e., relay cooperation achieves coding (SNR) gains, particularly in the low SNR regime, that override the diversity advantage of user cooperation.
A method of characterizing network topology based on the breadth-first search tree
Zhou, Bin; He, Zhe; Wang, Nianxin; Wang, Bing-Hong
2016-05-01
A method based on the breadth-first search tree is proposed in this paper to characterize the hierarchical structure of network. In this method, a similarity coefficient is defined to quantitatively distinguish networks, and quantitatively measure the topology stability of the network generated by a model. The applications of the method are discussed in ER random network, WS small-world network and BA scale-free network. The method will be helpful for deeply describing network topology and provide a starting point for researching the topology similarity and isomorphism of networks.
Bus transport network of Shenyang considering competitive and cooperative relationship
Hu, Baoyu; Feng, Shumin; Nie, Cen
2017-01-01
Competition and cooperation is a universal phenomenon in bus transport networks (BTNs) because of the shared stations between bus routes. A measuring method is proposed for competitive and cooperative relationship between bus routes. Based on this measurement, we develop a new representation model for BTNs, namely competitive-cooperative space R. This model is applied to investigate empirically bus transport network of Shenyang (BTN-S) from China. We present the histograms of competitive-cooperative coefficients, competitive coefficients and cooperative coefficients to illustrate that competitive and cooperative relationship plays an important role in transporting passengers. The competitive-cooperative situation shows that cooperative relationship holds an absolutely dominant position in BTN-S. To explore the networked characteristics, we present some empirical distributions, for the number of bus stations on a route, the number of shared stations between two routes, degree and weighted degree, competitive strength, and cooperative strength. We also examine the correlations between degree and competitive strength, and between degree and cooperative strength. Besides, we investigate the diversities of competitive strength and cooperative strength in BTN-S. This study can help us to understand the BTN from a deeper level.
Foreign currency exchange network topology across the 2008 credit crisis
Sharif, Shamshuritawati; Ap, Nuraisah Che; Ruslan, Nuraimi
2017-05-01
A stable world currency exchange rate is a very important aspect to be considered for a developed country, i.e Malaysia. A better understanding about the currencies itself is needed nowadays. This project is about to understanding the fluctuation and to identify the most influential world currencies in the three different cases; before credit crisis, during credit crisis and after credit crisis. A network topology approach is use to examine the interrelationship between currencies based on correlation analysis. With this point of view, those relationships can be measured by a correlation structure among the currencies. The network can be analyse by filtering the important information using minimum spanning tree (MST) and interpret it using degree centrality as the centrality measure. This topology will give a useful guide to understand the behaviour and determine the most influential currency in the network as a part of a complex system. All currencies are compared among the three different cases; before credit crisis, during credit crisis and after credit crisis period. The result of this project shows that Unites State Dollar (USD), Brazilian Real (BRL), United Kingdom Pound (EUR) and Danish Krone (DKK) are the most influential currencies before the credit crisis period. With respect to during the credit crisis, New Zealand Dollar (NZD) dominates the network and it is followed by Singapore Dollar (SGD) for after the credit crisis period.
Microvascular network topology of the human retinal vessels.
Schröder, S; Brab, M; Schmid-Schönbein, G W; Reim, M; Schmid-Schönbein, H
1990-01-01
A quantitative analysis of blood flow in the human retinal vessels requires a detailed picture of the microvascular network topology. In order to lay the foundation for a quantitative microcirculatory network analysis of the human retina, a novel technique for tissue preparation and network characterization was developed. After injection of hydrogen peroxide into the human bulb, the microvasculature was filled with oxygen produced by endothelial catalase and visualized after embedding in a mixture of cedar oil and gum damar. The vessel topology was documented in the form of photomicrographs, which permitted complete reconstruction of the microvasculature on transparent overlays. By considering the complete capillary system it was possible to divide the retinal network into dichotomous, asymmetric arteriolar and venular trees. The Strahler ordering method, which considers both dichotomous and side branching configurations, was selected and applied to analyze the retinal vascular trees, using the capillaries as the zero order reference vessels. The number of vessel segments was found to be an approximate logarithmic function of the order number, in accordance with Horton's law. Vessel lengths within each order were found to be log-normal distributed, and median lengths for different orders could be approximated by a 2nd degree polynomial curve. Diameters within each order could be approximated by a Gaussian distribution, and the mean values for different orders could be expressed by an exponential curve. These data provide the basis for conductance, pressure and flow computations within the retinal microvessels.
Frequency-specific network topologies in the resting human brain
Directory of Open Access Journals (Sweden)
Shuntaro eSasai
2014-12-01
Full Text Available A community is a set of nodes with dense inter-connections, while there are sparse connections between different communities. A hub is a highly connected node with high centrality. It has been shown that both communities and hubs exist simultaneously in the brain’s functional connectivity network, as estimated by correlations among low-frequency spontaneous fluctuations in functional magnetic resonance imaging (fMRI signal changes (0.01–0.10 Hz. This indicates that the brain has a spatial organization that promotes both segregation and integration of information. Here, we demonstrate that frequency-specific network topologies that characterize segregation and integration also exist within this frequency range. In investigating the coherence spectrum among 87 brain regions, we found that two frequency bands, 0.01–0.03 Hz (very low frequency [VLF] band and 0.07–0.09 Hz (low frequency [LF] band, mainly contributed to functional connectivity. Comparing graph theoretical indices for the VLF and LF bands revealed that the network in the former had a higher capacity for information segregation between identified communities than the latter. Hubs in the VLF band were mainly located within the anterior cingulate cortices, whereas those in the LF band were located in the posterior cingulate cortices and thalamus. Thus, depending on the timescale of brain activity, at least two distinct network topologies contributed to information segregation and integration. This suggests that the brain intrinsically has timescale-dependent functional organizations.
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
In this paper, we investigate coherence resonance (CR) and noise-induced synchronization in Hindmarsh-Rose (HR) neural network with three different types of topologies: regular, random, and small-world. It is found that the additive noise can induce CR in HR neural network with different topologies and its coherence is optimized by a proper noise level. It is also found that as coupling strength increases the plateau in the measure of coherence curve becomes broadened and the effects of network topology is more pronounced simultaneously. Moreover, we find that increasing tie probability p of the network topology leads to an enhancement of noise-induced synchronization in HR neurons network.
A Qualitative Comparison of Different Logical Topologies for Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Quazi Mamun
2012-11-01
Full Text Available Wireless Sensor Networks (WSNs are formed by a large collection of power-conscious wireless-capable sensors without the support of pre-existing infrastructure, possibly by unplanned deployment. With a sheer number of sensor nodes, their unattended deployment and hostile environment very often preclude reliance on physical configuration or physical topology. It is, therefore, often necessary to depend on the logical topology. Logical topologies govern how a sensor node communicates with other nodes in the network. In this way, logical topologies play a vital role for resource-constraint sensor networks. It is thus more intuitive to approach the constraint minimizing problems from (logical topological point of view. Hence, this paper aims to study the logical topologies of WSNs. In doing so, a set of performance metrics is identified first. We identify various logical topologies from different application protocols of WSNs, and then compare the topologies using the set of performance metrics.
A qualitative comparison of different logical topologies for Wireless Sensor Networks.
Mamun, Quazi
2012-11-05
Wireless Sensor Networks (WSNs) are formed by a large collection of power-conscious wireless-capable sensors without the support of pre-existing infrastructure, possibly by unplanned deployment. With a sheer number of sensor nodes, their unattended deployment and hostile environment very often preclude reliance on physical configuration or physical topology. It is, therefore, often necessary to depend on the logical topology. Logical topologies govern how a sensor node communicates with other nodes in the network. In this way, logical topologies play a vital role for resource-constraint sensor networks. It is thus more intuitive to approach the constraint minimizing problems from (logical) topological point of view. Hence, this paper aims to study the logical topologies of WSNs. In doing so, a set of performance metrics is identified first. We identify various logical topologies from different application protocols of WSNs, and then compare the topologies using the set of performance metrics.
Adaptive topology evolution in information-sharing social networks
Chen, Duanbing; Lu, Linyuan; Medo, Matus; Zhang, Yi-Cheng; Zhou, Tao
2011-01-01
The advent of Internet and World Wide Web has led to unprecedent growth of the information available. People usually face the information overload by following a limited number of sources which best fit their interests. In order to get the picture it is important to address issues like who people do follow and how they search for better information sources. In this work we conduct an empirical analysis on different on-line social networking sites, and draw inspiration from its results to present different source selection strategies in an adaptive model for social recommendation. We show that local search rules which enhance the typical topological features of real social communities give rise to network configurations that are globally optimal. Hence these abstract rules help to create networks which are both effective in information diffusion and people friendly.
Lefschetz, Solomon
1930-01-01
Lefschetz's Topology was written in the period in between the beginning of topology, by PoincarÃ©, and the establishment of algebraic topology as a well-formed subject, separate from point-set or geometric topology. At this time, Lefschetz had already proved his first fixed-point theorems. In some sense, the present book is a description of the broad subject of topology into which Lefschetz's theory of fixed points fits. Lefschetz takes the opportunity to describe some of the important applications of his theory, particularly in algebraic geometry, to problems such as counting intersections of
Hocking, John G
1988-01-01
""As textbook and reference work, this is a valuable addition to the topological literature."" - Mathematical ReviewsDesigned as a text for a one-year first course in topology, this authoritative volume offers an excellent general treatment of the main ideas of topology. It includes a large number and variety of topics from classical topology as well as newer areas of research activity.There are four set-theoretic chapters, followed by four primarily algebraic chapters. Chapter I covers the fundamentals of topological and metrical spaces, mappings, compactness, product spaces, the Tychonoff t
Subregional Mesiotemporal Network Topology Is Altered in Temporal Lobe Epilepsy.
Bernhardt, Boris C; Bernasconi, Neda; Hong, Seok-Jun; Dery, Sebastian; Bernasconi, Andrea
2016-07-01
Temporal lobe epilepsy (TLE) is the most frequent drug-resistant epilepsy in adults and commonly associated with variable degrees of mesiotemporal atrophy on magnetic resonance imaging (MRI). Analyses of inter-regional connectivity have unveiled disruptions in large-scale cortico-cortical networks; little is known about the topological organization of the mesiotemporal lobe, the limbic subnetwork central to the disorder. We generated covariance networks based on high-resolution MRI surface-shape descriptors of the hippocampus, entorhinal cortex, and amygdala in 134 TLE patients and 45 age- and sex-matched controls. Graph-theoretical analysis revealed increased path length and clustering in patients, suggesting a shift toward a more regularized arrangement; findings were reproducible after split-half assessment and across 2 parcellation schemes. Analysis of inter-regional correlations and module participation showed increased within-structure covariance, but decreases between structures, particularly with regards to the hippocampus and amygdala. While higher clustering possibly reflects topological consequences of axonal sprouting, decreases in interstructure covariance may be a consequence of disconnection within limbic circuitry. Preoperative network parameters, specifically the segregation of the ipsilateral hippocampus, predicted long-term seizure freedom after surgery.
Sensor Networks with Random Links: Topology Design for Distributed Consensus
Kar, Soummya
2007-01-01
In a sensor network, in practice, the communication among sensors is subject to:(1) errors or failures at random times; (3) costs; and(2) constraints since sensors and networks operate under scarce resources, such as power, data rate, or communication. The signal-to-noise ratio (SNR) is usually a main factor in determining the probability of error (or of communication failure) in a link. These probabilities are then a proxy for the SNR under which the links operate. The paper studies the problem of designing the topology, i.e., assigning the probabilities of reliable communication among sensors (or of link failures) to maximize the rate of convergence of average consensus, when the link communication costs are taken into account, and there is an overall communication budget constraint. To consider this problem, we address a number of preliminary issues: (1) model the network as a random topology; (2) establish necessary and sufficient conditions for mean square sense (mss) and almost sure (a.s.) convergence o...
Relationship between topology and functions in metabolic network evolution
Institute of Scientific and Technical Information of China (English)
WANG Zhuo; CHEN Qi; LIU Lei
2009-01-01
What is the relationship between the topological connections among enzymes and their functions during metabolic network evolution? Does this relationship show similarity among closely related or-ganisms? Here we investigated the relationship between enzyme connectivity and functions in meta-bolic networks of chloroplast and its endosymbiotic ancestor, cyanobacteria (Synechococcus sp. WH8102). Also several other species, including E. coil, Arabidopsis thaliana and Cyanidioschyzon merolae, were used for the comparison. We found that the average connectivity among different func-tional pathways and enzyme classifications (EC) was different in all the species examined. However, the average connectivity of enzymes in the same functional classification was quite similar between chloroplast and one representative of cyanobacteria, syw. In addition, the enzymes in the highly con-served modules between chloroplast and syw, such as amino acid metabolism, were highly connected compared with other modules. We also discovered that the isozymes of chloroplast and syw often had higher connectivity, corresponded to primary metabolism and also existed in conserved module. In conclusion, despite the drastic re-organization of metabolism in chloroplast during endosymbiosis, the relationship between network topology and functions is very similar between chloroplast and its pre-cursor cyanobacteria, which demonstrates that the relationship may be used as an indicator of the closeness in evolution.
Identifying network topologies that can generate turing pattern.
Zheng, M Mocarlo; Shao, Bin; Ouyang, Qi
2016-11-07
Turing pattern provides a paradigm of non-equilibrium self-organization in reaction-diffusion systems. On the basis of many mathematical studies, it has been proposed that various biological development processes use Turing instability to achieve periodic patterns. In this paper, we introduce a framework to systematic identify network topologies that are capable for Turing pattern formation. All possible 2, 3-node genetic regulatory networks are enumerated and linear stability analysis is applied to access their ability to generate Turing instability. We find that all 3-node networks that can achieve Turing pattern can be mapped to either pure or cross activator-inhibitor mechanisms, and the pure activator-inhibitor system is more robust for Turing pattern formation than the other one. Additional linkages can further increase the performance of the circuit by either introducing another core topology or complementing existing regulations. Moreover, we find that addition of a fixed node enables the formation of Turing pattern even when the diffusion coefficients of two morphogens are fairly close to each other. Our results provide the design principle of robust circuits for Turing pattern generation and can be further applied for systematically exploring other bifurcation phenomena.
DEFF Research Database (Denmark)
Yu, Hao; Yan, Ying; Berger, Michael Stubert
2009-01-01
of Service (QoS) provisioning abilities, which guarantee end-to-end performances of voice, video and data traffic delivered over networks. This paper introduces a topology-based hierarchical scheduler scheme, which controls the incoming traffic at the edge of the network based on the network topology...
Topology identification of the complex networks with non-delayed and delayed coupling
Guo, Wanli; Chen, Shihua; Sun, Wen
2009-10-01
In practical situation, there exists many uncertain information in complex networks, such as the topological structures. So the topology identification is an important issue in the research of the complex networks. Based on LaSalle's invariance principle, in this Letter, an adaptive controlling method is proposed to identify the topology of a weighted general complex network model with non-delayed and delayed coupling. Finally, simulation results show that the method is effective.
Topology identification of the complex networks with non-delayed and delayed coupling
Energy Technology Data Exchange (ETDEWEB)
Guo Wanli, E-mail: guowanliff@163.co [School of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Chen Shihua; Sun Wen [School of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China)
2009-10-05
In practical situation, there exists many uncertain information in complex networks, such as the topological structures. So the topology identification is an important issue in the research of the complex networks. Based on LaSalle's invariance principle, in this Letter, an adaptive controlling method is proposed to identify the topology of a weighted general complex network model with non-delayed and delayed coupling. Finally, simulation results show that the method is effective.
Topological Characterization of Hamming and Dragonfly Networks and its Implications on Routing
Camarero Coterillo, Cristobal; Vallejo Gutiérrez, Enrique; Beivide Palacio, Julio Ramón
2014-01-01
Current HPC and datacenter networks rely on large-radix routers. Hamming graphs (Cartesian products of complete graphs) and dragonflies (two-level direct networks with nodes organized in groups) are some direct topologies proposed for such networks. The original definition of the dragonfly topology is very loose, with several degrees of freedom such as the inter- and intra-group topology, the specific global connectivity and the number of parallel links between groups (or trunking level). ...
The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks.
Greenbury, Sam F; Johnston, Iain G; Smith, Matthew A; Doye, Jonathan P K; Louis, Ard A
2010-11-01
We investigate how scale-free (SF) and Erdos-Rényi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we find that networks with SF(in) topologies, that is SF topology for incoming nodes and ER topology for outgoing nodes, are significantly more evolvable towards specific oscillatory targets than networks with ER topology for both incoming and outgoing nodes. Similar results are found for networks with SF(both) and SF(out) topologies. The functionality of the SF(out) topology, which most closely resembles the structure of biological gene networks (Babu et al., 2004), is compared to the ER topology in further detail through an extension to multiple target outputs, with either an oscillatory or a non-oscillatory nature. For multiple oscillatory targets of the same length, the differences between SF(out) and ER networks are enhanced, but for non-oscillatory targets both types of networks show fairly similar evolvability. We find that SF networks generate oscillations much more easily than ER networks do, and this may explain why SF networks are more evolvable than ER networks are for oscillatory phenotypes. In spite of their greater evolvability, we find that networks with SF(out) topologies are also more robust to mutations (mutational robustness) than ER networks. Furthermore, the SF(out) topologies are more robust to changes in initial conditions (environmental robustness). For both topologies, we find that once a population of networks has reached the target state, further neutral evolution can lead to an increase in both the mutational robustness and the environmental robustness to changes in initial conditions.
Cooperative water network system to reduce carbon footprint.
Lim, Seong-Rin; Park, Jong Moon
2008-08-15
Much effort has been made in reducing the carbon footprint to mitigate climate change. However, water network synthesis has been focused on reducing the consumption and cost of freshwater within each industrial plant. The objective of this study is to illustrate the necessity of the cooperation of industrial plants to reduce the total carbon footprint of their water supply systems. A mathematical optimization model to minimize global warming potentials is developed to synthesize (1) a cooperative water network system (WNS) integrated over two plants and (2) an individual WNS consisting of two WNSs separated for each plant. The cooperative WNS is compared to the individual WNS. The cooperation reduces their carbon footprint and is economically feasible and profitable. A strategy for implementing the cooperation is suggested for the fair distribution of costs and benefits. As a consequence, industrial plants should cooperate with their neighbor plants to further reduce the carbon footprint.
A Review of the Topologies Used in Smart Water Meter Networks: A Wireless Sensor Network Application
Directory of Open Access Journals (Sweden)
Jaco Marais
2016-01-01
Full Text Available This paper presents several proposed and existing smart utility meter systems as well as their communication networks to identify the challenges of creating scalable smart water meter networks. Network simulations are performed on 3 network topologies (star, tree, and mesh to determine their suitability for smart water meter networks. The simulations found that once a number of nodes threshold is exceeded the network’s delay increases dramatically regardless of implemented topology. This threshold is at a relatively low number of nodes (50 and the use of network topologies such as tree or mesh helps alleviate this problem and results in lower network delays. Further simulations found that the successful transmission of application layer packets in a 70-end node tree network can be improved by 212% when end nodes only transmit data to their nearest router node. The relationship between packet success rate and different packet sizes was also investigated and reducing the packet size with a factor of 16 resulted in either 156% or 300% increases in the amount of successfully received packets depending on the network setup.
Future cooperative communication systems driven by social mobile networks
DEFF Research Database (Denmark)
Blázovics, L.; Varga, C.; Bamford, W.
2011-01-01
In this work we are underlining the importance of social mobile networks for upcoming cooperative communication systems. The assumption of this work is that future mobile communication systems will incorporate user cooperation, i.e. a combination of cellular access in parallel with ongoing short...... range links to the neighboring devices. It has been shown that user cooperation enables higher data rates, better spectral efficiencies, and reduces the energy consumption of the mobile unit. In this work the social mobile networks are identified to be a fertile ground to facilitate the cooperative use...... cases. By the example of the Gedda-Headz gaming community, possible links between cooperative mobile communication and social mobile networks are shown....
Stability of Boolean networks: The joint effects of topology and update rules
Squires, Shane; Pomerance, Andrew; Girvan, Michelle; Ott, Edward
2014-08-01
We study the stability of orbits in large Boolean networks. We treat the case in which the network has a given complex topology, and we do not assume a specific form for the update rules, which may be correlated with local topological properties of the network. While recent past work has addressed the separate effects of complex network topology and certain classes of update rules on stability, only crude results exist about how these effects interact. We present a widely applicable solution to this problem. Numerical simulations confirm our theory and show that local correlations between topology and update rules can have profound effects on the qualitative behavior of these systems.
An algebraic topological method for multimodal brain networks comparison
Directory of Open Access Journals (Sweden)
Tiago eSimas
2015-07-01
Full Text Available Understanding brain connectivity is one of the most important issues in neuroscience. Nonetheless, connectivity data can reflect either functional relationships of brain activities or anatomical connections between brain areas. Although both representations should be related, this relationship is not straightforward. We have devised a powerful method that allows different operations between networks that share the same set of nodes, by embedding them in a common metric space, enforcing transitivity to the graph topology. Here, we apply this method to construct an aggregated network from a set of functional graphs, each one from a different subject. Once this aggregated functional network is constructed, we use again our method to compare it with the structural connectivity to identify particular brain regions that differ in both modalities (anatomical and functional. Remarkably, these brain regions include functional areas that form part of the classical resting state networks. We conclude that our method -based on the comparison of the aggregated functional network- reveals some emerging features that could not be observed when the comparison is performed with the classical averaged functional network.
Quantification of blood flow and topology in developing vascular networks.
Directory of Open Access Journals (Sweden)
Astrid Kloosterman
Full Text Available Since fluid dynamics plays a critical role in vascular remodeling, quantification of the hemodynamics is crucial to gain more insight into this complex process. Better understanding of vascular development can improve prediction of the process, and may eventually even be used to influence the vascular structure. In this study, a methodology to quantify hemodynamics and network structure of developing vascular networks is described. The hemodynamic parameters and topology are derived from detailed local blood flow velocities, obtained by in vivo micro-PIV measurements. The use of such detailed flow measurements is shown to be essential, as blood vessels with a similar diameter can have a large variation in flow rate. Measurements are performed in the yolk sacs of seven chicken embryos at two developmental stages between HH 13+ and 17+. A large range of flow velocities (1 µm/s to 1 mm/s is measured in blood vessels with diameters in the range of 25-500 µm. The quality of the data sets is investigated by verifying the flow balances in the branching points. This shows that the quality of the data sets of the seven embryos is comparable for all stages observed, and the data is suitable for further analysis with known accuracy. When comparing two subsequently characterized networks of the same embryo, vascular remodeling is observed in all seven networks. However, the character of remodeling in the seven embryos differs and can be non-intuitive, which confirms the necessity of quantification. To illustrate the potential of the data, we present a preliminary quantitative study of key network topology parameters and we compare these with theoretical design rules.
Network Analysis of Cooperation in Tourism Destinations
Directory of Open Access Journals (Sweden)
Gajdošík Tomáš
2015-12-01
Full Text Available Globalisation on the tourism market causes that the competition is not formed only between stakeholders in a destination, but more and more it is created among destinations. Therefore tourism stakeholders in a destination have to act together and cooperate. The cooperative behaviour of destination stakeholders is seen as a main prerequisite of applying the cooperative destination management, which influences the competitiveness of destination on tourism market.
On the Selection of Physical Layer Optimized Network Topologies for the Zigbee Network
Directory of Open Access Journals (Sweden)
Manpreet
2016-01-01
Full Text Available Zigbee standard has been designed for low data rate, low cost and limited power applications for short-range wireless communication. The successful implementation of Zigbee based network depends on the suitable selection of physical (PHY layer and medium access control (MAC layer parameters. In this work the PHY layer parameters have been optimized for star, tree and mesh topologies. The performance investigations have been carried out for different frequency band and data rate and different bandwidth (BW in each of standard topologies. Through extensive simulations, QoS parameters like throughput, network load and delay have been evaluated to achieve optimal performance of physical layer.
Does sleep restore the topology of functional brain networks?
Koenis, Maria M G; Romeijn, Nico; Piantoni, Giovanni; Verweij, Ilse; Van der Werf, Ysbrand D; Van Someren, Eus J W; Stam, Cornelis J
2013-02-01
Previous studies have shown that healthy anatomical as well as functional brain networks have small-world properties and become less optimal with brain disease. During sleep, the functional brain network becomes more small-world-like. Here we test the hypothesis that the functional brain network during wakefulness becomes less optimal after sleep deprivation (SD). Electroencephalography (EEG) was recorded five times a day after a night of SD and after a night of normal sleep in eight young healthy subjects, both during eyes-closed and eyes-open resting state. Overall synchronization was determined with the synchronization likelihood (SL) and the phase lag index (PLI). From these coupling strength matrices the normalized clustering coefficient C (a measurement of local clustering) and path length L (a measurement of global integration) were computed. Both measures were normalized by dividing them by their corresponding C-s and L-s values of random control networks. SD reduced alpha band C/C-s and L/L-s and theta band C/C-s during eyes-closed resting state. In contrast, SD increased gamma-band C/C-s and L/L-s during eyes-open resting state. Functional relevance of these changes in network properties was suggested by their association with sleep deprivation-induced performance deficits on a sustained attention simple reaction time task. The findings indicate that SD results in a more random network of alpha-coupling and a more ordered network of gamma-coupling. The present study shows that SD induces frequency-specific changes in the functional network topology of the brain, supporting the idea that sleep plays a role in the maintenance of an optimal functional network. Copyright © 2011 Wiley Periodicals, Inc.
A network traffic reduction method for cooperative positioning
Das, Kallol; Wymeersch, Henk
2011-01-01
Cooperative positioning is suitable for applications where conventional positioning fails due to lack of connectivity with a sufficient number of reference nodes. In a dense network, as the number of cooperating devices increases, the number of packet exchanges also increases proportionally. This ca
Directory of Library Networks and Cooperative Library Organizations, 1980.
National Center for Education Statistics (DHEW), Washington, DC.
This directory lists cooperating library organizations and networks in the United States which engage in cooperative, interinstitutional activities beyond the scope of traditional interlibrary loan services and reciprocal borrowing. Criteria for inclusion, survey methodology, and entry format are explained. Entries identify the address, phone…
Censoring for Bayesian Cooperative Positioning in Dense Wireless Networks
Das, Kallol; Wymeersch, Henk
2012-01-01
Cooperative positioning is a promising solution for location-enabled technologies in GPS-challenged environments. However, it suffers from high computational complexity and increased network traffic, compared to traditional positioning approaches. The computational complexity is related to the numbe
Kuratowski, Kazimierz
1966-01-01
Topology, Volume I deals with topology and covers topics ranging from operations in logic and set theory to Cartesian products, mappings, and orderings. Cardinal and ordinal numbers are also discussed, along with topological, metric, and complete spaces. Great use is made of closure algebra. Comprised of three chapters, this volume begins with a discussion on general topological spaces as well as their specialized aspects, including regular, completely regular, and normal spaces. Fundamental notions such as base, subbase, cover, and continuous mapping, are considered, together with operations
Kuratowski, Kazimierz
1968-01-01
Topology, Volume II deals with topology and covers topics ranging from compact spaces and connected spaces to locally connected spaces, retracts, and neighborhood retracts. Group theory and some cutting problems are also discussed, along with the topology of the plane. Comprised of seven chapters, this volume begins with a discussion on the compactness of a topological space, paying particular attention to Borel, Lebesgue, Riesz, Cantor, and Bolzano-Weierstrass conditions. Semi-continuity and topics in dimension theory are also considered. The reader is then introduced to the connecte
Cooperation in changing environments: Irreversibility in the transition to cooperation in networks
Gracia-Lázaro, C; Gómez-Gardeñes, J; Moreno, Y
2013-01-01
In the framework of the evolutionary dynamics of the Prisoner's Dilemma game on complex networks, we investigate the possibility that the average level of cooperation shows hysteresis under quasi-static variations of a model parameter (the "temptation to defect"). Under the "discrete replicator" strategy updating rule, for both Erd\\"os -R\\'enyi and Barab\\'asi-Albert graphs we observe cooperation hysteresis cycles provided one reaches tipping point values of the parameter; otherwise, perfect reversibility is obtained. The selective fixation of cooperation at certain nodes and its organization in cooperator clusters, that are surrounded by fluctuating strategists, allows the rationalization of the "lagging behind" behavior observed.
Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks
Krishnakumar, R N; Kumar, P Vijay
2008-01-01
The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for any number of relays.
Cooperative Jamming for Physical Layer Security in Wireless Sensor Networks
DEFF Research Database (Denmark)
Rohokale, Vandana M.; Prasad, Neeli R.; Prasad, Ramjee
2012-01-01
Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This work proposes a novel cooperative jamming mechanism for scalable networks like Wireless Sensor Networks (WSNs) which makes use of friendly interference to confuse the eavesdropper...... work as cooperative jamming sources to increase the equivocation of the eavesdropper. In this work, eavesdropper’s equivocation is compared with the main channel in terms of mutual information and secrecy capacity....
Topological reversibility and causality in feed-forward networks
Energy Technology Data Exchange (ETDEWEB)
Corominas-Murtra, Bernat; RodrIguez-Caso, Carlos; Sole, Ricard [ICREA-Complex Systems Lab, Universitat Pompeu Fabra (Parc de Recerca Biomedica de Barcelona), Dr Aiguader 88, 08003 Barcelona (Spain); Goni, JoaquIn, E-mail: bernat.corominas@upf.ed [Functional Neuroimaging Laboratory, Department of Neurosciences, Center for Applied Medical Research, University of Navarra, Pamplona (Spain)
2010-11-15
Systems whose organization displays causal asymmetry constraints, from evolutionary trees to river basins or transport networks, can often be described in terms of directed paths on a discrete set of arbitrary units including states in state spaces, feed-forward neural nets, the evolutionary history of a given collection of events or the chart of computational states visited along a complex computation. Such a set of paths defines a feed-forward, acyclic network. A key problem associated with these systems involves characterizing their intrinsic degree of path reversibility: given an end node in the graph, what is the uncertainty of recovering the process backwards until the origin? Here, we propose a novel concept, topological reversibility, which is a measure of the complexity of the net that rigorously weights such uncertainty in path dependency, quantifying the minimum amount of information required to successfully reverse a causal path. Within the proposed framework, we also analytically characterize limit cases for both topologically reversible and maximally entropic structures. The relevance of these measures within the context of evolutionary dynamics is highlighted.
Temporal modulation of collective cell behavior controls vascular network topology.
Kur, Esther; Kim, Jiha; Tata, Aleksandra; Comin, Cesar H; Harrington, Kyle I; Costa, Luciano da F; Bentley, Katie; Gu, Chenghua
2016-02-24
Vascular network density determines the amount of oxygen and nutrients delivered to host tissues, but how the vast diversity of densities is generated is unknown. Reiterations of endothelial-tip-cell selection, sprout extension and anastomosis are the basis for vascular network generation, a process governed by the VEGF/Notch feedback loop. Here, we find that temporal regulation of this feedback loop, a previously unexplored dimension, is the key mechanism to determine vascular density. Iterating between computational modeling and in vivo live imaging, we demonstrate that the rate of tip-cell selection determines the length of linear sprout extension at the expense of branching, dictating network density. We provide the first example of a host tissue-derived signal (Semaphorin3E-Plexin-D1) that accelerates tip cell selection rate, yielding a dense network. We propose that temporal regulation of this critical, iterative aspect of network formation could be a general mechanism, and additional temporal regulators may exist to sculpt vascular topology.
Optimal Grouping and Matching for Network-Coded Cooperative Communications
Energy Technology Data Exchange (ETDEWEB)
Sharma, S; Shi, Y; Hou, Y T; Kompella, S; Midkiff, S F
2011-11-01
Network-coded cooperative communications (NC-CC) is a new advance in wireless networking that exploits network coding (NC) to improve the performance of cooperative communications (CC). However, there remains very limited understanding of this new hybrid technology, particularly at the link layer and above. This paper fills in this gap by studying a network optimization problem that requires joint optimization of session grouping, relay node grouping, and matching of session/relay groups. After showing that this problem is NP-hard, we present a polynomial time heuristic algorithm to this problem. Using simulation results, we show that our algorithm is highly competitive and can produce near-optimal results.
Development of Active External Network Topology Module for Floodlight SDN Controller
Directory of Open Access Journals (Sweden)
A. A. Noskov
2015-01-01
Full Text Available Traditional network architecture is inflexible and complicated. This observation has led to a paradigm shift towards software-defined networking (SDN, where network management level is separated from data forwarding level. This change was made possible by control plane transfer from the switching equipment to software modules that run on a dedicated server, called the controller (or network operating system, or network applications, that work with this controller. Methods of representation, storage and communication interfaces with network topology elements are the most important aspects of network operating systems available to SDN user because performance of some key controller modules is heavily dependent on internal representation of the network topology. Notably, firewall and routing modules are examples of such modules. This article describes the methods used for presentation and storage of network topologies, as well as interface to the corresponding Floodlight modules. An alternative algorithm has been suggested and developed for message exchange conveying network topology alterations between the controller and network applications. Proposed algorithm makes implementation of module alerting based on subscription to the relevant events. API for interaction between controller and network applications has been developed. This algorithm and API formed the base for Topology Tracker module capable to inform network applications about the changes that had occurred in the network topology and also stores compact representation of the network to speed up the interaction process.
Inferring topologies via driving-based generalized synchronization of two-layer networks
Wang, Yingfei; Wu, Xiaoqun; Feng, Hui; Lu, Jun-an; Xu, Yuhua
2016-05-01
The interaction topology among the constituents of a complex network plays a crucial role in the network’s evolutionary mechanisms and functional behaviors. However, some network topologies are usually unknown or uncertain. Meanwhile, coupling delays are ubiquitous in various man-made and natural networks. Hence, it is necessary to gain knowledge of the whole or partial topology of a complex dynamical network by taking into consideration communication delay. In this paper, topology identification of complex dynamical networks is investigated via generalized synchronization of a two-layer network. Particularly, based on the LaSalle-type invariance principle of stochastic differential delay equations, an adaptive control technique is proposed by constructing an auxiliary layer and designing proper control input and updating laws so that the unknown topology can be recovered upon successful generalized synchronization. Numerical simulations are provided to illustrate the effectiveness of the proposed method. The technique provides a certain theoretical basis for topology inference of complex networks. In particular, when the considered network is composed of systems with high-dimension or complicated dynamics, a simpler response layer can be constructed, which is conducive to circuit design. Moreover, it is practical to take into consideration perturbations caused by control input. Finally, the method is applicable to infer topology of a subnetwork embedded within a complex system and locate hidden sources. We hope the results can provide basic insight into further research endeavors on understanding practical and economical topology inference of networks.
Employing Deceptive Dynamic Network Topology Through Software-Defined Networking
2014-03-01
Internetwork Operating System IP Internet Protocol IPID Internet Protocol Identification IPv4 Internet Protocol version 4 IPv6 Internet Protocol...techniques can be deceived in §2.3. 1.1.2 OpenFlow With the development of more advanced applications and mobile computing, to computer and network...the main criteria by which routers make their decision. The first field of interest is the IP version: IPv4 or Internet Protocol version 6 ( IPv6 ). As
Interdependent networks - Topological percolation research and application in finance
Zhou, Di
This dissertation covers the two major parts of my Ph.D. research: i) developing a theoretical framework of complex networks and applying simulation and numerical methods to study the robustness of the network system, and ii) applying statistical physics concepts and methods to quantitatively analyze complex systems and applying the theoretical framework to study real-world systems. In part I, we focus on developing theories of interdependent networks as well as building computer simulation models, which includes three parts: 1) We report on the effects of topology on failure propagation for a model system consisting of two interdependent networks. We find that the internal node correlations in each of the networks significantly changes the critical density of failures, which can trigger the total disruption of the two-network system. Specifically, we find that the assortativity within a single network decreases the robustness of the entire system. 2) We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-p fraction of nodes. We find that as the coupling strength q between the two networks reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths q1 and q2 , which separate the behaviors of the giant component as a function of p into three different regions, and for q2 economic systems. We analyze stock market indices and foreign exchange daily returns for 60 countries over the period of 1999-2012. We build a multi-layer network model based on different correlation measures, and introduce a dynamic network model to simulate and analyze the initializing and spreading of financial crisis. Using different computational approaches and econometric tests, we find atypical behavior of the cross correlations and community formations in the financial networks that we study during the financial crisis of 2008. For example, the overall correlation of stock market increases during crisis
Directory of Open Access Journals (Sweden)
Bjorn Goemann
2011-12-01
Full Text Available We have comparatively investigated three different mammalian networks - on transcription, signal transduction and metabolic processes - with respect to their common and individual topological traits. The networks have been constructed based on genome- wide data collected from human, mouse and rat. None of these three networks exhibits a pure power-law degree distribution and, therefore, could be considered scalefree. Rather, the degree distributions of all three networks were best fitted by mixed models of a power law with an exponential tail. The networks differ from one another in the quantitative parameters of the models. Moreover, the transcription network can also be very well approximated by an exponential law. The connectivity within each network is rather robust, as is seen when removing individual nodes and computing the values of their pairwise disconnectivity index (PDI, which characterizes the topological significance of each node v by the number of direct or indirect connections in the network that critically depend on the presence of v. The results evidence that the networks are not centralized: none of nodes globally controls the integrity of each network. Just a few vertices appeared to strongly affect the coherence of the networks. These nodes are characterized by a broad range of degrees, thereby indicating that the degree alone is not the decisive criteria of a node's importance. The networks reveal distinct architectures: The transcriptional network exhibits a hierarchical modularity, whereas the signaling network is mainly comprised of semi-autonomous modules. The metabolic network seems to be made by a more complex mixture of substructures. Thus, despite being encoded by the same genomes, the networks significantly differ from one another in their general architectural design. Altogether, our results indicate that the subsets of genes and relationships that constitute these networks have co-evolved very differently and
Proceedings of the International Symposium on Topological Aspects of Critical Systems and Networks
Yakubo, Kousuke; Amitsuka, Hiroshi; Ishikawa, Goo; Machino, Kazuo; Nakagaki, Toshiyuki; Tanda, Satoshi; Yamada, Hideto; Kichiji, Nozomi
2007-07-01
I. General properties of networks. Physics of network security / Y.-C. Lai, X. Wand and C. H. Lai. Multi-state interacting particle systems on scale-free networks / N. Masuda and N. Konno. Homotopy Reduction of Complex Networks 18 / Y. Hiraoka and T. Ichinomiya. Analysis of the Susceptible-Infected-Susceptible Model on Complex Network / T. Ichinomiya -- II. Complexity in social science. Innovation and Development in a Random Lattice / J. Lahtinen. Long-tailed distributions in biological systems: revisit to Lognormals / N. Kobayashi ... [et al.]. Two-class structure of income distribution in the USA:exponential bulk and power-law tail / V. M. Yakovenko and A. Christian Silva. Power Law distributions in two community currencies / N. Kichiji and M. Nishibe -- III. Patterns in biological objects. Stoichiometric network analysis of nonlinear phenomena in rection mechanism for TWC converters / M. Marek ... [et al.]. Collective movement and morphogenesis of epithelial cells / H. Haga and K. Kawabata. Indecisive behavior of amoeba crossing an environmental barrier / S. Takagi ... [et al.]. Effects of amount of food on path selection in the transport network of an amoeboid organism / T. Nakagaki ... [et al.]. Light scattering study in double network gels / M. Fukunaya ... [et al.].Blood flow velocity in the choroid in punctate inner choroidopathy and Vogt-Koyanagi-Harada disease; amd multifractal analysis of choroidal blood flow in age-related macular degeneration / K. Yoshida ... [et al.]. Topological analysis of placental arteries: correlation with neonatal growth / H. Yamada and K. Yakubo -- IV. Criticality in pure and applied physics. Droplets in Disordered Metallic Quantum Critical Systems / A. H. Castro Neto and B. A. Jones. Importance of static disorder and inhomogeneous cooperative dynamics in heavy-fermion metals / O. O. Bernal. Competition between spin glass and Antiferromagnetic phases in heavy fermion materials / S. Sullow. Emergent Phases via Fermi surface
Slepian-Wolf Coding Over Cooperative Relay Networks
Yassaee, Mohammad Hossein
2009-01-01
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A \\emph{Joint source-Wyner-Ziv encoding/sliding window decoding} scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints are derived. Then, utilizing sub-modular property of entropy function and a novel geometrical approach, the results of different ordered partitions are consolidated, which lead sufficient conditions for our problem. The proposed scheme achieves operational separation between source coding and channel coding. It is shown that sufficient conditions are indeed necessary conditions in two special cooperative networks, namely, Aref network and finite-field deterministic network. Also, in Gaussian cooperative networks, it is shown that reliable transmission of all DMCS whose Slep...
Critical cooperation range to improve spatial network robustness.
Directory of Open Access Journals (Sweden)
Vitor H P Louzada
Full Text Available A robust worldwide air-transportation network (WAN is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed.
Strategical incoherence regulates cooperation in social dilemmas on multiplex networks
Matamalas, Joan T; Gómez, Sergio; Arenas, Alex
2015-01-01
Cooperation is a very common, yet not fully-understood phenomenon in natural and human systems. The introduction of a network within the population is known to affect the outcome of cooperative dynamics, allowing for the survival of cooperation in adverse scenarios. Recently, the introduction of multiplex networks has yet again modified the expectations for the outcome of the Prisoner's Dilemma game, compared to the monoplex case. However, much remains unstudied regarding other social dilemmas on multiplex, as well as the unexplored microscopic underpinnings of it. In this paper, we systematically study the evolution of cooperation in all four games in the $T-S$ plane on multiplex. More importantly, we find some remarkable and previously unknown features in the microscopic organization of the strategies, that are responsible for the important differences between cooperative dynamics in monoplex and multiplex. Specifically, we find that in the stationary state, there are individuals that play the same strategy...
Stability of Boolean networks: The joint effects of topology and update rules
Squires, Shane; Girvan, Michelle; Ott, Edward
2013-01-01
We study the stability of orbits in large Boolean networks with given complex topology. We impose no restrictions on the form of the update rules, which may be correlated with local topological properties of the network. While recent past work has addressed the separate effects of nontrivial network topology and certain special classes of update rules on stability, only crude results exist about how these effects interact. We present a widely applicable solution to this problem. Numerical experiments confirm our theory and show that local correlations between topology and update rules can have profound effects on the qualitative behavior of these systems.
Chimeras in a network of three oscillator populations with varying network topology
DEFF Research Database (Denmark)
Martens, Erik Andreas
2010-01-01
this system as a model system, we discuss for the first time the influence of network topology on the existence of so-called chimera states. In this context, the network with three populations represents an interesting case because the populations may either be connected as a triangle, or as a chain, thereby......-like. By showing that chimera states only exist for a bounded set of parameter values, we demonstrate that their existence depends strongly on the underlying network structures, and conclude that chimeras exist on networks with a chain-like character....
Effects of network resolution on topological properties of human neocortex
DEFF Research Database (Denmark)
Romero-Garcia, Rafael; Atienza, Mercedes; Clemmensen, Line Katrine Harder
2012-01-01
Graph theoretical analyses applied to neuroimaging datasets have provided valuable insights into the large-scale anatomical organization of the human neocortex. Most of these studies were performed with different cortical scales leading to cortical networks with different levels of small-world or......Graph theoretical analyses applied to neuroimaging datasets have provided valuable insights into the large-scale anatomical organization of the human neocortex. Most of these studies were performed with different cortical scales leading to cortical networks with different levels of small......-world organization. The present study investigates how resolution of thickness-based cortical scales impacts on topological properties of human anatomical cortical networks. To this end, we designed a novel approach aimed at determining the best trade-off between small-world attributes of anatomical cortical...... networks and the number of cortical regions included in the scale. Results revealed that schemes comprising 540–599 regions (surface areas spanning between 250 and 275mm2) at sparsities below 10% showed a superior balance between small-world organization and the size of the cortical scale employed...
Increasing the cost-constrained availability of WDM Networks with Degree-3 Structured Topologies
DEFF Research Database (Denmark)
Gutierrez Lopez, Jose Manuel; Georgakilas, Kostas; Katrinis, Kostas;
2010-01-01
This paper studies the impact of node degree distribution to availability and capital and deployment expenditure of optical WDM transport networks. Three structured degree-3 graphs with fair node degree distribution are proposed in this context. Using a realistic network optimization framework...... based on genetic algorithms, we evaluate the performance of structured topologies and compare it against a practical topology (NSFNET). The results manifest that nodal degree fairness leads to increased availability compared to conventional topologies, while not incurring higher capital and deployment...
Topology Management Algorithms for Large Scale Aerial High Capacity Directional Networks
2016-11-01
Introduction of classes of topology management algo- rithms and example implementations of each • Performance evaluation of the algorithms in 2 example relevant...Topology Management Algorithms for Large-Scale Aerial High Capacity Directional Networks Joy Wang, Thomas Shake, Patricia Deutsch, Andrea Coyle, Bow...airborne backbone network is large- scale topology management of directional links in a dynamic environment. In this paper, we present several
Borel Cayley Graph-Based Topology Control for Consensus Protocol in Wireless Sensor Networks
Junghun Ryu; Jaewook Yu; Eric Noel; K. Wendy Tang
2013-01-01
Borel Cayley graphs have been shown to be an efficient candidate topology in interconnection networks due to their small diameter, short path length, and low degree. In this paper, we propose topology control algorithms based on Borel Cayley graphs. In particular, we propose two methods to assign node IDs of Borel Cayley graphs as logical topologies in wireless sensor networks. The first one aims at minimizing communication distance between nodes, while the entire graph is imposed as a logica...
Reputation drives cooperative behaviour and network formation in human groups.
Cuesta, Jose A; Gracia-Lázaro, Carlos; Ferrer, Alfredo; Moreno, Yamir; Sánchez, Angel
2015-01-19
Cooperativeness is a defining feature of human nature. Theoreticians have suggested several mechanisms to explain this ubiquitous phenomenon, including reciprocity, reputation, and punishment, but the problem is still unsolved. Here we show, through experiments conducted with groups of people playing an iterated Prisoner's Dilemma on a dynamic network, that it is reputation what really fosters cooperation. While this mechanism has already been observed in unstructured populations, we find that it acts equally when interactions are given by a network that players can reconfigure dynamically. Furthermore, our observations reveal that memory also drives the network formation process, and cooperators assort more, with longer link lifetimes, the longer the past actions record. Our analysis demonstrates, for the first time, that reputation can be very well quantified as a weighted mean of the fractions of past cooperative acts and the last action performed. This finding has potential applications in collaborative systems and e-commerce.
A Distributed MAC Protocol for Cooperation in Random Access Networks
Böcherer, Georg
2008-01-01
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel. Random access requires minimal coordination between the nodes, which considerably reduces the cost of the infrastructure. Recently, cooperative communication in wireless networks has been of increasing interest because it promises higher rates and reliability. An additional MAC overhead is necessary to coordinate the nodes to allow cooperation and this overhead can possibly cancel out the cooperative benefits. In this work, a completely distributed protocol is proposed that allows nodes in the network to cooperate via Two-Hop and Decode-and-Forward for transmitting their data to a common gateway node. It is shown that high throughput gains are obtained in terms of the individual throughput that can be guaranteed to any node in the network. These results are validated by Monte Ca...
Evolution of Cooperation in Social Dilemmas on Complex Networks.
Iyer, Swami; Killingback, Timothy
2016-02-01
Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner's dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games.
Evolution of Cooperation in Social Dilemmas on Complex Networks.
Directory of Open Access Journals (Sweden)
Swami Iyer
2016-02-01
Full Text Available Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner's dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games.
The Evolution of Reputation-Based Cooperation in Regular Networks
Directory of Open Access Journals (Sweden)
Tatsuya Sasaki
2017-01-01
Full Text Available Despite recent advances in reputation technologies, it is not clear how reputation systems can affect human cooperation in social networks. Although it is known that two of the major mechanisms in the evolution of cooperation are spatial selection and reputation-based reciprocity, theoretical study of the interplay between both mechanisms remains almost uncharted. Here, we present a new individual-based model for the evolution of reciprocal cooperation between reputation and networks. We comparatively analyze four of the leading moral assessment rules—shunning, image scoring, stern judging, and simple standing—and base the model on the giving game in regular networks for Cooperators, Defectors, and Discriminators. Discriminators rely on a proper moral assessment rule. By using individual-based models, we show that the four assessment rules are differently characterized in terms of how cooperation evolves, depending on the benefit-to-cost ratio, the network-node degree, and the observation and error conditions. Our findings show that the most tolerant rule—simple standing—is the most robust among the four assessment rules in promoting cooperation in regular networks.
Dynamics in small worlds of tree topologies of wireless sensor networks
DEFF Research Database (Denmark)
Li, Qiao; Zhang, Baihai; Fan, Zhun
2012-01-01
Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tree-based networks. Due to link additions, characteristic path lengths reduce...
The Local Area Network and the Cooperative Learning Principle.
Sloan, Fred A.; Koohang, Alex A.
1991-01-01
Discussion of the advantages of local area networks (LANs) focuses on their use for successful cooperative learning. Individual and group assessment of success are discussed, effects on academic and affective achievement are considered, and computer-assisted instruction (CAI) programs to use with networking are suggested. (19 references) (LRW)
Cooperation in district heating networks in the Netherlands
Ligtvoet, A.
2012-01-01
Although constructing a district heating network could be portrayed as a simple cost/benefit calculation, we suggest that other factors play an important role that cannot be ignored. In this contribution, we suggest that theories concerning cooperation (in industrial networks) roughly apply to micro
Cooperation in district heating networks in the Netherlands
Ligtvoet, A.
2012-01-01
Although constructing a district heating network could be portrayed as a simple cost/benefit calculation, we suggest that other factors play an important role that cannot be ignored. In this contribution, we suggest that theories concerning cooperation (in industrial networks) roughly apply to micro
Discriminating Topology in Galaxy Distributions using Network Analysis
Hong, Sungryong; Dey, Arjun; Barabási, Albert -L; Vogelsberger, Mark; Hernquist, Lars; Gebhardt, Karl
2016-01-01
(abridged) The large-scale distribution of galaxies is generally analyzed using the two-point correlation function. However, this statistic does not capture the topology of the distribution, and it is necessary to resort to higher order correlations to break degeneracies. We demonstrate that an alternate approach using network analysis can discriminate between topologically different distributions that have similar two-point correlations. We investigate two galaxy point distributions, one produced by a cosmological simulation and the other by a L\\'evy walk. For the cosmological simulation, we adopt the redshift $z = 0.58$ slice from Illustris (Vogelsberger et al. 2014A) and select galaxies with stellar masses greater than $10^8$$M_\\odot$. The two point correlation function of these simulated galaxies follows a single power-law, $\\xi(r) \\sim r^{-1.5}$. Then, we generate L\\'evy walks matching the correlation function and abundance with the simulated galaxies. We find that, while the two simulated galaxy point d...
Algorithmic aspects of topology control problems for ad hoc networks
Energy Technology Data Exchange (ETDEWEB)
Liu, R. (Rui); Lloyd, E. L. (Errol L.); Marathe, M. V. (Madhav V.); Ramanathan, R. (Ram); Ravi, S. S.
2002-01-01
Topology control problems are concerned with the assignment of power values to nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying some specified properties. This paper considers such problems under several optimization objectives, including minimizing the maximum power and minimizing the total power. A general approach leading to a polynomial algorithm is presented for minimizing maximum power for a class of graph properties, called monotone properties. The difficulty of generalizing the approach to properties that are not monoione is pointed out. Problems involving the minimization of total power are known to be NP-complete even for simple graph properties. A general approach that leads to an approximation algorithm for minimizing the total power for some monotone properties is presented. Using this approach, a new approximation algorithm for the problem of minimizing the total power for obtaining a 2-node-connected graph is obtained. It is shown that this algorithm provides a constant performance guarantee. Experimental results from an implementation of the approximation algorithm are also presented.
MST-BASED CLUSTERING TOPOLOGY CONTROL ALGORITHM FOR WIRELESS SENSOR NETWORKS
Institute of Scientific and Technical Information of China (English)
Cai Wenyu; Zhang Meiyan
2010-01-01
In this paper,we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs),which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hierarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover,CHs exchange information between CH and CH and afterwards transmits aggregated information to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius,similarly,the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station,therefore,MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result,the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST,DRNG and MEMD at the aspects of average node's degree,average node's power radius and network lifetime,respectively.
Manetti, Marco
2015-01-01
This is an introductory textbook on general and algebraic topology, aimed at anyone with a basic knowledge of calculus and linear algebra. It provides full proofs and includes many examples and exercises. The covered topics include: set theory and cardinal arithmetic; axiom of choice and Zorn's lemma; topological spaces and continuous functions; connectedness and compactness; Alexandrov compactification; quotient topologies; countability and separation axioms; prebasis and Alexander's theorem; the Tychonoff theorem and paracompactness; complete metric spaces and function spaces; Baire spaces; homotopy of maps; the fundamental group; the van Kampen theorem; covering spaces; Brouwer and Borsuk's theorems; free groups and free product of groups; and basic category theory. While it is very concrete at the beginning, abstract concepts are gradually introduced. It is suitable for anyone needing a basic, comprehensive introduction to general and algebraic topology and its applications.
Analysis of Trends in Cooperative Network Patterns for KAERI Researchers
Energy Technology Data Exchange (ETDEWEB)
Chun, Young Choon; Lee, Hyun Soo [KAERI, Daejeon (Korea, Republic of)
2016-05-15
There has been a trend toward faster results of research and accelerating inter-disciplinary convergence, under constraints in available resources. Under such reality, national and international cooperation with inter-sectoral research on science-technology-industry is becoming inevitable as a strategic approach for enhancing competitive edge on global dimension. This study gives an analysis on the cooperative network in nuclear research which bears multi-disciplinary technical feature. The study aims to visualize the cooperative network of KAERI(Korea Atomic Energy Research Institute) researchers, as the hub of the network, including academics and industry, with a view to provide insight on strengthening the cooperative network in nuclear research. This study accounted for the paper entries in SCI(E) in 2013 (538 papers) and 2015 (551 papers) with a view to identify cooperative research activities centered for KAERI. On international cooperation, the analysis showed a trend toward, first of all, diversification of partner countries. There were 118 entries of co-authorship with 22 countries in 2013 (41 with USA, 12 with Japan, 9 with India), which evolved to 121 entries in 2015 (34 for USA, 11 with China, 10 each with Japan and India). Secondly, there was a trend toward more number of countries evenly spread in 2015 compared to 2013, except a few major countries like USA, Japan, and India.
Topology of growing networks accelerated by intermediary process
Ikeda, Nobutoshi
2017-10-01
We examined the effect of accelerated growth (increase in the mean vertex degree) caused by internal links between pre-existing nodes on the topology of growing networks and showed that a kind of local rule, edge additions stimulated by randomly chosen intermediaries (intermediary process), not only guarantees a highly clustered structure but also induces the scale-free property on growing networks without an explicit preferential rule with the aid of accelerating growth. We relate the power-law exponent γ describing the degree distribution to the rate of acceleration and an internal factor which expresses the contribution of internal links to the rate of increase in degrees. The behavior of the internal factor generates different forms of time dependence of degrees according to whether γ > 2 or γ < 2. Accelerating growth plays a dominant role in the structural formation of networks based on local rules, in contrast to cases when non-local rules are applied, because similar studies showed that a simple preferential linking rule (a non-local rule) easily induces power laws without accelerating growth.
An Automated 3d Indoor Topological Navigation Network Modelling
Jamali, A.; Rahman, A. A.; Boguslawski, P.; Gold, C. M.
2015-10-01
Indoor navigation is important for various applications such as disaster management and safety analysis. In the last decade, indoor environment has been a focus of wide research; that includes developing techniques for acquiring indoor data (e.g. Terrestrial laser scanning), 3D indoor modelling and 3D indoor navigation models. In this paper, an automated 3D topological indoor network generated from inaccurate 3D building models is proposed. In a normal scenario, 3D indoor navigation network derivation needs accurate 3D models with no errors (e.g. gap, intersect) and two cells (e.g. rooms, corridors) should touch each other to build their connections. The presented 3D modeling of indoor navigation network is based on surveying control points and it is less dependent on the 3D geometrical building model. For reducing time and cost of indoor building data acquisition process, Trimble LaserAce 1000 as surveying instrument is used. The modelling results were validated against an accurate geometry of indoor building environment which was acquired using Trimble M3 total station.
Spatially self-organized resilient networks by a distributed cooperative mechanism
Hayashi, Yukio
2016-09-01
The robustness of connectivity and the efficiency of paths are incompatible in many real networks. We propose a self-organization mechanism for incrementally generating onion-like networks with positive degree-degree correlations whose robustness is nearly optimal. As a spatial extension of the generation model based on cooperative copying and adding shortcut, we show that the growing networks become more robust and efficient through enhancing the onion-like topological structure on a space. The reasonable constraint for locating nodes on the perimeter in typical surface growth as a self-propagation does not affect these properties of the tolerance and the path length. Moreover, the robustness can be recovered in the random growth damaged by insistent sequential attacks even without any remedial measures.
Decentralized Cooperative TOA/AOA Target Tracking for Hierarchical Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Chih-Yu Wen
2012-11-01
Full Text Available This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processingis conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for thelocalization task. The proposed energy-efficient tracking algorithm allows each sub-clustermember to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for objectposition estimation.
Spatially self-organized resilient networks by a distributed cooperative mechanism
Hayashi, Yukio
2016-01-01
The robustness of connectivity and the efficiency of paths are incompatible in many real networks. We propose a self-organization mechanism for incrementally generating onion-like networks with positive degree-degree correlations whose robustness is nearly optimal. As a spatial extension of the generation model based on cooperative copying and adding shortcut, we show that the growing networks become more robust and efficient through enhancing the onion-like topological structure on a space. The reasonable constraint for locating nodes on the perimeter in typical surface growth as a self-propagation does not affect these properties of the tolerance and the path length. Moreover, the robustness can be recovered in the random growth damaged by insistent sequential attacks even without any remedial measures.
Decentralized cooperative TOA/AOA target tracking for hierarchical wireless sensor networks.
Chen, Ying-Chih; Wen, Chih-Yu
2012-11-08
This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processing is conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for the localization task. The proposed energy-efficient tracking algorithm allows each sub-cluster member to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for object position estimation.
Energy Aware Computing in Cooperative Wireless Networks
DEFF Research Database (Denmark)
Olsen, Anders Brødløs; Fitzek, Frank H. P.; Koch, Peter
2005-01-01
In this work the idea of cooperation is applied to wireless communication systems. It is generally accepted that energy consumption is a significant design constraint for mobile handheld systems. We propose a novel method of cooperative task computing by distributing tasks among terminals over...... the unreliable wireless link. Principles of multi–processor energy aware task scheduling are used exploiting performance scalable technologies such as Dynamic Voltage Scaling (DVS). We introduce a novel mechanism referred to as D2VS and here it is shown by means of simulation that savings of 40% can be achieved....
Song, Jingjing; Yang, Chuanchuan; Zhang, Qingxiang; Ma, Zhuang; Huang, Xingang; Geng, Dan; Wang, Ziyu
2015-09-01
Higher capacity and larger scales have always been the top targets for the evolution of optical access networks, driven by the ever-increasing demand from the end users. One thing that started to attract wide attention not long ago, but with at least equal importance as capacity and scale, is energy efficiency, a metric essential nowadays as human beings are confronted with severe environmental issues like global warming, air pollution, and so on. Here, different from the conventional energy consumption analysis of tree-topology networks, we propose an effective energy consumption calculation method to compare the energy efficiency of the tree-topology 10 gigabit ethernet passive optical network (10G-EPON) and ring-topology time- and wavelength-division-multiplexed passive optical network (TWDM-PON), two experimental networks deployed in China. Numerical results show that the ring-topology TWDM-PON networks with 2, 4, 8, and 16 wavelengths are more energy efficient than the tree-topology 10G-EPON, although 10G-EPON consumes less energy. Also, TWDM-PON with four wavelengths is the most energy-efficient network candidate and saves 58.7% more energy than 10G-EPON when fully loaded.
The dynamic consequences of cooperation and competition in small-world networks.
Fernández-Rosales, Iván Y; Liebovitch, Larry S; Guzmán-Vargas, Lev
2015-01-01
We present a study of the social dynamics among cooperative and competitive actors interacting on a complex network that has a small-world topology. In this model, the state of each actor depends on its previous state in time, its inertia to change, and the influence of its neighboring actors. Using numerical simulations, we determine how the distribution of final states of the actors and measures of the distances between the values of the actors at local and global levels, depend on the number of cooperative to competitive actors and the connectivity of the actors in the network. We find that similar numbers of cooperative and competitive actors yield the lowest values for the local and global measures of the distances between the values of the actors. On the other hand, when the number of either cooperative or competitive actors dominate the system, then the divergence is largest between the values of the actors. Our findings make new testable predictions on how the dynamics of a conflict depends on the strategies chosen by groups of actors and also have implications for the evolution of behaviors.
The dynamic consequences of cooperation and competition in small-world networks.
Directory of Open Access Journals (Sweden)
Iván Y Fernández-Rosales
Full Text Available We present a study of the social dynamics among cooperative and competitive actors interacting on a complex network that has a small-world topology. In this model, the state of each actor depends on its previous state in time, its inertia to change, and the influence of its neighboring actors. Using numerical simulations, we determine how the distribution of final states of the actors and measures of the distances between the values of the actors at local and global levels, depend on the number of cooperative to competitive actors and the connectivity of the actors in the network. We find that similar numbers of cooperative and competitive actors yield the lowest values for the local and global measures of the distances between the values of the actors. On the other hand, when the number of either cooperative or competitive actors dominate the system, then the divergence is largest between the values of the actors. Our findings make new testable predictions on how the dynamics of a conflict depends on the strategies chosen by groups of actors and also have implications for the evolution of behaviors.
Cooperative Radio Resource Management for Heterogeneous Networks
DEFF Research Database (Denmark)
Mihovska, Albena D.; Tragos, Elias; Luo, Jijun
2009-01-01
of the same radio system [1] to cooperation and coexistence at higher layers. One of the main challenges is to consider how and which information to extract from a multitude of parameters, some not directly mapped to each other and belonging to different domains. Another aspect is to ensure...
Coordination and Cooperation Problems in Network Good Production
Directory of Open Access Journals (Sweden)
Vincent Buskens
2010-09-01
Full Text Available If actors want to reach a particular goal, they are often better off forming collaborative relations and investing together rather than investing separately. We study the coordination and cooperation problems that might hinder successful collaboration in a dynamic network setting. We develop an experiment in which coordination problems are mainly due to finding partners for collaboration, while cooperation problems arise at the investment levels of partners who have already agreed to collaborate. The results show that as costs of forming links increase, groups succeed less often in solving the coordination problem. Still, if subjects are able to solve the coordination problem, they invest in a suboptimal way in the network good. It is mostly found that if cooperation is successful in terms of investment, it is due to subjects being able to monitor how much their partners invest. Moreover, subjects deal better with the coordination and cooperation problems as they gain experience.
Cooperative Detection for Primary User in Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
Zhu Jia
2009-01-01
Full Text Available We propose two novel cooperative detection schemes based on the AF (Amplify and Forward and DF (Decode and Forward protocols to achieve spatial diversity gains for cognitive radio networks, which are referred to as the AF-CDS, (AF-based Cooperative Detection Scheme and DF-CDS (DF-based Cooperative Detection Scheme, respectively. Closed-form expressions of detection probabilities for the noncooperation scheme, AND-CDS (AND-based Cooperative Detection Scheme, AF-CDS and DF-CDS, are derived over Rayleigh fading channels. Also, we analyze the overall agility for the proposed cooperative detection schemes and show that our schemes can further reduce the detection time. In addition, we compare the DF-CDS with the AF-CDS in terms of detection probability and agility gain, depicting the advantage of DF-CDS at low SNR region and high false alarm probability region.
Establishment of a Nuclear Cooperation Network between Korea and Brazil
Energy Technology Data Exchange (ETDEWEB)
Kim, Kyoung Pyo; Sohn, Dong Seong; Song, Kee Chan (and others)
2008-03-15
The objective of this study is to establish a personnel network and to identify potential complementary areas for technical cooperation in the future to advance Korean-Brazilian nuclear cooperation activities. To this end, current status of the cooperation in the areas of economy, energy resources and S and T between the two countries was surveyed, and the history of the nuclear development program and the current nuclear R and D status in Brazil, as well as the bilateral nuclear cooperation activities of both countries were analyzed. In addition, areas of mutual interest were identified by both countries' focal points and a personnel network was established. Based on the aforementioned preliminary activities, bilateral joint seminars were held in Brazil. At the joint seminars, possible areas of cooperation were discussed and joint research collaboration areas were surveyed and identified while both sides made efforts to expand the information and experts exchanges in specific areas. Through this study, possible specific areas of cooperation in which both sides have a common interest were identified in such areas as radiation technology application, post irradiation examination, radioactive waste management, I and C, and advanced nuclear fuel, and also concrete implementation methods were proposed. These results will be effectively utilized in establishing a basic direction for expanding bilateral nuclear cooperation activities in the future. Consistent establishment of a foundation for promoting cooperation could be established and maintained through the operation of a focal point in charge of coordinating bilateral technical cooperation, and then a long-term and stable human network could be established.
An Improved Topology-Potential-Based Community Detection Algorithm for Complex Network
Directory of Open Access Journals (Sweden)
Zhixiao Wang
2014-01-01
Full Text Available Topology potential theory is a new community detection theory on complex network, which divides a network into communities by spreading outward from each local maximum potential node. At present, almost all topology-potential-based community detection methods ignore node difference and assume that all nodes have the same mass. This hypothesis leads to inaccuracy of topology potential calculation and then decreases the precision of community detection. Inspired by the idea of PageRank algorithm, this paper puts forward a novel mass calculation method for complex network nodes. A node’s mass obtained by our method can effectively reflect its importance and influence in complex network. The more important the node is, the bigger its mass is. Simulation experiment results showed that, after taking node mass into consideration, the topology potential of node is more accurate, the distribution of topology potential is more reasonable, and the results of community detection are more precise.
Designing Logical Topology for Wireless Sensor Networks: A Multi-Chain Oriented Approach
Directory of Open Access Journals (Sweden)
Quazi Mamun
2013-02-01
Full Text Available An optimal logical topology of a wireless sensor ne twork (WSN facilitates the deployed sensor nodes t o communicate with each other with little overheads, lowers energy consumption, lengthens lifetime of th e network, provides scalability, increases reliabilit y, and reduces latency. Designing an optimal logica l topology for a WSN thus needs to consider numerous factors. Chain oriented topologies have been found to offer a number of improvements in energy consump tions, lifetime, and load balancing than other topologies of WSNs. However, they usually suffer fr om latency, scalability, reliability and interferen ce problems. In this paper, we present a chain oriente d logical topology, which offers solutions to those problems. The proposed topology is designed such th at it retains the advantages of the chain oriented topologies, and at the same time, overcomes the pro blems of the chain oriented topology such as latenc y, scalability, and data reliability. The proposed top ology provides a communication abstraction, which c an be easily used to devise a range of application pro tocols. Moreover, the logical topology offers node management, resource management, and other services . The performance of the proposed topology is compared with other topologies in respect to total energy consumption and lifetime of the network.
Research on social communication network evolution based on topology potential distribution
Zhao, Dongjie; Jiang, Jian; Li, Deyi; Zhang, Haisu; Chen, Guisheng
2011-12-01
Aiming at the problem of social communication network evolution, first, topology potential is introduced to measure the local influence among nodes in networks. Second, from the perspective of topology potential distribution the method of network evolution description based on topology potential distribution is presented, which takes the artificial intelligence with uncertainty as basic theory and local influence among nodes as essentiality. Then, a social communication network is constructed by enron email dataset, the method presented is used to analyze the characteristic of the social communication network evolution and some useful conclusions are got, implying that the method is effective, which shows that topology potential distribution can effectively describe the characteristic of sociology and detect the local changes in social communication network.
He, Hui; Fan, Guotao; Ye, Jianwei; Zhang, Weizhe
2013-01-01
It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system's emergency response capabilities, alleviate the cyber attacks' damage, and strengthen the system's counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system's plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks' topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.
Lai, Pik-Yin
2017-02-01
Reconstructing network connection topology and interaction strengths solely from measurement of the dynamics of the nodes is a challenging inverse problem of broad applicability in various areas of science and engineering. For a discrete-time step network under noises whose noise-free dynamics is stationary, we derive general analytic results relating the weighted connection matrix of the network to the correlation functions obtained from time-series measurements of the nodes for networks with one-dimensional intrinsic node dynamics. Information about the intrinsic node dynamics and the noise strengths acting on the nodes can also be obtained. Based on these results, we develop a scheme that can reconstruct the above information of the network using only the time-series measurements of node dynamics as input. Reconstruction formulas for higher-dimensional node dynamics are also derived and illustrated with a two-dimensional node dynamics network system. Furthermore, we extend our results and obtain a reconstruction scheme even for the cases when the noise-free dynamics is periodic. We demonstrate that our method can give accurate reconstruction results for weighted directed networks with linear or nonlinear node dynamics of various connection topologies, and with linear or nonlinear couplings.
Laurito, Andres; The ATLAS collaboration
2017-01-01
Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...
Strategical incoherence regulates cooperation in social dilemmas on multiplex networks.
Matamalas, Joan T; Poncela-Casasnovas, Julia; Gómez, Sergio; Arenas, Alex
2015-01-01
Cooperation is a very common, yet not fully-understood phenomenon in natural and human systems. The introduction of a network within the population is known to affect the outcome of cooperative dynamics, allowing for the survival of cooperation in adverse scenarios. Recently, the introduction of multiplex networks has yet again modified the expectations for the outcome of the Prisoner's Dilemma game, compared to the monoplex case. However, much remains unstudied regarding other social dilemmas on multiplex, as well as the unexplored microscopic underpinnings of it. In this paper, we systematically study the evolution of cooperation in all four games in the T-S plane on multiplex. More importantly, we find some remarkable and previously unknown features in the microscopic organization of the strategies, that are responsible for the important differences between cooperative dynamics in monoplex and multiplex. Specifically, we find that in the stationary state, there are individuals that play the same strategy in all layers (coherent), and others that don't (incoherent). This second group of players is responsible for the surprising fact of a non full-cooperation in the Harmony Game on multiplex, never observed before, as well as a higher-than-expected cooperation rates in some regions of the other three social dilemmas.
Strategical incoherence regulates cooperation in social dilemmas on multiplex networks
Matamalas, Joan T.; Poncela-Casasnovas, Julia; Gómez, Sergio; Arenas, Alex
2015-04-01
Cooperation is a very common, yet not fully-understood phenomenon in natural and human systems. The introduction of a network within the population is known to affect the outcome of cooperative dynamics, allowing for the survival of cooperation in adverse scenarios. Recently, the introduction of multiplex networks has yet again modified the expectations for the outcome of the Prisoner's Dilemma game, compared to the monoplex case. However, much remains unstudied regarding other social dilemmas on multiplex, as well as the unexplored microscopic underpinnings of it. In this paper, we systematically study the evolution of cooperation in all four games in the T - S plane on multiplex. More importantly, we find some remarkable and previously unknown features in the microscopic organization of the strategies, that are responsible for the important differences between cooperative dynamics in monoplex and multiplex. Specifically, we find that in the stationary state, there are individuals that play the same strategy in all layers (coherent), and others that don't (incoherent). This second group of players is responsible for the surprising fact of a non full-cooperation in the Harmony Game on multiplex, never observed before, as well as a higher-than-expected cooperation rates in some regions of the other three social dilemmas.
A commercial application of survivable network design: ITP/INPLANS CCS Network Topology Analyzer
Energy Technology Data Exchange (ETDEWEB)
Mihail, M.; Shallcross, D.; Dean, N.; Mostrel, M.
1996-12-31
The ITP/INPLANS CCS Network Topology Analyzer is a Bellcore product which performs automated design of cost effective survivable CCS (Common Channel Signaling) networks, with survivability meaning that certain path-connectivity is preserved under limited failures of network elements. The algorithmic core of this product consists of suitable extensions of primal-dual approximation schemes for Steiner network problems. Even though most of the survivability problems arising in CCS networks are not strictly of the form for which the approximation algorithms with proven performance guarantees apply, we implemented modifications of these algorithms with success: In addition to duality-based performance guarantees that indicate, mathematically, discrepancy of no more than 20% from optimality for generic Steiner problems and no more than 40% for survivable CCS networks, our software passed all commercial benchmark tests, and our code was deployed with the August 94 release of the product. CCS networks fall in the general category of low bit-rate backbone networks. The main characteristic of survivability problems for these networks is that each edge, once present, can be assumed to carry arbitrarily many paths. For high bit-rate backbone networks, such as the widely used ATM and SONET, this is no longer the case. We discuss versions of network survivability with capacitated edges that appear to model survivability considerations in such networks.
Protocol design and analysis for cooperative wireless networks
Song, Wei; Jin, A-Long
2017-01-01
This book focuses on the design and analysis of protocols for cooperative wireless networks, especially at the medium access control (MAC) layer and for crosslayer design between the MAC layer and the physical layer. It highlights two main points that are often neglected in other books: energy-efficiency and spatial random distribution of wireless devices. Effective methods in stochastic geometry for the design and analysis of wireless networks are also explored. After providing a comprehensive review of existing studies in the literature, the authors point out the challenges that are worth further investigation. Then, they introduce several novel solutions for cooperative wireless network protocols that reduce energy consumption and address spatial random distribution of wireless nodes. For each solution, the book offers a clear system model and problem formulation, details of the proposed cooperative schemes, comprehensive performance analysis, and extensive numerical and simulation results that validate th...
POWER CONTROL BASED COOPERATIVE OPPORTUNISTIC ROUTING IN WIRELESS SENSOR NETWORKS
Institute of Scientific and Technical Information of China (English)
Hu Haifeng; Zhu Qi
2009-01-01
This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the cooperation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.
New cooperative projection neural network for nonlinearly constrained variational inequality
Institute of Scientific and Technical Information of China (English)
XIA YouSheng
2009-01-01
This paper proposes a new cooperative projection neural network (CPNN), which combines automat-ically three individual neural network models with a common projection term. As a special case, the proposed CPNN can include three recent recurrent neural networks for solving monotone variational in-equality problems with limit or linear constraints, respectively. Under the monotonicity condition of the corresponding Lagrangian mapping, the proposed CPNN is theoretically guaranteed to solve monotone variational inequality problems and a class of nonmonotone variational inequality problems with linear and nonlinear constraints. Unlike the extended projection neural network, the proposed CPNN has no limitation on the initial point for global convergence. Compared with other related cooperative neural networks and numerical optimization algorithms, the proposed CPNN has a low computational complex-ity and requires weak convergence conditions. An application in real-time grasping force optimization and examples demonstrate good performance of the proposed CPNN.
Nobelist TD LEE Scientist Cooperation Network and Scientist Innovation Ability Model
Directory of Open Access Journals (Sweden)
Jin-Qing Fang
2013-01-01
Full Text Available Nobelist TD Lee scientist cooperation network (TDLSCN and their innovation ability are studied. It is found that the TDLSCN not only has the common topological properties both of scale-free and small-world for a general scientist cooperation networks, but also appears the creation multiple-peak phenomenon for number of published paper with year evolution, which become Nobelist TD Lee’s significant mark distinguished from other scientists. This new phenomenon has not been revealed in the scientist cooperation networks before. To demonstrate and explain this new finding, we propose a theoretical model for a nature scientist and his/her team innovation ability. The theoretical results are consistent with the empirical studies very well. This research demonstrates that the model has a certain universality and can be extended to estimate innovation ability for any nature scientist and his/her team. It is a better method for evaluating scientist innovation ability and his/her team for the academic profession and is of application potential.
Asymptotic Capacity of Wireless Ad Hoc Networks with Realistic Links under a Honey Comb Topology
Asnani, Himanshu
2007-01-01
We consider the effects of Rayleigh fading and lognormal shadowing in the physical interference model for all the successful transmissions of traffic across the network. New bounds are derived for the capacity of a given random ad hoc wireless network that reflect packet drop or capture probability of the transmission links. These bounds are based on a simplified network topology termed as honey-comb topology under a given routing and scheduling scheme.
Research of network topological control algorithm in mWSN
Directory of Open Access Journals (Sweden)
Xinlian Zhou
2011-10-01
Full Text Available Relying on this paper presented clustering mobile wireless sensor model, we use the topological control of the combination of the clustering hierarchical structure and sleep scheduling mechanism. Firstly, present a inner-cluster node scheduling algorithm solution of inner-cluster connectivity coverage problem, which can meet user’s expected coverage scale and high-efficiency, avoiding the influence of mobile node location. This algorithm based on coverage analysis theory, deducts smallest mobile nodes number of user’s expected coverage scale , realizes inner-cluster nodes optimal scheduling, which only select k nodes with higher energy and nearer close to fixed node, others should be sleeping. Consequently realizes the schedule of higher energy nodes round sleeping, and better adapt to the mobility of inner-cluster nodes. Then, the whole network use TDMA to uniformly divide the time slots to avoid the interrupt of inter-cluster and inner-cluster communication. The slot scheduling makes the half of cluster realize parallel work, and cross-layer design. Simulation result display by this schedule, EDG(Efficient Data Gathering decreases data delay, and largely relieves the burden of cluster-head, and has apparent energy-saving effect, and thinks about node’s mobility, can preferably suit to mobile wireless sensor network.
Analysis of Broadcast Authentication Mechanism in Selected Network Topologies
Directory of Open Access Journals (Sweden)
T. Vanek
2011-04-01
Full Text Available This paper deals with simulation of the broadcast authentication protocols using Colored Petri Nets and further optimizations in Matlab environment. Typical application of broadcast authentication protocols can be configurations where only one transmitter with multiple recipients exists (such as message exchange in sensor networks routing protocols, or the leader election process in sensors network. Authentication of every packet seems to be very effective way to mitigate an attack, however resulting in increase of end-to-end delay. To mitigate this drawback, the broadcast authentication protocols have been proposed. Concept of optimization of the broadcast authentication protocol DREAM parameters in a special case of fully N-ary tree and general random topology containing the same amount of nodes with regard to delay and energy consumption minimization is showed in the paper. Protocol DREAM was taken as an example of broadcast authenticating protocol to show how Color Petri Nets can be used to create a fully functional model of the protocol.
Enhancing Node Cooperation in Mobile Ad Hoc Network
Directory of Open Access Journals (Sweden)
S. Kami Makki
2013-03-01
Full Text Available Mobile Ad Hoc Networks (MANET have been a research interest over the past few years, yet, node cooperation has continually been a recognized issue for researchers. Because of their lack of infrastructure, MANETS depend on the cooperation of intermediate nodes in order to forward or send packets of their own to other nodes in the network. Therefore, nodes located in the central area of the network are used more frequently than the nodes located on the outer boundary. The inner nodes have to forward the packets of other nodes and if there is no payoff for forwarding the packets, the nodes may start to refrain from forwarding the packets of others to save their energy. The Community Enforcement Mechanism has been proposed to force the cooperation of among the nodes and reduce their misbehavior. Although, it provides cooperation among the nodes, it does not essentially increase the network life. In this paper, we present an efficient algorithm to improve the longevity of a MANET based upon more structured nodes cooperation.
Topological and functional properties of the small GTPases protein interaction network.
Directory of Open Access Journals (Sweden)
Anna Delprato
Full Text Available Small GTP binding proteins of the Ras superfamily (Ras, Rho, Rab, Arf, and Ran regulate key cellular processes such as signal transduction, cell proliferation, cell motility, and vesicle transport. A great deal of experimental evidence supports the existence of signaling cascades and feedback loops within and among the small GTPase subfamilies suggesting that these proteins function in a coordinated and cooperative manner. The interplay occurs largely through association with bi-partite regulatory and effector proteins but can also occur through the active form of the small GTPases themselves. In order to understand the connectivity of the small GTPases signaling routes, a systems-level approach that analyzes data describing direct and indirect interactions was used to construct the small GTPases protein interaction network. The data were curated from the Search Tool for the Retrieval of Interacting Genes (STRING database and include only experimentally validated interactions. The network method enables the conceptualization of the overall structure as well as the underlying organization of the protein-protein interactions. The interaction network described here is comprised of 778 nodes and 1943 edges and has a scale-free topology. Rac1, Cdc42, RhoA, and HRas are identified as the hubs. Ten sub-network motifs are also identified in this study with themes in apoptosis, cell growth/proliferation, vesicle traffic, cell adhesion/junction dynamics, the nicotinamide adenine dinucleotide phosphate (NADPH oxidase response, transcription regulation, receptor-mediated endocytosis, gene silencing, and growth factor signaling. Bottleneck proteins that bridge signaling paths and proteins that overlap in multiple small GTPase networks are described along with the functional annotation of all proteins in the network.
The topology of the directed clique complex as a network invariant.
Masulli, Paolo; Villa, Alessandro E P
2016-01-01
We introduce new algebro-topological invariants of directed networks, based on the topological construction of the directed clique complex. The shape of the underlying directed graph is encoded in a way that can be studied mathematically to obtain network invariants such as the Euler characteristic and the Betti numbers. Two different cases illustrate the application of the Euler characteristic. We investigate how the evolution of a Boolean recurrent artificial neural network is influenced by its topology in a dynamics involving pruning and strengthening of the connections, and to show that the topological features of the directed clique complex influence the dynamical evolution of the network. The second application considers the directed clique complex in a broader framework, to define an invariant of directed networks, the network degree invariant, which is constructed by computing the topological invariant on a sequence of sub-networks filtered by the minimum in- or out-degree of the nodes. The application of the Euler characteristic presented here can be extended to any directed network and provides a new method for the assessment of specific functional features associated with the network topology.
Directory of Open Access Journals (Sweden)
Hui He
2013-01-01
Full Text Available It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system’s emergency response capabilities, alleviate the cyber attacks’ damage, and strengthen the system’s counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system’s plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks’ topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.
A Topology Potential-Based Method for Identifying Essential Proteins from PPI Networks.
Li, Min; Lu, Yu; Wang, Jianxin; Wu, Fang-Xiang; Pan, Yi
2015-01-01
Essential proteins are indispensable for cellular life. It is of great significance to identify essential proteins that can help us understand the minimal requirements for cellular life and is also very important for drug design. However, identification of essential proteins based on experimental approaches are typically time-consuming and expensive. With the development of high-throughput technology in the post-genomic era, more and more protein-protein interaction data can be obtained, which make it possible to study essential proteins from the network level. There have been a series of computational approaches proposed for predicting essential proteins based on network topologies. Most of these topology based essential protein discovery methods were to use network centralities. In this paper, we investigate the essential proteins' topological characters from a completely new perspective. To our knowledge it is the first time that topology potential is used to identify essential proteins from a protein-protein interaction (PPI) network. The basic idea is that each protein in the network can be viewed as a material particle which creates a potential field around itself and the interaction of all proteins forms a topological field over the network. By defining and computing the value of each protein's topology potential, we can obtain a more precise ranking which reflects the importance of proteins from the PPI network. The experimental results show that topology potential-based methods TP and TP-NC outperform traditional topology measures: degree centrality (DC), betweenness centrality (BC), closeness centrality (CC), subgraph centrality (SC), eigenvector centrality (EC), information centrality (IC), and network centrality (NC) for predicting essential proteins. In addition, these centrality measures are improved on their performance for identifying essential proteins in biological network when controlled by topology potential.
Fanous, Anthony
2010-01-01
In this paper, we investigate the impact of network coding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts Network-level cooperation in contrast to the traditional physical layer cooperative protocols and in addition uses random linear network coding at the relay node. The traffic is assumed to be bursty and the relay node forwards its packets during the periods of source silence which allows better utilization for channel resources. Our results show that cooperation will lead to higher stable throughput rates than conventional retransmission policies and that the use of random linear network coding at the relay can further increase the stable throughput with increasing Network Coding field size or number of packets over which encoding is performed.
Donges, Jonathan F; Marwan, Norbert; Zou, Yong; Kurths, Juergen
2011-01-01
Network theory provides various tools for investigating the structural or functional topology of many complex systems found in nature, technology and society. Nevertheless, it has recently been realised that a considerable number of systems of interest should be treated, more appropriately, as interacting networks or networks of networks. Here we introduce a novel graph-theoretical framework for studying the interaction structure between subnetworks embedded within a complex network of networks. This framework allows us to quantify the structural role of single vertices or whole subnetworks with respect to the interaction of a pair of subnetworks on local, mesoscopic and global topological scales. Climate networks have recently been shown to be a powerful tool for the analysis of climatological data. Applying the general framework for studying interacting networks, we introduce coupled climate subnetworks to represent and investigate the topology of statistical relationships between the fields of distinct cli...
Mesoscopic structure conditions the emergence of cooperation on social networks.
Directory of Open Access Journals (Sweden)
Sergi Lozano
Full Text Available BACKGROUND: We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. METHODOLOGY/PRINCIPAL FINDINGS: We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. CONCLUSION: Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.
Mesoscopic structure conditions the emergence of cooperation on social networks
Energy Technology Data Exchange (ETDEWEB)
Lozano, S.; Arenas, A.; Sanchez, A.
2008-12-01
We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.
QoS Adaptive Topology Configuration in Synchronous Wireless Sensor Networks
Institute of Scientific and Technical Information of China (English)
杨挺; 武娇雯; 李昂; 张志东
2010-01-01
By using hyper-graph theory,this paper proposes a QoS adaptive topology configuration(QATC) algorithm to effectively control large-scale topology and achieve robust data transmitting in synchronous wireless sensor networks.Firstly,a concise hyper-graph model is abstracted to analyze the large-scale and high-connectivity network.Secondly,based on the control theory of biologic "Cell Mergence",a novel self-adaptive topology configuration algorithm is used to build homologous perceptive data logic sub-network ...
Directory of Open Access Journals (Sweden)
WenJun Zhang
2014-06-01
Full Text Available In present study we used self-organizing map (SOM neural network to conduct the non-supervisory clustering of invertebrate orders in rice field. Four topological functions, i.e., cossintopf, sincostopf, acossintopf, and expsintopf, established on the template in toolbox of Matlab, were used in SOM neural network learning. Results showed that clusters were different when using different topological functions because different topological functions will generate different spatial structure of neurons in neural network. We may chose these functions and results based on comparison with the practical situation.
Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter
2011-09-01
We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.
Institute of Scientific and Technical Information of China (English)
LI Junjie; ZHOU Bingkun; ZHANG Hanyi; LI Yanhe
2006-01-01
For the quality of service (QoS) and fairness considerations, the hop counts of various lightpaths in a wavelength division multiplexing (WDM) optical network should be short and compact. The development of multi-granularity optical switching technology has made it possible to construct various fiber topologies over a fixed physical topology. This paper describes a fiber topology design (FTD) problem, which minimizes the maximum number of required fibers in the physical links for a maximum lightpath hop count in the fiber topology. After the formular description for the FTD problem, a method was given to obtain the lower bound on the maximum number of required fibers. For large or moderate scale networks, three heuristic algorithms are given to efficiently solve the FTD problem. This study gives a new way to optimize the resource configuration performance in WDM optical networks at the topology level and proves its effectiveness via both analyses and numerical experiments.
Bus transport network model with ideal n-depth clique network topology
Yang, Xu-Hua; Chen, Guang; Sun, Bao; Chen, Sheng-Yong; Wang, Wan-Liang
2011-11-01
We propose an ideal n-depth clique network model. In this model, the original network is composed of cliques (maximal complete subgraphs) that overlap with each other. The network expands continuously by the addition of new cliques. The final diameter of the network can be set in advance, namely, it is controllable. Assuming that the diameter of the network is n, the network exhibits a logistic structure with (n+1) layers. In this structure, the 0th layer represents the original network and each node of the (m)th layer (1≤m≤n) corresponds to a clique in the (m-1)th layer. In the growth process of the network, we ensure that any (m)th layer network is composed of overlapping cliques. Any node in an (m)th layer network corresponds to an m-depth community in the original network, and the diameter of an m-depth community is m. Therefore, the (n-1)th layer network will contain only one clique, the (n)th layer network will contain only one node, and the diameter of the corresponding original network is n. Then an ideal n-depth clique network will be obtained. Based on the ideal n-depth clique network model, we construct a bus transport network model with an ideal n-depth clique network topology (ICNBTN). Moreover, our study compares this model with the real bus transport network (RealBTN) of three major cities in China and a recently introduced bus transport network model (BTN) whose network properties correspond well with those of real BTNs. The network properties of the ICNBTN are much closer to those of the RealBTN than those of the BTN are. At the same time, the ICNBTN has higher clustering extent of bus routes, smaller network diameter, which corresponds to shorter maximum transfer times in a bus network, and lower average shortest path time coefficient than the BTN and the RealBTN. Therefore, the ICNBTN can achieve higher transfer efficiency for a bus transport system.
Ten Years of Cooperation Between Mobile Robots and Sensor Networks
Directory of Open Access Journals (Sweden)
Jesus Capitán Fernández
2015-06-01
Full Text Available This paper presents an overview of the work carried out by the Group of Robotics, Vision and Control (GRVC at the University of Seville on the cooperation between mobile robots and sensor networks. The GRVC, led by Professor Anibal Ollero, has been working over the last ten years on techniques where robots and sensor networks exploit synergies and collaborate tightly, developing numerous research projects on the topic. In this paper, based on our research, we introduce what we consider some relevant challenges when combining sensor networks with mobile robots. Then, we describe our developed techniques and main results for these challenges. In particular, the paper focuses on autonomous self-deployment of sensor networks; cooperative localization and tracking; self-localization and mapping; and large-scale scenarios. Extensive experimental results and lessons learnt are also discussed in the paper.
Ten Years of Cooperation Between Mobile Robots and Sensor Networks
Directory of Open Access Journals (Sweden)
Jesus Capitán Fernández
2015-06-01
Full Text Available This paper presents an overview of the work carried out by the Group of Robotics, Vision and Control (GRVC at the University of Seville on the cooperation between mobile robots and sensor networks. The GRVC, led by Professor Anibal Ollero, has been working over the last ten years on techniques where robots and sensor networks exploit synergies and collaborate tightly, developing numerous research projects on the topic. In this paper, based on our research, we introduce what we consider some relevant challenges when combining sensor networks with mobile robots. Then, we describe our developed techniques and main results for these challenges. In particular, the paper focuses on autonomous self-deployment of sensor networks; cooperative localization and tracking; self-localization and mapping; and large-scale scenarios. Extensive experimental results and lessons learnt are also discussed in the paper.
User cooperation, virality and gaming in a social mobile network
DEFF Research Database (Denmark)
Varga, C; Blazovics, L; Charaf, H
2012-01-01
Social networks and mobile systems are both rapidly developing areas nowadays. In this chapter, we will introduce Gedda-Headz, a novel social mobile gaming concept that brings these two areas together. Gedda-Headz is a social mobile network that mainly focuses on multiplayer mobile gaming. First we......, as virality is very important in social networks, we will describe the viral elements of Gedda-Headz. We will also introduce the Gedda-Headz spreader, a novel method to spread the word about the network, increasing the virality further....... will thoroughly discuss how users may cooperate with each other in Gedda-Headz, as cooperation is very important in a mobile environment. Among other benefits, it may help users to use services that would otherwise be unreachable for them, or greatly decrease the energy cost of certain activities. Finally...
Cooperative Management of a Lithium-Ion Battery Energy Storage Network: A Distributed MPC Approach
Energy Technology Data Exchange (ETDEWEB)
Fang, Huazhen; Wu, Di; Yang, Tao
2016-12-12
This paper presents a study of cooperative power supply and storage for a network of Lithium-ion energy storage systems (LiBESSs). We propose to develop a distributed model predictive control (MPC) approach for two reasons. First, able to account for the practical constraints of a LiBESS, the MPC can enable a constraint-aware operation. Second, a distributed management can cope with a complex network that integrates a large number of LiBESSs over a complex communication topology. With this motivation, we then build a fully distributed MPC algorithm from an optimization perspective, which is based on an extension of the alternating direction method of multipliers (ADMM) method. A simulation example is provided to demonstrate the effectiveness of the proposed algorithm.
A Cooperative Network Coding Strategy for the Interference Relay Channel
Bui, Huyen-Chi; Lacan, Jerome; Boucheret, Marie-Laure
2012-01-01
In this paper, we study an interference relay network with a satellite as relay. We propose a cooperative strategy based on physical layer network coding and superposition modulation decoding for uni-directional communications among users. The performance of our solution in terms of throughput is evaluated through capacity analysis and simulations that include practical constraints such as the lack of synchronization in time and frequency. We demonstrate throughputs significantly larger than the classical time sharing case.
Properties of centralized cooperative sensing in cognitive radio networks
Skokowski, Paweł; Malon, Krzysztof; Łopatka, Jerzy
2017-04-01
Spectrum sensing is a functionality that enables network creation in the cognitive radio technology. Spectrum sensing is use for building the situation awareness knowledge for better use of radio resources and to adjust network parameters in case of jamming, interferences from legacy systems, decreasing link quality caused e.g. by nodes positions changes. This paper presents results from performed tests to compare cooperative centralized sensing versus local sensing. All tests were performed in created simulator developed in Matlab/Simulink environment.
Modeling the cooperative and competitive contagions in online social networks
Zhuang, Yun-Bei; Chen, J. J.; Li, Zhi-hong
2017-10-01
The wide adoption of social media has increased the interaction among different pieces of information, and this interaction includes cooperation and competition for our finite attention. While previous research focus on fully competition, this paper extends the interaction to be both ;cooperation; and ;competition;, by employing an IS1S2 R model. To explore how two different pieces of information interact with each other, the IS1S2 R model splits the agents into four parts-(Ignorant-Spreader I-Spreader II-Stifler), based on SIR epidemic spreading model. Using real data from Weibo.com, a social network site similar to Twitter, we find some parameters, like decaying rates, can both influence the cooperative diffusion process and the competitive process, while other parameters, like infectious rates only have influence on the competitive diffusion process. Besides, the parameters' effect are more significant in the competitive diffusion than in the cooperative diffusion.
Visualising Actor Network for Cooperative Systems in Marine Technology
DEFF Research Database (Denmark)
Pan, Yushan; Finken, Sisse
2016-01-01
are created to tackle challenges concerning human activities and their social interactions with regards to safety concerns in operation. This paper draws on fieldwork conducted in a marine setting of offshore operations. It presents an attempt to visualise the importance of cooperative work activities......Awareness is a concept familiar to specialists within the field of Computer Supported Cooperative Work (CSCW). It is superior for analysing and describing some of the ad hoc work activities that unfold in cooperation. Such informal activities are outside the scope of engineers’ formal models, which...... that shape computer systems. The aim, thus, is to portray cooperative work in a way that can be valuable for engineers implementing marine technology. We do so by way of presenting a transferring technique (2T) using insights from the CSCW field and Actor Network Theory (ANT)....
Bow-tie topological features of metabolic networks and the functional significance
Institute of Scientific and Technical Information of China (English)
ZHAO Jing; TAO Lin; YU Hong; LUO JianHua; GAO ZhiWei; LI YiXue
2007-01-01
Exploring the structural topology of genome-based large-scale metabolic network is essential for in vestigating possible relations between structure and functionality. Visualization would be helpful for obtaining immediate information about structural organization. In this work, metabolic networks of 75 organisms were investigated from a topological point of view. A spread bow-tie model was proposed to give a clear visualization of the bow-tie structure for metabolic networks. The revealed topological pattern helps to design more efficient algorithm specifically for metabolic networks. This coarsegrained graph also visualizes the vulnerable connections in the network, and thus could have important implication for disease studies and drug target identifications. In addition, analysis on the reciprocal links and main cores in the GSC part of bow-tie also reveals that the bow-tie structure of metabolic networks has its own intrinsic and significant features which are significantly different from those of random networks.
Critical Cooperation Range to Improve Spatial Network Robustness
Louzada, V H P; Verma, T; Daolio, F; Herrmann, H J; Tomassini, M
2014-01-01
A robust worldwide air-transportation network (WAN) is one that minimizes the number of stranded passengers under a sequence of airport closures. Here we address how WAN's robustness can profit from local cooperation between airports. For this, we reroute a series of flights among airports within a certain distance, a cooperation range, and describe the improvement of WAN's robustness with distance as a continuum transition. We calculate the critical exponents and identify a critical cooperation range below which improvement is negligible. We propose a network model that falls into the same universality class in which the probability to connect two nodes decays algebraically with their distance. Practical implications of this result are also discussed.
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Huang, Jing
2011-01-01
Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jam...
Fundamental Limits of Wideband Localization - Part II: Cooperative Networks
Shen, Yuan; Win, Moe Z
2010-01-01
The availability of positional information is of great importance in many commercial, governmental, and military applications. Localization is commonly accomplished through the use of radio communication between mobile devices (agents) and fixed infrastructure (anchors). However, precise determination of agent positions is a challenging task, especially in harsh environments due to radio blockage or limited anchor deployment. In these situations, cooperation among agents can significantly improve localization accuracy and reduce localization outage probabilities. A general framework of analyzing the fundamental limits of wideband localization has been developed in Part I of the paper. Here, we build on this framework and establish the fundamental limits of wideband cooperative location-aware networks. Our analysis is based on the waveforms received at the nodes, in conjunction with Fisher information inequality. We provide a geometrical interpretation of equivalent Fisher information for cooperative networks....
Asymmetrical Modulation for Uplink Communication in Cooperative Networks
DEFF Research Database (Denmark)
Zhang, Qi; Fitzek, Frank H.P.; Iversen, Villy Bæk
2008-01-01
In this paper a spectrum efficient uplink communication method for cooperative wireless networks is presented. In cellular controlled peer to peer (CCP2P) cooperative wireless networks the mobile device is logically connected over cellular links with the base station and simultaneously over short......-range links with neighboring mobile devices to form cooperative clusters. So far the physical communication over cellular links and over short-range links are separated in time or in frequency. Beyond this state of the art, we exploit a method, referred to as asymmetrical modulation, where a mobile device...... information, the neighboring devices are getting the fine grained information reading between the lines. Our analytical analysis and simulation results show that asymmetrical modulation can improve the spectrum efficiency and reduce the data queuing delay with neither degrading the symbol error rate...
Emergent self-organized complex network topology out of stability constraints.
Perotti, Juan I; Billoni, Orlando V; Tamarit, Francisco A; Chialvo, Dante R; Cannas, Sergio A
2009-09-04
Although most networks in nature exhibit complex topologies, the origins of such complexity remain unclear. We propose a general evolutionary mechanism based on global stability. This mechanism is incorporated into a model of a growing network of interacting agents in which each new agent's membership in the network is determined by the agent's effect on the network's global stability. It is shown that out of this stability constraint complex topological properties emerge in a self-organized manner, offering an explanation for their observed ubiquity in biological networks.
Coordination and cooperation problems in network good production
Knigge, A.; Buskens, V.W.
2010-01-01
If actors want to reach a particular goal, they are often better off forming collaborative relations and investing together rather than investing separately. We study the coordination and cooperation problems that might hinder successful collaboration in a dynamic network setting. We develop an expe
Coordination and Cooperation Problems in Network Good Production
A. Knigge (Antonie); V.W. Buskens (Vincent)
2010-01-01
textabstractIf actors want to reach a particular goal, they are often better off forming collaborative relations and investing together rather than investing separately. We study the coordination and cooperation problems that might hinder successful collaboration in a dynamic network setting. We dev
Requirements and Algorithms for Cooperation of Heterogeneous Radio Access Networks
DEFF Research Database (Denmark)
Mihovska, Albena D.; Tragos, Elias; Mino, Emilio
2009-01-01
This paper defines the requirements for cooperation of heterogeneous radio access networks (RANs) and proposes a novel radio resource management (RRM) framework for support of mobility and quality of service (QoS) in a heterogeneous communication environment comprising IMT-Advanced and legacy...
Coordination and cooperation problems in network good production
Knigge, A.; Buskens, V.W.
2010-01-01
If actors want to reach a particular goal, they are often better off forming collaborative relations and investing together rather than investing separately. We study the coordination and cooperation problems that might hinder successful collaboration in a dynamic network setting. We develop an
On Optimal Policies for Network-Coded Cooperation
DEFF Research Database (Denmark)
Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman
2015-01-01
's Raspberry Pi testbed and compared with random linear network coding (RLNC) broadcast in terms of completion time, total number of required transmissions, and percentage of delivered generations. Our measurements show that enabling cooperation only among pairs of devices can decrease the completion time...
THE GOVERNANCE STRUCTURE OF COOPERATIVE NETWORKS
National Research Council Canada - National Science Library
Rosileia Milagres
2014-01-01
.... The analysis shows that the governance structure is influenced by the objectives established, the partners' experience, the types of knowledge and the context where network is inserted. The case highlights the importance of learning during the process, but, although present, it can be negatively influenced by the context and the possibility of future partnerships.
Design Method Based on Routing Tree for Topology Update in Ad Hoc Network
Institute of Scientific and Technical Information of China (English)
WEI Zheng-xi; ZHANG Hong; WANG Xiao-ling
2006-01-01
A design method based on the tree-model structure for topology update is presented. The routing tree of every node in network is built by defining the data structure and is used to save the topology information of neighbor nodes. The node topology update is accomplished by exchanging their routing trees. For saving the precious wireless bandwidth, the routing tree is sparsely shaped before sending by pruning the redundant routing information. Then, the node topology update is implemented by using algorithms of inserting and deleting routing sub-trees.
Li, Yongfu; Li, Kezhi; Zheng, Taixiong; Hu, Xiangdong; Feng, Huizong; Li, Yinguo
2016-05-01
This study proposes a feedback-based platoon control protocol for connected autonomous vehicles (CAVs) under different network topologies of initial states. In particularly, algebraic graph theory is used to describe the network topology. Then, the leader-follower approach is used to model the interactions between CAVs. In addition, feedback-based protocol is designed to control the platoon considering the longitudinal and lateral gaps simultaneously as well as different network topologies. The stability and consensus of the vehicular platoon is analyzed using the Lyapunov technique. Effects of different network topologies of initial states on convergence time and robustness of platoon control are investigated. Results from numerical experiments demonstrate the effectiveness of the proposed protocol with respect to the position and velocity consensus in terms of the convergence time and robustness. Also, the findings of this study illustrate the convergence time of the control protocol is associated with the initial states, while the robustness is not affected by the initial states significantly.
Degree mixing in multilayer networks impedes the evolution of cooperation.
Wang, Zhen; Wang, Lin; Perc, Matjaž
2014-05-01
Traditionally, the evolution of cooperation has been studied on single, isolated networks. Yet a player, especially in human societies, will typically be a member of many different networks, and those networks will play different roles in the evolutionary process. Multilayer networks are therefore rapidly gaining on popularity as the more apt description of a networked society. With this motivation, we here consider two-layer scale-free networks with all possible combinations of degree mixing, wherein one network layer is used for the accumulation of payoffs and the other is used for strategy updating. We find that breaking the symmetry through assortative mixing in one layer and/or disassortative mixing in the other layer, as well as preserving the symmetry by means of assortative mixing in both layers, impedes the evolution of cooperation. We use degree-dependent distributions of strategies and cluster-size analysis to explain these results, which highlight the importance of hubs and the preservation of symmetry between multilayer networks for the successful resolution of social dilemmas.
Computationally efficient measure of topological redundancy of biological and social networks
Albert, Réka; Dasgupta, Bhaskar; Hegde, Rashmi; Sivanathan, Gowri Sangeetha; Gitter, Anthony; Gürsoy, Gamze; Paul, Pradyut; Sontag, Eduardo
2011-09-01
It is well known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient, and applicable to a variety of directed networks such as cellular signaling, and metabolic and social interaction networks. We demonstrate the computational efficiency of our measure by computing its value and statistical significance on a number of biological and social networks with up to several thousands of nodes and edges. Our results suggest a number of interesting observations: (1) Social networks are more redundant that their biological counterparts, (2) transcriptional networks are less redundant than signaling networks, (3) the topological redundancy of the C. elegans metabolic network is largely due to its inclusion of currency metabolites, and (4) the redundancy of signaling networks is highly (negatively) correlated with the monotonicity of their dynamics.
A New Computationally Efficient Measure of Topological Redundancy of Biological and Social Networks
Albert, Reka; Gitter, Anthony; Gursoy, Gamze; Hegde, Rashmi; Paul, Pradyut; Sivanathan, Gowri Sangeetha; Sontag, Eduardo
2011-01-01
It is well-known that biological and social interaction networks have a varying degree of redundancy, though a consensus of the precise cause of this is so far lacking. In this paper, we introduce a topological redundancy measure for labeled directed networks that is formal, computationally efficient and applicable to a variety of directed networks such as cellular signaling, metabolic and social interaction networks. We demonstrate the computational efficiency of our measure by computing its value and statistical significance on a number of biological and social networks with up to several thousands of nodes and edges. Our results suggest a number of interesting observations: (1) social networks are more redundant that their biological counterparts, (2) transcriptional networks are less redundant than signaling networks, (3) the topological redundancy of the C. elegans metabolic network is largely due to its inclusion of currency metabolites, and (4) the redundancy of signaling networks is highly (negatively...
Phase transitions in cooperative coinfections: Simulation results for networks and lattices
Grassberger, Peter; Chen, Li; Ghanbarnejad, Fakhteh; Cai, Weiran
2016-04-01
We study the spreading of two mutually cooperative diseases on different network topologies, and with two microscopic realizations, both of which are stochastic versions of a susceptible-infected-removed type model studied by us recently in mean field approximation. There it had been found that cooperativity can lead to first order transitions from spreading to extinction. However, due to the rapid mixing implied by the mean field assumption, first order transitions required nonzero initial densities of sick individuals. For the stochastic model studied here the results depend strongly on the underlying network. First order transitions are found when there are few short but many long loops: (i) No first order transitions exist on trees and on 2-d lattices with local contacts. (ii) They do exist on Erdős-Rényi (ER) networks, on d -dimensional lattices with d ≥4 , and on 2-d lattices with sufficiently long-ranged contacts. (iii) On 3-d lattices with local contacts the results depend on the microscopic details of the implementation. (iv) While single infected seeds can always lead to infinite epidemics on regular lattices, on ER networks one sometimes needs finite initial densities of infected nodes. (v) In all cases the first order transitions are actually "hybrid"; i.e., they display also power law scaling usually associated with second order transitions. On regular lattices, our model can also be interpreted as the growth of an interface due to cooperative attachment of two species of particles. Critically pinned interfaces in this model seem to be in different universality classes than standard critically pinned interfaces in models with forbidden overhangs. Finally, the detailed results mentioned above hold only when both diseases propagate along the same network of links. If they use different links, results can be rather different in detail, but are similar overall.
Directory of Open Access Journals (Sweden)
Caixian Sun
2014-01-01
Full Text Available This paper is devoted to the average consensus problems in directed networks of agents with unknown control direction. In this paper, by using Nussbaum function techniques and Laplacian matrix, novel average consensus protocols are designed for multiagent systems with unknown control direction in the cases of directed networks with fixed and switching topology. In the case of switching topology, the disagreement vector is utilized. Finally, simulation is provided to demonstrate the effectiveness of our results.
Che, Y.; Li, R. X.; Han, C. X.; Wang, J.; Cui, S. G.; Deng, B.; Wei, X.
2012-08-01
This paper presents an adaptive lag synchronization based method for simultaneous identification of topology and parameters of uncertain general complex dynamical networks with and without time delays. Based on Lyapunov stability theorem and LaSalle's invariance principle, an adaptive controller is designed to realize lag synchronization between drive and response systems, meanwhile, identification criteria of network topology and system parameters are obtained. Numerical simulations illustrate the effectiveness of the proposed method.
A Genetic Algorithm and Analysis of Designing Large Enterprise Network Topology
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The design of enterprise network topology is in fact a multi-object nonlinear programming problem. In this paper, distance, traffic distribution and transmission delay are chosen as the important factors to be considered in the subnetwork partition of the network topology design. A mathematical model is presented and The Genetic Algorithm is used to solve the optimization object function. The application results demonstrate that the method can well solve the problem of subnetwork partition.
Capacity Extension of Software Defined Data Center Networks With Jellyfish Topology
DEFF Research Database (Denmark)
Mehmeri, Victor; Vegas Olmos, Juan José; Tafur Monroy, Idelfonso
We present a performance analysis of Jellyfish topology with Software-Defined commodity switches for Data Center networks. Our results show up to a 2-fold performance gain when compared to a Spanning Tree Protocol implementation.......We present a performance analysis of Jellyfish topology with Software-Defined commodity switches for Data Center networks. Our results show up to a 2-fold performance gain when compared to a Spanning Tree Protocol implementation....
On the formation of non-topological string networks
Achucarro, A; Borrill, J; Liddle, AR
1998-01-01
We review recent simulations of the formation of a particular class of non-topological defects known as semilocal strings during a phase transition. Semilocal strings have properties that are intermediate between topological cosmic strings and stable electroweak strings, and therefore the observatio
Regions, Networks and Fluids: Anaemia and Social Topology
Mol, A.M.; Law, John
1994-01-01
This is a paper about the topological presuppositions that frame the performance of social similarity and difference. It argues that 'the social' does not exist as a single spatial type, but rather performs itself in a recursive and topologically heterogeneous manner. Using material drawn from a
Hátylas Azevedo; Carlos Alberto Moreira-Filho
2015-01-01
Biological networks display high robustness against random failures but are vulnerable to targeted attacks on central nodes. Thus, network topology analysis represents a powerful tool for investigating network susceptibility against targeted node removal. Here, we built protein interaction networks associated with chemoresistance to temozolomide, an alkylating agent used in glioma therapy, and analyzed their modular structure and robustness against intentional attack. These networks showed fu...
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.
Multi-constraint quality of service routing algorithm for dynamic topology networks
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
An adaptive multi-QoS routing algorithm called AMQRA is proposed for dynamic topology networks,such as satellite networks and Ad-hoc networks.The AMQRA is a distributed and mobile-agents-based routing algorithm,which combines ant quantity system (AQS) with ant colony optimization (ACO) that is used in AntNet routing algorithm.In dynamic topology networks,the AMQRA achieves timely optimization for concave metric QoS constraint and fast convergence.The proposed routing algorithm is simulated in Iridium satellite constellation on OPNET.The results show that AMQRA not only outperforms the AntNet in convergence rate in dynamic topology networks but also can optimize concave metric QoS constraint and reasonably allot bandwidth to the load to avoid networks congestion.
Wen, Guanghui; Yu, Wenwu; Hu, Guoqiang; Cao, Jinde; Yu, Xinghuo
2015-12-01
This paper studies the global pinning synchronization problem for a class of complex networks with switching directed topologies. The common assumption in the existing related literature that each possible network topology contains a directed spanning tree is removed in this paper. Using tools from M -matrix theory and stability analysis of the switched nonlinear systems, a new kind of network topology-dependent multiple Lyapunov functions is proposed for analyzing the synchronization behavior of the whole network. It is theoretically shown that the global pinning synchronization in switched complex networks can be ensured if some nodes are appropriately pinned and the coupling is carefully selected. Interesting issues of how many and which nodes should be pinned for possibly realizing global synchronization are further addressed. Finally, some numerical simulations on coupled neural networks are provided to verify the theoretical results.
Weighted cooperative routing for wireless mobile Ad-hoc network
Institute of Scientific and Technical Information of China (English)
ZHAO Xian-jing; ZHENG Bao-yu; CHEN Chao
2007-01-01
A novel weighted cooperative routing algorithm (WCRA) is proposed in this article, which was on the basis of a weighted metric with maximal remaining energy (MRE) of the relays and the maximal received SNR (MRS) of the nodes.Moreover, a cooperative routing protocol was implemented on the basis of WCRA. Then simulation is done on network simulation (NS-2) platform to compare the performances of MRS, MRE and WCRA with that of noncooperative destination-sequenced destination-sequenced distance-vector (DSDV) protocol. The simulative results show that WCRA obtains a performance tradeoff between MRE and MRS in terms of delivery ratio and network lifetime, which can effectively improve the network lifetime at an acceptable loss of delivery ratio.
Comparative Study of Cooperation Tools for Mobile Ad Hoc Networks
Directory of Open Access Journals (Sweden)
J. Molina-Gil
2016-01-01
Full Text Available Mobile ad hoc networks are formed spontaneously to use the wireless medium for communication among nodes. Each node in this type of network is its own authority and has an unpredictable behaviour. These features involve a cooperation challenge that has been addressed in previous proposals with methods based on virtual currencies. In this work, those methods have been simulated in NS-2 and the results have been analyzed, showing several weaknesses. In particular, it has been concluded that existent methods do not provide significant advances compared with networks without any mechanism for promoting cooperation. Consequently, this work presents three new proposals that try to solve those problems. The obtained results show that the new proposals offer significant improvements over previous schemes based on virtual currencies.
Robust Design of Virtual Topology for WDM Networks under Bandwidth Demand Uncertainties
Institute of Scientific and Technical Information of China (English)
YANG Fei; LI Le-min; WANG Sheng; GUO Lei; ZHANG Yan-ni
2007-01-01
In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing (WDM) networks under bandwidth demand uncertainties. And a bandwidth demand model under uncertainties is presented. The optimization goal of virtual topology design is defimed as minimizing the maximum value among p percentiles of the bandwidth demand distribution on all light-paths. Correspondingly, we propose a heuristic algorithm called an improved decreasing multi-hop logical topology design algorithm(ID-MLTDA) that involves with a degree of uncertainties to design virtual topology. The proposed algorithm yields better performance than previous algorithms. Additionally, the simplicity and efficiency of the proposed algorithm can be in favor of the feasibility for topology design of large networks.
A topology control algorithm for preserving minimum-energy paths in wireless ad hoc networks
Institute of Scientific and Technical Information of China (English)
SHEN Zhong; CHANG Yilin; CUI Can; ZHANG Xin
2007-01-01
In this Paper,a distributed topology control algorithm is proposed.By adjusting the transmission power of each node,this algorithm constructs a wireless network topology with minimum-energy property,i.e.,it preserves a minimum-energy path between every pair of nodes.Moreover,the proposed algorithm can be used in both homogenous and heterogeneous wireless networks.and it can also work without an explicit propagation channel model or the position information of nodes.Simulation results show that the proposed algorithm has advantages over the topology control algorithm based on direct-transmission region in terms of average node degree and power efficiency.
Yu, Qingbao; Sui, Jing; Rachakonda, Srinivas; He, Hao; Gruner, William; Pearlson, Godfrey; Kiehl, Kent A; Calhoun, Vince D
2011-01-01
Aberrant topological properties of small-world human brain networks in patients with schizophrenia (SZ) have been documented in previous neuroimaging studies. Aberrant functional network connectivity (FNC, temporal relationships among independent component time courses) has also been found in SZ by a previous resting state functional magnetic resonance imaging (fMRI) study. However, no study has yet determined if topological properties of FNC are also altered in SZ. In this study, small-world network metrics of FNC during the resting state were examined in both healthy controls (HCs) and SZ subjects. FMRI data were obtained from 19 HCs and 19 SZ. Brain images were decomposed into independent components (ICs) by group independent component analysis (ICA). FNC maps were constructed via a partial correlation analysis of ICA time courses. A set of undirected graphs were built by thresholding the FNC maps and the small-world network metrics of these maps were evaluated. Our results demonstrated significantly altered topological properties of FNC in SZ relative to controls. In addition, topological measures of many ICs involving frontal, parietal, occipital and cerebellar areas were altered in SZ relative to controls. Specifically, topological measures of whole network and specific components in SZ were correlated with scores on the negative symptom scale of the Positive and Negative Symptom Scale (PANSS). These findings suggest that aberrant architecture of small-world brain topology in SZ consists of ICA temporally coherent brain networks.
Coalitional Game Theory for Cooperative Interference Management in Femtocell Networks
Directory of Open Access Journals (Sweden)
Yuanyuan Shi
2015-01-01
Full Text Available Dense deployment of femtocells can cause serious intra-tier interference in femtocell networks. In this paper, a new cooperative interference management approach which allows the femtocell user equipment (FUE to merge into cooperative groups, that is, coalitions, for the uplink transmissions in a femtocell network is proposed, so as to reduce the intra-tier interference and improve the system performance. Taking into account the power cost for cooperation, we claim that all the FUEs are impossible to merge together, and we formulate the proposed cooperative problem as a coalitional game in partition form with an externality due to the interference between the formed coalitions. To get the solution, a novel distributed coalition formation algorithm that takes advantage of the characteristics of femtocell network and allows the FUEs to interact and individually decide on which coalitions to participate in is proposed. Furthermore, we analyze the convergence and stability of the proposed algorithm. Simulations are conducted to illustrate the behavior and the performance of the proposed coalition formation algorithm among FUEs. Results show that the proposed algorithm can improve the system performance with much lower complexity than some previously proposed coalition formation algorithms.
Beamforming with Reduced Complexity in MIMO Cooperative Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
Mehdi Ghamari Adian
2014-01-01
Full Text Available An approach for beamforming with reduced complexity in MIMO cooperative cognitive radio networks (MIMO-CCRN is presented. Specifically, a suboptimal approach with reduced complexity is proposed to jointly determine the transmit beamforming (TB and cooperative beamforming (CB weight vectors along with antenna subset selection in MIMO-CCRN. Two multiantenna secondary users (SU constitute the desired link, one acting as transmitter (SU TX and the other as receiver (SU RX and they coexist with single-antenna primary and secondary users. Some of single antenna secondary users are recruited by desired link as cooperative relay. The maximization of the achievable rates in the desired link is the objective of this work, provided to interference constraints on the primary users are not violated. The objective is achieved by exploiting transmit beamforming at SU TX, cooperation of some secondary users, and cooperative beamforming. Meanwhile, the costs associated with RF chains at the radio front end at SU RX are reduced. Through simulations, it is shown that better performance in the desired link is attained, as a result of cooperation of SUs.
A Mechanism for Detection of Cooperative Black Hole Attack in Mobile Ad Hoc Networks
Sen, Jaydip; Ukil, Arijit
2011-01-01
A mobile ad hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi-hop radio network and maintaining connections in a decentralized manner. Security remains a major challenge for these networks due to their features of open medium, dynamically changing topologies, reliance on cooperative algorithms,absence of centralized monitoring points, and lack of clear lines of defense. Most of the routing protocols for MANETs are thus vulnerable to various types of attacks. Ad hoc on-demand distance vector routing (AODV) is a very popular routing algorithm. However, it is vulnerable to the well-known black hole attack, where a malicious node falsely advertises good paths to a destination node during the route discovery process. This attack becomes more sever when a group of malicious nodes cooperate each other. In this paper, a defense mechanism is presented against a coordinated attack by multiple black hole nodes in a MANET. The simulation carried out on the propose...
Phase Transitions in Cooperative Coinfections: Simulation Results for Networks and Lattices
Grassberger, Peter; Ghanbarnejad, Fakhteh; Cai, Weiran
2015-01-01
We study the spreading of two mutually cooperative diseases on different network topologies, and with two microscopic realizations, both of which are stochastic versions of an SIR type model studied by us recently in mean field approximation. There it had been found that cooperativity can lead to first-order spreading/extinction transitions. However, due to the rapid mixing implied by the mean field assumption, first order transitions required non-zero initial densities of sick individuals. For the stochastic model studied here the results depend strongly on the underlying network. First order transitions are found when there are few short but many long loops: (i) No first order transitions exist on trees and on 2-d lattices with local contacts (ii) They do exist on Erdos-Renyi (ER) networks, on d-dimensional lattices with d >= 4, and on 2-d lattices with sufficiently long-ranged contacts; (iii) On 3-d lattices with local contacts the results depend on the microscopic details of the implementation; (iv) While...
Empirical study of the role of the topology in spreading on communication networks
Medvedev, Alexey N
2016-01-01
Topological aspects, like community structure, and temporal activity patterns, like burstiness, have been shown to severly influence the speed of spreading in temporal networks. We study the influence of the topology on the susceptible-infected (SI) spreading on time stamped communication networks, as obtained from a dataset of mobile phone records. We consider city level networks with intra- and inter-city connections. The networks using only intra-city links are usually sparse, where the spreading depends mainly on the average degree. The inter-city links serve as bridges in spreading, speeding up considerably the process. We demonstrate the effect also on model simulations.
Empirical study of the role of the topology in spreading on communication networks
Medvedev, Alexey; Kertesz, Janos
2017-03-01
Topological aspects, like community structure, and temporal activity patterns, like burstiness, have been shown to severely influence the speed of spreading in temporal networks. We study the influence of the topology on the susceptible-infected (SI) spreading on time stamped communication networks, as obtained from a dataset of mobile phone records. We consider city level networks with intra- and inter-city connections. The networks using only intra-city links are usually sparse, where the spreading depends mainly on the average degree. The inter-city links serve as bridges in spreading, speeding up considerably the process. We demonstrate the effect also on model simulations.
DSTC Layering Protocols in Wireless Cooperative Networks
Elamvazhuthi, P S; Dey, B K
2008-01-01
In adhoc wireless relay networks, layers of relays are used to communicate from a source to a destination to achieve better reliability. In this paper, we consider five protocols derived from an earlier proposed protocol, where the relays do a simple processing before transmitting and as a result achieve distributed space-time code. Four of the protocols discussed utilize more complicated relaying schemes than simple layered protocols proposed in earlier literature. We have analyzed the effectiveness of these protocols in various power loss configurations among the paths. Optimum power allocation of the total power among various transmissions have been found by reasonable fine search for all the protocols. Bit error rate plots are compared under optimum power allocation for these protocols. From the simulation results, we draw some guidelines as to which protocol is good for what kind of environment.
Energy Technology Data Exchange (ETDEWEB)
Hobbs, L.W. [Massachusetts Institute of Technology, Dept. of Materials Science and Engineering, Cambridge, MA (United States); Jesurum, C.E. [Massachusetts Institute of Technology, Dept. of Mathematics, Cambridge, MA (United States); Pulim, V. [Massachusetts Institute of Technology, Lab. for Computer Science, Cambridge, MA (United States)
1997-07-01
Topology is shown to govern the arrangement of connected structural elements in network glasses such as silica and related radiation-amorphized network compounds: A topological description of such topologically-disordered arrangements is possible which utilizes a characteristic unit of structure--the local cluster--not far in scale from the unit cells in crystalline arrangements. Construction of credible glass network structures and their aberration during cascade disordering events during irradiation can be effected using local assembly rules based on modification of connectivity-based assembly rules derived for crystalline analogues. These topological approaches may provide useful complementary information to that supplied by molecular dynamics about re-ordering routes and final configurations in irradiated glasses. (authors)
Kinkhabwala, Ali
2013-01-01
The connection between network topology and stability remains unclear. General approaches that clarify this relationship and allow for more efficient stability analysis would be desirable. In this manuscript, I examine the mathematical notion of influence topology, which is fundamentally based on the network reaction stoichiometries and the first derivatives of the reactions with respect to each species at the steady state solution(s). The influence topology is naturally represented as a signed directed bipartite graph with arrows or blunt arrows connecting a species node to a reaction node (positive/negative derivative) or a reaction node to a species node (positive/negative stoichiometry). The set of all such graphs is denumerable. A significant reduction in dimensionality is possible through stoichiometric scaling, cycle compaction, and temporal scaling. All cycles in a network can be read directly from the graph of its influence topology, enabling efficient and intuitive computation of the principal minor...
Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Nadeem Javaid
2017-03-01
Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.
Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.
Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif
2017-03-19
In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.
Institute of Scientific and Technical Information of China (English)
LUO Yabo; ZHENG Li; ZOU Shiwei; ZHAO Liang
2006-01-01
Based on the analysis on the previous research in virtual manufacturing and virtual enterprises, this paper provides a novel architecture of networked manufacturing system around the cooperative design. The key technologies for synchronous cooperative design in networked manufacturing platform, such as the cooperative mechanism, cooperative rules, control authority conveyed, cooperative efficiency, are detailed, with which a synchronous cooperative design system is developed. Due to the cooperative efficiency is the major bottleneck of the synchronous cooperative design over Internet, this research details the test and experiment to demonstrate the practicality of the system. Finally the advantages of the system are illustrated compared with current software tools.
Pasta, Muhammad Qasim; Melançon, Guy
2016-01-01
One of the most widely studied problem in mining and analysis of complex networks is the detection of community structures. The problem has been extensively studied by researchers due to its high utility and numerous applications in various domains. Many algorithmic solutions have been proposed for the community detection problem but the quest to find the best algorithm is still on. More often than not, researchers focus on developing fast and accurate algorithms that can be generically applied to networks from a variety of domains without taking into consideration the structural and topological variations in these networks. In this paper, we evaluate the performance of different clustering algorithms as a function of varying network topology. Along with the well known LFR model to generate benchmark networks with communities,we also propose a new model named Naive Scale Free Model to study the behavior of community detection algorithms with respect to different topological features. More specifically, we are...
A Minimum-energy Path-preserving Topology Control Algorithm for Wireless Sensor Networks
Institute of Scientific and Technical Information of China (English)
Jin-Zhao Lin; Xian Zhou; Yun Li
2009-01-01
The topology control strategies of wireless sensor networks are very important for reducing the energy consumption of sensor nodes and prolonging the life-span of networks. In this paper, we put forward a minimum-energy path-preserving topology control (MPTC) algorithm based on a concept of none k-redundant edges. MPTC not only resolves the problem of excessive energy consumption because of the unclosed region in small minimum-energy communication network (SMECN), but also preserves at least one minimum-energy path between every pair of nodes in a wireless sensor network. We also propose an energy-efficient reconfiguration protocol that maintains the minimum-energy path property in the case where the network topology changes dynamically. Finally, we demonstrate the performance improvements of our algorithm through simulation.
The topology of evolving rift fault networks: Single-phase vs multi-phase rifts
Duffy, Oliver B.; Nixon, Casey W.; Bell, Rebecca E.; Jackson, Christopher A.-L.; Gawthorpe, Rob L.; Sanderson, David J.; Whipp, Paul S.
2017-03-01
Rift fault networks can be complex, particularly those developed by multiple periods of non-coaxial extension, comprising non-colinear faults with many interactions. Thus, topology, rather than simple geometry, is required to characterise such networks, as it provides a way to describe the arrangement of individual faults in the network. Topology is analysed here in terms of nodes (isolated I nodes or connected Y or X nodes) and branches (I-I, I-C, C-C branches). In map view, the relative proportions of these parameters vary in natural single- and multi-phase rift fault networks and in scaled physical models at different stages of development and strain. Interactions in single-phase rifting are limited to fault splays and along-strike fault linkage (I node and I-I or I-C branch dominated networks), whereas in multi-phase rifting the topology evolves towards Y node and C-C branch dominated networks, with the degree of connectivity increasing with greater strain. The changes in topology and network connectivity have significant implications for fluid flow and reservoir compartmentalisation studies. Furthermore, topology helps to distinguish single and multiple phase extension (i.e. tectonic histories), and thus provide constraints on the geodynamic context of sedimentary basins.
Alexander-Bloch, Aaron F; Vértes, Petra E; Stidd, Reva; Lalonde, François; Clasen, Liv; Rapoport, Judith; Giedd, Jay; Bullmore, Edward T; Gogtay, Nitin
2013-01-01
The human brain is a topologically complex network embedded in anatomical space. Here, we systematically explored relationships between functional connectivity, complex network topology, and anatomical (Euclidean) distance between connected brain regions, in the resting-state functional magnetic resonance imaging brain networks of 20 healthy volunteers and 19 patients with childhood-onset schizophrenia (COS). Normal between-subject differences in average distance of connected edges in brain graphs were strongly associated with variation in topological properties of functional networks. In addition, a club or subset of connector hubs was identified, in lateral temporal, parietal, dorsal prefrontal, and medial prefrontal/cingulate cortical regions. In COS, there was reduced strength of functional connectivity over short distances especially, and therefore, global mean connection distance of thresholded graphs was significantly greater than normal. As predicted from relationships between spatial and topological properties of normal networks, this disorder-related proportional increase in connection distance was associated with reduced clustering and modularity and increased global efficiency of COS networks. Between-group differences in connection distance were localized specifically to connector hubs of multimodal association cortex. In relation to the neurodevelopmental pathogenesis of schizophrenia, we argue that the data are consistent with the interpretation that spatial and topological disturbances of functional network organization could arise from excessive "pruning" of short-distance functional connections in schizophrenia.
Lightweight Interactions for Reciprocal Cooperation in a Social Network Game
Takano, Masanori; Fukuda, Ichiro
2016-01-01
The construction of reciprocal relationships requires cooperative interactions during the initial meetings. However, cooperative behavior with strangers is risky because the strangers may be exploiters. In this study, we show that people increase the likelihood of cooperativeness of strangers by using lightweight non-risky interactions in risky situations based on the analysis of a social network game (SNG). They can construct reciprocal relationships in this manner. The interactions involve low-cost signaling because they are not generated at any cost to the senders and recipients. Theoretical studies show that low-cost signals are not guaranteed to be reliable because the low-cost signals from senders can lie at any time. However, people used low-cost signals to construct reciprocal relationships in an SNG, which suggests the existence of mechanisms for generating reliable, low-cost signals in human evolution.
Cooperative cognitive radio networking system model, enabling techniques, and performance
Cao, Bin; Mark, Jon W
2016-01-01
This SpringerBrief examines the active cooperation between users of Cooperative Cognitive Radio Networking (CCRN), exploring the system model, enabling techniques, and performance. The brief provides a systematic study on active cooperation between primary users and secondary users, i.e., (CCRN), followed by the discussions on research issues and challenges in designing spectrum-energy efficient CCRN. As an effort to shed light on the design of spectrum-energy efficient CCRN, they model the CCRN based on orthogonal modulation and orthogonally dual-polarized antenna (ODPA). The resource allocation issues are detailed with respect to both models, in terms of problem formulation, solution approach, and numerical results. Finally, the optimal communication strategies for both primary and secondary users to achieve spectrum-energy efficient CCRN are analyzed.
Auction-based Security Game for Multiuser Cooperative Networks
Wang, An; Cai, Yueming; Yang, Wendong; Cheng, Yunpeng
2013-04-01
In this paper, we develop an auction-based algorithm to allocate the relay power efficiently to improve the system secrecy rate in a cooperative network, where several source-destination pairs and one cooperative relay are involved. On the one hand, the cooperative relay assists these pairs to transmit under a peak power constraint. On the other hand, the relay is untrusty and is also a passive eavesdropper. The whole auction process is completely distributed and no instantaneous channel state information exchange is needed. We also prove the existence and uniqueness of the Nash Equilibrium (NE) for the proposed power auction game. Moreover, the Pareto optimality is also validated. Simulation results show that our proposed auction-based algorithm can effectively improve the system secrecy rate. Besides, the proposed auction-based algorithm can converge to the unique NE point within a finite number of iterations. More interestingly, we also find that the proposed power auction mechanism is cheat-proof.
Routing Topologies of Wireless Sensor Networks for Health Monitoring of a Cultural Heritage Site
Directory of Open Access Journals (Sweden)
Sofía Aparicio
2016-10-01
Full Text Available This paper provides a performance evaluation of tree and mesh routing topologies of wireless sensor networks (WSNs in a cultural heritage site. The historical site selected was San Juan Bautista church in Talamanca de Jarama (Madrid, Spain. We report the preliminary analysis required to study the effects of heating in this historical location using WSNs to monitor the temperature and humidity conditions during periods of weeks. To test which routing topology was better for this kind of application, the WSNs were first deployed on the upper floor of the CAEND institute in Arganda del Rey simulating the church deployment, but in the former scenario there was no direct line of sight between the WSN elements. Two parameters were selected to evaluate the performance of the routing topologies of WSNs: the percentage of received messages and the lifetime of the wireless sensor network. To analyze in more detail which topology gave the best performance, other communication parameters were also measured. The tree topology used was the collection tree protocol and the mesh topology was the XMESH provided by MEMSIC (Andover, MA, USA. For the scenarios presented in this paper, it can be concluded that the tree topology lost fewer messages than the mesh topology.
Routing Topologies of Wireless Sensor Networks for Health Monitoring of a Cultural Heritage Site
Aparicio, Sofía; Martínez-Garrido, María I.; Ranz, Javier; Fort, Rafael; Izquierdo, Miguel Ángel G.
2016-01-01
This paper provides a performance evaluation of tree and mesh routing topologies of wireless sensor networks (WSNs) in a cultural heritage site. The historical site selected was San Juan Bautista church in Talamanca de Jarama (Madrid, Spain). We report the preliminary analysis required to study the effects of heating in this historical location using WSNs to monitor the temperature and humidity conditions during periods of weeks. To test which routing topology was better for this kind of application, the WSNs were first deployed on the upper floor of the CAEND institute in Arganda del Rey simulating the church deployment, but in the former scenario there was no direct line of sight between the WSN elements. Two parameters were selected to evaluate the performance of the routing topologies of WSNs: the percentage of received messages and the lifetime of the wireless sensor network. To analyze in more detail which topology gave the best performance, other communication parameters were also measured. The tree topology used was the collection tree protocol and the mesh topology was the XMESH provided by MEMSIC (Andover, MA, USA). For the scenarios presented in this paper, it can be concluded that the tree topology lost fewer messages than the mesh topology. PMID:27775571
Routing Topologies of Wireless Sensor Networks for Health Monitoring of a Cultural Heritage Site.
Aparicio, Sofía; Martínez-Garrido, María I; Ranz, Javier; Fort, Rafael; Izquierdo, Miguel Ángel G
2016-10-19
This paper provides a performance evaluation of tree and mesh routing topologies of wireless sensor networks (WSNs) in a cultural heritage site. The historical site selected was San Juan Bautista church in Talamanca de Jarama (Madrid, Spain). We report the preliminary analysis required to study the effects of heating in this historical location using WSNs to monitor the temperature and humidity conditions during periods of weeks. To test which routing topology was better for this kind of application, the WSNs were first deployed on the upper floor of the CAEND institute in Arganda del Rey simulating the church deployment, but in the former scenario there was no direct line of sight between the WSN elements. Two parameters were selected to evaluate the performance of the routing topologies of WSNs: the percentage of received messages and the lifetime of the wireless sensor network. To analyze in more detail which topology gave the best performance, other communication parameters were also measured. The tree topology used was the collection tree protocol and the mesh topology was the XMESH provided by MEMSIC (Andover, MA, USA). For the scenarios presented in this paper, it can be concluded that the tree topology lost fewer messages than the mesh topology.
On the influence of topological characteristics on robustness of complex networks
Kasthurirathna, Dharshana; Thedchanamoorthy, Gnanakumar
2014-01-01
In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, small-world and random networks, we look at a number of network measures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicable) of a network, and how each of these influence the robustness of a network under targeted attacks. We use an established robustness coefficient to measure topological robustness, and consider sustained targeted attacks by order of node degree. With respect to scale-free networks, we show that assortativity, modularity and average path length have a positive correlation with network robustness, whereas clustering coefficient has a negative correlation. We did not find any correlation between scale-free exponent and robustness, or rich-club profiles and robustness. The robustness of small-world networks on the other h...
Topology and dynamics of attractor neural networks: The role of loopiness
Zhang, Pan; Chen, Yong
2008-07-01
We derive an exact representation of the topological effect on the dynamics of sequence processing neural networks within signal-to-noise analysis. A new network structure parameter, loopiness coefficient, is introduced to quantitatively study the loop effect on network dynamics. A large loopiness coefficient means a high probability of finding loops in the networks. We develop recursive equations for the overlap parameters of neural networks in terms of their loopiness. It was found that a large loopiness increases the correlation among the network states at different times and eventually reduces the performance of neural networks. The theory is applied to several network topological structures, including fully-connected, densely-connected random, densely-connected regular and densely-connected small-world, where encouraging results are obtained.
Promoting cooperation by preventing exploitation: The role of network structure
Utkovski, Zoran; Stojkoski, Viktor; Basnarkov, Lasko; Kocarev, Ljupco
2017-08-01
A growing body of empirical evidence indicates that social and cooperative behavior can be affected by cognitive and neurological factors, suggesting the existence of state-based decision-making mechanisms that may have emerged by evolution. Motivated by these observations, we propose a simple mechanism of anonymous network interactions identified as a form of generalized reciprocity—a concept organized around the premise "help anyone if helped by someone'—and study its dynamics on random graphs. In the presence of such a mechanism, the evolution of cooperation is related to the dynamics of the levels of investments (i.e., probabilities of cooperation) of the individual nodes engaging in interactions. We demonstrate that the propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index and discuss relevant implications to natural and artificial systems. To address the robustness of the state-based strategies to an invasion of defectors, we additionally provide an analysis which redefines the results for the case when a fraction of the nodes behave as unconditional defectors.
Global migration topology analysis and modeling of bilateral flow network 2006-2010
Porat, I.; Benguigui, L.
2016-07-01
Migration is one of the most dramatic and vast human processes in modern times. Migration is defined as people that leave their home and home-land and move to a new country. In this research we address the pattern of this massive human movement with the tools of network theory. The undirected global flow migration network (2006-2010) was identified as an exclusive disassortative network which combines two types of defined groups of large- and small-degree (D) countries with betweeness (Be) of Be˜D 3. This structure was modeled and simulated with synthetic networks of similar characteristics as the global flow migration network, and the results suggest that small-degree nodes have the topology of random networks, but the dominant part of the large-degree hubs controls this topology and shapes the network into an ultra-small world. This exclusive topology and the difference of the global flow migration network from scale-free and from Erdös-Rényi networks may be a result of two defined and different topologies of large- and small-degree countries.
Modes of interaction between individuals dominate the topologies of real world networks.
Directory of Open Access Journals (Sweden)
Insuk Lee
Full Text Available We find that the topologies of real world networks, such as those formed within human societies, by the Internet, or among cellular proteins, are dominated by the mode of the interactions considered among the individuals. Specifically, a major dichotomy in previously studied networks arises from modeling networks in terms of pairwise versus group tasks. The former often intrinsically give rise to scale-free, disassortative, hierarchical networks, whereas the latter often give rise to single- or broad-scale, assortative, nonhierarchical networks. These dependencies explain contrasting observations among previous topological analyses of real world complex systems. We also observe this trend in systems with natural hierarchies, in which alternate representations of the same networks, but which capture different levels of the hierarchy, manifest these signature topological differences. For example, in both the Internet and cellular proteomes, networks of lower-level system components (routers within domains or proteins within biological processes are assortative and nonhierarchical, whereas networks of upper-level system components (internet domains or biological processes are disassortative and hierarchical. Our results demonstrate that network topologies of complex systems must be interpreted in light of their hierarchical natures and interaction types.
Modes of interaction between individuals dominate the topologies of real world networks.
Lee, Insuk; Kim, Eiru; Marcotte, Edward M
2015-01-01
We find that the topologies of real world networks, such as those formed within human societies, by the Internet, or among cellular proteins, are dominated by the mode of the interactions considered among the individuals. Specifically, a major dichotomy in previously studied networks arises from modeling networks in terms of pairwise versus group tasks. The former often intrinsically give rise to scale-free, disassortative, hierarchical networks, whereas the latter often give rise to single- or broad-scale, assortative, nonhierarchical networks. These dependencies explain contrasting observations among previous topological analyses of real world complex systems. We also observe this trend in systems with natural hierarchies, in which alternate representations of the same networks, but which capture different levels of the hierarchy, manifest these signature topological differences. For example, in both the Internet and cellular proteomes, networks of lower-level system components (routers within domains or proteins within biological processes) are assortative and nonhierarchical, whereas networks of upper-level system components (internet domains or biological processes) are disassortative and hierarchical. Our results demonstrate that network topologies of complex systems must be interpreted in light of their hierarchical natures and interaction types.
Joint Uplink and Downlink Relay Selection in Cooperative Cellular Networks
Yang, Wei; Wu, Gang; Wang, Haifeng; Wang, Ying
2010-01-01
We consider relay selection technique in a cooperative cellular network where user terminals act as mobile relays to help the communications between base station (BS) and mobile station (MS). A novel relay selection scheme, called Joint Uplink and Downlink Relay Selection (JUDRS), is proposed in this paper. Specifically, we generalize JUDRS in two key aspects: (i) relay is selected jointly for uplink and downlink, so that the relay selection overhead can be reduced, and (ii) we consider to minimize the weighted total energy consumption of MS, relay and BS by taking into account channel quality and traffic load condition of uplink and downlink. Information theoretic analysis of the diversity-multiplexing tradeoff demonstrates that the proposed scheme achieves full spatial diversity in the quantity of cooperating terminals in this network. And numerical results are provided to further confirm a significant energy efficiency gain of the proposed algorithm comparing to the previous best worse channel selection an...
Cooperative Spatial Retreat for Resilient Drone Networks †
Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon
2017-01-01
Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes. PMID:28467390
Cooperative distributed target tracking algorithm in mobile wireless sensor networks
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distrib...
Locomotion trajectory with cooperative metrics in wireless sensor networks
Institute of Scientific and Technical Information of China (English)
QIN Ning-ning; ZHANG Lin; SHAN Xiu-ming; XU Bao-guo
2007-01-01
Detection coverage control is one of the most important topics in the intrusion detection problem of wireless sensor networks (WSN). However, its converse, i.e., to design an object locomotion trajectory in WSN, has not received enough attention. This article proposes a heuristic algorithm, namely, the security & speed (SS) algorithm, to depict such a trajectory that takes into consideration both security and speed. The merit of the SS algorithm is its topology independency. When compared with traditional algorithms, the SS algorithm approaches the optimal trajectory better, and enjoys considerably lower computational load, and a better and adjustable tradeoff between trajectory security and speed.
Optimizing Network Topology to Reduce Aggregate Traffic in Systems of Mobile Robots
Navaravong, Leenhapat; Pasiliao, Eduardo L; Barnette, Gregory L; Dixon, Warren E
2011-01-01
Systems of networked mobile robots, such as unmanned aerial or ground vehicles, will play important roles in future military and commercial applications. The communications for such systems will typically be over wireless links and may require that the robots form an ad hoc network and communicate on a peer-to-peer basis. In this paper, we consider the problem of optimizing the network topology to minimize the total traffic in a network required to support a given set of data flows under constraints on the amount of movement possible at each mobile robot. In this paper, we consider a subclass of this problem in which the initial and final topologies are trees, and the movement restrictions are given in terms of the number of edges in the graph that must be traversed. We develop algorithms to optimize the network topology while maintaining network connectivity during the topology reconfiguration process. Our topology reconfiguration algorithm uses the concept of prefix labelling and routing to move nodes throu...
Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks
Directory of Open Access Journals (Sweden)
Bossard Antoine
2015-12-01
Full Text Available Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia. In this paper we first describe a new topology, torus-connected cycles (TCCs, realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs. Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.
Time of arrival based location estimation for cooperative relay networks
Çelebi, Hasari Burak
2010-09-01
In this paper, we investigate the performance of a cooperative relay network performing location estimation through time of arrival (TOA). We derive Cramer-Rao lower bound (CRLB) for the location estimates using the relay network. The analysis is extended to obtain average CRLB considering the signal fluctuations in both relay and direct links. The effects of the channel fading of both relay and direct links and amplification factor and location of the relay node on average CRLB are investigated. Simulation results show that the channel fading of both relay and direct links and amplification factor and location of relay node affect the accuracy of TOA based location estimation. ©2010 IEEE.
A Cooperative Network Intrusion detection Based on Fuzzy SVMs
Directory of Open Access Journals (Sweden)
Shaohua Teng
2010-04-01
Full Text Available There is a large number of noise in the data obtained from network, which deteriorates intrusion detection performance. To delete the noise data, data preprocessing is done before the construction of hyperplane in support vector machine (SVM. By introducing fuzzy theory into SVM, a new method is proposed for network intrusion detection. Because the attack behavior is different for different network protocol, a different fuzzy membership function is formatted, such that for each class of protocol there is a SVM. To implement this approach, a fuzzy SVM-based cooperative network intrusion detection system with multi-agent architecture is presented. It is composed of three types of agents corresponding to TCP, UDP, and ICMP protocols, respectively. Simulation experiments are done by using KDD CUP 1999 data set, results show that the training time is significantly shortened, storage space requirement is reduced, and classification accuracy is improved.
Network Coded Cooperation Over Time-Varying Channels
DEFF Research Database (Denmark)
Khamfroush, Hana; Lucani Rötter, Daniel Enrique; Barros, joao
2014-01-01
In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying, half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting M packets from source to two receivers...... that are suitable for practical systems. We use two wireless channel models to analyse the performance of the proposed heuristics in practical wireless networks, namely, (a) an infrastructure-to-vehicle (I2V) communication in a highway scenario considering Rayleigh fading, and (b) real packet loss measurements...... for WiFi using Aalborg University’s Raspberry Pi testbed. We compare our results with random linear network coding (RLNC) broadcasting schemes showing that our heuristics can provide up to 2x gains in completion time and up to 4x gains in terms of reliably serviced data packets....
Zhong, Wei; Su, Ruiyi; Gui, Liangjin; Fan, Zijie
2016-06-01
This article proposes a method called the cooperative coevolutionary genetic algorithm with independent ground structures (CCGA-IGS) for the simultaneous topology and sizing optimization of discrete structures. An IGS strategy is proposed to enhance the flexibility of the optimization by offering two separate design spaces and to improve the efficiency of the algorithm by reducing the search space. The CCGA is introduced to divide a complex problem into two smaller subspaces: the topological and sizing variables are assigned into two subpopulations which evolve in isolation but collaborate in fitness evaluations. Five different methods were implemented on 2D and 3D numeric examples to test the performance of the algorithms. The results demonstrate that the performance of the algorithms is improved in terms of accuracy and convergence speed with the IGS strategy, and the CCGA converges faster than the traditional GA without loss of accuracy.
Di Renzo, Marco; Graziosi, Fabio
2011-01-01
In this paper, a multi-source multi-relay cooperative wireless network with binary network coding is studied. The system model encompasses: i) a demodulate-and-forward protocol at the relays, where the received packets are forwarded regardless of their reliability; and ii) a maximum-likelihood optimum decoder at the destination, which accounts for possible decoding errors at the relays. An asymptotically-tight and closed-form expression of the end-to-end error probability is derived, which clearly showcases diversity and coding gain of each source. Unlike other papers available in the literature, the proposed framework has three main distinguishable features: i) it is useful for general network topologies and arbitrary binary encoding vectors; ii) it shows how network code and two-hop forwarding protocol affect diversity and coding gain; and ii) it accounts for realistic fading channels and decoding errors at the relays. The framework provides three main conclusions: i) each source achieves a diversity order ...
Two-port Network Transfer Function for Power Line Topology Modeling
Directory of Open Access Journals (Sweden)
P. Mlynek
2012-04-01
Full Text Available This paper deals with modeling of power line communication. A two-port network model is theoretically described and compared with measurement. A substantial part is focused on the mathematical description of distri¬bution network using the method, which uses chain pa¬rameter matrices describing the relation between input and output voltage and current of the two-port network. This method is used for modeling sample power line topology. Furthermore, taps length and taps impedance influence on the transfer functions for different topology are examined.
Abe, Jun; Bomze, David; Cremasco, Viviana; Scandella, Elke; Stein, Jens V.; Turley, Shannon J.; Ludewig, Burkhard
2016-01-01
Fibroblastic reticular cells (FRCs) form the cellular scaffold of lymph nodes (LNs) and establish distinct microenvironmental niches to provide key molecules that drive innate and adaptive immune responses and control immune regulatory processes. Here, we have used a graph theory-based systems biology approach to determine topological properties and robustness of the LN FRC network in mice. We found that the FRC network exhibits an imprinted small-world topology that is fully regenerated within 4 wk after complete FRC ablation. Moreover, in silico perturbation analysis and in vivo validation revealed that LNs can tolerate a loss of approximately 50% of their FRCs without substantial impairment of immune cell recruitment, intranodal T cell migration, and dendritic cell-mediated activation of antiviral CD8+ T cells. Overall, our study reveals the high topological robustness of the FRC network and the critical role of the network integrity for the activation of adaptive immune responses. PMID:27415420
Novkovic, Mario; Onder, Lucas; Cupovic, Jovana; Abe, Jun; Bomze, David; Cremasco, Viviana; Scandella, Elke; Stein, Jens V; Bocharov, Gennady; Turley, Shannon J; Ludewig, Burkhard
2016-07-01
Fibroblastic reticular cells (FRCs) form the cellular scaffold of lymph nodes (LNs) and establish distinct microenvironmental niches to provide key molecules that drive innate and adaptive immune responses and control immune regulatory processes. Here, we have used a graph theory-based systems biology approach to determine topological properties and robustness of the LN FRC network in mice. We found that the FRC network exhibits an imprinted small-world topology that is fully regenerated within 4 wk after complete FRC ablation. Moreover, in silico perturbation analysis and in vivo validation revealed that LNs can tolerate a loss of approximately 50% of their FRCs without substantial impairment of immune cell recruitment, intranodal T cell migration, and dendritic cell-mediated activation of antiviral CD8+ T cells. Overall, our study reveals the high topological robustness of the FRC network and the critical role of the network integrity for the activation of adaptive immune responses.
DEMAC: A Cluster-Based Topology Control for Ad Hoc Networks
Directory of Open Access Journals (Sweden)
Abhishek Majumder
2010-09-01
Full Text Available The presence of transient network links, mobility and limited battery power of mobile nodes in MANETs poses a hefty challenge for such networks to scale and perform efficiently when subjected to varying network condition. Most of the topology control algorithms proposed have high control overhead to discover and maintain route from source to destination. They also have very high topology maintenance cost. To minimize routing overhead and topology maintenance cost CBRP (Cluster Based Routing Protocol was developed. It performs better than other approaches in most of the cases. In this paper, an energy and mobility aware clustering approach is presented. The clustering approach is incorporated in a DSR like protocol for routing in MANET to evaluate the performance improvement gained due to clustering using proposed approach. Rate of cluster head changes, throughput of the network, delay and routing overhead is evaluated using NS2. Simulation results reveal that proposed approach has better performance in comparison with CBRP.
Directory of Open Access Journals (Sweden)
Mario Novkovic
2016-07-01
Full Text Available Fibroblastic reticular cells (FRCs form the cellular scaffold of lymph nodes (LNs and establish distinct microenvironmental niches to provide key molecules that drive innate and adaptive immune responses and control immune regulatory processes. Here, we have used a graph theory-based systems biology approach to determine topological properties and robustness of the LN FRC network in mice. We found that the FRC network exhibits an imprinted small-world topology that is fully regenerated within 4 wk after complete FRC ablation. Moreover, in silico perturbation analysis and in vivo validation revealed that LNs can tolerate a loss of approximately 50% of their FRCs without substantial impairment of immune cell recruitment, intranodal T cell migration, and dendritic cell-mediated activation of antiviral CD8+ T cells. Overall, our study reveals the high topological robustness of the FRC network and the critical role of the network integrity for the activation of adaptive immune responses.
QoS Adaptive Topology Configuration in Synchronous Wireless Sensor Networks
Institute of Scientific and Technical Information of China (English)
YANG Ting; WU Jiaowen; LI Ang; ZHANG Zhidong
2010-01-01
By using hyper-graph theory,this paper proposes a QoS adaptive topology configuration(QATC)algorithm to effectively control large-scale topology and achieve robust data transmitting in synchronous wireless sensor networks.Firstly,a concise hyper-graph model is abstracted to analyze the large-scale and high-connectivity network.Secondly,based on the control theory of biologic "Cell Mergence",a novel self-adaptive topology configuration algorithm is used to build homologous perceptive data logic sub-network for data aggregation.Compared with Flooding,Directed Diffusion,and Energy Aware Directed Diffusion protocols,the simulation proved that QATC algorithm can save more energy,e.g.,about 23.7% in a large size network,and has less delay than the other algorithms.In dynamic experiments,QATC keeps a robust transmitting quality with 10%,20% and 30% random failure nodes.
Statistical Topology of Three-Dimensional Poisson-Voronoi Cells and Cell Boundary Networks
Lazar, Emanuel A; MacPherson, Robert D; Srolovitz, David J
2014-01-01
Voronoi tessellations of Poisson point processes are widely used for modeling many types of physical and biological systems. In this paper, we analyze simulated Poisson-Voronoi structures containing a total of 250,000,000 cells to provide topological and geometrical statistics of this important class of networks. We also report correlations between some of these topological and geometrical measures. Using these results, we are able to corroborate several conjectures regarding the properties of three-dimensional Poisson-Voronoi networks and refute others. In many cases, we provide accurate fits to these data to aid further analysis. We also demonstrate that topological measures represent powerful tools for describing cellular networks and for distinguishing among different types of networks.
Debnath, Lokenath
2010-01-01
This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Konigsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real…