Reliability and throughput issues for optical wireless and RF wireless systems

NASA Astrophysics Data System (ADS)

Yu, Meng

The fast development of wireless communication technologies has two main trends. On one hand, in point-to-point communications, the demand for higher throughput called for the emergence of wireless broadband techniques including optical wireless (OW). One the other hand, wireless networks are becoming pervasive. New application of wireless networks ask for more flexible system infrastructures beyond the point-to-point prototype to achieve better performance. This dissertation investigates two topics on the reliability and throughput issues of new wireless technologies. The first topic is to study the capacity, and practical forward error control strategies for OW systems. We investigate the performance of OW systems under weak atmospheric turbulence. We first investigate the capacity and power allocation for multi-laser and multi-detector systems. Our results show that uniform power allocation is a practically optimal solution for paralleled channels. We also investigate the performance of Reed Solomon (RS) codes and turbo codes for OW systems. We present RS codes as good candidates for OW systems. The second topic targets user cooperation in wireless networks. We evaluate the relative merits of amplify-forward (AF) and decode-forward (DF) in practical scenarios. Both analysis and simulations show that the overall system performance is critically affected by the quality of the inter-user channel. Following this result, we investigate two schemes to improve the overall system performance. We first investigate the impact of the relay location on the overall system performance and determine the optimal location of relay. A best-selective single-relay 1 system is proposed and evaluated. Through the analysis of the average capacity and outage, we show that a small candidate pool of 3 to 5 relays suffices to reap most of the "geometric" gain available to a selective system. Second, we propose a new user cooperation scheme to provide an effective better inter-user channel. Most user cooperation protocols work in a time sharing manner, where a node forwards others' messages and sends its own message at different sections within a provisioned time slot. In the proposed scheme the two messages are encoded together in a single codework using network coding and transmitted in the given time slot. We also propose a general multiple-user cooperation framework. Under this framework, we show that network coding can achieve better diversity and provide effective better inter-user channels than time sharing. The last part of the dissertation focuses on multi-relay packet transmission. We propose an adaptive and distributive coding scheme for the relay nodes to adaptively cooperate and forward messages. The adaptive scheme shows performance gain over fixed schemes. Then we shift our viewpoint and represent the network as part of encoders and part of decoders.

Static network structure can stabilize human cooperation.

PubMed

Rand, David G; Nowak, Martin A; Fowler, James H; Christakis, Nicholas A

2014-12-02

The evolution of cooperation in network-structured populations has been a major focus of theoretical work in recent years. When players are embedded in fixed networks, cooperators are more likely to interact with, and benefit from, other cooperators. In theory, this clustering can foster cooperation on fixed networks under certain circumstances. Laboratory experiments with humans, however, have thus far found no evidence that fixed network structure actually promotes cooperation. Here, we provide such evidence and help to explain why others failed to find it. First, we show that static networks can lead to a stable high level of cooperation, outperforming well-mixed populations. We then systematically vary the benefit that cooperating provides to one's neighbors relative to the cost required to cooperate (b/c), as well as the average number of neighbors in the network (k). When b/c > k, we observe high and stable levels of cooperation. Conversely, when b/c ≤ k or players are randomly shuffled, cooperation decays. Our results are consistent with a quantitative evolutionary game theoretic prediction for when cooperation should succeed on networks and, for the first time to our knowledge, provide an experimental demonstration of the power of static network structure for stabilizing human cooperation.

Static network structure can stabilize human cooperation

PubMed Central

Rand, David G.; Nowak, Martin A.; Fowler, James H.; Christakis, Nicholas A.

2014-01-01

The evolution of cooperation in network-structured populations has been a major focus of theoretical work in recent years. When players are embedded in fixed networks, cooperators are more likely to interact with, and benefit from, other cooperators. In theory, this clustering can foster cooperation on fixed networks under certain circumstances. Laboratory experiments with humans, however, have thus far found no evidence that fixed network structure actually promotes cooperation. Here, we provide such evidence and help to explain why others failed to find it. First, we show that static networks can lead to a stable high level of cooperation, outperforming well-mixed populations. We then systematically vary the benefit that cooperating provides to one’s neighbors relative to the cost required to cooperate (b/c), as well as the average number of neighbors in the network (k). When b/c > k, we observe high and stable levels of cooperation. Conversely, when b/c ≤ k or players are randomly shuffled, cooperation decays. Our results are consistent with a quantitative evolutionary game theoretic prediction for when cooperation should succeed on networks and, for the first time to our knowledge, provide an experimental demonstration of the power of static network structure for stabilizing human cooperation. PMID:25404308

Contagion of Cooperation in Static and Fluid Social Networks.

PubMed

Jordan, Jillian J; Rand, David G; Arbesman, Samuel; Fowler, James H; Christakis, Nicholas A

2013-01-01

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-based interventions aiming at increasing cooperative behavior.

The narrow gap between norms and cooperative behaviour in a reindeer herding community

PubMed Central

2018-01-01

Cooperation evolves on social networks and is shaped, in part, by norms: beliefs and expectations about the behaviour of others or of oneself. Networks of cooperative social partners and associated norms are vital for pastoralists, such as Saami reindeer herders in northern Norway. However, little is known quantitatively about how norms structure pastoralists' social networks or shape cooperation. Saami herders reported their social networks and participated in field experiments, allowing us to gauge the overlap between reported and emergent cooperation. We show that individuals' perceptions of reciprocal cooperation within their social networks exceeded actual reciprocity, although both occurred frequently and were concentrated within herding groups. Herders with more extensive cooperation networks received more rewards in an economic game. Although herders overestimated reciprocal helping, cooperation in this community was still extensive, suggesting that perceived norms potentially allow network structures promoting cooperation to emerge and be maintained. PMID:29515842

Dynamic social networks promote cooperation in experiments with humans

PubMed Central

Rand, David G.; Arbesman, Samuel; Christakis, Nicholas A.

2011-01-01

Human populations are both highly cooperative and highly organized. Human interactions are not random but rather are structured in social networks. Importantly, ties in these networks often are dynamic, changing in response to the behavior of one's social partners. This dynamic structure permits an important form of conditional action that has been explored theoretically but has received little empirical attention: People can respond to the cooperation and defection of those around them by making or breaking network links. Here, we present experimental evidence of the power of using strategic link formation and dissolution, and the network modification it entails, to stabilize cooperation in sizable groups. Our experiments explore large-scale cooperation, where subjects’ cooperative actions are equally beneficial to all those with whom they interact. Consistent with previous research, we find that cooperation decays over time when social networks are shuffled randomly every round or are fixed across all rounds. We also find that, when networks are dynamic but are updated only infrequently, cooperation again fails. However, when subjects can update their network connections frequently, we see a qualitatively different outcome: Cooperation is maintained at a high level through network rewiring. Subjects preferentially break links with defectors and form new links with cooperators, creating an incentive to cooperate and leading to substantial changes in network structure. Our experiments confirm the predictions of a set of evolutionary game theoretic models and demonstrate the important role that dynamic social networks can play in supporting large-scale human cooperation. PMID:22084103

A quantum network of clocks

NASA Astrophysics Data System (ADS)

Kómár, P.; Kessler, E. M.; Bishof, M.; Jiang, L.; Sørensen, A. S.; Ye, J.; Lukin, M. D.

2014-08-01

The development of precise atomic clocks plays an increasingly important role in modern society. Shared timing information constitutes a key resource for navigation with a direct correspondence between timing accuracy and precision in applications such as the Global Positioning System. By combining precision metrology and quantum networks, we propose a quantum, cooperative protocol for operating a network of geographically remote optical atomic clocks. Using nonlocal entangled states, we demonstrate an optimal utilization of global resources, and show that such a network can be operated near the fundamental precision limit set by quantum theory. Furthermore, the internal structure of the network, combined with quantum communication techniques, guarantees security both from internal and external threats. Realization of such a global quantum network of clocks may allow construction of a real-time single international time scale (world clock) with unprecedented stability and accuracy.

Professional development in photonics: the advanced technology education projects of the New England Board of Education

NASA Astrophysics Data System (ADS)

Donnelly, Judith; Hanes, Fenna; Massa, Nicholas

2007-09-01

Since 1995, the New England Board of Education (NEBHE) has been providing curriculum and professional development as well as laboratory improvement in optics/photonics to middle school and high school teachers and college faculty across the United States. With funding from the National Science Foundation's Advanced Technology Education program, NEBHE's optics/photonics education projects have created a national network of educational and industry alliances resulting in opportunities in optics and photonics for students at participating schools and colleges. The cornerstone of NEBHE projects is collaboration among educational levels, career counselors and teachers/faculty, and industry and academia. In such a rich atmosphere of cooperation, participants have been encouraged to create their own regional projects and activities involving students from middle school through four-year universities. In this paper we will describe the evolution of teacher/faculty professional development from a traditional week-long summer workshop to a collaborative distance learning laboratory course based on adult learning principles and supported by a national network of industry mentors.

A quantum network of clocks

NASA Astrophysics Data System (ADS)

Komar, Peter; Kessler, Eric; Bishof, Michael; Jiang, Liang; Sorensen, Anders; Ye, Jun; Lukin, Mikhail

2014-05-01

Shared timing information constitutes a key resource for positioning and navigation with a direct correspondence between timing accuracy and precision in applications such as the Global Positioning System (GPS). By combining precision metrology and quantum networks, we propose here a quantum, cooperative protocol for the operation of a network consisting of geographically remote optical atomic clocks. Using non-local entangled states, we demonstrate an optimal utilization of the global network resources, and show that such a network can be operated near the fundamental limit set by quantum theory yielding an ultra-precise clock signal. Furthermore, the internal structure of the network, combined with basic techniques from quantum communication, guarantees security both from internal and external threats. Realization of such a global quantum network of clocks may allow construction of a real-time single international time scale (world clock) with unprecedented stability and accuracy. See also: Komar et al. arXiv:1310.6045 (2013) and Kessler et al. arXiv:1310.6043 (2013).

Emergence of cooperation in non-scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting

2014-06-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 cooperation in complex networks.

Punishment diminishes the benefits of network reciprocity in social dilemma experiments

PubMed Central

Li, Xuelong; Wang, Zhen; Li, Huijia; Shi, Lei; Podobnik, Boris; Havlin, Shlomo; Boccaletti, Stefano

2018-01-01

Network reciprocity has been widely advertised in theoretical studies as one of the basic cooperation-promoting mechanisms, but experimental evidence favoring this type of reciprocity was published only recently. When organized in an unchanging network of social contacts, human subjects cooperate provided the following strict condition is satisfied: The benefit of cooperation must outweigh the total cost of cooperating with all neighbors. In an attempt to relax this condition, we perform social dilemma experiments wherein network reciprocity is aided with another theoretically hypothesized cooperation-promoting mechanism—costly punishment. The results reveal how networks promote and stabilize cooperation. This stabilizing effect is stronger in a smaller-size neighborhood, as expected from theory and experiments. Contrary to expectations, punishment diminishes the benefits of network reciprocity by lowering assortment, payoff per round, and award for cooperative behavior. This diminishing effect is stronger in a larger-size neighborhood. An immediate implication is that the psychological effects of enduring punishment override the rational response anticipated in quantitative models of cooperation in networks. PMID:29259113

Cooperative Resource Pricing in Service Overlay Networks for Mobile Agents

NASA Astrophysics Data System (ADS)

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.

Cooperation in the prisoner's dilemma game on tunable community networks

NASA Astrophysics Data System (ADS)

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.

Costs for switching partners reduce network dynamics but not cooperative behaviour

PubMed Central

Bednarik, Peter; Fehl, Katrin; Semmann, Dirk

2014-01-01

Social networks represent the structuring of interactions between group members. Above all, many interactions are profoundly cooperative in humans and other animals. In accordance with this natural observation, theoretical work demonstrates that certain network structures favour the evolution of cooperation. Yet, recent experimental evidence suggests that static networks do not enhance cooperative behaviour in humans. By contrast, dynamic networks do foster cooperation. However, costs associated with dynamism such as time or resource investments in finding and establishing new partnerships have been neglected so far. Here, we show that human participants are much less likely to break links when costs arise for building new links. Especially, when costs were high, the network was nearly static. Surprisingly, cooperation levels in Prisoner's Dilemma games were not affected by reduced dynamism in social networks. We conclude that the mere potential to quit collaborations is sufficient in humans to reach high levels of cooperative behaviour. Effects of self-structuring processes or assortment on the network played a minor role: participants simply adjusted their cooperative behaviour in response to the threats of losing a partner or of being expelled. PMID:25122233

Social dilemmas in an online social network: The structure and evolution of cooperation

NASA Astrophysics Data System (ADS)

Fu, Feng; Chen, Xiaojie; Liu, Lianghuan; Wang, Long

2007-11-01

We investigate two paradigms for studying the evolution of cooperation—Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

Promotion of cooperation induced by two-sided players in prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Su, Zhen; Li, Lixiang; Xiao, Jinghua; Podobnik, B.; Stanley, H. Eugene

2018-01-01

We examine how real-world individuals and companies can either reach an agreement or fail to reach an agreement after several stages of negotiation. We use a modified prisoner's dilemma game with two-sided players who can either cooperate or not cooperate with their neighbors. We find that the presence of even a small number of these two-sided players substantially promotes the cooperation because, unlike the rock-paper-scissors scenario, when the cooperators change to the non-cooperators to gain a payoff, they can turn to the two-sided players and continue negotiating. We find that the network structure influences the spread of strategies. Lattice and regular-random (RR) networks benefit the spread of both non-cooperation and two-sided strategies, but scale-free (SF) networks stop both strategies. We also find that the Erdös-R e ´ nyi (ER) network promotes the two-sided strategy and blocks the spread of non-cooperation. As the ER network density decreases, and the network degree is lowered the lifetime of non-cooperators increases. Our results expand our understanding of the role played by the two-sided strategy in the growth of the cooperative behavior in networks.

Punishment diminishes the benefits of network reciprocity in social dilemma experiments.

PubMed

Li, Xuelong; Jusup, Marko; Wang, Zhen; Li, Huijia; Shi, Lei; Podobnik, Boris; Stanley, H Eugene; Havlin, Shlomo; Boccaletti, Stefano

2018-01-02

Network reciprocity has been widely advertised in theoretical studies as one of the basic cooperation-promoting mechanisms, but experimental evidence favoring this type of reciprocity was published only recently. When organized in an unchanging network of social contacts, human subjects cooperate provided the following strict condition is satisfied: The benefit of cooperation must outweigh the total cost of cooperating with all neighbors. In an attempt to relax this condition, we perform social dilemma experiments wherein network reciprocity is aided with another theoretically hypothesized cooperation-promoting mechanism-costly punishment. The results reveal how networks promote and stabilize cooperation. This stabilizing effect is stronger in a smaller-size neighborhood, as expected from theory and experiments. Contrary to expectations, punishment diminishes the benefits of network reciprocity by lowering assortment, payoff per round, and award for cooperative behavior. This diminishing effect is stronger in a larger-size neighborhood. An immediate implication is that the psychological effects of enduring punishment override the rational response anticipated in quantitative models of cooperation in networks. Copyright © 2017 the Author(s). Published by PNAS.

How mutation alters the evolutionary dynamics of cooperation on networks

NASA Astrophysics Data System (ADS)

Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

2018-05-01

Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

Cooperative Learning for Distributed In-Network Traffic Classification

NASA Astrophysics Data System (ADS)

Joseph, S. B.; Loo, H. R.; Ismail, I.; Andromeda, T.; Marsono, M. N.

2017-04-01

Inspired by the concept of autonomic distributed/decentralized network management schemes, we consider the issue of information exchange among distributed network nodes to network performance and promote scalability for in-network monitoring. In this paper, we propose a cooperative learning algorithm for propagation and synchronization of network information among autonomic distributed network nodes for online traffic classification. The results show that network nodes with sharing capability perform better with a higher average accuracy of 89.21% (sharing data) and 88.37% (sharing clusters) compared to 88.06% for nodes without cooperative learning capability. The overall performance indicates that cooperative learning is promising for distributed in-network traffic classification.

Direct Nanoscale Characterization of Submolecular Mobility in Complex Organic Non-linear Optical Systems

NASA Astrophysics Data System (ADS)

Knorr, Daniel; Gray, Tomoko; Kim, Tae-Dong; Luo, Jingdong; Jen, Alex; Overney, Rene

2008-03-01

For organic non-linear optical (NLO) materials composed of intricate molecular building blocks, the challenge is to deduce meaningful molecular scale mobility information to understand complex relaxation and phase behavior. This is crucial, as the process of achieving a robust acentric alignment strongly depends on the availability of inter- and intra-molecular mobilities outside the temperature range of the device operation window. Here, we introduce a nanoscale methodology based on scanning probe microscopy that provides direct insight into structural relaxations and shows great potential to direct material design of sophisticated macromolecules. It also offers a means by which mesoscale dynamics and cooperativity involved in relaxation processes can be quantified in terms of dynamic entropy and enthalpy. This study demonstrates this methodology to describe the mesocale dynamics of two systems (1) organic networking dendronized NLO molecular glasses that self-assemble into physically linked polymers due to quadrupolar phenyl-perfluorophenyl interactions and (2) dendronized side-chain electro-optic (EO) polymers. For the self assembling glasses, the degree of intermolecular cooperativity can be deduced using this methodology, while for the dendronized side-chain polymers, specific side chain mobilities are exploited to improve EO properties.

Collaborative video caching scheme over OFDM-based long-reach passive optical networks

NASA Astrophysics Data System (ADS)

Li, Yan; Dai, Shifang; Chang, Xiangmao

2018-07-01

Long-reach passive optical networks (LR-PONs) are now considered as a desirable access solution for cost-efficiently delivering broadband services by integrating metro network with access network, among which orthogonal frequency division multiplexing (OFDM)-based LR-PONs gain greater research interests due to their good robustness and high spectrum efficiency. In such attractive OFDM-based LR-PONs, however, it is still challenging to effectively provide video service, which is one of the most popular and profitable broadband services, for end users. Given that more video requesters (i.e., end users) far away from optical line terminal (OLT) are served in OFDM-based LR-PONs, it is efficiency-prohibitive to use traditional video delivery model, which relies on the OLT to transmit videos to requesters, for providing video service, due to the model will incur not only larger video playback delay but also higher downstream bandwidth consumption. In this paper, we propose a novel video caching scheme that to collaboratively cache videos on distributed optical network units (ONUs) which are closer to end users, and thus to timely and cost-efficiently provide videos for requesters by ONUs over OFDM-based LR-PONs. We firstly construct an OFDM-based LR-PON architecture to enable the cooperation among ONUs while caching videos. Given a limited storage capacity of each ONU, we then propose collaborative approaches to cache videos on ONUs with the aim to maximize the local video hit ratio (LVHR), i.e., the proportion of video requests that can be directly satisfied by ONUs, under diverse resources requirements and requests distributions of videos. Simulations are finally conducted to evaluate the efficiency of our proposed scheme.

The evolution of cooperation on geographical networks

NASA Astrophysics Data System (ADS)

Li, Yixiao; Wang, Yi; Sheng, Jichuan

2017-11-01

We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.

An Effect of the Co-Operative Network Model for Students' Quality in Thai Primary Schools

ERIC Educational Resources Information Center

Khanthaphum, Udomsin; Tesaputa, Kowat; Weangsamoot, Visoot

2016-01-01

This research aimed: 1) to study the current and desirable states of the co-operative network in developing the learners' quality in Thai primary schools, 2) to develop a model of the co-operative network in developing the learners' quality, and 3) to examine the results of implementation of the co-operative network model in the primary school.…

Motif structure and cooperation in real-world complex networks

NASA Astrophysics Data System (ADS)

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.

Social networks and cooperation in hunter-gatherers.

PubMed

Apicella, Coren L; Marlowe, Frank W; Fowler, James H; Christakis, Nicholas A

2012-01-25

Social networks show striking structural regularities, and both theory and evidence suggest that networks may have facilitated the development of large-scale cooperation in humans. Here, we characterize the social networks of the Hadza, a population of hunter-gatherers in Tanzania. We show that Hadza networks have important properties also seen in modernized social networks, including a skewed degree distribution, degree assortativity, transitivity, reciprocity, geographic decay and homophily. We demonstrate that Hadza camps exhibit high between-group and low within-group variation in public goods game donations. Network ties are also more likely between people who give the same amount, and the similarity in cooperative behaviour extends up to two degrees of separation. Social distance appears to be as important as genetic relatedness and physical proximity in explaining assortativity in cooperation. Our results suggest that certain elements of social network structure may have been present at an early point in human history. Also, early humans may have formed ties with both kin and non-kin, based in part on their tendency to cooperate. Social networks may thus have contributed to the emergence of cooperation.

The maintenance of cooperation in multiplex networks with limited and partible resources of agents

NASA Astrophysics Data System (ADS)

Li, Zhaofeng; Shen, Bi; Jiang, Yichuan

2017-02-01

In this paper, we try to explain the maintenance of cooperation in multiplex networks with limited and partible resources of agents: defection brings larger short-term benefit and cooperative agents may become defective because of the unaffordable costs of cooperative behaviors that are performed in multiple layers simultaneously. Recent studies have identified the positive effects of multiple layers on evolutionary cooperation but generally overlook the maximum costs of agents in these synchronous games. By utilizing network effects and designing evolutionary mechanisms, cooperative behaviors become prevailing in public goods games, and agents can allocate personal resources across multiple layers. First, we generalize degree diversity into multiplex networks to improve the prospect for cooperation. Second, to prevent agents allocating all the resources into one layer, a greedy-first mechanism is proposed, in which agents prefer to add additional investments in the higher-payoff layer. It is found that greedy-first agents can perform cooperative behaviors in multiplex networks when one layer is scale-free network and degree differences between conjoint nodes increase. Our work may help to explain the emergence of cooperation in the absence of individual reputation and punishment mechanisms.

SISL and SIRL: Two knowledge dissemination models with leader nodes on cooperative learning networks

NASA Astrophysics Data System (ADS)

Li, Jingjing; Zhang, Yumei; Man, Jiayu; Zhou, Yun; Wu, Xiaojun

2017-02-01

Cooperative learning is one of the most effective teaching methods, which has been widely used. Students' mutual contact forms a cooperative learning network in this process. Our previous research demonstrated that the cooperative learning network has complex characteristics. This study aims to investigating the dynamic spreading process of the knowledge in the cooperative learning network and the inspiration of leaders in this process. To this end, complex network transmission dynamics theory is utilized to construct the knowledge dissemination model of a cooperative learning network. Based on the existing epidemic models, we propose a new susceptible-infected-susceptible-leader (SISL) model that considers both students' forgetting and leaders' inspiration, and a susceptible-infected-removed-leader (SIRL) model that considers students' interest in spreading and leaders' inspiration. The spreading threshold λcand its impact factors are analyzed. Then, numerical simulation and analysis are delivered to reveal the dynamic transmission mechanism of knowledge and leaders' role. This work is of great significance to cooperative learning theory and teaching practice. It also enriches the theory of complex network transmission dynamics.

Optical design of transmitter lens for asymmetric distributed free space optical networks

NASA Astrophysics Data System (ADS)

Wojtanowski, Jacek; Traczyk, Maciej

2018-05-01

We present a method of transmitter lens design dedicated for light distribution shaping on a curved and asymmetric target. In this context, target is understood as a surface determined by hypothetical optical detectors locations. In the proposed method, ribbon-like surfaces of arbitrary shape are considered. The designed lens has the task to transform collimated and generally non-uniform input beam into desired irradiance distribution on such irregular targets. Desired irradiance is associated with space-dependant efficiency of power flow between the source and receivers distributed on the target surface. This unconventional nonimaging task is different from most illumination or beam shaping objectives, where constant or prescribed irradiance has to be produced on a flat target screen. The discussed optical challenge comes from the applications where single transmitter cooperates with multitude of receivers located in various positions in space and oriented in various directions. The proposed approach is not limited to optical networks, but can be applied in a variety of other applications where nonconventional irradiance distribution has to be engineered. The described method of lens design is based on geometrical optics, radiometry and ray mapping philosophy. Rays are processed as a vector field, each of them carrying a certain amount of power. Having the target surface shape and orientation of receivers distribution, the rays-surface crossings map is calculated. It corresponds to the output rays vector field, which is referred to the calculated input rays spatial distribution on the designed optical surface. The application of Snell's law in a vector form allows one to obtain surface local normal vector and calculate lens profile. In the paper, we also present the case study dealing with exemplary optical network. The designed freeform lens is implemented in commercially available optical design software and irradiance three-dimensional spatial distribution is examined, showing perfect agreement with expectations.

Network flow of mobile agents enhances the evolution of cooperation

NASA Astrophysics Data System (ADS)

Ichinose, G.; Satotani, Y.; Nagatani, T.

2018-01-01

We study the effect of contingent movement on the persistence of cooperation on complex networks with empty nodes. Each agent plays the Prisoner's Dilemma game with its neighbors and then it either updates the strategy depending on the payoff difference with neighbors or it moves to another empty node if not satisfied with its own payoff. If no neighboring node is empty, each agent stays at the same site. By extensive evolutionary simulations, we show that the medium density of agents enhances cooperation where the network flow of mobile agents is also medium. Moreover, if the movements of agents are more frequent than the strategy updating, cooperation is further promoted. In scale-free networks, the optimal density for cooperation is lower than other networks because agents get stuck at hubs. Our study suggests that keeping a smooth network flow is significant for the persistence of cooperation in ever-changing societies.

Cooperation and Contagion in Web-Based, Networked Public Goods Experiments

PubMed Central

Suri, Siddharth; Watts, Duncan J.

2011-01-01

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

Cooperation and contagion in web-based, networked public goods experiments.

PubMed

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.

Determinants of public cooperation in multiplex networks

NASA Astrophysics Data System (ADS)

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.

Cooperation in N-person evolutionary snowdrift game in scale-free Barabási Albert networks

NASA Astrophysics Data System (ADS)

Lee, K. H.; Chan, Chun-Him; Hui, P. M.; Zheng, Da-Fang

2008-09-01

Cooperation in the N-person evolutionary snowdrift game (NESG) is studied in scale-free Barabási-Albert (BA) networks. Due to the inhomogeneity of the network, two versions of NESG are proposed and studied. In a model where the size of the competing group varies from agent to agent, the fraction of cooperators drops as a function of the payoff parameter. The networking effect is studied via the fraction of cooperative agents for nodes with a particular degree. For small payoff parameters, it is found that the small- k agents are dominantly cooperators, while large- k agents are of non-cooperators. Studying the spatial correlation reveals that cooperative agents will avoid to be nearest neighbors and the correlation disappears beyond the next-nearest neighbors. The behavior can be explained in terms of the networking effect and payoffs. In another model with a fixed size of competing groups, the fraction of cooperators could show a non-monotonic behavior in the regime of small payoff parameters. This non-trivial behavior is found to be a combined effect of the many agents with the smallest degree in the BA network and the increasing fraction of cooperators among these agents with the payoff for small payoffs.

Learning and innovative elements of strategy adoption rules expand cooperative network topologies.

PubMed

Wang, Shijun; Szalay, Máté S; Zhang, Changshui; Csermely, Peter

2008-04-09

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.

Sparse cliques trump scale-free networks in coordination and competition

PubMed Central

Gianetto, David A.; Heydari, Babak

2016-01-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game. PMID:26899456

Sparse cliques trump scale-free networks in coordination and competition

NASA Astrophysics Data System (ADS)

Gianetto, David A.; Heydari, Babak

2016-02-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.

Axelrod's Metanorm Games on Networks

PubMed Central

Galán, José M.; Łatek, Maciej M.; Rizi, Seyed M. Mussavi

2011-01-01

Metanorms is a mechanism proposed to promote cooperation in social dilemmas. Recent experimental results show that network structures that underlie social interactions influence the emergence of norms that promote cooperation. We generalize Axelrod's analysis of metanorms dynamics to interactions unfolding on networks through simulation and mathematical modeling. Network topology strongly influences the effectiveness of the metanorms mechanism in establishing cooperation. In particular, we find that average degree, clustering coefficient and the average number of triplets per node play key roles in sustaining or collapsing cooperation. PMID:21655211

Relay Selection for Cooperative Relaying in Wireless Energy Harvesting Networks

NASA Astrophysics Data System (ADS)

Zhu, Kaiyan; Wang, Fei; Li, Songsong; Jiang, Fengjiao; Cao, Lijie

2018-01-01

Energy harvesting from the surroundings is a promising solution to provide energy supply and extend the life of wireless sensor networks. Recently, energy harvesting has been shown as an attractive solution to prolong the operation of cooperative networks. In this paper, we propose a relay selection scheme to optimize the amplify-and-forward (AF) cooperative transmission in wireless energy harvesting cooperative networks. The harvesting energy and channel conditions are considered to select the optimal relay as cooperative relay to minimize the outage probability of the system. Simulation results show that our proposed relay selection scheme achieves better outage performance than other strategies.

Social Networks and Cooperation in Hunter-Gatherers

PubMed Central

Apicella, Coren L.; Marlowe, Frank W.; Fowler, James H.; Christakis, Nicholas A.

2011-01-01

Social networks exhibit striking structural regularities1,2, and theory and evidence suggest that they may have played a role in the development of large-scale cooperation in humans3–7. Here, we characterize the social networks of the Hadza, an evolutionarily relevant population of hunter-gatherers8. We show that Hadza networks exhibit important properties also seen in modernized networks, including a skewed degree distribution, degree assortativity, transitivity, reciprocity, geographic decay, and homophily. Moreover, we demonstrate that Hadza camps exhibit high between-group and low within-group variation in public goods game donations. Network ties are also more likely between people who give the same amount, and the similarity in cooperative behaviour extends up to two degrees of separation. Finally, social distance appears to be as important as genetic relatedness and physical proximity in explaining assortativity in cooperation. Our results suggest that certain elements of social network structure may have been present at an early point in human history; that early humans may have formed ties with both kin and non-kin based, in part, on their tendency to cooperate; and that social networks may have contributed to the emergence of cooperation. PMID:22281599

Cooperative Vehicular Networking: A Survey

PubMed Central

Ahmed, Ejaz

2018-01-01

With the remarkable progress of cooperative communication technology in recent years, its transformation to vehicular networking is gaining momentum. Such a transformation has brought a new research challenge in facing the realization of cooperative vehicular networking (CVN). This paper presents a comprehensive survey of recent advances in the field of CVN. We cover important aspects of CVN research, including physical, medium access control, and routing protocols, as well as link scheduling and security. We also classify these research efforts in a taxonomy of cooperative vehicular networks. A set of key requirements for realizing the vision of cooperative vehicular networks is then identified and discussed. We also discuss open research challenges in enabling CVN. Lastly, the paper concludes by highlighting key points of research and future directions in the domain of CVN. PMID:29881331

Dependency links can hinder the evolution of cooperation in the prisoner's dilemma game on lattices and networks.

PubMed

Wang, Xuwen; Nie, Sen; Wang, Binghong

2015-01-01

Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whose value is between the payoff of mutual cooperation and the value of temptation to defect. Thus, this mechanism reflects that the dependency relation is stronger than the relation of ordinary mutual cooperation, but it is not large enough to cause the defection of the dependency pair. We show that the dependence of individuals hinders, promotes and never affects the cooperation on regular ring networks, square lattice, random and scale-free networks, respectively. The results for the square lattice and regular ring networks are demonstrated by the pair approximation.

An Energy Efficient Cooperative Hierarchical MIMO Clustering Scheme for Wireless Sensor Networks

PubMed Central

Nasim, Mehwish; Qaisar, Saad; Lee, Sungyoung

2012-01-01

In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO) communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO) clustering scheme and traditional multihop Single-Input-Single-Output (SISO) routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes. PMID:22368459

Quality versus quantity of social ties in experimental cooperative networks.

PubMed

Shirado, Hirokazu; Fu, Feng; Fowler, James H; Christakis, Nicholas A

2013-01-01

Recent studies suggest that allowing individuals to choose their partners can help to maintain cooperation in human social networks; this behaviour can supplement behavioural reciprocity, whereby humans are influenced to cooperate by peer pressure. However, it is unknown how the rate of forming and breaking social ties affects our capacity to cooperate. Here we use a series of online experiments involving 1,529 unique participants embedded in 90 experimental networks, to show that there is a 'Goldilocks' effect of network dynamism on cooperation. When the rate of change in social ties is too low, subjects choose to have many ties, even if they attach to defectors. When the rate is too high, cooperators cannot detach from defectors as much as defectors re-attach and, hence, subjects resort to behavioural reciprocity and switch their behaviour to defection. Optimal levels of cooperation are achieved at intermediate levels of change in social ties.

Quality versus quantity of social ties in experimental cooperative networks

PubMed Central

Shirado, Hirokazu; Fu, Feng; Fowler, James H.; Christakis, Nicholas A.

2013-01-01

Recent studies suggest that allowing individuals to choose their partners can help to maintain cooperation in human social networks; this behaviour can supplement behavioural reciprocity, whereby humans are influenced to cooperate by peer pressure. However, it is unknown how the rate of forming and breaking social ties affects our capacity to cooperate. Here we use a series of online experiments involving 1,529 unique participants embedded in 90 experimental networks, to show that there is a ‘Goldilocks’ effect of network dynamism on cooperation. When the rate of change in social ties is too low, subjects choose to have many ties, even if they attach to defectors. When the rate is too high, cooperators cannot detach from defectors as much as defectors re-attach and, hence, subjects resort to behavioural reciprocity and switch their behaviour to defection. Optimal levels of cooperation are achieved at intermediate levels of change in social ties. PMID:24226079

Dynamic social networks facilitate cooperation in the N-player Prisoner’s Dilemma

NASA Astrophysics Data System (ADS)

Rezaei, Golriz; Kirley, Michael

2012-12-01

Understanding how cooperative behaviour evolves in network communities, where the individual members interact via social dilemma games, is an on-going challenge. In this paper, we introduce a social network based model to investigate the evolution of cooperation in the N-player Prisoner’s Dilemma game. As such, this work complements previous studies focused on multi-player social dilemma games and endogenous networks. Agents in our model, employ different game-playing strategies reflecting varying cognitive capacities. When an agent plays cooperatively, a social link is formed with each of the other N-1 group members. Subsequent cooperative actions reinforce this link. However, when an agent defects, the links in the social network are broken. Computational simulations across a range of parameter settings are used to examine different scenarios: varying population and group sizes; the group formation process (or partner selection); and agent decision-making strategies under varying dilemma constraints (cost-to-benefit ratios), including a “discriminator” strategy where the action is based on a function of the weighted links within an agent’s social network. The simulation results show that the proposed social network model is able to evolve and maintain cooperation. As expected, as the value of N increases the equilibrium proportion of cooperators in the population decreases. In addition, this outcome is dependent on the dilemma constraint (cost-to-benefit ratio). However, in some circumstances the dynamic social network plays an increasingly important role in promoting and sustaining cooperation, especially when the agents adopt the discriminator strategy. The adjustment of social links results in the formation of communities of “like-minded” agents. Subsequently, this local optimal behaviour promotes the evolution of cooperative behaviour at the system level.

Cooperation prevails when individuals adjust their social ties.

PubMed

Santos, Francisco C; Pacheco, Jorge M; Lenaerts, Tom

2006-10-20

Conventional evolutionary game theory predicts that natural selection favours the selfish and strong even though cooperative interactions thrive at all levels of organization in living systems. Recent investigations demonstrated that a limiting factor for the evolution of cooperative interactions is the way in which they are organized, cooperators becoming evolutionarily competitive whenever individuals are constrained to interact with few others along the edges of networks with low average connectivity. Despite this insight, the conundrum of cooperation remains since recent empirical data shows that real networks exhibit typically high average connectivity and associated single-to-broad-scale heterogeneity. Here, a computational model is constructed in which individuals are able to self-organize both their strategy and their social ties throughout evolution, based exclusively on their self-interest. We show that the entangled evolution of individual strategy and network structure constitutes a key mechanism for the sustainability of cooperation in social networks. For a given average connectivity of the population, there is a critical value for the ratio W between the time scales associated with the evolution of strategy and of structure above which cooperators wipe out defectors. Moreover, the emerging social networks exhibit an overall heterogeneity that accounts very well for the diversity of patterns recently found in acquired data on social networks. Finally, heterogeneity is found to become maximal when W reaches its critical value. These results show that simple topological dynamics reflecting the individual capacity for self-organization of social ties can produce realistic networks of high average connectivity with associated single-to-broad-scale heterogeneity. On the other hand, they show that cooperation cannot evolve as a result of "social viscosity" alone in heterogeneous networks with high average connectivity, requiring the additional mechanism of topological co-evolution to ensure the survival of cooperative behaviour.

Simultaneously selecting appropriate partners for gaming and strategy adaptation to enhance network reciprocity in the prisoner's dilemma

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2014-01-01

Network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium in 2 × 2 prisoner's dilemma games. Previous studies have shown that cooperation can be enhanced by using a skewed, rather than a random, selection of partners for either strategy adaptation or the gaming process. Here we show that combining both processes for selecting a gaming partner and an adaptation partner further enhances cooperation, provided that an appropriate selection rule and parameters are adopted. We also show that this combined model significantly enhances cooperation by reducing the degree of activity in the underlying network; we measure the degree of activity with a quantity called effective degree. More precisely, during the initial evolutionary stage in which the global cooperation fraction declines because initially allocated cooperators becoming defectors, the model shows that weak cooperative clusters perish and only a few strong cooperative clusters survive. This finding is the most important key to attaining significant network reciprocity.

The Solaris-Panoptes Global Network of Robotic Telescopes and the Borowiec Satellite Laser Ranging System for SST: A Progress Report

NASA Astrophysics Data System (ADS)

Konacki, M.; Lejba, P.; Sybilski, P.; Pawłaszek, R.; Kozłowski, S.; Suchodolski, T.; Słonina, M.; Litwicki, M.; Sybilska, A.; Rogowska, B.; Kolb, U.; Burwitz, V.; Baader, J.; Groot, P.; Bloemen, S.; Ratajczak, M.; Hełminiak, K.; Borek, R.; Chodosiewicz, P.; Chimicz, A.

We present an update on the preparation of our assets that consists of a robotic network of eight optical telescopes and a laser ranging station for regular services in the SST domain. We report the development of new optical assets that include a double telescope system, Panoptes-1AB, and a new astrograph on our Solaris-3 telescope at the Siding Spring Observatory, Australia. Progress in the software development necessary for smooth SST operation includes a web based portal and an XML Azure Queue scheduling for the network giving easy access to our sensors. Astrometry24.net our new prototype cloud service for fast astrometry, streak detection and measurement with precision and performance results is also described. In the laser domain, for more than a year, Space Research Centre Borowiec laser station has regularly tracked space debris cooperative and uncooperative targets. The efforts of the stations’ staff have been focused on the tracking of typical rocket bodies from the LEO regime. Additionally, a second independent laser system fully dedicated to SST activities is under development. It will allow for an increased pace of operation of our consortium in the global SST laser domain.

Asynchronous updates can promote the evolution of cooperation on multiplex networks

NASA Astrophysics Data System (ADS)

Allen, James M.; Hoyle, Rebecca B.

2017-04-01

We study the importance to the frequency of cooperation of the choice of updating strategies in a game played asynchronously or synchronously across layers in a multiplex network. Updating asynchronously in the public goods game leads to higher frequencies of cooperation compared to synchronous updates. How large this effect is depends on the sensitivity of the game dynamics to changes in the number of cooperators surrounding a player, with the largest effect observed when players payoffs are small. The discovery of this effect enhances understanding of cooperation on multiplex networks, and demonstrates a new way to maintain cooperation in these systems.

Persistence paves the way for cooperation in evolutionary games

NASA Astrophysics Data System (ADS)

Huang, Chang-Wei; Dai, Qiong-Lin

2017-04-01

Cooperation is an effective way to maximize collective benefits, especially in modern human society. The issues on the emergence and maintenance of cooperation have attracted much attention in recent years. Here, we introduce the persistence parameter τ to characterize the time duration of choices held by individuals and consider the effects of τ on cooperation. We find that persistence could promote cooperation in a population no matter what the network structure is. Furthermore, the results on heterogeneous networks show that individuals with larger τ are more inclined to cooperate than those with smaller τ. Moreover, we investigate the effects of correlations between degree and persistence in scale-free networks and find that assortative matching could remarkably enhance cooperation whereas disassortative matching has adverse impacts on the evolution of cooperation.

What promotes and inhibits cooperation in mental health care across disciplines, services and service sectors? A qualitative study.

PubMed

Bramesfeld, A; Ungewitter, C; Böttger, D; El, Jurdi J; Losert, C; Kilian, R

2012-03-01

To explore the practice of cooperation in mental health care across services and identify conditions that promote and inhibit cooperation. Focus groups with relevant service providers were conducted in four exemplary regions in Germany (rural/ urban and East/West). The discussions were content analysed. Seven central categories were deduced: (1) involved service providers, (2) comprehension, (3) reasons, (4) instruments for cooperation, (5) promoting and inhibiting conditions, (6) interdisciplinarity, and (7) regional and personal networks. Cooperation is practiced in networks, rather than defined relations. Who is involved in cooperation depends on patients/clients needs and may vary from case to case. Service providers do not have theoretical concepts of cooperation. Cooperation relies not only on personal contacts and knowledge between services but also on time, financial reimbursement and the social capital of the environment. In particular, cooperation with physicians was considered to be difficult by non-medical professionals. Physician's role models do not seem to include cooperation with other disciplines as a core task. To improve cooperation, regional and sustainable mental health networks have to be systematically implemented by providing leadership, time and reimbursement for network meetings. Interdisciplinary cooperation practice should be part of the curricula of medical students and residents in psychiatry.

Co-Operative Learning and Development Networks.

ERIC Educational Resources Information Center

Hodgson, V.; McConnell, D.

1995-01-01

Discusses the theory, nature, and benefits of cooperative learning. Considers the Cooperative Learning and Development Network (CLDN) trial in the JITOL (Just in Time Open Learning) project and examines the relationship between theories about cooperative learning and the reality of a group of professionals participating in a virtual cooperative…

Cooperative spreading processes in multiplex networks.

PubMed

Wei, Xiang; Chen, Shihua; Wu, Xiaoqun; Ning, Di; Lu, Jun-An

2016-06-01

This study is concerned with the dynamic behaviors of epidemic spreading in multiplex networks. A model composed of two interacting complex networks is proposed to describe cooperative spreading processes, wherein the virus spreading in one layer can penetrate into the other to promote the spreading process. The global epidemic threshold of the model is smaller than the epidemic thresholds of the corresponding isolated networks. Thus, global epidemic onset arises in the interacting networks even though an epidemic onset does not arise in each isolated network. Simulations verify the analysis results and indicate that cooperative spreading processes in multiplex networks enhance the final infection fraction.

The Practices of Student Network as Cooperative Learning in Ethiopia

ERIC Educational Resources Information Center

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

Mechanisms and dynamics of cooperation and competition emergence in complex networked systems

NASA Astrophysics Data System (ADS)

Gianetto, David A.

Cooperative behavior is a pervasive phenomenon in human interactions and yet how it can evolve and become established, through the selfish process of natural selection, is an enduring puzzle. These behaviors emerge when agents interact in a structured manner; even so, the key structural factors that affect cooperation are not well understood. Moreover, the literature often considers cooperation a single attribute of primitive agents who do not react to environmental changes but real-world actors are more perceptive. The present work moves beyond these assumptions by evolving more realistic game participants, with memories of the past, on complex networks. Agents play repeated games with a three-part Markovian strategy that allows us to separate the cooperation phenomenon into trust, reciprocity, and forgiveness characteristics. Our results show that networks matter most when agents gain the most by acting in a selfish manner, irrespective of how much they may lose by cooperating; since the context provided by neighborhoods inhibits greedy impulses that agents otherwise succumb to in isolation. Network modularity is the most important driver of cooperation emergence in these high-stakes games. However, modularity fails to tell the complete story. Modular scale-free graphs impede cooperation when close coordination is required, partially due to the acyclic nature of scale-free network models. To achieve the highest cooperation in diverse social conditions, both high modularity, low connectivity within modules, and a rich network of long cycles become important. With these findings in hand, we study the influence of networks on coordination and competition within the federal health care insurance exchange. In this applied study, we show that systemic health care coordination is encouraged by the emergent insurance network. The network helps underpin the viability of the exchange and provides an environment of stronger competition once a critical-mass of insurers have entered the market.

Cooperation in scale-free networks with limited associative capacities

NASA Astrophysics Data System (ADS)

Poncela, Julia; Gómez-Gardeñes, Jesús; Moreno, Yamir

2011-05-01

In this work we study the effect of limiting the number of interactions (the associative capacity) that a node can establish per round of a prisoner’s dilemma game. We focus on the way this limitation influences the level of cooperation sustained by scale-free networks. We show that when the game includes cooperation costs, limiting the associative capacity of nodes to a fixed quantity renders in some cases larger values of cooperation than in the unrestricted scenario. This allows one to define an optimum capacity for which cooperation is maximally enhanced. Finally, for the case without cooperation costs, we find that even a tight limitation of the associative capacity of nodes yields the same levels of cooperation as in the original network.

Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions

PubMed Central

Muhammed, Dalhatu; Anisi, Mohammad Hossein; Vargas-Rosales, Cesar; Khan, Anwar

2018-01-01

Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node’s cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted. PMID:29389874

Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions.

PubMed

Muhammed, Dalhatu; Anisi, Mohammad Hossein; Zareei, Mahdi; Vargas-Rosales, Cesar; Khan, Anwar

2018-02-01

Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node's cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted.

Greed and Fear in Network Reciprocity: Implications for Cooperation among Organizations.

PubMed

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, we discuss implications of our main findings regarding Greed and Fear for the problem of cooperation on inter-organizational networks.

Greed and Fear in Network Reciprocity: Implications for Cooperation among Organizations

PubMed Central

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, we discuss implications of our main findings regarding Greed and Fear for the problem of cooperation on inter-organizational networks. PMID:26863540

Coevolution of cooperation and network structure under natural selection

NASA Astrophysics Data System (ADS)

Yang, D.-P.; Lin, H.; Shuai, J. W.

2011-02-01

A coevolution model by coupling mortality and fertility selection is introduced to investigate the evolution of cooperation and network structure in the prisoner's dilemma game. The cooperation level goes through a continuous phase transition vs. defection temptation b for low mortality selection intensity β and through a discontinuous one for infinite β. The cooperation level is enhanced most at β≈1 for any b. The local and global properties of the network structure, such as cluster and cooperating k-core, are investigated for the understanding of cooperation evolution. Cooperation is promoted by forming a tight cooperating k-core at moderate β, but too large β will destroy the cooperating k-core rapidly resulting in a rapid drop of the cooperation level. Importantly, the infinite β changes the normalized sucker's payoff S from 0 to 1-b and its dynamics of the cooperation level undergoes a very slow power-law decay, which leads the evolution into the regime of neutral evolution.

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

PubMed

Tang, Changbing; Li, Ang; Li, Xiang

2015-10-01

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.

Interplay between cooperation-enhancing mechanisms in evolutionary games with tag-mediated interactions

NASA Astrophysics Data System (ADS)

Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu

2018-04-01

Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.

Age structure and cooperation in coevolutionary games on dynamic network

NASA Astrophysics Data System (ADS)

Qin, Zilong; Hu, Zhenhua; Zhou, Xiaoping; Yi, Jingzhang

2015-04-01

Our proposed model imitates the growth of a population and describes the age structure and the level of cooperation in games on dynamic network with continuous changes of structure and topology. The removal of nodes and links caused by age-dependent attack, together with the nodes addition standing for the newborns of population, badly ruins Matthew effect in this coevolutionary process. Though the network is generated by growth and preferential attachment, it degenerates into random network and it is no longer heterogeneous. When the removal of nodes and links is equal to the addition of nodes and links, the size of dynamic network is maintained in steady-state, so is the low level of cooperation. Severe structure variation, homogeneous topology and continuous invasion of new defection jointly make dynamic network unsuitable for the survival of cooperator even when the probability with which the newborn players initially adopt the strategy cooperation is high, while things change slightly when the connections of newborn players are restricted. Fortunately, moderate interactions in a generation trigger an optimal recovering process to encourage cooperation. The model developed in this paper outlines an explanation of the cohesion changes in the development process of an organization. Some suggestions for cooperative behavior improvement are given in the end.

Dependency Links Can Hinder the Evolution of Cooperation in the Prisoner’s Dilemma Game on Lattices and Networks

PubMed Central

Wang, Xuwen; Nie, Sen; Wang, Binghong

2015-01-01

Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner’s dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whose value is between the payoff of mutual cooperation and the value of temptation to defect. Thus, this mechanism reflects that the dependency relation is stronger than the relation of ordinary mutual cooperation, but it is not large enough to cause the defection of the dependency pair. We show that the dependence of individuals hinders, promotes and never affects the cooperation on regular ring networks, square lattice, random and scale-free networks, respectively. The results for the square lattice and regular ring networks are demonstrated by the pair approximation. PMID:25798579

["Hope Dies Last …" - Cross-Sectoral Cooperation in Integrated Care].

PubMed

Ruppert, Daniel; Stegbauer, Constanze; Bramesfeld, Anke; Bestmann, Beate; Szecsenyi, Joachim; Götz, Katja

2017-04-01

Objective Multiple models of Integrated Care (IC) have been implemented in German mental health services in the last decade in order to improve cross-sectoral, interdisciplinary cooperation. This study investigates an IC network model providing home treatment, case management and a 24/7 hotline. The aim of the study was to explore how health professionals working in this service model perceive both cooperation within their facilities and with external stakeholders. Methods 5 focus groups with 39 health professionals working in an IC mental health network were conducted and analyzed with qualitative content analysis. Results Focus groups participants reported on excellent cooperation within their facilities. The cooperation with external stakeholders, i. e. physicians, psychotherapists and psychiatric clinics, leaves room for improvement. Conclusions Until now little consideration has been given to the perspectives of health professionals. Cooperation within IC mental health networks seems to be effective. Cooperation with stakeholders outside the networks needs to be enhanced. © Georg Thieme Verlag KG Stuttgart · New York.

Evolutionary Games in Multi-Agent Systems of Weighted Social Networks

NASA Astrophysics Data System (ADS)

Du, Wen-Bo; Cao, Xian-Bin; Zheng, Hao-Ran; Zhou, Hong; Hu, Mao-Bin

Much empirical evidence has shown realistic networks are weighted. Compared with those on unweighted networks, the dynamics on weighted network often exhibit distinctly different phenomena. In this paper, we investigate the evolutionary game dynamics (prisoner's dilemma game and snowdrift game) on a weighted social network consisted of rational agents and focus on the evolution of cooperation in the system. Simulation results show that the cooperation level is strongly affected by the weighted nature of the network. Moreover, the variation of time series has also been investigated. Our work may be helpful in understanding the cooperative behavior in the social systems.

Population Fluctuation Promotes Cooperation in Networks

PubMed Central

Miller, Steve; Knowles, Joshua

2015-01-01

We consider the problem of explaining the emergence and evolution of cooperation in dynamic network-structured populations. Building on seminal work by Poncela et al., which shows how cooperation (in one-shot prisoner’s dilemma) is supported in growing populations by an evolutionary preferential attachment (EPA) model, we investigate the effect of fluctuations in the population size. We find that a fluctuating model – based on repeated population growth and truncation – is more robust than Poncela et al.’s in that cooperation flourishes for a wider variety of initial conditions. In terms of both the temptation to defect, and the types of strategies present in the founder network, the fluctuating population is found to lead more securely to cooperation. Further, we find that this model will also support the emergence of cooperation from pre-existing non-cooperative random networks. This model, like Poncela et al.’s, does not require agents to have memory, recognition of other agents, or other cognitive abilities, and so may suggest a more general explanation of the emergence of cooperation in early evolutionary transitions, than mechanisms such as kin selection, direct and indirect reciprocity. PMID:26061705

Emergence of Super Cooperation of Prisoner’s Dilemma Games on Scale-Free Networks

PubMed Central

Li, Angsheng; Yong, Xi

2015-01-01

Recently, the authors proposed a quantum prisoner’s dilemma game based on the spatial game of Nowak and May, and showed that the game can be played classically. By using this idea, we proposed three generalized prisoner’s dilemma (GPD, for short) games based on the weak Prisoner’s dilemma game, the full prisoner’s dilemma game and the normalized Prisoner’s dilemma game, written by GPDW, GPDF and GPDN respectively. Our games consist of two players, each of which has three strategies: cooperator (C), defector (D) and super cooperator (denoted by Q), and have a parameter γ to measure the entangled relationship between the two players. We found that our generalised prisoner’s dilemma games have new Nash equilibrium principles, that entanglement is the principle of emergence and convergence (i.e., guaranteed emergence) of super cooperation in evolutions of our generalised prisoner’s dilemma games on scale-free networks, that entanglement provides a threshold for a phase transition of super cooperation in evolutions of our generalised prisoner’s dilemma games on scale-free networks, that the role of heterogeneity of the scale-free networks in cooperations and super cooperations is very limited, and that well-defined structures of scale-free networks allow coexistence of cooperators and super cooperators in the evolutions of the weak version of our generalised prisoner’s dilemma games. PMID:25643279

Evolution of cooperation on complex networks with synergistic and discounted group interactions

NASA Astrophysics Data System (ADS)

Zhou, Lei; Li, Aming; Wang, Long

2015-06-01

In the real world individuals often engage in group interactions and their payoffs are determined by many factors, including the typical nonlinear interactions, i.e., synergy and discounting. Previous literatures assume that individual payoffs are either synergistically enhanced or discounted with the additional cooperators. Such settings ignore the interplay of these two factors, which is in sharp contrast with the fact that they ubiquitously coexist. Here we investigate how the coexistence and periodical switching of synergistic and discounted group interactions affect the evolution of cooperation on various complex networks. We show that scale-free networks facilitate the emergence of cooperation in terms of fixation probability for group interactions. With nonlinear interactions the heterogeneity of the degree acts as a double-edged sword: below the neutral drift it is the best for cooperation while above the neutral drift it instead provides the least opportunity for cooperators to be fixed. The advantages of the heterogeneity fade as interactive attributes switch between synergy and discounting, which suggests that the heterogeneity of population structures cannot favor cooperators in group interactions even with simple nonlinear interactions. Nonetheless, scale-free networks always guarantee cooperators the fastest rate of fixation. Our work implies that even very simple nonlinear group interactions could greatly shape the fixation probability and fixation time of cooperators in structured populations indicated by complex networks.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks.

PubMed

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-10-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks

PubMed Central

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-01-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime. PMID:27706079

Evolution of cooperation under social pressure in multiplex networks

NASA Astrophysics Data System (ADS)

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.

PubMed

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.

Cooperative Collection Development in Multitype Library Networks: A Beginning--Goals and Methods. Proceedings of the Annual Conference of the Missouri Library Association (1980).

ERIC Educational Resources Information Center

Tompkins, Philip, Ed.

This document presents the proceedings of a conference organized to review the cooperative collection development features of the Missouri State Network Plan and to outline specific goals, methods, and materials for facilitating cooperative collection development projects in the state's multitype library networks. An introduction provides…

First results obtained within the European 'LAMA' programme (Large Active Mirrors in Aluminium)

NASA Astrophysics Data System (ADS)

Rozelot, J.-P.

1993-11-01

To investigate the feasibility of large size aluminum mirrors, studies have been undertaken in cooperation with European Southern Observatory (ESO), in the framework of a European program. The first phase, which is just now ended, addressed the following items: (1) tests to select the best aluminum alloy, (2) aluminum welding, homogeneity and stability, (3) aluminum high-precision machining, (4) nickel coating, (5) polishing of the nickel layer, (6) active optics. Furthermore, tests have been conducted to demonstrate that the quality of the mirrors is not altered at various temperatures and after a large number of aluminizing and cleaning cycles (corresponding to about 50 years' life). The mirror shape (whose specifications are fully compliant with those of the Very Large Telescope (VLT), as the program is conducted in cooperation with ESO) was computed under several causes of deformations: evidencing gravity as the predominant effect, and very low distortions as the high thermal conductivity limits the thermal transverse gradient to 0.025 C. Results show that it is quite possible to obtain high optical quality mirrors, mainly due to recent progress both in metallurgical processes (high precision machining -7 microns rms-) and active optics, that permit to correct residual aberrations of the surface. Such an alternative to classical glass mirrors will presently stand as a safe, economical solution that saves manufacturing time, for monolithic or segmented mirrors for innovative telescopes (e.g., lunar interferometric network).

Problems of integrated palliative care: a Dutch case study of routines and cooperation in the region of Arnhem.

PubMed

van Raak, Arno; Paulus, Aggie; Cuijpers, Rianne; Te Velde, Clary

2008-12-01

Cooperation in networks of providers of palliative care in Europe is problematic. Based on the concept of routines (patterns of behavior) and data about a Dutch network, we developed an explanation of this problem, in order to better understand the conditions for cooperation. Although more research is needed, the study suggests that disparate matches (divergence) between routines of the network members hampers cooperation. To promote cooperation, divergence, and legislation that stabilizes existing routines, must be identified. Divergence must be overcome and negotiations and transformational leadership, which require power sources, may be useful for this.

Constructing Robust Cooperative Networks using a Multi-Objective Evolutionary Algorithm

PubMed Central

Wang, Shuai; Liu, Jing

2017-01-01

The design and construction of network structures oriented towards different applications has attracted much attention recently. The existing studies indicated that structural heterogeneity plays different roles in promoting cooperation and robustness. Compared with rewiring a predefined network, it is more flexible and practical to construct new networks that satisfy the desired properties. Therefore, in this paper, we study a method for constructing robust cooperative networks where the only constraint is that the number of nodes and links is predefined. We model this network construction problem as a multi-objective optimization problem and propose a multi-objective evolutionary algorithm, named MOEA-Netrc, to generate the desired networks from arbitrary initializations. The performance of MOEA-Netrc is validated on several synthetic and real-world networks. The results show that MOEA-Netrc can construct balanced candidates and is insensitive to the initializations. MOEA-Netrc can find the Pareto fronts for networks with different levels of cooperation and robustness. In addition, further investigation of the robustness of the constructed networks revealed the impact on other aspects of robustness during the construction process. PMID:28134314

Coevolutionary, coexisting learning and teaching agents model for prisoner’s dilemma games enhancing cooperation with assortative heterogeneous networks

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2013-07-01

Unlike other natural network systems, assortativity can be observed in most human social networks, although it has been reported that a social dilemma situation represented by the prisoner’s dilemma favors dissortativity to enhance cooperation. We established a new coevolutionary model for both agents’ strategy and network topology, where teaching and learning agents coexist. Remarkably, this model enables agents’ enhancing cooperation more than a learners-only model on a time-frozen scale-free network and produces an underlying assortative network with a fair degree of power-law distribution. The model may imply how and why assortative networks are adaptive in human society.

[Social network analysis of interdisciplinary cooperation and networking in early prevention and intervention. A pilot study].

PubMed

Künster, A K; Knorr, C; Fegert, J M; Ziegenhain, U

2010-11-01

Child protection can only be successfully solved by interdisciplinary cooperation and networking. The individual, heterogeneous, and complex needs of families cannot be met sufficiently by one profession alone. To guarantee efficient interdisciplinary cooperation, there should not be any gaps in the network. In addition, each actor in the network should be placed at an optimal position regarding function, responsibilities, and skills. Actors that serve as allocators, such as pediatricians or youth welfare officers, should be in key player positions within the network. Furthermore, successful child protection is preventive and starts early. Social network analysis is an adequate technique to assess network structures and to plan interventions to improve networking. In addition, it is very useful to evaluate the effectiveness of interventions like round tables. We present data from our pilot project which was part of "Guter Start ins Kinderleben" ("a good start into a child's life"). Exemplary network data from one community show that networking is already quite effective with a satisfactory mean density throughout the network. There is potential for improvement in cooperation, especially at the interface between the child welfare and health systems.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

NASA Astrophysics Data System (ADS)

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.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

PubMed Central

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

Evolution of Cooperation in Social Dilemmas on Complex Networks

PubMed Central

Iyer, Swami; Killingback, Timothy

2016-01-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. PMID:26928428

Wireless Cooperative Networks: Self-Configuration and Optimization

DTIC Science & Technology

2011-09-09

TERMS wireless sensor networks , wireless cooperative networks, resource optimization, ultra-wideband, localization, ranging 16. SECURITY...Communications We consider two prevalent relay protocols for wireless sensor networks : decode-and-forward (DF) and amplify-and-forward (AF). To... sensor networks where each node may have its own sensing data to transmit, since they can maximally conserve energy while helping others as relays

A simple model of bipartite cooperation for ecological and organizational networks.

PubMed

Saavedra, Serguei; Reed-Tsochas, Felix; Uzzi, Brian

2009-01-22

In theoretical ecology, simple stochastic models that satisfy two basic conditions about the distribution of niche values and feeding ranges have proved successful in reproducing the overall structural properties of real food webs, using species richness and connectance as the only input parameters. Recently, more detailed models have incorporated higher levels of constraint in order to reproduce the actual links observed in real food webs. Here, building on previous stochastic models of consumer-resource interactions between species, we propose a highly parsimonious model that can reproduce the overall bipartite structure of cooperative partner-partner interactions, as exemplified by plant-animal mutualistic networks. Our stochastic model of bipartite cooperation uses simple specialization and interaction rules, and only requires three empirical input parameters. We test the bipartite cooperation model on ten large pollination data sets that have been compiled in the literature, and find that it successfully replicates the degree distribution, nestedness and modularity of the empirical networks. These properties are regarded as key to understanding cooperation in mutualistic networks. We also apply our model to an extensive data set of two classes of company engaged in joint production in the garment industry. Using the same metrics, we find that the network of manufacturer-contractor interactions exhibits similar structural patterns to plant-animal pollination networks. This surprising correspondence between ecological and organizational networks suggests that the simple rules of cooperation that generate bipartite networks may be generic, and could prove relevant in many different domains, ranging from biological systems to human society.

Cooperative Networks: Altruism, Group Solidarity, Reciprocity, and Sanctioning in Ugandan Producer Organizations.

PubMed

Baldassarri, Delia

2015-09-01

Repeated interaction and social networks are commonly considered viable solutions to collective action problems. This article identifies and systematically measures four general mechanisms--that is, generalized altruism, group solidarity, reciprocity, and the threat of sanctioning--and tests which of them brings about cooperation in the context of Ugandan producer organizations. Using an innovative methodological framework that combines "lab-in-the-field" experiments with survey interviews and complete social networks data, the article goes beyond the assessment of a relationship between social networks and collective outcomes to study the mechanisms that favor cooperative behavior. The article first establishes a positive relationship between position in the network structure and propensity to cooperate in the producer organization and then uses farmers' behavior in dictator and public goods games to test different mechanisms that may account for such a relationship. Results show that cooperation is induced by patterns of reciprocity that emerge through repeated interaction rather than other-regarding preferences like altruism or group solidarity.

The effects of reputational and social knowledge on cooperation

PubMed Central

Gallo, Edoardo; Yan, Chang

2015-01-01

The emergence and sustenance of cooperative behavior is fundamental for a society to thrive. Recent experimental studies have shown that cooperation increases in dynamic networks in which subjects can choose their partners. However, these studies did not vary reputational knowledge, or what subjects know about other’s past actions, which has long been recognized as an important factor in supporting cooperation. They also did not give subjects access to global social knowledge, or information on who is connected to whom in the group. As a result, it remained unknown how reputational and social knowledge foster cooperative behavior in dynamic networks both independently and by complementing each other. In an experimental setting, we show that global reputational knowledge is crucial to sustaining a high level of cooperation and welfare. Cooperation is associated with the emergence of dense and clustered networks with highly cooperative hubs. Global social knowledge has no effect on the aggregate level of cooperation. A community analysis shows that the addition of global social knowledge to global reputational knowledge affects the distribution of cooperative activity: cooperators form a separate community that achieves a higher cooperation level than the community of defectors. Members of the community of cooperators achieve a higher payoff from interactions within the community than members of the less cooperative community. PMID:25775544

A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks

PubMed Central

Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

2017-01-01

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 transmission power adjustment ratio while improving the network performance. PMID:28471387

A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks.

PubMed

Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

2017-05-04

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 transmission power adjustment ratio while improving the network performance.

Clustering in large networks does not promote upstream reciprocity.

PubMed

Masuda, Naoki

2011-01-01

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.

Clustering in Large Networks Does Not Promote Upstream Reciprocity

PubMed Central

Masuda, Naoki

2011-01-01

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution. PMID:21998641

Multiple effect of social influence on cooperation in interdependent network games.

PubMed

Jiang, Luo-Luo; Li, Wen-Jing; Wang, Zhen

2015-10-01

The social influence exists widely in the human society, where individual decision-making process (from congressional election to electronic commerce) may be affected by the attitude and behavior of others belonging to different social networks. Here, we couple the snowdrift (SD) game and the prisoner's dilemma (PD) game on two interdependent networks, where strategies in both games are associated by social influence to mimick the majority rule. More accurately, individuals' strategies updating refers to social learning (based on payoff difference) and above-mentioned social influence (related with environment of interdependent group), which is controlled by social influence strength s. Setting s = 0 decouples the networks and returns the traditional network game; while its increase involves the interactions between networks. By means of numerous Monte Carlo simulations, we find that such a mechanism brings multiple influence to the evolution of cooperation. Small s leads to unequal cooperation level in both games, because social learning is still the main updating rule for most players. Though intermediate and large s guarantees the synchronized evolution of strategy pairs, cooperation finally dies out and reaches a completely dominance in both cases. Interestingly, these observations are attributed to the expansion of cooperation clusters. Our work may provide a new understanding to the emergence of cooperation in intercorrelated social systems.

Multiple effect of social influence on cooperation in interdependent network games

NASA Astrophysics Data System (ADS)

Jiang, Luo-Luo; Li, Wen-Jing; Wang, Zhen

2015-10-01

The social influence exists widely in the human society, where individual decision-making process (from congressional election to electronic commerce) may be affected by the attitude and behavior of others belonging to different social networks. Here, we couple the snowdrift (SD) game and the prisoner’s dilemma (PD) game on two interdependent networks, where strategies in both games are associated by social influence to mimick the majority rule. More accurately, individuals’ strategies updating refers to social learning (based on payoff difference) and above-mentioned social influence (related with environment of interdependent group), which is controlled by social influence strength s. Setting s = 0 decouples the networks and returns the traditional network game; while its increase involves the interactions between networks. By means of numerous Monte Carlo simulations, we find that such a mechanism brings multiple influence to the evolution of cooperation. Small s leads to unequal cooperation level in both games, because social learning is still the main updating rule for most players. Though intermediate and large s guarantees the synchronized evolution of strategy pairs, cooperation finally dies out and reaches a completely dominance in both cases. Interestingly, these observations are attributed to the expansion of cooperation clusters. Our work may provide a new understanding to the emergence of cooperation in intercorrelated social systems.

Effect of direct reciprocity and network structure on continuing prosperity of social networking services.

PubMed

Osaka, Kengo; Toriumi, Fujio; Sugawara, Toshihauru

2017-01-01

Social networking services (SNSs) are widely used as communicative tools for a variety of purposes. SNSs rely on the users' individual activities associated with some cost and effort, and thus it is not known why users voluntarily continue to participate in SNSs. Because the structures of SNSs are similar to that of the public goods (PG) game, some studies have focused on why voluntary activities emerge as an optimal strategy by modifying the PG game. However, their models do not include direct reciprocity between users, even though reciprocity is a key mechanism that evolves and sustains cooperation in human society. We developed an abstract SNS model called the reciprocity rewards and meta-rewards games that include direct reciprocity by extending the existing models. Then, we investigated how direct reciprocity in an SNS facilitates cooperation that corresponds to participation in SNS by posting articles and comments and how the structure of the networks of users exerts an influence on the strategies of users using the reciprocity rewards game. We run reciprocity rewards games on various complex networks and an instance network of Facebook and found that two types of stable cooperation emerged. First, reciprocity slightly improves the rate of cooperation in complete graphs but the improvement is insignificant because of the instability of cooperation. However, this instability can be avoided by making two assumptions: high degree of fun, i.e. articles are read with high probability, and different attitudes to reciprocal and non-reciprocal agents. We then propose the concept of half free riders to explain what strategy sustains cooperation-dominant situations. Second, we indicate that a certain WS network structure affects users' optimal strategy and facilitates stable cooperation without any extra assumptions. We give a detailed analysis of the different characteristics of the two types of cooperation-dominant situations and the effect of the memory of reciprocal agents on cooperation.

Linking Individual and Collective Behavior in Adaptive Social Networks

NASA Astrophysics Data System (ADS)

Pinheiro, Flávio L.; Santos, Francisco C.; Pacheco, Jorge M.

2016-03-01

Adaptive social structures are known to promote the evolution of cooperation. However, up to now the characterization of the collective, population-wide dynamics resulting from the self-organization of individual strategies on a coevolving, adaptive network has remained unfeasible. Here we establish a (reversible) link between individual (micro)behavior and collective (macro)behavior for coevolutionary processes. We demonstrate that an adaptive network transforms a two-person social dilemma locally faced by individuals into a collective dynamics that resembles that associated with an N -person coordination game, whose characterization depends sensitively on the relative time scales between the entangled behavioral and network evolutions. In particular, we show that the faster the relative rate of adaptation of the network, the smaller the critical fraction of cooperators required for cooperation to prevail, thus establishing a direct link between network adaptation and the evolution of cooperation. The framework developed here is general and may be readily applied to other dynamical processes occurring on adaptive networks, notably, the spreading of contagious diseases or the diffusion of innovations.

National security and national competitiveness: Open source solutions; NASA requirements and capabilities

NASA Technical Reports Server (NTRS)

Cotter, Gladys A.

1993-01-01

Foreign competitors are challenging the world leadership of the U.S. aerospace industry, and increasingly tight budgets everywhere make international cooperation in aerospace science necessary. The NASA STI Program has as part of its mission to support NASA R&D, and to that end has developed a knowledge base of aerospace-related information known as the NASA Aerospace Database. The NASA STI Program is already involved in international cooperation with NATO/AGARD/TIP, CENDI, ICSU/ICSTI, and the U.S. Japan Committee on STI. With the new more open political climate, the perceived dearth of foreign information in the NASA Aerospace Database, and the development of the ESA database and DELURA, the German databases, the NASA STI Program is responding by sponsoring workshops on foreign acquisitions and by increasing its cooperation with international partners and with other U.S. agencies. The STI Program looks to the future of improved database access through networking and a GUI; new media; optical disk, video, and full text; and a Technology Focus Group that will keep the NASA STI Program current with technology.

Cooperative water network system to reduce carbon footprint.

PubMed

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.

Game-theoretic approach for improving cooperation in wireless multihop networks.

PubMed

Ng, See-Kee; Seah, Winston K G

2010-06-01

Traditional networks are built on the assumption that network entities cooperate based on a mandatory network communication semantic to achieve desirable qualities such as efficiency and scalability. Over the years, this assumption has been eroded by the emergence of users that alter network behavior in a way to benefit themselves at the expense of others. At one extreme, a malicious user/node may eavesdrop on sensitive data or deliberately inject packets into the network to disrupt network operations. The solution to this generally lies in encryption and authentication. In contrast, a rational node acts only to achieve an outcome that he desires most. In such a case, cooperation is still achievable if the outcome is to the best interest of the node. The node misbehavior problem would be more pronounced in multihop wireless networks like mobile ad hoc and sensor networks, which are typically made up of wireless battery-powered devices that must cooperate to forward packets for one another. However, cooperation may be hard to maintain as it consumes scarce resources such as bandwidth, computational power, and battery power. This paper applies game theory to achieve collusive networking behavior in such network environments. In this paper, pricing, promiscuous listening, and mass punishments are avoided altogether. Our model builds on recent work in the field of Economics on the theory of imperfect private monitoring for the dynamic Bertrand oligopoly, and adapts it to the wireless multihop network. The model derives conditions for collusive packet forwarding, truthful routing broadcasts, and packet acknowledgments under a lossy wireless multihop environment, thus capturing many important characteristics of the network layer and link layer in one integrated analysis that has not been achieved previously. We also provide a proof of the viability of the model under a theoretical wireless environment. Finally, we show how the model can be applied to design a generic protocol which we call the Selfishness Resilient Resource Reservation protocol, and validate the effectiveness of this protocol in ensuring cooperation using simulations.

Some recollections on acousto-optics research at the University of Gdańsk in the light of international cooperation and of the history of Spring Schools on Acousto-Optics and Applications.

PubMed

Kwiek, Piotr; Sliwiński, Antoni

2009-03-01

Some historical features of international cooperation that have been a background for originating the idea to organize since 1980 special international meetings named Spring Schools on Acousto-Optics and Applications and for continuing the events until now are presented. Thanks to the establishment of the Spring Schools, the group of acousto-opticians at the Gdańsk University have had the opportunity to exchange scientific experience and continue mutual cooperation in research with several acousto-optic centers and to publish a number of common papers. A few examples from these achievements and some historical facts illustrating research activity in the field of acousto-optics during past 30 years are recollected.

Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks.

PubMed

Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

2016-02-24

In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption.

Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks

PubMed Central

Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

2016-01-01

In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption. PMID:26927104

Cooperation-Controlled Learning for Explicit Class Structure in Self-Organizing Maps

PubMed Central

Kamimura, Ryotaro

2014-01-01

We attempt to demonstrate the effectiveness of multiple points of view toward neural networks. By restricting ourselves to two points of view of a neuron, we propose a new type of information-theoretic method called “cooperation-controlled learning.” In this method, individual and collective neurons are distinguished from one another, and we suppose that the characteristics of individual and collective neurons are different. To implement individual and collective neurons, we prepare two networks, namely, cooperative and uncooperative networks. The roles of these networks and the roles of individual and collective neurons are controlled by the cooperation parameter. As the parameter is increased, the role of cooperative networks becomes more important in learning, and the characteristics of collective neurons become more dominant. On the other hand, when the parameter is small, individual neurons play a more important role. We applied the method to the automobile and housing data from the machine learning database and examined whether explicit class boundaries could be obtained. Experimental results showed that cooperation-controlled learning, in particular taking into account information on input units, could be used to produce clearer class structure than conventional self-organizing maps. PMID:25309950

Coevolution of Cooperation and Partner Rewiring Range in Spatial Social Networks

NASA Astrophysics Data System (ADS)

Khoo, Tommy; Fu, Feng; Pauls, Scott

2016-11-01

In recent years, there has been growing interest in the study of coevolutionary games on networks. Despite much progress, little attention has been paid to spatially embedded networks, where the underlying geographic distance, rather than the graph distance, is an important and relevant aspect of the partner rewiring process. It thus remains largely unclear how individual partner rewiring range preference, local vs. global, emerges and affects cooperation. Here we explicitly address this issue using a coevolutionary model of cooperation and partner rewiring range preference in spatially embedded social networks. In contrast to local rewiring, global rewiring has no distance restriction but incurs a one-time cost upon establishing any long range link. We find that under a wide range of model parameters, global partner switching preference can coevolve with cooperation. Moreover, the resulting partner network is highly degree-heterogeneous with small average shortest path length while maintaining high clustering, thereby possessing small-world properties. We also discover an optimum availability of reputation information for the emergence of global cooperators, who form distant partnerships at a cost to themselves. From the coevolutionary perspective, our work may help explain the ubiquity of small-world topologies arising alongside cooperation in the real world.

Relational Diversity Promotes Cooperation in Prisoner’s Dilemma Games

PubMed Central

Xu, Bo; Wang, Jianwei; Deng, Ruipu; Li, Miao

2014-01-01

Relational diversity can be characterized by heterogeneous distributions of tie strengths in social networks and this diversity is present not only among humans, but throughout the animal world. We account for this observation by analyzing two network datasets from Facebook. We measure the strength of a tie by calculating the extent of overlap of friends between the two individuals. Based on the previous findings in human experiments, we argue that it is very unlikely that players will allocate their investments equally to their neighbors. There is a tendency that players prefer to donate more to their intimate friends. We find that if players preferentially allocate their investments to their good friends, cooperation will be promoted in PDG. We proved that the facilitation of the cooperative strategy relies mostly on the cooperative allies between best friends, resulting in the formation of cooperative clusters which are able to prevail against the defectors even when there is a large cost to cooperate. Moreover, we discover that the effect of relational diversity cannot be analyzed by adopting classical complex networks models, because neither of the artificial networks is able to produce networks with diverse distributions of tie strengths. It is of vital importance to introduce real social networks to study the influence of diverse relations especially when it comes to humans. This research proposes a brand new perspective to understand the influence of social relations on the emergence of cooperation in evolutionary prisoner’s dilemma games. PMID:25474354

Relational diversity promotes cooperation in prisoner's dilemma games.

PubMed

Xu, Bo; Wang, Jianwei; Deng, Ruipu; Li, Miao

2014-01-01

Relational diversity can be characterized by heterogeneous distributions of tie strengths in social networks and this diversity is present not only among humans, but throughout the animal world. We account for this observation by analyzing two network datasets from Facebook. We measure the strength of a tie by calculating the extent of overlap of friends between the two individuals. Based on the previous findings in human experiments, we argue that it is very unlikely that players will allocate their investments equally to their neighbors. There is a tendency that players prefer to donate more to their intimate friends. We find that if players preferentially allocate their investments to their good friends, cooperation will be promoted in PDG. We proved that the facilitation of the cooperative strategy relies mostly on the cooperative allies between best friends, resulting in the formation of cooperative clusters which are able to prevail against the defectors even when there is a large cost to cooperate. Moreover, we discover that the effect of relational diversity cannot be analyzed by adopting classical complex networks models, because neither of the artificial networks is able to produce networks with diverse distributions of tie strengths. It is of vital importance to introduce real social networks to study the influence of diverse relations especially when it comes to humans. This research proposes a brand new perspective to understand the influence of social relations on the emergence of cooperation in evolutionary prisoner's dilemma games.

Reputation drives cooperative behaviour and network formation in human groups.

PubMed

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.

Reputation drives cooperative behaviour and network formation in human groups

PubMed Central

Cuesta, Jose A.; Gracia-Lázaro, Carlos; Ferrer, Alfredo; Moreno, Yamir; Sánchez, Angel

2015-01-01

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

Impact of Social Punishment on Cooperative Behavior in Complex Networks

NASA Astrophysics Data System (ADS)

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.

78 FR 41088 - Solicitation for a Cooperative Agreement-Support Services for Community Services Division Networks

Federal Register 2010, 2011, 2012, 2013, 2014

2013-07-09

...--Support Services for Community Services Division Networks AGENCY: National Institute of Corrections, U.S... cooperative agreement will provide support services to NIC Community Services Division sponsored networks. The networks are designed for NIC to assist in meeting the needs of the field of community corrections by...

Mesoscopic structure conditions the emergence of cooperation on social networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lozano, S.; Arenas, A.; Sanchez, A.

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 withmore » 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.« less

Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity

NASA Astrophysics Data System (ADS)

Gracia-Lázaro, Carlos; Cuesta, José A.; Sánchez, Angel; Moreno, Yamir

2012-03-01

During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks, the observed level of cooperation is the same. We thus show that when human subjects interact in a heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.

Cooperation Improves Success during Intergroup Competition: An Analysis Using Data from Professional Soccer Tournaments.

PubMed

David, Gwendolyn Kim; Wilson, Robbie Stuart

2015-01-01

The benefit mutually gained by cooperators is considered the ultimate explanation for why cooperation evolved among non-relatives. During intergroup competition, cooperative behaviours within groups that provide a competitive edge over their opposition should be favoured by selection, particularly in lethal human warfare. Aside from forming larger groups, three other ways that individuals within a group can cooperate to improve their chances of gaining a mutual benefit are: (i) greater networking, (ii) contributing more effort, and (iii) dividing labour. Greater cooperation is expected to increase the chances of gaining a group benefit by improving proficiency in the tasks critical to success-yet empirical tests of this prediction using real-world cases are absent. In this study, we used data derived from 12 international and professional soccer competitions to test the predictions that: 1) greater levels of cooperative behaviour are associated with winning group contests, 2) the three forms of cooperation differ in relative importance for winning matches, 3) competition and tournament-type affect the levels of cooperation and shooting proficiency in matches, and 4) greater levels of networking behaviour are associated with increased proficiency in the most critical task linked with winning success in soccer-shooting at goal. Winners were best predicted by higher shooting proficiency, followed by greater frequencies of networking interactions within a team but unexpectedly, fewer networking partners and less division of labour. Although significant variation was detected across competitions and tournament-types, greater levels of networking behaviour were consistently associated with increased proficiency in shooting at goal, which in turn was linked with winning success. This study empirically supports the idea that intergroup competition can favour cooperation among non-relatives.

Adaptive selective relaying in cooperative free-space optical systems over atmospheric turbulence and misalignment fading channels.

PubMed

Boluda-Ruiz, Rubén; García-Zambrana, Antonio; Castillo-Vázquez, Carmen; Castillo-Vázquez, Beatriz

2014-06-30

In this paper, a novel adaptive cooperative protocol with multiple relays using detect-and-forward (DF) over atmospheric turbulence channels with pointing errors is proposed. The adaptive DF cooperative protocol here analyzed is based on the selection of the optical path, source-destination or different source-relay links, with a greater value of fading gain or irradiance, maintaining a high diversity order. Closed-form asymptotic bit error-rate (BER) expressions are obtained for a cooperative free-space optical (FSO) communication system with Nr relays, when the irradiance of the transmitted optical beam is susceptible to either a wide range of turbulence conditions, following a gamma-gamma distribution of parameters α and β, or pointing errors, following a misalignment fading model where the effect of beam width, detector size and jitter variance is considered. A greater robustness for different link distances and pointing errors is corroborated by the obtained results if compared with similar cooperative schemes or equivalent multiple-input multiple-output (MIMO) systems. Simulation results are further demonstrated to confirm the accuracy and usefulness of the derived results.

Benefits of Cooperative Learning in Weblog Networks

ERIC Educational Resources Information Center

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

Cooperation in memory-based prisoner's dilemma game on interdependent networks

NASA Astrophysics Data System (ADS)

Luo, Chao; Zhang, Xiaolin; Liu, Hong; Shao, Rui

2016-05-01

Memory or so-called experience normally plays the important role to guide the human behaviors in real world, that is essential for rational decisions made by individuals. Hence, when the evolutionary behaviors of players with bounded rationality are investigated, it is reasonable to make an assumption that players in system are with limited memory. Besides, in order to unravel the intricate variability of complex systems in real world and make a highly integrative understanding of their dynamics, in recent years, interdependent networks as a comprehensive network structure have obtained more attention in this community. In this article, the evolution of cooperation in memory-based prisoner's dilemma game (PDG) on interdependent networks composed by two coupled square lattices is studied. Herein, all or part of players are endowed with finite memory ability, and we focus on the mutual influence of memory effect and interdependent network reciprocity on cooperation of spatial PDG. We show that the density of cooperation can be significantly promoted within an optimal region of memory length and interdependent strength. Furthermore, distinguished by whether having memory ability/external links or not, each kind of players on networks would have distinct evolutionary behaviors. Our work could be helpful to understand the emergence and maintenance of cooperation under the evolution of memory-based players on interdependent networks.

Cooperation, social networks, and the emergence of leadership in a prisoner's dilemma with adaptive local interactions

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.

2005-11-01

Cooperative behavior among a group of agents is studied assuming adaptive interactions. Each agent plays a Prisoner’s Dilemma game with its local neighbors, collects an aggregate payoff, and imitates the strategy of its best neighbor. Agents may punish or reward their neighbors by removing or sustaining the interactions, according to their satisfaction level and strategy played. An agent may dismiss an interaction, and the corresponding neighbor is replaced by another randomly chosen agent, introducing diversity and evolution to the network structure. We perform an extensive numerical and analytical study, extending results in M. G. Zimmermann, V. M. Eguíluz, and M. San Miguel, Phys. Rev. E 69, 065102(R) (2004). We show that the system typically reaches either a full-defective state or a highly cooperative steady state. The latter equilibrium solution is composed mostly by cooperative agents, with a minor population of defectors that exploit the cooperators. It is shown how the network adaptation dynamics favors the emergence of cooperators with the highest payoff. These “leaders” are shown to sustain the global cooperative steady state. Also we find that the average payoff of defectors is larger than the average payoff of cooperators. Whenever “leaders” are perturbed (e.g., by addition of noise), an unstable situation arises and global cascades with oscillations between the nearly full defection network and the fully cooperative outcome are observed.

The global lambda visualization facility: An international ultra-high-definition wide-area visualization collaboratory

USGS Publications Warehouse

Leigh, J.; Renambot, L.; Johnson, Aaron H.; Jeong, B.; Jagodic, R.; Schwarz, N.; Svistula, D.; Singh, R.; Aguilera, J.; Wang, X.; Vishwanath, V.; Lopez, B.; Sandin, D.; Peterka, T.; Girado, J.; Kooima, R.; Ge, J.; Long, L.; Verlo, A.; DeFanti, T.A.; Brown, M.; Cox, D.; Patterson, R.; Dorn, P.; Wefel, P.; Levy, S.; Talandis, J.; Reitzer, J.; Prudhomme, T.; Coffin, T.; Davis, B.; Wielinga, P.; Stolk, B.; Bum, Koo G.; Kim, J.; Han, S.; Corrie, B.; Zimmerman, T.; Boulanger, P.; Garcia, M.

2006-01-01

The research outlined in this paper marks an initial global cooperative effort between visualization and collaboration researchers to build a persistent virtual visualization facility linked by ultra-high-speed optical networks. The goal is to enable the comprehensive and synergistic research and development of the necessary hardware, software and interaction techniques to realize the next generation of end-user tools for scientists to collaborate on the global Lambda Grid. This paper outlines some of the visualization research projects that were demonstrated at the iGrid 2005 workshop in San Diego, California.

The expansion of neighborhood and pattern formation on spatial prisoner's dilemma

NASA Astrophysics Data System (ADS)

Qian, Xiaolan; Xu, Fangqian; Yang, Junzhong; Kurths, Jürgen

2015-04-01

The prisoner's dilemma (PD), in which players can either cooperate or defect, is considered a paradigm for studying the evolution of cooperation in spatially structured populations. There the compact cooperator cluster is identified as a characteristic pattern and the probability of forming such pattern in turn depends on the features of the networks. In this paper, we investigate the influence of expansion of neighborhood on pattern formation by taking a weak PD game with one free parameter T, the temptation to defect. Two different expansion methods of neighborhood are considered. One is based on a square lattice and expanses along four directions generating networks with degree increasing with K = 4 m . The other is based on a lattice with Moore neighborhood and expanses along eight directions, generating networks with degree of K = 8 m . Individuals are placed on the nodes of the networks, interact with their neighbors and learn from the better one. We find that cooperator can survive for a broad degree 4 ≤ K ≤ 70 by taking a loose type of cooperator clusters. The former simple corresponding relationship between macroscopic patterns and the microscopic PD interactions is broken. Under a condition that is unfavorable for cooperators such as large T and K, systems prefer to evolve to a loose type of cooperator clusters to support cooperation. However, compared to the well-known compact pattern, it is a suboptimal strategy because it cannot help cooperators dominating the population and always corresponding to a low cooperation level.

DEADS: Depth and Energy Aware Dominating Set Based Algorithm for Cooperative Routing along with Sink Mobility in Underwater WSNs.

PubMed

Umar, Amara; Javaid, Nadeem; Ahmad, Ashfaq; Khan, Zahoor Ali; Qasim, Umar; Alrajeh, Nabil; Hayat, Amir

2015-06-18

Performance enhancement of Underwater Wireless Sensor Networks (UWSNs) in terms of throughput maximization, energy conservation and Bit Error Rate (BER) minimization is a potential research area. However, limited available bandwidth, high propagation delay, highly dynamic network topology, and high error probability leads to performance degradation in these networks. In this regard, many cooperative communication protocols have been developed that either investigate the physical layer or the Medium Access Control (MAC) layer, however, the network layer is still unexplored. More specifically, cooperative routing has not yet been jointly considered with sink mobility. Therefore, this paper aims to enhance the network reliability and efficiency via dominating set based cooperative routing and sink mobility. The proposed work is validated via simulations which show relatively improved performance of our proposed work in terms the selected performance metrics.

Spatially correlated heterogeneous aspirations to enhance network reciprocity

NASA Astrophysics Data System (ADS)

Tanimoto, Jun; Nakata, Makoto; Hagishima, Aya; Ikegaya, Naoki

2012-02-01

Perc & Wang demonstrated that aspiring to be the fittest under conditions of pairwise strategy updating enhances network reciprocity in structured populations playing 2×2 Prisoner's Dilemma games (Z. Wang, M. Perc, Aspiring to the fittest and promoted of cooperation in the Prisoner's Dilemma game, Physical Review E 82 (2010) 021115; M. Perc, Z. Wang, Heterogeneous aspiration promotes cooperation in the Prisoner's Dilemma game, PLOS one 5 (12) (2010) e15117). Through numerical simulations, this paper shows that network reciprocity is even greater if heterogeneous aspirations are imposed. We also suggest why heterogeneous aspiration fosters network reciprocity. It distributes strategy updating speed among agents in a manner that fortifies the initially allocated cooperators' clusters against invasion. This finding prompted us to further enhance the usual heterogeneous aspiration cases for heterogeneous network topologies. We find that a negative correlation between degree and aspiration level does extend cooperation among heterogeneously structured agents.

Transparency in Cooperative Online Education

ERIC Educational Resources Information Center

Dalsgaard, Christian; Paulsen, Morten Flate

2009-01-01

The purpose of this article is to discuss the following question: What is the potential of social networking within cooperative online education? Social networking does not necessarily involve communication, dialogue, or collaboration. Instead, the authors argue that "transparency" is a unique feature of social networking services.…

Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network.

PubMed

Han, Changcai; Yang, Jinsheng

2017-10-30

The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes.

Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network

PubMed Central

Han, Changcai; Yang, Jinsheng

2017-01-01

The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes. PMID:29084155

Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels †

PubMed Central

Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

2016-01-01

In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source’s radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks. PMID:26927119

Outage Performance Analysis of Relay Selection Schemes in Wireless Energy Harvesting Cooperative Networks over Non-Identical Rayleigh Fading Channels.

PubMed

Do, Nhu Tri; Bao, Vo Nguyen Quoc; An, Beongku

2016-02-26

In this paper, we study relay selection in decode-and-forward wireless energy harvesting cooperative networks. In contrast to conventional cooperative networks, the relays harvest energy from the source's radio-frequency radiation and then use that energy to forward the source information. Considering power splitting receiver architecture used at relays to harvest energy, we are concerned with the performance of two popular relay selection schemes, namely, partial relay selection (PRS) scheme and optimal relay selection (ORS) scheme. In particular, we analyze the system performance in terms of outage probability (OP) over independent and non-identical (i.n.i.d.) Rayleigh fading channels. We derive the closed-form approximations for the system outage probabilities of both schemes and validate the analysis by the Monte-Carlo simulation. The numerical results provide comprehensive performance comparison between the PRS and ORS schemes and reveal the effect of wireless energy harvesting on the outage performances of both schemes. Additionally, we also show the advantages and drawbacks of the wireless energy harvesting cooperative networks and compare to the conventional cooperative networks.

Networking for English Literature Class: Cooperative Learning in Chinese Context

ERIC Educational Resources Information Center

Li, Huiyin

2017-01-01

This action research was conducted to investigate the efficacy of networking, an adjusted cooperative learning method employed in an English literature class for non-English majors in China. Questionnaire was administered online anonymously to college students after a 14-week cooperative learning in literature class in a Chinese university, aiming…

Cooperation dynamics of generalized reciprocity in state-based social dilemmas

NASA Astrophysics Data System (ADS)

Stojkoski, Viktor; Utkovski, Zoran; Basnarkov, Lasko; Kocarev, Ljupco

2018-05-01

We introduce a framework for studying social dilemmas in networked societies where individuals follow a simple state-based behavioral mechanism based on generalized reciprocity, which is rooted in the principle "help anyone if helped by someone." Within this general framework, which applies to a wide range of social dilemmas including, among others, public goods, donation, and snowdrift games, we study the cooperation dynamics on a variety of complex network examples. By interpreting the studied model through the lenses of nonlinear dynamical systems, we show that cooperation through generalized reciprocity always emerges as the unique attractor in which the overall level of cooperation is maximized, while simultaneously exploitation of the participating individuals is prevented. The analysis elucidates the role of the network structure, here captured by a local centrality measure which uniquely quantifies the propensity of the network structure to cooperation by dictating the degree of cooperation displayed both at the microscopic and macroscopic level. We demonstrate the applicability of the analysis on a practical example by considering an interaction structure that couples a donation process with a public goods game.

Properties of four real world collaboration--competition networks

NASA Astrophysics Data System (ADS)

Fu, Chun-Hua; Xu, Xiu-Lian; He, Da-Ren

2009-03-01

Our research group has empirically investigated 9 real world collaboration networks and 25 real world cooperation-competition networks. Among the 34 real world systems, all the 9 real world collaboration networks and 6 real world cooperation-competition networks show the unimodal act-size distribution and the shifted power law distribution of degree and act-degree. We have proposed a collaboration network evolution model for an explanation of the rules [1]. The other 14 real world cooperation-competition networks show that the act-size distributions are not unimodal; instead, they take qualitatively the same shifted power law forms as the degree and act-degree distributions. The properties of four systems (the main land movie film network, Beijing restaurant network, 2004 Olympic network, and Tao-Bao notebook computer sale network) are reported in detail as examples. Via a numerical simulation, we show that the new rule can still be explained by the above-mentioned model. [1] H. Chang, B. B. Su, et al. Phsica A, 2007, 383: 687-702.

Entanglement guarantees emergence of cooperation in quantum prisoner's dilemma games on networks.

PubMed

Li, Angsheng; Yong, Xi

2014-09-05

It was known that cooperation of evolutionary prisoner's dilemma games fails to emerge in homogenous networks such as random graphs. Here we proposed a quantum prisoner's dilemma game. The game consists of two players, in which each player has three choices of strategy: cooperator (C), defector (D) and super cooperator (denoted by Q). We found that quantum entanglement guarantees emergence of a new cooperation, the super cooperation of the quantum prisoner's dilemma games, and that entanglement is the mechanism of guaranteed emergence of cooperation of evolutionary prisoner's dilemma games on networks. We showed that for a game with temptation b, there exists a threshold arccos √b/b for a measurement of entanglement, beyond which, (super) cooperation of evolutionary quantum prisoner's dilemma games is guaranteed to quickly emerge, giving rise to stochastic convergence of the cooperations, that if the entanglement degree γ is less than the threshold arccos √b/b, then the equilibrium frequency of cooperations of the games is positively correlated to the entanglement degree γ, and that if γ is less than arccos √b/b and b is beyond some boundary, then the equilibrium frequency of cooperations of the games on random graphs decreases as the average degree of the graphs increases.

Leveraging Statistical Physics to Improve Understanding of Cooperation in Multiplex Networks.

PubMed

Fu, Feng; Chen, Xingru

2017-07-01

Understanding how public cooperation emerges and is maintained is a topic of broad interest, with increasing contributions coming from a synergistic combination of evolutionary game theory and statistical physics. The comprehensive study by Battiston et al (2017 New J. Phys. , in press) improves our understanding of the role of multiplexity in cooperation, revealing that a significant edge overlap across network layers along with benign conditions for cooperation in at least one of the layers is needed to facilitate the emergence of cooperation in the multiplex.

Fbis report. Science and technology: China, October 18, 1995

DOE Office of Scientific and Technical Information (OSTI.GOV)

NONE

1995-10-18

;Partial Contents: Nanomaterials Fabrication, Applications Research Advances Noted; CAST Announces World`s First Space-Grown Large-Diameter GaAs Monocrystal; Assay of Antiviral Activity of Antisense Phosphorothioate Oligodeoxynucleotide Against Dengue Virus; Expression and Antigenicity of Chimeric Proteins of Cholera Toxin B Subunit With Hepatitis C Virus; CNCOFIEC Signs Agreement With IBM for New Intelligent Building; Latest Reports on Optical Computing, Memory; BIDC To Introduce S3 Company`s Multimedia Accelerator Chipset; Virtual Private PCN Ring Network Based on ATM VP Cross-Connection; Beijing Gets Nation`s First Frame Relay Network; Situation of Power Industry Development and International Cooperation; Diagrams of China`s Nuclear Waste Containment Vessels; Chinese-Developed Containment Vesselmore » Material Reaches World Standards; Second Fuel Elements for Qinshan Plant Passes Inspection; and Geothermal Deep-Well Electric Pump Technology Developed.« less

Chinese Mainland Movie Network

NASA Astrophysics Data System (ADS)

Liu, Ai-Fen; Xue, Yu-Hua; He, Da-Ren

2008-03-01

We propose describing a large kind of cooperation-competition networks by bipartite graphs and their unipartite projections. In the graphs the topological structure describe the cooperation-competition configuration of the basic elements, and the vertex weight describe their different roles in cooperation or results of competition. This complex network description may be helpful for finding and understanding common properties of cooperation-competition systems. In order to show an example, we performed an empirical investigation on the movie cooperation-competition network within recent 80 years in the Chinese mainland. In the net the movies are defined as nodes, and two nodes are connected by a link if a common main movie actor performs in them. The edge represents the competition relationship between two movies for more audience among a special audience colony. We obtained the statistical properties, such as the degree distribution, act degree distribution, act size distribution, and distribution of the total node weight, and explored the influence factors of Chinese mainland movie competition intensity.

Emergent behaviors of the Schrödinger-Lohe model on cooperative-competitive networks

NASA Astrophysics Data System (ADS)

Huh, Hyungjin; Ha, Seung-Yeal; Kim, Dohyun

2017-12-01

We present several sufficient frameworks leading to the emergent behaviors of the coupled Schrödinger-Lohe (S-L) model under the same one-body external potential on cooperative-competitive networks. The S-L model was first introduced as a possible phenomenological model exhibiting quantum synchronization and its emergent dynamics on all-to-all cooperative networks has been treated via two distinct approaches, Lyapunov functional approach and the finite-dimensional reduction based on pairwise correlations. In this paper, we further generalize the finite-dimensional dynamical systems approach for pairwise correlation functions on cooperative-competitive networks and provide several sufficient frameworks leading to the collective exponential synchronization. For small systems consisting of three and four quantum subsystem, we also show that the system for pairwise correlations can be reduced to the Lotka-Volterra model with cooperative and competitive interactions, in which lots of interesting dynamical patterns appear, e.g., existence of closed orbits and limit-cycles.

Social Networks-Based Adaptive Pairing Strategy for Cooperative Learning

ERIC Educational Resources Information Center

Chuang, Po-Jen; Chiang, Ming-Chao; Yang, Chu-Sing; Tsai, Chun-Wei

2012-01-01

In this paper, we propose a grouping strategy to enhance the learning and testing results of students, called Pairing Strategy (PS). The proposed method stems from the need of interactivity and the desire of cooperation in cooperative learning. Based on the social networks of students, PS provides members of the groups to learn from or mimic…

Dynamic Network Selection for Multicast Services in Wireless Cooperative Networks

NASA Astrophysics Data System (ADS)

Chen, Liang; Jin, Le; He, Feng; Cheng, Hanwen; Wu, Lenan

In next generation mobile multimedia communications, different wireless access networks are expected to cooperate. However, it is a challenging task to choose an optimal transmission path in this scenario. This paper focuses on the problem of selecting the optimal access network for multicast services in the cooperative mobile and broadcasting networks. An algorithm is proposed, which considers multiple decision factors and multiple optimization objectives. An analytic hierarchy process (AHP) method is applied to schedule the service queue and an artificial neural network (ANN) is used to improve the flexibility of the algorithm. Simulation results show that by applying the AHP method, a group of weight ratios can be obtained to improve the performance of multiple objectives. And ANN method is effective to adaptively adjust weight ratios when users' new waiting threshold is generated.

The Effect of Geographical Proximity on Scientific Cooperation among Chinese Cities from 1990 to 2010

PubMed Central

Ma, Haitao; Fang, Chuanglin; Pang, Bo; Li, Guangdong

2014-01-01

Background The relations between geographical proximity and spatial distance constitute a popular topic of concern. Thus, how geographical proximity affects scientific cooperation, and whether geographically proximate scientific cooperation activities in fact exhibit geographic scale features should be investigated. Methodology Selected statistics from the ISI database on cooperatively authored papers, the authors of which resided in 60 typical cites in China, and which were published in the years 1990, 1995, 2000, 2005, and 2010, were used to establish matrices of geographic distance and cooperation levels between cities. By constructing a distance-cooperation model, the degree of scientific cooperation based on spatial distance was calculated. The relationship between geographical proximity and scientific cooperation, as well as changes in that relationship, was explored using the fitting function. Result (1) Instead of declining, the role of geographical proximity in inter-city scientific cooperation has increased gradually but significantly with the popularization of telecommunication technologies; (2) the relationship between geographical proximity and scientific cooperation has not followed a perfect declining curve, and at certain spatial scales, the distance-decay regularity does not work; (3) the Chinese scientific cooperation network gathers around different regional center cities, showing a trend towards a regional network; within this cooperation network the amount of inter-city cooperation occurring at close range increased greatly. Conclusion The relationship between inter-city geographical distance and scientific cooperation has been enhanced and strengthened over time. PMID:25365449

NCI’s Cooperative Human Tissue Network

Cancer.gov

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.

Viral Space Situational Awareness

NASA Astrophysics Data System (ADS)

Gleckler, A.; Butterfield, M. C.

2012-09-01

Viral SSA takes advantage of the amateur astronomy community to provide an extremely low-cost and geographically-diverse network of optical SSA sites. In the spirit of programs such as DARPA's Grand Challenge and the National Weather Service's program of providing amateur meteorologists with weather stations linked to a central professional meteorological facility, we form a cooperative bond with a willing community of technically-minded individuals. We term this program "viral" because we will qualify an initial set of astronomers for SSA operation and then use word of mouth in the astronomy community, as well as an outreach program, to pull in new observers. The use of modern remote controlled telescopes allows the incorporation of certified amateur, university, and commercial telescope systems. The availability of the local Viral SSA member for troubleshooting eliminates most significant costs of operating a large network. In this talk, we discuss the key concepts of Viral SSA and the route to a network of 100+ sites in a three year or less timeframe.

Cooperation enhanced by indirect reciprocity in spatial prisoner's dilemma games for social P2P systems

NASA Astrophysics Data System (ADS)

Tian, Lin-Lin; Li, Ming-Chu; Wang, Zhen

2016-11-01

With the growing interest in social Peer-to-Peer (P2P) applications, relationships of individuals are further exploited to improve the performances of reputation systems. It is an on-going challenge to investigate how spatial reciprocity aids indirect reciprocity in sustaining cooperation in practical P2P environments. This paper describes the construction of an extended prisoner's dilemma game on square lattice networks with three strategies, i.e., defection, unconditional cooperation, and reciprocal cooperation. Reciprocators discriminate partners according to their reputations based on image scoring, where mistakes in judgment of reputations may occur. The independent structures of interaction and learning neighborhood are discussed, with respect to the situation in which learning environments differ from interaction networks. The simulation results have indicated that the incentive mechanism enhances cooperation better in structured peers than among a well-mixed population. Given the realistic condition of inaccurate reputation scores, defection is still successfully held down when the players interact and learn within the unified neighborhoods. Extensive simulations have further confirmed the positive impact of spatial structure on cooperation with different sizes of lattice neighborhoods. And similar conclusions can also be drawn on regular random networks and scale-free networks. Moreover, for the separated structures of the neighborhoods, the interaction network has a critical effect on the evolution dynamics of cooperation and learning environments only have weaker impacts on the process. Our findings further provide some insights concerning the evolution of collective behaviors in social systems.

Rochester Focuses: A Community's Core Competence.

ERIC Educational Resources Information Center

Gabor, Andrea

1991-01-01

Rochester, New York, is globally competitive in optics manufacturing because of cooperative, strategic use of community resources: (1) collaboration of the University of Rochester and industry in the Center for Optics Manufacturing; (2) business cooperation in reform of the schools system; and (3) emphasis on total quality. (SK)

QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

PubMed

Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

2013-01-01

Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

Effects of adaptive dynamical linking in networked games

NASA Astrophysics Data System (ADS)

Yang, Zhihu; Li, Zhi; Wu, Te; Wang, Long

2013-10-01

The role of dynamical topologies in the evolution of cooperation has received considerable attention, as some studies have demonstrated that dynamical networks are much better than static networks in terms of boosting cooperation. Here we study a dynamical model of evolution of cooperation on stochastic dynamical networks in which there are no permanent partners to each agent. Whenever a new link is created, its duration is randomly assigned without any bias or preference. We allow the agent to adaptively adjust the duration of each link during the evolution in accordance with the feedback from game interactions. By Monte Carlo simulations, we find that cooperation can be remarkably promoted by this adaptive dynamical linking mechanism both for the game of pairwise interactions, such as the Prisoner's Dilemma game (PDG), and for the game of group interactions, illustrated by the public goods game (PGG). And the faster the adjusting rate, the more successful the evolution of cooperation. We also show that in this context weak selection favors cooperation much more than strong selection does. What is particularly meaningful is that the prosperity of cooperation in this study indicates that the rationality and selfishness of a single agent in adjusting social ties can lead to the progress of altruism of the whole population.

[Leukemia research in Germany: the Competence Network Acute and Chronic Leukemias].

PubMed

Kossak-Roth, Ute; Saußele, Susanne; Aul, Carlo; Büchner, Thomas; Döhner, Hartmut; Dugas, Martin; Ehninger, Gerhard; Ganser, Arnold; Giagounidis, Aristoteles; Gökbuget, Nicola; Griesshammer, Martin; Hasford, Jörg; Heuser, Michael; Hiddemann, Wolfgang; Hochhaus, Andreas; Hoelzer, Dieter; Niederwieser, Dietger; Reiter, Andreas; Röllig, Christoph; Hehlmann, Rüdiger

2016-04-01

The Competence Network "Acute and Chronic Leukemias" was founded in 1997 by the consolidation of the leading leukemia study groups in Germany. Key results are the development of new trials and cooperative studies, the setup of patient registries and biobanking facilities, as well as the improvement of study infrastructure. In 2003, the concept of the competence network contributed to the foundation of the European LeukemiaNet (ELN). Synergy with the ELN resulted in cooperation on a European and international level, standardization of diagnostics and treatment, and recommendations for each leukemia and interdisciplinary specialty. The ultimate goal of the network is the cure of leukemia through cooperative research.

How the initial level of visibility and limited resource affect the evolution of cooperation

NASA Astrophysics Data System (ADS)

Han, Dun; Li, Dandan; Sun, Mei

2016-06-01

This work sheds important light on how the initial level of visibility and limited resource might affect the evolution of the players’ strategies under different network structure. We perform the prisoner’s dilemma game in the lattice network and the scale-free network, the simulation results indicate that the average density of death in lattice network decreases with the increases of the initial proportion of visibility. However, the contrary phenomenon is observed in the scale-free network. Further results reflect that the individuals’ payoff in lattice network is significantly larger than the one in the scale-free network. In the lattice network, the visibility individuals could earn much more than the invisibility one. However, the difference is not apparent in the scale-free network. We also find that a high Successful-Defection-Payoff (SDB) and a rich natural environment have relatively larger deleterious cooperation effects. A high SDB is beneficial to raising the level of visibility in the heterogeneous network, however, that has adverse visibility consequences in homogeneous network. Our result reveals that players are more likely to cooperate voluntarily under homogeneous network structure.

An adaptive two-stage energy-efficiency mechanism for the doze mode in EPON

NASA Astrophysics Data System (ADS)

Nikoukar, AliAkbar; Hwang, I.-Shyan; Su, Yu-Min; Liem, Andrew Tanny

2016-07-01

Sleep and doze power-saving modes are the common ways to reduce power consumption of optical network units (ONUs) in Ethernet passive optical network (EPON). The doze mode turns off the ONU transmitter when there is no traffic in the upstream direction while the sleep mode turns off the ONU transmitter and receiver. As the result, the sleep mode is more efficient compared to the doze mode, but it introduces additional complexity of scheduling and signaling, losses the clock synchronization and requires long clock recovery time; furthermore, it requires the cooperation of the optical line terminal (OLT) in the downstream direction to queue frames. To improve the energy-saving in the doze mode, a new two-stage mechanism is introduced that the doze sleep duration is extended for longer time with acceptable quality-of-services (QoS) metrics when ONU is idle in the current cycle. By this way the ONU enters the doze mode even in the high load traffic; moreover, the green dynamic bandwidth allocation (GBA) is proposed to calculate the doze sleep duration based on the ONU queue state and incoming traffic ratio. Simulation results show that the proposed mechanism significantly improves the energy-saving 74% and 54% when traffic load is from the light load to the high load in different traffic situations, and also promises the QoS performance.

Promotion of cooperation induced by appropriate payoff aspirations in a small-world networked game

NASA Astrophysics Data System (ADS)

Chen, Xiaojie; Wang, Long

2008-01-01

Based on learning theory, we adopt a stochastic learning updating rule to investigate the evolution of cooperation in the Prisoner’s Dilemma game on Newman-Watts small-world networks with different payoff aspiration levels. Interestingly, simulation results show that the mechanism of intermediate aspiration promoting cooperation resembles a resonancelike behavior, and there exists a ping-pong vibration of cooperation for large payoff aspiration. To explain the nontrivial dependence of the cooperation level on the aspiration level, we investigate the fractions of links, provide analytical results of the cooperation level, and find that the simulation results are in close agreement with analytical ones. Our work may be helpful in understanding the cooperative behavior induced by the aspiration level in society.

Assortative and dissortative priorities for game interaction and strategy adaptation significantly bolster network reciprocity in the prisoner’s dilemma

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2014-05-01

In 2 × 2 prisoner’s dilemma games, network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium. Here we show that combining the process for selecting a gaming partner with the process for selecting an adaptation partner significantly enhances cooperation, even though such selection processes require additional costs to collect further information concerning which neighbor should be chosen. Based on elaborate investigations of the dynamics generated by our model, we find that high levels of cooperation result from two kinds of behavior: cooperators tend to interact with cooperators to prevent being exploited by defectors and defectors tend to choose cooperators to exploit despite the possibility that some defectors convert to cooperators.

Preparation of Professional Training Teachers for Network Cooperation between Educational Establishments during Labor Preparation

ERIC Educational Resources Information Center

Tarasjuk, Olga V.; Fedulova, Ksenia A.; Fedulova, Marina A.; Kryukova, Polina S.; Yadretsov, Vyacheslav ?.

2016-01-01

Relevance of the problem being investigated is conditioned by the necessity to arrange network cooperation between educational institutions during labor force preparation in the conditions of informatization of educational and technological processes. The aim of the article is to prove the necessity of including basics of network cooperation…

Simultaneous multi-patch-clamp and extracellular-array recordings: Single neuron reflects network activity.

PubMed

Vardi, Roni; Goldental, Amir; Sardi, Shira; Sheinin, Anton; Kanter, Ido

2016-11-08

The increasing number of recording electrodes enhances the capability of capturing the network's cooperative activity, however, using too many monitors might alter the properties of the measured neural network and induce noise. Using a technique that merges simultaneous multi-patch-clamp and multi-electrode array recordings of neural networks in-vitro, we show that the membrane potential of a single neuron is a reliable and super-sensitive probe for monitoring such cooperative activities and their detailed rhythms. Specifically, the membrane potential and the spiking activity of a single neuron are either highly correlated or highly anti-correlated with the time-dependent macroscopic activity of the entire network. This surprising observation also sheds light on the cooperative origin of neuronal burst in cultured networks. Our findings present an alternative flexible approach to the technique based on a massive tiling of networks by large-scale arrays of electrodes to monitor their activity.

Optimal interdependence between networks for the evolution of cooperation.

PubMed

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2013-01-01

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.

Optimal interdependence between networks for the evolution of cooperation

PubMed Central

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2013-01-01

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality. PMID:23959086

Cooperative Energy Harvesting-Adaptive MAC Protocol for WBANs

PubMed Central

Esteves, Volker; Antonopoulos, Angelos; Kartsakli, Elli; Puig-Vidal, Manel; Miribel-Català, Pere; Verikoukis, Christos

2015-01-01

In this paper, we introduce a cooperative medium access control (MAC) protocol, named cooperative energy harvesting (CEH)-MAC, that adapts its operation to the energy harvesting (EH) conditions in wireless body area networks (WBANs). In particular, the proposed protocol exploits the EH information in order to set an idle time that allows the relay nodes to charge their batteries and complete the cooperation phase successfully. Extensive simulations have shown that CEH-MAC significantly improves the network performance in terms of throughput, delay and energy efficiency compared to the cooperative operation of the baseline IEEE 802.15.6 standard. PMID:26029950

Intelligent Cooperative MAC Protocol for Balancing Energy Consumption

NASA Astrophysics Data System (ADS)

Wu, S.; Liu, K.; Huang, B.; Liu, F.

To extend the lifetime of wireless sensor networks, we proposed an intelligent balanced energy consumption cooperative MAC protocol (IBEC-CMAC) based on the multi-node cooperative transmission model. The protocol has priority to access high-quality channels for reducing energy consumption of each transmission. It can also balance the energy consumption among cooperative nodes by using high residual energy nodes instead of excessively consuming some node's energy. Simulation results show that IBEC-CMAC can obtain longer network lifetime and higher energy utilization than direct transmission.

A Comparative Study on Cooperative Learning in Multimedia and Network Environment Used by English Majors between China Mainland and Taiwan

ERIC Educational Resources Information Center

Xue, Gong; Lingling, Liu

2018-01-01

This paper first based on the theory of cooperative learning research. It analyses the characteristics and advantages of cooperative learning under the multimedia network environment. And then take China Three Gorges University and Taiwan I-Shou University English major students for example, using questionnaires and interviews to investigate the…

Adaptable Network Cooperate Catalog for Complex Information Objects. From Single Library to a Consortium: Sharing the Management and Distribution of Information Resources.

ERIC Educational Resources Information Center

Morag, Azriel

Libraries faced with the challenge of cooperative cataloging must maintain a high degree of unification within the library network (consortium) without compromising local libraries' independence. This paper compares a traditional model for cooperative catalogs achieved by means of a Union Catalog that depends entirely on replication of data…

Effective seeding strategy in evolutionary prisoner's dilemma games on online social networks

NASA Astrophysics Data System (ADS)

Xu, Bo; Shi, Huibin; Wang, Jianwei; Huang, Yun

2015-04-01

This paper explores effective seeding strategies in prisoner's dilemma game (PDG) on online social networks, i.e. the optimal strategy to obtain global cooperation with minimum cost. Three distinct seeding strategies are compared by performing computer simulations on real online social network datasets. Our finding suggests that degree centrality seeding outperforms other strategies regardless of the initial payoff setting or network size. Celebrities of online social networks play key roles in preserving cooperation.

Dynamics, morphogenesis and convergence of evolutionary quantum Prisoner's Dilemma games on networks

PubMed Central

Yong, Xi

2016-01-01

The authors proposed a quantum Prisoner's Dilemma (PD) game as a natural extension of the classic PD game to resolve the dilemma. Here, we establish a new Nash equilibrium principle of the game, propose the notion of convergence and discover the convergence and phase-transition phenomena of the evolutionary games on networks. We investigate the many-body extension of the game or evolutionary games in networks. For homogeneous networks, we show that entanglement guarantees a quick convergence of super cooperation, that there is a phase transition from the convergence of defection to the convergence of super cooperation, and that the threshold for the phase transitions is principally determined by the Nash equilibrium principle of the game, with an accompanying perturbation by the variations of structures of networks. For heterogeneous networks, we show that the equilibrium frequencies of super-cooperators are divergent, that entanglement guarantees emergence of super-cooperation and that there is a phase transition of the emergence with the threshold determined by the Nash equilibrium principle, accompanied by a perturbation by the variations of structures of networks. Our results explore systematically, for the first time, the dynamics, morphogenesis and convergence of evolutionary games in interacting and competing systems. PMID:27118882

Cooperation among cancer cells as public goods games on Voronoi networks.

PubMed

Archetti, Marco

2016-05-07

Cancer cells produce growth factors that diffuse and sustain tumour proliferation, a form of cooperation that can be studied using mathematical models of public goods in the framework of evolutionary game theory. Cell populations, however, form heterogeneous networks that cannot be described by regular lattices or scale-free networks, the types of graphs generally used in the study of cooperation. To describe the dynamics of growth factor production in populations of cancer cells, I study public goods games on Voronoi networks, using a range of non-linear benefits that account for the known properties of growth factors, and different types of diffusion gradients. The results are surprisingly similar to those obtained on regular graphs and different from results on scale-free networks, revealing that network heterogeneity per se does not promote cooperation when public goods diffuse beyond one-step neighbours. The exact shape of the diffusion gradient is not crucial, however, whereas the type of non-linear benefit is an essential determinant of the dynamics. Public goods games on Voronoi networks can shed light on intra-tumour heterogeneity, the evolution of resistance to therapies that target growth factors, and new types of cell therapy. Copyright © 2016 Elsevier Ltd. All rights reserved.

Intelligent distributed medical image management

NASA Astrophysics Data System (ADS)

Garcia, Hong-Mei C.; Yun, David Y.

1995-05-01

The rapid advancements in high performance global communication have accelerated cooperative image-based medical services to a new frontier. Traditional image-based medical services such as radiology and diagnostic consultation can now fully utilize multimedia technologies in order to provide novel services, including remote cooperative medical triage, distributed virtual simulation of operations, as well as cross-country collaborative medical research and training. Fast (efficient) and easy (flexible) retrieval of relevant images remains a critical requirement for the provision of remote medical services. This paper describes the database system requirements, identifies technological building blocks for meeting the requirements, and presents a system architecture for our target image database system, MISSION-DBS, which has been designed to fulfill the goals of Project MISSION (medical imaging support via satellite integrated optical network) -- an experimental high performance gigabit satellite communication network with access to remote supercomputing power, medical image databases, and 3D visualization capabilities in addition to medical expertise anywhere and anytime around the country. The MISSION-DBS design employs a synergistic fusion of techniques in distributed databases (DDB) and artificial intelligence (AI) for storing, migrating, accessing, and exploring images. The efficient storage and retrieval of voluminous image information is achieved by integrating DDB modeling and AI techniques for image processing while the flexible retrieval mechanisms are accomplished by combining attribute- based and content-based retrievals.

Randomly biased investments and the evolution of public goods on interdependent networks

NASA Astrophysics Data System (ADS)

Chen, Wei; Wu, Te; Li, Zhiwu; Wang, Long

2017-08-01

Deciding how to allocate resources between interdependent systems is significant to optimize efficiency. We study the effects of heterogeneous contribution, induced by such interdependency, on the evolution of cooperation, through implementing the public goods games on two-layer networks. The corresponding players on different layers try to share a fixed amount of resources as the initial investment properly. The symmetry breaking of investments between players located on different layers is able to either prevent investments from, or extract them out of the deadlock. Results show that a moderate investment heterogeneity is best favorable for the evolution of cooperation, and random allocation of investment bias suppresses the cooperators at a wide range of the investment bias and the enhancement effect. Further studies on time evolution with different initial strategy configurations show that the non-interdependent cooperators along the interface of interdependent cooperators also are an indispensable factor in facilitating cooperative behavior. Our main results are qualitatively unchanged even diversifying investment bias that is subject to uniform distribution. Our study may shed light on the understanding of the origin of cooperative behavior on interdependent networks.

A simple rule for the evolution of cooperation on graphs and social networks.

PubMed

Ohtsuki, Hisashi; Hauert, Christoph; Lieberman, Erez; Nowak, Martin A

2006-05-25

A fundamental aspect of all biological systems is cooperation. Cooperative interactions are required for many levels of biological organization ranging from single cells to groups of animals. Human society is based to a large extent on mechanisms that promote cooperation. It is well known that in unstructured populations, natural selection favours defectors over cooperators. There is much current interest, however, in studying evolutionary games in structured populations and on graphs. These efforts recognize the fact that who-meets-whom is not random, but determined by spatial relationships or social networks. Here we describe a surprisingly simple rule that is a good approximation for all graphs that we have analysed, including cycles, spatial lattices, random regular graphs, random graphs and scale-free networks: natural selection favours cooperation, if the benefit of the altruistic act, b, divided by the cost, c, exceeds the average number of neighbours, k, which means b/c > k. In this case, cooperation can evolve as a consequence of 'social viscosity' even in the absence of reputation effects or strategic complexity.

Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy

NASA Astrophysics Data System (ADS)

Shi, Chenguang; Salous, Sana; Wang, Fei; Zhou, Jianjiang

2017-08-01

Distributed radar network systems have been shown to have many unique features. Due to their advantage of signal and spatial diversities, radar networks are attractive for target detection. In practice, the netted radars in radar networks are supposed to maximize their transmit power to achieve better detection performance, which may be in contradiction with low probability of intercept (LPI). Therefore, this paper investigates the problem of adaptive power allocation for radar networks in a cooperative game-theoretic framework such that the LPI performance can be improved. Taking into consideration both the transmit power constraints and the minimum signal to interference plus noise ratio (SINR) requirement of each radar, a cooperative Nash bargaining power allocation game based on LPI is formulated, whose objective is to minimize the total transmit power by optimizing the power allocation in radar networks. First, a novel SINR-based network utility function is defined and utilized as a metric to evaluate power allocation. Then, with the well-designed network utility function, the existence and uniqueness of the Nash bargaining solution are proved analytically. Finally, an iterative Nash bargaining algorithm is developed that converges quickly to a Pareto optimal equilibrium for the cooperative game. Numerical simulations and theoretic analysis are provided to evaluate the effectiveness of the proposed algorithm.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

Review of amateur meteor research

NASA Astrophysics Data System (ADS)

Rendtel, Jürgen

2017-09-01

Significant amounts of meteor astronomical data are provided by amateurs worldwide, using various methods. This review concentrates on optical data. Long-term meteor shower analyses based on consistent data are possible over decades (Orionids, Geminids, κ-Cygnids) and allow combination with modelling results. Small and weak structures related to individual stream filaments of cometary dust have been analysed in both major and minor showers (Quadrantids, September ε-Perseids), providing feedback to meteoroid ejection and stream evolution processes. Meteoroid orbit determination from video meteor networks contributes to the improvement of the IAU meteor data base. Professional-amateur cooperation also concerns observations and detailed analysis of fireball data, including meteorite ground searches.

Discriminative Cooperative Networks for Detecting Phase Transitions

NASA Astrophysics Data System (ADS)

Liu, Ye-Hua; van Nieuwenburg, Evert P. L.

2018-04-01

The classification of states of matter and their corresponding phase transitions is a special kind of machine-learning task, where physical data allow for the analysis of new algorithms, which have not been considered in the general computer-science setting so far. Here we introduce an unsupervised machine-learning scheme for detecting phase transitions with a pair of discriminative cooperative networks (DCNs). In this scheme, a guesser network and a learner network cooperate to detect phase transitions from fully unlabeled data. The new scheme is efficient enough for dealing with phase diagrams in two-dimensional parameter spaces, where we can utilize an active contour model—the snake—from computer vision to host the two networks. The snake, with a DCN "brain," moves and learns actively in the parameter space, and locates phase boundaries automatically.

Game-theoretic cooperativity in networks of self-interested units

NASA Astrophysics Data System (ADS)

Barto, Andrew G.

1986-08-01

The behavior of theoretical neural networks is often described in terms of competition and cooperation. I present an approach to network learning that is related to game and team problems in which competition and cooperation have more technical meanings. I briefly describe the application of stochastic learning automata to game and team problems and then present an adaptive element that is a synthesis of aspects of stochastic learning automata and typical neuron-like adaptive elements. These elements act as self-interested agents that work toward improving their performance with respect to their individual preference orderings. Networks of these elements can solve a variety of team decision problems, some of which take the form of layered networks in which the ``hidden units'' become appropriate functional components as they attempt to improve their own payoffs.

Mutually cooperative epidemics on power-law networks

NASA Astrophysics Data System (ADS)

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.

Conformity hinders the evolution of cooperation on scale-free networks

NASA Astrophysics Data System (ADS)

Peña, Jorge; Volken, Henri; Pestelacci, Enea; Tomassini, Marco

2009-07-01

We study the effects of conformity, the tendency of humans to imitate locally common behaviors, in the evolution of cooperation when individuals occupy the vertices of a graph and engage in the one-shot prisoner’s dilemma or the snowdrift game with their neighbors. Two different graphs are studied: rings (one-dimensional lattices with cyclic boundary conditions) and scale-free networks of the Barabási-Albert type. The proposed evolutionary-graph model is studied both by means of Monte Carlo simulations and an extended pair-approximation technique. We find improved levels of cooperation when evolution is carried on rings and individuals imitate according to both the traditional payoff bias and a conformist bias. More importantly, we show that scale-free networks are no longer powerful amplifiers of cooperation when fair amounts of conformity are introduced in the imitation rules of the players. Such weakening of the cooperation-promoting abilities of scale-free networks is the result of a less biased flow of information in scale-free topologies, making hubs more susceptible of being influenced by less-connected neighbors.

Fiber optics interface for a dye laser oscillator and method

DOEpatents

Johnson, Steve A.; Seppala, Lynn G.

1986-01-01

A dye laser oscillator in which one light beam is used to pump a continuous tream of dye within a cooperating dye chamber for producing a second, different beam is generally disclosed herein along with a specific arrangement including an optical fiber and a fiber optics interface for directing the pumping beam into the dye chamber. The specific fiber optics interface illustrated includes three cooperating lenses which together image one particular dimension of the pumping beam into the dye chamber from the output end of the optical fiber in order to insure that the dye chamber is properly illuminated by the pumping beam.

Fiber optics interface for a dye laser oscillator and method

DOEpatents

Johnson, S.A.; Seppala, L.G.

1984-06-13

A dye laser oscillator in which one light beam is used to pump a continuous stream of dye within a cooperating dye chamber for producing a second, different beam is generally disclosed herein along with a specific arrangement including an optical fiber and a fiber optics interface for directing the pumping beam into the dye chamber. The specific fiber optics interface illustrated includes three cooperating lenses which together image one particular dimension of the pumping beam into the dye chamber from the output end of the optical fiber in order to insure that the dye chamber is properly illuminated by the pumping beam.

Fiber-Optic Terahertz Data-Communication Networks

NASA Technical Reports Server (NTRS)

Chua, Peter L.; Lambert, James L.; Morookian, John M.; Bergman, Larry A.

1994-01-01

Network protocols implemented in optical domain. Fiber-optic data-communication networks utilize fully available bandwidth of single-mode optical fibers. Two key features of method: use of subpicosecond laser pulses as carrier signals and spectral phase modulation of pulses for optical implementation of code-division multiple access as multiplexing network protocol. Local-area network designed according to concept offers full crossbar functionality, security of data in transit through network, and capacity about 100 times that of typical fiber-optic local-area network in current use.

Simultaneous multi-patch-clamp and extracellular-array recordings: Single neuron reflects network activity

NASA Astrophysics Data System (ADS)

Vardi, Roni; Goldental, Amir; Sardi, Shira; Sheinin, Anton; Kanter, Ido

2016-11-01

The increasing number of recording electrodes enhances the capability of capturing the network’s cooperative activity, however, using too many monitors might alter the properties of the measured neural network and induce noise. Using a technique that merges simultaneous multi-patch-clamp and multi-electrode array recordings of neural networks in-vitro, we show that the membrane potential of a single neuron is a reliable and super-sensitive probe for monitoring such cooperative activities and their detailed rhythms. Specifically, the membrane potential and the spiking activity of a single neuron are either highly correlated or highly anti-correlated with the time-dependent macroscopic activity of the entire network. This surprising observation also sheds light on the cooperative origin of neuronal burst in cultured networks. Our findings present an alternative flexible approach to the technique based on a massive tiling of networks by large-scale arrays of electrodes to monitor their activity.

Simultaneous multi-patch-clamp and extracellular-array recordings: Single neuron reflects network activity

PubMed Central

Vardi, Roni; Goldental, Amir; Sardi, Shira; Sheinin, Anton; Kanter, Ido

2016-01-01

The increasing number of recording electrodes enhances the capability of capturing the network’s cooperative activity, however, using too many monitors might alter the properties of the measured neural network and induce noise. Using a technique that merges simultaneous multi-patch-clamp and multi-electrode array recordings of neural networks in-vitro, we show that the membrane potential of a single neuron is a reliable and super-sensitive probe for monitoring such cooperative activities and their detailed rhythms. Specifically, the membrane potential and the spiking activity of a single neuron are either highly correlated or highly anti-correlated with the time-dependent macroscopic activity of the entire network. This surprising observation also sheds light on the cooperative origin of neuronal burst in cultured networks. Our findings present an alternative flexible approach to the technique based on a massive tiling of networks by large-scale arrays of electrodes to monitor their activity. PMID:27824075

Improved Iterative Decoding of Network-Channel Codes for Multiple-Access Relay Channel.

PubMed

Majumder, Saikat; Verma, Shrish

2015-01-01

Cooperative communication using relay nodes is one of the most effective means of exploiting space diversity for low cost nodes in wireless network. In cooperative communication, users, besides communicating their own information, also relay the information of other users. In this paper we investigate a scheme where cooperation is achieved using a common relay node which performs network coding to provide space diversity for two information nodes transmitting to a base station. We propose a scheme which uses Reed-Solomon error correcting code for encoding the information bit at the user nodes and convolutional code as network code, instead of XOR based network coding. Based on this encoder, we propose iterative soft decoding of joint network-channel code by treating it as a concatenated Reed-Solomon convolutional code. Simulation results show significant improvement in performance compared to existing scheme based on compound codes.

Image acquisition unit for the Mayo/IBM PACS project

NASA Astrophysics Data System (ADS)

Reardon, Frank J.; Salutz, James R.

1991-07-01

The Mayo Clinic and IBM Rochester, Minnesota, have jointly developed a picture archiving, distribution and viewing system for use with Mayo's CT and MRI imaging modalities. Images are retrieved from the modalities and sent over the Mayo city-wide token ring network to optical storage subsystems for archiving, and to server subsystems for viewing on image review stations. Images may also be retrieved from archive and transmitted back to the modalities. The subsystems that interface to the modalities and communicate to the other components of the system are termed Image Acquisition Units (LAUs). The IAUs are IBM Personal System/2 (PS/2) computers with specially developed software. They operate independently in a network of cooperative subsystems and communicate with the modalities, archive subsystems, image review server subsystems, and a central subsystem that maintains information about the content and location of images. This paper provides a detailed description of the function and design of the Image Acquisition Units.

SpaceView (Viral Space Situational Awareness) One Year Update

NASA Astrophysics Data System (ADS)

Gleckler, A.; Butterfield, M.; Copenhaver, R.; Wade, A.; Apponi, A.

2013-09-01

Viral SSA takes advantage of the amateur astronomy community to provide an extremely low-cost and geographically-diverse network of optical SSA sites. In the spirit of programs such as DARPA's Grand Challenge and the National Weather Service's program of providing amateur meteorologists with weather stations linked to a central professional meteorological facility, we form a cooperative bond with a willing community of technicallyminded individuals. We term this program "viral" because we will qualify an initial set of astronomers for SSA operation and then use word of mouth in the astronomy community, as well as an outreach program, to pull in new observers. The use of modern remote controlled telescopes allows the incorporation of certified amateur, university, and commercial telescope systems. The availability of the local Viral SSA member for troubleshooting eliminates most significant costs of operating a large network. In this talk, we discuss the project's first year and the roadmap for the next two years.

Integrated networks and health care provider cooperatives: new models for rural health care delivery and financing.

PubMed

Casey, M M

1997-01-01

Minnesota's 1994 health care reform legislation authorized the establishment of community integrated service networks (CISNs) and health care provider cooperatives, which were envisioned as new health care delivery models that could be successfully implemented in rural areas of the state. Four CISNs are licensed, and three organizations are incorporated as health care provider cooperatives. Many of the policy issues Minnesota has faced regarding the development of CISNs and health care provider cooperatives in rural areas are similar to those raised by current Medicare reform proposals.

Groundwater and streamflow information program Kansas Cooperative Water Science since 1895

USGS Publications Warehouse

Painter, Colin C.; Kramer, Ariele R.; Kelly, Brian P.

2017-05-10

The U.S. Geological Survey, in cooperation with State, local, and other Federal agencies, operates a network of streamgages throughout the State of Kansas. Data provided by this network are used to forecast floods, operate reservoirs, develop water policy, administer regulation of water, and perform interpretive analyses of streamflow. This data collection and analysis effort has been sustained since 1895 through cooperative matching fund programs that allow the USGS to work with cooperative agencies to solve groundwater and surface water challenges that affect citizens locally and throughout the Nation.  

Learning by statistical cooperation of self-interested neuron-like computing elements.

PubMed

Barto, A G

1985-01-01

Since the usual approaches to cooperative computation in networks of neuron-like computating elements do not assume that network components have any "preferences", they do not make substantive contact with game theoretic concepts, despite their use of some of the same terminology. In the approach presented here, however, each network component, or adaptive element, is a self-interested agent that prefers some inputs over others and "works" toward obtaining the most highly preferred inputs. Here we describe an adaptive element that is robust enough to learn to cooperate with other elements like itself in order to further its self-interests. It is argued that some of the longstanding problems concerning adaptation and learning by networks might be solvable by this form of cooperativity, and computer simulation experiments are described that show how networks of self-interested components that are sufficiently robust can solve rather difficult learning problems. We then place the approach in its proper historical and theoretical perspective through comparison with a number of related algorithms. A secondary aim of this article is to suggest that beyond what is explicitly illustrated here, there is a wealth of ideas from game theory and allied disciplines such as mathematical economics that can be of use in thinking about cooperative computation in both nervous systems and man-made systems.

Applications of Time-Reversal Processing for Planetary Surface Communications

NASA Technical Reports Server (NTRS)

Barton, Richard J.

2007-01-01

Due to the power constraints imposed on wireless sensor and communication networks deployed on a planetary surface during exploration, energy efficient transfer of data becomes a critical issue. In situations where groups of nodes within a network are located in relatively close proximity, cooperative communication techniques can be utilized to improve the range, data rate, power efficiency, and lifetime of the network. In particular, if the point-to-point communication channels on the network are well modeled as frequency non-selective, distributed or cooperative beamforming can employed. For frequency-selective channels, beamforming itself is not generally appropriate, but a natural generalization of it, time-reversal communication (TRC), can still be effective. Time-reversal processing has been proposed and studied previously for other applications, including acoustical imaging, electromagnetic imaging, underwater acoustic communication, and wireless communication channels. In this paper, we study both the theoretical advantages and the experimental performance of cooperative TRC for wireless communication on planetary surfaces. We give a brief introduction to TRC and present several scenarios where TRC could be profitably employed during planetary exploration. We also present simulation results illustrating the performance of cooperative TRC employed in a complex multipath environment and discuss the optimality of cooperative TRC for data aggregation in wireless sensor networks

Allocation of spectral and spatial modes in multidimensional metro-access optical networks

NASA Astrophysics Data System (ADS)

Gao, Wenbo; Cvijetic, Milorad

2018-04-01

Introduction of spatial division multiplexing (SDM) has added a new dimension in an effort to increase optical fiber channel capacity. At the same time, it can also be explored as an advanced optical networking tool. In this paper, we have investigated the resource allocation to end-users in multidimensional networking structure with plurality of spectral and spatial modes actively deployed in different networking segments. This presents a more comprehensive method as compared to the common practice where the segments of optical network are analyzed independently since the interaction between network hierarchies is included into consideration. We explored the possible transparency from the metro/core network to the optical access network, analyzed the potential bottlenecks from the network architecture perspective, and identified an optimized network structure. In our considerations, the viability of optical grooming through the entire hierarchical all-optical network is investigated by evaluating the effective utilization and spectral efficiency of the network architecture.

Energy-Efficient Next-Generation Passive Optical Networks Based on Sleep Mode and Heuristic Optimization

NASA Astrophysics Data System (ADS)

Zulai, Luis G. T.; Durand, Fábio R.; Abrão, Taufik

2015-05-01

In this article, an energy-efficiency mechanism for next-generation passive optical networks is investigated through heuristic particle swarm optimization. Ten-gigabit Ethernet-wavelength division multiplexing optical code division multiplexing-passive optical network next-generation passive optical networks are based on the use of a legacy 10-gigabit Ethernet-passive optical network with the advantage of using only an en/decoder pair of optical code division multiplexing technology, thus eliminating the en/decoder at each optical network unit. The proposed joint mechanism is based on the sleep-mode power-saving scheme for a 10-gigabit Ethernet-passive optical network, combined with a power control procedure aiming to adjust the transmitted power of the active optical network units while maximizing the overall energy-efficiency network. The particle swarm optimization based power control algorithm establishes the optimal transmitted power in each optical network unit according to the network pre-defined quality of service requirements. The objective is controlling the power consumption of the optical network unit according to the traffic demand by adjusting its transmitter power in an attempt to maximize the number of transmitted bits with minimum energy consumption, achieving maximal system energy efficiency. Numerical results have revealed that it is possible to save 75% of energy consumption with the proposed particle swarm optimization based sleep-mode energy-efficiency mechanism compared to 55% energy savings when just a sleeping-mode-based mechanism is deployed.

Link prediction based on nonequilibrium cooperation effect

NASA Astrophysics Data System (ADS)

Li, Lanxi; Zhu, Xuzhen; Tian, Hui

2018-04-01

Link prediction in complex networks has become a common focus of many researchers. But most existing methods concentrate on neighbors, and rarely consider degree heterogeneity of two endpoints. Node degree represents the importance or status of endpoints. We describe the large-degree heterogeneity as the nonequilibrium between nodes. This nonequilibrium facilitates a stable cooperation between endpoints, so that two endpoints with large-degree heterogeneity tend to connect stably. We name such a phenomenon as the nonequilibrium cooperation effect. Therefore, this paper proposes a link prediction method based on the nonequilibrium cooperation effect to improve accuracy. Theoretical analysis will be processed in advance, and at the end, experiments will be performed in 12 real-world networks to compare the mainstream methods with our indices in the network through numerical analysis.

Cooperative Adaptive Output Regulation for Second-Order Nonlinear Multiagent Systems With Jointly Connected Switching Networks.

PubMed

Liu, Wei; Huang, Jie

2018-03-01

This paper studies the cooperative global robust output regulation problem for a class of heterogeneous second-order nonlinear uncertain multiagent systems with jointly connected switching networks. The main contributions consist of the following three aspects. First, we generalize the result of the adaptive distributed observer from undirected jointly connected switching networks to directed jointly connected switching networks. Second, by performing a new coordinate and input transformation, we convert our problem into the cooperative global robust stabilization problem of a more complex augmented system via the distributed internal model principle. Third, we solve the stabilization problem by a distributed state feedback control law. Our result is illustrated by the leader-following consensus problem for a group of Van der Pol oscillators.

NetCooperate: a network-based tool for inferring host-microbe and microbe-microbe cooperation.

PubMed

Levy, Roie; Carr, Rogan; Kreimer, Anat; Freilich, Shiri; Borenstein, Elhanan

2015-05-17

Host-microbe and microbe-microbe interactions are often governed by the complex exchange of metabolites. Such interactions play a key role in determining the way pathogenic and commensal species impact their host and in the assembly of complex microbial communities. Recently, several studies have demonstrated how such interactions are reflected in the organization of the metabolic networks of the interacting species, and introduced various graph theory-based methods to predict host-microbe and microbe-microbe interactions directly from network topology. Using these methods, such studies have revealed evolutionary and ecological processes that shape species interactions and community assembly, highlighting the potential of this reverse-ecology research paradigm. NetCooperate is a web-based tool and a software package for determining host-microbe and microbe-microbe cooperative potential. It specifically calculates two previously developed and validated metrics for species interaction: the Biosynthetic Support Score which quantifies the ability of a host species to supply the nutritional requirements of a parasitic or a commensal species, and the Metabolic Complementarity Index which quantifies the complementarity of a pair of microbial organisms' niches. NetCooperate takes as input a pair of metabolic networks, and returns the pairwise metrics as well as a list of potential syntrophic metabolic compounds. The Biosynthetic Support Score and Metabolic Complementarity Index provide insight into host-microbe and microbe-microbe metabolic interactions. NetCooperate determines these interaction indices from metabolic network topology, and can be used for small- or large-scale analyses. NetCooperate is provided as both a web-based tool and an open-source Python module; both are freely available online at http://elbo.gs.washington.edu/software_netcooperate.html.

Coevolving agent strategies and network topology for the public goods games

NASA Astrophysics Data System (ADS)

Zhang, C. Y.; Zhang, J. L.; Xie, G. M.; Wang, L.

2011-03-01

Much of human cooperation remains an evolutionary riddle. Coevolutionary public goods games in structured populations are studied where players can change from an unproductive public goods game to a productive one, by evaluating the productivity of the public goods games. In our model, each individual participates in games organized by its neighborhood plus by itself. Coevolution here refers to an evolutionary process entailing both deletion of existing links and addition of new links between agents that accompanies the evolution of their strategies. Furthermore, we investigate the effects of time scale separation of strategy and structure on cooperation level. This study presents the following: Foremost, we observe that high cooperation levels in public goods interactions are attained by the entangled coevolution of strategy and structure. Presented results also confirm that the resulting networks show many features of real systems, such as cooperative behavior and hierarchical clustering. The heterogeneity of the interaction network is held responsible for the observed promotion of cooperation. We hope our work may offer an explanation for the origin of large-scale cooperative behavior among unrelated individuals.

Evolution of Cooperation in Adaptive Social Networks

NASA Astrophysics Data System (ADS)

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.

Analysis of blocking probability for OFDM-based variable bandwidth optical network

NASA Astrophysics Data System (ADS)

Gong, Lei; Zhang, Jie; Zhao, Yongli; Lin, Xuefeng; Wu, Yuyao; Gu, Wanyi

2011-12-01

Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique. For optical networks, because of its good spectral efficiency, flexibility, and tolerance to impairments, optical OFDM is much more flexible compared to traditional WDM systems, enabling elastic bandwidth transmissions, and optical networking is the future trend of development. In OFDM-based optical network the research of blocking rate has very important significance for network assessment. Current research for WDM network is basically based on a fixed bandwidth, in order to accommodate the future business and the fast-changing development of optical network, our study is based on variable bandwidth OFDM-based optical networks. We apply the mathematical analysis and theoretical derivation, based on the existing theory and algorithms, research blocking probability of the variable bandwidth of optical network, and then we will build a model for blocking probability.

Throughput and Energy Efficiency of a Cooperative Hybrid ARQ Protocol for Underwater Acoustic Sensor Networks

PubMed Central

Ghosh, Arindam; Lee, Jae-Won; Cho, Ho-Shin

2013-01-01

Due to its efficiency, reliability and better channel and resource utilization, cooperative transmission technologies have been attractive options in underwater as well as terrestrial sensor networks. Their performance can be further improved if merged with forward error correction (FEC) techniques. In this paper, we propose and analyze a retransmission protocol named Cooperative-Hybrid Automatic Repeat reQuest (C-HARQ) for underwater acoustic sensor networks, which exploits both the reliability of cooperative ARQ (CARQ) and the efficiency of incremental redundancy-hybrid ARQ (IR-HARQ) using rate-compatible punctured convolution (RCPC) codes. Extensive Monte Carlo simulations are performed to investigate the performance of the protocol, in terms of both throughput and energy efficiency. The results clearly reveal the enhancement in performance achieved by the C-HARQ protocol, which outperforms both CARQ and conventional stop and wait ARQ (S&W ARQ). Further, using computer simulations, optimum values of various network parameters are estimated so as to extract the best performance out of the C-HARQ protocol. PMID:24217359

Heterogeneous Coupling between Interdependent Lattices Promotes the Cooperation in the Prisoner’s Dilemma Game

PubMed Central

Xia, Cheng-Yi; Meng, Xiao-Kun; Wang, Zhen

2015-01-01

In the research realm of game theory, interdependent networks have extended the content of spatial reciprocity, which needs the suitable coupling between networks. However, thus far, the vast majority of existing works just assume that the coupling strength between networks is symmetric. This hypothesis, to some extent, seems inconsistent with the ubiquitous observation of heterogeneity. Here, we study how the heterogeneous coupling strength, which characterizes the interdependency of utility between corresponding players of both networks, affects the evolution of cooperation in the prisoner’s dilemma game with two types of coupling schemes (symmetric and asymmetric ones). Compared with the traditional case, we show that heterogeneous coupling greatly promotes the collective cooperation. The symmetric scheme seems much better than the asymmetric case. Moreover, the role of varying amplitude of coupling strength is also studied on these two interdependent ways. Current findings are helpful for us to understand the evolution of cooperation within many real-world systems, in particular for the interconnected and interrelated systems. PMID:26102082

Heterogeneous Coupling between Interdependent Lattices Promotes the Cooperation in the Prisoner's Dilemma Game.

PubMed

Xia, Cheng-Yi; Meng, Xiao-Kun; Wang, Zhen

2015-01-01

In the research realm of game theory, interdependent networks have extended the content of spatial reciprocity, which needs the suitable coupling between networks. However, thus far, the vast majority of existing works just assume that the coupling strength between networks is symmetric. This hypothesis, to some extent, seems inconsistent with the ubiquitous observation of heterogeneity. Here, we study how the heterogeneous coupling strength, which characterizes the interdependency of utility between corresponding players of both networks, affects the evolution of cooperation in the prisoner's dilemma game with two types of coupling schemes (symmetric and asymmetric ones). Compared with the traditional case, we show that heterogeneous coupling greatly promotes the collective cooperation. The symmetric scheme seems much better than the asymmetric case. Moreover, the role of varying amplitude of coupling strength is also studied on these two interdependent ways. Current findings are helpful for us to understand the evolution of cooperation within many real-world systems, in particular for the interconnected and interrelated systems.

Celestial data routing network

NASA Astrophysics Data System (ADS)

Bordetsky, Alex

2000-11-01

Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

Collaboration between industry and academia--prospects for male fertility control.

PubMed

Stock, G; Habenicht, U F

1999-12-01

Drug development within the pharmaceutical industry is probably the field with the highest level of regulations. Due to the complexity of the different components of drug development and drug surveillance the need for a sophisticated organization and infrastructure is obvious. In addition, there is a necessity for sufficient resources and long-term commitment as well as logistic and long-term knowledge management. In order to secure high professional standards at all levels of this highly complex value creating chain, the number of cooperative arrangements in the pharmaceutical industry are increasing. The identification of new targets in the drug finding process calls in particular for outside partners. At the same time the preparedness of non-industrial researchers to cooperate with industry has also increased significantly. The area of fertility control, especially male fertility control, provides an excellent example for this kind of cooperation between industrial and non-industrial partners. Here a cooperative network is described which probably meets practically all relevant criteria for both the non-industrial but also the industrial partner. Some principles for the management of such a cooperative network are discussed. We believe that this kind of network can serve as a model for similar networks in other fields.

A cooperative positioning with Kalman filters and handover mechanism for indoor microcellular visible light communication network

NASA Astrophysics Data System (ADS)

Xiong, Jieqing; Huang, Zhitong; Zhuang, Kaiyu; Ji, Yuefeng

2016-08-01

We propose a novel handover scheme for indoor microcellular visible light communication (VLC) network. With such a scheme, the room, which is fully coverage by light, is divided into several microcells according to the layout of light-emitting diodes (LEDs). However, the directionality of light arises new challenges in keeping the connectivity between the mobile devices and light source under the mobile circumstances. The simplest solution is that all LEDs broadcast data of every user simultaneously, but it wastes too much bandwidth resource, especially when the amount of users increases. To solve this key problem, we utilize the optical positioning assisting handover procedure in this paper. In the positioning stage, the network manager obtains the location information of user device via downlink and uplink signal strength information, which is white light and infrared, respectively. After that, a Kalman filter is utilized for improving the tracking performance of a mobile device. Then, the network manager decides how to initiate the handover process by the previous information. Results show that the proposed scheme can achieve low-cost, seamless data communication, and a high probability of successful handover.

The evolutionary advantage of limited network knowledge.

PubMed

Larson, Jennifer M

2016-06-07

Groups of individuals have social networks that structure interactions within the groups; evolutionary theory increasingly uses this fact to explain the emergence of cooperation (Eshel and Cavalli-Sforza, 1982; Boyd and Richerson, 1988, 1989; Ohtsuki et al., 2006; Nowak et al., 2010; Van Veelen et al., 2012). This approach has resulted in a number of important insights for the evolution of cooperation in the biological and social sciences, but omits a key function of social networks that has persisted throughout recent evolutionary history (Apicella et al., 2012): their role in transmitting gossip about behavior within a group. Accounting for this well-established role of social networks among rational agents in a setting of indirect reciprocity not only shows a new mechanism by which the structure of networks is fitness-relevant, but also reveals that knowledge of social networks can be fitness-relevant as well. When groups enforce cooperation by sanctioning peers whom gossip reveals to have deviated, individuals in certain peripheral network positions are tempting targets of uncooperative behavior because gossip they share about misbehavior spreads slowly through the network. The ability to identify these individuals creates incentives to behave uncooperatively. Consequently, groups comprised of individuals who knew precise information about their social networks would be at a fitness disadvantage relative to groups of individuals with a coarser knowledge of their networks. Empirical work has consistently shown that modern humans know little about the structure of their own social networks and perform poorly when tasked with learning new ones. This robust empirical regularity may be the product of natural selection in an environment of strong selective pressure at the group level. Imprecise views of networks make enforcing cooperation easier. Copyright © 2016 Elsevier Ltd. All rights reserved.

Intelligentization: an efficient means to get more from optical networking

NASA Astrophysics Data System (ADS)

Chen, Zhi Yun

2001-10-01

Infocom is a term used to describe the merger of Information and Communications and is used to show the radical changes in today's network traffic. The continuous growth of Infocom traffic, especially that of Internet, is driving Infocom networks to expand rapidly. To service providers, the traffic is consuming the bandwidth of their network. Simultaneously, users are complaining too slow, the net never stopped in China. It is the reality faced by both the service providers and equipment vendors. Demands from both the customers and competition in market call for an efficient network infrastructure. What should a Service Provider do? This paper will first analyze the development trends of optical networking and the formation of the concepts of Intelligent Optical Network (ION) and Automatic Switched Optical Network (ASON) as a solution to this problem. Next it will look at the ways to bring intelligence into optical networks, discussing the benefits to service providers by showing some application examples. Finally, it concludes that the development of optical networking has arrived at a point of introducing intelligence into optical networks. The intelligent optical networks and Automatic Switched Optical Networks will immediately bring a wide range of benefit to service providers, equipment vendors, and, of course, the end users.

Optical network democratization.

PubMed

Nejabati, Reza; Peng, Shuping; Simeonidou, Dimitra

2016-03-06

The current Internet infrastructure is not able to support independent evolution and innovation at physical and network layer functionalities, protocols and services, while at same time supporting the increasing bandwidth demands of evolving and heterogeneous applications. This paper addresses this problem by proposing a completely democratized optical network infrastructure. It introduces the novel concepts of the optical white box and bare metal optical switch as key technology enablers for democratizing optical networks. These are programmable optical switches whose hardware is loosely connected internally and is completely separated from their control software. To alleviate their complexity, a multi-dimensional abstraction mechanism using software-defined network technology is proposed. It creates a universal model of the proposed switches without exposing their technological details. It also enables a conventional network programmer to develop network applications for control of the optical network without specific technical knowledge of the physical layer. Furthermore, a novel optical network virtualization mechanism is proposed, enabling the composition and operation of multiple coexisting and application-specific virtual optical networks sharing the same physical infrastructure. Finally, the optical white box and the abstraction mechanism are experimentally evaluated, while the virtualization mechanism is evaluated with simulation. © 2016 The Author(s).

Routing and wavelength assignment based on normalized resource and constraints for all-optical network

NASA Astrophysics Data System (ADS)

Joo, Seong-Soon; Nam, Hyun-Soon; Lim, Chang-Kyu

2003-08-01

With the rapid growth of the Optical Internet, high capacity pipes is finally destined to support end-to-end IP on the WDM optical network. Newly launched 2D MEMS optical switching module in the market supports that expectations of upcoming a transparent optical cross-connect in the network have encouraged the field applicable research on establishing real all-optical transparent network. To open up a customer-driven bandwidth services, design of the optical transport network becomes more challenging task in terms of optimal network resource usage. This paper presents a practical approach to finding a route and wavelength assignment for wavelength routed all-optical network, which has λ-plane OXC switches and wavelength converters, and supports that optical paths are randomly set up and released by dynamic wavelength provisioning to create bandwidth between end users with timescales on the order of seconds or milliseconds. We suggest three constraints to make the RWA problem become more practical one on deployment for wavelength routed all-optical network in network view: limitation on maximum hop of a route within bearable optical network impairments, limitation on minimum hops to travel before converting a wavelength, and limitation on calculation time to find all routes for connections requested at once. We design the NRCD (Normalized Resource and Constraints for All-Optical Network RWA Design) algorithm for the Tera OXC: network resource for a route is calculated by the number of internal switching paths established in each OXC nodes on the route, and is normalized by ratio of number of paths established and number of paths equipped in a node. We show that it fits for the RWA algorithm of the wavelength routed all-optical network through real experiments on the distributed objects platform.

Research-oriented teaching in optical design course and its function in education

NASA Astrophysics Data System (ADS)

Cen, Zhaofeng; Li, Xiaotong; Liu, Xiangdong; Deng, Shitao

2008-03-01

The principles and operation plans of research-oriented teaching in the course of computer aided optical design are presented, especially the mode of research in practice course. This program includes contract definition phase, project organization and execution, post project evaluation and discussion. Modes of academic organization are used in the practice course of computer aided optical design. In this course the students complete their design projects in research teams by autonomous group approach and cooperative exploration. In this research process they experience the interpersonal relationship in modern society, the importance of cooperation in team, the functions of each individual, the relationships between team members, the competition and cooperation in one academic group and with other groups, and know themselves objectively. In the design practice the knowledge of many academic fields is applied including applied optics, computer programming, engineering software and etc. The characteristic of interdisciplinary is very useful for academic research and makes the students be ready for innovation by integrating the knowledge of interdisciplinary field. As shown by the practice that this teaching mode has taken very important part in bringing up the abilities of engineering, cooperation, digesting the knowledge at a high level and problem analyzing and solving.

NetCoDer: A Retransmission Mechanism for WSNs Based on Cooperative Relays and Network Coding

PubMed Central

Valle, Odilson T.; Montez, Carlos; Medeiros de Araujo, Gustavo; Vasques, Francisco; Moraes, Ricardo

2016-01-01

Some of the most difficult problems to deal with when using Wireless Sensor Networks (WSNs) are related to the unreliable nature of communication channels. In this context, the use of cooperative diversity techniques and the application of network coding concepts may be promising solutions to improve the communication reliability. In this paper, we propose the NetCoDer scheme to address this problem. Its design is based on merging cooperative diversity techniques and network coding concepts. We evaluate the effectiveness of the NetCoDer scheme through both an experimental setup with real WSN nodes and a simulation assessment, comparing NetCoDer performance against state-of-the-art TDMA-based (Time Division Multiple Access) retransmission techniques: BlockACK, Master/Slave and Redundant TDMA. The obtained results highlight that the proposed NetCoDer scheme clearly improves the network performance when compared with other retransmission techniques. PMID:27258280

Cooperative behavior cascades in human social networks.

PubMed

Fowler, James H; Christakis, Nicholas A

2010-03-23

Theoretical models suggest that social networks influence the evolution of cooperation, but to date there have been few experimental studies. Observational data suggest that a wide variety of behaviors may spread in human social networks, but subjects in such studies can choose to befriend people with similar behaviors, posing difficulty for causal inference. Here, we exploit a seminal set of laboratory experiments that originally showed that voluntary costly punishment can help sustain cooperation. In these experiments, subjects were randomly assigned to a sequence of different groups to play a series of single-shot public goods games with strangers; this feature allowed us to draw networks of interactions to explore how cooperative and uncooperative behaviors spread from person to person to person. We show that, in both an ordinary public goods game and in a public goods game with punishment, focal individuals are influenced by fellow group members' contribution behavior in future interactions with other individuals who were not a party to the initial interaction. Furthermore, this influence persists for multiple periods and spreads up to three degrees of separation (from person to person to person to person). The results suggest that each additional contribution a subject makes to the public good in the first period is tripled over the course of the experiment by other subjects who are directly or indirectly influenced to contribute more as a consequence. These results show experimentally that cooperative behavior cascades in human social networks.

Optical RRH working in an all-optical fronthaul network

NASA Astrophysics Data System (ADS)

Zakrzewski, Zbigniew

2017-12-01

The paper presents an example of an optical RRH (Remote Radio Head) design, which is equipped with photonic components for direct connection to an all-optical network. The features that can be fulfilled by an all-optical network are indicated to support future 5G mobile networks. The demand for optical bandwidth in fronthaul/midhaul distribution network links, working in D-RoF and A-RoF formats was performed. The increase in demand is due to the very large traffic generated by the Optical Massive-MIMO RRH/RRU will work in format of an Active-Distributed Antenna System (A-DAS). An exemplary next-generation mobile network that will utilize O-RRH and an all-optical backbone is presented. All components of presented network will work in the Centralized/Cloud Radio Access Network (C-RAN) architecture, which is achievable by control with the use of the OpenFlow (OF).

Cooperative SIS epidemics can lead to abrupt outbreaks

NASA Astrophysics Data System (ADS)

Ghanbarnejad, Fakhteh; Chen, Li; Cai, Weiran; Grassberger, Peter

2015-03-01

In this paper, we study spreading of two cooperative SIS epidemics in mean field approximations and also within an agent based framework. Therefore we investigate dynamics on different topologies like Erdos-Renyi networks and regular lattices. We show that cooperativity of two diseases can lead to strongly first order outbreaks, while the dynamics still might present some scaling laws typical for second order phase transitions. We argue how topological network features might be related to this interesting hybrid behaviors.

A model for the emergence of cooperation, interdependence, and structure in evolving networks.

PubMed

Jain, S; Krishna, S

2001-01-16

Evolution produces complex and structured networks of interacting components in chemical, biological, and social systems. We describe a simple mathematical model for the evolution of an idealized chemical system to study how a network of cooperative molecular species arises and evolves to become more complex and structured. The network is modeled by a directed weighted graph whose positive and negative links represent "catalytic" and "inhibitory" interactions among the molecular species, and which evolves as the least populated species (typically those that go extinct) are replaced by new ones. A small autocatalytic set, appearing by chance, provides the seed for the spontaneous growth of connectivity and cooperation in the graph. A highly structured chemical organization arises inevitably as the autocatalytic set enlarges and percolates through the network in a short analytically determined timescale. This self organization does not require the presence of self-replicating species. The network also exhibits catastrophes over long timescales triggered by the chance elimination of "keystone" species, followed by recoveries.

A model for the emergence of cooperation, interdependence, and structure in evolving networks

NASA Astrophysics Data System (ADS)

Jain, Sanjay; Krishna, Sandeep

2001-01-01

Evolution produces complex and structured networks of interacting components in chemical, biological, and social systems. We describe a simple mathematical model for the evolution of an idealized chemical system to study how a network of cooperative molecular species arises and evolves to become more complex and structured. The network is modeled by a directed weighted graph whose positive and negative links represent "catalytic" and "inhibitory" interactions among the molecular species, and which evolves as the least populated species (typically those that go extinct) are replaced by new ones. A small autocatalytic set, appearing by chance, provides the seed for the spontaneous growth of connectivity and cooperation in the graph. A highly structured chemical organization arises inevitably as the autocatalytic set enlarges and percolates through the network in a short analytically determined timescale. This self organization does not require the presence of self-replicating species. The network also exhibits catastrophes over long timescales triggered by the chance elimination of "keystone" species, followed by recoveries.

Mutual Co-operation for Schools Development: Some Experiences from Asia and the Pacific. Report of a Study Group (Bangkok, Thailand, November 6-17, 1984).

ERIC Educational Resources Information Center

United Nations Educational, Scientific, and Cultural Organization, Bangkok (Thailand). Regional Office for Education in Asia and the Pacific.

Focusing on the use of networking structures as a means of promoting and mobilizing inter-institutional support for educational development, this publication reports on topics raised at a meeting held by the Study Group on Inter-Institutional and Other Co-operative Networking Structures. Chapter 1 reports on ways in which networking is taking root…

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel

PubMed Central

Sakin, Sayef Azad; Alamri, Atif; Tran, Nguyen H.

2017-01-01

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies. PMID:29215591

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel.

PubMed

Sakin, Sayef Azad; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Alamri, Atif; Tran, Nguyen H; Fortino, Giancarlo

2017-12-07

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

Network-based reading system for lung cancer screening CT

NASA Astrophysics Data System (ADS)

Fujino, Yuichi; Fujimura, Kaori; Nomura, Shin-ichiro; Kawashima, Harumi; Tsuchikawa, Megumu; Matsumoto, Toru; Nagao, Kei-ichi; Uruma, Takahiro; Yamamoto, Shinji; Takizawa, Hotaka; Kuroda, Chikazumi; Nakayama, Tomio

2006-03-01

This research aims to support chest computed tomography (CT) medical checkups to decrease the death rate by lung cancer. We have developed a remote cooperative reading system for lung cancer screening over the Internet, a secure transmission function, and a cooperative reading environment. It is called the Network-based Reading System. A telemedicine system involves many issues, such as network costs and data security if we use it over the Internet, which is an open network. In Japan, broadband access is widespread and its cost is the lowest in the world. We developed our system considering human machine interface and security. It consists of data entry terminals, a database server, a computer aided diagnosis (CAD) system, and some reading terminals. It uses a secure Digital Imaging and Communication in Medicine (DICOM) encrypting method and Public Key Infrastructure (PKI) based secure DICOM image data distribution. We carried out an experimental trial over the Japan Gigabit Network (JGN), which is the testbed for the Japanese next-generation network, and conducted verification experiments of secure screening image distribution, some kinds of data addition, and remote cooperative reading. We found that network bandwidth of about 1.5 Mbps enabled distribution of screening images and cooperative reading and that the encryption and image distribution methods we proposed were applicable to the encryption and distribution of general DICOM images via the Internet.

Design and performance evaluation of an OpenFlow-based control plane for software-defined elastic optical networks with direct-detection optical OFDM (DDO-OFDM) transmission.

PubMed

Liu, Lei; Peng, Wei-Ren; Casellas, Ramon; Tsuritani, Takehiro; Morita, Itsuro; Martínez, Ricardo; Muñoz, Raül; Yoo, S J B

2014-01-13

Optical Orthogonal Frequency Division Multiplexing (O-OFDM), which transmits high speed optical signals using multiple spectrally overlapped lower-speed subcarriers, is a promising candidate for supporting future elastic optical networks. In contrast to previous works which focus on Coherent Optical OFDM (CO-OFDM), in this paper, we consider the direct-detection optical OFDM (DDO-OFDM) as the transport technique, which leads to simpler hardware and software realizations, potentially offering a low-cost solution for elastic optical networks, especially in metro networks, and short or medium distance core networks. Based on this network scenario, we design and deploy a software-defined networking (SDN) control plane enabled by extending OpenFlow, detailing the network architecture, the routing and spectrum assignment algorithm, OpenFlow protocol extensions and the experimental validation. To the best of our knowledge, it is the first time that an OpenFlow-based control plane is reported and its performance is quantitatively measured in an elastic optical network with DDO-OFDM transmission.

West Hills College Cooperative Training Network. Final Performance and Financial Status Report.

ERIC Educational Resources Information Center

West Hills Community Coll., Coalinga, CA.

A cooperative training network was developed by West Hills Community College (Coalinga, California), in conjunction with government agencies/private businesses, to train students in truck driving skills. Emphasis was placed on training women, members of minority groups, and disadvantaged persons. During the project, an advisory council was…

West Hills College Cooperative Training Network. Truck Driving Program. Dissemination Workbook.

ERIC Educational Resources Information Center

West Hills Community Coll., Coalinga, CA.

A cooperative training network was developed by West Hills Community College (Coalinga, California) in conjunction with government agencies/private businesses to train students in truck driving skills. Emphasis was placed on training women, members of minority groups, and disadvantaged persons. During the project, an advisory council was…

Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks

NASA Astrophysics Data System (ADS)

Sarkar, Bijan

2018-05-01

Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established framework of evolutionary game theory. In the current study, not only qualitatively but also quantitatively, we measure Moran-evolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population. The validity of the measurement has been double-checked in the well-mixed network by the Langevin stochastic differential equation and the Gillespie-algorithmic version of Moran-evolution, while in a structured network, the measurement of accuracy is verified by the standard numerical simulation. Considering the Birth-Death and Death-Birth updating rules through diffusion of individuals, the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks. The set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population. We find that in general, nature promotes the environment of coexistent traits.

Peer pressure and incentive mechanisms in social networks

NASA Astrophysics Data System (ADS)

Deng, Chuang; Ye, Chao; Wang, Lin; Rong, Zhihai; Wang, Xiaofan

2018-01-01

Cooperation can be viewed as a social norm that is expected in our society. In this work, a framework based on spatial public goods game theory is established to study how peer pressure and incentive mechanisms can influence the evolution of cooperation. A unified model with adjustable parameters is developed to represent the effects of pure Personal Mechanism, Personal Mechanism with peer pressure and Social Mechanism, which demonstrates that when the sum of rewards plus the peer pressure felt by defectors is larger than the effective cost of cooperation, cooperation can prevail. As the peer pressure is caused by other cooperators in a game, group size and network structure play an important role. In particular, larger group size and more heterogeneous structured population can make defectors feel more peer pressure, which will promote the evolution and sustainment of cooperation.

Communication and cooperation in networked environments: an experimental analysis.

PubMed

Galimberti, C; Ignazi, S; Vercesi, P; Riva, G

2001-02-01

Interpersonal communication and cooperation do not happen exclusively face to face. In work contexts, as in private life, there are more and more situations of mediated communication and cooperation in which new online tools are used. However, understanding how to use the Internet to support collaborative interaction presents a substantial challenge for the designers and users of this emerging technology. First, collaborative Internet environments are designed to serve a purpose, so must be designed with intended users' tasks and goals explicitly considered. Second, in cooperative activities the key content of communication is the interpretation of the situations in which actors are involved. So, the most effective way of clarifying the meaning of messages is to connect them to a shared context of meaning. However, this is more difficult in the Internet than in other computer-based activities. This paper tries to understand the characteristics of cooperative activities in networked environments--shared 3D virtual worlds--through two different studies. The first used the analysis of conversations to explore the characteristics of the interaction during the cooperative task; the second analyzed whether and how the level of immersion in the networked environments influenced the performance and the interactional process. The results are analyzed to identify the psychosocial roots used to support cooperation in a digital interactive communication.

Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks.

PubMed

Li, Zhen; Jing, Tao; Ma, Liran; Huo, Yan; Qian, Jin

2016-03-07

The Internet of Things (IoT) is a significant branch of the ongoing advances in the Internet and mobile communications. The use of a large number of IoT devices makes the spectrum scarcity problem even more serious. The usable spectrum resources are almost entirely occupied, and thus, the increasing radio access demands of IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT) has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as telephones). Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric cryptography and asymmetric cryptography) may be compromised in CIoT networks, since these types of networks are heterogeneous. In this paper, we address the security issue in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative networks, we propose to employ cooperative jamming to achieve secrecy transmission. In the cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the signal to interference plus noise ratio (SINR) at the eavesdropper subject to the quality of service (QoS) constraints of the primary traffic and the secondary traffic. We formulate the considered minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper. By using semi-definite programming (SDP), the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the cooperative jamming scheme. The proposed auction framework jointly formulates the helper selection and the corresponding energy allocation problems under the constraint of the eavesdropper's SINR. By adopting the Vickrey auction, truthfulness and individual rationality can be guaranteed. Simulation results demonstrate the good performance of the cooperative jamming scheme and the auction framework.

Multi-layer service function chaining scheduling based on auxiliary graph in IP over optical network

NASA Astrophysics Data System (ADS)

Li, Yixuan; Li, Hui; Liu, Yuze; Ji, Yuefeng

2017-10-01

Software Defined Optical Network (SDON) can be considered as extension of Software Defined Network (SDN) in optical networks. SDON offers a unified control plane and makes optical network an intelligent transport network with dynamic flexibility and service adaptability. For this reason, a comprehensive optical transmission service, able to achieve service differentiation all the way down to the optical transport layer, can be provided to service function chaining (SFC). IP over optical network, as a promising networking architecture to interconnect data centers, is the most widely used scenarios of SFC. In this paper, we offer a flexible and dynamic resource allocation method for diverse SFC service requests in the IP over optical network. To do so, we firstly propose the concept of optical service function (OSF) and a multi-layer SFC model. OSF represents the comprehensive optical transmission service (e.g., multicast, low latency, quality of service, etc.), which can be achieved in multi-layer SFC model. OSF can also be considered as a special SF. Secondly, we design a resource allocation algorithm, which we call OSF-oriented optical service scheduling algorithm. It is able to address multi-layer SFC optical service scheduling and provide comprehensive optical transmission service, while meeting multiple optical transmission requirements (e.g., bandwidth, latency, availability). Moreover, the algorithm exploits the concept of Auxiliary Graph. Finally, we compare our algorithm with the Baseline algorithm in simulation. And simulation results show that our algorithm achieves superior performance than Baseline algorithm in low traffic load condition.

Cross stratum resources protection in fog-computing-based radio over fiber networks for 5G services

NASA Astrophysics Data System (ADS)

Guo, Shaoyong; Shao, Sujie; Wang, Yao; Yang, Hui

2017-09-01

In order to meet the requirement of internet of things (IoT) and 5G, the cloud radio access network is a paradigm which converges all base stations computational resources into a cloud baseband unit (BBU) pool, while the distributed radio frequency signals are collected by remote radio head (RRH). A precondition for centralized processing in the BBU pool is an interconnection fronthaul network with high capacity and low delay. However, it has become more complex and frequent in the interaction between RRH and BBU and resource scheduling among BBUs in cloud. Cloud radio over fiber network has been proposed in our previous work already. In order to overcome the complexity and latency, in this paper, we first present a novel cross stratum resources protection (CSRP) architecture in fog-computing-based radio over fiber networks (F-RoFN) for 5G services. Additionally, a cross stratum protection (CSP) scheme considering the network survivability is introduced in the proposed architecture. The CSRP with CSP scheme can effectively pull the remote processing resource locally to implement the cooperative radio resource management, enhance the responsiveness and resilience to the dynamic end-to-end 5G service demands, and globally optimize optical network, wireless and fog resources. The feasibility and efficiency of the proposed architecture with CSP scheme are verified on our software defined networking testbed in terms of service latency, transmission success rate, resource occupation rate and blocking probability.

The Pacific Community Concept. Proposals for Further Development and Co-Operation between Countries of the Pacific Basin and Reaction to Such Proposals by Pacific Basin Countries. A Select Bibliography. Development of Resource Sharing Networks. Networks Study No. 14.

ERIC Educational Resources Information Center

National Library of Australia, Canberra.

As part of its statutory duty to foster international cooperation, the National Library of Australia has produced this annotated bibliography based on a review of material published since 1968 on the Pacific Community Concept or cooperation between countries in the Pacific Basin area of Asia and Oceania. The 159 items listed cover the following…

The virtual cooperation platform in enterprise and supplier cooperation models.

PubMed

Chang, Che-Wei; Wu, Cheng-Ru; Liao, Chia-Chun

2010-08-01

Abstract This study examines the use of the virtual enterprise network supplier supply-chain model of business behavior in creating synergies of cooperation. To explore virtual network behavior, it evaluates 60 samples, taken from of a few supply chains, and 17 items meeting certain behavioral criteria. Such an analysis may help to reduce costs and processing time effectively, as well as promote effective communication. Furthermore, the study of behavior in this electronic setting is a reliable and useful assessment method.

Architecture Design and Experimental Platform Demonstration of Optical Network based on OpenFlow Protocol

NASA Astrophysics Data System (ADS)

Xing, Fangyuan; Wang, Honghuan; Yin, Hongxi; Li, Ming; Luo, Shenzi; Wu, Chenguang

2016-02-01

With the extensive application of cloud computing and data centres, as well as the constantly emerging services, the big data with the burst characteristic has brought huge challenges to optical networks. Consequently, the software defined optical network (SDON) that combines optical networks with software defined network (SDN), has attracted much attention. In this paper, an OpenFlow-enabled optical node employed in optical cross-connect (OXC) and reconfigurable optical add/drop multiplexer (ROADM), is proposed. An open source OpenFlow controller is extended on routing strategies. In addition, the experiment platform based on OpenFlow protocol for software defined optical network, is designed. The feasibility and availability of the OpenFlow-enabled optical nodes and the extended OpenFlow controller are validated by the connectivity test, protection switching and load balancing experiments in this test platform.

Design alternatives for wavelength routing networks

NASA Astrophysics Data System (ADS)

Miliotis, K.; Papadimitriou, G. I.; Pomportsis, A. S.

2003-03-01

This paper attempts to provide a high level overview of many of the technologies employed in optical networks with a focus on wavelength-routing networks. Optical networks involve a number of technologies from the physics of light through protocols and networks architectures. In fact there is so much technology and know-how that most people involved with optical networks only have a full understanding of the narrow area they deal with. We start first examining the principles that govern light and its use as a wave guide, and then turn our focus to the various components that constitute an optical network and conclude with the description of all optical networks and wavelength-routed networks in greater detail.

Cognitive strategies take advantage of the cooperative potential of heterogeneous networks

NASA Astrophysics Data System (ADS)

Vukov, Jeromos; Santos, Francisco C.; Pacheco, Jorge M.

2012-06-01

Understanding the emergence and maintenance of cooperation is one of the most challenging topics of our time. Evolutionary game theory offers a very flexible framework within which to address this challenge. Here we use the prisoner's dilemma game to investigate the performance of individuals who are capable of adopting reactive strategies in communities structurally organized by means of Barabási-Albert scale-free networks. We find that basic cognitive abilities, such as the capability to distinguish their partners and act according to their previous actions, enable cooperation to thrive. This result is particularly significant whenever fear is the leading social tension, as this fosters retaliation, thus enforcing and sustaining cooperation. Being able to simultaneously reward fellow cooperators and punish defectors proves instrumental in achieving cooperation and the welfare of the community. As a result, central individuals can successfully lead the community and turn defective players into cooperative ones. Finally, even when participation costs—known to be detrimental to cooperation in scale-free networks—are explicitly included, we find that basic cognitive abilities have enough potential to help cooperation to prevail.

Design of special purpose database for credit cooperation bank business processing network system

NASA Astrophysics Data System (ADS)

Yu, Yongling; Zong, Sisheng; Shi, Jinfa

2011-12-01

With the popularization of e-finance in the city, the construction of e-finance is transfering to the vast rural market, and quickly to develop in depth. Developing the business processing network system suitable for the rural credit cooperative Banks can make business processing conveniently, and have a good application prospect. In this paper, We analyse the necessity of adopting special purpose distributed database in Credit Cooperation Band System, give corresponding distributed database system structure , design the specical purpose database and interface technology . The application in Tongbai Rural Credit Cooperatives has shown that system has better performance and higher efficiency.

Exploiting Outage and Error Probability of Cooperative Incremental Relaying in Underwater Wireless Sensor Networks

PubMed Central

Nasir, Hina; Javaid, Nadeem; Sher, Muhammad; Qasim, Umar; Khan, Zahoor Ali; Alrajeh, Nabil; Niaz, Iftikhar Azim

2016-01-01

This paper embeds a bi-fold contribution for Underwater Wireless Sensor Networks (UWSNs); performance analysis of incremental relaying in terms of outage and error probability, and based on the analysis proposition of two new cooperative routing protocols. Subject to the first contribution, a three step procedure is carried out; a system model is presented, the number of available relays are determined, and based on cooperative incremental retransmission methodology, closed-form expressions for outage and error probability are derived. Subject to the second contribution, Adaptive Cooperation in Energy (ACE) efficient depth based routing and Enhanced-ACE (E-ACE) are presented. In the proposed model, feedback mechanism indicates success or failure of data transmission. If direct transmission is successful, there is no need for relaying by cooperative relay nodes. In case of failure, all the available relays retransmit the data one by one till the desired signal quality is achieved at destination. Simulation results show that the ACE and E-ACE significantly improves network performance, i.e., throughput, when compared with other incremental relaying protocols like Cooperative Automatic Repeat reQuest (CARQ). E-ACE and ACE achieve 69% and 63% more throughput respectively as compared to CARQ in hard underwater environment. PMID:27420061

Improved passive optical network architectures to support local area network emulation and protection

NASA Astrophysics Data System (ADS)

Wong, Elaine; Nadarajah, Nishaanthan; Chae, Chang-Joon; Nirmalathas, Ampalavanapillai; Attygalle, Sanjeewa M.

2006-01-01

We describe two optical layer schemes which simultaneously facilitate local area network emulation and automatic protection switching against distribution fiber breaks in passive optical networks. One scheme employs a narrowband fiber Bragg grating placed close to the star coupler in the feeder fiber of the passive optical network, while the other uses an additional short length distribution fiber from the star coupler to each customer for the redirection of the customer traffic. Both schemes use RF subcarrier multiplexed transmission for intercommunication between customers in conjunction with upstream access to the central office at baseband. Failure detection and automatic protection switching are performed independently by each optical network unit that is located at the customer premises in a distributed manner. The restoration of traffic transported between the central office and an optical network unit in the event of the distribution fiber break is performed by interconnecting adjacent optical network units and carrying out signal transmissions via an independent but interconnected optical network unit. Such a protection mechanism enables multiple adjacent optical network units to be simultaneously protected by a single optical network unit utilizing its maximum available bandwidth. We experimentally verify the feasibility of both schemes with 1.25 Gb/s upstream baseband transmission to the central office and 155 Mb/s local area network data transmission on a RF subcarrier frequency. The experimental results obtained from both schemes are compared, and the power budgets are calculated to analyze the scalability of each scheme.

Efficient data communication protocols for wireless networks

NASA Astrophysics Data System (ADS)

Zeydan, Engin

In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to converge to pure strategy Nash equilibrium with high probability throughout the iterations in the interference impaired network. On the other hand, the regret-matching learning algorithm is noncooperative and requires minimum amount of overhead. The proposed cooperative and regret-matching based distributed algorithms are also compared with centralized solutions through simulation results.

Technology and Cooperation: The Behaviors of Networking.

ERIC Educational Resources Information Center

Martin, Susan K.

1987-01-01

Discusses the pros and cons of library cooperation as exemplified by interlibrary loan and OCLC. Moving away from cooperation toward the more intensive use of local systems is suggested as one alternative for the future. (MES)

Competition among networks highlights the power of the weak

PubMed Central

Iranzo, Jaime; Buldú, Javier M.; Aguirre, Jacobo

2016-01-01

The unpreventable connections between real networked systems have recently called for an examination of percolation, diffusion or synchronization phenomena in multilayer networks. Here we use network science and game theory to explore interactions in networks-of-networks and model these as a game for gaining importance. We propose a viewpoint where networks choose the connection strategies, in contrast with classical approaches where nodes are the active players. Specifically, we investigate how creating paths between networks leads to different Nash equilibria that determine their structural and dynamical properties. In a wide variety of cases, selecting adequate connections leads to a cooperative solution that allows weak networks to overcome the strongest opponent. Counterintuitively, each weak network can induce a global transition to such cooperative configuration regardless of the actions of the strongest network. This power of the weak reveals a critical dominance of the underdogs in the fate of networks-of-networks. PMID:27841258

Risk of coinfection outbreaks in temporal networks: a case study of a hospital contact network

NASA Astrophysics Data System (ADS)

Rodríguez, Jorge P.; Ghanbarnejad, Fakhteh; Eguíluz, Víctor M.

2017-10-01

We study the spreading of cooperative infections in an empirical temporal network of contacts between people, including health care workers and patients, in a hospital. The system exhibits a phase transition leading to one or several endemic branches, depending on the connectivity pattern and the temporal correlations. There are two endemic branches in the original setting and the non-cooperative case. However, the cooperative interaction between infections reinforces the upper branch, leading to a smaller epidemic threshold and a higher probability for having a big outbreak. We show the microscopic mechanisms leading to these differences, characterize three different risks, and use the influenza features as an example for this dynamics.

Telemedicine as a Tool for Europe-Africa Cooperation: A Practical Experience

NASA Astrophysics Data System (ADS)

Dinis, Manuel; Santiago, Fernando; Silva, Luís; Ferreira, Ricardo; Machado, José; Castela, Eduardo

This paper presents the experience of an Europe-Africa telemedicine network, focused on the pediatric area, and involving hospitals located in Luanda (Angola), Benguela (Angola), Praia (Cape Verde) and Coimbra (Portugal). In the scope of this network, the cooperation between these hospitals goes beyond the teleconsultation sessions. Tele-training, clinical experience exchange, patient transfer agreements and health staff training to local development of new medical capabilities are some of the involved activities. It is therefore agreed that this kind of technical and knowledge network could also be expanded to other African countries with clear benefits to the local citizens, overcoming the digital-divide and improving the cooperation between developed and developing countries.

Effects of competition and cooperation interaction between agents on networks in the presence of a market capacity

NASA Astrophysics Data System (ADS)

Sonubi, A.; Arcagni, A.; Stefani, S.; Ausloos, M.

2016-08-01

A network effect is introduced taking into account competition, cooperation, and mixed-type interaction among agents along a generalized Verhulst-Lotka-Volterra model. It is also argued that the presence of a market capacity undoubtedly enforces a definite limit on the agent's size growth. The state stability of triadic agents, i.e., the most basic network plaquette, is investigated analytically for possible scenarios, through a fixed-point analysis. It is discovered that: (i) market demand is only satisfied for full competition when one agent monopolizes the market; (ii) growth of agent size is encouraged in full cooperation; (iii) collaboration among agents to compete against one single agent may result in the disappearance of this single agent out of the market; and (iv) cooperating with two rivals may become a growth strategy for an intelligent agent.

Effects of competition and cooperation interaction between agents on networks in the presence of a market capacity.

PubMed

Sonubi, A; Arcagni, A; Stefani, S; Ausloos, M

2016-08-01

A network effect is introduced taking into account competition, cooperation, and mixed-type interaction among agents along a generalized Verhulst-Lotka-Volterra model. It is also argued that the presence of a market capacity undoubtedly enforces a definite limit on the agent's size growth. The state stability of triadic agents, i.e., the most basic network plaquette, is investigated analytically for possible scenarios, through a fixed-point analysis. It is discovered that: (i) market demand is only satisfied for full competition when one agent monopolizes the market; (ii) growth of agent size is encouraged in full cooperation; (iii) collaboration among agents to compete against one single agent may result in the disappearance of this single agent out of the market; and (iv) cooperating with two rivals may become a growth strategy for an intelligent agent.

Effect of a large gaming neighborhood and a strategy adaptation neighborhood for bolstering network reciprocity in a prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Ogasawara, Takashi; Tanimoto, Jun; Fukuda, Eriko; Hagishima, Aya; Ikegaya, Naoki

2014-12-01

In 2 × 2 prisoner's dilemma (PD) games, network reciprocity is one mechanism for adding social viscosity, leading to a cooperative equilibrium. In this paper, we explain how gaming neighborhoods and strategy-adaptation neighborhoods affect network reciprocity independently in spatial PD games. We explore an appropriate range of strategy adaptation neighborhoods as opposed to the conventional method of making the gaming and strategy adaptation neighborhoods coincide to enhance the level of cooperation. In cases of expanding gaming neighborhoods, network reciprocity falls to a low level relative to the conventional setting. In the discussion below, which is based on the results of our simulation, we explore how these enhancements come about. Essentially, varying the range of the neighborhoods influences how cooperative clusters form and expand in the evolutionary process.

Cooperation stimulation strategies for peer-to-peer wireless live video-sharing social networks.

PubMed

Lin, W Sabrina; Zhao, H Vicky; Liu, K J Ray

2010-07-01

Human behavior analysis in video sharing social networks is an emerging research area, which analyzes the behavior of users who share multimedia content and investigates the impact of human dynamics on video sharing systems. Users watching live streaming in the same wireless network share the same limited bandwidth of backbone connection to the Internet, thus, they might want to cooperate with each other to obtain better video quality. These users form a wireless live-streaming social network. Every user wishes to watch video with high quality while paying as little as possible cost to help others. This paper focuses on providing incentives for user cooperation. We propose a game-theoretic framework to model user behavior and to analyze the optimal strategies for user cooperation simulation in wireless live streaming. We first analyze the Pareto optimality and the time-sensitive bargaining equilibrium of the two-person game. We then extend the solution to the multiuser scenario. We also consider potential selfish users' cheating behavior and malicious users' attacking behavior and analyze the performance of the proposed strategies with the existence of cheating users and malicious attackers. Both our analytical and simulation results show that the proposed strategies can effectively stimulate user cooperation, achieve cheat free and attack resistance, and help provide reliable services for wireless live streaming applications.

Study on multiple-hops performance of MOOC sequences-based optical labels for OPS networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun; Ma, Chunli

2009-11-01

In this paper, we utilize a new study method that is under independent case of multiple optical orthogonal codes to derive the probability function of MOOCS-OPS networks, discuss the performance characteristics for a variety of parameters, and compare some characteristics of the system employed by single optical orthogonal code or multiple optical orthogonal codes sequences-based optical labels. The performance of the system is also calculated, and our results verify that the method is effective. Additionally it is found that performance of MOOCS-OPS networks would, negatively, be worsened, compared with single optical orthogonal code-based optical label for optical packet switching (SOOC-OPS); however, MOOCS-OPS networks can greatly enlarge the scalability of optical packet switching networks.

Time Shared Optical Network (TSON): a novel metro architecture for flexible multi-granular services.

PubMed

Zervas, Georgios S; Triay, Joan; Amaya, Norberto; Qin, Yixuan; Cervelló-Pastor, Cristina; Simeonidou, Dimitra

2011-12-12

This paper presents the Time Shared Optical Network (TSON) as metro mesh network architecture for guaranteed, statistically-multiplexed services. TSON proposes a flexible and tunable time-wavelength assignment along with one-way tree-based reservation and node architecture. It delivers guaranteed sub-wavelength and multi-granular network services without wavelength conversion, time-slice interchange and optical buffering. Simulation results demonstrate high network utilization, fast service delivery, and low end-to-end delay on a contention-free sub-wavelength optical transport network. In addition, implementation complexity in terms of Layer 2 aggregation, grooming and optical switching has been evaluated. © 2011 Optical Society of America

Experimental performance evaluation of software defined networking (SDN) based data communication networks for large scale flexi-grid optical networks.

PubMed

Zhao, Yongli; He, Ruiying; Chen, Haoran; Zhang, Jie; Ji, Yuefeng; Zheng, Haomian; Lin, Yi; Wang, Xinbo

2014-04-21

Software defined networking (SDN) has become the focus in the current information and communication technology area because of its flexibility and programmability. It has been introduced into various network scenarios, such as datacenter networks, carrier networks, and wireless networks. Optical transport network is also regarded as an important application scenario for SDN, which is adopted as the enabling technology of data communication networks (DCN) instead of general multi-protocol label switching (GMPLS). However, the practical performance of SDN based DCN for large scale optical networks, which is very important for the technology selection in the future optical network deployment, has not been evaluated up to now. In this paper we have built a large scale flexi-grid optical network testbed with 1000 virtual optical transport nodes to evaluate the performance of SDN based DCN, including network scalability, DCN bandwidth limitation, and restoration time. A series of network performance parameters including blocking probability, bandwidth utilization, average lightpath provisioning time, and failure restoration time have been demonstrated under various network environments, such as with different traffic loads and different DCN bandwidths. The demonstration in this work can be taken as a proof for the future network deployment.

75 FR 61501 - Cooperative Agreement To Support Capacity Building Activities Through the World Health...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-05

... Foodborne Infections Network AGENCY: Food and Drug Administration, HHS. ACTION: Notice. SUMMARY: The Food... application to award a cooperative agreement to the World Health Organization (WHO) Advisory Group on... Infections Network (GFN) and to provide guidance to the WHO on a framework for the development of an...

A Study of Cooperative, Networking, and Computer Activities in Southwestern Libraries.

ERIC Educational Resources Information Center

Corbin, John

The Southwestern Library Association (SWLA) conducted an inventory and study of the SWLA libraries in cooperative, network, and computer activities to collect data for use in planning future activities and in minimizing duplication of efforts. Questionnaires were mailed to 2,060 academic, public, and special libraries in the six SWLA states.…

A novel power efficient location-based cooperative routing with transmission power-upper-limit for wireless sensor networks.

PubMed

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-05-15

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

A Novel Power Efficient Location-Based Cooperative Routing with Transmission Power-Upper-Limit for Wireless Sensor Networks

PubMed Central

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-01-01

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate. PMID:23676625

Coevolution of dynamical states and interactions in dynamic networks

NASA Astrophysics Data System (ADS)

Zimmermann, Martín G.; Eguíluz, Víctor M.; San Miguel, Maxi

2004-06-01

We explore the coupled dynamics of the internal states of a set of interacting elements and the network of interactions among them. Interactions are modeled by a spatial game and the network of interaction links evolves adapting to the outcome of the game. As an example, we consider a model of cooperation in which the adaptation is shown to facilitate the formation of a hierarchical interaction network that sustains a highly cooperative stationary state. The resulting network has the characteristics of a small world network when a mechanism of local neighbor selection is introduced in the adaptive network dynamics. The highly connected nodes in the hierarchical structure of the network play a leading role in the stability of the network. Perturbations acting on the state of these special nodes trigger global avalanches leading to complete network reorganization.

Dye lasing arrangement including an optical assembly for altering the cross-section of its pumping beam and method

DOEpatents

O'Neil, Richard W.; Sweatt, William C.

1992-01-01

An optical assembly is disclosed herein along with a method of operation for use in a dye lasing arrangement, for example a dye laser oscillator or a dye amplifier, in which a continuous stream of dye is caused to flow through a given zone in a cooperating dye chamber while the zone is being illuminated by light from a pumping beam which is directed into the given zone. This in turn causes the dye therein to lase and thereby produce a new dye beam in the case of a dye laser oscillator or amplify a dye beam in the case of a dye amplifier. The optical assembly so disclosed is designed to alter the pump beam such that the beam enters the dye chamber with a different cross-sectional configuration, preferably one having a more uniform intensity profile, than its initially produced cross-sectional configuration. To this end, the assembly includes a network of optical components which first act on the beam while the latter retains its initially produced cross-sectional configuration for separating it into a plurality of predetermined segments and then recombines the separated components in a predetermined way which causes the recombined beam to have the different cross-sectional configuration.

Cooperative behavior cascades in human social networks

PubMed Central

Fowler, James H.; Christakis, Nicholas A.

2010-01-01

Theoretical models suggest that social networks influence the evolution of cooperation, but to date there have been few experimental studies. Observational data suggest that a wide variety of behaviors may spread in human social networks, but subjects in such studies can choose to befriend people with similar behaviors, posing difficulty for causal inference. Here, we exploit a seminal set of laboratory experiments that originally showed that voluntary costly punishment can help sustain cooperation. In these experiments, subjects were randomly assigned to a sequence of different groups to play a series of single-shot public goods games with strangers; this feature allowed us to draw networks of interactions to explore how cooperative and uncooperative behaviors spread from person to person to person. We show that, in both an ordinary public goods game and in a public goods game with punishment, focal individuals are influenced by fellow group members’ contribution behavior in future interactions with other individuals who were not a party to the initial interaction. Furthermore, this influence persists for multiple periods and spreads up to three degrees of separation (from person to person to person to person). The results suggest that each additional contribution a subject makes to the public good in the first period is tripled over the course of the experiment by other subjects who are directly or indirectly influenced to contribute more as a consequence. These results show experimentally that cooperative behavior cascades in human social networks. PMID:20212120

Evolutionary Dynamics of Collective Action in Structured Populations

NASA Astrophysics Data System (ADS)

Santos, Marta Daniela de Almeida

The pervasiveness of cooperation in Nature is not easily explained. If evolution is characterized by competition and survival of the fittest, why should selfish individuals cooperate with each other? Evolutionary Game Theory (EGT) provides a suitable mathematical framework to study this problem, central to many areas of science. Conventionally, interactions between individuals are modeled in terms of one-shot, symmetric 2-Person Dilemmas of Cooperation, but many real-life situations involve decisions within groups with more than 2 individuals, which are best-dealt in the framework of N-Person games. In this Thesis, we investigate the evolutionary dynamics of two paradigmatic collective social dilemmas - the N-Person Prisoner's Dilemma (NPD) and the N-Person Snowdrift Game (NSG) on structured populations, modeled by networks with diverse topological properties. Cooperative strategies are just one example of the many traits that can be transmitted on social networks. Several recent studies based on empirical evidence from a medical database have suggested the existence of a 3 degrees of influence rule, according to which not only our "friends", but also our friends' friends, and our friends' friends' friends, have a non-trivial influence on our decisions. We investigate the degree of peer influence that emerges from the spread of cooperative strategies, opinions and diseases on populations with distinct underlying networks of contacts. Our results show that networks naturally entangle individuals into interactions of many-body nature and that for each network class considered different processes lead to identical degrees of influence. None

Selective investment promotes cooperation in public goods game

NASA Astrophysics Data System (ADS)

Li, Jing; Wu, Te; Zeng, Gang; Wang, Long

2012-08-01

Most previous investigations on spatial Public Goods Game assume that individuals treat neighbors equivalently, which is in sharp contrast with realistic situations, where bias is ubiquitous. We construct a model to study how a selective investment mechanism affects the evolution of cooperation. Cooperators selectively contribute to just a fraction among their neighbors. According to the interaction result, the investment network can be adapted. On selecting investees, three patterns are considered. In the random pattern, cooperators choose their investees among the neighbors equiprobably. In the social-preference pattern, cooperators tend to invest to individuals possessing large social ties. In the wealth-preference pattern, cooperators are more likely to invest to neighbors with higher payoffs. Our result shows robustness of selective investment mechanism that boosts emergence and maintenance of cooperation. Cooperation is more or less hampered under the latter two patterns, and we prove the anti-social-preference or anti-wealth-preference pattern of selecting investees can accelerate cooperation to some extent. Furthermore, the theoretical analysis of our mechanism on double-star networks coincides with simulation results. We hope our finding could shed light on better understanding of the emergence of cooperation among adaptive populations.

Extortion provides alternative routes to the evolution of cooperation in structured populations

NASA Astrophysics Data System (ADS)

Xu, Xiongrui; Rong, Zhihai; Wu, Zhi-Xi; Zhou, Tao; Tse, Chi Kong

2017-05-01

In this paper, we study the evolution of cooperation in structured populations (individuals are located on either a regular lattice or a scale-free network) in the context of repeated games by involving three types of strategies, namely, unconditional cooperation, unconditional defection, and extortion. The strategy updating of the players is ruled by the replicator-like dynamics. We find that extortion strategies can act as catalysts to promote the emergence of cooperation in structured populations via different mechanisms. Specifically, on regular lattice, extortioners behave as both a shield, which can enwrap cooperators inside and keep them away from defectors, and a spear, which can defeat those surrounding defectors with the help of the neighboring cooperators. Particularly, the enhancement of cooperation displays a resonance-like behavior, suggesting the existence of optimal extortion strength mostly favoring the evolution of cooperation, which is in good agreement with the predictions from the generalized mean-field approximation theory. On scale-free network, the hubs, who are likely occupied by extortioners or defectors at the very beginning, are then prone to be conquered by cooperators on small-degree nodes as time elapses, thus establishing a bottom-up mechanism for the emergence and maintenance of cooperation.

Innovative Improvement and Intensification of Business Relationships Supported by Cooperative Networks

NASA Astrophysics Data System (ADS)

Vančová, Viera; Čambál, Miloš; Cagáňová, Dagmar

2012-12-01

Nowadays, the opportunity for companies to be involved in cluster initiatives and international business associations is a major factor that contributes to the increase of their innovative potential. Companies organized in technological clusters have greater access to mutual business contacts, faster information transfer and deployment of advanced technologies. These companies cooperate more frequently with universities and research - development institutions on innovative projects. An important benefit of cluster associations is that they create a suitable environment for innovation and the transfer of knowledge by means of international cooperation and networking. This supportive environment is not easy to access for different small and mediumsized companies, who are not members of any clusters or networks. Supplier-customer business channels expand by means of transnational networks and exchanges of experience. Knowledge potential is broadened and joint innovative projects are developed. Reflecting the growing importance of clusters as driving forces of economic and regional development, a number of cluster policies and initiatives have emerged in the last few decades, oriented to encourage the establishment of new clusters, to support existing clusters, or to assist the development of transnational cooperation. To achieve the goals of the Europe 2020 Strategy, European countries should have an interest in building strong clusters and developing cluster cooperation by sharing specialized research infrastructures and testing facilities and facilitating knowledge transfer for crossborder cooperation. This requires developing a long term joint strategy in order to facilitate the development of open global clusters and innovative small and medium entrepreneurs.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tirado-Soto, Magda Martina, E-mail: magda@pep.ufrj.br; Zamberlan, Fabio Luiz, E-mail: fabio@pep.ufrj.br

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

The exploration and practice of integrated innovation teaching mode in the Applied Optics course

NASA Astrophysics Data System (ADS)

Liu, Dongmei; Zhao, Huifu; Fu, Xiuhua; Zhang, Jing

2017-08-01

In recent years, the Ministry of Education of China attaches great importance to the reform of higher education quality. As an important link in the reform of higher education, curriculum development is bound to promote the development of "quality-centered connotative education". Zhejiang University, Changchun University of Science and Technology, Southern Airlines University and other colleges and universities carried out a full range of close cooperation, proposed integrated innovation teaching mode of the course based on network technology. Based on this model, the course of "Applied Optics" has been practiced for two years. The results show that the integrated innovation teaching mode can fully realize the integration amplification effect among multiple colleges and universities and the depth sharing all types of resources. Based on the principle of co-building and sharing, mutual help, comprehensively improve the teaching quality of domestic related courses and promote the comprehensive development of the curriculum to meet the needs of learning society.

Shared protection based virtual network mapping in space division multiplexing optical networks

NASA Astrophysics Data System (ADS)

Zhang, Huibin; Wang, Wei; Zhao, Yongli; Zhang, Jie

2018-05-01

Space Division Multiplexing (SDM) has been introduced to improve the capacity of optical networks. In SDM optical networks, there are multiple cores/modes in each fiber link, and spectrum resources are multiplexed in both frequency and core/modes dimensions. Enabled by network virtualization technology, one SDM optical network substrate can be shared by several virtual networks operators. Similar with point-to-point connection services, virtual networks (VN) also need certain survivability to guard against network failures. Based on customers' heterogeneous requirements on the survivability of their virtual networks, this paper studies the shared protection based VN mapping problem and proposes a Minimum Free Frequency Slots (MFFS) mapping algorithm to improve spectrum efficiency. Simulation results show that the proposed algorithm can optimize SDM optical networks significantly in terms of blocking probability and spectrum utilization.

Promoting cooperation by preventing exploitation: The role of network structure

NASA Astrophysics Data System (ADS)

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.

Effects of Individual's Self-Examination on Cooperation in Prisoner's Dilemma Game

NASA Astrophysics Data System (ADS)

Guan, Jian-Yue; Sun, Jin-Tu; Wang, Ying-Hai

We study a spatial evolutionary prisoner's dilemma game on regular network's one-dimensional regular ring and two-dimensional square lattice. The individuals located on the sites of networks can either cooperate with their neighbors or defect. The effects of individual's self-examination are introduced. Using Monte Carlo simulations and pair approximation method, we investigate the average density of cooperators in the stationary state for various values of payoff parameters b and the time interval Δt. The effects of the fraction p of players in the system who are using the self-examination on cooperation are also discussed. It is shown that compared with the case of no individual's self-examination, the persistence of cooperation is inhibited when the payoff parameter b is small and at certain Δt (Δt > 0) or p (p > 0), cooperation is mostly inhibited, while when b is large, the emergence of cooperation can be remarkably enhanced and mostly enhanced at Δt = 0 or p = 1.

Cooperative Game-Based Energy Efficiency Management over Ultra-Dense Wireless Cellular Networks

PubMed Central

Li, Ming; Chen, Pengpeng; Gao, Shouwan

2016-01-01

Ultra-dense wireless cellular networks have been envisioned as a promising technique for handling the explosive increase of wireless traffic volume. With the extensive deployment of small cells in wireless cellular networks, the network spectral efficiency (SE) is improved with the use of limited frequency. However, the mutual inter-tier and intra-tier interference between or among small cells and macro cells becomes serious. On the other hand, more chances for potential cooperation among different cells are introduced. Energy efficiency (EE) has become one of the most important problems for future wireless networks. This paper proposes a cooperative bargaining game-based method for comprehensive EE management in an ultra-dense wireless cellular network, which highlights the complicated interference influence on energy-saving challenges and the power-coordination process among small cells and macro cells. Especially, a unified EE utility with the consideration of the interference mitigation is proposed to jointly address the SE, the deployment efficiency (DE), and the EE. In particular, closed-form power-coordination solutions for the optimal EE are derived to show the convergence property of the algorithm. Moreover, a simplified algorithm is presented to reduce the complexity of the signaling overhead, which is significant for ultra-dense small cells. Finally, numerical simulations are provided to illustrate the efficiency of the proposed cooperative bargaining game-based and simplified schemes. PMID:27649170

Cooperative Game-Based Energy Efficiency Management over Ultra-Dense Wireless Cellular Networks.

PubMed

Li, Ming; Chen, Pengpeng; Gao, Shouwan

2016-09-13

Ultra-dense wireless cellular networks have been envisioned as a promising technique for handling the explosive increase of wireless traffic volume. With the extensive deployment of small cells in wireless cellular networks, the network spectral efficiency (SE) is improved with the use of limited frequency. However, the mutual inter-tier and intra-tier interference between or among small cells and macro cells becomes serious. On the other hand, more chances for potential cooperation among different cells are introduced. Energy efficiency (EE) has become one of the most important problems for future wireless networks. This paper proposes a cooperative bargaining game-based method for comprehensive EE management in an ultra-dense wireless cellular network, which highlights the complicated interference influence on energy-saving challenges and the power-coordination process among small cells and macro cells. Especially, a unified EE utility with the consideration of the interference mitigation is proposed to jointly address the SE, the deployment efficiency (DE), and the EE. In particular, closed-form power-coordination solutions for the optimal EE are derived to show the convergence property of the algorithm. Moreover, a simplified algorithm is presented to reduce the complexity of the signaling overhead, which is significant for ultra-dense small cells. Finally, numerical simulations are provided to illustrate the efficiency of the proposed cooperative bargaining game-based and simplified schemes.

Next Generation Access Network Deployment in Croatia: Optical Access Networks and Current IoT/5G Status

NASA Astrophysics Data System (ADS)

Breskovic, Damir; Sikirica, Mladen; Begusic, Dinko

2018-05-01

This paper gives an overview and background of optical access network deployment in Croatia. Optical access network development in Croatia has been put into a global as well as in the European Union context. All the challenges and the driving factors for optical access networks deployment are considered. Optical access network architectures that have been deployed by most of the investors in Croatian telecommunication market are presented, as well as the architectures that are in early phase of deployment. Finally, an overview on current status of mobile networks of the fifth generation and Internet of Things is given.

The prisoner’s dilemma on co-evolving networks under perfect rationality

NASA Astrophysics Data System (ADS)

Biely, Christoly; Dragosits, Klaus; Thurner, Stefan

2007-04-01

We consider the prisoner’s dilemma being played repeatedly on a dynamic network, where agents may choose their actions as well as their co-players. This leads to co-evolution of network structure and strategy patterns of the players. Individual decisions are made fully rationally and are based on local information only. They are made such that links to defecting agents are resolved and that cooperating agents build up new links. The exact form of the updating scheme is motivated by profit maximization and not by imitation. If players update their decisions in a synchronized way the system exhibits oscillatory dynamics: Periods of growing cooperation (and total linkage) alternate with periods of increasing defection. The cyclical behavior is reduced and the system stabilizes at significant total cooperation levels when players are less synchronized. In this regime we find emergent network structures resembling ‘complex’ and hierarchical topology. The exponent of the power-law degree distribution ( γ∼8.6) perfectly matches empirical results for human communication networks.

All-Optical Fibre Networks For Coal Mines

NASA Astrophysics Data System (ADS)

Zientkiewicz, Jacek K.

1987-09-01

A topic of the paper is fiber-optic integrated network (FOIN) suited to the most hostile environments existing in coal mines. The use of optical fibres for transmission of mine instrumentation data offers the prospects of improved safety and immunity to electromagnetic interference (EMI). The feasibility of optically powered sensors has opened up new opportunities for research into optical signal processing architectures. This article discusses a new fibre-optic sensor network involving a time domain multiplexing(TDM)scheme and optical signal processing techniques. The pros and cons of different FOIN topologies with respect to coal mine applications are considered. The emphasis has been placed on a recently developed all-optical fibre network using spread spectrum code division multiple access (COMA) techniques. The all-optical networks have applications in explosive environments where electrical isolation is required.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-06-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan; Jersey Inst Ansari, New; Jersey Inst, New

2005-04-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-05-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Report of the Interagency Optical Network Testbeds Workshop 2 September 12-14, 2006 NASA Ames Research Center

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joe Mambretti Richard desJardins

2006-05-01

A new generation of optical networking services and technologies is rapidly changing the world of communications. National and international networks are implementing optical services to supplement traditional packet routed services. On September 12-14, 2005, the Optical Network Testbeds Workshop 2 (ONT2), an invitation-only forum hosted by the NASA Research and Engineering Network (NREN) and co-sponsored by the Department of Energy (DOE), was held at NASA Ames Research Center in Mountain View, California. The aim of ONT2 was to help the Federal Large Scale Networking Coordination Group (LSN) and its Joint Engineering Team (JET) to coordinate testbed and network roadmaps describingmore » agency and partner organization views and activities for moving toward next generation communication services based on leading edge optical networks in the 3-5 year time frame. ONT2 was conceived and organized as a sequel to the first Optical Network Testbeds Workshop (ONT1, August 2004, www.nren.nasa.gov/workshop7). ONT1 resulted in a series of recommendations to LSN. ONT2 was designed to move beyond recommendations to agree on a series of “actionable objectives” that would proactively help federal and partner optical network testbeds and advanced research and education (R&E) networks to begin incorporating technologies and services representing the next generation of advanced optical networks in the next 1-3 years. Participants in ONT2 included representatives from innovative prototype networks (Panel A), basic optical network research testbeds (Panel B), and production R&D networks (Panels C and D), including “JETnets,” selected regional optical networks (RONs), international R&D networks, commercial network technology and service providers (Panel F), and senior engineering and R&D managers from LSN agencies and partner organizations. The overall goal of ONT2 was to identify and coordinate short and medium term activities and milestones for researching, developing, identifying, evaluating, and implementing the services, technologies, and interoperability mechanisms required. The roadmaps were formulated and presented not so much to reconcile the roadmaps with each other but rather to provide a means to compare the major ongoing and planned optical networking activities in the R&E community, organized by categories of activities and communities of interest. In addition, a 5-15 year network research perspective was provided by Panel E, which presented a report on two recent National Science Foundation workshops that examined long term research goals and directions, and industry perspectives on forthcoming optical networking technologies and services were presented in Panel F by representatives from optical technologies and network services industries. The report, “Mapping a Future for Optical Networking and Communications” is available on the NSF website (www.nsf.gov), and the industry perspectives will be available on the ONT2 website.« less

Optical interconnections and networks; Proceedings of the Meeting, The Hague, Netherlands, Mar. 14, 15, 1990

NASA Technical Reports Server (NTRS)

Bartelt, Hartmut (Editor)

1990-01-01

The conference presents papers on interconnections, clock distribution, neural networks, and components and materials. Particular attention is given to a comparison of optical and electrical data interconnections at the board and backplane levels, a wafer-level optical interconnection network layout, an analysis and simulation of photonic switch networks, and the integration of picosecond GaAs photoconductive devices with silicon circuits for optical clocking and interconnects. Consideration is also given to the optical implementation of neural networks, invariance in an optoelectronic implementation of neural networks, and the recording of reversible patterns in polymer lightguides.

Hierarchy Bayesian model based services awareness of high-speed optical access networks

NASA Astrophysics Data System (ADS)

Bai, Hui-feng

2018-03-01

As the speed of optical access networks soars with ever increasing multiple services, the service-supporting ability of optical access networks suffers greatly from the shortage of service awareness. Aiming to solve this problem, a hierarchy Bayesian model based services awareness mechanism is proposed for high-speed optical access networks. This approach builds a so-called hierarchy Bayesian model, according to the structure of typical optical access networks. Moreover, the proposed scheme is able to conduct simple services awareness operation in each optical network unit (ONU) and to perform complex services awareness from the whole view of system in optical line terminal (OLT). Simulation results show that the proposed scheme is able to achieve better quality of services (QoS), in terms of packet loss rate and time delay.

High Speed All-Optical Data Distribution Network

NASA Astrophysics Data System (ADS)

Braun, Steve; Hodara, Henri

2017-11-01

This article describes the performance and capabilities of an all-optical network featuring low latency, high speed file transfer between serially connected optical nodes. A basic component of the network is a network interface card (NIC) implemented through a unique planar lightwave circuit (PLC) that performs add/drop data and optical signal amplification. The network uses a linear bus topology with nodes in a "T" configuration, as described in the text. The signal is sent optically (hence, no latency) to all nodes via wavelength division multiplexing (WDM), with each node receiver tuned to wavelength of choice via an optical de-multiplexer. Each "T" node routes a portion of the signal to/from the bus through optical couplers, embedded in the network interface card (NIC), to each of the 1 through n computers.

Simulation and measurement of optical access network with different types of optical-fiber amplifiers

NASA Astrophysics Data System (ADS)

Latal, Jan; Vogl, Jan; Koudelka, Petr; Vitasek, Jan; Siska, Petr; Liner, Andrej; Papes, Martin; Vasinek, Vladimir

2012-01-01

The optical access networks are nowadays swiftly developing in the telecommunications field. These networks can provide higher data transfer rates, and have great potential to the future in terms of transmission possibilities. Many local internet providers responded to these facts and began gradually installing optical access networks into their originally built networks, mostly based on wireless communication. This allowed enlargement of possibilities for end-users in terms of high data rates and also new services such as Triple play, IPTV (Internet Protocol television) etc. However, with this expansion and building-up is also related the potential of reach in case of these networks. Big cities, such as Prague, Brno, Ostrava or Olomouc cannot be simply covered, because of their sizes and also because of their internal regulations given by various organizations in each city. Standard logical and also physical reach of EPON (IEEE 802.3ah - Ethernet Passive Optical Network) optical access network is about 20 km. However, for networks based on Wavelength Division Multiplex the reach can be up to 80 km, if the optical-fiber amplifier is inserted into the network. This article deals with simulation of different types of amplifiers for WDM-PON (Wavelength Division Multiplexing-Passive Optical Network) network in software application Optiwave OptiSystem and than are the values from the application and from real measurement compared.

Fashion, Cooperation, and Social Interactions

PubMed Central

Cao, Zhigang; Gao, Haoyu; Qu, Xinglong; Yang, Mingmin; Yang, Xiaoguang

2013-01-01

Fashion plays such a crucial rule in the evolution of culture and society that it is regarded as a second nature to the human being. Also, its impact on economy is quite nontrivial. On what is fashionable, interestingly, there are two viewpoints that are both extremely widespread but almost opposite: conformists think that what is popular is fashionable, while rebels believe that being different is the essence. Fashion color is fashionable in the first sense, and Lady Gaga in the second. We investigate a model where the population consists of the afore-mentioned two groups of people that are located on social networks (a spatial cellular automata network and small-world networks). This model captures two fundamental kinds of social interactions (coordination and anti-coordination) simultaneously, and also has its own interest to game theory: it is a hybrid model of pure competition and pure cooperation. This is true because when a conformist meets a rebel, they play the zero sum matching pennies game, which is pure competition. When two conformists (rebels) meet, they play the (anti-) coordination game, which is pure cooperation. Simulation shows that simple social interactions greatly promote cooperation: in most cases people can reach an extraordinarily high level of cooperation, through a selfish, myopic, naive, and local interacting dynamic (the best response dynamic). We find that degree of synchronization also plays a critical role, but mostly on the negative side. Four indices, namely cooperation degree, average satisfaction degree, equilibrium ratio and complete ratio, are defined and applied to measure people’s cooperation levels from various angles. Phase transition, as well as emergence of many interesting geographic patterns in the cellular automata network, is also observed. PMID:23382799

Low threshold all-optical crossbar switch on GaAs-GaAlAs channel waveguide arrays

NASA Astrophysics Data System (ADS)

Jannson, Tomasz; Kostrzewski, Andrew

1994-09-01

During the Phase 2 project entitled 'Low Threshold All-Optical Crossbar Switch on GaAs - GaAlAs Channel Waveguide Array,' Physical Optics Corporation (POC) developed the basic principles for the fabrication of all-optical crossbar switches. Based on this development. POC fabricated a 2 x 2 GaAs/GaAlAs switch that changes the direction of incident light with minimum insertion loss and nonlinear distortion. This unique technology can be used in both analog and digital networks. The applications of this technology are widespread. Because the all-optical network does not have any speed limitations (RC time constant), POC's approach will be beneficial to SONET networks, phased array radar networks, very high speed oscilloscopes, all-optical networks, IR countermeasure systems, BER equipment, and the fast growing video conferencing network market. The novel all-optical crossbar switch developed in this program will solve interconnect problems. and will be a key component in the widely proposed all-optical 200 Gb/s SONET/ATM networks.

Remote Video Monitor of Vehicles in Cooperative Information Platform

NASA Astrophysics Data System (ADS)

Qin, Guofeng; Wang, Xiaoguo; Wang, Li; Li, Yang; Li, Qiyan

Detection of vehicles plays an important role in the area of the modern intelligent traffic management. And the pattern recognition is a hot issue in the area of computer vision. An auto- recognition system in cooperative information platform is studied. In the cooperative platform, 3G wireless network, including GPS, GPRS (CDMA), Internet (Intranet), remote video monitor and M-DMB networks are integrated. The remote video information can be taken from the terminals and sent to the cooperative platform, then detected by the auto-recognition system. The images are pretreated and segmented, including feature extraction, template matching and pattern recognition. The system identifies different models and gets vehicular traffic statistics. Finally, the implementation of the system is introduced.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

PubMed

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.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

PubMed Central

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-01-01

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

The Network for the Detection of Atmospheric Composition Change (NDACC): history, status and perspectives

NASA Astrophysics Data System (ADS)

De Mazière, Martine; Thompson, Anne M.; Kurylo, Michael J.; Wild, Jeannette D.; Bernhard, Germar; Blumenstock, Thomas; Braathen, Geir O.; Hannigan, James W.; Lambert, Jean-Christopher; Leblanc, Thierry; McGee, Thomas J.; Nedoluha, Gerald; Petropavlovskikh, Irina; Seckmeyer, Gunther; Simon, Paul C.; Steinbrecht, Wolfgang; Strahan, Susan E.

2018-04-01

The Network for the Detection of Atmospheric Composition Change (NDACC) is an international global network of more than 90 stations making high-quality measurements of atmospheric composition that began official operations in 1991 after 5 years of planning. Apart from sonde measurements, all measurements in the network are performed by ground-based remote-sensing techniques. Originally named the Network for the Detection of Stratospheric Change (NDSC), the name of the network was changed to NDACC in 2005 to better reflect the expanded scope of its measurements. The primary goal of NDACC is to establish long-term databases for detecting changes and trends in the chemical and physical state of the atmosphere (mesosphere, stratosphere, and troposphere) and to assess the coupling of such changes with climate and air quality. NDACC's origins, station locations, organizational structure, and data archiving are described. NDACC is structured around categories of ground-based observational techniques (sonde, lidar, microwave radiometers, Fourier-transform infrared, UV-visible DOAS (differential optical absorption spectroscopy)-type, and Dobson-Brewer spectrometers, as well as spectral UV radiometers), timely cross-cutting themes (ozone, water vapour, measurement strategies, cross-network data integration), satellite measurement systems, and theory and analyses. Participation in NDACC requires compliance with strict measurement and data protocols to ensure that the network data are of high and consistent quality. To widen its scope, NDACC has established formal collaborative agreements with eight other cooperating networks and Global Atmosphere Watch (GAW). A brief history is provided, major accomplishments of NDACC during its first 25 years of operation are reviewed, and a forward-looking perspective is presented.

The Network for the Detection of Atmospheric Composition Change (NDACC): History, Status and Perspectives

NASA Technical Reports Server (NTRS)

Simon, Paul C.; De Maziere, Martine; Bernhard, Germar; Blumenstock, Thomas; McGee, Thomas J.; Petropavlovskikh, Irina; Steinbrecht, Wolfgang; Wild, Jeannette D.; Lambert, Jean-Christopher; Seckmeyer, Gunther;

Cooperative Efforts in Urban Literacy: Learnings from the Urban Literacy Network's Grant Projects.

ERIC Educational Resources Information Center

Williams, Martha

One of the major activities of the Urban Literacy Network (ULN) is a grants program aimed at supporting cooperative, collaborative approaches to developing resources and support systems for literacy in urban areas. Eleven grants were awarded in 1987-1988 in the following urban areas: Boston; Chicago; Denver; El Paso; Houston; Nashville; Oklahoma…

COOPERATIVE ROUTING FOR DYNAMIC AERIAL LAYER NETWORKS

DTIC Science & Technology

2018-03-01

Advisor, Computing & Communications Division Information Directorate This report is published in the interest of scientific and technical...information accumulation at the physical layer, and study the cooperative routing and resource allocation problems associated with such SU networks...interference power constraint is studied . In [Shi2012Joint], an optimal power and sub-carrier allocation strategy to maximize SUs’ throughput subject to

A dynamically coupled allosteric network underlies binding cooperativity in Src kinase

PubMed Central

Foda, Zachariah H.; Shan, Yibing; Kim, Eric T.; Shaw, David E.; Seeliger, Markus A.

2015-01-01

Protein tyrosine kinases are attractive drug targets because many human diseases are associated with the deregulation of kinase activity. However, how the catalytic kinase domain integrates different signals and switches from an active to an inactive conformation remains incompletely understood. Here we identify an allosteric network of dynamically coupled amino acids in Src kinase that connects regulatory sites to the ATP- and substrate-binding sites. Surprisingly, reactants (ATP and peptide substrates) bind with negative cooperativity to Src kinase while products (ADP and phosphopeptide) bind with positive cooperativity. We confirm the molecular details of the signal relay through the allosteric network by biochemical studies. Experiments on two additional protein tyrosine kinases indicate that the allosteric network may be largely conserved among these enzymes. Our work provides new insights into the regulation of protein tyrosine kinases and establishes a potential conduit by which resistance mutations to ATP-competitive kinase inhibitors can affect their activity. PMID:25600932

Differentiated optical services: a quality of optical service model for WDM networks

NASA Astrophysics Data System (ADS)

Ndousse, Thomas D.; Golmie, Nada

1999-08-01

This paper addresses the issues of guaranteed and scalable end-to-end QoS in Metropolitan DWDM networks serving as transit networks for IP access networks. DWDM offering few wavelengths have in the past been deployed in backbone networks to upgrade point-to-point transmission where sharing is based on coarse granularity. This type of DWDM backbone networks, offering few lightpaths, provides no support for QoS services traversing the network. As DWDM networks with larger numbers of wavelengths penetrate the data-centric Metro environment, specific IP service requirements such as priority restoration, scalability, dynamic provisioning of capacity and routes, and support for coarse-grain QoS capabilities will have to be addressed in the optical domain in order to support end-to-end Service- Level Agreements. In this paper, we focus on the support of QoS in the optical domain in order to achieve end-to-end QoS over a DWDM network. We propose a QoS service model in the optical domain called Differentiated Optical Services (DOS). Service classification in DOS is based on a set of optical parameters that captures the quality and reliability of the optical lightpath.

Migration of optical core network to next generation networks - Carrier Grade Ethernet Optical Transport Network

NASA Astrophysics Data System (ADS)

Glamočanin, D.

2017-05-01

In order to maintain the continuity of the telecom operators’ network construction, while monitoring development needs, increasing customers’ demands and application of technological improvements, it is necessary to migrate optical transport core network to the next generation networks - Carrier Grade Ethernet Optical Transport Network (OTN CE). The primary objective of OTN CE is to realize an environment that is based solely on the switching in the optical domain, i.e. the realization of transparent optical networks and optical switching to the second layer of ISO / OSI model. The realization of such a network provides opportunities for further development of existing, but also technologically more demanding, new services. It is also a prerequisite to provide higher scalability, reliability, security and quality of QoS service, as well as prerequisites for the establishment of SLA (Service Level Agreement) for existing services, especially traffic in real time. This study aims to clarify the proposed model, which has the potential to be eventually adjusted in accordance with new scientific knowledge in this field as well as market requirements.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 2: Fiber optic technology and long distance networks

NASA Astrophysics Data System (ADS)

1986-10-01

The study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the Executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 2: Fiber optic technology and long distance networks

NASA Technical Reports Server (NTRS)

1986-01-01

The study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the Executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

On optimal designs of transparent WDM networks with 1 + 1 protection leveraged by all-optical XOR network coding schemes

NASA Astrophysics Data System (ADS)

Dao, Thanh Hai

2018-01-01

Network coding techniques are seen as the new dimension to improve the network performances thanks to the capability of utilizing network resources more efficiently. Indeed, the application of network coding to the realm of failure recovery in optical networks has been marking a major departure from traditional protection schemes as it could potentially achieve both rapid recovery and capacity improvement, challenging the prevailing wisdom of trading capacity efficiency for speed recovery and vice versa. In this context, the maturing of all-optical XOR technologies appears as a good match to the necessity of a more efficient protection in transparent optical networks. In addressing this opportunity, we propose to use a practical all-optical XOR network coding to leverage the conventional 1 + 1 optical path protection in transparent WDM optical networks. The network coding-assisted protection solution combines protection flows of two demands sharing the same destination node in supportive conditions, paving the way for reducing the backup capacity. A novel mathematical model taking into account the operation of new protection scheme for optimal network designs is formulated as the integer linear programming. Numerical results based on extensive simulations on realistic topologies, COST239 and NSFNET networks, are presented to highlight the benefits of our proposal compared to the conventional approach in terms of wavelength resources efficiency and network throughput.

Properties of centralized cooperative sensing in cognitive radio networks

NASA Astrophysics Data System (ADS)

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.

Transmission in Optically Transparent Core Networks

NASA Astrophysics Data System (ADS)

Kilper, Dan; Jensen, Rich; Petermann, Klaus; Karasek, Miroslav

2007-03-01

Scope of Submission

• Optically transparent system design issues, transmission experiments, and field trials
• Optically transparent network architectures and topologies
• Dispersion management in reconfigurable and mesh systems
• Optically transparent network device and sub-system performance, design, characterization and control, including: amplifiers, transmitters, receivers, switches, add/drop multiplexers
• Transient and fault management
• Physical layer system control
• Monitoring and compensation to support transparency
• Wavelength routing and planning as they relate to physical layer transmission
• Hardware cost and configuration optimization for optically transparent networks

Research of the self-healing technologies in the optical communication network of distribution automation

NASA Astrophysics Data System (ADS)

Wang, Hao; Zhong, Guoxin

2018-03-01

Optical communication network is the mainstream technique of the communication networks for distribution automation, and self-healing technologies can improve the in reliability of the optical communication networks significantly. This paper discussed the technical characteristics and application scenarios of several network self-healing technologies in the access layer, the backbone layer and the core layer of the optical communication networks for distribution automation. On the base of the contrastive analysis, this paper gives an application suggestion of these self-healing technologies.

Role of investment heterogeneity in the cooperation on spatial public goods game.

PubMed

Yuan, Wu-Jie; Xia, Cheng-Yi

2014-01-01

Public cooperation plays a significant role in the survival and maintenance of biological species, to elucidate its origin thus becomes an interesting question from various disciplines. Through long-term development, the public goods game has proven to be a useful tool, where cooperator making contribution can beat again the free-rides. Differentiating from the traditional homogeneous investment, individual trend of making contribution is more likely affected by the investment level of his neighborhood. Based on this fact, we here investigate the impact of heterogeneous investment on public cooperation, where the investment sum is mapped to the proportion of cooperators determined by parameter α. Interestingly, we find, irrespective of interaction networks, that the increment of α (increment of heterogeneous investment) is beneficial for promoting cooperation and even guarantees the complete cooperation dominance under weak replication factor. While this promotion effect can be attributed to the formation of more robust cooperator clusters and shortening END period. Moreover, we find that this simple mechanism can change the potential interaction network, which results in the change of phase diagrams. We hope that our work may shed light on the understanding of the cooperative behavior in other social dilemmas.

Social contact patterns can buffer costs of forgetting in the evolution of cooperation.

PubMed

Stevens, Jeffrey R; Woike, Jan K; Schooler, Lael J; Lindner, Stefan; Pachur, Thorsten

2018-06-13

Analyses of the evolution of cooperation often rely on two simplifying assumptions: (i) individuals interact equally frequently with all social network members and (ii) they accurately remember each partner's past cooperation or defection. Here, we examine how more realistic, skewed patterns of contact-in which individuals interact primarily with only a subset of their network's members-influence cooperation. In addition, we test whether skewed contact patterns can counteract the decrease in cooperation caused by memory errors (i.e. forgetting). Finally, we compare two types of memory error that vary in whether forgotten interactions are replaced with random actions or with actions from previous encounters. We use evolutionary simulations of repeated prisoner's dilemma games that vary agents' contact patterns, forgetting rates and types of memory error. We find that highly skewed contact patterns foster cooperation and also buffer the detrimental effects of forgetting. The type of memory error used also influences cooperation rates. Our findings reveal previously neglected but important roles of contact pattern, type of memory error and the interaction of contact pattern and memory on cooperation. Although cognitive limitations may constrain the evolution of cooperation, social contact patterns can counteract some of these constraints. © 2018 The Author(s).

Competition-cooperation relationship networks characterize the competition and cooperation between proteins

PubMed Central

Li, Hong; Zhou, Yuan; Zhang, Ziding

2015-01-01

By analyzing protein-protein interaction (PPI) networks, one can find that a protein may have multiple binding partners. However, it is difficult to determine whether the interactions with these partners occur simultaneously from binary PPIs alone. Here, we construct the yeast and human competition-cooperation relationship networks (CCRNs) based on protein structural interactomes to clearly exhibit the relationship (competition or cooperation) between two partners of the same protein. If two partners compete for the same interaction interface, they would be connected by a competitive edge; otherwise, they would be connected by a cooperative edge. The properties of three kinds of hubs (i.e., competitive, modest, and cooperative hubs) are analyzed in the CCRNs. Our results show that competitive hubs have higher clustering coefficients and form clusters in the human CCRN, but these tendencies are not observed in the yeast CCRN. We find that the human-specific proteins contribute significantly to these differences. Subsequently, we conduct a series of computational experiments to investigate the regulatory mechanisms that avoid competition between proteins. Our comprehensive analyses reveal that for most yeast and human protein competitors, transcriptional regulation plays an important role. Moreover, the human-specific proteins have a particular preference for other regulatory mechanisms, such as alternative splicing. PMID:26108281

T-SDN architecture for space and ground integrated optical transport network

NASA Astrophysics Data System (ADS)

Nie, Kunkun; Hu, Wenjing; Gao, Shenghua; Chang, Chengwu

2015-11-01

Integrated optical transport network is the development trend of the future space information backbone network. The space and ground integrated optical transport network(SGIOTN) may contain a variety of equipment and systems. Changing the network or meeting some innovation missions in the network will be an expensive implement. Software Defined Network(SDN) provides a good solution to flexibly adding process logic, timely control states and resources of the whole network, as well as shielding the differences of heterogeneous equipment and so on. According to the characteristics of SGIOTN, we propose an transport SDN architecture for it, with hierarchical control plane and data plane composed of packet networks and optical transport networks.

All-optical OFDM network coding scheme for all-optical virtual private communication in PON

NASA Astrophysics Data System (ADS)

Li, Lijun; Gu, Rentao; Ji, Yuefeng; Bai, Lin; Huang, Zhitong

2014-03-01

A novel optical orthogonal frequency division multiplexing (OFDM) network coding scheme is proposed over passive optical network (PON) system. The proposed scheme for all-optical virtual private network (VPN) does not only improve transmission efficiency, but also realize full-duplex communication mode in a single fiber. Compared with the traditional all-optical VPN architectures, the all-optical OFDM network coding scheme can support higher speed, more flexible bandwidth allocation, and higher spectrum efficiency. In order to reduce the difficulty of alignment for encoding operation between inter-communication traffic, the width of OFDM subcarrier pulse is stretched in our proposed scheme. The feasibility of all-optical OFDM network coding scheme for VPN is verified, and the relevant simulation results show that the full-duplex inter-communication traffic stream can be transmitted successfully. Furthermore, the tolerance of misalignment existing in inter-ONUs traffic is investigated and analyzed for all-optical encoding operation, and the difficulty of pulse alignment is proved to be lower.

Embedded Electro-Optic Sensor Network for the On-Site Calibration and Real-Time Performance Monitoring of Large-Scale Phased Arrays

DTIC Science & Technology

2005-07-09

This final report summarizes the progress during the Phase I SBIR project entitled Embedded Electro - Optic Sensor Network for the On-Site Calibration...network based on an electro - optic field-detection technique (the Electro - optic Sensor Network, or ESN) for the performance evaluation of phased

Driving Innovation in Optical Networking

NASA Astrophysics Data System (ADS)

Colizzi, Ernesto

Over the past 30 years, network applications have changed with the advent of innovative services spanning from high-speed broadband access to mobile data communications and to video signal distribution. To support this service evolution, optical transport infrastructures have changed their role. Innovations in optical networking have not only allowed the pure "bandwidth per fiber" increase, but also the realization of highly dependable and easy-to-manage networks. This article analyzes the innovations that have characterized the optical networking solutions from different perspectives, with a specific focus on the advancements introduced by Alcatel-Lucent's research and development laboratories located in Italy. The advancements of optical networking will be explored and discussed through Alcatel-Lucent's optical products to contextualize each innovation with the market evolution.

Optical network security using unipolar Walsh code

NASA Astrophysics Data System (ADS)

Sikder, Somali; Sarkar, Madhumita; Ghosh, Shila

2018-04-01

Optical code-division multiple-access (OCDMA) is considered as a good technique to provide optical layer security. Many research works have been published to enhance optical network security by using optical signal processing. The paper, demonstrates the design of the AWG (arrayed waveguide grating) router-based optical network for spectral-amplitude-coding (SAC) OCDMA networks with Walsh Code to design a reconfigurable network codec by changing signature codes to against eavesdropping. In this paper we proposed a code reconfiguration scheme to improve the network access confidentiality changing the signature codes by cyclic rotations, for OCDMA system. Each of the OCDMA network users is assigned a unique signature code to transmit the information and at the receiving end each receiver correlates its own signature pattern a(n) with the receiving pattern s(n). The signal arriving at proper destination leads to s(n)=a(n).

De-optical-line-terminal hybrid access-aggregation optical network for time-sensitive services based on software-defined networking orchestration

NASA Astrophysics Data System (ADS)

Bai, Wei; Yang, Hui; Xiao, Hongyun; Yu, Ao; He, Linkuan; Zhang, Jie; Li, Zhen; Du, Yi

2017-11-01

With the increase in varieties of services in network, time-sensitive services (TSSs) appear and bring forward an impending need for delay performance. Ultralow-latency communication has become one of the important development goals for many scenarios in the coming 5G era (e.g., robotics and driverless cars). However, the conventional methods, which decrease delay by promoting the available resources and the network transmission speed, have limited effect; a new breakthrough for ultralow-latency communication is necessary. We propose a de-optical-line-terminal (De-OLT) hybrid access-aggregation optical network (DAON) for TSS based on software-defined networking (SDN) orchestration. In this network, low-latency all-optical communication based on optical burst switching can be achieved by removing OLT. For supporting this network and guaranteeing the quality of service for TSSs, we design SDN-driven control method and service provision method. Numerical results demonstrate the proposed DAON promotes network service efficiency and avoids traffic congestion.

An information model for a virtual private optical network (OVPN) using virtual routers (VRs)

NASA Astrophysics Data System (ADS)

Vo, Viet Minh Nhat

2002-05-01

This paper describes a virtual private optical network architecture (Optical VPN - OVPN) based on virtual router (VR). It improves over architectures suggested for virtual private networks by using virtual routers with optical networks. The new things in this architecture are necessary changes to adapt to devices and protocols used in optical networks. This paper also presents information models for the OVPN: at the architecture level and at the service level. These are extensions to the DEN (directory enable network) and CIM (Common Information Model) for OVPNs using VRs. The goal is to propose a common management model using policies.

Leveraging master-slave OpenFlow controller arrangement to improve control plane resiliency in SD-EONs.

PubMed

Chen, Xiaoliang; Zhao, Bin; Ma, Shoujiang; Chen, Cen; Hu, Daoyun; Zhou, Wenshuang; Zhu, Zuqing

2015-03-23

In this paper, we study how to improve the control plane resiliency of software-defined elastic optical networks (SD-EONs) and design a master-slave OpenFlow (OF) controller arrangement. Specifically, we introduce two OF controllers (OF-Cs), i.e., the master and slave OF-Cs, and make them work in a collaborative way to protect the SD-EON against controller failures. We develop a controller communication protocol (CCP) to facilitate the cooperation of the two OF-Cs. With the CCP, the master OF-C (M-OF-C) can synchronize network status to the slave OF-C (S-OF-C) in real time, while S-OF-C can quickly detect the failure of M-OF-C and take over the network control and management (NC&M) tasks timely to avoid service disruption. We implement the proposed framework in an SD-EON control plane testbed built with high-performance servers, and perform NC&M experiments with different network failure scenarios to demonstrate its effectiveness. Experimental results indicate that the proposed system can restore services in both the data and control planes of SD-EON jointly while maintaining relatively good scalability. To the best of our knowledge, this is the first demonstration that realizes control plane resiliency in SD-EONs.

Toward next-generation optical networks: a network operator perspective based on experimental tests and economic analysis

NASA Astrophysics Data System (ADS)

Xiao, Xiaojun; Du, Chunsheng; Zhou, Rongsheng

2004-04-01

As a result of data traffic"s exponential growth, network is currently evolving from fixed circuit switched services to dynamic packet switched services, which has brought unprecedented changes to the existing transport infrastructure. It is generally agreed that automatic switched optical network (ASON) is one of the promising solutions for the next generation optical networks. In this paper, we present the results of our experimental tests and economic analysis on ASON. The intention of this paper is to present our perspective, in terms of evolution strategy toward ASON, on next generation optical networks. It is shown through experimental tests that the performance of current Pre-standard ASON enabled equipments satisfies the basic requirements of network operators and is ready for initial deployment. The results of the economic analysis show that network operators can be benefit from the deployment of ASON from three sides. Firstly, ASON can reduce the CAPEX for network expanding by integrating multiple ADM & DCS into one box. Secondly, ASON can reduce the OPEX for network operation by introducing automatic resource control scheme. Finally, ASON can increase margin revenue by providing new optical network services such as Bandwidth on Demand, optical VPN etc. Finally, the evolution strategy is proposed as our perspective toward next generation optical networks. We hope the evolution strategy introduced may be helpful for the network operators to gracefully migrate their fixed ring based legacy networks to next generation dynamic mesh based network.

Cooperative Learning in Rural and Small Schools. Rural/Small Schools Network Information Exchange: Number 10, Spring 1991.

ERIC Educational Resources Information Center

Regional Laboratory for Educational Improvement of the Northeast & Islands, Andover, MA.

This packet includes reprints of journal articles and other resources pertaining to cooperative learning strategies in small, rural schools. The four sections of the packet cover introduction to cooperative learning, examples of how team strategies and cooperative learning can be used, issues such as program evaluation and public relations, and…

Preface

NASA Astrophysics Data System (ADS)

Makabe, Toshiaki; Samukawa, Seiji

2007-06-01

Twenty-first century will be the era of the design technology on a firm basis of physics and chemistry under circumstances of a prospective high-speed computing along the line of environmentally friendly and economically saving society. The 4th International Workshop on Basic Aspects of Nonequilibrium Plasmas Interacting with Surfaces (BANPIS); Negative ions, their function & designability, and the 4th EU-Japan Joint Symposium on Plasma Processes (JSPP) were held at Hotel Highland Resort close to Mt. Fuji in Japan on January 30 - February 1, 2006. The joint conference was organized by the 21st century Center of Excellence (COE) for ;Optical & Electronic Device Technology for Access Networks; in Keio University, and co-operated by the Center for ;Atomic and Molecular Engineering,; in Open University, and by The Japan Society of Applied Physics.

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

PubMed

Tirado-Soto, Magda Martina; Zamberlan, Fabio Luiz

2013-04-01

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

Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi—Albert Networks with Degree-Dependent Guilt Mechanism

NASA Astrophysics Data System (ADS)

Wang, Xian-Jia; Quan, Ji; Liu, Wei-Bing

2012-05-01

This paper studies the continuous prisoner's dilemma games (CPDG) on Barabasi—Albert (BA) networks. In the model, each agent on a vertex of the networks makes an investment and interacts with all of his neighboring agents. Making an investment is costly, but which benefits its neighboring agents, where benefit and cost depend on the level of investment made. The payoff of each agent is given by the sum of payoffs it receives in its interactions with all its neighbors. Not only payoff, individual's guilty emotion in the games has also been considered. The negative guilty emotion produced in comparing with its neighbors can reduce the utility of individuals directly. We assume that the reduction amount depends on the individual's degree and a baseline level parameter. The group's cooperative level is characterized by the average investment of the population. Each player makes his investment in the next step based on a convex combination of the investment of his best neighbors in the last step, his best history strategies in the latest steps which number is controlled by a memory length parameter, and a uniformly distributed random number. Simulation results show that this degree-dependent guilt mechanism can promote the evolution of cooperation dramatically comparing with degree-independent guilt or no guilt cases. Imitation, memory, uncertainty coefficients and network structure also play determinant roles in the cooperation level of the population. All our results may shed some new light on studying the evolution of cooperation based on network reciprocity mechanisms.

Application of Multilayer Feedforward Neural Networks to Precipitation Cell-Top Altitude Estimation

NASA Technical Reports Server (NTRS)

Spina, Michelle S.; Schwartz, Michael J.; Staelin, David H.; Gasiewski, Albin J.

1998-01-01

The use of passive 118-GHz O2 observations of rain cells for precipitation cell-top altitude estimation is demonstrated by using a multilayer feed forward neural network retrieval system. Rain cell observations at 118 GHz were compared with estimates of the cell-top altitude obtained by optical stereoscopy. The observations were made with 2 4 km horizontal spatial resolution by using the Millimeter-wave Temperature Sounder (MTS) scanning spectrometer aboard the NASA ER-2 research aircraft during the Genesis of Atlantic Lows Experiment (GALE) and the COoperative Huntsville Meteorological EXperiment (COHMEX) in 1986. The neural network estimator applied to MTS spectral differences between clouds, and nearby clear air yielded an rms discrepancy of 1.76 km for a combined cumulus, mature, and dissipating cell set and 1.44 km for the cumulus-only set. An improvement in rms discrepancy to 1.36 km was achieved by including additional MTS information on the absolute atmospheric temperature profile. An incremental method for training neural networks was developed that yielded robust results, despite the use of as few as 56 training spectra. Comparison of these results with a nonlinear statistical estimator shows that superior results can be obtained with a neural network retrieval system. Imagery of estimated cell-top altitudes was created from 118-GHz spectral imagery gathered from CAMEX, September through October 1993, and from cyclone Oliver, February 7, 1993.

Modeling Misbehavior in Cooperative Diversity: A Dynamic Game Approach

NASA Astrophysics Data System (ADS)

Dehnie, Sintayehu; Memon, Nasir

2009-12-01

Cooperative diversity protocols are designed with the assumption that terminals always help each other in a socially efficient manner. This assumption may not be valid in commercial wireless networks where terminals may misbehave for selfish or malicious intentions. The presence of misbehaving terminals creates a social-dilemma where terminals exhibit uncertainty about the cooperative behavior of other terminals in the network. Cooperation in social-dilemma is characterized by a suboptimal Nash equilibrium where wireless terminals opt out of cooperation. Hence, without establishing a mechanism to detect and mitigate effects of misbehavior, it is difficult to maintain a socially optimal cooperation. In this paper, we first examine effects of misbehavior assuming static game model and show that cooperation under existing cooperative protocols is characterized by a noncooperative Nash equilibrium. Using evolutionary game dynamics we show that a small number of mutants can successfully invade a population of cooperators, which indicates that misbehavior is an evolutionary stable strategy (ESS). Our main goal is to design a mechanism that would enable wireless terminals to select reliable partners in the presence of uncertainty. To this end, we formulate cooperative diversity as a dynamic game with incomplete information. We show that the proposed dynamic game formulation satisfied the conditions for the existence of perfect Bayesian equilibrium.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks.

PubMed

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.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks

NASA Astrophysics Data System (ADS)

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.

An All-Optical Access Metro Interface for Hybrid WDM/TDM PON Based on OBS

NASA Astrophysics Data System (ADS)

Segarra, Josep; Sales, Vicent; Prat, Josep

2007-04-01

A new all-optical access metro network interface based on optical burst switching (OBS) is proposed. A hybrid wavelength-division multiplexing/time-division multiplexing (WDM/TDM) access architecture with reflective optical network units (ONUs), an arrayed-waveguide-grating outside plant, and a tunable laser stack at the optical line terminal (OLT) is presented as a solution for the passive optical network. By means of OBS and a dynamic bandwidth allocation (DBA) protocol, which polls the ONUs, the available access bandwidth is managed. All the network intelligence and costly equipment is located at the OLT, where the DBA module is centrally implemented, providing quality of service (QoS). To scale this access network, an optical cross connect (OXC) is then used to attain a large number of ONUs by the same OLT. The hybrid WDM/TDM structure is also extended toward the metropolitan area network (MAN) by introducing the concept of OBS multiplexer (OBS-M). The network element OBS-M bridges the MAN and access networks by offering all-optical cross connection, wavelength conversion, and data signaling. The proposed innovative OBS-M node yields a full optical data network, interfacing access and metro with a geographically distributed access control. The resulting novel access metro architectures are nonblocking and, with an improved signaling, provide QoS, scalability, and very low latency. Finally, numerical analysis and simulations demonstrate the traffic performance of the proposed access scheme and all-optical access metro interface and architectures.

The cooperative forestry research unit Commercial Thinning Research Network--9-year results

Treesearch

Robert S. Seymour; Spencer R. Meyer; Robert G. Wagner

2014-01-01

The Commercial Thinning Research Network (CTRN) was established throughout the spruce-fir forest of Maine beginning in 2000 with substantial funding from the University of Maine's Cooperative Forestry Research Unit. One of six replicates of the precommercially thinned stand condition in the CTRN is located in compartment 23A in the U.S. Department of Agriculture,...

DISSAnet: Development of an Information Science Research Network in the Republic of South Africa 1998-2000

ERIC Educational Resources Information Center

Wormell, Irene; Bothma, Theo J. D.; Ralebipi, Rocky M. D.

2002-01-01

Based on the concept of the NORDIC academic cooperation model (NorFa), in 1998-2000 Danish and international information scientists initiated a co-operative effort to build an education and research network among LIS institutions in South Africa. The paper reports the successful completion of the project, with 20 MA and Ph.D. students selected…

Power allocation strategies to minimize energy consumption in wireless body area networks.

PubMed

Kailas, Aravind

2011-01-01

The wide scale deployment of wireless body area networks (WBANs) hinges on designing energy efficient communication protocols to support the reliable communication as well as to prolong the network lifetime. Cooperative communications, a relatively new idea in wireless communications, offers the benefits of multi-antenna systems, thereby improving the link reliability and boosting energy efficiency. In this short paper, the advantages of resorting to cooperative communications for WBANs in terms of minimized energy consumption are investigated. Adopting an energy model that encompasses energy consumptions in the transmitter and receiver circuits, and transmitting energy per bit, it is seen that cooperative transmission can improve energy efficiency of the wireless network. In particular, the problem of optimal power allocation is studied with the constraint of targeted outage probability. Two strategies of power allocation are considered: power allocation with and without posture state information. Using analysis and simulation-based results, two key points are demonstrated: (i) allocating power to the on-body sensors making use of the posture information can reduce the total energy consumption of the WBAN; and (ii) when the channel condition is good, it is better to recruit less relays for cooperation to enhance energy efficiency.

Robustness of coevolution in resolving prisoner's dilemma games on interdependent networks subject to attack

NASA Astrophysics Data System (ADS)

Liu, Penghui; Liu, Jing

2017-08-01

Recently, coevolution between strategy and network structure has been established as a rule to resolve social dilemmas and reach optimal situations for cooperation. Many follow-up researches have focused on studying how coevolution helps networks reorganize to deter the defectors and many coevolution methods have been proposed. However, the robustness of the coevolution rules against attacks have not been studied much. Since attacks may directly influence the original evolutionary process of cooperation, the robustness should be an important index while evaluating the quality of a coevolution method. In this paper, we focus on investigating the robustness of an elementary coevolution method in resolving the prisoner's dilemma game upon the interdependent networks. Three different types of time-independent attacks, named as edge attacks, instigation attacks and node attacks have been employed to test its robustness. Through analyzing the simulation results obtained, we find this coevolution method is relatively robust against the edge attack and the node attack as it successfully maintains cooperation in the population over the entire attack range. However, when the instigation probability of the attacked individuals is large or the attack range of instigation attack is wide enough, coevolutionary rule finally fails in maintaining cooperation in the population.

A novel all-optical label processing based on multiple optical orthogonal codes sequences for optical packet switching networks

NASA Astrophysics Data System (ADS)

Zhang, Chongfu; Qiu, Kun; Xu, Bo; Ling, Yun

2008-05-01

This paper proposes an all-optical label processing scheme that uses the multiple optical orthogonal codes sequences (MOOCS)-based optical label for optical packet switching (OPS) (MOOCS-OPS) networks. In this scheme, each MOOCS is a permutation or combination of the multiple optical orthogonal codes (MOOC) selected from the multiple-groups optical orthogonal codes (MGOOC). Following a comparison of different optical label processing (OLP) schemes, the principles of MOOCS-OPS network are given and analyzed. Firstly, theoretical analyses are used to prove that MOOCS is able to greatly enlarge the number of available optical labels when compared to the previous single optical orthogonal code (SOOC) for OPS (SOOC-OPS) network. Then, the key units of the MOOCS-based optical label packets, including optical packet generation, optical label erasing, optical label extraction and optical label rewriting etc., are given and studied. These results are used to verify that the proposed MOOCS-OPS scheme is feasible.

From degree-correlated to payoff-correlated activity for an optimal resolution of social dilemmas

NASA Astrophysics Data System (ADS)

Aleta, Alberto; Meloni, Sandro; Perc, Matjaž; Moreno, Yamir

2016-12-01

An active participation of players in evolutionary games depends on several factors, ranging from personal stakes to the properties of the interaction network. Diverse activity patterns thus have to be taken into account when studying the evolution of cooperation in social dilemmas. Here we study the weak prisoner's dilemma game, where the activity of each player is determined in a probabilistic manner either by its degree or by its payoff. While degree-correlated activity introduces cascading failures of cooperation that are particularly severe on scale-free networks with frequently inactive hubs, payoff-correlated activity provides a more nuanced activity profile, which ultimately hinders systemic breakdowns of cooperation. To determine optimal conditions for the evolution of cooperation, we introduce an exponential decay to payoff-correlated activity that determines how fast the activity of a player returns to its default state. We show that there exists an intermediate decay rate at which the resolution of the social dilemma is optimal. This can be explained by the emerging activity patterns of players, where the inactivity of hubs is compensated effectively by the increased activity of average-degree players, who through their collective influence in the network sustain a higher level of cooperation. The sudden drops in the fraction of cooperators observed with degree-correlated activity therefore vanish, and so does the need for the lengthy spatiotemporal reorganization of compact cooperative clusters. The absence of such asymmetric dynamic instabilities thus leads to an optimal resolution of social dilemmas, especially when the conditions for the evolution of cooperation are strongly adverse.

Crosstalk-aware virtual network embedding over inter-datacenter optical networks with few-mode fibers

NASA Astrophysics Data System (ADS)

Huang, Haibin; Guo, Bingli; Li, Xin; Yin, Shan; Zhou, Yu; Huang, Shanguo

2017-12-01

Virtualization of datacenter (DC) infrastructures enables infrastructure providers (InPs) to provide novel services like virtual networks (VNs). Furthermore, optical networks have been employed to connect the metro-scale geographically distributed DCs. The synergistic virtualization of the DC infrastructures and optical networks enables the efficient VN service over inter-DC optical networks (inter-DCONs). While the capacity of the used standard single-mode fiber (SSMF) is limited by their nonlinear characteristics. Thus, mode-division multiplexing (MDM) technology based on few-mode fibers (FMFs) could be employed to increase the capacity of optical networks. Whereas, modal crosstalk (XT) introduced by optical fibers and components deployed in the MDM optical networks impacts the performance of VN embedding (VNE) over inter-DCONs with FMFs. In this paper, we propose a XT-aware VNE mechanism over inter-DCONs with FMFs. The impact of XT is considered throughout the VNE procedures. The simulation results show that the proposed XT-aware VNE can achieves better performances of blocking probability and spectrum utilization compared to conventional VNE mechanisms.

3 x 3 free-space optical router based on crossbar network and its control algorithm

NASA Astrophysics Data System (ADS)

Hou, Peipei; Sun, Jianfeng; Yu, Zhou; Lu, Wei; Wang, Lijuan; Liu, Liren

2015-08-01

A 3 × 3 free-space optical router, which comprises optical switches and polarizing beam splitter (PBS) and based on crossbar network, is proposed in this paper. A control algorithm for the 3 × 3 free-space optical router is also developed to achieve rapid control without rearrangement. In order to test the performance of the network based on 3 × 3 free-space optical router and that of the algorithm developed for the optical router, experiments are designed. The experiment results show that the interconnection network based on the 3 × 3 free-space optical router has low cross talk, fast connection speed. Under the control of the algorithm developed, a non-block and real free interconnection network is obtained based on the 3 × 3 free-space optical router we proposed.

Optical fiber cable and wiring techniques for fiber to the home (FTTH)

NASA Astrophysics Data System (ADS)

Takai, Hirofumi; Yamauchi, Osamu

2009-08-01

NTT group's new medium-term management strategy calls for 20 million optical subscribers by 2010, and NTT Laboratories is pushing forward to meet this goal. Before that date, an efficient optical access network must be constructed, and afterwards, when the era of mass optical communications finally arrives, the facilities and equipment supporting the network will have to be effectively operated and maintained. At NTT Access Network Service Systems Laboratories, we are developing various technologies to correspond to the massive deployment of optical broadband services. We are also developing various new technologies for efficiently operating optical access network systems that will continue to expand in the future, and to supply our customers with good services. This paper provides an overview of the new optical access network system technologies that are being developed at NTT Access Network Service Systems Laboratories to address these issues.

Optical Network Virtualisation Using Multitechnology Monitoring and SDN-Enabled Optical Transceiver

NASA Astrophysics Data System (ADS)

Ou, Yanni; Davis, Matthew; Aguado, Alejandro; Meng, Fanchao; Nejabati, Reza; Simeonidou, Dimitra

2018-05-01

We introduce the real-time multi-technology transport layer monitoring to facilitate the coordinated virtualisation of optical and Ethernet networks supported by optical virtualise-able transceivers (V-BVT). A monitoring and network resource configuration scheme is proposed to include the hardware monitoring in both Ethernet and Optical layers. The scheme depicts the data and control interactions among multiple network layers under the software defined network (SDN) background, as well as the application that analyses the monitored data obtained from the database. We also present a re-configuration algorithm to adaptively modify the composition of virtual optical networks based on two criteria. The proposed monitoring scheme is experimentally demonstrated with OpenFlow (OF) extensions for a holistic (re-)configuration across both layers in Ethernet switches and V-BVTs.

SDN-Enabled Dynamic Feedback Control and Sensing in Agile Optical Networks

NASA Astrophysics Data System (ADS)

Lin, Likun

Fiber optic networks are no longer just pipelines for transporting data in the long haul backbone. Exponential growth in traffic in metro-regional areas has pushed higher capacity fiber toward the edge of the network, and highly dynamic patterns of heterogeneous traffic have emerged that are often bursty, severely stressing the historical "fat and dumb pipe" static optical network, which would need to be massively over-provisioned to deal with these loads. What is required is a more intelligent network with a span of control over the optical as well as electrical transport mechanisms which enables handling of service requests in a fast and efficient way that guarantees quality of service (QoS) while optimizing capacity efficiency. An "agile" optical network is a reconfigurable optical network comprised of high speed intelligent control system fed by real-time in situ network sensing. It provides fast response in the control and switching of optical signals in response to changing traffic demands and network conditions. This agile control of optical signals is enabled by pushing switching decisions downward in the network stack to the physical layer. Implementing such agility is challenging due to the response dynamics and interactions of signals in the physical layer. Control schemes must deal with issues such as dynamic power equalization, EDFA transients and cascaded noise effects, impairments due to self-phase modulation and dispersion, and channel-to-channel cross talk. If these issues are not properly predicted and mitigated, attempts at dynamic control can drive the optical network into an unstable state. In order to enable high speed actuation of signal modulators and switches, the network controller must be able to make decisions based on predictive models. In this thesis, we consider how to take advantage of Software Defined Networking (SDN) capabilities for network reconfiguration, combined with embedded models that access updates from deployed network monitoring sensors. In order to maintain signal quality while optimizing network resources, we find that it is essential to model and update estimates of the physical link impairments in real-time. In this thesis, we consider the key elements required to enable an agile optical network, with contributions as follows: • Control Framework: extended the SDN concept to include the optical transport network through extensions to the OpenFlow (OF) protocol. A unified SDN control plane is built to facilitate control and management capability across the electrical/packet-switched and optical/circuit-switched portions of the network seamlessly. The SDN control plane serves as a platform to abstract the resources of multilayer/multivendor networks. Through this platform, applications can dynamically request the network resources to meet their service requirements. • Use of In-situ Monitors: enabled real-time physical impairment sensing in the control plane using in-situ Optical Performance Monitoring (OPM) and bit error rate (BER) analyzers. OPM and BER values are used as quantitative indicators of the link status and are fed to the control plane through a high-speed data collection interface to form a closed-loop feedback system to enable adaptive resource allocation. • Predictive Network Model: used a network model embedded in the control layer to study the link status. The estimated results of network status is fed into the control decisions to precompute the network resources. The performance of the network model can be enhanced by the sensing results. • Real-Time Control Algorithms: investigated various dynamic resource allocation mechanisms supporting an agile optical network. Intelligent routing and wavelength switching for recovering from traffic impairments is achieved experimentally in the agile optical network within one second. A distance-adaptive spectrum allocation scheme to address transmission impairments caused by cascaded Wavelength Selective Switches (WSS) is proposed and evaluated for improving network spectral efficiency.

Laser and Stand-off Spectroscopy Quantum and Statistical Optics

DTIC Science & Technology

2011-01-01

medium" PRA 81, 063824 (2010). Cooperative Spontaneous Emission (CSE) 12 U.S. Das, G.S. Agarwal, M.O. Scully, " Quantum Interferences in Cooperative...Sautenkov, and M. Scully. "Excitation of atomic coherence using off-resonant strong laser pulses," PRA 79, 06833 (2009). 34. M.O. Scully, " Quantum ...SUBTITLE Laser and Stand-off Spectroscopy, Quantum and Statistical Optics 6. AUTHORS Marian O. Scully 5. FUNDING NUMBERS Award No. N00014-08-1

Broadband Optical Access Technologies to Converge towards a Broadband Society in Europe

NASA Astrophysics Data System (ADS)

Coudreuse, Jean-Pierre; Pautonnier, Sophie; Lavillonnière, Eric; Didierjean, Sylvain; Hilt, Benoît; Kida, Toshimichi; Oshima, Kazuyoshi

This paper provides insights on the status of broadband optical access market and technologies in Europe and on the expected trends for the next generation optical access networks. The final target for most operators, cities or any other player is of course FTTH (Fibre To The Home) deployment although we can expect intermediate steps with copper or wireless technologies. Among the two candidate architectures for FTTH, PON (Passive Optical Network) is by far the most attractive and cost effective solution. We also demonstrate that Ethernet based optical access network is very adequate to all-IP networks without any incidence on the level of quality of service. Finally, we provide feedback from a FTTH pilot network in Colmar (France) based on Gigabit Ethernet PON technology. The interest of this pilot lies on the level of functionality required for broadband optical access networks but also on the development of new home network configurations.

Comparison of cooperative and non-cooperative adaptive optics reference performance for propagation with thermal blooming effects

NASA Astrophysics Data System (ADS)

Edwards, Brian E.; Nitkowski, Arthur; Lawrence, Ryan; Horton, Kasey; Higgs, Charles

2004-10-01

Atmospheric turbulence and laser-induced thermal blooming effects can degrade the beam quality of a high-energy laser (HEL) weapon, and ultimately limit the amount of energy deliverable to a target. Lincoln Laboratory has built a thermal blooming laboratory capable of emulating atmospheric thermal blooming and turbulence effects for tactical HEL systems. The HEL weapon emulation hardware includes an adaptive optics beam delivery system, which utilizes a Shack-Hartman wavefront sensor and a 349 actuator deformable mirror. For this experiment, the laboratory was configured to emulate an engagement scenario consisting of sea skimming target approaching directly toward the HEL weapon at a range of 10km. The weapon utilizes a 1.5m aperture and radiates at a 1.62 micron wavelength. An adaptive optics reference beam was provided as either a point source located at the target (cooperative) or a projected point source reflected from the target (uncooperative). Performance of the adaptive optics system was then compared between reference sources. Results show that, for operating conditions with a thermal blooming distortion number of 75 and weak turbulence (Rytov of 0.02 and D/ro of 3), cooperative beacon AO correction experiences Phase Compensation Instability, resulting in lower performance than a simple, open-loop condition. The uncooperative beacon resulted in slightly better performance than the open-loop condition.

Towards effective payoffs in the prisoner’s dilemma game on scale-free networks

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž; Danku, Zsuzsa

2008-03-01

We study the transition towards effective payoffs in the prisoner's dilemma game on scale-free networks by introducing a normalization parameter guiding the system from accumulated payoffs to payoffs normalized with the connectivity of each agent. We show that during this transition the heterogeneity-based ability of scale-free networks to facilitate cooperative behavior deteriorates continuously, eventually collapsing with the results obtained on regular graphs. The strategy donations and adaptation probabilities of agents with different connectivities are studied. Results reveal that strategies generally spread from agents with larger towards agents with smaller degree. However, this strategy adoption flow reverses sharply in the fully normalized payoff limit. Surprisingly, cooperators occupy the hubs even if the averaged cooperation level due to partly normalized payoffs is moderate.

Cooperative Spatial Retreat for Resilient Drone Networks.

PubMed

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.

An optimization method of VON mapping for energy efficiency and routing in elastic optical networks

NASA Astrophysics Data System (ADS)

Liu, Huanlin; Xiong, Cuilian; Chen, Yong; Li, Changping; Chen, Derun

2018-03-01

To improve resources utilization efficiency, network virtualization in elastic optical networks has been developed by sharing the same physical network for difference users and applications. In the process of virtual nodes mapping, longer paths between physical nodes will consume more spectrum resources and energy. To address the problem, we propose a virtual optical network mapping algorithm called genetic multi-objective optimize virtual optical network mapping algorithm (GM-OVONM-AL), which jointly optimizes the energy consumption and spectrum resources consumption in the process of virtual optical network mapping. Firstly, a vector function is proposed to balance the energy consumption and spectrum resources by optimizing population classification and crowding distance sorting. Then, an adaptive crossover operator based on hierarchical comparison is proposed to improve search ability and convergence speed. In addition, the principle of the survival of the fittest is introduced to select better individual according to the relationship of domination rank. Compared with the spectrum consecutiveness-opaque virtual optical network mapping-algorithm and baseline-opaque virtual optical network mapping algorithm, simulation results show the proposed GM-OVONM-AL can achieve the lowest bandwidth blocking probability and save the energy consumption.

Optical protocols for advanced spacecraft networks

NASA Technical Reports Server (NTRS)

Bergman, Larry A.

1991-01-01

Most present day fiber optic networks are in fact extensions of copper wire networks. As a result, their speed is still limited by electronics even though optics is capable of running three orders of magnitude faster. Also, the fact that photons do not interact with one another (as electrons do) provides optical communication systems with some unique properties or new functionality that is not readily taken advantage of with conventional approaches. Some of the motivation for implementing network protocols in the optical domain, a few possible approaches including optical code-division multiple-access (CDMA), and how this class of networks can extend the technology life cycle of the Space Station Freedom (SSF) with increased performance and functionality are described.

Percolation and cooperation with mobile agents: geometric and strategy clusters.

PubMed

Vainstein, Mendeli H; Brito, Carolina; Arenzon, Jeferson J

2014-08-01

We study the conditions for persistent cooperation in an off-lattice model of mobile agents playing the Prisoner's Dilemma game with pure, unconditional strategies. Each agent has an exclusion radius r(P), which accounts for the population viscosity, and an interaction radius r(int), which defines the instantaneous contact network for the game dynamics. We show that, differently from the r(P)=0 case, the model with finite-sized agents presents a coexistence phase with both cooperators and defectors, besides the two absorbing phases, in which either cooperators or defectors dominate. We provide, in addition, a geometric interpretation of the transitions between phases. In analogy with lattice models, the geometric percolation of the contact network (i.e., irrespective of the strategy) enhances cooperation. More importantly, we show that the percolation of defectors is an essential condition for their survival. Differently from compact clusters of cooperators, isolated groups of defectors will eventually become extinct if not percolating, independently of their size.

Public goods games on adaptive coevolutionary networks

NASA Astrophysics Data System (ADS)

Pichler, Elgar; Shapiro, Avi M.

2017-07-01

Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such games, contributions to the public good are made only by cooperators, while all players, including defectors, reap public goods benefits, which are shares of the contributions amplified by a synergy factor. Classic results of game theory show that mutual defection, as opposed to cooperation, is the Nash Equilibrium of PGGs in well-mixed populations, where each player interacts with all others. In this paper, we explore the coevolutionary dynamics of a low information public goods game on a complex network in which players adapt to their environment in order to increase individual payoffs relative to past payoffs parameterized by greediness. Players adapt by changing their strategies, either to cooperate or to defect, and by altering their social connections. We find that even if players do not know other players' strategies and connectivity, cooperation can arise and persist despite large short-term fluctuations.

Public goods games on adaptive coevolutionary networks.

PubMed

Pichler, Elgar; Shapiro, Avi M

2017-07-01

Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such games, contributions to the public good are made only by cooperators, while all players, including defectors, reap public goods benefits, which are shares of the contributions amplified by a synergy factor. Classic results of game theory show that mutual defection, as opposed to cooperation, is the Nash Equilibrium of PGGs in well-mixed populations, where each player interacts with all others. In this paper, we explore the coevolutionary dynamics of a low information public goods game on a complex network in which players adapt to their environment in order to increase individual payoffs relative to past payoffs parameterized by greediness. Players adapt by changing their strategies, either to cooperate or to defect, and by altering their social connections. We find that even if players do not know other players' strategies and connectivity, cooperation can arise and persist despite large short-term fluctuations.

Deciding to Cooperate in Northern Ghana: Trust as an Evolutionary Constraint Across Cultural Diversity.

PubMed

Acedo-Carmona, Cristina; Gomila, Antoni

2015-11-27

The upper-east and northern regions of Ghana offers a unique opportunity to study the influence of evolutionary social dynamics in making cooperation possible, despite cultural differences. These regions are occupied by several distinct ethnic groups, in interaction, such as the Kussasi, Mamprusi, Bimoba, Konkomba, and Fulani. We will report our fieldwork related to how cooperation takes places there, both within each group and among people from the different groups. Methods included personal networks of cooperation (ego networks), interviews and analysis of group contexts. The most important result is that, while each ethnic group may differ in terms of family and clan structure, a similar pattern can be found in all of them, of cooperation structured around small groups of trust-based close relationships. The study suggests that habitual decisions about cooperation are not strategic or self-interested, but instead are based on unconscious processes sustained by the emotional bonds of trust. These kind of emotional bonds are claimed to be relevant from an evolutionary point of view.

An Adaptive Cooperative Strategy for Underlay MIMO Cognitive Radio Networks: An Opportunistic and Low-Complexity Approach

NASA Astrophysics Data System (ADS)

Mazoochi, M.; Pourmina, M. A.; Bakhshi, H.

2015-03-01

The core aim of this work is the maximization of the achievable data rate of the secondary user pairs (SU pairs), while ensuring the QoS of primary users (PUs). All users are assumed to be equipped with multiple antennas. It is assumed that when PUs are present, the direct communications between SU pairs introduces intolerable interference to PUs and thereby SUs transmit signal using the cooperation of other SUs and avoid transmitting in the direct channel. In brief, an adaptive cooperative strategy for multiple-input/multiple-output (MIMO) cognitive radio networks is proposed. At the presence of PUs, the issue of joint relay selection and power allocation in Underlay MIMO Cooperative Cognitive Radio Networks (U-MIMO-CCRN) is addressed. The optimal approach for determining the power allocation and the cooperating SU is proposed. Besides, the outage probability of the proposed communication protocol is further derived. Due to high complexity of the optimal approach, a low-complexity approach is further proposed and its performance is evaluated using simulations. The simulation results reveal that the performance loss due to the low-complexity approach is only about 14%, while the complexity is greatly reduced.

Utility Evaluation Based on One-To-N Mapping in the Prisoner's Dilemma Game for Interdependent Networks.

PubMed

Wang, Juan; Lu, Wenwen; Liu, Lina; Li, Li; Xia, Chengyi

2016-01-01

In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems.

Five rules for the evolution of cooperation.

PubMed

Nowak, Martin A

2006-12-08

Cooperation is needed for evolution to construct new levels of organization. Genomes, cells, multicellular organisms, social insects, and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection. For each mechanism, a simple rule is derived that specifies whether natural selection can lead to cooperation.

Five Rules for the Evolution of Cooperation

NASA Astrophysics Data System (ADS)

Nowak, Martin A.

2006-12-01

Cooperation is needed for evolution to construct new levels of organization. Genomes, cells, multicellular organisms, social insects, and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection. For each mechanism, a simple rule is derived that specifies whether natural selection can lead to cooperation.

Group learning versus local learning: Which is prefer for public cooperation?

NASA Astrophysics Data System (ADS)

Yang, Shi-Han; Song, Qi-Qing

2018-01-01

We study the evolution of cooperation in public goods games on various graphs, focusing on the effects that are brought by different kinds of strategy donors. This highlights a basic feature of a public good game, for which there exists a remarkable difference between the interactive players and the players who are imitated. A player can learn from all the groups where the player is a member or from the typically local nearest neighbors, and the results show that the group learning rules have better performance in promoting cooperation on many networks than the local learning rules. The heterogeneity of networks' degree may be an effective mechanism for harvesting the cooperation expectation in many cases, however, we find that heterogeneity does not definitely mean the high frequency of cooperators in a population under group learning rules. It was shown that cooperators always hardly evolve whenever the interaction and the replacement do not coincide for evolutionary pairwise dilemmas on graphs, while for PG games we find that breaking the symmetry is conducive to the survival of cooperators.

WDM Network and Multicasting Protocol Strategies

PubMed Central

Zaim, Abdul Halim

2014-01-01

Optical technology gains extensive attention and ever increasing improvement because of the huge amount of network traffic caused by the growing number of internet users and their rising demands. However, with wavelength division multiplexing (WDM), it is easier to take the advantage of optical networks and optical burst switching (OBS) and to construct WDM networks with low delay rates and better data transparency these technologies are the best choices. Furthermore, multicasting in WDM is an urgent solution for bandwidth-intensive applications. In the paper, a new multicasting protocol with OBS is proposed. The protocol depends on a leaf initiated structure. The network is composed of source, ingress switches, intermediate switches, edge switches, and client nodes. The performance of the protocol is examined with Just Enough Time (JET) and Just In Time (JIT) reservation protocols. Also, the paper involves most of the recent advances about WDM multicasting in optical networks. WDM multicasting in optical networks is given as three common subtitles: Broadcast and-select networks, wavelength-routed networks, and OBS networks. Also, in the paper, multicast routing protocols are briefly summarized and optical burst switched WDM networks are investigated with the proposed multicast schemes. PMID:24744683

Partner choice cooperation in prisoner's dilemma

NASA Astrophysics Data System (ADS)

Wang, Qi; Xu, Zhaojin; Zhang, Lianzhong

2017-12-01

In this paper, we investigated the cooperative behavior in prisoner's dilemma when the individual behaviors and interaction structures could coevolve. Here, we study the model that the individuals can imitate the strategy of their neighbors and rewire their social ties throughout evolution, based exclusively on a fitness comparison. We find that the cooperation can be achieved if the time scale of network adaptation is large enough, even when the social dilemma strength is very strong. Detailed investigation shows that the presence or absence of the network adaptation has a profound impact on the collective behavior in the system.

Modeling the cooperative and competitive contagions in online social networks

NASA Astrophysics Data System (ADS)

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.

Cooperative Tertiary Interaction Network Guides RNA Folding

DOE Office of Scientific and Technical Information (OSTI.GOV)

Behrouzi, Reza; Roh, Joon Ho; Kilburn, Duncan

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 onmore » 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.« less

The Advent of WDM and the All-Optical Network: A Reality Check.

ERIC Educational Resources Information Center

Lutkowitz, Mark

1998-01-01

Discussion of the telecommunications industry focuses on WDM (wavelength division multiplexing) as a solution for dealing with capacity constraints. Highlights include fiber optic technology; cross-connecting and switching wavelengths; SONET (Synchronous Optical Network) and wavelength networking; and optical TDM (Time Division Multiplexing). (LRW)

Dynamic instability of cooperation due to diverse activity patterns in evolutionary social dilemmas

NASA Astrophysics Data System (ADS)

Xia, Cheng-Yi; Meloni, Sandro; Perc, Matjaž; Moreno, Yamir

2015-03-01

Individuals might abstain from participating in an instance of an evolutionary game for various reasons, ranging from lack of interest to risk aversion. In order to understand the consequences of such diverse activity patterns on the evolution of cooperation, we study a weak prisoner's dilemma where each player's participation is probabilistic rather than certain. Players that do not participate get a null payoff and are unable to replicate. We show that inactivity introduces cascading failures of cooperation, which are particularly severe on scale-free networks with frequently inactive hubs. The drops in the fraction of cooperators are sudden, while the spatiotemporal reorganization of compact cooperative clusters, and thus the recovery, takes time. Nevertheless, if the activity of players is directly proportional to their degree, or if the interaction network is not strongly heterogeneous, the overall evolution of cooperation is not impaired. This is because inactivity negatively affects the potency of low-degree defectors, who are hence unable to utilize on their inherent evolutionary advantage. Between cascading failures, the fraction of cooperators is therefore higher than usual, which lastly balances out the asymmetric dynamic instabilities that emerge due to intermittent blackouts of cooperative hubs.

Highly Reliable PON Optical Splitters for Optical Access Networks in Outside Environments

NASA Astrophysics Data System (ADS)

Watanabe, Hiroshi; Araki, Noriyuki; Fujimoto, Hisashi

Broadband optical access services are spreading throughout the world, and the number of fiber to the home (FTTH) subscribers is increasing rapidly. Telecom operators are constructing passive optical networks (PONs) to provide optical access services. Externally installed optical splitters for PONs are very important passive devices in optical access networks, and they must provide satisfactory performance as outdoor plant over long periods. Therefore, we calculate the failure rate of optical access networks and assign a failure rate to the optical splitters in optical access networks. The maximum cumulative failure rate of 1 × 8 optical splitters was calculated as 0.025 for an optical access fiber length of 2.1km and a 20-year operating lifetime. We examined planar lightwave circuit (PLC) type optical splitters for use as outside plant in terms of their optical characteristics and environmental reliability. We confirmed that PLC type optical splitters have sufficient optical performance for a PON splitter and sufficient reliability as outside plant in accordance with ITU-T standard values. We estimated the lifetimes of three kinds of PLC type optical splitters by using accelerated aging tests. The estimated failure rate of these splitters installed in optical access networks was below the target value for the cumulative failure rate, and we confirmed that they have sufficient reliability to maintain the quality of the network service. We developed 1 × 8 optical splitter modules with plug and socket type optical connectors and optical fiber cords for optical aerial closures designed for use as outside plant. These technologies make it easy to install optical splitters in an aerial optical closure. The optical splitter modules have sufficient optical performance levels for PONs because the insertion loss at the commercially used wavelengths of 1.31 and 1.55µm is less than the criterion established by ITU-T Recommendation G.671 for optical splitters. We performed a temperature cycling test, and a low temperature storage and damp heat test to confirm the long-term reliability of these modules. They exhibited sufficient reliability as regards heat and moisture because the maximum loss change was less than 0.3dB.

Physical-Layer Network Coding for VPN in TDM-PON

NASA Astrophysics Data System (ADS)

Wang, Qike; Tse, Kam-Hon; Chen, Lian-Kuan; Liew, Soung-Chang

2012-12-01

We experimentally demonstrate a novel optical physical-layer network coding (PNC) scheme over time-division multiplexing (TDM) passive optical network (PON). Full-duplex error-free communications between optical network units (ONUs) at 2.5 Gb/s are shown for all-optical virtual private network (VPN) applications. Compared to the conventional half-duplex communications set-up, our scheme can increase the capacity by 100% with power penalty smaller than 3 dB. Synchronization of two ONUs is not required for the proposed VPN scheme

LinkMind: link optimization in swarming mobile sensor networks.

PubMed

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

PubMed Central

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

Unconstrained handwritten numeral recognition based on radial basis competitive and cooperative networks with spatio-temporal feature representation.

PubMed

Lee, S; Pan, J J

1996-01-01

This paper presents a new approach to representation and recognition of handwritten numerals. The approach first transforms a two-dimensional (2-D) spatial representation of a numeral into a three-dimensional (3-D) spatio-temporal representation by identifying the tracing sequence based on a set of heuristic rules acting as transformation operators. A multiresolution critical-point segmentation method is then proposed to extract local feature points, at varying degrees of scale and coarseness. A new neural network architecture, referred to as radial-basis competitive and cooperative network (RCCN), is presented especially for handwritten numeral recognition. RCCN is a globally competitive and locally cooperative network with the capability of self-organizing hidden units to progressively achieve desired network performance, and functions as a universal approximator of arbitrary input-output mappings. Three types of RCCNs are explored: input-space RCCN (IRCCN), output-space RCCN (ORCCN), and bidirectional RCCN (BRCCN). Experiments against handwritten zip code numerals acquired by the U.S. Postal Service indicated that the proposed method is robust in terms of variations, deformations, transformations, and corruption, achieving about 97% recognition rate.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-01-01

Call for Papers: Optical Access Networks

Guest Editors Jun Zheng, University of Ottawa Nirwan Ansari, New Jersey Institute of Technology

Submission Deadline: 1 June 2005

Background

Scope of Contributions

• Optical access network architectures and protocols
• Passive optical networks (BPON, EPON, GPON, etc.)
• Active optical networks
• Multiple access control
• Multiservices and QoS provisioning
• Network survivability
• Field trials and standards
• Performance modeling and analysis

Manuscript Submission

Constructing a Cooperative Distance Learning System: The CORAL Experience.

ERIC Educational Resources Information Center

Chou, Chien; Sun, Chuen-Tsai

1996-01-01

Describes the development of the Cooperative Remotely Accessible Learning (CORAL) system on the Internet at National Chiao Tung University (Taiwan) that promotes cooperative constructive distance learning and provides the first comprehensive and networked courseware written in Chinese. Results of formative evaluation are described and future…

Spatial-spectral flexible optical networking: enabling switching solutions for a simplified and efficient SDM network platform

NASA Astrophysics Data System (ADS)

Tomkos, I.; Zakynthinos, P.; Klonidis, D.; Marom, D.; Sygletos, S.; Ellis, A.; Salvadori, E.; Siracusa, D.; Angelou, M.; Papastergiou, G.; Psaila, N.; Ferran, J. F.; Ben-Ezra, S.; Jimenez, F.; Fernández-Palacios, J. P.

2013-12-01

The traffic carried by core optical networks grows at a steady but remarkable pace of 30-40% year-over-year. Optical transmissions and networking advancements continue to satisfy the traffic requirements by delivering the content over the network infrastructure in a cost and energy efficient manner. Such core optical networks serve the information traffic demands in a dynamic way, in response to requirements for shifting of traffics demands, both temporally (day/night) and spatially (business district/residential). However as we are approaching fundamental spectral efficiency limits of singlemode fibers, the scientific community is pursuing recently the development of an innovative, all-optical network architecture introducing the spatial degree of freedom when designing/operating future transport networks. Spacedivision- multiplexing through the use of bundled single mode fibers, and/or multi-core fibers and/or few-mode fibers can offer up to 100-fold capacity increase in future optical networks. The EU INSPACE project is working on the development of a complete spatial-spectral flexible optical networking solution, offering the network ultra-high capacity, flexibility and energy efficiency required to meet the challenges of delivering exponentially growing traffic demands in the internet over the next twenty years. In this paper we will present the motivation and main research activities of the INSPACE consortium towards the realization of the overall project solution.

Scalable Active Optical Access Network Using Variable High-Speed PLZT Optical Switch/Splitter

NASA Astrophysics Data System (ADS)

Ashizawa, Kunitaka; Sato, Takehiro; Tokuhashi, Kazumasa; Ishii, Daisuke; Okamoto, Satoru; Yamanaka, Naoaki; Oki, Eiji

This paper proposes a scalable active optical access network using high-speed Plumbum Lanthanum Zirconate Titanate (PLZT) optical switch/splitter. The Active Optical Network, called ActiON, using PLZT switching technology has been presented to increase the number of subscribers and the maximum transmission distance, compared to the Passive Optical Network (PON). ActiON supports the multicast slot allocation realized by running the PLZT switch elements in the splitter mode, which forces the switch to behave as an optical splitter. However, the previous ActiON creates a tradeoff between the network scalability and the power loss experienced by the optical signal to each user. It does not use the optical power efficiently because the optical power is simply divided into 0.5 to 0.5 without considering transmission distance from OLT to each ONU. The proposed network adopts PLZT switch elements in the variable splitter mode, which controls the split ratio of the optical power considering the transmission distance from OLT to each ONU, in addition to PLZT switch elements in existing two modes, the switching mode and the splitter mode. The proposed network introduces the flexible multicast slot allocation according to the transmission distance from OLT to each user and the number of required users using three modes, while keeping the advantages of ActiON, which are to support scalable and secure access services. Numerical results show that the proposed network dramatically reduces the required number of slots and supports high bandwidth efficiency services and extends the coverage of access network, compared to the previous ActiON, and the required computation time for selecting multicast users is less than 30msec, which is acceptable for on-demand broadcast services.

Enhancement by Enlargement: The Proliferation Security Initiative

DTIC Science & Technology

2008-01-01

Minister Mahathir Mohammad. In any event, Malaysia’s expressions of common interest with the United States in cooperative efforts to combat terrorism...instances 10 The sharp change in the current Malaysian government’s stance toward cooperation with the United States from that of the preceding, Mahathir ...preceding prime minister, Mahathir , Malaysia was implicated in the proliferation network of Pakistan’s A. Q. Khan. As part of that network

Cooperative Institute for Research in the Atmosphere (CIRA) Requirements Review

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zurawski, Jason, W; Mace, Kathryn, P

2016-08-11

In August 2016 The Energy Sciences Network (ESnet) and Colorado State University (CSU) organized a review to characterize the networking requirements of the Cooperative Institute for Research in the Atmosphere (CIRA) located on the campus of Colorado State University. Several key findings highlighting the results from the review were discovered, with benefits to improve the overall scientific process for CIRA and CSU.

Cooperative genomic alteration network reveals molecular classification across 12 major cancer types

PubMed Central

Zhang, Hongyi; Deng, Yulan; Zhang, Yong; Ping, Yanyan; Zhao, Hongying; Pang, Lin; Zhang, Xinxin; Wang, Li; Xu, Chaohan; Xiao, Yun; Li, Xia

2017-01-01

The accumulation of somatic genomic alterations that enables cells to gradually acquire growth advantage contributes to tumor development. This has the important implication of the widespread existence of cooperative genomic alterations in the accumulation process. Here, we proposed a computational method HCOC that simultaneously consider genetic context and downstream functional effects on cancer hallmarks to uncover somatic cooperative events in human cancers. Applying our method to 12 TCGA cancer types, we totally identified 1199 cooperative events with high heterogeneity across human cancers, and then constructed a pan-cancer cooperative alteration network. These cooperative events are associated with genomic alterations of some high-confident cancer drivers, and can trigger the dysfunction of hallmark associated pathways in a co-defect way rather than single alterations. We found that these cooperative events can be used to produce a prognostic classification that can provide complementary information with tissue-of-origin. In a further case study of glioblastoma, using 23 cooperative events identified, we stratified patients into molecularly relevant subtypes with a prognostic significance independent of the Glioma-CpG Island Methylator Phenotype (GCIMP). In summary, our method can be effectively used to discover cancer-driving cooperative events that can be valuable clinical markers for patient stratification. PMID:27899621

Spillover modes in multiplex games: double-edged effects on cooperation and their coevolution.

PubMed

Khoo, Tommy; Fu, Feng; Pauls, Scott

2018-05-02

In recent years, there has been growing interest in studying games on multiplex networks that account for interactions across linked social contexts. However, little is known about how potential cross-context interference, or spillover, of individual behavioural strategy impact overall cooperation. We consider three plausible spillover modes, quantifying and comparing their effects on the evolution of cooperation. In our model, social interactions take place on two network layers: repeated interactions with close neighbours in a lattice, and one-shot interactions with random individuals. Spillover can occur during the learning process with accidental cross-layer strategy transfer, or during social interactions with errors in implementation. Our analytical results, using extended pair approximation, are in good agreement with extensive simulations. We find double-edged effects of spillover: increasing the intensity of spillover can promote cooperation provided cooperation is favoured in one layer, but too much spillover is detrimental. We also discover a bistability phenomenon: spillover hinders or promotes cooperation depending on initial frequencies of cooperation in each layer. Furthermore, comparing strategy combinations emerging in each spillover mode provides good indication of their co-evolutionary dynamics with cooperation. Our results make testable predictions that inspire future research, and sheds light on human cooperation across social domains.

Distinguishing the opponents promotes cooperation in well-mixed populations

NASA Astrophysics Data System (ADS)

Wardil, Lucas; da Silva, Jafferson K. L.

2010-03-01

Cooperation has been widely studied when an individual strategy is adopted against all coplayers. In this context, some extra mechanisms, such as punishment, reward, memory, and network reciprocity must be introduced in order to keep cooperators alive. Here, we adopt a different point of view. We study the adoption of different strategies against different opponents instead of adoption of the same strategy against all of them. In the context of the prisoner dilemma, we consider an evolutionary process in which strategies that provide more benefits are imitated and the players replace the strategy used in one of the interactions furnishing the worst payoff. Individuals are set in a well-mixed population, so that network reciprocity effect is excluded and both synchronous and asynchronous updates are analyzed. As a consequence of the replacement rule, we show that mutual cooperation is never destroyed and the initial fraction of mutual cooperation is a lower bound for the level of cooperation. We show by simulation and mean-field analysis that (i) cooperation dominates for synchronous update and (ii) only the initial mutual cooperation is maintained for asynchronous update. As a side effect of the replacement rule, an “implicit punishment” mechanism comes up in a way that exploitations are always neutralized providing evolutionary stability for cooperation.

An IUR evolutionary game model on the patent cooperate of Shandong China

NASA Astrophysics Data System (ADS)

Liu, Mengmeng; Ma, Yinghong; Liu, Zhiyuan; You, Xuemei

2017-06-01

Organizations of industries and university & research institutes cooperate to meet their respective needs based on social contacts, trust and share complementary resources. From the perspective of complex network together with the patent data of Shandong province in China, a novel evolutionary game model on patent cooperation network is presented. Two sides in the game model are industries and universities & research institutes respectively. The cooperation is represented by a connection when a new patent is developed together by the two sides. The optimal strategy of the evolutionary game model is quantified by the average positive cooperation probability p ¯ and the average payoff U ¯ . The feasibility of this game model is simulated on the parameters such as the knowledge spillover, the punishment, the development cost and the distribution coefficient of the benefit. The numerical simulations show that the cooperative behaviors are affected by the variation of parameters. The knowledge spillover displays different behaviors when the punishment is larger than the development cost or less than it. Those results indicate that reasonable punishment would improve the positive cooperation. The appropriate punishment will be useful to enhance the big degree nodes positively cooperate with industries and universities & research institutes. And an equitable plan for the distribution of cooperative profits is half-and-half distribution strategy for the two sides in game.

Three-tier multi-granularity switching system based on PCE

NASA Astrophysics Data System (ADS)

Wang, Yubao; Sun, Hao; Liu, Yanfei

2017-10-01

With the growing demand for business communications, electrical signal processing optical path switching can't meet the demand. The multi-granularity switch system that can improve node routing and switching capabilities came into being. In the traditional network, each node is responsible for calculating the path; synchronize the whole network state, which will increase the burden on the network, so the concept of path calculation element (PCE) is proposed. The PCE is responsible for routing and allocating resources in the network1. In the traditional band-switched optical network, the wavelength is used as the basic routing unit, resulting in relatively low wavelength utilization. Due to the limitation of wavelength continuity, the routing design of the band technology becomes complicated, which directly affects the utilization of the system. In this paper, optical code granularity is adopted. There is no continuity of the optical code, and the number of optical codes is more flexible than the wavelength. For the introduction of optical code switching, we propose a Code Group Routing Entity (CGRE) algorithm. In short, the combination of three-tier multi-granularity optical switching system and PCE can simplify the network structure, reduce the node load, and enhance the network scalability and survivability. Realize the intelligentization of optical network.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 3: Advanced networks and economics

NASA Technical Reports Server (NTRS)

1986-01-01

This study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

Virtual optical network mapping and core allocation in elastic optical networks using multi-core fibers

NASA Astrophysics Data System (ADS)

Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli

2017-11-01

Virtualization technology can greatly improve the efficiency of the networks by allowing the virtual optical networks to share the resources of the physical networks. However, it will face some challenges, such as finding the efficient strategies for virtual nodes mapping, virtual links mapping and spectrum assignment. It is even more complex and challenging when the physical elastic optical networks using multi-core fibers. To tackle these challenges, we establish a constrained optimization model to determine the optimal schemes of optical network mapping, core allocation and spectrum assignment. To solve the model efficiently, tailor-made encoding scheme, crossover and mutation operators are designed. Based on these, an efficient genetic algorithm is proposed to obtain the optimal schemes of the virtual nodes mapping, virtual links mapping, core allocation. The simulation experiments are conducted on three widely used networks, and the experimental results show the effectiveness of the proposed model and algorithm.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 3: Advanced networks and economics

NASA Astrophysics Data System (ADS)

1986-10-01

This study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

Deployment of a Testbed in a Brazilian Research Network using IPv6 and Optical Access Technologies

NASA Astrophysics Data System (ADS)

Martins, Luciano; Ferramola Pozzuto, João; Olimpio Tognolli, João; Chaves, Niudomar Siqueira De A.; Reggiani, Atilio Eduardo; Hortêncio, Claudio Antonio

2012-04-01

This article presents the implementation of a testbed and the experimental results obtained with it on the Brazilian Experimental Network of the government-sponsored "GIGA Project." The use of IPv6 integrated to current and emerging optical architectures and technologies, such as dense wavelength division multiplexing and 10-gigabit Ethernet on the core and gigabit capable passive optical network and optical distribution network on access, were tested. These protocols, architectures, and optical technologies are promising and part of a brand new worldwide technological scenario that has being fairly adopted in the networks of enterprises and providers of the world.

Analysis of physical layer performance of hybrid optical-wireless access network

NASA Astrophysics Data System (ADS)

Shaddad, R. Q.; Mohammad, A. B.; Al-hetar, A. M.

2011-09-01

The hybrid optical-wireless access network (HOWAN) is a favorable architecture for next generation access network. It is an optimal combination of an optical backhaul and a wireless front-end for an efficient access network. In this paper, the HOWAN architecture is designed based on a wavelengths division multiplexing/time division multiplexing passive optical network (WDM/TDM PON) at the optical backhaul and a wireless fidelity (WiFi) technology at the wireless front-end. The HOWAN is proposed that can provide blanket coverage of broadband and flexible connection for end-users. Most of the existing works, based on performance evaluation are concerned on network layer aspects. This paper reports physical layer performance in terms of the bit error rate (BER), eye diagram, and signal-to-noise ratio (SNR) of the communication system. It accommodates 8 wavelength channels with 32 optical network unit/wireless access points (ONU/APs). It is demonstrated that downstream and upstream of 2 Gb/s can be achieved by optical backhaul for each wavelength channel along optical fiber length of 20 km and a data rate of 54 Mb/s per ONU/AP along a 50 m outdoor wireless link.

A Simulation of Cooperation and Competition in Insurgent Networks

NASA Astrophysics Data System (ADS)

Gabbay, Michael

2014-03-01

Insurgencies are often characterized by multiple groups who share a common foe in the national government but have independent organizations which may differ with respect to social identities, ideologies, strategies, and their use of violence. These groups may cooperate in various ways such as conducting joint attacks, pooling resources, and establishing formal alliances or mergers. However, they may also compete with each other over popular support, recruitment of fighters, funding, allies, and ultimately military dominance. A network coevolution model of insurgent factional dynamics is presented which accounts for factors driving cooperation and competition. The model is formulated as a system of coupled ODEs which evolves network ties between insurgent groups along with group policies concerning the targets of violence. Simulation results are presented showing sharp transitions in network structure as model parameters are varied. Connections are drawn between the model results and empirical data from the Iraqi insurgency. This work was supported by the Office of Naval Research under grant N00014-13-1-0381.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 1: Executive summary

NASA Technical Reports Server (NTRS)

1986-01-01

Over the past two decades, fiber optics has emerged as a highly practical and cost-efficient communications technology. Its competitiveness vis-a-vis other transmission media, especially satellite, has become a critical question. This report studies the likely evolution and application of fiber optic networks in the United States to the end of the century. The outlook for the technology of fiber systems is assessed and forecast, scenarios of the evolution of fiber optic network development are constructed, and costs to provide service are determined and examined parametrically as a function of network size and traffic carried. Volume 1 consists of the Executive Summary. Volume 2 focuses on fiber optic technology and long distance fiber optic networks. Volume 3 develops a traffic and financial model of a nationwide long distance transmission network. Among the study's most important conclusions are: revenue requirements per circuit for LATA-to-LATA fiber optic links are less than one cent per call minute; multiplex equipment, which is likely to be required in any competing system, is the largest contributor to circuit costs; the potential capacity of fiber optic cable is very large and as yet undefined; and fiber optic transmission combined with other network optimization schemes can lead to even lower costs than those identified in this study.

Networking and Institutional Planning.

ERIC Educational Resources Information Center

Riggs, Donald E.

1987-01-01

Explores the impact of networks and shared library resources on the library planning process. Environmental scanning techniques, the need for cooperative planning, and the formulation of strategies to achieve networking goals are discussed. (CLB)

On Applications of Disruption Tolerant Networking to Optical Networking in Space

NASA Technical Reports Server (NTRS)

Hylton, Alan Guy; Raible, Daniel E.; Juergens, Jeffrey; Iannicca, Dennis

2012-01-01

The integration of optical communication links into space networks via Disruption Tolerant Networking (DTN) is a largely unexplored area of research. Building on successful foundational work accomplished at JPL, we discuss a multi-hop multi-path network featuring optical links. The experimental test bed is constructed at the NASA Glenn Research Center featuring multiple Ethernet-to-fiber converters coupled with free space optical (FSO) communication channels. The test bed architecture models communication paths from deployed Mars assets to the deep space network (DSN) and finally to the mission operations center (MOC). Reliable versus unreliable communication methods are investigated and discussed; including reliable transport protocols, custody transfer, and fragmentation. Potential commercial applications may include an optical communications infrastructure deployment to support developing nations and remote areas, which are unburdened with supporting an existing heritage means of telecommunications. Narrow laser beam widths and control of polarization states offer inherent physical layer security benefits with optical communications over RF solutions. This paper explores whether or not DTN is appropriate for space-based optical networks, optimal payload sizes, reliability, and a discussion on security.

Facilitators on networks reveal optimal interplay between information exchange and reciprocity.

PubMed

Szolnoki, Attila; Perc, Matjaž; Mobilia, Mauro

2014-04-01

Reciprocity is firmly established as an important mechanism that promotes cooperation. An efficient information exchange is likewise important, especially on structured populations, where interactions between players are limited. Motivated by these two facts, we explore the role of facilitators in social dilemmas on networks. Facilitators are here mirrors to their neighbors-they cooperate with cooperators and defect with defectors-but they do not participate in the exchange of strategies. As such, in addition to introducing direct reciprocity, they also obstruct information exchange. In well-mixed populations, facilitators favor the replacement and invasion of defection by cooperation as long as their number exceeds a critical value. In structured populations, on the other hand, there exists a delicate balance between the benefits of reciprocity and the deterioration of information exchange. Extensive Monte Carlo simulations of social dilemmas on various interaction networks reveal that there exists an optimal interplay between reciprocity and information exchange, which sets in only when a small number of facilitators occupy the main hubs of the scale-free network. The drawbacks of missing cooperative hubs are more than compensated for by reciprocity and, at the same time, the compromised information exchange is routed via the auxiliary hubs with only marginal losses in effectivity. These results indicate that it is not always optimal for the main hubs to become leaders of the masses, but rather to exploit their highly connected state to promote tit-for-tat-like behavior.

Facilitators on networks reveal optimal interplay between information exchange and reciprocity

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž; Mobilia, Mauro

2014-04-01

Reciprocity is firmly established as an important mechanism that promotes cooperation. An efficient information exchange is likewise important, especially on structured populations, where interactions between players are limited. Motivated by these two facts, we explore the role of facilitators in social dilemmas on networks. Facilitators are here mirrors to their neighbors—they cooperate with cooperators and defect with defectors—but they do not participate in the exchange of strategies. As such, in addition to introducing direct reciprocity, they also obstruct information exchange. In well-mixed populations, facilitators favor the replacement and invasion of defection by cooperation as long as their number exceeds a critical value. In structured populations, on the other hand, there exists a delicate balance between the benefits of reciprocity and the deterioration of information exchange. Extensive Monte Carlo simulations of social dilemmas on various interaction networks reveal that there exists an optimal interplay between reciprocity and information exchange, which sets in only when a small number of facilitators occupy the main hubs of the scale-free network. The drawbacks of missing cooperative hubs are more than compensated for by reciprocity and, at the same time, the compromised information exchange is routed via the auxiliary hubs with only marginal losses in effectivity. These results indicate that it is not always optimal for the main hubs to become leaders of the masses, but rather to exploit their highly connected state to promote tit-for-tat-like behavior.

Failed cooperative, but not competitive, interaction between large-scale brain networks impairs working memory in schizophrenia.

PubMed

Pu, W; Luo, Q; Palaniyappan, L; Xue, Z; Yao, S; Feng, J; Liu, Z

2016-04-01

A large-scale network named the default mode network (DMN) dynamically cooperates and competes with an external attention system (EAS) to facilitate various cognitive functioning that is prominently impaired in schizophrenia. However, it is unclear whether the cognitive deficit in schizophrenia is related to the disrupted competition and/or cooperation between these two networks. A total of 35 schizophrenia patients and 30 healthy controls were scanned using gradient-echo echo-planar imaging during n-back working memory (WM) processing. Brain activities of the DMN and EAS were measured using general linear modelling of the functional magnetic resonance imaging data. Dynamic interaction between the DMN and EAS was decomposed into two directions using Granger causality analysis. We observed a significant failure of DMN suppression in patients with schizophrenia, which was significantly related to WM/attentional deficit. Granger causality modelling showed that in healthy controls, while the EAS inhibitorily influenced the DMN, the DMN exerted an 'excitatory' or cooperative influence back on the EAS, especially in those with lower WM accuracy. In schizophrenia, this 'excitatory' DMN→EAS influence within the reciprocal EAS-DMN loop was significantly reduced, especially in patients with WM/attentional deficit. The dynamic interaction between the DMN and EAS is likely to be comprised of both competitive and cooperative influences. In healthy controls, both the 'inhibitory' EAS→DMN interaction and 'excitatory' DMN→EAS interaction are correlated with WM performance. In schizophrenia, reduced 'cooperative' influence from the DMN to dorsal nodes of the EAS occurs in the context of non-suppression of the DMN and may form a possible pathophysiological substrate of WM deficit and attention disorder.

Cooperation of return-to-work professionals: the challenges of multi-actor work disability management.

PubMed

Liukko, Jyri; Kuuva, Niina

2017-07-01

This article explores which concrete factors hinder or facilitate the cooperation of return-to-work (RTW) professionals in a complex system of multiple stakeholders. The empirical material consists of in-depth interviews with 24 RTW professionals from various organizations involved in work disability management in Finland. The interviews were analyzed using thematic content analysis. The study revealed several kinds of challenges in the cooperation of the professionals. These were related to two partly interrelated themes: communication and distribution of responsibility. The most difficult problems were connected to the cooperation between public employment offices and other stakeholders. However, the study distinguished notable regional differences depending primarily on the scale of the local network. The main areas of improvement proposed by the interviewees were related to better networking of case managers and expansion of expertise. The article argues for the importance of systematic networking and stresses the role of public employment services in the multi-actor management of work disabilities. The article contributes to existing work disability case management models by suggesting the employment administration system as an important component in addition to health care, workplace and insurance systems. The study also highlights the need for expansion of expertise in the field. Implications for Rehabilitation Cooperation between RTW professionals in public employment offices and other organizations involved in work disability management was considered inadequate. In order to improve the cooperation of RTW professionals, the stakeholders need to create more systematic ways of communication and networking with professionals in other organizations. There is a need to expand the expertise in work disability management and rehabilitation, partly by increasing the role of other professionals than physicians.

Impact of heterogeneous activity and community structure on the evolutionary success of cooperators in social networks

NASA Astrophysics Data System (ADS)

Wu, Zhi-Xi; Rong, Zhihai; Yang, Han-Xin

2015-01-01

Recent empirical studies suggest that heavy-tailed distributions of human activities are universal in real social dynamics [L. Muchnik, S. Pei, L. C. Parra, S. D. S. Reis, J. S. Andrade Jr., S. Havlin, and H. A. Makse, Sci. Rep. 3, 1783 (2013), 10.1038/srep01783]. On the other hand, community structure is ubiquitous in biological and social networks [M. E. J. Newman, Nat. Phys. 8, 25 (2012), 10.1038/nphys2162]. Motivated by these facts, we here consider the evolutionary prisoner's dilemma game taking place on top of a real social network to investigate how the community structure and the heterogeneity in activity of individuals affect the evolution of cooperation. In particular, we account for a variation of the birth-death process (which can also be regarded as a proportional imitation rule from a social point of view) for the strategy updating under both weak and strong selection (meaning the payoffs harvested from games contribute either slightly or heavily to the individuals' performance). By implementing comparative studies, where the players are selected either randomly or in terms of their actual activities to play games with their immediate neighbors, we figure out that heterogeneous activity benefits the emergence of collective cooperation in a harsh environment (the action for cooperation is costly) under strong selection, whereas it impairs the formation of altruism under weak selection. Moreover, we find that the abundance of communities in the social network can evidently foster the formation of cooperation under strong selection, in contrast to the games evolving on randomized counterparts. Our results are therefore helpful for us to better understand the evolution of cooperation in real social systems.

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks

PubMed Central

Artuñedo, Antonio; del Toro, Raúl M.; Haber, Rodolfo E.

2017-01-01

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller (TLC) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks. PMID:28445398

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks.

PubMed

Artuñedo, Antonio; Del Toro, Raúl M; Haber, Rodolfo E

2017-04-26

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller ( TLC ) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

Optical dipole forces: Working together

NASA Astrophysics Data System (ADS)

Aiello, Clarice D.

2017-03-01

Strength lies in numbers and in teamwork: tens of thousands of artificial atoms tightly packed in a nanodiamond act cooperatively, enhancing the optical trapping forces beyond the expected classical bulk polarizability contribution.

Deployment of the National Transparent Optical Network around the San Francisco Bay Area

DOE Office of Scientific and Technical Information (OSTI.GOV)

McCammon, K.; Haigh, R.; Armstrong, G.

1996-06-01

We report on the deployment and initial operation of the National Transparent Optical Network, an experimental WDM network testbed around the San Francisco Bay Area, during the Optical Fiber Conference (OFC`96) held in San Jose, CA. The deployment aspects of the physical plant, optical and SONET layers are examined along with a discussion of broadband applications which utilized the network during the OFC`96 demonstration. The network features dense WDM technology, transparent optical routing technology using acousto- optic tunable filter based switches, and network modules with add/drop, multicast, and wavelength translation capabilities. The physical layer consisted of over 300 km ofmore » Sprint and Pacific Bell conventional single mode fiber which was amplified with I I optical amplifiers deployed in pre-amp, post-amp, and line amp configurations. An out-of-band control network provided datacom channels from remote equipment sites to the SONET network manager deployed at the San Jose Convention Center for the conference. Data transport over five wavelengths was achieved in the 1550 nm window using a variety of signal formats including analog and digital signal transmission on different wavelengths on the same fiber. The network operated throughout the week of OFC`96 and is still in operation today.« less

Optical burst switching based satellite backbone network

NASA Astrophysics Data System (ADS)

Li, Tingting; Guo, Hongxiang; Wang, Cen; Wu, Jian

2018-02-01

We propose a novel time slot based optical burst switching (OBS) architecture for GEO/LEO based satellite backbone network. This architecture can provide high speed data transmission rate and high switching capacity . Furthermore, we design the control plane of this optical satellite backbone network. The software defined network (SDN) and network slice (NS) technologies are introduced. Under the properly designed control mechanism, this backbone network is flexible to support various services with diverse transmission requirements. Additionally, the LEO access and handoff management in this network is also discussed.

Cooperative learning neural network output feedback control of uncertain nonlinear multi-agent systems under directed topologies

NASA Astrophysics Data System (ADS)

Wang, W.; Wang, D.; Peng, Z. H.

2017-09-01

Without assuming that the communication topologies among the neural network (NN) weights are to be undirected and the states of each agent are measurable, the cooperative learning NN output feedback control is addressed for uncertain nonlinear multi-agent systems with identical structures in strict-feedback form. By establishing directed communication topologies among NN weights to share their learned knowledge, NNs with cooperative learning laws are employed to identify the uncertainties. By designing NN-based κ-filter observers to estimate the unmeasurable states, a new cooperative learning output feedback control scheme is proposed to guarantee that the system outputs can track nonidentical reference signals with bounded tracking errors. A simulation example is given to demonstrate the effectiveness of the theoretical results.

Cooperative epidemics on multiplex networks.

PubMed

Azimi-Tafreshi, N

2016-04-01

The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loopless. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called coinfected 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 coinfected clusters in the case of cooperating diseases with the so-called "viable" clusters in networks with dependencies.

Cooperative epidemics on multiplex networks

NASA Astrophysics Data System (ADS)

Azimi-Tafreshi, N.

2016-04-01

The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loopless. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called coinfected 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 coinfected clusters in the case of cooperating diseases with the so-called "viable" clusters in networks with dependencies.

Cooperative Spatial Retreat for Resilient Drone Networks †

PubMed Central

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

MPNACK: an optical switching scheme enabling the buffer-less reliable transmission

NASA Astrophysics Data System (ADS)

Yu, Xiaoshan; Gu, Huaxi; Wang, Kun; Xu, Meng; Guo, Yantao

2016-01-01

Optical data center networks are becoming an increasingly promising solution to solve the bottlenecks faced by electrical networks, such as low transmission bandwidth, high wiring complexity, and unaffordable power consumption. However, the optical circuit switching (OCS) network is not flexible enough to carry the traffic burst while the optical packet switching (OPS) network cannot solve the packet contention in an efficient way. To this end, an improved switching strategy named OPS with multi-hop Negative Acknowledgement (MPNACK) is proposed. This scheme uses a feedback mechanism, rather than the buffering structure, to handle the optical packet contention. The collided packet is treated as a NACK packet and sent back to the source server. When the sender receives this NACK packet, it knows a collision happens in the transmission path and a retransmission procedure is triggered. Overall, the OPS-NACK scheme enables a reliable transmission in the buffer-less optical network. Furthermore, with this scheme, the expensive and energy-hungry elements, optical or electrical buffers, can be removed from the optical interconnects, thus a more scalable and cost-efficient network can be constructed for cloud computing data centers.

All-optical OXC transition strategy from WDM optical network to elastic optical network.

PubMed

Chen, Xin; Li, Juhao; Guo, Bingli; Zhu, Paikun; Tang, Ruizhi; Chen, Zhangyuan; He, Yongqi

2016-02-22

Elastic optical network (EON) has been proposed recently as a spectrum-efficient optical layer to adapt to rapidly-increasing traffic demands instead of current deployed wavelength-division-multiplexing (WDM) optical network. In contrast with conventional WDM optical cross-connect (OXCs) based on wavelength selective switches (WSSs), the EON OXCs are based on spectrum selective switches (SSSs) which are much more expensive than WSSs, especially for large-scale switching architectures. So the transition cost from WDM OXCs to EON OXCs is a major obstacle to realizing EON. In this paper, we propose and experimentally demonstrate a transition OXC (TOXC) structure based on 2-stage cascading switching architectures, which make full use of available WSSs in current deployed WDM OXCs to reduce number and port count of required SSSs. Moreover, we propose a contention-aware spectrum allocation (CASA) scheme for EON built with the proposed TOXCs. We show by simulation that the TOXCs reduce the network capital expenditure transiting from WDM optical network to EON about 50%, with a minor traffic blocking performance degradation and about 10% accommodated traffic number detriment compared with all-SSS EON OXC architectures.

Neural networks within multi-core optic fibers

PubMed Central

Cohen, Eyal; Malka, Dror; Shemer, Amir; Shahmoon, Asaf; Zalevsky, Zeev; London, Michael

2016-01-01

Hardware implementation of artificial neural networks facilitates real-time parallel processing of massive data sets. Optical neural networks offer low-volume 3D connectivity together with large bandwidth and minimal heat production in contrast to electronic implementation. Here, we present a conceptual design for in-fiber optical neural networks. Neurons and synapses are realized as individual silica cores in a multi-core fiber. Optical signals are transferred transversely between cores by means of optical coupling. Pump driven amplification in erbium-doped cores mimics synaptic interactions. We simulated three-layered feed-forward neural networks and explored their capabilities. Simulations suggest that networks can differentiate between given inputs depending on specific configurations of amplification; this implies classification and learning capabilities. Finally, we tested experimentally our basic neuronal elements using fibers, couplers, and amplifiers, and demonstrated that this configuration implements a neuron-like function. Therefore, devices similar to our proposed multi-core fiber could potentially serve as building blocks for future large-scale small-volume optical artificial neural networks. PMID:27383911

Neural networks within multi-core optic fibers.

PubMed

Cohen, Eyal; Malka, Dror; Shemer, Amir; Shahmoon, Asaf; Zalevsky, Zeev; London, Michael

2016-07-07

Hardware implementation of artificial neural networks facilitates real-time parallel processing of massive data sets. Optical neural networks offer low-volume 3D connectivity together with large bandwidth and minimal heat production in contrast to electronic implementation. Here, we present a conceptual design for in-fiber optical neural networks. Neurons and synapses are realized as individual silica cores in a multi-core fiber. Optical signals are transferred transversely between cores by means of optical coupling. Pump driven amplification in erbium-doped cores mimics synaptic interactions. We simulated three-layered feed-forward neural networks and explored their capabilities. Simulations suggest that networks can differentiate between given inputs depending on specific configurations of amplification; this implies classification and learning capabilities. Finally, we tested experimentally our basic neuronal elements using fibers, couplers, and amplifiers, and demonstrated that this configuration implements a neuron-like function. Therefore, devices similar to our proposed multi-core fiber could potentially serve as building blocks for future large-scale small-volume optical artificial neural networks.

Angle of Arrival Detection Through Artificial Neural Network Analysis of Optical Fiber Intensity Patterns

DTIC Science & Technology

1990-12-01

ARTIFICIAL NEURAL NETWORK ANALYSIS OF OPTICAL FIBER INTENSITY PATTERNS THESIS Scott Thomas Captain, USAF AFIT/GE/ENG/90D-62 DTIC...ELECTE ao • JAN08 1991 Approved for public release; distribution unlimited. AFIT/GE/ENG/90D-62 ANGLE OF ARRIVAL DETECTION THROUGH ARTIFICIAL NEURAL NETWORK ANALYSIS... ARTIFICIAL NEURAL NETWORK ANALYSIS OF OPTICAL FIBER INTENSITY PATTERNS L Introduction The optical sensors of United States Air Force reconnaissance

Five rules for the evolution of cooperation

PubMed Central

Nowak, Martin A.

2011-01-01

Cooperation is needed for evolution to construct new levels of organization. The emergence of genomes, cells, multi-cellular organisms, social insects and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity and group selection. For each mechanism, a simple rule is derived which specifies whether natural selection can lead to cooperation. PMID:17158317

High-Speed Optical Wide-Area Data-Communication Network

NASA Technical Reports Server (NTRS)

Monacos, Steve P.

1994-01-01

Proposed fiber-optic wide-area network (WAN) for digital communication balances input and output flows of data with its internal capacity by routing traffic via dynamically interconnected routing planes. Data transmitted optically through network by wavelength-division multiplexing in synchronous or asynchronous packets. WAN implemented with currently available technology. Network is multiple-ring cyclic shuffle exchange network ensuring traffic reaches its destination with minimum number of hops.

Six-port optical switch for cluster-mesh photonic network-on-chip

NASA Astrophysics Data System (ADS)

Jia, Hao; Zhou, Ting; Zhao, Yunchou; Xia, Yuhao; Dai, Jincheng; Zhang, Lei; Ding, Jianfeng; Fu, Xin; Yang, Lin

2018-05-01

Photonic network-on-chip for high-performance multi-core processors has attracted substantial interest in recent years as it offers a systematic method to meet the demand of large bandwidth, low latency and low power dissipation. In this paper we demonstrate a non-blocking six-port optical switch for cluster-mesh photonic network-on-chip. The architecture is constructed by substituting three optical switching units of typical Spanke-Benes network to optical waveguide crossings. Compared with Spanke-Benes network, the number of optical switching units is reduced by 20%, while the connectivity of routing path is maintained. By this way the footprint and power consumption can be reduced at the expense of sacrificing the network latency performance in some cases. The device is realized by 12 thermally tuned silicon Mach-Zehnder optical switching units. Its theoretical spectral responses are evaluated by establishing a numerical model. The experimental spectral responses are also characterized, which indicates that the optical signal-to-noise ratios of the optical switch are larger than 13.5 dB in the wavelength range from 1525 nm to 1565 nm. Data transmission experiment with the data rate of 32 Gbps is implemented for each optical link.

All-optical virtual private network and ONUs communication in optical OFDM-based PON system.

PubMed

Zhang, Chongfu; Huang, Jian; Chen, Chen; Qiu, Kun

2011-11-21

We propose and demonstrate a novel scheme, which enables all-optical virtual private network (VPN) and all-optical optical network units (ONUs) inter-communications in optical orthogonal frequency-division multiplexing-based passive optical network (OFDM-PON) system using the subcarrier bands allocation for the first time (to our knowledge). We consider the intra-VPN and inter-VPN communications which correspond to two different cases: VPN communication among ONUs in one group and in different groups. The proposed scheme can provide the enhanced security and a more flexible configuration for VPN users compared to the VPN in WDM-PON or TDM-PON systems. The all-optical VPN and inter-ONU communications at 10-Gbit/s with 16 quadrature amplitude modulation (16 QAM) for the proposed optical OFDM-PON system are demonstrated. These results verify that the proposed scheme is feasible. © 2011 Optical Society of America

A multi-ring optical packet and circuit integrated network with optical buffering.

PubMed

Furukawa, Hideaki; Shinada, Satoshi; Miyazawa, Takaya; Harai, Hiroaki; Kawasaki, Wataru; Saito, Tatsuhiko; Matsunaga, Koji; Toyozumi, Tatuya; Wada, Naoya

2012-12-17

We newly developed a 3 × 3 integrated optical packet and circuit switch-node. Optical buffers and burst-mode erbium-doped fiber amplifiers with the gain flatness are installed in the 3 × 3 switch-node. The optical buffer can prevent packet collisions and decrease packet loss. We constructed a multi-ring optical packet and circuit integrated network testbed connecting two single-ring networks and a client network by the 3 × 3 switch-node. For the first time, we demonstrated 244 km fiber transmission and 5-node hopping of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10 Gigabit Ethernet frames on the testbed. Error-free (frame error rate < 1 × 10(-4)) operation was achieved with optical packets of various packet lengths. In addition, successful avoidance of packet collisions by optical buffers was confirmed.

Discussion and group work design in O2O teaching of applied optics: questions, strategies and extending

NASA Astrophysics Data System (ADS)

Li, Xiaotong; Cen, Zhaofeng; Liu, Xiangdong; Zheng, Zhenrong

2017-08-01

Applied optics course in Zhejiang University is a National Excellent Resource Sharing Course in China, and the online to offline teaching strategies have been implemented and shared with dozens of universities and colleges in China. Discussion is an important activity in teaching. In this paper our main consideration is designing the discussion questions and group works so as to develop the students' critical thinking, cooperative and sharing spirits, and communication abilities in the cosmopolitan era. Typical questions that connect different chapters and help the students to understand the relationship between each sub-system in both field of view and aperture are given for discussion. We inspire the students to complete group works such as ray trace programming by cooperation and then make presentations. All of these create a circumstance for sharing thoughts and developing intelligence and knowledge. A poll shows that the students pay more attention to optical design than before and have made progress in conversation and cooperation.

Monitoring the effects of air-quality on forests: An overview of the Sierra Ancha Experimental Forest ICP-Level II Site

Treesearch

Peter E. Koestner; Karen A. Koestner; Daniel G. Neary

2012-01-01

The Sierra Ancha International Cooperative Program on Assessment and Monitoring of Air Pollution Effects on Forests study site or (SAEF-ICP II) is part of an international network of cooperative forest monitoring sites spread throughout Europe and the United States. The United Nations Economic Commission for Europe established the ICP II network in 1985 to monitor long...

Optical Circuit Switched Protocol

NASA Technical Reports Server (NTRS)

Monacos, Steve P. (Inventor)

2000-01-01

The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

Free space optics: a viable last-mile alternative

NASA Astrophysics Data System (ADS)

Willebrand, Heinz A.; Clark, Gerald R.

2001-10-01

This paper explores Free Space Optics (FSO) as an access technology in the last mile of metropolitan area networks (MANs). These networks are based in part on fiber-optic telecommunications infrastructure, including network architectures of Synchronous Optical Network (commonly referred to as SONET), the North American standard for synchronous data transmission; and Synchronous Digital Hierarchy (commonly referred to as SDH), the international standard and equivalent of SONET. Several converging forces have moved FSO beyond a niche technology for use only in local area networks (LANs) as a bridge connecting two facilities. FSO now allows service providers to cost effectively provide optical bandwidth for access networks and accelerate the extension of metro optical networks bridging what has been termed by industry experts as the optical dead zone. The optical dead zone refers to both the slowdown in capital investment in the short-term future and the actual connectivity gap that exists today between core metro optical networks and the access optical networks. Service providers have built extensive core and minimal metro networks but have not yet provided optical bandwidth to the access market largely due to the non-compelling economics to bridge the dead zone with fiber. Historically, such infrastructure build-out slowdowns have been blamed on a combination of economics, time-to-market constraints and limited technology options. However, new technology developments and market acceptance of FSO give service providers a new cost-effective alternative to provide high-bandwidth services with optical bandwidth in the access networks. Merrill Lynch predicts FSO will grow into a $2 billion market by 2005. The drivers for this market are a mere 5%- 6% penetration of fiber to business buildings; cost effective solution versus RF or fiber; and significant capacity which can only be matched by a physical fiber link, Merrill Lynch reports. This paper will describe FSO technology, its capabilities and its limitations. The paper will investigate how FSO technology has evolved to its current stage for deployment in MANs, LANs, wireless backhaul and metropolitan network extensions - applications that fall within the category of last mile. The paper will address the market, drivers and the adoption of FSO, plus provide a projection of future FSO technology, based on today's product roadmaps. The paper concludes with a summary of findings and recommendations.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-03-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to:

Performance of highly connected photonic switching lossless metro-access optical networks

NASA Astrophysics Data System (ADS)

Martins, Indayara Bertoldi; Martins, Yara; Barbosa, Felipe Rudge

2018-03-01

The present work analyzes the performance of photonic switching networks, optical packet switching (OPS) and optical burst switching (OBS), in mesh topology of different sizes and configurations. The "lossless" photonic switching node is based on a semiconductor optical amplifier, demonstrated and validated with experimental results on optical power gain, noise figure, and spectral range. The network performance was evaluated through computer simulations based on parameters such as average number of hops, optical packet loss fraction, and optical transport delay (Am). The combination of these elements leads to a consistent account of performance, in terms of network traffic and packet delivery for OPS and OBS metropolitan networks. Results show that a combination of highly connected mesh topologies having an ingress e-buffer present high efficiency and throughput, with very low packet loss and low latency, ensuring fast data delivery to the final receiver.

Experimental demonstration of software defined data center optical networks with Tbps end-to-end tunability

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Zhang, Jie; Ji, Yuefeng; Li, Hui; Wang, Huitao; Ge, Chao

2015-10-01

The end-to-end tunability is important to provision elastic channel for the burst traffic of data center optical networks. Then, how to complete the end-to-end tunability based on elastic optical networks? Software defined networking (SDN) based end-to-end tunability solution is proposed for software defined data center optical networks, and the protocol extension and implementation procedure are designed accordingly. For the first time, the flexible grid all optical networks with Tbps end-to-end tunable transport and switch system have been online demonstrated for data center interconnection, which are controlled by OpenDayLight (ODL) based controller. The performance of the end-to-end tunable transport and switch system has been evaluated with wavelength number tuning, bit rate tuning, and transmit power tuning procedure.

Cooperative enhancement of the nonlinear optical response in conjugated energetic materials: A TD-DFT study

DOE PAGES

Sifain, Andrew E.; Tadesse, Loza F.; Bjorgaard, Josiah August; ...

2017-03-21

Conjugated energetic molecules (CEMs) are a class of explosives with high nitrogen content that posses both enhanced safety and energetic performance properties and are ideal for direct optical initiation. As isolated molecules, they absorb within the range of conventional lasers. Crystalline CEMs are used in practice, however, and their properties can differ due to intermolecular interaction. Herein, time-dependent density functional theory was used to investigate one-photon absorption (OPA) and two-photon absorption (TPA) of monomers and dimers obtained from experimentally determined crystal structures of CEMs. OPA scales linearly with the number of chromophore units, while TPA scales nonlinearly, where a moremore » than 3-fold enhancement in peak intensity, per chromophore unit, is calculated. Cooperative enhancement depends on electronic delocalization spanning both chromophore units. An increase in sensitivity to nonlinear laser initiation makes these materials suitable for practical use. This is the first study predicting a cooperative enhancement of the nonlinear optical response in energetic materials composed of relatively small molecules. Finally, the proposed model quantum chemistry is validated by comparison to crystal structure geometries and the optical absorption of these materials dissolved in solution.« less

Decentralized cooperative TOA/AOA target tracking for hierarchical wireless sensor networks.

PubMed

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.

Coevolution of strategy-selection time scale and cooperation in spatial prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Rong, Zhihai; Wu, Zhi-Xi; Chen, Guanrong

2013-06-01

In this paper, we investigate a networked prisoner's dilemma game where individuals' strategy-selection time scale evolves based on their historical learning information. We show that the more times the current strategy of an individual is learnt by his neighbors, the longer time he will stick on the successful behavior by adaptively adjusting the lifetime of the adopted strategy. Through characterizing the extent of success of the individuals with normalized payoffs, we show that properly using the learned information can form a positive feedback mechanism between cooperative behavior and its lifetime, which can boost cooperation on square lattices and scale-free networks.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks.

PubMed

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-05-16

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

PubMed Central

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-01-01

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks. PMID:28509841

Toward Agent-Based Models of the Development And Evolution of Business Relations and Networks

NASA Astrophysics Data System (ADS)

Wilkinson, Ian F.; Marks, Robert E.; Young, Louise

Firms achieve competitive advantage in part through the development of cooperative relations with other firms and organisations. We describe a program of research designed to map and model the development of cooperative inter-firm relations, including the processes and paths by which firms may evolve from adversarial to more cooperative relations. Narrative-event-history methods will be used to develop stylised histories of the emergence of business relations in various contexts and to identify relevant causal mechanisms to be included in the agent-based models of relationship and network evolution. The relationship histories will provide the means of assuring the agent-based models developed.

A Novel Optimal Joint Resource Allocation Method in Cooperative Multicarrier Networks: Theory and Practice

PubMed Central

Gao, Yuan; Zhou, Weigui; Ao, Hong; Chu, Jian; Zhou, Quan; Zhou, Bo; Wang, Kang; Li, Yi; Xue, Peng

2016-01-01

With the increasing demands for better transmission speed and robust quality of service (QoS), the capacity constrained backhaul gradually becomes a bottleneck in cooperative wireless networks, e.g., in the Internet of Things (IoT) scenario in joint processing mode of LTE-Advanced Pro. This paper focuses on resource allocation within capacity constrained backhaul in uplink cooperative wireless networks, where two base stations (BSs) equipped with single antennae serve multiple single-antennae users via multi-carrier transmission mode. In this work, we propose a novel cooperative transmission scheme based on compress-and-forward with user pairing to solve the joint mixed integer programming problem. To maximize the system capacity under the limited backhaul, we formulate the joint optimization problem of user sorting, subcarrier mapping and backhaul resource sharing among different pairs (subcarriers for users). A novel robust and efficient centralized algorithm based on alternating optimization strategy and perfect mapping is proposed. Simulations show that our novel method can improve the system capacity significantly under the constraint of the backhaul resource compared with the blind alternatives. PMID:27077865

Exponentially Enhanced Light-Matter Interaction, Cooperativities, and Steady-State Entanglement Using Parametric Amplification

NASA Astrophysics Data System (ADS)

Qin, Wei; Miranowicz, Adam; Li, Peng-Bo; Lü, Xin-You; You, J. Q.; Nori, Franco

2018-03-01

We propose an experimentally feasible method for enhancing the atom-field coupling as well as the ratio between this coupling and dissipation (i.e., cooperativity) in an optical cavity. It exploits optical parametric amplification to exponentially enhance the atom-cavity interaction and, hence, the cooperativity of the system, with the squeezing-induced noise being completely eliminated. Consequently, the atom-cavity system can be driven from the weak-coupling regime to the strong-coupling regime for modest squeezing parameters, and even can achieve an effective cooperativity much larger than 100. Based on this, we further demonstrate the generation of steady-state nearly maximal quantum entanglement. The resulting entanglement infidelity (which quantifies the deviation of the actual state from a maximally entangled state) is exponentially smaller than the lower bound on the infidelities obtained in other dissipative entanglement preparations without applying squeezing. In principle, we can make an arbitrarily small infidelity. Our generic method for enhancing atom-cavity interaction and cooperativities can be implemented in a wide range of physical systems, and it can provide diverse applications for quantum information processing.

Optical implementation of (3, 3, 2) regular rectangular CC-Banyan optical network

NASA Astrophysics Data System (ADS)

Yang, Junbo; Su, Xianyu

2007-07-01

CC-Banyan network plays an important role in the optical interconnection network. Based on previous reports of (2, 2, 3) the CC-Banyan network, another rectangular-Banyan network, i.e. (3, 3, 2) rectangular CC-Banyan network, has been discussed. First, according to its construction principle, the topological graph and the routing rule of (3, 3, 2) rectangular CC-Banyan network have been proposed. Then, the optically experimental setup of (3, 3, 2) rectangular CC-Banyan network has been designed and achieved. Each stage of node switch consists of phase spatial light modulator (PSLM) and polarizing beam-splitter (PBS), and fiber has been used to perform connection between adjacent stages. PBS features that s-component (perpendicular to the incident plane) of the incident light beam is reflected, and p-component (parallel to the incident plane) passes through it. According to switching logic, under the control of external electrical signals, PSLM functions to control routing paths of the signal beams, i.e. the polarization of each optical signal is rotated or not rotated 90° by a programmable PSLM. Finally, the discussion and analysis show that the experimental setup designed here can realize many functions such as optical signal switch and permutation. It has advantages of large number of input/output-ports, compact in structure, and low energy loss. Hence, the experimental setup can be used in optical communication and optical information processing.

Secure Cooperation of Autonomous Mobile Sensors Using an Underwater Acoustic Network

PubMed Central

Caiti, Andrea; Calabrò, Vincenzo; Dini, Gianluca; Duca, Angelica Lo; Munafò, Andrea

2012-01-01

Methodologies and algorithms are presented for the secure cooperation of a team of autonomous mobile underwater sensors, connected through an acoustic communication network, within surveillance and patrolling applications. In particular, the work proposes a cooperative algorithm in which the mobile underwater sensors (installed on Autonomous Underwater Vehicles—AUVs) respond to simple local rules based on the available information to perform the mission and maintain the communication link with the network (behavioral approach). The algorithm is intrinsically robust: with loss of communication among the vehicles the coverage performance (i.e., the mission goal) is degraded but not lost. The ensuing form of graceful degradation provides also a reactive measure against Denial of Service. The cooperative algorithm relies on the fact that the available information from the other sensors, though not necessarily complete, is trustworthy. To ensure trustworthiness, a security suite has been designed, specifically oriented to the underwater scenario, and in particular with the goal of reducing the communication overhead introduced by security in terms of number and size of messages. The paper gives implementation details on the integration between the security suite and the cooperative algorithm and provides statistics on the performance of the system as collected during the UAN project sea trial held in Trondheim, Norway, in May 2011. PMID:22438748

Utility Evaluation Based on One-To-N Mapping in the Prisoner’s Dilemma Game for Interdependent Networks

PubMed Central

Wang, Juan; Lu, Wenwen; Liu, Lina; Li, Li; Xia, Chengyi

2016-01-01

In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems. PMID:27907024

Secure cooperation of autonomous mobile sensors using an underwater acoustic network.

PubMed

Caiti, Andrea; Calabrò, Vincenzo; Dini, Gianluca; Lo Duca, Angelica; Munafò, Andrea

2012-01-01

Methodologies and algorithms are presented for the secure cooperation of a team of autonomous mobile underwater sensors, connected through an acoustic communication network, within surveillance and patrolling applications. In particular, the work proposes a cooperative algorithm in which the mobile underwater sensors (installed on Autonomous Underwater Vehicles-AUVs) respond to simple local rules based on the available information to perform the mission and maintain the communication link with the network (behavioral approach). The algorithm is intrinsically robust: with loss of communication among the vehicles the coverage performance (i.e., the mission goal) is degraded but not lost. The ensuing form of graceful degradation provides also a reactive measure against Denial of Service. The cooperative algorithm relies on the fact that the available information from the other sensors, though not necessarily complete, is trustworthy. To ensure trustworthiness, a security suite has been designed, specifically oriented to the underwater scenario, and in particular with the goal of reducing the communication overhead introduced by security in terms of number and size of messages. The paper gives implementation details on the integration between the security suite and the cooperative algorithm and provides statistics on the performance of the system as collected during the UAN project sea trial held in Trondheim, Norway, in May 2011.

Technology Network Ties: Network Services and Technology Programs for New York State's Educational System.

ERIC Educational Resources Information Center

New York State Education Dept., Albany. Office of Elementary and Secondary Education Planning, Testing, and Technological Services.

The New York State Technology Network Ties (TNT) systems is a statewide telecommunications network which consists of computers, telephone lines, and telecommunications hardware and software. This network links school districts, Boards of Cooperative Educational Services (BOCES), libraries, other educational institutions, and the State Education…

Learning dynamics explains human behaviour in prisoner's dilemma on networks.

PubMed

Cimini, Giulio; Sánchez, Angel

2014-05-06

Cooperative behaviour lies at the very basis of human societies, yet its evolutionary origin remains a key unsolved puzzle. Whereas reciprocity or conditional cooperation is one of the most prominent mechanisms proposed to explain the emergence of cooperation in social dilemmas, recent experimental findings on networked Prisoner's Dilemma games suggest that conditional cooperation also depends on the previous action of the player-namely on the 'mood' in which the player is currently in. Roughly, a majority of people behave as conditional cooperators if they cooperated in the past, whereas they ignore the context and free ride with high probability if they did not. However, the ultimate origin of this behaviour represents a conundrum itself. Here, we aim specifically to provide an evolutionary explanation of moody conditional cooperation (MCC). To this end, we perform an extensive analysis of different evolutionary dynamics for players' behavioural traits-ranging from standard processes used in game theory based on pay-off comparison to others that include non-economic or social factors. Our results show that only a dynamic built upon reinforcement learning is able to give rise to evolutionarily stable MCC, and at the end to reproduce the human behaviours observed in the experiments.

Cooperative networks overcoming defectors by social influence

NASA Astrophysics Data System (ADS)

Gomez Portillo, Ignacio

2014-01-01

We address the cooperation problem in structured populations by considering the prisoner’s dilemma game as a metaphor of the social interactions between individuals with imitation capacity. We present a new strategy update rule called democratic weighted update where the individual’s behavior is socially influenced by each one of their neighbors. In particular, the capacity of an individual to socially influence other ones is proportional to its accumulated payoff. When in a neighborhood there are cooperators and defectors, the focal player is contradictorily influenced by them and, therefore, the effective social influence is given by the difference of the accumulated payoff of each strategy in its neighborhood. First, by considering the growing process of the network and neglecting mutations, we show the evolution of highly cooperative systems. Then, we broadly show that the social influence allows to overcome the emergence of defectors into highly cooperative systems. In this way, we conclude that in a structured system formed by a growing process, the cooperation evolves if the individuals have an imitation capacity socially influenced by each one of their neighbors. Therefore, here we present a theoretical solution of the cooperation problem among genetically unrelated individuals.

Library Networking: Current Problems and Future Prospects! Panel Discussion.

ERIC Educational Resources Information Center

Resource Sharing and Information Networks, 1983

1983-01-01

Presents questions and answers from information networking panel discussion involving symposium speakers Barbara Markuson (Indiana Cooperative Library Services Authority), Frank Grisham (Southeastern Library Network), Laima Mockus (New England Library Information Network), Richard McCoy (Research Libraries Group), Rowland Brown (OCLC), and Toni…

The Multitype Library Network.

ERIC Educational Resources Information Center

Dejohn, William, Ed.; Lamont, Bridget L., Ed.

1975-01-01

"Illinois Libraries" for June, 1975, is devoted to interlibrary cooperation and the multitype library network as exemplified by the Illinois Library and Information Network (ILLINET). The history, geographical coverage, member and affiliate libraries, and the workings of the network at various levels are described. A second section…

Adaptation technology between IP layer and optical layer in optical Internet

NASA Astrophysics Data System (ADS)

Ji, Yuefeng; Li, Hua; Sun, Yongmei

2001-10-01

Wavelength division multiplexing (WDM) optical network provides a platform with high bandwidth capacity and is supposed to be the backbone infrastructure supporting the next-generation high-speed multi-service networks (ATM, IP, etc.). In the foreseeable future, IP will be the predominant data traffic, to make fully use of the bandwidth of the WDM optical network, many attentions have been focused on IP over WDM, which has been proposed as the most promising technology for new kind of network, so-called Optical Internet. According to OSI model, IP is in the 3rd layer (network layer) and optical network is in the 1st layer (physical layer), so the key issue is what adaptation technology should be used in the 2nd layer (data link layer). In this paper, firstly, we analyze and compare the current adaptation technologies used in backbone network nowadays. Secondly, aiming at the drawbacks of above technologies, we present a novel adaptation protocol (DONA) between IP layer and optical layer in Optical Internet and describe it in details. Thirdly, the gigabit transmission adapter (GTA) we accomplished based on the novel protocol is described. Finally, we set up an experiment platform to apply and verify the DONA and GTA, the results and conclusions of the experiment are given.

Tunable thin film filters for intelligent WDM networks

NASA Astrophysics Data System (ADS)

Cahill, Michael; Bartolini, Glenn; Lourie, Mark; Domash, Lawrence

2006-08-01

Optical transmission systems have evolved rapidly in recent years with the emergence of new technologies for gain management, wavelength multiplexing, tunability, and switching. WDM networks are increasingly expected to be agile, flexible, and reconfigurable which in turn has led to a need for monitoring to be more widely distributed within the network. Automation of many actions performed on these networks, such as channel provisioning and power balancing, can only be realized by the addition of optical channel monitors (OCMs). These devices provide information about the optical transmission system including the number of optical channels, channel identification, wavelength, power, and in some cases optical signal-to-noise ratio (OSNR). Until recently OCMs were costly and bulky and thus the number of OCMs used in optical networks was often kept to a minimum. We describe a family of tunable thin film filters which have greatly reduced the cost and physical footprint of channel monitors, making possible 'monitoring everywhere' for intelligent optical networks which can serve long haul, metro and access requirements from a single technology platform. As examples of specific applications we discuss network issues such as auto provisioning, wavelength collision avoidance, power balancing, OSNR balancing, gain equalization, alien wavelength recognition, interoperability, and other requirements assigned to the emerging concept of an Optical Control Plane.

Approximately adaptive neural cooperative control for nonlinear multiagent systems with performance guarantee

NASA Astrophysics Data System (ADS)

Wang, Jing; Yang, Tianyu; Staskevich, Gennady; Abbe, Brian

2017-04-01

This paper studies the cooperative control problem for a class of multiagent dynamical systems with partially unknown nonlinear system dynamics. In particular, the control objective is to solve the state consensus problem for multiagent systems based on the minimisation of certain cost functions for individual agents. Under the assumption that there exist admissible cooperative controls for such class of multiagent systems, the formulated problem is solved through finding the optimal cooperative control using the approximate dynamic programming and reinforcement learning approach. With the aid of neural network parameterisation and online adaptive learning, our method renders a practically implementable approximately adaptive neural cooperative control for multiagent systems. Specifically, based on the Bellman's principle of optimality, the Hamilton-Jacobi-Bellman (HJB) equation for multiagent systems is first derived. We then propose an approximately adaptive policy iteration algorithm for multiagent cooperative control based on neural network approximation of the value functions. The convergence of the proposed algorithm is rigorously proved using the contraction mapping method. The simulation results are included to validate the effectiveness of the proposed algorithm.

Effects of Dimers on Cooperation in the Spatial Prisoner's Dilemma Game

NASA Astrophysics Data System (ADS)

Li, Hai-Hong; Cheng, Hong-Yan; Dai, Qiong-Lin; Ju, Ping; Zhang, Mei; Yang, Jun-Zhong

2011-11-01

We investigate the evolutionary prisoner's dilemma game in structured populations by introducing dimers, which are defined as that two players in each dimer always hold a same strategy. We find that influences of dimers on cooperation depend on the type of dimers and the population structure. For those dimers in which players interact with each other, the cooperation level increases with the number of dimers though the cooperation improvement level depends on the type of network structures. On the other hand, the dimers, in which there are not mutual interactions, will not do any good to the cooperation level in a single community, but interestingly, will improve the cooperation level in a population with two communities. We explore the relationship between dimers and self-interactions and find that the effects of dimers are similar to that of self-interactions. Also, we find that the dimers, which are established over two communities in a multi-community network, act as one type of interaction through which information between communities is communicated by the requirement that two players in a dimer hold a same strategy.

Evolutionary dynamics of cooperation in neutral populations

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž

2018-01-01

Cooperation is a difficult proposition in the face of Darwinian selection. Those that defect have an evolutionary advantage over cooperators who should therefore die out. However, spatial structure enables cooperators to survive through the formation of homogeneous clusters, which is the hallmark of network reciprocity. Here we go beyond this traditional setup and study the spatiotemporal dynamics of cooperation in a population of populations. We use the prisoner's dilemma game as the mathematical model and show that considering several populations simultaneously gives rise to fascinating spatiotemporal dynamics and pattern formation. Even the simplest assumption that strategies between different populations are payoff-neutral with one another results in the spontaneous emergence of cyclic dominance, where defectors of one population become prey of cooperators in the other population, and vice versa. Moreover, if social interactions within different populations are characterized by significantly different temptations to defect, we observe that defectors in the population with the largest temptation counterintuitively vanish the fastest, while cooperators that hang on eventually take over the whole available space. Our results reveal that considering the simultaneous presence of different populations significantly expands the complexity of evolutionary dynamics in structured populations, and it allows us to understand the stability of cooperation under adverse conditions that could never be bridged by network reciprocity alone.

Supercooperation in evolutionary games on correlated weighted networks.

PubMed

Buesser, Pierre; Tomassini, Marco

2012-01-01

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barabási-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link end points leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help us to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.

Optical multicast system for data center networks.

PubMed

Samadi, Payman; Gupta, Varun; Xu, Junjie; Wang, Howard; Zussman, Gil; Bergman, Keren

2015-08-24

We present the design and experimental evaluation of an Optical Multicast System for Data Center Networks, a hardware-software system architecture that uniquely integrates passive optical splitters in a hybrid network architecture for faster and simpler delivery of multicast traffic flows. An application-driven control plane manages the integrated optical and electronic switched traffic routing in the data plane layer. The control plane includes a resource allocation algorithm to optimally assign optical splitters to the flows. The hardware architecture is built on a hybrid network with both Electronic Packet Switching (EPS) and Optical Circuit Switching (OCS) networks to aggregate Top-of-Rack switches. The OCS is also the connectivity substrate of splitters to the optical network. The optical multicast system implementation requires only commodity optical components. We built a prototype and developed a simulation environment to evaluate the performance of the system for bulk multicasting. Experimental and numerical results show simultaneous delivery of multicast flows to all receivers with steady throughput. Compared to IP multicast that is the electronic counterpart, optical multicast performs with less protocol complexity and reduced energy consumption. Compared to peer-to-peer multicast methods, it achieves at minimum an order of magnitude higher throughput for flows under 250 MB with significantly less connection overheads. Furthermore, for delivering 20 TB of data containing only 15% multicast flows, it reduces the total delivery energy consumption by 50% and improves latency by 55% compared to a data center with a sole non-blocking EPS network.

Communique: Special Issue on the International Network for Cooperation in Northern Science Created at a Meeting held in Edmonton, Alberta (October 12-15, 1982). Summary of Discussions and Agreements Reached = Numero special sur le Reseau Scientifique Internationale pour le Nord cree a la reunion tenue a Edmonton, Alberta (du 12 au 15 octobre 1982). Resume des discussions et accords conclus.

ERIC Educational Resources Information Center

Communique, 1983

1983-01-01

Delegations from Canada, Finland, Greenland, Norway, Sweden, and the United States agreed to the establishment of a network for cooperation among individuals engaged in problems peculiar to the circumpolar North. The Northern Science Network, established within the Unesco Man and the Biosphere Program, consists of three themes: studies on the…

Scientific reasons for a network of ST radars and cooperative campaigns

NASA Technical Reports Server (NTRS)

Petitdidier, M.; Crochet, M.

1986-01-01

Due to their capabilities of measuring wind profiles in the troposphere and stratosphere with good time and height resolution, whatever the weather conditions, stratosphere-troposphere (ST) radars are well adapted to carry out atmospheric research in many fields as well as to fulfill the meteorological forecasting needs. Examples are presented from previous and future national or international campaigns planned in France. The ST radars were used first by themselves with the adjunction of radiosonde data. Then networks were built and used to get horizontal parameters. It appears that ST radar networks should naturally be included in cooperative campaigns.

Multiple-Ring Digital Communication Network

NASA Technical Reports Server (NTRS)

Kirkham, Harold

1992-01-01

Optical-fiber digital communication network to support data-acquisition and control functions of electric-power-distribution networks. Optical-fiber links of communication network follow power-distribution routes. Since fiber crosses open power switches, communication network includes multiple interconnected loops with occasional spurs. At each intersection node is needed. Nodes of communication network include power-distribution substations and power-controlling units. In addition to serving data acquisition and control functions, each node acts as repeater, passing on messages to next node(s). Multiple-ring communication network operates on new AbNET protocol and features fiber-optic communication.

Logical optical line terminal technologies towards flexible and highly reliable metro- and access-integrated networks

NASA Astrophysics Data System (ADS)

Okamoto, Satoru; Sato, Takehiro; Yamanaka, Naoaki

2017-01-01

In this paper, flexible and highly reliable metro and access integrated networks with network virtualization and software defined networking technologies will be presented. Logical optical line terminal (L-OLT) technologies and active optical distribution networks (ODNs) are the key to introduce flexibility and high reliability into the metro and access integrated networks. In the Elastic Lambda Aggregation Network (EλAN) project which was started in 2012, a concept of the programmable optical line terminal (P-OLT) has been proposed. A role of the P-OLT is providing multiple network services that have different protocols and quality of service requirements by single OLT box. Accommodated services will be Internet access, mobile front-haul/back-haul, data-center access, and leased line. L-OLTs are configured within the P-OLT box to support the functions required for each network service. Multiple P-OLTs and programmable optical network units (P-ONUs) are connected by the active ODN. Optical access paths which have flexible capacity are set on the ODN to provide network services from L-OLT to logical ONUs (L-ONUs). The L-OLT to L-ONU path on the active ODN provides a logical connection. Therefore, introducing virtualization technologies becomes possible. One example is moving an L-OLT from one P-OLT to another P-OLT like a virtual machine. This movement is called L-OLT migration. The L-OLT migration provides flexible and reliable network functions such as energy saving by aggregating L-OLTs to a limited number of P-OLTs, and network wide optical access path restoration. Other L-OLT virtualization technologies and experimental results will be also discussed in the paper.

A Survey on Next-Generation Mixed Line Rate (MLR) and Energy-Driven Wavelength-Division Multiplexed (WDM) Optical Networks

NASA Astrophysics Data System (ADS)

Iyer, Sridhar

2015-06-01

With the ever-increasing traffic demands, infrastructure of the current 10 Gbps optical network needs to be enhanced. Further, since the energy crisis is gaining increasing concerns, new research topics need to be devised and technological solutions for energy conservation need to be investigated. In all-optical mixed line rate (MLR) network, feasibility of a lightpath is determined by the physical layer impairment (PLI) accumulation. Contrary to PLI-aware routing and wavelength assignment (PLIA-RWA) algorithm applicable for a 10 Gbps wavelength-division multiplexed (WDM) network, a new Routing, Wavelength, Modulation format assignment (RWMFA) algorithm is required for the MLR optical network. With the rapid growth of energy consumption in Information and Communication Technologies (ICT), recently, lot of attention is being devoted toward "green" ICT solutions. This article presents a review of different RWMFA (PLIA-RWA) algorithms for MLR networks, and surveys the most relevant research activities aimed at minimizing energy consumption in optical networks. In essence, this article presents a comprehensive and timely survey on a growing field of research, as it covers most aspects of MLR and energy-driven optical networks. Hence, the author aims at providing a comprehensive reference for the growing base of researchers who will work on MLR and energy-driven optical networks in the upcoming years. Finally, the article also identifies several open problems for future research.

Dim Networks: The Utility of Social Network Analysis for Illuminating Partner Security Force Networks

DTIC Science & Technology

2015-12-01

use of social network analysis (SNA) has allowed the military to map dark networks of terrorist organizations and selectively target key elements...data to improve SC. 14. SUBJECT TERMS social network analysis, dark networks, light networks, dim networks, security cooperation, Southeast Asia...task may already exist. Recently, the use of social network analysis (SNA) has allowed the military to map dark networks of terrorist organizations

Intelligent optical networking with photonic cross connections

NASA Astrophysics Data System (ADS)

Ceuppens, L.; Jerphagnon, Olivier L.; Lang, Jonathan; Banerjee, Ayan; Blumenthal, Daniel J.

2002-09-01

Optical amplification and dense wavelength division multiplexing (DWDM) have fundamentally changed optical transport networks. Now that these technologies are widely adopted, the bottleneck has moved from the outside line plant to nodal central offices, where electrical switching equipment has not kept pace. While OEO technology was (and still is) necessary for grooming and traffic aggregation, the transport network has dramatically changed, requiring a dramatic rethinking of how networks need to be designed and operated. While todays transport networks carry remarkable amounts of bandwidth, their optical layer is fundamentally static and provides for only simple point-to-point transport. Efficiently managing the growing number of wavelengths can only be achieved through a new breed of networking element. Photonic switching systems (PSS) can efficiently execute these functions because they are bit rate, wavelength, and protocol transparent. With their all-optical switch cores and interfaces, PSS can switch optical signals at various levels of granularity wavelength, sub band, and composite DWDM fiber levels. Though cross-connect systems with electrical switch cores are available, they perform these functions at very high capital costs and operational inefficiencies. This paper examines enabling technologies for deployment of intelligent optical transport networks (OTN), and takes a practical perspective on survivability architecture migration and implementation issues.

Peer-to-peer model for the area coverage and cooperative control of mobile sensor networks

NASA Astrophysics Data System (ADS)

Tan, Jindong; Xi, Ning

2004-09-01

This paper presents a novel model and distributed algorithms for the cooperation and redeployment of mobile sensor networks. A mobile sensor network composes of a collection of wireless connected mobile robots equipped with a variety of sensors. In such a sensor network, each mobile node has sensing, computation, communication, and locomotion capabilities. The locomotion ability enhances the autonomous deployment of the system. The system can be rapidly deployed to hostile environment, inaccessible terrains or disaster relief operations. The mobile sensor network is essentially a cooperative multiple robot system. This paper first presents a peer-to-peer model to define the relationship between neighboring communicating robots. Delaunay Triangulation and Voronoi diagrams are used to define the geometrical relationship between sensor nodes. This distributed model allows formal analysis for the fusion of spatio-temporal sensory information of the network. Based on the distributed model, this paper discusses a fault tolerant algorithm for autonomous self-deployment of the mobile robots. The algorithm considers the environment constraints, the presence of obstacles and the nonholonomic constraints of the robots. The distributed algorithm enables the system to reconfigure itself such that the area covered by the system can be enlarged. Simulation results have shown the effectiveness of the distributed model and deployment algorithms.

Stochastic noncooperative and cooperative evolutionary game strategies of a population of biological networks under natural selection.

PubMed

Chen, Bor-Sen; Yeh, Chin-Hsun

2017-12-01

We review current static and dynamic evolutionary game strategies of biological networks and discuss the lack of random genetic variations and stochastic environmental disturbances in these models. To include these factors, a population of evolving biological networks is modeled as a nonlinear stochastic biological system with Poisson-driven genetic variations and random environmental fluctuations (stimuli). To gain insight into the evolutionary game theory of stochastic biological networks under natural selection, the phenotypic robustness and network evolvability of noncooperative and cooperative evolutionary game strategies are discussed from a stochastic Nash game perspective. The noncooperative strategy can be transformed into an equivalent multi-objective optimization problem and is shown to display significantly improved network robustness to tolerate genetic variations and buffer environmental disturbances, maintaining phenotypic traits for longer than the cooperative strategy. However, the noncooperative case requires greater effort and more compromises between partly conflicting players. Global linearization is used to simplify the problem of solving nonlinear stochastic evolutionary games. Finally, a simple stochastic evolutionary model of a metabolic pathway is simulated to illustrate the procedure of solving for two evolutionary game strategies and to confirm and compare their respective characteristics in the evolutionary process. Copyright © 2017 Elsevier B.V. All rights reserved.

Optical-Correlator Neural Network Based On Neocognitron

NASA Technical Reports Server (NTRS)

Chao, Tien-Hsin; Stoner, William W.

1994-01-01

Multichannel optical correlator implements shift-invariant, high-discrimination pattern-recognizing neural network based on paradigm of neocognitron. Selected as basic building block of this neural network because invariance under shifts is inherent advantage of Fourier optics included in optical correlators in general. Neocognitron is conceptual electronic neural-network model for recognition of visual patterns. Multilayer processing achieved by iteratively feeding back output of feature correlator to input spatial light modulator and updating Fourier filters. Neural network trained by use of characteristic features extracted from target images. Multichannel implementation enables parallel processing of large number of selected features.

Latency causes and reduction in optical metro networks

NASA Astrophysics Data System (ADS)

Bobrovs, Vjaceslavs; Spolitis, Sandis; Ivanovs, Girts

2013-12-01

The dramatic growth of transmitted information in fiber optical networks is leading to a concern about the network latency for high-speed reliable services like financial transactions, telemedicine, virtual and augmented reality, surveillance, and other applications. In order to ensure effective latency engineering, the delay variability needs to be accurately monitored and measured, in order to control it. This paper in brief describes causes of latency in fiber optical metro networks. Several available latency reduction techniques and solutions are also discussed, namely concerning usage of different chromatic dispersion compensation methods, low-latency amplifiers, optical fibers as well as other network elements.

Crossbar Switches For Optical Data-Communication Networks

NASA Technical Reports Server (NTRS)

Monacos, Steve P.

1994-01-01

Optoelectronic and electro-optical crossbar switches called "permutation engines" (PE's) developed to route packets of data through fiber-optic communication networks. Basic network concept described in "High-Speed Optical Wide-Area Data-Communication Network" (NPO-18983). Nonblocking operation achieved by decentralized switching and control scheme. Each packet routed up or down in each column of this 5-input/5-output permutation engine. Routing algorithm ensures each packet arrives at its designated output port without blocking any other packet that does not contend for same output port.

Application of Fiber-Optical Techniques in the Access Transmission and Backbone Transport of Mobile Networks

NASA Astrophysics Data System (ADS)

Hilt, Attila; Pozsonyi, László

2012-09-01

Fixed access networks widely employ fiber-optical techniques due to the extremely wide bandwidth offered to subscribers. In the last decade, there has also been an enormous increase of user data visible in mobile systems. The importance of fiber-optical techniques within the fixed transmission/transport networks of mobile systems is therefore inevitably increasing. This article summarizes a few reasons and gives examples why and how fiber-optic techniques are employed efficiently in second-generation networks.

The Dynamics of Coalition Formation on Complex Networks

NASA Astrophysics Data System (ADS)

Auer, S.; Heitzig, J.; Kornek, U.; Schöll, E.; Kurths, J.

2015-08-01

Complex networks describe the structure of many socio-economic systems. However, in studies of decision-making processes the evolution of the underlying social relations are disregarded. In this report, we aim to understand the formation of self-organizing domains of cooperation (“coalitions”) on an acquaintance network. We include both the network’s influence on the formation of coalitions and vice versa how the network adapts to the current coalition structure, thus forming a social feedback loop. We increase complexity from simple opinion adaptation processes studied in earlier research to more complex decision-making determined by costs and benefits, and from bilateral to multilateral cooperation. We show how phase transitions emerge from such coevolutionary dynamics, which can be interpreted as processes of great transformations. If the network adaptation rate is high, the social dynamics prevent the formation of a grand coalition and therefore full cooperation. We find some empirical support for our main results: Our model develops a bimodal coalition size distribution over time similar to those found in social structures. Our detection and distinguishing of phase transitions may be exemplary for other models of socio-economic systems with low agent numbers and therefore strong finite-size effects.

[A survey of Local Physicians and Psychotherapists on Cooperation in Regional Networks for Early Child Interventions in Saxony-Anhalt].

PubMed

Clauß, D; Fleischer, S; Mattern, E; Ayerle, G

2016-07-01

Early childhood interventions positively contribute to health related child development. For these interventions, networks are a necessary prerequisite as they promote interdisciplinary and interprofessional cooperation. This holds especially true for the integration of health system protagonists. In a cross-sectional survey local paediatrists, gynaecologists, general practitioners, and psychotherapists were asked about their knowledge, experiences, desires, and reservations regarding cooperation in early childhood intervention networks. 64 out of 1747 (3.7%) eligible clinicians answered the survey. On average they estimated that 10.1% of the families they are treating would benefit from early childhood interventions. Participants rated themselves as competent to offer appropriate early childhood interventions. The youth welfare service was judged as the most important institution for their own professional practice by 84.4%. Additionally to an applicable agenda, a fair group moderation of network meetings was seen as a substantial requirement in order to take part in network meetings. Health professionals are important protagonists in early childhood interventions. Clinicians should assess relevant problems in families and offer appropriate support on a regular basis. Alongside clearly defined regional contacts, interprofessional continuing education seems mandatory. © Georg Thieme Verlag KG Stuttgart · New York.

An Architecture for Cooperative Localization in Underwater Acoustic Networks

DTIC Science & Technology

2015-10-24

range. (b) Independent navigation and control system onboard Iver AUVs . The cooperative localization process is highlighted in red. Figure 1: Block...Iver2 AUVs (Fig. 3) and a topside ship. While we make spe- cific notes about this three vehicle network, the architecture is vehicle independent. 3.1...Single vehicle subsystem Each vehicle executes several processes including sensor drivers, a pose estimator (Section 2), and, in the case of the AUVs

Configuration of Wireless Cooperative/Sensor Networks

DTIC Science & Technology

2008-05-25

WSN), the advantages of cooperation can be further exploited by optimally allocating the energy and bandwidth resources among users based on the... consumption and extend system lifetime [Sin98]. The implementation of a minimum energy routing protocol is discussed in [Dos02a, Dos02b]. An online...power consumption in the network given the required SER at the destination. For example, with source power Ps=20dB, the EP algorithm requires one relay

Summary of DSN (Deep Space Network) reimbursable launch support

NASA Technical Reports Server (NTRS)

Fanelli, N. A.; Wyatt, M. E.

1988-01-01

The Deep Space Network is providing ground support to space agencies of foreign governments as well as to NASA and other agencies of the Federal government which are involved in space activities. DSN funding for support of missions other than NASA are on either a cooperative or a reimbursable basis. Cooperative funding and support are accomplished in the same manner as NASA sponsored missions. Reimbursable launch funding and support methods are described.

Chimera states in a network-organized public goods game with destructive agents

NASA Astrophysics Data System (ADS)

Kouvaris, Nikos E.; Requejo, Rubén J.; Hizanidis, Johanne; Díaz-Guilera, Albert

2016-12-01

We found that a network-organized metapopulation of cooperators, defectors, and destructive agents playing the public goods game with mutations can collectively reach global synchronization or chimera states. Global synchronization is accompanied by a collective periodic burst of cooperation, whereas chimera states reflect the tendency of the networked metapopulation to be fragmented in clusters of synchronous and incoherent bursts of cooperation. Numerical simulations have shown that the system's dynamics switches between these two steady states through a first order transition. Depending on the parameters determining the dynamical and topological properties, chimera states with different numbers of coherent and incoherent clusters are observed. Our results present the first systematic study of chimera states and their characterization in the context of evolutionary game theory. This provides a valuable insight into the details of their occurrence, extending the relevance of such states to natural and social systems.

Perturbed cooperative-state feedback strategy for model predictive networked control of interconnected systems.

PubMed

Tran, Tri; Ha, Q P

2018-01-01

A perturbed cooperative-state feedback (PSF) strategy is presented for the control of interconnected systems in this paper. The subsystems of an interconnected system can exchange data via the communication network that has multiple connection topologies. The PSF strategy can resolve both issues, the sensor data losses and the communication network breaks, thanks to the two components of the control including a cooperative-state feedback and a perturbation variable, e.g., u i =K ij x j +w i . The PSF is implemented in a decentralized model predictive control scheme with a stability constraint and a non-monotonic storage function (ΔV(x(k))≥0), derived from the dissipative systems theory. Numerical simulation for the automatic generation control problem in power systems is studied to illustrate the effectiveness of the presented PSF strategy. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Real-time monitoring and fault locating using amplified spontaneous emission noise reflection for tree-structured Ethernet passive optical networks

NASA Astrophysics Data System (ADS)

Naim, Nani Fadzlina; Ab-Rahman, Mohammad Syuhaimi; Kamaruddin, Nur Hasiba; Bakar, Ahmad Ashrif A.

2013-09-01

Nowadays, optical networks are becoming dense while detecting faulty branches in the tree-structured networks has become problematic. Conventional methods are inconvenient as they require an engineer to visit the failure site to check the optical fiber using an optical time-domain reflectometer. An innovative monitoring technique for tree-structured network topology in Ethernet passive optical networks (EPONs) by using the erbium-doped fiber amplifier to amplify the traffic signal is demonstrated, and in the meantime, a residual amplified spontaneous emission spectrum is used as the input signal to monitor the optical cable from the central office. Fiber Bragg gratings with distinct center wavelengths are employed to reflect the monitoring signals. Faulty branches of the tree-structured EPONs can be identified using a simple and low-cost receiver. We will show that this technique is capable of providing monitoring range up to 32 optical network units using a power meter with a sensitivity of -65 dBm while maintaining the bit error rate of 10-13.

Eighth Goddard Conference on Mass Storage Systems and Technologies in Cooperation with the Seventeenth IEEE Symposium on Mass Storage Systems

NASA Technical Reports Server (NTRS)

Kobler, Benjamin (Editor); Hariharan, P. C. (Editor)

2000-01-01

This document contains copies of those technical papers received in time for publication prior to the Eighth Goddard Conference on Mass Storage Systems and Technologies which is being held in cooperation with the Seventeenth IEEE Symposium on Mass Storage Systems at the University of Maryland University College Inn and Conference Center March 27-30, 2000. As one of an ongoing series, this Conference continues to provide a forum for discussion of issues relevant to the management of large volumes of data. The Conference encourages all interested organizations to discuss long term mass storage requirements and experiences in fielding solutions. Emphasis is on current and future practical solutions addressing issues in data management, storage systems and media, data acquisition, long term retention of data, and data distribution. This year's discussion topics include architecture, future of current technology, new technology with a special emphasis on holographic storage, performance, standards, site reports, vendor solutions. Tutorials will be available on stability of optical media, disk subsystem performance evaluation, I/O and storage tuning, functionality and performance evaluation of file systems for storage area networks.

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

PubMed Central

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

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

NASA Astrophysics Data System (ADS)

Ye, Ye; Cheong, Kang Hao; Cen, Yu-Wan; Xie, Neng-Gang

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

SpaceFibre: The Standard, Simulation, IP Cores and Test Equipment

NASA Astrophysics Data System (ADS)

Parkes, Steve; McClements, Chris; McLaren, David; Ferrer Florit, Albert; Gonzalez Villafranca, Alberto

2015-09-01

SpaceFibre is an emerging new standard for spacecraft on-board data-handling networks. Initially targeted to deliver multi-Gbit/s data rates for synthetic aperture radar and high-resolution, multi-spectral imaging instruments, SpaceFibre has developed into a unified network technology that integrates high bandwidth, with low latency, quality of service (QoS) and fault detection, isolation and recovery (FDIR). Furthermore SpaceFibre is backwards compatible with the widely used SpaceWire standard at the network level allowing simple interconnection of existing SpaceWire equipment to a SpaceFibre link or network. Developed by the University of Dundee for the European Space Agency (ESA) SpaceFibre is able to operate over fibre-optic and electrical cable and supports data rates of 2 Gbit/s in the near future and up to 5 Gbit/s long-term. Multi-laning improves the data-rate further to well over 20 Gbits/s. This paper details the current state of SpaceFibre which is now in the process of formal standardisation by the European Cooperation for Space Standardization (ECSS). It describes the SpaceFibre IP core being developed for ESA. The design of a SpaceFibre demonstration board is introduced and available SpaceFibre test and development equipment is described. The way in which several SpaceWire links can be concentrated over a single SpaceFibre link will be explained.

Optical computing and neural networks; Proceedings of the Meeting, National Chiao Tung Univ., Hsinchu, Taiwan, Dec. 16, 17, 1992

NASA Technical Reports Server (NTRS)

Hsu, Ken-Yuh (Editor); Liu, Hua-Kuang (Editor)

1992-01-01

The present conference discusses optical neural networks, photorefractive nonlinear optics, optical pattern recognition, digital and analog processors, and holography and its applications. Attention is given to bifurcating optical information processing, neural structures in digital halftoning, an exemplar-based optical neural net classifier for color pattern recognition, volume storage in photorefractive disks, and microlaser-based compact optical neuroprocessors. Also treated are the optical implementation of a feature-enhanced optical interpattern-associative neural network model and its optical implementation, an optical pattern binary dual-rail logic gate module, a theoretical analysis for holographic associative memories, joint transform correlators, image addition and subtraction via the Talbot effect, and optical wavelet-matched filters. (No individual items are abstracted in this volume)

Optical computing and neural networks; Proceedings of the Meeting, National Chiao Tung Univ., Hsinchu, Taiwan, Dec. 16, 17, 1992

NASA Astrophysics Data System (ADS)

Hsu, Ken-Yuh; Liu, Hua-Kuang

The present conference discusses optical neural networks, photorefractive nonlinear optics, optical pattern recognition, digital and analog processors, and holography and its applications. Attention is given to bifurcating optical information processing, neural structures in digital halftoning, an exemplar-based optical neural net classifier for color pattern recognition, volume storage in photorefractive disks, and microlaser-based compact optical neuroprocessors. Also treated are the optical implementation of a feature-enhanced optical interpattern-associative neural network model and its optical implementation, an optical pattern binary dual-rail logic gate module, a theoretical analysis for holographic associative memories, joint transform correlators, image addition and subtraction via the Talbot effect, and optical wavelet-matched filters. (No individual items are abstracted in this volume)

Tunable optical frequency comb enabled scalable and cost-effective multiuser orthogonal frequency-division multiple access passive optical network with source-free optical network units.

PubMed

Chen, Chen; Zhang, Chongfu; Liu, Deming; Qiu, Kun; Liu, Shuang

2012-10-01

We propose and experimentally demonstrate a multiuser orthogonal frequency-division multiple access passive optical network (OFDMA-PON) with source-free optical network units (ONUs), enabled by tunable optical frequency comb generation technology. By cascading a phase modulator (PM) and an intensity modulator and dynamically controlling the peak-to-peak voltage of a PM driven signal, a tunable optical frequency comb source can be generated. It is utilized to assist the configuration of a multiple source-free ONUs enhanced OFDMA-PON where simultaneous and interference-free multiuser upstream transmission over a single wavelength can be efficiently supported. The proposed multiuser OFDMA-PON is scalable and cost effective, and its feasibility is successfully verified by experiment.

Architectures of fiber optic network in telecommunications

NASA Astrophysics Data System (ADS)

Vasile, Irina B.; Vasile, Alexandru; Filip, Luminita E.

2005-08-01

The operators of telecommunications have targeted their efforts towards realizing applications using broad band fiber optics systems in the access network. Thus, a new concept related to the implementation of fiber optic transmission systems, named FITL (Fiber In The Loop) has appeared. The fiber optic transmission systems have been extensively used for realizing the transport and intercommunication of the public telecommunication network, as well as for assuring the access to the telecommunication systems of the great corporations. Still, the segment of the residential users and small corporations did not benefit on large scale of this technology implementation. For the purpose of defining fiber optic applications, more types of architectures were conceived, like: bus, ring, star, tree. In the case of tree-like networks passive splitters (that"s where the name of PON comes from - Passive Optical Network-), which reduce significantly the costs of the fiber optic access, by separating the costs of the optical electronic components. That's why the passive fiber optics architectures (PON represent a viable solution for realizing the access at the user's loop. The main types of fiber optics architectures included in this work are: FTTC (Fiber To The Curb); FTTB (Fiber To The Building); FTTH (Fiber To The Home).

An Exploration of Professional Culture Differentials and Their Potential Impact on the Information Assurance Component of Optical Transmission Networks Design

ERIC Educational Resources Information Center

Cuthrell, Michael Gerard

2011-01-01

Optical transmission networks are an integral component of the critical infrastructures for many nations. Many people believe that optical transmission networks are impenetrable. In actuality, these networks possess weaknesses that can be exploited to bring about harm. An emerging Information Assurance (IA) industry has as its goals: to…

An effective intervention algorithm for promoting cooperation in the prisoner's dilemma game with multiple stable states

NASA Astrophysics Data System (ADS)

Li, Y. S.; Xu, C.; Hui, P. M.

2018-07-01

Multiple stable states, hysteresis, sensitivity to initial distributions, and a control algorithm for promoting cooperation are studied in an evolutionary prisoner's dilemma with agents connected into a regular random network. A system could evolve into states of different cooperative frequencies xc in different runs, even starting with the same initial cooperative frequency xc(in) and payoff parameters. For a large reward R, some values of xc(in) either take the system to a group of low cooperative frequency (LCF) states or to a few high cooperative frequency (HCF) states. These states differ by their network structures, with cooperative players connected into ring-like structure in LCF states and compact clusters in HCF states. Hysteresis in xc is observed when R is swept down and up, when the final state of the previous R is used as the initial state of the next R. The analysis led us to propose a closed pack cluster algorithm that gives HCF states effectively. The algorithm intervenes the system at some point in time by selectively switching some non-cooperative D-agents into cooperative C-agents at the peripheral of an existing cluster of C-agents. It ensures protection of a small C-cluster from which more cooperation can be induced. Practically, a governing body may first allow a society to evolve freely and then derive suitable policy to promote selected pockets of good practices for attaining a higher level of common good.

Upgrade of an optical network unit in a 40 Gb/s time and wavelength-division multiplexed passive optical network using an upstream tunable colorless laser

NASA Astrophysics Data System (ADS)

Bindhaiq, Salem; Supa'at, Abu Sahmah M.; Zulkifli, Nadiatulhuda; Shaddad, Redhwan Q.; Mataria, Abdallah

2014-07-01

A high data transmission rate is the main requirement for next-generation telecommunication networks. A design for a 40 Gb/s time and wavelength-division multiplexed passive optical network (TWDM-PON) for next-generation passive optical network stage 2 is presented. The use of a modulated grating Y-branch (MG-Y) laser is proposed as an upstream tunable colorless laser source to upgrade the optical network unit. The electronically tuned MG-Y externally modulated laser with a 10 Gb/s modulation rate is applied to a TWDM-PON and presented across a 3.2-nm tuning range. The performance of the proposed laser is analyzed in terms of bit error rate, eye diagram, and optical signal-to-noise ratio. The proposed TWDM-PON achieved an aggregated data rate of 40 Gb/s along 40 km of bidirectional fiber at a 1:128 splitting ratio without amplification and dispersion compensation.

Cloaking data in optical networks

NASA Astrophysics Data System (ADS)

Klein, Avi; Shahal, Shir; Masri, Gilad; Duadi, Hamootal; Fridman, Moti

2018-01-01

Modern networks implement multi-layer encryption architecture to increase network security, stability, and robustness. We developed a new paradigm for optical encryption based on the strengths of optics over electronics and according to temporal optics principles. We developed a highly efficient all-optical encryption scheme for modern networks. Our temporal encryption scheme exploits the strength of optics over electronics. Specifically, we utilize dispersion together with nonlinear interaction for mixing neighboring bits with a private key. Our system encrypts the entire network traffic without any latency, encrypt the signal itself, exploit only one non- linear interaction, it is energetically efficient with low ecologic footprint, and can be added to current networks without replacing the hardware such as the lasers, the transmitters, the routers, the amplifiers or the receivers. Our method can replace current slow encryption methods or can be added to increase the security of existing systems. In this paper, we elaborate on the theoretical models of the system and how we evaluate the encryption strength with this numerical tools.

Fiber optic sensors; Proceedings of the Meeting, Cannes, France, November 26, 27, 1985

NASA Technical Reports Server (NTRS)

Arditty, Herve J. (Editor); Jeunhomme, Luc B. (Editor)

1986-01-01

The conference presents papers on distributed sensors and sensor networks, signal processing and detection techniques, temperature measurements, chemical sensors, and the measurement of pressure, strain, and displacements. Particular attention is given to optical fiber distributed sensors and sensor networks, tactile sensing in robotics using an optical network and Z-plane techniques, and a spontaneous Raman temperature sensor. Other topics include coherence in optical fiber gyroscopes, a high bandwidth two-phase flow void fraction fiber optic sensor, and a fiber-optic dark-field microbend sensor.

Modified-hybrid optical neural network filter for multiple object recognition within cluttered scenes

NASA Astrophysics Data System (ADS)

Kypraios, Ioannis; Young, Rupert C. D.; Chatwin, Chris R.

2009-08-01

Motivated by the non-linear interpolation and generalization abilities of the hybrid optical neural network filter between the reference and non-reference images of the true-class object we designed the modifiedhybrid optical neural network filter. We applied an optical mask to the hybrid optical neural network's filter input. The mask was built with the constant weight connections of a randomly chosen image included in the training set. The resulted design of the modified-hybrid optical neural network filter is optimized for performing best in cluttered scenes of the true-class object. Due to the shift invariance properties inherited by its correlator unit the filter can accommodate multiple objects of the same class to be detected within an input cluttered image. Additionally, the architecture of the neural network unit of the general hybrid optical neural network filter allows the recognition of multiple objects of different classes within the input cluttered image by modifying the output layer of the unit. We test the modified-hybrid optical neural network filter for multiple objects of the same and of different classes' recognition within cluttered input images and video sequences of cluttered scenes. The filter is shown to exhibit with a single pass over the input data simultaneously out-of-plane rotation, shift invariance and good clutter tolerance. It is able to successfully detect and classify correctly the true-class objects within background clutter for which there has been no previous training.

Development of optical packet and circuit integrated ring network testbed.

PubMed

Furukawa, Hideaki; Harai, Hiroaki; Miyazawa, Takaya; Shinada, Satoshi; Kawasaki, Wataru; Wada, Naoya

2011-12-12

We developed novel integrated optical packet and circuit switch-node equipment. Compared with our previous equipment, a polarization-independent 4 × 4 semiconductor optical amplifier switch subsystem, gain-controlled optical amplifiers, and one 100 Gbps optical packet transponder and seven 10 Gbps optical path transponders with 10 Gigabit Ethernet (10GbE) client-interfaces were newly installed in the present system. The switch and amplifiers can provide more stable operation without equipment adjustments for the frequent polarization-rotations and dynamic packet-rate changes of optical packets. We constructed an optical packet and circuit integrated ring network testbed consisting of two switch nodes for accelerating network development, and we demonstrated 66 km fiber transmission and switching operation of multiplexed 14-wavelength 10 Gbps optical paths and 100 Gbps optical packets encapsulating 10GbE frames. Error-free (frame error rate < 1×10(-4)) operation was achieved with optical packets of various packet lengths and packet rates, and stable operation of the network testbed was confirmed. In addition, 4K uncompressed video streaming over OPS links was successfully demonstrated. © 2011 Optical Society of America

Optical Passive Sensor Calibration for Satellite Remote Sensing and the Legacy of NOAA and NIST Cooperation

PubMed Central

Datla, Raju; Weinreb, Michael; Rice, Joseph; Johnson, B. Carol; Shirley, Eric; Cao, Changyong

2014-01-01

This paper traces the cooperative efforts of scientists at the National Oceanic and Atmospheric Administration (NOAA) and the National Institute of Standards and Technology (NIST) to improve the calibration of operational satellite sensors for remote sensing of the Earth’s land, atmosphere and oceans. It gives a chronological perspective of the NOAA satellite program and the interactions between the two agencies’ scientists to address pre-launch calibration and issues of sensor performance on orbit. The drive to improve accuracy of measurements has had a new impetus in recent years because of the need for improved weather prediction and climate monitoring. The highlights of this cooperation and strategies to achieve SI-traceability and improve accuracy for optical satellite sensor data are summarized1. PMID:26601030

Optical Passive Sensor Calibration for Satellite Remote Sensing and the Legacy of NOAA and NIST Cooperation.

PubMed

Datla, Raju; Weinreb, Michael; Rice, Joseph; Johnson, B Carol; Shirley, Eric; Cao, Changyong

2014-01-01

This paper traces the cooperative efforts of scientists at the National Oceanic and Atmospheric Administration (NOAA) and the National Institute of Standards and Technology (NIST) to improve the calibration of operational satellite sensors for remote sensing of the Earth's land, atmosphere and oceans. It gives a chronological perspective of the NOAA satellite program and the interactions between the two agencies' scientists to address pre-launch calibration and issues of sensor performance on orbit. The drive to improve accuracy of measurements has had a new impetus in recent years because of the need for improved weather prediction and climate monitoring. The highlights of this cooperation and strategies to achieve SI-traceability and improve accuracy for optical satellite sensor data are summarized.

Cooperative system and method using mobile robots for testing a cooperative search controller

DOEpatents

Byrne, Raymond H.; Harrington, John J.; Eskridge, Steven E.; Hurtado, John E.

2002-01-01

A test system for testing a controller provides a way to use large numbers of miniature mobile robots to test a cooperative search controller in a test area, where each mobile robot has a sensor, a communication device, a processor, and a memory. A method of using a test system provides a way for testing a cooperative search controller using multiple robots sharing information and communicating over a communication network.

Photonic band gap materials: towards an all-optical transistor

NASA Astrophysics Data System (ADS)

Florescu, Marian

2002-05-01

The transmission of information as optical signals encoded on light waves traveling through optical fibers and optical networks is increasingly moving to shorter and shorter distance scales. In the near future, optical networking is poised to supersede conventional transmission over electric wires and electronic networks for computer-to-computer communications, chip-to-chip communications, and even on-chip communications. The ever-increasing demand for faster and more reliable devices to process the optical signals offers new opportunities in developing all-optical signal processing systems (systems in which one optical signal controls another, thereby adding "intelligence" to the optical networks). All-optical switches, two-state and many-state all-optical memories, all-optical limiters, all-optical discriminators and all-optical transistors are only a few of the many devices proposed during the last two decades. The "all-optical" label is commonly used to distinguish the devices that do not involve dissipative electronic transport and require essentially no electrical communication of information. The all-optical transistor action was first observed in the context of optical bistability [1] and consists in a strong differential gain regime, in which, for small variations in the input intensity, the output intensity has a very strong variation. This analog operation is for all-optical input what transistor action is for electrical inputs.

Neural-network-directed alignment of optical systems using the laser-beam spatial filter as an example

NASA Technical Reports Server (NTRS)

Decker, Arthur J.; Krasowski, Michael J.; Weiland, Kenneth E.

1993-01-01

This report describes an effort at NASA Lewis Research Center to use artificial neural networks to automate the alignment and control of optical measurement systems. Specifically, it addresses the use of commercially available neural network software and hardware to direct alignments of the common laser-beam-smoothing spatial filter. The report presents a general approach for designing alignment records and combining these into training sets to teach optical alignment functions to neural networks and discusses the use of these training sets to train several types of neural networks. Neural network configurations used include the adaptive resonance network, the back-propagation-trained network, and the counter-propagation network. This work shows that neural networks can be used to produce robust sequencers. These sequencers can learn by example to execute the step-by-step procedures of optical alignment and also can learn adaptively to correct for environmentally induced misalignment. The long-range objective is to use neural networks to automate the alignment and operation of optical measurement systems in remote, harsh, or dangerous aerospace environments. This work also shows that when neural networks are trained by a human operator, training sets should be recorded, training should be executed, and testing should be done in a manner that does not depend on intellectual judgments of the human operator.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-02-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks.

On-Board Fiber-Optic Network Architectures for Radar and Avionics Signal Distribution

NASA Technical Reports Server (NTRS)

Alam, Mohammad F.; Atiquzzaman, Mohammed; Duncan, Bradley B.; Nguyen, Hung; Kunath, Richard

2000-01-01

Continued progress in both civil and military avionics applications is overstressing the capabilities of existing radio-frequency (RF) communication networks based on coaxial cables on board modem aircrafts. Future avionics systems will require high-bandwidth on- board communication links that are lightweight, immune to electromagnetic interference, and highly reliable. Fiber optic communication technology can meet all these challenges in a cost-effective manner. Recently, digital fiber-optic communication systems, where a fiber-optic network acts like a local area network (LAN) for digital data communications, have become a topic of extensive research and development. Although a fiber-optic system can be designed to transport radio-frequency (RF) signals, the digital fiber-optic systems under development today are not capable of transporting microwave and millimeter-wave RF signals used in radar and avionics systems on board an aircraft. Recent advances in fiber optic technology, especially wavelength division multiplexing (WDM), has opened a number of possibilities for designing on-board fiber optic networks, including all-optical networks for radar and avionics RF signal distribution. In this paper, we investigate a number of different novel approaches for fiber-optic transmission of on-board VHF and UHF RF signals using commercial off-the-shelf (COTS) components. The relative merits and demerits of each architecture are discussed, and the suitability of each architecture for particular applications is pointed out. All-optical approaches show better performance than other traditional approaches in terms of signal-to-noise ratio, power consumption, and weight requirements.

Mining Learning Social Networks for Cooperative Learning with Appropriate Learning Partners in a Problem-Based Learning Environment

ERIC Educational Resources Information Center

Chen, Chih-Ming; Chang, Chia-Cheng

2014-01-01

Many studies have identified web-based cooperative learning as an increasingly popular educational paradigm with potential to increase learner satisfaction and interactions. However, peer-to-peer interaction often suffers barriers owing to a failure to explore useful social interaction information in web-based cooperative learning environments.…

Cooperative processing data bases

NASA Technical Reports Server (NTRS)

Hasta, Juzar

1991-01-01

Cooperative processing for the 1990's using client-server technology is addressed. The main theme is concepts of downsizing from mainframes and minicomputers to workstations on a local area network (LAN). This document is presented in view graph form.

Optical protocols for terabit networks

NASA Technical Reports Server (NTRS)

Chua, P. L.; Lambert, J. L.; Morookian, J. M.; Bergman, L. A.

1991-01-01

This paper describes a new fiber-optic local area network technology providing 100X improvement over current technology, has full crossbar funtionality, and inherent data security. Based on optical code-division multiple access (CDMA), using spectral phase encoding/decoding of optical pulses, networking protocols are implemented entirely in the optical domain and thus conventional networking bottlenecks are avoided. Component and system issues for a proof-of-concept demonstration are discussed, as well as issues for a more practical and commercially exploitable system. Possible terrestrial and aerospace applications of this technology, and its impact on other technologies are explored. Some initial results toward realization of this concept are also included.

Application of the device based on chirping of optical impulses for management of software-defined networks in dynamic mode

NASA Astrophysics Data System (ADS)

Vinogradova, Irina L.; Khasansin, Vadim R.; Andrianova, Anna V.; Yantilina, Liliya Z.; Vinogradov, Sergey L.

2016-03-01

The analysis of the influence of the physical layer concepts in optical networks on the performance of the whole network. It is concluded that the relevance of the search for new means of transmitting information on a physical level. It is proposed to use an optical chirp overhead transmission between controllers SDN. This article is devoted to research of a creation opportunity of optical neural switchboards controlled in addition by submitted optical radiation. It is supposed, that the managing radiation changes a parameter of refraction of optical environment of the device, and with it and length of a wave of information radiation. For the control by last is used multibeam interferometer. The brief estimation of technical aspects of construction of the device is carried out. The principle of using the device to an extensive network. Simulation of network performance parameters.

The co-evolution of networks and prisoner’s dilemma game by considering sensitivity and visibility

NASA Astrophysics Data System (ADS)

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H. Eugene

2017-03-01

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual’s connection, we explore how sensitivity and visibility affect the prisoner’s dilemma game. The so-called ‘sensitivity’ and ‘visibility’ respectively present one’s self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes.

The co-evolution of networks and prisoner's dilemma game by considering sensitivity and visibility.

PubMed

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H Eugene

2017-03-24

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual's connection, we explore how sensitivity and visibility affect the prisoner's dilemma game. The so-called 'sensitivity' and 'visibility' respectively present one's self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes.

The co-evolution of networks and prisoner’s dilemma game by considering sensitivity and visibility

PubMed Central

Li, Dandan; Ma, Jing; Han, Dun; Sun, Mei; Tian, Lixin; Stanley, H. Eugene

2017-01-01

Strategies adopted by individuals in a social network significantly impact the network, and they strongly affect relationships between individuals in the network. Links between individuals also heavily influence their levels of cooperation. Taking into account the evolution of each individual’s connection, we explore how sensitivity and visibility affect the prisoner’s dilemma game. The so-called ‘sensitivity’ and ‘visibility’ respectively present one’s self-protection consciousness and the ability of gaining information. We find that at moderate levels of player sensitivity cooperative behavior increases, but that at high levels it is inhibited. We also find that the heterogeneity of the weight of individuals at the end of the game is higher when sensitivity and visibility are increased, but that the successful-defection-payoff has less impact on the weight of individuals and on the relationship between the heterogeneity of the weight of individuals and the density of cooperators. This framework can be used to clarify the interaction mechanism between the micro-level of individual behavior and the macro-level of individual co-evolutionary processes. PMID:28338070

Dilemma solving by the coevolution of networks and strategy in a 2 x 2 game.

PubMed

Tanimoto, Jun

2007-08-01

A 2 x 2 game model implemented by a coevolution mechanism of both networks and strategy, inspired by the work of Zimmermann and Eguiluz [Phys. Rev. E72, 056118 (2005)] is established. Network adaptation is the manner in which an existing link between two agents is destroyed and how a new one is established to replace it. The strategy is defined as whether an agent offers cooperation (C) or defection (D) . Both the networks and strategy are synchronously renovated in a simulation time step. A series of numerical experiments, considering various 2 x 2 game structures, reveals that the proposed coevolution mechanism can solve dilemmas in several game classes. The effect of solving a dilemma means mutual-cooperation reciprocity (R reciprocity), which is brought about by emerging several cooperative hub agents who have plenty of links. This effect can be primarily observed in game classes of the prisoner's dilemma and stag hunt. The coevolution mechanism, however, seems counterproductive for game classes of leader and hero, where the alternating reciprocity (ST reciprocity) is meaningful.

SWARMs Ontology: A Common Information Model for the Cooperation of Underwater Robots.

PubMed

Li, Xin; Bilbao, Sonia; Martín-Wanton, Tamara; Bastos, Joaquim; Rodriguez, Jonathan

2017-03-11

In order to facilitate cooperation between underwater robots, it is a must for robots to exchange information with unambiguous meaning. However, heterogeneity, existing in information pertaining to different robots, is a major obstruction. Therefore, this paper presents a networked ontology, named the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) ontology, to address information heterogeneity and enable robots to have the same understanding of exchanged information. The SWARMs ontology uses a core ontology to interrelate a set of domain-specific ontologies, including the mission and planning, the robotic vehicle, the communication and networking, and the environment recognition and sensing ontology. In addition, the SWARMs ontology utilizes ontology constructs defined in the PR-OWL ontology to annotate context uncertainty based on the Multi-Entity Bayesian Network (MEBN) theory. Thus, the SWARMs ontology can provide both a formal specification for information that is necessarily exchanged between robots and a command and control entity, and also support for uncertainty reasoning. A scenario on chemical pollution monitoring is described and used to showcase how the SWARMs ontology can be instantiated, be extended, represent context uncertainty, and support uncertainty reasoning.

Initial Characterization of Optical Communications with Disruption-Tolerant Network Protocols

NASA Technical Reports Server (NTRS)

Schoolcraft, Joshua; Wilson, Keith

2011-01-01

Disruption-tolerant networks (DTNs) are groups of network assets connected with a suite of communication protocol technologies designed to mitigate the effects of link delay and disruption. Application of DTN protocols to diverse groups of network resources in multiple sub-networks results in an overlay network-of-networks with autonomous data routing capability. In space environments where delay or disruption is expected, performance of this type of architecture (such as an interplanetary internet) can increase with the inclusion of new communications mediums and techniques. Space-based optical communication links are therefore an excellent building block of space DTN architectures. When compared to traditional radio frequency (RF) communications, optical systems can provide extremely power-efficient and high bandwidth links bridging sub-networks. Because optical links are more susceptible to link disruption and experience the same light-speed delays as RF, optical-enabled DTN architectures can lessen potential drawbacks and maintain the benefits of autonomous optical communications over deep space distances. These environment-driven expectations - link delay and interruption, along with asymmetric data rates - are the purpose of the proof-of-concept experiment outlined herein. In recognizing the potential of these two technologies, we report an initial experiment and characterization of the performance of a DTN-enabled space optical link. The experiment design employs a point-to-point free-space optical link configured to have asymmetric bandwidth. This link connects two networked systems running a DTN protocol implementation designed and written at JPL for use on spacecraft, and further configured for higher bandwidth performance. Comparing baseline data transmission metrics with and without periodic optical link interruptions, the experiment confirmed the DTN protocols' ability to handle real-world unexpected link outages while maintaining capability of reliably delivering data at relatively high rates. Finally, performance characterizations from this data suggest performance optimizations to configuration and protocols for future optical-specific DTN space link scenarios.

The Challenges and Opportunities for International Cooperative Radio Science; Experience with Mars Express and Venus Express Missions

NASA Technical Reports Server (NTRS)

Holmes, Dwight P.; Thompson, Tommy; Simpson, Richard; Tyler, G. Leonard; Dehant, Veronique; Rosenblatt, Pascal; Hausler, Bernd; Patzold, Martin; Goltz, Gene; Kahan, Daniel;

Reconfigurable optical multiplexer based on liquid crystals for polymer optical fiber networks

NASA Astrophysics Data System (ADS)

Lallana, P. C.; Vázquez, C.; Pena, J. M. S.; Vergaz, R.

2006-12-01

In this work, different novel 3×1 multiplexer structures for being used in polymer optical fiber networks are proposed. Designs are compact, scalable, and of low consumption, capable of operating in a large wavelength range simultaneously 660, 850, and 1300 nm, due to the use of nematic liquid crystal cells. Light that comes from each input port is handled independently and eight operation modes are possible. Control electronics has been made using a programmable integrated circuit. Electronic system makes available the managing of the optical stage using a computer. An additional four optical sensors have been included for allowing the optical status checking. Finally, a polarization independent multiplexer has been implemented and tested. Insertion losses less than 4 dB and isolation better than 23 dB have been measured. In addition, 30-ms and 15-ms setup and rise times have been obtained. The proposed multiplexer can be used in any polymer optical fiber network, even in perfluorinated graded index one, and it can be specially useful in optical sensor networks, or in coarse wavelength division multiplexing networks.

Introduction and Progress of APOSOS Project

NASA Astrophysics Data System (ADS)

Zhao, You; Gao, P. Q.; Shen, Ming; Chaudhry, Maqbool A.; Guo, Xiaozhong; Teng, D. P.; Yang, Datao; Yu, Huanhuan; Zhao, Zhe

Asia-Pacific Ground-Based Optical Satellite Observation System (APOSOS) project is based on members of Asia-Pacific Space Cooperation Organization (APSCO). Its aim is to develop a regional or even global satellite tracking network basically composed of optical trackers. The system will be used to track objects of interest or space-debris for the safety of spacecraft launch mission or the intactness of operational satellites. The system will benefit from the distribution of APSCO members and multi-national fund support or technical cooperation. Thus APOSOS will have a potential capability to observe all the satellites orbiting earth with high precision but relatively low cost. This paper will present the introduction, progress and current status of APOSOS project, including: System Requirements Definition, System Main Mission, System Goal, System design, Services and Clients, Organization Framework of Observation Center, Major Function of Observation Center, Establishment of Observation Plan, Format Standard for Exchanging Data, Data Policy, Implementation Schedule, etc.. APOSOS will build a unified surveillance network from observational facilities of member states involved, to utilize the wide geographical distribution advantage of multi-country. It will be operated under the coordination of APSCO observation mission management department. (1)APOSOS should conduct observation missions of specific satellites, space-debris or other space objects of interest, based on requirements of member states. APOSOS should fulfill the basic requirement for satellites observation and tracking missions. And it should also have the potential ability of small debris detection to support collision avoidance planning, which can protect the members high valued space assets. (2)In some particular application, APOSOS would be able to be used for long-term tracking of specific space object of interest, and have the ability of data processing and analysis, so as to provide conjunction assessment, collision probability calculation and avoidance planning for space assets. (3)APOSOS should have the capability of publishing information and sharing data among member states, with the ability to deal with user’s requests for data and mange the data in different levels. (4)APOSOS should have the capability of providing services such as technical consultation, training and science popularization.

International linking of research and development on the model of Laser Centre Hanover

NASA Astrophysics Data System (ADS)

Nowitzki, Klaus-Dieter; Boedecker, Olaf

2005-10-01

Asia is becoming one of the most important regions in the world from the political, economic and scientific point of view. Germany believes that it is becoming increasingly necessary to cooperate with certain Asian countries especially for scientific and technological reasons. Above and beyond exchanges of scientists, the scientific and technological cooperation will be organized to cover projects with specific targets and to find solutions to important problems. International economic development is characterized by a mixture of competition and cooperation within the context of growing globalization. Germany, being one of the world's largest exporting nation, must therefore combine its active role in cooperation with these countries in the fields of education, research and innovation with economic cooperation. The Laser Centre Hanover pursues the goal of establishing and operating a Chinese German center for training and further education in laser technology and setting up a joint platform for long-term German Chinese cooperation in laser technology. An optimized training infrastructure combined with modern production processes support consequently long-term German businesses in China and secures their market-shares. LZH establishes Laser academies for skilled workers and technical decision makers in Shanghai and Changchun together with local universities and German partners. Due to the economic growth, Russia records since more than two years, the economic conditions are improving the cooperation between Germany and Russia step-by-step. The main goal of Russian science-politics is to stabilize an efficient scientific-technical potential with better chances in the global competition. The German-Russian scientific and technological cooperation plays an important role in this context. It has considerably increased in the last years in terms of width and depth and virtually includes all areas of science and technology at present. The region around Moscow is regarded as the by far strongest economic region in Russia. The LZH establishes a testing-, education and consulting-center for laser technology, to support Russian SMEs regarding the use of modern laser technology in production. The technology- und innovation transfer process for German laser manufacturers and research institutes in Russia is completed by the establishment of a German-Russian network for optical technologies. Both projects are sponsored by the German Federal Ministry of Education and Research.

77 FR 38833 - Job Accommodation Network

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-29

... DEPARTMENT OF LABOR Job Accommodation Network AGENCY: Office of Disability Employment Policy, Department of Labor. Announcement Type: New Notice of Availability of Funds and Solicitation for Grant... cooperative agreement to manage and operate its Job Accommodation Network (JAN), a national technical...

Building a Unified Information Network.

ERIC Educational Resources Information Center

Avram, Henriette D.

1988-01-01

Discusses cooperative efforts between research organizations and libraries to create a national information network. Topics discussed include the Linked System Project (LSP); technical processing versus reference and research functions; Open Systems Interconnection (OSI) Reference Model; the National Science Foundation Network (NSFNET); and…

Convergence

NASA Astrophysics Data System (ADS)

Darcie, Thomas E.; Doverspike, Robert; Zirngibl, Martin; Korotky, Steven K.

2005-08-01

Call for Papers: Convergence The Journal of Optical Networking (JON) invites submissions to a special issue on Convergence. Convergence has become a popular theme in telecommunications, one that has broad implications across all segments of the industry. Continual evolution of technology and applications continues to erase lines between traditionally separate lines of business, with dramatic consequences for vendors, service providers, and consumers. Spectacular advances in all layers of optical networking-leading to abundant, dynamic, cost-effective, and reliable wide-area and local-area connections-have been essential drivers of this evolution. As services and networks continue to evolve towards some notion of convergence, the continued role of optical networks must be explored. One vision of convergence renders all information in a common packet (especially IP) format. This vision is driven by the proliferation of data services. For example, time-division multiplexed (TDM) voice becomes VoIP. Analog cable-television signals become MPEG bits streamed to digital set-top boxes. T1 or OC-N private lines migrate to Ethernet virtual private networks (VPNs). All these packets coexist peacefully within a single packet-routing methodology built on an optical transport layer that combines the flexibility and cost of data networks with telecom-grade reliability. While this vision is appealing in its simplicity and shared widely, specifics of implementation raise many challenges and differences of opinion. For example, many seek to expand the role of Ethernet in these transport networks, while massive efforts are underway to make traditional TDM networks more data friendly within an evolved but backward-compatible SDH/SONET (synchronous digital hierarchy and synchronous optical network) multiplexing hierarchy. From this common underlying theme follow many specific instantiations. Examples include the convergence at the physical, logical, and operational levels of voice and data, video and data, private-line and virtual private-line, fixed and mobile, and local and long-haul services. These trends have many consequences for consumers, vendors, and carriers. Faced with large volumes of low-margin data traffic mixed with traditional voice services, the need for capital conservation and operational efficiency drives carriers away from today's separate overlay networks for each service and towards "converged" platforms. For example, cable operators require transport of multiple services over both hybrid fiber coax (HFC) and DWDM transport technologies. Local carriers seek an economical architecture to deliver integrated services on optically enabled broadband-access networks. Services over wireless-access networks must coexist with those from wired networks. In each case, convergence of networks and services inspires an important set of questions and challenges, driven by the need for low cost, operational efficiency, service performance requirements, and optical transport technology options. This Feature Issue explores the various interpretations and implications of network convergence pertinent to optical networking. How does convergence affect the evolution of optical transport-layer and control approaches? Are the implied directions consistent with research vision for optical networks? Substantial challenges remain. Papers are solicited across the broad spectrum of interests. These include, but are not limited to: Architecture, design and performance of optical wide-area-network (WAN), metro, and access networks Integration strategies for multiservice transport platforms Access methods that bridge traditional and emerging services Network signaling and control methodologies All-optical packet routing and switching techniques

Convergence

NASA Astrophysics Data System (ADS)

Darcie, Thomas E.; Doverspike, Robert; Zirngibl, Martin; Korotky, Steven K.

2005-06-01

Call for Papers: Convergence The Journal of Optical Networking (JON) invites submissions to a special issue on Convergence. Convergence has become a popular theme in telecommunications, one that has broad implications across all segments of the industry. Continual evolution of technology and applications continues to erase lines between traditionally separate lines of business, with dramatic consequences for vendors, service providers, and consumers. Spectacular advances in all layers of optical networking-leading to abundant, dynamic, cost-effective, and reliable wide-area and local-area connections-have been essential drivers of this evolution. As services and networks continue to evolve towards some notion of convergence, the continued role of optical networks must be explored. One vision of convergence renders all information in a common packet (especially IP) format. This vision is driven by the proliferation of data services. For example, time-division multiplexed (TDM) voice becomes VoIP. Analog cable-television signals become MPEG bits streamed to digital set-top boxes. T1 or OC-N private lines migrate to Ethernet virtual private networks (VPNs). All these packets coexist peacefully within a single packet-routing methodology built on an optical transport layer that combines the flexibility and cost of data networks with telecom-grade reliability. While this vision is appealing in its simplicity and shared widely, specifics of implementation raise many challenges and differences of opinion. For example, many seek to expand the role of Ethernet in these transport networks, while massive efforts are underway to make traditional TDM networks more data friendly within an evolved but backward-compatible SDH/SONET (synchronous digital hierarchy and synchronous optical network) multiplexing hierarchy. From this common underlying theme follow many specific instantiations. Examples include the convergence at the physical, logical, and operational levels of voice and data, video and data, private-line and virtual private-line, fixed and mobile, and local and long-haul services. These trends have many consequences for consumers, vendors, and carriers. Faced with large volumes of low-margin data traffic mixed with traditional voice services, the need for capital conservation and operational efficiency drives carriers away from today's separate overlay networks for each service and towards "converged" platforms. For example, cable operators require transport of multiple services over both hybrid fiber coax (HFC) and DWDM transport technologies. Local carriers seek an economical architecture to deliver integrated services on optically enabled broadband-access networks. Services over wireless-access networks must coexist with those from wired networks. In each case, convergence of networks and services inspires an important set of questions and challenges, driven by the need for low cost, operational efficiency, service performance requirements, and optical transport technology options. This Feature Issue explores the various interpretations and implications of network convergence pertinent to optical networking. How does convergence affect the evolution of optical transport-layer and control approaches? Are the implied directions consistent with research vision for optical networks? Substantial challenges remain. Papers are solicited across the broad spectrum of interests. These include, but are not limited to: Architecture, design and performance of optical wide-area-network (WAN), metro, and access networks Integration strategies for multiservice transport platforms Access methods that bridge traditional and emerging services Network signaling and control methodologies All-optical packet routing and switching techniques