Cooperative Learning for Distributed In-Network Traffic Classification

Science.gov (United States)

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.

On hybrid cooperation in underlay cognitive radio networks

KAUST Repository

Mahmood, Nurul Huda

2012-11-01

In wireless systems where transmitters are subject to a strict received power constraint, such as in underlay cognitive radio networks, cooperative communication is a promising strategy to enhance network performance, as it helps to improve the coverage area and outage performance of a network. However, this comes at the expense of increased resource utilization. To balance the performance gain against the possible over-utilization of resources, we propose a hybrid-cooperation technique for underlay cognitive radio networks, where secondary users cooperate only when required. Various performance measures of the proposed hybrid-cooperation technique are analyzed in this paper, and are also further validated numerically. © 2012 IEEE.

Cooperative Cloudlet for Pervasive Networks

Directory of Open Access Journals (Sweden)

Tauseef Jamal

2017-05-01

Full Text Available The notion of cooperation in wireless communication has got significant attention from both academia and industrial persons towards to address the performance drawbacks of wireless sensor network due to reason of user’s high mobility and lack of resources of network. The future wireless systems should be highly heterogeneous and interconnected because motivating cooperative relaying has to apply on the future mobile network for efficient results and future demand. As currently the mobile computing is facing latency and battery drainage issues which need to address and solve hence in this work we are proposed mobile - centric and opportunistic communication architecture. In this work mobile devices which are in the range of Wi - Fi of each other can create cluste r with each other and can create an ad - hoc cooperative cloud using Relay Spot[1 - 4]. The Collaboration between these devices can enable them to resourcefully use the augmentation without any infrastructure.

Business Networks and Cooperation in International Business Relationships

OpenAIRE

Desirée Blankenburg Holm; Kent Eriksson; Jan Johanson

1996-01-01

Cooperative relationships between firms can be better understood if they are examined in the context of a network of connected business relationships. Based on research on business relationships and business networks, this paper formulates a LISREL model that analyses cooperation in international business relationships between suppliers and customer firms. Theory suggests that cooperation can raise the value of business relationships, and that business network connections have an impact on co...

Cooperative and supportive neural networks

International Nuclear Information System (INIS)

Sree Hari Rao, V.; Raja Sekhara Rao, P.

2007-01-01

This Letter deals with the concepts of co-operation and support among neurons existing in a network which contribute to their collective capabilities and distributed operations. Activational dynamical properties of these networks are discussed

Co-Operative Learning and Development Networks.

Science.gov (United States)

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…

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

Science.gov (United States)

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.

Cooperative networking in a heterogeneous wireless medium

CERN Document Server

Ismail, Muhammad

2013-01-01

This brief focuses on radio resource allocation in a heterogeneous wireless medium. It presents radio resource allocation algorithms with decentralized implementation, which support both single-network and multi-homing services. The brief provides a set of cooperative networking algorithms, which rely on the concepts of short-term call traffic load prediction, network cooperation, convex optimization, and decomposition theory. In the proposed solutions, mobile terminals play an active role in the resource allocation operation, instead of their traditional role as passive service recipients in the networking environment.

Factors that influence cooperation in networks for innovation and learning

NARCIS (Netherlands)

Sie, Rory; Bitter-Rijpkema, Marlies; Stoyanov, Slavi; Sloep, Peter

2018-01-01

Networked cooperation fails if the available partnerships remain opaque. A literature review and Delphi study uncovered the elements of a fruitful partnership. They relate to personality, diversity, cooperation, and management. Innovation networks and learning networks share the same cooperative

Cooperation and Development: a study of case in network cooperation

Directory of Open Access Journals (Sweden)

June Alisson Westarb Cruz

2009-03-01

Full Text Available The need to develop new surviving strategies and competitive advantage by individuals and organizations make cooperation to obtain complementary competences and potentialities very important, through the insertion of social actors in multiple networks of relationships and interactions.  This research was made in an Association Network of Carrinheiros[1] located in Curitiba and in the coast of Paraná.  The objective of the study was to analyze the structural characteristics of the network and its implications to develop collective actions. The data was collected through questionnaires, interviews, document analysis, and the daily direct observation of the network.  An interaction system between individuals and organizations from various sectors in society could be verified. This interaction stimulates the structured work connected to associations and cooperatives.  Between the actors of the network, concepts and realities are different, as well as individual objectives are distinct.  However, they converge to a common general objective that establish a common base for collaborative work.

The Evolution of Reputation-Based Cooperation in Regular Networks

Directory of Open Access Journals (Sweden)

Tatsuya Sasaki

2017-01-01

Full Text Available Despite recent advances in reputation technologies, it is not clear how reputation systems can affect human cooperation in social networks. Although it is known that two of the major mechanisms in the evolution of cooperation are spatial selection and reputation-based reciprocity, theoretical study of the interplay between both mechanisms remains almost uncharted. Here, we present a new individual-based model for the evolution of reciprocal cooperation between reputation and networks. We comparatively analyze four of the leading moral assessment rules—shunning, image scoring, stern judging, and simple standing—and base the model on the giving game in regular networks for Cooperators, Defectors, and Discriminators. Discriminators rely on a proper moral assessment rule. By using individual-based models, we show that the four assessment rules are differently characterized in terms of how cooperation evolves, depending on the benefit-to-cost ratio, the network-node degree, and the observation and error conditions. Our findings show that the most tolerant rule—simple standing—is the most robust among the four assessment rules in promoting cooperation in regular networks.

Custom Ontologies for Expanded Network Analysis

Science.gov (United States)

2006-12-01

for Expanded Network Analysis. In Visualising Network Information (pp. 6-1 – 6-10). Meeting Proceedings RTO-MP-IST-063, Paper 6. Neuilly-sur-Seine...Even to this day, current research groups are working to develop an approach that involves taking all available text, video, imagery and audio and

How mutation alters the evolutionary dynamics of cooperation on networks

Science.gov (United States)

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.

Network public goods with asymmetric information about cooperation preferences and network degree

NARCIS (Netherlands)

Dijkstra, Jacob; van Assen, Marcus

2013-01-01

We propose a game theoretical model of one-shot network public goods formalizing the 'closure argument' that cooperation is more frequent in denser groups or networks. Equilibrium analyses show that (i) an 'inefficiency problem' exists: players all preferring mutual cooperation need not all

A User Cooperation Stimulating Strategy Based on Cooperative Game Theory in Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Ping Zhang

2009-01-01

Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including “what is each node's best reaction to maximize its utility?” and “what is the optimal reimbursement to encourage cooperation?” Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.

A User Cooperation Stimulating Strategy Based on Cooperative Game Theory in Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Jiang Fan

2009-01-01

Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including "what is each node's best reaction to maximize its utility?" and "what is the optimal reimbursement to encourage cooperation?" Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.

Critical cooperation range to improve spatial network robustness.

Directory of Open Access Journals (Sweden)

Vitor H P Louzada

Full Text Available A robust worldwide air-transportation network (WAN is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed.

Coevolution of network structure and cooperation in the public goods game

International Nuclear Information System (INIS)

Wang Lei; Xia Chengyi; Wang Juan

2013-01-01

Recently, the emergence of cooperation has become a central topic in the evolutionary game field, and coevolution of game dynamics and network topology structure can give us a fresh viewpoint of how the network evolves and cooperation arises. In this paper, we show in detail a picture of the co-evolutionary behaviors between the microscopic structure of the network and cooperation promotion in the public goods game (PGG). Based on a mechanism named after evolutionary preferential attachment (EPA), in which the growth of the network depends on the outcome of PGG dynamics, we explore the structural properties of networks and cooperative behaviors taking place on the networks created by EPA rules. Extensive simulation results indicate that the structure of the resulting networks displays a transition from homogeneous to heterogeneous properties as the selection strength ϵ increases, and the cooperative behaviors have a non-trivial state in which cooperators and defectors can simultaneously occupy the hub nodes in the network. Current results are of interest for us to further understand the cooperation persistence and structure evolution in many natural, social and economical systems. (paper)

A versatile framework for cooperative hub network development

NARCIS (Netherlands)

Cruijssen, F.C.A.M.; Borm, P.; Dullaert, W.; Hamers, H.

2010-01-01

This paper introduces a framework for cooperative hub network development. Building a joint physical hub for the transshipment of goods is expensive and, therefore, involves considerable risks for cooperating companies. In a practical setting, it is unlikely that an entire network will be built at

A versatile framework for cooperative hub network development

NARCIS (Netherlands)

Cruijssen, Frans; Borm, Peter; Dullaert, Wout; Hamers, Herbert

This paper introduces a framework for cooperative hub network development. Building a joint physical hub for the transshipment of goods is expensive and, therefore, involves considerable risks for cooperating companies. In a practical setting, it is unlikely that an entire network will be built at

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

Directory of Open Access Journals (Sweden)

Siddharth Suri

Full Text Available A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.

Coevolution of Cooperation and Layer Selection Strategy in Multiplex Networks

Directory of Open Access Journals (Sweden)

Katsuki Hayashi

2016-11-01

Full Text Available Recently, the emergent dynamics in multiplex networks, composed of layers of multiple networks, has been discussed extensively in network sciences. However, little is still known about whether and how the evolution of strategy for selecting a layer to participate in can contribute to the emergence of cooperative behaviors in multiplex networks of social interactions. To investigate these issues, we constructed a coevolutionary model of cooperation and layer selection strategies in which each an individual selects one layer from multiple layers of social networks and plays the Prisoner’s Dilemma with neighbors in the selected layer. We found that the proportion of cooperative strategies increased with increasing the number of layers regardless of the degree of dilemma, and this increase occurred due to a cyclic coevolution process of game strategies and layer selection strategies. We also showed that the heterogeneity of links among layers is a key factor for multiplex networks to facilitate the evolution of cooperation, and such positive effects on cooperation were observed regardless of the difference in the stochastic properties of network topologies.

Mutually cooperative epidemics on power-law networks

Science.gov (United States)

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.

Network flow of mobile agents enhances the evolution of cooperation

Science.gov (United States)

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.

Evolution of cooperation under social pressure in multiplex networks.

Science.gov (United States)

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 Diversity in Wireless Networks

Directory of Open Access Journals (Sweden)

A. Mahmood

2010-01-01

Full Text Available Transmit Diversity is an effective methodology for improving the quality and reliability of a wireless network by reducingthe effects of fading. As majority of the wireless devices (i.e. mobile handsets, etc are limited to only one antenna, especiallydue to hardware constraints, size and cost factors; cooperative communication can be utilized in order to generatetransmit diversity [1]. This enables single antenna wireless devices to share their antennas during transmission in such amanner that creates a virtual MIMO (multiple-input and multiple-output system [2] [3]. In this paper, we will analyze therecent developments and trends in this promising area of wireless Ad hoc networks. The article will also discuss variousmain cooperative signaling methods and will also observe their performance.

Future cooperative communication systems driven by social mobile networks

DEFF Research Database (Denmark)

Blázovics, L.; Varga, C.; Bamford, W.

2011-01-01

In this work we are underlining the importance of social mobile networks for upcoming cooperative communication systems. The assumption of this work is that future mobile communication systems will incorporate user cooperation, i.e. a combination of cellular access in parallel with ongoing short...... cases. By the example of the Gedda-Headz gaming community, possible links between cooperative mobile communication and social mobile networks are shown....

Effect of initial fraction of cooperators on cooperative behavior in evolutionary prisoner's dilemma game.

Directory of Open Access Journals (Sweden)

Keizo Shigaki

Full Text Available We investigate the influence of initial fraction of cooperators on the evolution of cooperation in spatial prisoner's dilemma games. Compared with the results of heterogeneous networks, we find that there is a relatively low initial fraction of cooperators to guarantee higher equilibrium cooperative level. While this interesting phenomenon is contrary to the commonly shared knowledge that higher initial fraction of cooperators can provide better environment for the evolution of cooperation. To support our outcome, we explore the time courses of cooperation and find that the whole course can be divided into two sequent stages: enduring (END and expanding (EXP periods. At the end of END period, thought there is a limited number of cooperator clusters left for the case of low initial setup, these clusters can smoothly expand to hold the whole system in the EXP period. However, for high initial fraction of cooperators, superfluous cooperator clusters hinder their effective expansion, which induces many remaining defectors surrounding the cooperator clusters. Moreover, through intensive analysis, we also demonstrate that when the tendency of three cooperation cluster characteristics (cluster size, cluster number and cluster shape are consistent within END and EXP periods, the state that maximizes cooperation can be favored.

Cooperative water network system to reduce carbon footprint.

Science.gov (United States)

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.

Relay Selection for Cooperative Relaying in Wireless Energy Harvesting Networks

Science.gov (United States)

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.

Cooperative Handover Management in Dense Cellular Networks

KAUST Repository

Arshad, Rabe; Elsawy, Hesham; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2017-01-01

Network densification has always been an important factor to cope with the ever increasing capacity demand. Deploying more base stations (BSs) improves the spatial frequency utilization, which increases the network capacity. However, such improvement comes at the expense of shrinking the BSs' footprints, which increases the handover (HO) rate and may diminish the foreseen capacity gains. In this paper, we propose a cooperative HO management scheme to mitigate the HO effect on throughput gains achieved via cellular network densification. The proposed HO scheme relies on skipping HO to the nearest BS at some instances along the user's trajectory while enabling cooperative BS service during HO execution at other instances. To this end, we develop a mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of coverage probability and user throughput. The results show that the proposed cooperative HO scheme outperforms the always best connected based association at high mobility. Also, the value of BS cooperation along with handover skipping is quantified with respect to the HO skipping only that has recently appeared in the literature. Particularly, the proposed cooperative HO scheme shows throughput gains of 12% to 27% and 17% on average, when compared to the always best connected and HO skipping only schemes at user velocity ranging from 80 km/h to 160 Km/h, respectively.

Cooperative Handover Management in Dense Cellular Networks

KAUST Repository

Arshad, Rabe

2017-02-07

Network densification has always been an important factor to cope with the ever increasing capacity demand. Deploying more base stations (BSs) improves the spatial frequency utilization, which increases the network capacity. However, such improvement comes at the expense of shrinking the BSs\\' footprints, which increases the handover (HO) rate and may diminish the foreseen capacity gains. In this paper, we propose a cooperative HO management scheme to mitigate the HO effect on throughput gains achieved via cellular network densification. The proposed HO scheme relies on skipping HO to the nearest BS at some instances along the user\\'s trajectory while enabling cooperative BS service during HO execution at other instances. To this end, we develop a mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of coverage probability and user throughput. The results show that the proposed cooperative HO scheme outperforms the always best connected based association at high mobility. Also, the value of BS cooperation along with handover skipping is quantified with respect to the HO skipping only that has recently appeared in the literature. Particularly, the proposed cooperative HO scheme shows throughput gains of 12% to 27% and 17% on average, when compared to the always best connected and HO skipping only schemes at user velocity ranging from 80 km/h to 160 Km/h, respectively.

Evolution of Cooperation in Adaptive Social Networks

Science.gov (United States)

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.

Correct integration of compressors and expanders in above ambient heat exchanger networks

International Nuclear Information System (INIS)

Fu, Chao; Gundersen, Truls

2016-01-01

The Appropriate Placement concept (also referred to as Correct Integration) is fundamental in Pinch Analysis. The placement of reactors, distillation columns, evaporators, heat pumps and heat engines in heat exchanger networks is well established. The placement of pressure changing equipment such as compressors and expanders is complex and less discussed in literature. A major difficulty is that both heat and work (not only heat) are involved. The integration of compressors and expanders separately into heat exchanger networks was recently investigated. A set of theorems were proposed for assisting the design. The problem is even more complex when both compressors and expanders are to be integrated. An important concern is about the sequence of integration with compressors and expanders, i.e. should compressors or expanders be implemented first. This problem is studied and a new theorem is formulated related to the Correct Integration of both compressors and expanders in above ambient heat exchanger networks. The objective is to minimize exergy consumption for the integrated processes. A graphical design methodology is developed for the integration of compressors and expanders into heat exchanger networks above ambient temperature. - Highlights: • The correct integration of compressors and expanders in heat exchanger networks is studied. • A theorem is proposed for heat integration between compressors and expanders. • The total exergy consumption is minimized.

Age structure and cooperation in coevolutionary games on dynamic network

Science.gov (United States)

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.

Probabilistic interconnection between interdependent networks promotes cooperation in the public goods game

International Nuclear Information System (INIS)

Wang, Baokui; Chen, Xiaojie; Wang, Long

2012-01-01

Most previous works study the evolution of cooperation in a structured population by commonly employing an isolated single network. However, realistic systems are composed of many interdependent networks coupled with each other, rather than an isolated single one. In this paper, we consider a system including two interacting networks with the same size, entangled with each other by the introduction of probabilistic interconnections. We introduce the public goods game into such a system, and study how the probabilistic interconnection influences the evolution of cooperation of the whole system and the coupling effect between two layers of interdependent networks. Simulation results show that there exists an intermediate region of interconnection probability leading to the maximum cooperation level in the whole system. Interestingly, we find that at the optimal interconnection probability the fraction of internal links between cooperators in two layers is maximal. Also, even if initially there are no cooperators in one layer of interdependent networks, cooperation can still be promoted by probabilistic interconnection, and the cooperation levels in both layers can more easily reach an agreement at the intermediate interconnection probability. Our results may be helpful in understanding cooperative behavior in some realistic interdependent networks and thus highlight the importance of probabilistic interconnection on the evolution of cooperation. (paper)

Cooperative epidemics on multiplex networks

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

Fu Feng; Chen Xiaojie; Liu Lianghuan; Wang Long

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

Evolution of Cooperation in Social Dilemmas on Complex Networks

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Jeungeun Song

2018-01-01

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

Application and Implementation of Network Coding for Cooperative Wireless Networks

DEFF Research Database (Denmark)

Pedersen, Morten Videbæk

2012-01-01

the initial development of systems and protocols and show that the potential is there. However, I also find that network coding needs to be implemented with care and protocols have to be designed with consideration to make use of this novel technique. 2) The final aspect of this PhD investigates different...... ways that cooperative models may be implemented to cover a wide range of applications. This addresses the development of user cooperative protocols and how we in Device To Device (D2D) communication may reward users that contribute more to the network than they gain. In this area I suggest the use...

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

Science.gov (United States)

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

The cooperative game theory of networks and hierarchies

CERN Document Server

Gilles, Robert P

2010-01-01

This book details standard concepts in cooperative game theory with applications to the analysis of social networks and hierarchical authority organizations. It covers the multi-linear extension, the Core, the Shapley value, and the cooperative potential.

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

Energy Technology Data Exchange (ETDEWEB)

Fu Feng [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: fufeng@pku.edu.cn; Chen Xiaojie; Liu Lianghuan [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China); Wang Long [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: longwang@pku.edu.cn

2007-11-05

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.

Configuration of Wireless Cooperative/Sensor Networks

National Research Council Canada - National Science Library

Shafiee, Hamid R; Maham, B; Vazifehdan, J

2008-01-01

.... When employing more than one antenna at each node of a wireless network is not applicable, cooperation diversity protocols exploit the inherent spatial diversity of relay channels by allowing mobile...

Protocol design and analysis for cooperative wireless networks

CERN Document Server

Song, Wei; Jin, A-Long

2017-01-01

This book focuses on the design and analysis of protocols for cooperative wireless networks, especially at the medium access control (MAC) layer and for crosslayer design between the MAC layer and the physical layer. It highlights two main points that are often neglected in other books: energy-efficiency and spatial random distribution of wireless devices. Effective methods in stochastic geometry for the design and analysis of wireless networks are also explored. After providing a comprehensive review of existing studies in the literature, the authors point out the challenges that are worth further investigation. Then, they introduce several novel solutions for cooperative wireless network protocols that reduce energy consumption and address spatial random distribution of wireless nodes. For each solution, the book offers a clear system model and problem formulation, details of the proposed cooperative schemes, comprehensive performance analysis, and extensive numerical and simulation results that validate th...

Cooperation Dynamics on Mobile Crowd Networks of Device-to-Device Communications

Directory of Open Access Journals (Sweden)

Yong Deng

2016-01-01

Full Text Available The explosive use of smart devices enabled the emergence of collective resource sharing among mobile individuals. Mobile users need to cooperate with each other to improve the whole network’s quality of service. By modeling the cooperative behaviors in a mobile crowd into an evolutionary Prisoner’s dilemma game, we investigate the relationships between cooperation rate and some main influence factors, including crowd density, communication range, temptation to defect, and mobility attributes. Using evolutionary game theory, our analysis on the cooperative behaviors of mobile takes a deep insight into the cooperation promotion in a dynamical network with selfish autonomous users. The experiment results show that mobile user’s features, including speed, moving probability, and reaction radius, have an obvious influence on the formation of a cooperative mobile social network. We also found some optimal status when the crowd’s cooperation rate reaches the best. These findings are important if we want to establish a mobile social network with a good performance.

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

Science.gov (United States)

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.

A network traffic reduction method for cooperative positioning

NARCIS (Netherlands)

Das, Kallol; Wymeersch, Henk

Cooperative positioning is suitable for applications where conventional positioning fails due to lack of connectivity with a sufficient number of reference nodes. In a dense network, as the number of cooperating devices increases, the number of packet exchanges also increases proportionally. This

NCI’s Cooperative Human Tissue Network

Science.gov (United States)

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.

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

Science.gov (United States)

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.

Network Coding for Backhaul Offloading in D2D Cooperative Fog Data Networks

Directory of Open Access Journals (Sweden)

Ben Quinton

2018-01-01

Full Text Available Future distributed data networks are expected to be assisted by users cooperation and coding schemes. Given the explosive increase in the end-users’ demand for download of the content from the servers, in this paper, the implementation of instantly decodable network coding (IDNC is considered in full-duplex device-to-device (D2D cooperative fog data networks. In particular, this paper is concerned with designing efficient transmission schemes to offload traffic from the expensive backhaul of network servers by employing IDNC and users cooperation. The generalized framework where users send request for multiple packets and the transmissions are subject to erasure is considered. The optimal problem formulation is presented using the stochastic shortest path (SSP technique over the IDNC graph with induced subgraphs. However, as the optimal solution suffers from the intractability of being NP-hard, it is not suitable for real-time communications. The complexity of the problem is addressed by presenting a greedy heuristic algorithm used over the proposed graph model. The paper shows that by implementing IDNC in a full-duplex cooperative D2D network model significant reduction in the number of downloads required from the servers can be achieved, which will result in offloading of the backhaul servers and thus saving valuable servers’ resources. It is also shown that the performance of the proposed heuristic algorithm is very close to the optimal solution with much lower computational complexity.

Analysis of Trends in Cooperative Network Patterns for KAERI Researchers

International Nuclear Information System (INIS)

Chun, Young Choon; Lee, Hyun Soo

2016-01-01

There has been a trend toward faster results of research and accelerating inter-disciplinary convergence, under constraints in available resources. Under such reality, national and international cooperation with inter-sectoral research on science-technology-industry is becoming inevitable as a strategic approach for enhancing competitive edge on global dimension. This study gives an analysis on the cooperative network in nuclear research which bears multi-disciplinary technical feature. The study aims to visualize the cooperative network of KAERI(Korea Atomic Energy Research Institute) researchers, as the hub of the network, including academics and industry, with a view to provide insight on strengthening the cooperative network in nuclear research. This study accounted for the paper entries in SCI(E) in 2013 (538 papers) and 2015 (551 papers) with a view to identify cooperative research activities centered for KAERI. On international cooperation, the analysis showed a trend toward, first of all, diversification of partner countries. There were 118 entries of co-authorship with 22 countries in 2013 (41 with USA, 12 with Japan, 9 with India), which evolved to 121 entries in 2015 (34 for USA, 11 with China, 10 each with Japan and India). Secondly, there was a trend toward more number of countries evenly spread in 2015 compared to 2013, except a few major countries like USA, Japan, and India

Analysis of Trends in Cooperative Network Patterns for KAERI Researchers

Energy Technology Data Exchange (ETDEWEB)

Chun, Young Choon; Lee, Hyun Soo [KAERI, Daejeon (Korea, Republic of)

2016-05-15

There has been a trend toward faster results of research and accelerating inter-disciplinary convergence, under constraints in available resources. Under such reality, national and international cooperation with inter-sectoral research on science-technology-industry is becoming inevitable as a strategic approach for enhancing competitive edge on global dimension. This study gives an analysis on the cooperative network in nuclear research which bears multi-disciplinary technical feature. The study aims to visualize the cooperative network of KAERI(Korea Atomic Energy Research Institute) researchers, as the hub of the network, including academics and industry, with a view to provide insight on strengthening the cooperative network in nuclear research. This study accounted for the paper entries in SCI(E) in 2013 (538 papers) and 2015 (551 papers) with a view to identify cooperative research activities centered for KAERI. On international cooperation, the analysis showed a trend toward, first of all, diversification of partner countries. There were 118 entries of co-authorship with 22 countries in 2013 (41 with USA, 12 with Japan, 9 with India), which evolved to 121 entries in 2015 (34 for USA, 11 with China, 10 each with Japan and India). Secondly, there was a trend toward more number of countries evenly spread in 2015 compared to 2013, except a few major countries like USA, Japan, and India.

Impact of Social Punishment on Cooperative Behavior in Complex Networks

Science.gov (United States)

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.

The Practices of Student Network as Cooperative Learning in Ethiopia

Science.gov (United States)

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

Science.gov (United States)

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

Establishment of International Cooperative Network and Cooperative Research Strategy Between Korea and USA on Nuclear Thermal Hydraulics

International Nuclear Information System (INIS)

Baek, Won Pil; Song, Chul Hwa; Jeong, Jae Jun; Choi, Ki Yong; Kang, Kyoung Ho

2004-07-01

1. Scope and Objectives of the Project - Successful holding of the NURETH-10 - Analysis of the international trends in technology development and applications for nuclear thermal-hydraulics - Establishment of the international cooperative network and cooperative research strategy between Korea and USA on nuclear thermal-hydraulics 2. Research Results - Successful holding of the NURETH-10 - Analysis of the international trends in technology development and applications for nuclear thermal-hydraulics: - Establishment of international cooperative network and cooperative research strategy focused between Korea and USA on nuclear thermal-hydraulics: 3. Application Plan of the Research Results - Utilization as the basic data/information in establishing the domestic R and D directions and the international cooperative research strategy, - Application of the relevant experiences and data bases of NURETH-10 for holding future international conferences, - Promote more effective and productive research cooperation between Korea and USA

A decomposition approach to analysis of competitive-cooperative neural networks with delay

International Nuclear Information System (INIS)

Chu Tianguang; Zhang Zongda; Wang Zhaolin

2003-01-01

Competitive-cooperative or inhibitory-excitatory configurations abound in neural networks. It is demonstrated here how such a configuration may be exploited to give a detailed characterization of the fixed point dynamics in general neural networks with time delay. The idea is to divide the connection weights into inhibitory and excitatory types and thereby to embed a competitive-cooperative delay neural network into an augmented cooperative delay system through a symmetric transformation. This allows for the use of the powerful monotone properties of cooperative systems. By the method, we derive several simple necessary and sufficient conditions on guaranteed trapping regions and guaranteed componentwise (exponential) convergence of the neural networks. The results relate specific decay rate and trajectory bounds to system parameters and are therefore of practical significance in designing a network with desired performance

Is Cooperative Memory Special? The Role of Costly Errors, Context, and Social Network Size When Remembering Cooperative Actions

Directory of Open Access Journals (Sweden)

Tim Winke

2017-10-01

Full Text Available Theoretical studies of cooperative behavior have focused on decision strategies, such as tit-for-tat, that depend on remembering a partner’s last choices. Yet, an empirical study by Stevens et al. (2011 demonstrated that human memory may not meet the requirements that needed to use these strategies. When asked to recall the previous behavior of simulated partners in a cooperative memory task, participants performed poorly, making errors in 10–24% of the trials. However, we do not know the extent to which this task taps specialized cognition for cooperation. It may be possible to engage participants in more cooperative, strategic thinking, which may improve memory. On the other hand, compared with other situations, a cooperative context may already engage improved memory via cheater detection mechanisms. This study investigated the specificity of memory in cooperative contexts by varying (1 the costs of errors in memory by making forgetting defection more costly and (2 whether the recall situation is framed as a cooperative or neutral context. Also, we investigated whether variation in participants’ social network size could account for individual differences observed in memory accuracy. We found that neither including differential costs for misremembering defection nor removing the cooperative context influenced memory accuracy for cooperation. Combined, these results suggest that memory accuracy is robust to differences in the cooperative context: Adding more strategic components does not help accuracy, and removing cooperative components does not hurt accuracy. Social network size, however, did correlate with memory accuracy: People with larger networks remembered the events better. These findings suggest that cooperative memory does not seem to be special compared with other forms of memory, which aligns with previous work demonstrating the domain generality of memory. However, the demands of interacting in a large social network may

Reliability Improved Cooperative Communication over Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhuangbin Chen

2017-10-01

Full Text Available With the development of smart devices and connection technologies, Wireless Sensor Networks (WSNs are becoming increasingly intelligent. New or special functions can be obtained by receiving new versions of program codes to upgrade their software systems, forming the so-called smart Internet of Things (IoT. Due to the lossy property of wireless channels, data collection in WSNs still suffers from a long delay, high energy consumption, and many retransmissions. Thanks to wireless software-defined networks (WSDNs, software in sensors can now be updated to help them transmit data cooperatively, thereby achieving more reliable communication. In this paper, a Reliability Improved Cooperative Communication (RICC data collection scheme is proposed to improve the reliability of random-network-coding-based cooperative communications in multi-hop relay WSNs without reducing the network lifetime. In WSNs, sensors in different positions can have different numbers of packets to handle, resulting in the unbalanced energy consumption of the network. In particular, nodes in non-hotspot areas have up to 90% of their original energy remaining when the network dies. To efficiently use the residual energy, in RICC, high data transmission power is adopted in non-hotspot areas to achieve a higher reliability at the cost of large energy consumption, and relatively low transmission power is adopted in hotspot areas to maintain the long network lifetime. Therefore, high reliability and a long network lifetime can be obtained simultaneously. The simulation results show that compared with other scheme, RICC can reduce the end-to-end Message Fail delivering Ratio (MFR by 59.4%–62.8% under the same lifetime with a more balanced energy utilization.

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

Science.gov (United States)

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.

Cooperative localization in 5G networks: A survey

Directory of Open Access Journals (Sweden)

Ping Zhang

2017-03-01

Full Text Available In upcoming 5G networks, key prospects such as increased bandwidth, smaller cells, higher mobile terminal (MT densities, multiple radio access technologies, and the capability of device-to-device communication are beneficial for localization. Meanwhile, technologies suggested in 5G, such as massive multiple-in multiple-out, would also benefit from the accurate locations of MTs. Therefore, an opportunity to develop and integrate mobile localization technology in 5G networks has presented itself at this early stage. This paper reviews recent literature relating to localization in 5G networks, and emphasizes the prospect for implementing cooperative localization, which exploits the location information from additional measurements between MTs. To evaluate the accuracy of cooperative localization, a performance evaluation approach is also suggested.

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

Science.gov (United States)

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.

Multiple effect of social influence on cooperation in interdependent network games

Science.gov (United States)

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.

Mesoscopic structure conditions the emergence of cooperation on social networks.

Directory of Open Access Journals (Sweden)

Sergi Lozano

Full Text Available BACKGROUND: We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. METHODOLOGY/PRINCIPAL FINDINGS: We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. CONCLUSION: Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

Mesoscopic structure conditions the emergence of cooperation on social networks

Energy Technology Data Exchange (ETDEWEB)

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

2008-12-01

We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

Optimal interdependence between networks for the evolution of cooperation.

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Sungyoung Lee

2011-12-01

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

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

Science.gov (United States)

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.

Emergence of super cooperation of prisoner's dilemma games on scale-free networks.

Directory of Open Access Journals (Sweden)

Angsheng Li

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

Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks

International Nuclear Information System (INIS)

Poncela, J; Gomez-Gardenes, J; FlorIa, L M; Moreno, Y

2007-01-01

Recent studies on the evolutionary dynamics of the prisoner's dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we address the issue of how the characterization of the asymptotic states of the evolutionary dynamics depends on the initial concentration of cooperators. We find that the measure and the connectedness properties of the set of nodes where cooperation reaches fixation is largely independent of initial conditions, in contrast with the behaviour of both the set of nodes where defection is fixed, and the fluctuating nodes. We also check for the robustness of these results when varying the degree heterogeneity along a one-parametric family of networks interpolating between the class of Erdos-Renyi graphs and the Barabasi-Albert networks

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

Science.gov (United States)

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

2017-02-01

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

Game-theoretic cooperativity in networks of self-interested units

Science.gov (United States)

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.

Minimizing The Completion Time Of A Wireless Cooperative Network Using Network Coding

DEFF Research Database (Denmark)

Roetter, Daniel Enrique Lucani; Khamfroush, Hana; Barros, João

2013-01-01

We consider the performance of network coding for a wireless cooperative network in which a source wants to transmit M data packets to two receivers. We assume that receivers can share their received packets with each other or simply wait to receive the packets from the source. The problem of fin...

Cooperation, networks and emotions: Three essays in behavioral economics

NARCIS (Netherlands)

van Leeuwen, B.

2015-01-01

This thesis contains three essays that study how people behave in a social context. The first two essays are on cooperation and networks. Chapter 2 investigates a mechanism to facilitate public good provision in networks. It relies on the idea that people compete for attractive network positions (or

Cooperative Spatial Retreat for Resilient Drone Networks.

Science.gov (United States)

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.

Cooperative robots and sensor networks 2015

CERN Document Server

Dios, JRamiro

2015-01-01

This book compiles some of the latest research in cooperation between robots and sensor networks. Structured in twelve chapters, this book addresses fundamental, theoretical, implementation and experimentation issues. The chapters are organized into four parts namely multi-robots systems, data fusion and localization, security and dependability, and mobility.

If you can't beat 'em, join 'em: Cooperative and non-cooperative games in network sharing

NARCIS (Netherlands)

Offergelt, F.H.S.; Berkers, F.T.H.M.; Hendrix, G.P.

2011-01-01

No Mobile Network Operator (MNO) will make the decision to share its network lightly. There are many financial and strategic considerations to this question. In this paper we outline a non-cooperative game which can be used to model the strategic decision of an MNO regarding mobile network sharing

Combining evolutionary game theory and network theory to analyze human cooperation patterns

International Nuclear Information System (INIS)

Scatà, Marialisa; Di Stefano, Alessandro; La Corte, Aurelio; Liò, Pietro; Catania, Emanuele; Guardo, Ermanno; Pagano, Salvatore

2016-01-01

Highlights: • We investigate the evolutionary dynamics of human cooperation in a social network. • We introduce the concepts of “Critical Mass”, centrality measure and homophily. • The emergence of cooperation is affected by the spatial choice of the “Critical Mass”. • Our findings show that homophily speeds up the convergence towards cooperation. • Centrality and “Critical Mass” spatial choice partially offset the impact of homophily. - Abstract: As natural systems continuously evolve, the human cooperation dilemma represents an increasingly more challenging question. Humans cooperate in natural and social systems, but how it happens and what are the mechanisms which rule the emergence of cooperation, represent an open and fascinating issue. In this work, we investigate the evolution of cooperation through the analysis of the evolutionary dynamics of behaviours within the social network, where nodes can choose to cooperate or defect following the classical social dilemmas represented by Prisoner’s Dilemma and Snowdrift games. To this aim, we introduce a sociological concept and statistical estimator, “Critical Mass”, to detect the minimum initial seed of cooperators able to trigger the diffusion process, and the centrality measure to select within the social network. Selecting different spatial configurations of the Critical Mass nodes, we highlight how the emergence of cooperation can be influenced by this spatial choice of the initial core in the network. Moreover, we target to shed light how the concept of homophily, a social shaping factor for which “birds of a feather flock together”, can affect the evolutionary process. Our findings show that homophily allows speeding up the diffusion process and make quicker the convergence towards human cooperation, while centrality measure and thus the Critical Mass selection, play a key role in the evolution showing how the spatial configurations can create some hidden patterns, partially

Joint Preprocesser-Based Detectors for One-Way and Two-Way Cooperative Communication Networks

KAUST Repository

Abuzaid, Abdulrahman I.

2014-01-01

Efficient receiver designs for cooperative communication networks are becoming increasingly important. In previous work, cooperative networks communicated with the use of L relays. As the receiver is constrained, channel shortening and reduced

Growth strategies and governance of horizontal business networks: the case of the biggest German cooperative food retail network

Directory of Open Access Journals (Sweden)

Douglas Wegner

2011-08-01

Full Text Available Several growth strategies may be adopted by cooperative retail networks, but these strategies create dilemmas about how to organize business networks with a large number of participants and the adjustments in the governance system that are necessary to facilitate growth. The article examines the relations between the growth strategies adopted by a horizontal business network and its governance system. We analyze the case of Edeka, a centennial cooperative network, leader in food retail in Germany, showing its growth strategies and implications for the network structure. The case study was based on various secondary data sources and focuses the whole network – and not the networked firms – as the unit of analysis. Results indicate that, in order to grow, the network changed its governance structure and the process of participation of members in decision making, creating a hierarchical structure with professional management. The paper contributes to the discussions on cooperative governance and demonstrates that governance systems are transient and adapt to the network strategies. From a management viewpoint, the results show the effects of the growth strategies adopted by business networks, regarding the role of network managers and entrepreneurs in network management.

RELATION BETWEEN COOPERATION AND ORGANIZATIONAL LEARNING WITH THE COMPETITIVENESS IN AN INTERORGANIZATIONAL NETWORK

Directory of Open Access Journals (Sweden)

Paulo Cesar Zonta

2015-05-01

Full Text Available The study analyzed the relationship between cooperation and organizational learning with competitiveness in a small and medium enterprises (SME network, with business of the groups of the Commercial and Industrial Association of Chapecó (ACIC. The methodology used was quantitative, with the factorial analysis. Currently, ACIC has 14 groups and 236 SME´s nucleated, developing joint activities of economic and social sustainability in Chapecó. The theoretical study raised concepts already endorsed by the scientific community on interorganizational networks, competitiveness, cooperation and organizational learning. The results demonstrated that indicators related to cooperation and learning in horizontal networks are characterized as antecedents of competitiveness in organizational networks, and that there is a positive correlation between the constructs cooperation and organizational learning with competitiveness construct. The study confirms the belief that small businesses associated in networks can increase their competitiveness, thus contributing to regional development.

Incentivize Spectrum Leasing in Cognitive Radio Networks by Exploiting Cooperative Retransmission

Directory of Open Access Journals (Sweden)

Xiaoyan Wang

2015-07-01

Full Text Available This paper addresses the spectrum leasing issue in cognitive radio networks by exploiting the secondary user’s cooperative retransmission. In contrast with the previous researches that focuses on cancellationbased or coding-based cooperative retransmissions, we propose a novel trading-based mechanism to facilitate the cooperative retransmission for cognitive radio networks. By utilizing the Stackelberg game model, we incentivize the otherwise non-cooperative users by maximizing their utilities in terms of transmission rates and economic profit. We analyze the existence of the unique Nash equilibrium of the game, and provide the optimal solutions with corresponding constraints. Numerical results demonstrate the efficiency of the proposed mechanism, under which the performance of the whole system could be substantially improved.

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

Science.gov (United States)

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.

On cooperative and efficient overlay network evolution based on a group selection pattern.

Science.gov (United States)

Nakao, Akihiro; Wang, Yufeng

2010-04-01

In overlay networks, the interplay between network structure and dynamics remains largely unexplored. In this paper, we study dynamic coevolution between individual rational strategies (cooperative or defect) and the overlay network structure, that is, the interaction between peer's local rational behaviors and the emergence of the whole network structure. We propose an evolutionary game theory (EGT)-based overlay topology evolution scheme to drive a given overlay into the small-world structure (high global network efficiency and average clustering coefficient). Our contributions are the following threefold: From the viewpoint of peers' local interactions, we explicitly consider the peer's rational behavior and introduce a link-formation game to characterize the social dilemma of forming links in an overlay network. Furthermore, in the evolutionary link-formation phase, we adopt a simple economic process: Each peer keeps one link to a cooperative neighbor in its neighborhood, which can slightly speed up the convergence of cooperation and increase network efficiency; from the viewpoint of the whole network structure, our simulation results show that the EGT-based scheme can drive an arbitrary overlay network into a fully cooperative and efficient small-world structure. Moreover, we compare our scheme with a search-based economic model of network formation and illustrate that our scheme can achieve the experimental and analytical results in the latter model. In addition, we also graphically illustrate the final overlay network structure; finally, based on the group selection model and evolutionary set theory, we theoretically obtain the approximate threshold of cost and draw the conclusion that the small value of the average degree and the large number of the total peers in an overlay network facilitate the evolution of cooperation.

Social networks and cooperation: a bibliometric study

Directory of Open Access Journals (Sweden)

Ana Paula Lopes

2013-05-01

Full Text Available The social network analysis involves social and behavioral science. The decentralization of productive activities, such as the formation of "network organizations" as a result of downsizing of large corporate structures of the past, marked by outsoucing and formation of alliances, shows the importance of this theme. The main objective of this paper is to analyze the theory of cooperation and social networks over a period of 24 years. For this, was performed a bibliometric study with content analysis. The database chosen for the initial sample search was ISI Web of Science. The search topics were “social network” and “cooperation”. Were analyzed 97 articles and their references, through networks of citations. The main identified research groups dealing with issues related to trust, strategic alliances, natural cooperation, game theory, social capital, intensity of interaction, reciprocity and innovation. It was found that the publications occurred in a large number of journals, which indicates that the theme is multidisciplinary, and only five journals published at least three articles. Although the first publication has occurred in 1987, was from 2006 that the publications effectively increased. The areas most related to the theme of the research were performance, evolution, management, graphics, model and game theory.

Cooperative networks overcoming defectors by social influence

Science.gov (United States)

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.

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

Science.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Ning Li

2017-05-01

Full Text Available The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs project is to make autonomous underwater vehicles (AUVs, remote operated vehicles (ROVs and unmanned surface vehicles (USVs more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV’s parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the

Periodic oscillatory solution in delayed competitive-cooperative neural networks: A decomposition approach

International Nuclear Information System (INIS)

Yuan Kun; Cao Jinde

2006-01-01

In this paper, the problems of exponential convergence and the exponential stability of the periodic solution for a general class of non-autonomous competitive-cooperative neural networks are analyzed via the decomposition approach. The idea is to divide the connection weights into inhibitory or excitatory types and thereby to embed a competitive-cooperative delayed neural network into an augmented cooperative delay system through a symmetric transformation. Some simple necessary and sufficient conditions are derived to ensure the componentwise exponential convergence and the exponential stability of the periodic solution of the considered neural networks. These results generalize and improve the previous works, and they are easy to check and apply in practice

Asymptotic Analysis of Large Cooperative Relay Networks Using Random Matrix Theory

Directory of Open Access Journals (Sweden)

H. Poor

2008-04-01

Full Text Available Cooperative transmission is an emerging communication technology that takes advantage of the broadcast nature of wireless channels. In cooperative transmission, the use of relays can create a virtual antenna array so that multiple-input/multiple-output (MIMO techniques can be employed. Most existing work in this area has focused on the situation in which there are a small number of sources and relays and a destination. In this paper, cooperative relay networks with large numbers of nodes are analyzed, and in particular the asymptotic performance improvement of cooperative transmission over direction transmission and relay transmission is analyzed using random matrix theory. The key idea is to investigate the eigenvalue distributions related to channel capacity and to analyze the moments of this distribution in large wireless networks. A performance upper bound is derived, the performance in the low signal-to-noise-ratio regime is analyzed, and two approximations are obtained for high and low relay-to-destination link qualities, respectively. Finally, simulations are provided to validate the accuracy of the analytical results. The analysis in this paper provides important tools for the understanding and the design of large cooperative wireless networks.

Communication and cooperation in networked environments: an experimental analysis.

Science.gov (United States)

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.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Swami Ananthram

2007-01-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Ananthram Swami

2007-12-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

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

Science.gov (United States)

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

Centralized cooperative spectrum sensing for ad-hoc disaster relief network clusters

DEFF Research Database (Denmark)

Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.

2010-01-01

Disaster relief networks have to be highly adaptable and resilient. Cognitive radio enhanced ad-hoc architecture have been put forward as a candidate to enable such networks. Spectrum sensing is the cornerstone of the cognitive radio paradigm, and it has been the target of intensive research....... The main common conclusion was that the achievable spectrum sensing accuracy can be greatly enhanced through the use of cooperative sensing schemes. When considering applying Cognitive Radio to ad-hoc disaster relief networks, spectrum sensing cooperative schemes are paramount. A centralized cluster...

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

Science.gov (United States)

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.

Cooperative robots and sensor networks 2014

CERN Document Server

Khelil, Abdelmajid

2014-01-01

This book is the second volume on Cooperative Robots and Sensor Networks. The primary objective of this book is to provide an up-to-date reference for cutting-edge studies and research trends related to mobile robots and wireless sensor networks, and in particular for the coupling between them. Indeed, mobile robots and wireless sensor networks have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and wireless sensor networks have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The book consists of ten chapters, organized into four parts. The first part of the book presents three chapters related to localization of mobile robots using wireless sensor networks. Two chapters presented new solutions based Extended Kalman Filter and Particle Fi...

A Cooperative Communication Model Tailored for Energy Balance in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Camila F. Rêgo

2017-08-01

Full Text Available Wireless Sensor Networks (WSN are characterized by their capacity of monitoring the environment, gathering and sharing information. Nodes in a WSN usually cooperate in the task of forwarding the sensed data to a sink node for later retrieval and analysis. The success of this task depends on the availability of efficient routes that meet the application requirements. As topology may change overtime, alternatives to improve and maintain network connectivity are highly desired. In this context, Cooperative Communication (CC emerged as an alternative to improve network connectivity. Despite its benefits, CC-links are known to have higher energy demands as compared to traditional, direct, links. In particular, CC-links require the source node to expend more power than others nodes, shortening their life span. The main contribution of this paper is to propose a new Cooperative Communication model, capable of increasing the energy balance of the CC-links while improving network connectivity. Simulation results show that, compared to other CC schemes, the source node of a Cooperative Communication reduces the amount of expended energy by 68% in the evaluated settings.

Energy Efficient Four Level Cooperative Opportunistic Communication for Wireless Personal Area Networks (WPAN)

DEFF Research Database (Denmark)

Rohokale, Vandana M.; Inamdar, Sandeep; Prasad, Neeli R.

2013-01-01

For wireless sensor networks (WSN),energy is a scarce resource. Due to limited battery resources, the energy consumption is the critical issue for the transmission as well as reception of the signals in the wireless communication. WSNs are infrastructure-less shared network demanding more energy...... consumption due to collaborative transmissions. This paper proposes a new cooperative opportunistic four level model for IEEE 802.15.4 Wireless Personal Area Network (WPAN).The average per node energy consumption is observed merely about 0.17mJ for the cooperative wireless communication which proves...... the proposed mechanism to be energy efficient. This paper further proposes four levels of cooperative data transmission from source to destination to improve network coverage with energy efficiency....

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

Science.gov (United States)

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.

Visualising Actor Network for Cooperative Systems in Marine Technology

DEFF Research Database (Denmark)

Pan, Yushan; Finken, Sisse

2016-01-01

Awareness is a concept familiar to specialists within the field of Computer Supported Cooperative Work (CSCW). It is superior for analysing and describing some of the ad hoc work activities that unfold in cooperation. Such informal activities are outside the scope of engineers’ formal models, whi...... that shape computer systems. The aim, thus, is to portray cooperative work in a way that can be valuable for engineers implementing marine technology. We do so by way of presenting a transferring technique (2T) using insights from the CSCW field and Actor Network Theory (ANT)....

Cooperative Jamming for Physical Layer Security in Wireless Sensor Networks

DEFF Research Database (Denmark)

Rohokale, Vandana M.; Prasad, Neeli R.; Prasad, Ramjee

2012-01-01

Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This work proposes a novel cooperative jamming mechanism for scalable networks like Wireless Sensor Networks (WSNs) which makes use of friendly interference to confuse the eavesdropper...

On hybrid cooperation in underlay cognitive radio networks

KAUST Repository

Mahmood, Nurul Huda; Yilmaz, Ferkan; Ø ien, Geir Egil; Alouini, Mohamed-Slim

2013-01-01

Cooperative communication is a promising strategy to enhance the performance of a communication network as it helps to improve the coverage area and the outage performance. However, such enhancement comes at the expense of increased resource

Networking for English Literature Class: Cooperative Learning in Chinese Context

Science.gov (United States)

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…

Nobelist TD LEE Scientist Cooperation Network and Scientist Innovation Ability Model

OpenAIRE

Fang, Jin-Qing; Liu, Qiang

2013-01-01

Nobelist TD Lee scientist cooperation network (TDLSCN) and their innovation ability are studied. It is found that the TDLSCN not only has the common topological properties both of scale-free and small-world for a general scientist cooperation networks, but also appears the creation multiple-peak phenomenon for number of published paper with year evolution, which become Nobelist TD Lee’s significant mark distinguished from other scientists. This new phenomenon has not been revealed in the scie...

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

Science.gov (United States)

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.

Creating SOF Networks: The Role of NATO Special Operations as a Testing Ground for SOF Integration

Science.gov (United States)

2011-06-01

Partner Collaborative Network (APCN).” 196 Ibid. 197 Alan Dron , “Special Network—Alliance Aims to Improve Cooperation among Special Operators...198 Dron , “Special Network—Alliance Aims to Improve Cooperation Among Special Operators.” 199 Ibid. 200 Briefing...manning-20110303. 205 Dron , “Special Network -Alliance Aims to Improve Cooperation Among Special Operators.” 69 expanding network of trusted global

Evolutionary dynamics of cooperation in neutral populations

Science.gov (United States)

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.

Cellular Controlled Short-Range Communication for Cooperative P2P Networking

DEFF Research Database (Denmark)

Fitzek, Frank H. P.; Katz, Marcos; Zhang, Qi

2009-01-01

-range communication network among cooperating mobile and wireless devices. The role of the mobile device will change, from being an agnostic entity in respect to the surrounding world to a cognitive device. This cognitive device is capable of being aware of the neighboring devices as well as on the possibility......This article advocates a novel communication architecture and associated collaborative framework for future wireless communication systems. In contrast to the dominating cellular architecture and the upcoming peer-to-peer architecture, the new approach envisions a cellular controlled short...... to establish cooperation with them. The novel architecture together with several possible cooperative strategies will bring clear benefits for the network and service providers, mobile device manufacturers and also end users....

Communication and cooperation in underwater acoustic networks

Science.gov (United States)

Yerramalli, Srinivas

In this thesis, we present a study of several problems related to underwater point to point communications and network formation. We explore techniques to improve the achievable data rate on a point to point link using better physical layer techniques and then study sensor cooperation which improves the throughput and reliability in an underwater network. Robust point-to-point communications in underwater networks has become increasingly critical in several military and civilian applications related to underwater communications. We present several physical layer signaling and detection techniques tailored to the underwater channel model to improve the reliability of data detection. First, a simplified underwater channel model in which the time scale distortion on each path is assumed to be the same (single scale channel model in contrast to a more general multi scale model). A novel technique, which exploits the nature of OFDM signaling and the time scale distortion, called Partial FFT Demodulation is derived. It is observed that this new technique has some unique interference suppression properties and performs better than traditional equalizers in several scenarios of interest. Next, we consider the multi scale model for the underwater channel and assume that single scale processing is performed at the receiver. We then derive optimized front end pre-processing techniques to reduce the interference caused during single scale processing of signals transmitted on a multi-scale channel. We then propose an improvised channel estimation technique using dictionary optimization methods for compressive sensing and show that significant performance gains can be obtained using this technique. In the next part of this thesis, we consider the problem of sensor node cooperation among rational nodes whose objective is to improve their individual data rates. We first consider the problem of transmitter cooperation in a multiple access channel and investigate the stability of

Cooperative Spatial Retreat for Resilient Drone Networks †

Science.gov (United States)

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

Relevant Factors for Establishing Inter-firm Cooperation Networks in Rio Grande do Sul

Directory of Open Access Journals (Sweden)

Jorge Renato Verschoore

2008-10-01

Full Text Available The cooperation among firms in a network form has been stressed as an alternative organizational configuration in response to recent economic transformation. The increased number of initiatives and the empirical research scarcity on the network formation in Brazil motivated the present study. The main objective of this paper is to comprehend the factors which effect the establishment of network cooperation in the Southern Brazilian context. In order to achieve this objective a quantitative research was carried out with 443 enterprise representatives, associated to 120 cooperation networks. The empirical data were collected by the researchers in 2005 and statistically processed through a conjoint analysis. The results confirmed the theoretical propositions built by the researchers,appointing the relevance of factors, such as learning and innovation, increased scale and market power, and access to solutions.

Multiuser Radio Resource Allocation for Multiservice Transmission in OFDMA-Based Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Zhang Xing

2009-01-01

Full Text Available Abstract The problem of multiservice transmission in OFDMA-based cooperative relay networks is studied comprehensively. We propose a framework to adaptively allocate power, subcarriers, and data rate in OFDMA system to maximize spectral efficiency under the constraints of satisfying multiuser multiservices' QoS requirements. Specifically, first we concentrate on the single-user scenario which considers multiservice transmission in point-to-point cooperative relay network. Based on the analysis of single-user scenario, we extend the multiservice transmission to multiuser point-to-multipoint scenario. Next, based on the framework, we propose several suboptimal radio resource allocation algorithms for multiservice transmissions in OFDMA-based cooperative relay networks to further reduce the computational complexity. Simulation results show that the proposed algorithms yield much higher spectral efficiency and much lower outage probability, which are flexible and efficient for the OFDMA-based cooperative relay system.

Trust and Its Impact on Cooperation in Alliance Networks:Theory and Practice

Directory of Open Access Journals (Sweden)

Wlodzimierz SROKA

2011-11-01

Full Text Available At present we can observe the increasing role of cooperation among companies all around the world. Cooperation includes many forms, such as alliances, joint ventures, networks, clusters, outsourcing and others. Trust is one of the most important factors of success of any cooperation activity, because it can lower transaction costs, increase productivity and innovativeness, facilitate inter-organizational relationships and resolve conflicts. Therefore the paper discusses the basic problems of trust in alliance networks. The text consists of theoretical deliberations devoted to alliance networks and trust. The practical case of the company from machine industry that formed a portfolio of alliances based on trust is also an important part of the text. The conclusion of the paper is that portfolio of alliances based on trust is worth pursuing.

Cooperative Detection for Primary User in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Zhu Jia

2009-01-01

Full Text Available We propose two novel cooperative detection schemes based on the AF (Amplify and Forward and DF (Decode and Forward protocols to achieve spatial diversity gains for cognitive radio networks, which are referred to as the AF-CDS, (AF-based Cooperative Detection Scheme and DF-CDS (DF-based Cooperative Detection Scheme, respectively. Closed-form expressions of detection probabilities for the noncooperation scheme, AND-CDS (AND-based Cooperative Detection Scheme, AF-CDS and DF-CDS, are derived over Rayleigh fading channels. Also, we analyze the overall agility for the proposed cooperative detection schemes and show that our schemes can further reduce the detection time. In addition, we compare the DF-CDS with the AF-CDS in terms of detection probability and agility gain, depicting the advantage of DF-CDS at low SNR region and high false alarm probability region.

Promoting cooperation by preventing exploitation: The role of network structure

Science.gov (United States)

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.

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

Science.gov (United States)

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

On the Throughput and Energy Benefits of Network Coded Cooperation

DEFF Research Database (Denmark)

Hernandez, Nestor; Heide, Janus; Roetter, Daniel Enrique Lucani

2014-01-01

Cooperative techniques in wireless mobile networks typically leverage short-range communication technologies, e.g., WiFi, to allow data exchange between devices forming a mobile cloud. These mobile clouds have been considered as a key to reduce the cost of multicast services for the network...

Nobelist TD LEE Scientist Cooperation Network and Scientist Innovation Ability Model

Directory of Open Access Journals (Sweden)

Jin-Qing Fang

2013-01-01

Full Text Available Nobelist TD Lee scientist cooperation network (TDLSCN and their innovation ability are studied. It is found that the TDLSCN not only has the common topological properties both of scale-free and small-world for a general scientist cooperation networks, but also appears the creation multiple-peak phenomenon for number of published paper with year evolution, which become Nobelist TD Lee’s significant mark distinguished from other scientists. This new phenomenon has not been revealed in the scientist cooperation networks before. To demonstrate and explain this new finding, we propose a theoretical model for a nature scientist and his/her team innovation ability. The theoretical results are consistent with the empirical studies very well. This research demonstrates that the model has a certain universality and can be extended to estimate innovation ability for any nature scientist and his/her team. It is a better method for evaluating scientist innovation ability and his/her team for the academic profession and is of application potential.

Cross-border Co-operation and Policy Networks in West Africa

DEFF Research Database (Denmark)

Trémolières, Marie; Walther, Olivier

This publication examines how policy actors involved in cross-border co-operation contribute to the regional integration process in West Africa. It uses a pioneering methodology, known as social network analysis, to visualise the formal and informal relationships between actors involved in cross...... West Africa to develop cross-border initiatives in a number of ways. Combining these two analyses with the perceptions of regional policy makers as to which border areas they consider as priorities for regional integration, the publication concludes with the analytical foundations for more effective......-border policy networks, showing that borders have notable and diverse impacts on exchanges of information and the relative power of networks. The report then analyses a range of regional indicators of co-operation potential, visually demonstrating that borders can also affect the ability of sub-regions within...

Inter-organizational relationships: promoters and restrictive factors in the formation of cooperation network

Directory of Open Access Journals (Sweden)

Marcos Antonio Gaspar

2014-04-01

Full Text Available The present paper had as aim to identify factors of inter-organizational relationships which promotes and restricts the formation of companies’ cooperation network, from two levels of analysis (organizational and inter-organizational. To achieve this goal, it was developed a descriptive-qualitative study, with prospecting for primary and secondary data on a cooperation network. The universe was composed by 41 participating companies associated to the analyzed network. The sampling procedure was for researcher’s accessibility and convenience. As a result, it was identified that the network is guided by goals of cooperation among the participating companies, in addition to representing the sector and provide services in the interests of the associates. The main factors influencing the formation of the network were: business center, marketing and training; but only training has been achieved satisfactorily. The business center and marketing factors have not yet been fully developed, being both identified as restrictive factors.

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

Science.gov (United States)

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.

Robust Nash Dynamic Game Strategy for User Cooperation Energy Efficiency in Wireless Cellular Networks

Directory of Open Access Journals (Sweden)

Shuhuan Wen

2012-01-01

Full Text Available Recently, there is an emerging trend of addressing “energy efficiency” aspect of wireless communications. It has been shown that cooperating users relay each other's information to improve data rates. The energy is limited in the wireless cellular network, but the mobile users refuse to relay. This paper presents an approach that encourages user cooperation in order to improve the energy efficiency. The game theory is an efficient method to solve such conflicts. We present a cellular framework in which two mobile users, who desire to communicate with a common base station, may cooperate via decode-and-forward relaying. In the case of imperfect information assumption, cooperative Nash dynamic game is used between the two users' cooperation to tackle the decision making problems: whether to cooperate and how to cooperate in wireless networks. The scheme based on “cooperative game theory” can achieve general pareto-optimal performance for cooperative games, and thus, maximize the entire system payoff while maintaining fairness.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

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.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Dalhatu Muhammed

2018-02-01

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

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

Science.gov (United States)

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

A Cross-Layer Cooperation Mechanism of Wireless Networks Based on Game Theory

OpenAIRE

Chunsheng, Cui; Yongjian, Yang; Liping, Huang

2014-01-01

To meet the wireless network congestion control problem, we give a definition of congestion degree classification and propose a mechanism of directed cooperative path net, guided by the wireless network’s cross-layer design methods and node cooperation principles. Considering the virtual collision and “starved” phenomenon in congested networks, the QRD mechanism and channel competition mechanism QPCG are proposed, with introducing the game theory into the cross-layer design. Simulation result...

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

Science.gov (United States)

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.

Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks

Directory of Open Access Journals (Sweden)

Zhen Li

2016-03-01

Full Text Available The Internet of Things (IoT is a significant branch of the ongoing advances in the Internet and mobile communications. Yet, the use of a large number of IoT devices can severely worsen the spectrum scarcity problem. The usable spectrum resources are almost entirely occupied, and thus, the increasing demands of radio access from 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 cellular telephones. Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric and asymmetric ciphers may not be suitable for CIoT networks since these networks are composed of low-profile devices. In this paper, we address the security issues in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative in nature, we propose to employ cooperative jamming to achieve secure transmission. In our proposed 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 minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper (ECSI. 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 robots and sensor networks

CERN Document Server

Khelil, Abdelmajid

2014-01-01

Mobile robots and Wireless Sensor Networks (WSNs) have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and WSNs have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other.
 The primary objective of book is to provide a reference for cutting-edge studies and research trends pertaining to robotics and sensor networks, and in particular for the coupling between them. The book consists of five chapters. The first chapter presents a cooperation strategy for teams of multiple autonomous vehicles to solve the rendezvous problem. The second chapter is motivated by the need to improve existing solutions that deal with connectivity prediction, and proposed a genetic machine learning approach for link-quality prediction. The third chapter presents an arch...

Algebraic Number Precoded OFDM Transmission for Asynchronous Cooperative Multirelay Networks

Directory of Open Access Journals (Sweden)

Hua Jiang

2014-01-01

Full Text Available This paper proposes a space-time block coding (STBC transmission scheme for asynchronous cooperative systems. By combination of rotated complex constellations and Hadamard transform, these constructed codes are capable of achieving full cooperative diversity with the analysis of the pairwise error probability (PEP. Due to the asynchronous characteristic of cooperative systems, orthogonal frequency division multiplexing (OFDM technique with cyclic prefix (CP is adopted for combating timing delays from relay nodes. The total transmit power across the entire network is fixed and appropriate power allocation can be implemented to optimize the network performance. The relay nodes do not require decoding and demodulation operation, resulting in a low complexity. Besides, there is no delay for forwarding the OFDM symbols to the destination node. At the destination node the received signals have the corresponding STBC structure on each subcarrier. In order to reduce the decoding complexity, the sphere decoder is implemented for fast data decoding. Bit error rate (BER performance demonstrates the effectiveness of the proposed scheme.

Impact of interaction style and degree on the evolution of cooperation on Barabási-Albert scale-free network.

Directory of Open Access Journals (Sweden)

Fengjie Xie

Full Text Available In this work, we study an evolutionary prisoner's dilemma game (PDG on Barabási-Albert scale-free networks with limited player interactions, and explore the effect of interaction style and degree on cooperation. The results show that high-degree preference interaction, namely the most applicable interaction in the real world, is less beneficial for emergence of cooperation on scale-free networks than random interaction. Besides, cooperation on scale-free networks is enhanced with the increase of interaction degree regardless whether the interaction is high-degree preference or random. If the interaction degree is very low, the cooperation level on scale-free networks is much lower than that on regular ring networks, which is against the common belief that scale-free networks must be more beneficial for cooperation. Our analysis indicates that the interaction relations, the strategy and the game payoff of high-connectivity players play important roles in the evolution of cooperation on scale-free networks. A certain number of interactions are necessary for scale-free networks to exhibit strong capability of facilitating cooperation. Our work provides important insight for members on how to interact with others in a social organization.

Conformity-based cooperation in online social networks: The effect of heterogeneous social influence

International Nuclear Information System (INIS)

Xu, Bo; Wang, Jianwei; Zhang, Xuejun

2015-01-01

This paper extends the conformity model by introducing heterogeneous social influence into the analysis. We associate the influence of a player in the network with its degree centrality assuming that players of higher degree exhibit more social influence on its neighbors. The results show that the equilibrium level of cooperators can be dramatically enhanced if the conformity-driven players are preferentially influenced by neighbors of higher degree. We attribute this finding to two elementary mechanisms in the evolutionary process: (1) degree-based social influence facilitates the formation of strategic clusters around hubs; and (2) payoff-heterogeneity between cooperative clusters and defective clusters contributes to the promotion of cooperation. This research reveals the important role of heterogeneous social influence on the emergence of cooperation in social networks.

Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

Directory of Open Access Journals (Sweden)

M. E. Migabo

2017-01-01

Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.

Green Mobile Clouds: Network Coding and User Cooperation for Improved Energy Efficiency

DEFF Research Database (Denmark)

Heide, Janus; Fitzek, Frank; Pedersen, Morten Videbæk

2012-01-01

This paper highlights the benefits of user cooperation and network coding for energy saving in cellular networks. It is shown that these techniques allow for reliable and efficient multicast services from both a user and network perspective. The working principles and advantages in terms of energy...

Performance analysis of selective cooperation in underlay cognitive networks over Rayleigh channels

KAUST Repository

Hussain, Syed Imtiaz

2011-06-01

Underlay cognitive networks should follow strict interference thresholds to operate in parallel with primary networks. This constraint limits their transmission power and eventually the area of coverage. Therefore, it is very likely that the underlay networks will make use of relays to transmit signals to the distant secondary users. In this paper, we propose a secondary relay selection scheme which maximizes the end-to-end signal to noise ratio (SNR) for the secondary link while keeping the interference levels to the primary network below a certain threshold. We derive closed form expressions for the probability density function (PDF) of the SNR at the secondary destination, average bit error probability and outage probability. Analytical results are verified through simulations which also give insight about the benefits and tradeoffs of the selective cooperation in underlay cognitive networks. It is shown that, in contrast to non-cognitive selective cooperation, this scheme performs better in low SNR region for cognitive networks. © 2011 IEEE.

Organized network for supporting the amateur-scientist co-operation in Finland

Science.gov (United States)

Mäkelä, V.; Haukka, H.; Oksanen, A.; Hentunen, V.-P.

2014-04-01

PROAM network is a working group of Ursa Astronomical Association [1] for supporting Finnish amateur astronomers participating to co-operation projects between professional and amateur astronomers. The network relays the information on projects, maintains professional contacts and arranges training on technical skills for research work.

Persistent RCSMA: A MAC Protocol for a Distributed Cooperative ARQ Scheme in Wireless Networks

Directory of Open Access Journals (Sweden)

J. Alonso-Zárate

2008-05-01

Full Text Available The persistent relay carrier sensing multiple access (PRCSMA protocol is presented in this paper as a novel medium access control (MAC protocol that allows for the execution of a distributed cooperative automatic retransmission request (ARQ scheme in IEEE 802.11 wireless networks. The underlying idea of the PRCSMA protocol is to modify the basic rules of the IEEE 802.11 MAC protocol to execute a distributed cooperative ARQ scheme in wireless networks in order to enhance their performance and to extend coverage. A closed formulation of the distributed cooperative ARQ average packet transmission delay in a saturated network is derived in the paper. The analytical equations are then used to evaluate the performance of the protocol under different network configurations. Both the accuracy of the analysis and the performance evaluation of the protocol are supported and validated through computer simulations.

An Intelligent Cooperative Visual Sensor Network for Urban Mobility.

Science.gov (United States)

Leone, Giuseppe Riccardo; Moroni, Davide; Pieri, Gabriele; Petracca, Matteo; Salvetti, Ovidio; Azzarà, Andrea; Marino, Francesco

2017-11-10

Smart cities are demanding solutions for improved traffic efficiency, in order to guarantee optimal access to mobility resources available in urban areas. Intelligent video analytics deployed directly on board embedded sensors offers great opportunities to gather highly informative data about traffic and transport, allowing reconstruction of a real-time neat picture of urban mobility patterns. In this paper, we present a visual sensor network in which each node embeds computer vision logics for analyzing in real time urban traffic. The nodes in the network share their perceptions and build a global and comprehensive interpretation of the analyzed scenes in a cooperative and adaptive fashion. This is possible thanks to an especially designed Internet of Things (IoT) compliant middleware which encompasses in-network event composition as well as full support of Machine-2-Machine (M2M) communication mechanism. The potential of the proposed cooperative visual sensor network is shown with two sample applications in urban mobility connected to the estimation of vehicular flows and parking management. Besides providing detailed results of each key component of the proposed solution, the validity of the approach is demonstrated by extensive field tests that proved the suitability of the system in providing a scalable, adaptable and extensible data collection layer for managing and understanding mobility in smart cities.

Influence of different initial distributions on robust cooperation in scale-free networks: A comparative study

International Nuclear Information System (INIS)

Chen Xiaojie; Fu Feng; Wang Long

2008-01-01

We study the evolutionary Prisoner's dilemma game on scale-free networks, focusing on the influence of different initial distributions for cooperators and defectors on the evolution of cooperation. To address this issue, we consider three types of initial distributions for defectors: uniform distribution at random, occupying the most connected nodes, and occupying the lowest-degree nodes, respectively. It is shown that initial configurations for defectors can crucially influence the cooperation level and the evolution speed of cooperation. Interestingly, the situation where defectors initially occupy the lowest-degree vertices can exhibit the most robust cooperation, compared with two other distributions. That is, the cooperation level is least affected by the initial percentage of defectors. Moreover, in this situation, the whole system evolves fastest to the prevalent cooperation. Besides, we obtain the critical values of initial frequency of defectors above which the extinction of cooperators occurs for the respective initial distributions. Our results might be helpful in explaining the maintenance of high cooperation in scale-free networks

Expanding Usability of Virtual Network Laboratory in IT Engineering Education

Directory of Open Access Journals (Sweden)

Dalibor M Dobrilovic

2013-02-01

Full Text Available This paper deals with importance of virtual network laboratories usage in IT engineering education. It presents the particular virtual network laboratory model developed for usage in Computer Networks course as well. This virtual network laboratory, called VNLab, is based on virtualization technology. It has been successfully tested in educational process of Computer Network course for IT undergraduate students. Its usability for network related courses is analyzed by comparison of recommended curricula’s of world organizations such as IEEE, ACM and AIS. This paper is focused on expanding the usability of this virtual network laboratory to other non-network related courses. The primary expansion field is in domain of IT System Administration, IT Systems and Data Security and Operating Systems as well. The possible learning scenarios, learning tools and concepts for making this system applicable in these three additional fields are presented by the analyses of compatibility with recommended learning topics and outcomes by IEEE, ACM and AIS.

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

Science.gov (United States)

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.

Towards the Robotic “Avatar”: An Extensive Survey of the Cooperation between and within Networked Mobile Sensors

Directory of Open Access Journals (Sweden)

Aydan M. Erkmen

2010-09-01

Full Text Available Cooperation between networked mobile sensors, wearable and sycophant sensor networks with parasitically sticking agents, and also having human beings involved in the loop is the “Avatarization” within the robotic research community, where all networks are connected and where you can connect/disconnect at any time to acquire data from a vast unstructured world. This paper extensively surveys the networked robotic foundations of this robotic biological “Avatar” that awaits us in the future. Cooperation between networked mobile sensors as well as cooperation of nodes within a network are becoming more robust, fault tolerant and enable adaptation of the networks to changing environment conditions. In this paper, we survey and comparatively discuss the current state of networked robotics via their critical application areas and their design characteristics. We conclude by discussing future challenges.

The dynamic consequences of cooperation and competition in small-world networks.

Directory of Open Access Journals (Sweden)

Iván Y Fernández-Rosales

Full Text Available We present a study of the social dynamics among cooperative and competitive actors interacting on a complex network that has a small-world topology. In this model, the state of each actor depends on its previous state in time, its inertia to change, and the influence of its neighboring actors. Using numerical simulations, we determine how the distribution of final states of the actors and measures of the distances between the values of the actors at local and global levels, depend on the number of cooperative to competitive actors and the connectivity of the actors in the network. We find that similar numbers of cooperative and competitive actors yield the lowest values for the local and global measures of the distances between the values of the actors. On the other hand, when the number of either cooperative or competitive actors dominate the system, then the divergence is largest between the values of the actors. Our findings make new testable predictions on how the dynamics of a conflict depends on the strategies chosen by groups of actors and also have implications for the evolution of behaviors.

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

Directory of Open Access Journals (Sweden)

Xuwen Wang

Full Text Available 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 Intelligent Cooperative Visual Sensor Network for Urban Mobility

Science.gov (United States)

Leone, Giuseppe Riccardo; Petracca, Matteo; Salvetti, Ovidio; Azzarà, Andrea

2017-01-01

Smart cities are demanding solutions for improved traffic efficiency, in order to guarantee optimal access to mobility resources available in urban areas. Intelligent video analytics deployed directly on board embedded sensors offers great opportunities to gather highly informative data about traffic and transport, allowing reconstruction of a real-time neat picture of urban mobility patterns. In this paper, we present a visual sensor network in which each node embeds computer vision logics for analyzing in real time urban traffic. The nodes in the network share their perceptions and build a global and comprehensive interpretation of the analyzed scenes in a cooperative and adaptive fashion. This is possible thanks to an especially designed Internet of Things (IoT) compliant middleware which encompasses in-network event composition as well as full support of Machine-2-Machine (M2M) communication mechanism. The potential of the proposed cooperative visual sensor network is shown with two sample applications in urban mobility connected to the estimation of vehicular flows and parking management. Besides providing detailed results of each key component of the proposed solution, the validity of the approach is demonstrated by extensive field tests that proved the suitability of the system in providing a scalable, adaptable and extensible data collection layer for managing and understanding mobility in smart cities. PMID:29125535

An Intelligent Cooperative Visual Sensor Network for Urban Mobility

Directory of Open Access Journals (Sweden)

Giuseppe Riccardo Leone

2017-11-01

Full Text Available Smart cities are demanding solutions for improved traffic efficiency, in order to guarantee optimal access to mobility resources available in urban areas. Intelligent video analytics deployed directly on board embedded sensors offers great opportunities to gather highly informative data about traffic and transport, allowing reconstruction of a real-time neat picture of urban mobility patterns. In this paper, we present a visual sensor network in which each node embeds computer vision logics for analyzing in real time urban traffic. The nodes in the network share their perceptions and build a global and comprehensive interpretation of the analyzed scenes in a cooperative and adaptive fashion. This is possible thanks to an especially designed Internet of Things (IoT compliant middleware which encompasses in-network event composition as well as full support of Machine-2-Machine (M2M communication mechanism. The potential of the proposed cooperative visual sensor network is shown with two sample applications in urban mobility connected to the estimation of vehicular flows and parking management. Besides providing detailed results of each key component of the proposed solution, the validity of the approach is demonstrated by extensive field tests that proved the suitability of the system in providing a scalable, adaptable and extensible data collection layer for managing and understanding mobility in smart cities.

Cooperative Content Distribution over Wireless Networks for Energy and Delay Minimization

KAUST Repository

Atat, Rachad

2012-06-01

Content distribution with mobile-to-mobile cooperation is studied. Data is sent to mobile terminals on a long range link then the terminals exchange the content using an appropriate short range wireless technology. Unicasting and multicasting are investigated, both on the long range and short range links. Energy minimization is formulated as an optimization problem for each scenario, and the optimal solutions are determined in closed form. Moreover, the schemes are applied in public safety vehicular networks, where Long Term Evolution (LTE) network is used for the long range link, while IEEE 802.11 p is considered for inter-vehicle collaboration on the short range links. Finally, relay-based multicasting is applied in high speed trains for energy and delay minimization. Results show that cooperative schemes outperform non-cooperative ones and other previous related work in terms of energy and delay savings. Furthermore, practical implementation aspects of the proposed methods are also discussed.

Network Coded Cooperation Over Time-Varying Channels

DEFF Research Database (Denmark)

Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Barros, João

2014-01-01

transmissions, e.g., in terms of the rate of packet transmission or the energy consumption. A comprehensive analysis of the MDP solution is carried out under different network conditions to extract optimal rules of packet transmission. Inspired by the extracted rules, we propose two near-optimal heuristics......In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying, half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting M packets from source to two receivers...... as a Markov Decision Process (MDP). The actions of the MDP model include the source and the type of transmission to be used in a given time slot given perfect knowledge of the system state. The cost of packet transmission is defined such that it can incorporate the difference between broadcast and unicast...

An active cooperation-aware spectrum allocation mechanism for body sensor networks.

Science.gov (United States)

Jiang, Fu; Guo, Ying; Peng, Jun; Hu, Jiankun

2015-01-28

A cognitive radio-based spectrum allocation scheme using an active cooperative-aware mechanism is proposed in this paper. The scheme ensures that the primary user and secondary users cooperate actively for their own benefits. The primary user releases some spectrum resources to secondary users to actively stimulate them to actively join the cooperative transmission of the primary user, and secondary users help the primary user to relay data in return, as well as its self-data transmission at the same time. The Stackelberg game is used to evenly and jointly optimize the utilities of both the primary and secondary users. Simulation results show that the proposed active cooperation-aware mechanism could improve the body sensor network performance.

Cognitive strategies take advantage of the cooperative potential of heterogeneous networks

International Nuclear Information System (INIS)

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

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

Bio-Inspired Energy-Aware Protocol Design for Cooperative Wireless Networks

DEFF Research Database (Denmark)

Perrucci, Gian Paolo; Anggraeni, Puri Novelti; Wardana, Satya Ardhy

2011-01-01

In this work, bio-inspired cooperation rules are applied to wireless communication networks. The main goal is to derive cooperative behaviour rules to improve the energy consumption of each mobile device. A medium access control (MAC) protocol particularly designed for peer-to-peer communication...... be achieved by this architecture using game theoretic approaches. As an extension, this work explores the impact of the MAC protocol on the power saving capabilities. This result shows that standard MAC mechanisms are not optimised for the considered cooperative setup. A new MAC protocol is proposed...... among cooperative wireless mobile devices is described. The work is based on a novel communication architecture, where a group of mobile devices are connected both to a cellular base station and among them using short-range communication links. A prior work has investigated the energy saving that can...

Cooperative driving in mixed traffic networks - Optimizing for performance

NARCIS (Netherlands)

Calvert, S.C.; Broek, T.H.A. van den; Noort, M. van

2012-01-01

This paper discusses a cooperative adaptive cruise control application and its effects on the traffic system. In previous work this application has been tested on the road, and traffic simulation has been used to scale up the results of the field test to larger networks and more vehicles. The

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

Science.gov (United States)

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.

Conceptual Considerations for Reducing the Computational Complexity in Software Defined Radio using Cooperative Wireless Networks

DEFF Research Database (Denmark)

Kristensen, Jesper Michael; Fitzek, Frank H. P.; Koch, Peter

2005-01-01

the expected increase in complexity leading to a decrease in energy efficiency, cooperative wireless networks are introduced. Cooperative wireless networks enables the concept of resource sharing. Resource sharing is interpreted as collaborative signal processing. This interpretation leads to the concept...... of a distributed signal processor. OFDM and the principle of FFT is described as an example of collaborative signal processing....

Viet Nam Economic Research Network (VERN) - Phase II | CRDI ...

International Development Research Centre (IDRC) Digital Library (Canada)

VERN I (101273) constituted the first network for young economic researchers in Viet Nam, where previously there had been no modality for cooperation or peer review. Guided by the philosophy of "understanding and managing globalization" that underpinned the earlier project, VERN II proposes to expand the network, ...

Multihop Capability Analysis in Wireless Information and Power Transfer Multirelay Cooperative Networks

Directory of Open Access Journals (Sweden)

Qilin Wu

2018-01-01

Full Text Available We study simultaneous wireless information and power transfer (SWIPT in multihop wireless cooperative networks, where the multihop capability that denotes the largest number of transmission hops is investigated. By utilizing the broadcast nature of multihop wireless networks, we first propose a cooperative forwarding power (CFP scheme. In CFP scheme, the multiple relays and receiver have distinctly different tasks. Specifically, multiple relays close to the transmitter harvest power from the transmitter first and then cooperatively forward the power (not the information towards the receiver. The receiver receives the information (not the power from the transmitter first, and then it harvests the power from the relays and is taken as the transmitter of the next hop. Furthermore, for performance comparison, we suggest two schemes: cooperative forwarding information and power (CFIP and direct receiving information and power (DFIP. Also, we construct an analysis model to investigate the multihop capabilities of CFP, CFIP, and DFIP schemes under the given targeted throughput requirement. Finally, simulation results validate the analysis model and show that the multihop capability of CFP is better than CFIP and DFIP, and for improving the multihop capabilities, it is best effective to increase the average number of relay nodes in cooperative set.

An Active Cooperation-Aware Spectrum Allocation Mechanism for Body Sensor Networks

Directory of Open Access Journals (Sweden)

Fu Jiang

2015-01-01

Full Text Available A cognitive radio-based spectrum allocation scheme using an active cooperative-aware mechanism is proposed in this paper. The scheme ensures that the primary user and secondary users cooperate actively for their own benefits. The primary user releases some spectrum resources to secondary users to actively stimulate them to actively join the cooperative transmission of the primary user, and secondary users help the primary user to relay data in return, as well as its self-data transmission at the same time. The Stackelberg game is used to evenly and jointly optimize the utilities of both the primary and secondary users. Simulation results show that the proposed active cooperation-aware mechanism could improve the body sensor network performance.

Secure Cooperation of Autonomous Mobile Sensors Using an Underwater Acoustic Network

Directory of Open Access Journals (Sweden)

Gianluca Dini

2012-02-01

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

A dynamically coupled allosteric network underlies binding cooperativity in Src kinase.

Science.gov (United States)

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

2015-01-20

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.

Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms

OpenAIRE

Luo, Zihan; Armour, Simon; McGeehan, Joe

2015-01-01

This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implementedto guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genet...

Network Coded Cooperative Communication in a Real-Time Wireless Hospital Sensor Network.

Science.gov (United States)

Prakash, R; Balaji Ganesh, A; Sivabalan, Somu

2017-05-01

The paper presents a network coded cooperative communication (NC-CC) enabled wireless hospital sensor network architecture for monitoring health as well as postural activities of a patient. A wearable device, referred as a smartband is interfaced with pulse rate, body temperature sensors and an accelerometer along with wireless protocol services, such as Bluetooth and Radio-Frequency transceiver and Wi-Fi. The energy efficiency of wearable device is improved by embedding a linear acceleration based transmission duty cycling algorithm (NC-DRDC). The real-time demonstration is carried-out in a hospital environment to evaluate the performance characteristics, such as power spectral density, energy consumption, signal to noise ratio, packet delivery ratio and transmission offset. The resource sharing and energy efficiency features of network coding technique are improved by proposing an algorithm referred as network coding based dynamic retransmit/rebroadcast decision control (LA-TDC). From the experimental results, it is observed that the proposed LA-TDC algorithm reduces network traffic and end-to-end delay by an average of 27.8% and 21.6%, respectively than traditional network coded wireless transmission. The wireless architecture is deployed in a hospital environment and results are then successfully validated.

Modeling the cooperative and competitive contagions in online social networks

Science.gov (United States)

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 HARQ Assisted NOMA Scheme in Large-scale D2D Networks

KAUST Repository

Shi, Zheng; Ma, Shaodan; Elsawy, Hesham; Yang, Guanghua; Alouini, Mohamed-Slim

2017-01-01

spatial and temporal correlation in interference, highly overestimates the NOMA performance and produces misleading design insights. An interference oblivious selection for the power and/or transmission rates leads to violating the network outage constraints. To this end, the results demonstrate the effectiveness of NOMA transmission and manifest the importance of the cooperative HARQ to combat the negative effect of the network aggregate interference. For instance, comparing to the non-cooperative HARQ assisted NOMA, the proposed scheme can yield an outage probability reduction by $32$%. Furthermore, an interference aware optimal design that maximizes the LTAT given outage constraints leads to $47$% throughput improvement over HARQ-assisted orthogonal multiple access (OMA) scheme.

Research and development cooperation project on environmental measurement using laser radar (environmental network) in fiscal 1993; Kankyo keisokuyo laser radar no kaihatsu ni kansuru kenkyu kyoryoku (kankyo network)

Energy Technology Data Exchange (ETDEWEB)

NONE

1994-03-01

For the purpose of contributing to the research cooperation project on the development of a laser radar for environmental measurement, the paper surveyed the present and future trend of the environment related information network in Indonesia. The survey was conducted in terms of a name of the network, the main administration body, the number of users, the utilization status, the use protocol, details of service, domestic mode installation sites and the main administration body, accounting system, types of the network used, reliability and stability of network, limitations on the use and details of the limitation, etc. The plan for expanding telecommunication equipment is being advanced in a very quick tempo. However, there are many problems in digitalization, and it is feared that the plan will be delayed. As to telecommunication quality and connection quality, the telecommunication completion rate, SCR, is very low, approximately 24% on average, which is equal to that around 1990 in Japan. The business service for users is all bureaucratic since they have a lot of applications for the installation piling up with no exception to the rule of developing countries. 23 figs., 10 tabs.

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

Science.gov (United States)

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.

Networks and RegionalCompetitiveness: Towards a Transaction Cost Approach of Small-Scale Cooperation

Directory of Open Access Journals (Sweden)

Daniel Friel

2005-06-01

Full Text Available A preoccupation with competition often dominates the study of governance. A focus on competition often unnecessarily precludes the possibility that regional institutions can suspend competition in certain areas and facilitate cooperation among potential rivals, thereby potentially contributing to their mutual success. In many ways companies cooperating through these types of networks have a greater degree of flexibility than firms which are forced to rely solely on hierarchies or markets for solutions to their problems. In order to fully understand how such networks work, this article first parses out differences in definitions of networks in order to understand how the type of network mentioned above actually differs from other uses of this term. Then it develops a theory of governance that goes beyond hierarchies and markets by demonstrating how this type of network can lead to reductions in transaction costs. This claim is illustrated on hand from examples of alternative forms of organization in Germany and Italy.

Dry Ports-Seaports Sustainable Logistics Network Optimization: Considering the Environment Constraints and the Concession Cooperation Relationships

Directory of Open Access Journals (Sweden)

Wei Hairui

2017-11-01

Full Text Available In China dry ports enter into a rapid development period now, however for many Chinese dry ports, the operation faces difficulties duo to inefficient logistics networks and cooperation relationship between dry ports and seaports. Focusing on the concession cooperation mechanism of seaports and dry ports, and the environmental constraints (carbon emissions and congestion cost, a bi-objective location-allocation MILP model for the sustainable hinterland-dry ports-seaports logistics network optimization is formulated, aiming at the system logistics costs and carbon emissions to be minimized. Moreover, for the cooperation mechanism of seaports to dry ports, a parameter called cooperation cost concession coefficient is proposed for the optimization model, and a new evaluation method based on the ordered weighted averaging (OWA operator is used to evaluate it. Then a location-allocation decision-making framework for the hinterland-dry port-seaport logistics network is proposed. The innovative aspect of the model is that it can proposes a effective and environment friendly dry ports location strategic and also give insights into the connective cooperation relationships, and cargo flows of the network. A case study involving configuration of dry ports in Henan Province is conducted, and the model is successfully applied.

Phase transitions in cooperative coinfections: Simulation results for networks and lattices

Science.gov (United States)

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

2016-04-01

We study the spreading of two mutually cooperative diseases on different network topologies, and with two microscopic realizations, both of which are stochastic versions of a susceptible-infected-removed type model studied by us recently in mean field approximation. There it had been found that cooperativity can lead to first order transitions from spreading to extinction. However, due to the rapid mixing implied by the mean field assumption, first order transitions required nonzero initial densities of sick individuals. For the stochastic model studied here the results depend strongly on the underlying network. First order transitions are found when there are few short but many long loops: (i) No first order transitions exist on trees and on 2-d lattices with local contacts. (ii) They do exist on Erdős-Rényi (ER) networks, on d -dimensional lattices with d ≥4 , and on 2-d lattices with sufficiently long-ranged contacts. (iii) On 3-d lattices with local contacts the results depend on the microscopic details of the implementation. (iv) While single infected seeds can always lead to infinite epidemics on regular lattices, on ER networks one sometimes needs finite initial densities of infected nodes. (v) In all cases the first order transitions are actually "hybrid"; i.e., they display also power law scaling usually associated with second order transitions. On regular lattices, our model can also be interpreted as the growth of an interface due to cooperative attachment of two species of particles. Critically pinned interfaces in this model seem to be in different universality classes than standard critically pinned interfaces in models with forbidden overhangs. Finally, the detailed results mentioned above hold only when both diseases propagate along the same network of links. If they use different links, results can be rather different in detail, but are similar overall.

On the Throughput and Energy Benefits of Network Coded Cooperation

OpenAIRE

Hernandez, Nestor; Heide, Janus; Roetter, Daniel Enrique Lucani; Fitzek, Frank

2014-01-01

Cooperative techniques in wireless mobile networks typically leverage short-range communication technologies, e.g., WiFi, to allow data exchange between devices forming a mobile cloud. These mobile clouds have been considered as a key to reduce the cost of multicast services for the network operators as well as a means to deliver a better quality to the users. In fact, LTE-A includes Device-to-Device communication capabilities to enable such a direct communication between devices. The underly...

Team Cooperation in a Network of Multi-Vehicle Unmanned Systems Synthesis of Consensus Algorithms

CERN Document Server

Semsar-Kazerooni, Elham

2013-01-01

Team Cooperation in a Network of Multi-Vehicle Unmanned Systems develops a framework for modeling and control of a network of multi-agent unmanned systems in a cooperative manner and with consideration of non-ideal and practical considerations. The main focus of this book is the development of “synthesis-based” algorithms rather than on conventional “analysis-based” approaches to the team cooperation, specifically the team consensus problems. The authors provide a set of modified “design-based” consensus algorithms whose optimality is verified through introduction of performance indices. This book also: Provides synthesis-based methodology for team cooperation Introduces a consensus-protocol optimized performance index  Offers comparisons for use of proper indices in measuring team performance Analyzes and predicts  performance of  previously designed consensus algorithms Analyses and predicts team behavior in the presence of non-ideal considerations such as actuator anomalies and faults as wel...

Geostrategic Context of Networking of National Minority Communities in Territorial Cooperation Programmes of the EU

Directory of Open Access Journals (Sweden)

Márton Péti

2016-12-01

Full Text Available The participation of Hungary and Hungarian regions outside of Hungary in transnational and interregional programmes within the framework of the third objective (European Territorial Cooperation of the European Union's Cohesion Policy 2007-2013 is an indicator suitable for analysing the international networking activity of Central European national minorities. These programme areas are very well in alignment with the settlement areas of Hungarians and thus it provides a great opportunity for cooperation in the field of regional developments. The study on the participation of Hungarian organizations in and outside of Hungary in the programming period of 2007-2013 shows; however, that Hungarian organizations outside of Hungary only partly utilize their networking potential and they worked with organisations of the mother country in only a few projects. Policies on cooperation may contribute to further utilize this networking potential.

Cooperative HARQ Assisted NOMA Scheme in Large-scale D2D Networks

KAUST Repository

Shi, Zheng

2017-07-13

This paper develops an interference aware design for cooperative hybrid automatic repeat request (HARQ) assisted non-orthogonal multiple access (NOMA) scheme for large-scale device-to-device (D2D) networks. Specifically, interference aware rate selection and power allocation are considered to maximize long term average throughput (LTAT) and area spectral efficiency (ASE). The design framework is based on stochastic geometry that jointly accounts for the spatial interference correlation at the NOMA receivers as well as the temporal interference correlation across HARQ transmissions. It is found that ignoring the effect of the aggregate interference, or overlooking the spatial and temporal correlation in interference, highly overestimates the NOMA performance and produces misleading design insights. An interference oblivious selection for the power and/or transmission rates leads to violating the network outage constraints. To this end, the results demonstrate the effectiveness of NOMA transmission and manifest the importance of the cooperative HARQ to combat the negative effect of the network aggregate interference. For instance, comparing to the non-cooperative HARQ assisted NOMA, the proposed scheme can yield an outage probability reduction by $32$%. Furthermore, an interference aware optimal design that maximizes the LTAT given outage constraints leads to $47$% throughput improvement over HARQ-assisted orthogonal multiple access (OMA) scheme.

Coevolution of Synchronization and Cooperation in Costly Networked Interactions

Science.gov (United States)

Antonioni, Alberto; Cardillo, Alessio

2017-06-01

Despite the large number of studies on synchronization, the hypothesis that interactions bear a cost for involved individuals has seldom been considered. The introduction of costly interactions leads, instead, to the formulation of a dichotomous scenario in which an individual may decide to cooperate and pay the cost in order to get synchronized with the rest of the population. Alternatively, the same individual can decide to free ride, without incurring any cost, waiting for others to get synchronized to his or her state. Thus, the emergence of synchronization may be seen as the byproduct of an evolutionary game in which individuals decide their behavior according to the benefit-to-cost ratio they accrued in the past. We study the onset of cooperation and synchronization in networked populations of Kuramoto oscillators and report how topology is essential in order for cooperation to thrive. We also display how different classes of topology foster synchronization differently both at microscopic and macroscopic levels.

Ageing as a price of cooperation and complexity: self-organization of complex systems causes the gradual deterioration of constituent networks.

Science.gov (United States)

Kiss, Huba J M; Mihalik, Agoston; Nánási, Tibor; Ory, Bálint; Spiró, Zoltán; Soti, Csaba; Csermely, Peter

2009-06-01

The network concept is increasingly used for the description of complex systems. Here, we summarize key aspects of the evolvability and robustness of the hierarchical network set of macromolecules, cells, organisms and ecosystems. Listing the costs and benefits of cooperation as a necessary behaviour to build this network hierarchy, we outline the major hypothesis of the paper: the emergence of hierarchical complexity needs cooperation leading to the ageing (i.e. gradual deterioration) of the constituent networks. A stable environment develops cooperation leading to over-optimization, and forming an 'always-old' network, which accumulates damage, and dies in an apoptosis-like process. A rapidly changing environment develops competition forming a 'forever-young' network, which may suffer an occasional over-perturbation exhausting system resources, and causing death in a necrosis-like process. Giving a number of examples we demonstrate how cooperation evokes the gradual accumulation of damage typical to ageing. Finally, we show how various forms of cooperation and consequent ageing emerge as key elements in all major steps of evolution from the formation of protocells to the establishment of the globalized, modern human society.

Ecological connectivity networks in rapidly expanding cities.

Science.gov (United States)

Nor, Amal Najihah M; Corstanje, Ron; Harris, Jim A; Grafius, Darren R; Siriwardena, Gavin M

2017-06-01

Urban expansion increases fragmentation of the landscape. In effect, fragmentation decreases connectivity, causes green space loss and impacts upon the ecology and function of green space. Restoration of the functionality of green space often requires restoring the ecological connectivity of this green space within the city matrix. However, identifying ecological corridors that integrate different structural and functional connectivity of green space remains vague. Assessing connectivity for developing an ecological network by using efficient models is essential to improve these networks under rapid urban expansion. This paper presents a novel methodological approach to assess and model connectivity for the Eurasian tree sparrow ( Passer montanus ) and Yellow-vented bulbul ( Pycnonotus goiavier ) in three cities (Kuala Lumpur, Malaysia; Jakarta, Indonesia and Metro Manila, Philippines). The approach identifies potential priority corridors for ecological connectivity networks. The study combined circuit models, connectivity analysis and least-cost models to identify potential corridors by integrating structure and function of green space patches to provide reliable ecological connectivity network models in the cities. Relevant parameters such as landscape resistance and green space structure (vegetation density, patch size and patch distance) were derived from an expert and literature-based approach based on the preference of bird behaviour. The integrated models allowed the assessment of connectivity for both species using different measures of green space structure revealing the potential corridors and least-cost pathways for both bird species at the patch sites. The implementation of improvements to the identified corridors could increase the connectivity of green space. This study provides examples of how combining models can contribute to the improvement of ecological networks in rapidly expanding cities and demonstrates the usefulness of such models for

Ecological connectivity networks in rapidly expanding cities

Directory of Open Access Journals (Sweden)

Amal Najihah M. Nor

2017-06-01

Full Text Available Urban expansion increases fragmentation of the landscape. In effect, fragmentation decreases connectivity, causes green space loss and impacts upon the ecology and function of green space. Restoration of the functionality of green space often requires restoring the ecological connectivity of this green space within the city matrix. However, identifying ecological corridors that integrate different structural and functional connectivity of green space remains vague. Assessing connectivity for developing an ecological network by using efficient models is essential to improve these networks under rapid urban expansion. This paper presents a novel methodological approach to assess and model connectivity for the Eurasian tree sparrow (Passer montanus and Yellow-vented bulbul (Pycnonotus goiavier in three cities (Kuala Lumpur, Malaysia; Jakarta, Indonesia and Metro Manila, Philippines. The approach identifies potential priority corridors for ecological connectivity networks. The study combined circuit models, connectivity analysis and least-cost models to identify potential corridors by integrating structure and function of green space patches to provide reliable ecological connectivity network models in the cities. Relevant parameters such as landscape resistance and green space structure (vegetation density, patch size and patch distance were derived from an expert and literature-based approach based on the preference of bird behaviour. The integrated models allowed the assessment of connectivity for both species using different measures of green space structure revealing the potential corridors and least-cost pathways for both bird species at the patch sites. The implementation of improvements to the identified corridors could increase the connectivity of green space. This study provides examples of how combining models can contribute to the improvement of ecological networks in rapidly expanding cities and demonstrates the usefulness of such

Histone chaperone networks shaping chromatin function

DEFF Research Database (Denmark)

Hammond, Colin; Strømme, Caroline Bianchi; Huang, Hongda

2017-01-01

and fate, which affects all chromosomal processes, including gene expression, chromosome segregation and genome replication and repair. Here, we review the distinct structural and functional properties of the expanding network of histone chaperones. We emphasize how chaperones cooperate in the histone...... chaperone network and via co-chaperone complexes to match histone supply with demand, thereby promoting proper nucleosome assembly and maintaining epigenetic information by recycling modified histones evicted from chromatin....

Social penalty promotes cooperation in a cooperative society.

Science.gov (United States)

Ito, Hiromu; Yoshimura, Jin

2015-08-04

Why cooperation is well developed in human society is an unsolved question in biological and human sciences. Vast studies in game theory have revealed that in non-cooperative games selfish behavior generally dominates over cooperation and cooperation can be evolved only under very limited conditions. These studies ask the origin of cooperation; whether cooperation can evolve in a group of selfish individuals. In this paper, instead of asking the origin of cooperation, we consider the enhancement of cooperation in a small already cooperative society. We ask whether cooperative behavior is further promoted in a small cooperative society in which social penalty is devised. We analyze hawk-dove game and prisoner's dilemma introducing social penalty. We then expand it for non-cooperative games in general. The results indicate that cooperation is universally favored if penalty is further imposed. We discuss the current result in terms of the moral, laws, rules and regulations in a society, e.g., criminology and traffic violation.

Global Business Networks and Cooperation within Supply Chain as a Strategy of High-Tech Companies’ Growth

Directory of Open Access Journals (Sweden)

Milena Ratajczak-Mrozek

2012-01-01

Full Text Available Abstract The specificity of the operation profile of high-tech companies, including the necessity of operating at the international scale may account for the fact that these companies may find in network relationships, business networks and cooperation an essential determinant for growth and competitiveness. Foreign entities should be especially interesting business partners for high- tech companies, as they are often seen as representing more advanced knowledge, resources and experience. The aim of the article is to point out to global business networks (i.e. including both local and foreign entities, and especially to cooperation within supply chain, as an important basis for a growth strategy of a high-tech company. The article adopts assumptions of the network approach as a concept of companies cooperation. An analysis of the author’s own as well as secondary empirical research, with the focus on high- tech companies located in Poland is presented. In particular, the data from own research of 62 high-tech companies in Poland conducted in the first half of 2011 is analysed. It shows that the high-tech companies placing great importance on cooperation within supply chain demonstrate a higher growth and level of competitiveness than the companies which do not ascribe such importance (bearing in mind that supply chain forms an important part of a business network.

Cooperative games and network structures

NARCIS (Netherlands)

Musegaas, Marieke

2017-01-01

This thesis covers various research topics involving cooperative game theory, a mathematical tool to analyze the cooperative behavior within a group of players. The focus is mainly on interrelations between operations research and cooperative game theory by analyzing specific types of cooperative

The potential for expanding inter-cluster cooperation between the ship-building industries of Estonia, Finland, and North-West Russia

Directory of Open Access Journals (Sweden)

Laaksonen Eini

2013-01-01

Full Text Available The shipbuilding industry clusters in the Eastern Baltic Sea region, i. e. Estonia, Finland and North-West Russia, may benefit significantly from increased mutual cooperation; however, the international networks between the clusters are still poorly developed. The aim of this article is to analyse the preconditions for cluster internationalization between these clusters, which are rather different but complementary in terms of skills. The research material for this desk study was collected from various sources, including journal articles, media, research reports, and other publications. The results of the study indicate that the increasing cooperation within the triangle of these clusters has a significant potential in terms of combining different areas of expertise and creating a multidimensional maritime industry hub in the region. However, differences in the cluster structure and development stages lead to certain difficulties in achieving these objectives. In conclusion, the authors identify the factors both facilitating and inhibiting networking between the three clusters. This study provides a platform for further research focusing on the factors identified and gives ideas for public discussion on increased inter-cluster cooperation.

The potential for expanding inter-cluster cooperation between the ship-building industries of Estonia, Finland, and North-West Russia

Directory of Open Access Journals (Sweden)

Laaksonen Eini

2013-12-01

Full Text Available The shipbuilding industry clusters in the Eastern Baltic Sea region, i. e. Estonia, Finland and North-West Russia, may benefit significantly from increased mutual cooperation; however, the international networks between the clusters are still poorly developed. The aim of this article is to analyse the preconditions for cluster internationalization between these clusters, which are rather different but complementary in terms of skills. The research material for this desk study was collected from various sources, including journal articles, media, research reports, and other publications. The results of the study indicate that the increasing cooperation within the triangle of these clusters has a significant potential in terms of combining different areas of expertise and creating a multidimensional maritime industry hub in the region. However, differences in the cluster structure and development stages lead to certain difficulties in achieving these objectives. In conclusion, the authors identify the factors both facilitating and inhibiting networking between the three clusters. This study provides a platform for further research focusing on the factors identified and gives ideas for public discussion on increased inter-cluster cooperation.

On Optimal Policies for Network-Coded Cooperation

DEFF Research Database (Denmark)

Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

2015-01-01

Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios...... rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled...... as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use...

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

Directory of Open Access Journals (Sweden)

Gong Xue

2018-02-01

Full Text Available 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 students's cooperative learning in the network environment. Survey results showed that cooperative learning teaching mode has been widely used in English classrooms across the Taiwan Strait. Students think highly of cooperative learning in the multimedia-aided, and it can have a positive effect on learning; but on cooperative learning ability and the specific learning process, students still have some problems.Nowadays,cooperative learning in the network environment has various ways, but there exist certain differences in the learning styles across the Strait. Taiwan students rely more on teachers’ help and teachers feedback, while students in mainland depend mainly on networking and panel discussion. On qualitative analysis of interview is a supplement to the questionnaire and further explore its deeper causes, which provide valuable evidence for the study and learning practice. Finally, according to the comparative analysis ,the author puts forward some constructive suggestions.

The facilitation of groups and networks: capabilities to shape creative cooperation

DEFF Research Database (Denmark)

Rasmussen, Lauge Baungaard

2003-01-01

The facilitator, defined as a process guide of creative cooperation, is becoming more and more in focus to assist groups,teams and networks to meet these challenges. The author defines and exemplifies different levels of creative coorperation. Core capabilities of facilitation are defined...

A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange

KAUST Repository

Douik, Ahmed S.

2014-05-11

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.

A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange

KAUST Repository

Douik, Ahmed S.; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim; Sorour, Sameh; Tembine, Hamidou

2014-01-01

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.

Cooperative Spatial Reuse with Transmit Beamforming in Multi-rate Wireless Networks

DEFF Research Database (Denmark)

Lu, Chenguang; Fitzek, Frank; Eggers, Patrick Claus F.

2009-01-01

We present a cooperative spatial reuse (CSR) scheme as a cooperative extension of the current TDMA-based MAC to enable spatial reuse in multi-rate wireless networks. We model spatial reuse as a cooperation problem on utilizing the time slots obtained from the TDMA-based MAC. In CSR, there are two...... operation modes. One is TDMA mode while the other is spatial reuse mode in which links transmit simultaneously. Links contribute their own time slots to form a cooperative group to do spatial reuse. Each link joins the group only if it can benefit in capacity or energy efficiency. Otherwise, the link...... will leave spatial reuse mode and switch back to TDMA. In this work, we focus on the transmit beamforming techniques to enable CSR by interference cancellation on MISO (Multiple Input Single Output) links. We compare the CSR scheme using zero-forcing (ZF) transmit beamforming, namely ZF-CSR, to the TDMA...

Effect of local information within network layers on the evolution of cooperation in duplex public goods games

International Nuclear Information System (INIS)

Zhou, Yifeng; Zheng, Xiaoming; Wu, Weiwei

2015-01-01

Traditional works of public goods game (PGG) are often studied in simplex networks where agents play games through the same type of social interactions. In order to promote cooperation against the defection in PGGs in simplex network environment, many mechanisms have been proposed from different perspectives, such as the volunteering mechanisms, and the punishment and reward approaches. However, due to diverse types of interactions between agents in reality, the study of PGG should also consider the characteristic of multiplexity of networks. Hence, we firstly model the public goods game in the duplex network (for simplification of analysis, the duplex network is considered), in which agents have two types of social interactions, and thus the network is modeled as two network layers. This type of PGG is naturally named as duplex public goods game (D-PGG), in which agents can select one of the network layers to allocate their limited resources. Then for the new game environment (D-PGG), we propose a novel perspective to promote cooperation: degrading the information integrity, i.e., agents get information just from one network layer (local information) rather than from the whole duplex network (global information) in the evolution process. Finally, through theoretical analyses and simulations, we find that if agents imitate based on the local information of the payoff in the evolution, cooperation can be generally promoted; and the extent of promotion depends on both the network structure and the similarity of the network layers

The Role of Delay and Connectivity in Throughput Reduction of Cooperative Decentralized Wireless Networks

Directory of Open Access Journals (Sweden)

Ahmed Alkhayyat

2015-01-01

Full Text Available We proposed a multiple relay selection protocol for decentralized wireless networks. The proposed relays selection protocol aims to address three issues: (1 selecting relays within the coverage area of the source and destination to ensure that the relays are positioned one hop away from the destination, (2 ensuring that the best node (best relays with less distance and attenuation from the destination access the channel first, and (3 ensuring that the proposed relays selection is collision-free. Our analysis also considers three important characteristics of decentralized wireless networks that are directly affected by cooperation: delay, connectivity, and throughput. The main goal of this paper is to demonstrate that improving connectivity and increasing number of relays reduce the throughput of cooperative decentralized wireless networks; consequently, a trade-off equation has been derived.

Energy Efficiency Analysis of a Two Dimensional Cooperative Wireless Sensor Network with Relay Selection

Directory of Open Access Journals (Sweden)

M. Kakitani

2013-06-01

Full Text Available The energy efficiency of non-cooperative and cooperative transmissions are investigated in a two-dimensional wireless sensor network, considering a target outage probability and the same end-to-end throughput for all transmission schemes. The impact of the relay selection method in the cooperative schemes is also analyzed. We show that under non line-of-sight conditions the relay selection method has a greater impact in the energy efficiency than the availability of a return channel. By its turn, under line-of-sight conditions a return channel is more valuable to the energy efficiency of cooperative transmission than the specific relay selection method. Finally, we demonstrate that the energy efficiency advantage of the cooperative over the non-cooperative transmission increases with the distance among nodes and with the nodes density.

Outage analysis of selective cooperation in underlay cognitive networks with fixed gain relays and primary interference modeling

KAUST Repository

Hussain, Syed Imtiaz

2012-09-01

Selective cooperation is a well investigated technique in non-cognitive networks for efficient spectrum utilization and performance improvement. However, it is still a nascent topic for underlay cognitive networks. Recently, it was investigated for underlay networks where the secondary nodes were able to adapt their transmit power to always satisfy the interference threshold to the primary users. This is a valid assumption for cellular networks but many non-cellular devices have fixed transmit powers. In this situation, selective cooperation poses a more challenging problem and performs entirely differently. In this paper, we extend our previous work of selective cooperation based on either hop\\'s signal to noise ratio (SNR) with fixed gain and fixed transmit power relays in an underlay cognitive network. This work lacked in considering the primary interference over the cognitive network and presented a rather idealistic analysis. This paper deals with a more realistic system model and includes the effects of primary interference on the secondary transmission. We first derive end-to-end signal to interference and noise ratio (SINR) expression and the related statistics for a dual-hop relay link using asymptotic and approximate approaches. We then derive the statistics of the selected relay link based on maximum end-to-end SINR among the relays satisfying the interference threshold to the primary user. Using this statistics, we derive closed form asymptotic and approximate expressions for the outage probability of the system. Analytical results are verified through simulations. It is concluded that selective cooperation in underlay cognitive networks performs better only in low to medium SNR regions. © 2012 IEEE.

Design and Profit Allocation in Two-Echelon Heterogeneous Cooperative Logistics Network Optimization

Directory of Open Access Journals (Sweden)

Yong Wang

2018-01-01

Full Text Available In modern supply chain, logistics companies usually operate individually and optimization researches often concentrate on solving problems related to separate networks. Consequences like the complexity of urban transportation networks and long distance deliveries or pickups and pollution are leading problems to more expenses and more complaints from environment protection organizations. A solution approach to these issues is proposed in this article and consists in the adoption of two-echelon heterogeneous cooperative logistics networks (THCLN. The optimization methodology includes the formation of cooperative coalitions, the reallocation of customers to appropriate logistics facilities, and the determination of the best profit allocation scheme. First, a mixed integer linear programing model is introduced to minimize the total operating cost of nonempty coalitions. Thus, the Genetic Algorithm (GA and the Particle Swarm Optimization (PSO algorithm are hybridized to propose GA-PSO heuristics. GA-PSO is employed to provide good solutions to customer clustering units’ reallocation problem. In addition, a negotiation process is established based on logistics centers as coordinators. The case study of Chongqing city is conducted to verify the feasibility of THCLN in practice. The grand coalition and two heterogeneous subcoalitions are designed, and the collective profit is distributed based on cooperative game theory. The Minimum Cost Remaining Savings (MCRS model is used to determine good allocation schemes and strictly monotonic path principles are considered to evaluate and decide the most appropriate coalition sequence. Comparisons proved the combination of GA-PSO and MCRS better as results are found closest to the core center. Therefore, the proposed approach can be implemented in real world environment, increase the reliability of urban logistics network, and allow decision makers to improve service efficiency.

Formation of nanoscale networks: selectively swelling amphiphilic block copolymers with CO2-expanded liquids.

Science.gov (United States)

Gong, Jianliang; Zhang, Aijuan; Bai, Hua; Zhang, Qingkun; Du, Can; Li, Lei; Hong, Yanzhen; Li, Jun

2013-02-07

Polymeric films with nanoscale networks were prepared by selectively swelling an amphiphilic diblock copolymer, polystyrene-block-poly(4-vinylpyridine) (PS-b-P4VP), with the CO(2)-expanded liquid (CXL), CO(2)-methanol. The phase behavior of the CO(2)-methanol system was investigated by both theoretical calculation and experiments, revealing that methanol can be expanded by CO(2), forming homogeneous CXL under the experimental conditions. When treated with the CO(2)-methanol system, the spin cast compact PS-b-P4VP film was transformed into a network with interconnected pores, in a pressure range of 12-20 MPa and a temperature range of 45-60 °C. The formation mechanism of the network, involving plasticization of PS and selective swelling of P4VP, was proposed. Because the diblock copolymer diffusion process is controlled by the activated hopping of individual block copolymer chains with the thermodynamic barrier for moving PVP segments from one to another, the formation of the network structures is achieved in a short time scale and shows "thermodynamically restricted" character. Furthermore, the resulting polymer networks were employed as templates, for the preparation of polypyrrole networks, by an electrochemical polymerization process. The prepared porous polypyrrole film was used to fabricate a chemoresistor-type gas sensor which showed high sensitivity towards ammonia.

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

Directory of Open Access Journals (Sweden)

Hina Nasir

2016-07-01

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

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

Science.gov (United States)

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.

IAEA Expands International Cooperation on Small, Medium Sized or Modular Nuclear Reactors

International Nuclear Information System (INIS)

2018-01-01

The International Atomic Energy Agency (IAEA) is launching an effort to expand international cooperation and coordination in the design, development and deployment of small, medium sized or modular reactors (SMRs), among the most promising emerging technologies in nuclear power. Significant advances have been made on SMRs, some of which will use pre-fabricated systems and components to shorten construction schedules and offer greater flexibility and affordability than traditional nuclear power plants. With some 50 SMR concepts at various stages of development around the world, the IAEA is forming a Technical Working Group (TWG) to guide its activities on SMRs and provide a forum for Member States to share information and knowledge, IAEA Deputy Director General Mikhail Chudakov said. “Innovation is crucial for nuclear power to play a key role in decarbonising the energy sector,” Chudakov, who heads the IAEA Department of Nuclear Energy, said at a conference on SMRs in Prague on 15 February. “Many Member States that are operating, expanding, introducing or considering nuclear power are quite keen on the development and deployment of SMRs.” Global interest in SMRs is growing. SMRs have the potential to meet the needs of a wide range of users and to be low carbon replacements for ageing fossil fuel fired power plants. They also display enhanced safety features and are suitable for non-electric applications, such as cooling, heating and water desalination. In addition, SMRs offer options for remote regions with less developed infrastructure and for energy systems that combine nuclear and alternative sources, including renewables.

Cooperative Technique Based on Sensor Selection in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

ISLAM, M. R.

2009-02-01

Full Text Available An energy efficient cooperative technique is proposed for the IEEE 1451 based Wireless Sensor Networks. Selected numbers of Wireless Transducer Interface Modules (WTIMs are used to form a Multiple Input Single Output (MISO structure wirelessly connected with a Network Capable Application Processor (NCAP. Energy efficiency and delay of the proposed architecture are derived for different combination of cluster size and selected number of WTIMs. Optimized constellation parameters are used for evaluating derived parameters. The results show that the selected MISO structure outperforms the unselected MISO structure and it shows energy efficient performance than SISO structure after a certain distance.

Innovations in the Baltic Sea Region and Network Cooperation between Russia and the EU

Directory of Open Access Journals (Sweden)

Fedorov Gennady

2013-03-01

Full Text Available Transnational (involving countries and cross-border (involving adjacent regions of different countries cooperation and integration are rapidly developing in the Baltic Sea region. Russia lags behind the Nordic countries and Germany as far as innovative development is concerned; yet our national pace here is comparable to that of Poland and the three Baltic States. At the same time, the features of innovative cooperation vary a great deal depending on the group of countries involved in cooperation processes. Independent of its type, however, international cooperation is beneficial for all parties concerned and should therefore be more actively encouraged. Northwestern Federal District traditionally plays a special role in the development of EU-Russia cooperation, since a number of its regions border on the EU countries. The district participates in the development of network innovative structures within the Baltic Sea region. It takes an active part in cross-border cooperation — activities that involve the formation of transborder innovative clusters. There are high expectations associated with the formation of such territorially localised innovative networks, as the Helsinki — Saint Petersburg — Tallinn and Tricity (Gdansk, Gdynia, Sopot — Kaliningrad — Klaipeda transborder innovative clusters. The city of Saint Petersburg and the adjacent Leningrad region, as well as the Kaliningrad region can become innovative development corridors between Russia and the EU and, eventually, develop into the ‘economic growth poles’ of the Russian Federation.

Modeling and performance analysis of cooperative communications in cognitive radio networks

KAUST Repository

Khabazian, Mehdi

2011-09-01

In this paper, we study the performance of a network comprised of a primary user and a secondary user with the latter having cognitive radio capabilities. The secondary node uses the empty slots of the primary user to transmit its own traffic as well as to relay the primary\\'s traffic in a cooperative fashion. Taking a queuing theory approach, we find the probability generating functions of the numbers of packets in the queues of the primary and secondary users. Subsequently, we determine a number of performance measures such as the average queues\\' lengths, average packet transmission delays and secondary user\\'s queue surcharge due to cooperation. The numerical results along with the simulations show the importance of controlling the number of primary user packets admitted by the secondary user for cooperation and its impacts on the other performance measures. © 2011 IEEE.

Sequential Uniformly Reweighted Sum-Product Algorithm for Cooperative Localization in Wireless Networks

OpenAIRE

Li, Wei; Yang, Zhen; Hu, Haifeng

2014-01-01

Graphical models have been widely applied in solving distributed inference problems in wireless networks. In this paper, we formulate the cooperative localization problem in a mobile network as an inference problem on a factor graph. Using a sequential schedule of message updates, a sequential uniformly reweighted sum-product algorithm (SURW-SPA) is developed for mobile localization problems. The proposed algorithm combines the distributed nature of belief propagation (BP) with the improved p...

Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

Directory of Open Access Journals (Sweden)

Narottam Chand

2007-01-01

Full Text Available Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV, to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC, is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation.

Science.gov (United States)

Waheed, Maham; Ahmad, Rizwan; Ahmed, Waqas; Drieberg, Micheal; Alam, Muhammad Mahtab

2018-02-13

The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs). Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor's battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE) and packet error rate (PER) are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC) coding the cooperative link.

Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation

Directory of Open Access Journals (Sweden)

Maham Waheed

2018-02-01

Full Text Available The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs. Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor’s battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE and packet error rate (PER are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC coding the cooperative link.

Energy Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks Using Distributed Dynamic Load Balanced Clustering Scheme

Directory of Open Access Journals (Sweden)

Muthukkumar R.

2017-04-01

Full Text Available Cognitive Radio (CR is a promising and potential technique to enable secondary users (SUs or unlicenced users to exploit the unused spectrum resources effectively possessed by primary users (PUs or licenced users. The proven clustering approach is used to organize nodes in the network into the logical groups to attain energy efficiency, network scalability, and stability for improving the sensing accuracy in CR through cooperative spectrum sensing (CSS. In this paper, a distributed dynamic load balanced clustering (DDLBC algorithm is proposed. In this algorithm, each member in the cluster is to calculate the cooperative gain, residual energy, distance, and sensing cost from the neighboring clusters to perform the optimal decision. Each member in a cluster participates in selecting a cluster head (CH through cooperative gain, and residual energy that minimises network energy consumption and enhances the channel sensing. First, we form the number of clusters using the Markov decision process (MDP model to reduce the energy consumption in a network. In this algorithm, CR users effectively utilize the PUs reporting time slots of unavailability. The simulation results reveal that the clusters convergence, energy efficiency, and accuracy of channel sensing increased considerably by using the proposed algorithm.

Energy Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks Using Distributed Dynamic Load Balanced Clustering Scheme

Directory of Open Access Journals (Sweden)

Muthukkumar R.

2016-07-01

Full Text Available Cognitive Radio (CR is a promising and potential technique to enable secondary users (SUs or unlicenced users to exploit the unused spectrum resources effectively possessed by primary users (PUs or licenced users. The proven clustering approach is used to organize nodes in the network into the logical groups to attain energy efficiency, network scalability, and stability for improving the sensing accuracy in CR through cooperative spectrum sensing (CSS. In this paper, a distributed dynamic load balanced clustering (DDLBC algorithm is proposed. In this algorithm, each member in the cluster is to calculate the cooperative gain, residual energy, distance, and sensing cost from the neighboring clusters to perform the optimal decision. Each member in a cluster participates in selecting a cluster head (CH through cooperative gain, and residual energy that minimises network energy consumption and enhances the channel sensing. First, we form the number of clusters using the Markov decision process (MDP model to reduce the energy consumption in a network. In this algorithm, CR users effectively utilize the PUs reporting time slots of unavailability. The simulation results reveal that the clusters convergence, energy efficiency, and accuracy of channel sensing increased considerably by using the proposed algorithm.

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

Science.gov (United States)

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.

Interorganisational networking as the principal form of technological, innovative and research cooperation between Russia and the European Union in the Baltic region

Directory of Open Access Journals (Sweden)

Bolychev Oleg

2013-12-01

Full Text Available This article concerns the role that international cooperation in research, technology, and innovation plays in ensuring innovative development and producing an innovative model of the Russian economy. One of the key objectives of the country’s integration into international research, technological, and innovative space is the development of Russia-EU cooperation in the Baltic region. It is established that, with the development of integration connections and regionalization processes, interorganizational networking takes on special importance in the organization and development of the innovative space. The authors analyze the existing typologies of forms of cooperation in the field of research, technology, and innovation, within which cases of networking are identified. The article gives a definition of interorganizational networks in view of the spatial and structural components of networking. The authors introduce the notion of international interorganizational networks as a special form of international cooperation. A study into the spatial form of interorganizational networks helps explain the effect of different levels and types of economic integration. Key areas of research on international interorganizational networks are identified in view of the features of integration processes in the development of network processes and in the framework of network approach in general.

Interorganisational networking as the principal form of technological, innovative and research cooperation between Russia and the European Union in the Baltic region

Directory of Open Access Journals (Sweden)

Bolychev Oleg

2013-11-01

Full Text Available This article concerns the role that international cooperation in research, technology, and innovation plays in ensuring innovative development and producing an innovative model of the Russian economy. One of the key objectives of the country’s integration into international research, technological, and innovative space is the development of Russia-EU cooperation in the Baltic region. It is established that, with the development of integration connections and regionalization processes, interorganizational networking takes on special importance in the organization and development of the innovative space. The authors analyze the existing typologies of forms of cooperation in the field of research, technology, and innovation, within which cases of networking are identified. The article gives a definition of interorganizational networks in view of the spatial and structural components of networking. The authors introduce the notion of international interorganizational networks as a special form of international cooperation. A study into the spatial form of interorganizational networks helps explain the effect of different levels and types of economic integration. Key areas of research on international interorganizational networks are identified in view of the features of integration processes in the development of network processes and in the framework of network approach in general.

Time of arrival based location estimation for cooperative relay networks

KAUST Repository

Ç elebi, Hasari Burak; Abdallah, Mohamed M.; Hussain, Syed Imtiaz; Qaraqe, Khalid A.; Alouini, Mohamed-Slim

2010-01-01

In this paper, we investigate the performance of a cooperative relay network performing location estimation through time of arrival (TOA). We derive Cramer-Rao lower bound (CRLB) for the location estimates using the relay network. The analysis is extended to obtain average CRLB considering the signal fluctuations in both relay and direct links. The effects of the channel fading of both relay and direct links and amplification factor and location of the relay node on average CRLB are investigated. Simulation results show that the channel fading of both relay and direct links and amplification factor and location of relay node affect the accuracy of TOA based location estimation. ©2010 IEEE.

Time of arrival based location estimation for cooperative relay networks

KAUST Repository

Çelebi, Hasari Burak

2010-09-01

In this paper, we investigate the performance of a cooperative relay network performing location estimation through time of arrival (TOA). We derive Cramer-Rao lower bound (CRLB) for the location estimates using the relay network. The analysis is extended to obtain average CRLB considering the signal fluctuations in both relay and direct links. The effects of the channel fading of both relay and direct links and amplification factor and location of the relay node on average CRLB are investigated. Simulation results show that the channel fading of both relay and direct links and amplification factor and location of relay node affect the accuracy of TOA based location estimation. ©2010 IEEE.

An eConsent-based System Architecture Supporting Cooperation in Integrated Healthcare Networks.

Science.gov (United States)

Bergmann, Joachim; Bott, Oliver J; Hoffmann, Ina; Pretschner, Dietrich P

2005-01-01

The economical need for efficient healthcare leads to cooperative shared care networks. A virtual electronic health record is required, which integrates patient related information but reflects the distributed infrastructure and restricts access only to those health professionals involved into the care process. Our work aims on specification and development of a system architecture fulfilling these requirements to be used in concrete regional pilot studies. Methodical analysis and specification have been performed in a healthcare network using the formal method and modelling tool MOSAIK-M. The complexity of the application field was reduced by focusing on the scenario of thyroid disease care, which still includes various interdisciplinary cooperation. Result is an architecture for a secure distributed electronic health record for integrated care networks, specified in terms of a MOSAIK-M-based system model. The architecture proposes business processes, application services, and a sophisticated security concept, providing a platform for distributed document-based, patient-centred, and secure cooperation. A corresponding system prototype has been developed for pilot studies, using advanced application server technologies. The architecture combines a consolidated patient-centred document management with a decentralized system structure without needs for replication management. An eConsent-based approach assures, that access to the distributed health record remains under control of the patient. The proposed architecture replaces message-based communication approaches, because it implements a virtual health record providing complete and current information. Acceptance of the new communication services depends on compatibility with the clinical routine. Unique and cross-institutional identification of a patient is also a challenge, but will loose significance with establishing common patient cards.

Cooperative wireless network control based health and activity monitoring system.

Science.gov (United States)

Prakash, R; Ganesh, A Balaji; Girish, Siva V

2016-10-01

A real-time cooperative communication based wireless network is presented for monitoring health and activity of an end-user in their environment. The cooperative communication offers better energy consumption and also an opportunity to aware the current location of a user non-intrusively. The link between mobile sensor node and relay node is dynamically established by using Received Signal Strength Indicator (RSSI) and Link Quality Indicator (LQI) based on adaptive relay selection scheme. The study proposes a Linear Acceleration based Transmission Power Decision Control (LA-TPDC) algorithm to further enhance the energy efficiency of cooperative communication. Further, the occurrences of false alarms are carefully prevented by introducing three stages of sequential warning system. The real-time experiments are carried-out by using the nodes, namely mobile sensor node, relay nodes and a destination node which are indigenously developed by using a CC430 microcontroller integrated with an in-built transceiver at 868 MHz. The wireless node performance characteristics, such as energy consumption, Signal-Noise ratio (SNR), Bit Error Rate (BER), Packet Delivery Ratio (PDR) and transmission offset are evaluated for all the participated nodes. The experimental results observed that the proposed linear acceleration based transmission power decision control algorithm almost doubles the battery life time than energy efficient conventional cooperative communication.

Transparency in Cooperative Online Education

DEFF Research Database (Denmark)

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. Transparency gives students insight into each other’s actions. Cooperative learning seeks to develop virtual learning environments that allow students to have optimal individual freedom within online learning communities. This article demonstrates how cooperative...... learning can be supported by transparency. To illustrate this with current examples, the article presents NKI Distance Education’s surveys and experiences with cooperative learning. The article discusses by which means social networking and transparency may be utilized within cooperative online education...

Improving Energy Efficiency of Cooperative Femtocell Networks via Base Station Switching Off

Directory of Open Access Journals (Sweden)

Woongsup Lee

2016-01-01

Full Text Available Recently, energy efficiency (EE of cellular networks has become an important performance metric, and several techniques have been proposed to increase the EE. Among them, turning off base stations (BSs when not needed is considered as one of the most powerful techniques due to its simple operation and effectiveness. Herein, we propose a novel BS switching-off technique for cooperative femtocell networks where multiple femtocell BSs (FBSs simultaneously send packets to the same mobile station (MS. Unlike conventional schemes, cooperative operation of FBSs, also known as coordinated multipoint (CoMP transmission, is considered to determine which BSs are turned off in the proposed technique. We first formulate the optimization problem to find the optimal set of FBSs to be turned off. Then, we propose a suboptimal scheme operating in a distributed manner in order to reduce the computational complexity of the optimal scheme. The suboptimal scheme is based on throughput ratio (TR which specifies the importance of a particular FBS for the cooperative transmission. Through simulations, we show that the energy consumption can be greatly reduced with the proposed technique, compared with conventional schemes. Moreover, we show that the suboptimal scheme also achieves the near-optimal performance even without the excessive computations.

Functional evolution of new and expanded attention networks in humans.

Science.gov (United States)

Patel, Gaurav H; Yang, Danica; Jamerson, Emery C; Snyder, Lawrence H; Corbetta, Maurizio; Ferrera, Vincent P

2015-07-28

Macaques are often used as a model system for invasive investigations of the neural substrates of cognition. However, 25 million years of evolution separate humans and macaques from their last common ancestor, and this has likely substantially impacted the function of the cortical networks underlying cognitive processes, such as attention. We examined the homology of frontoparietal networks underlying attention by comparing functional MRI data from macaques and humans performing the same visual search task. Although there are broad similarities, we found fundamental differences between the species. First, humans have more dorsal attention network areas than macaques, indicating that in the course of evolution the human attention system has expanded compared with macaques. Second, potentially homologous areas in the dorsal attention network have markedly different biases toward representing the contralateral hemifield, indicating that the underlying neural architecture of these areas may differ in the most basic of properties, such as receptive field distribution. Third, despite clear evidence of the temporoparietal junction node of the ventral attention network in humans as elicited by this visual search task, we did not find functional evidence of a temporoparietal junction in macaques. None of these differences were the result of differences in training, experimental power, or anatomical variability between the two species. The results of this study indicate that macaque data should be applied to human models of cognition cautiously, and demonstrate how evolution may shape cortical networks.

A Routing Strategy for Non-Cooperation Wireless Multi-Hop Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Dung T. Tran

2012-01-01

Full Text Available Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we designate the users who are ready to tamper with their source-routing (senders could choose intermediate nodes in the routing paths or next hop selection strategies in order to increase the total number of packets transmitted, but do not try to harm or drop packets of the other nodes. The problem therefore amounts to a non-cooperative game. In the works [2,6,19,23], the authors show that the game admits Nash equilibria [1]. Along this line, we first show that if the cost function is linear, this game has pure-strategy equilibrium flow even though participants have different demands. However, finding a Nash equilibrium for a normal game is computationally hard [9]. In this work, inspired by mixed-strategy equilibrium, we propose a simple local routing algorithm called MIxed Path Routing protocol (MiPR. Using analysis and simulations, we show that MiPR drives the system to an equilibrium state where selfish participants do not have incentive to deviate. Moreover, MiPR significantly improves the network lifetime as compared to original routing protocols.

Institutional and scientific co-operation, networking and capacity building in the field of food safety and quality

NARCIS (Netherlands)

Boekel, van M.A.J.S.; Meerdink, G.; Banati, D.; Marvin, H.J.P.; Kuiper, H.A.; Houtman, C.B.

2002-01-01

This paper explains the situation in Hungary and The Netherlands regarding scientific co-operation, networking and capacity building in the field of food quality and safety. Specific details are given about institutional co-operation including exchanges between staff and students, collaborative

Impact of Business Interoperability on the Performance of Complex Cooperative Supply Chain Networks: A Case Study

Directory of Open Access Journals (Sweden)

Izunildo Cabral

2018-01-01

Full Text Available This paper proposes an agent-based model for evaluating the effect of business interoperability on the performance of cooperative supply chain networks. The model is based on insights from the Industrial Marketing and Purchasing network approach and the complex systems theory perspective. To demonstrate its applicability, an explanatory case study regarding a Portuguese reverse logistics cooperative supply chain network is presented. Face-to-face interviews and forms were used to collect data. The findings show that the establishment of appropriate levels of business interoperability has helped to reduce several non-value-added interaction processes and consequently improve the operational performance of the Valorpneu network. Regarding the research implications, this paper extends the current knowledge on business interoperability and an important problem in business: how business interoperability gaps in dyadic organizational relationships affect the network of companies that the two companies belong to—network effect. In terms of practical implications, managers can use the proposed model as a starting point to simulate complex interactions between supply chain network partners and understand better how the performance of their networks emerges from these interactions and from the adoption of different levels of business interoperability.

Joint Preprocesser-Based Detectors for One-Way and Two-Way Cooperative Communication Networks

KAUST Repository

Abuzaid, Abdulrahman I.

2014-05-01

Efficient receiver designs for cooperative communication networks are becoming increasingly important. In previous work, cooperative networks communicated with the use of L relays. As the receiver is constrained, channel shortening and reduced-rank techniques were employed to design the preprocessing matrix that reduces the length of the received vector from L to U. In the first part of the work, a receiver structure is proposed which combines our proposed threshold selection criteria with the joint iterative optimization (JIO) algorithm that is based on the mean square error (MSE). Our receiver assists in determining the optimal U. Furthermore, this receiver provides the freedom to choose U for each frame depending on the tolerable difference allowed for MSE. Our study and simulation results show that by choosing an appropriate threshold, it is possible to gain in terms of complexity savings while having no or minimal effect on the BER performance of the system. Furthermore, the effect of channel estimation on the performance of the cooperative system is investigated. In the second part of the work, a joint preprocessor-based detector for cooperative communication networks is proposed for one-way and two-way relaying. This joint preprocessor-based detector operates on the principles of minimizing the symbol error rate (SER) instead of minimizing MSE. For a realistic assessment, pilot symbols are used to estimate the channel. From our simulations, it can be observed that our proposed detector achieves the same SER performance as that of the maximum likelihood (ML) detector with all participating relays. Additionally, our detector outperforms selection combining (SC), channel shortening (CS) scheme and reduced-rank techniques when using the same U. Finally, our proposed scheme has the lowest computational complexity.

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

Science.gov (United States)

Jakovetic, Dusan; Xavier, João; Moura, José M. F.

2011-08-01

We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

Energy-harvesting in cooperative AF relaying networks over log-normal fading channels

KAUST Repository

Rabie, Khaled M.; Salem, Abdelhamid; Alsusa, Emad; Alouini, Mohamed-Slim

2016-01-01

Energy-harvesting (EH) and wireless power transfer are increasingly becoming a promising source of power in future wireless networks and have recently attracted a considerable amount of research, particularly on cooperative two-hop relay networks in Rayleigh fading channels. In contrast, this paper investigates the performance of wireless power transfer based two-hop cooperative relaying systems in indoor channels characterized by log-normal fading. Specifically, two EH protocols are considered here, namely, time switching relaying (TSR) and power splitting relaying (PSR). Our findings include accurate analytical expressions for the ergodic capacity and ergodic outage probability for the two aforementioned protocols. Monte Carlo simulations are used throughout to confirm the accuracy of our analysis. The results show that increasing the channel variance will always provide better ergodic capacity performance. It is also shown that a good selection of the EH time in the TSR protocol, and the power splitting factor in the PTS protocol, is the key to achieve the best system performance. © 2016 IEEE.

Energy-harvesting in cooperative AF relaying networks over log-normal fading channels

KAUST Repository

Rabie, Khaled M.

2016-07-26

Energy-harvesting (EH) and wireless power transfer are increasingly becoming a promising source of power in future wireless networks and have recently attracted a considerable amount of research, particularly on cooperative two-hop relay networks in Rayleigh fading channels. In contrast, this paper investigates the performance of wireless power transfer based two-hop cooperative relaying systems in indoor channels characterized by log-normal fading. Specifically, two EH protocols are considered here, namely, time switching relaying (TSR) and power splitting relaying (PSR). Our findings include accurate analytical expressions for the ergodic capacity and ergodic outage probability for the two aforementioned protocols. Monte Carlo simulations are used throughout to confirm the accuracy of our analysis. The results show that increasing the channel variance will always provide better ergodic capacity performance. It is also shown that a good selection of the EH time in the TSR protocol, and the power splitting factor in the PTS protocol, is the key to achieve the best system performance. © 2016 IEEE.

Implementation of Cooperation for Recycling Vehicle Routing Optimization in Two-Echelon Reverse Logistics Networks

Directory of Open Access Journals (Sweden)

Yong Wang

2018-04-01

Full Text Available The formation of a cooperative alliance is an effective means of approaching the vehicle routing optimization in two-echelon reverse logistics networks. Cooperative mechanisms can contribute to avoiding the inefficient assignment of resources for the recycling logistics operations and reducing long distance transportation. With regard to the relatively low performance of waste collection, this paper proposes a three-phase methodology to properly address the corresponding vehicle routing problem on two echelons. First, a bi-objective programming model is established to minimize the total cost and the number of vehicles considering semitrailers and vehicles sharing. Furthermore, the Clarke–Wright (CW savings method and the Non-dominated Sorting Genetic Algorithm-II (NSGA-II are combined to design a hybrid routing optimization heuristic, which is denoted CW_NSGA-II. Routes on the first and second echelons are obtained on the basis of sub-optimal solutions provided by CW algorithm. Compared to other intelligent algorithms, CW_NSGA-II reduces the complexity of the multi-objective solutions search and mostly converges to optimality. The profit generated by cooperation among retail stores and the recycling hub in the reverse logistics network is fairly and reasonably distributed to the participants by applying the Minimum Costs-Remaining Savings (MCRS method. Finally, an empirical study in Chengdu City, China, reveals the superiority of CW_NSGA over the multi-objective particle swarm optimization and the multi objective genetic algorithms in terms of solutions quality and convergence. Meanwhile, the comparison of MCRS method with the Shapley value model, equal profit method and cost gap allocation proves that MCRS method is more conducive to the stability of the cooperative alliance. In general, the implementation of cooperation in the optimization of the reverse logistics network effectively leads to the sustainable development of urban and sub

Outage analysis of selective cooperation in underlay cognitive networks with fixed gain relays and primary interference modeling

KAUST Repository

Hussain, Syed Imtiaz; Alouini, Mohamed-Slim; Qaraqe, Khalid A.; Hasna, Mazen Omar

2012-01-01

Selective cooperation is a well investigated technique in non-cognitive networks for efficient spectrum utilization and performance improvement. However, it is still a nascent topic for underlay cognitive networks. Recently, it was investigated

Cognitive radio networks efficient resource allocation in cooperative sensing, cellular communications, high-speed vehicles, and smart grid

CERN Document Server

Jiang, Tao; Cao, Yang

2015-01-01

PrefaceAcknowledgmentsAbout the AuthorsIntroductionCognitive Radio-Based NetworksOpportunistic Spectrum Access NetworksCognitive Radio Networks with Cooperative SensingCognitive Radio Networks for Cellular CommunicationsCognitive Radio Networks for High-Speed VehiclesCognitive Radio Networks for a Smart GridContent and OrganizationTransmission Slot Allocation in an Opportunistic Spectrum Access NetworkSingle-User Single-Channel System ModelProbabilistic Slot Allocation SchemeOptimal Probabilistic Slot AllocationBaseline PerformanceExponential DistributionHyper-Erlang DistributionPerformance An

A Novel Optimal Joint Resource Allocation Method in Cooperative Multicarrier Networks: Theory and Practice

Directory of Open Access Journals (Sweden)

Yuan Gao

2016-04-01

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

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

Science.gov (United States)

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

Large-Scale Cooperative Task Distribution on Peer-to-Peer Networks

Science.gov (United States)

2012-01-01

SUBTITLE Large-scale cooperative task distribution on peer-to-peer networks 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6...disadvantages of ML- Chord are its fixed size (two layers), and limited scala - bility for large-scale systems. RC-Chord extends ML- D. Karrels et al...configurable before runtime. This can be improved by incorporating a distributed learning algorithm to tune the number and range of the DLoE tracking

Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications

Directory of Open Access Journals (Sweden)

Du Bing

2010-01-01

Full Text Available A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity. This paper proposes a cooperative design of a parity-check network coding scheme in the context of a two-source multiple access relay channel (MARC model, a common compact model in hierarchical wireless sensor networks (WSNs. The scheme uses Low-Density Parity-Check (LDPC as the surrogate to build up a layered structure which encapsulates the multiple constituent LDPC codes in the source and relay nodes. Specifically, the relay node decodes the messages from two sources, which are used to generate extra parity-check bits by a random network coding procedure to fill up the rate gap between Source-Relay and Source-Destination transmissions. Then, we derived the key algebraic relationships among multidimensional LDPC constituent codes as one of the constraints for code profile optimization. These extra check bits are sent to the destination to realize a cooperative diversity as well as to approach MARC decode-and-forward (DF capacity.

Ranking Features on Psychological Dynamics of Cooperative Team Work through Bayesian Networks

Directory of Open Access Journals (Sweden)

Pilar Fuster-Parra

2016-05-01

Full Text Available The aim of this study is to rank some features that characterize the psychological dynamics of cooperative team work in order to determine priorities for interventions and formation: leading positive feedback, cooperative manager and collaborative manager features. From a dataset of 20 cooperative sport teams (403 soccer players, the characteristics of the prototypical sports teams are studied using an average Bayesian network (BN and two special types of BNs, the Bayesian classifiers: naive Bayes (NB and tree augmented naive Bayes (TAN. BNs are selected as they are able to produce probability estimates rather than predictions. BN results show that the antecessors (the “top” features ranked are the team members’ expectations and their attraction to the social aspects of the task. The main node is formed by the cooperative behaviors, the consequences ranked at the BN bottom (ratified by the TAN trees and the instantiations made, the roles assigned to the members and their survival inside the same team. These results should help managers to determine contents and priorities when they have to face team-building actions.

Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

Science.gov (United States)

Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

2015-06-29

Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

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

Science.gov (United States)

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.

Perturbed cooperative-state feedback strategy for model predictive networked control of interconnected systems.

Science.gov (United States)

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.

Management Strategies in Multinational PricewaterhouseCoopers Romania

Directory of Open Access Journals (Sweden)

Norina Popovici

2011-05-01

Full Text Available This paper presents and analyzes the key strategies that underpin multinational firms acting in this global environment. The paper underlines the importance of strategy, in the current economic context, for a complex company such as PriceWaterhouse Coopers. After a laborious documentation, theoretical and practical, the paper presents the main strategic options which ensure the business development in the context of globalization. Due to complexity of work carried out by PricewaterhouseCoopers, due to a developed organizational structure and the large number of employees , the need for the strategy is " vital " for achieve the desired performance . In the past 10 years, PriceWaterhouse Coopers turned its global work on expanding the network size and diversity of services offered. Challenges and opportunities of today require a new strategic vision. Therefore, PriceWaterhouse Coopers calls for integrating the concept of sustainability as a management philosophy. In this context, which shapes the economy based on knowledge, management is a science which, through instruments such as corporate social responsibility, coaching procces, attracting talents, can help businesses to develop, diversify or to survive. The research of this company that led to the application of these tools work in Romanian companies, depending on the particular circumstances.

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

Science.gov (United States)

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.

Secure amplify-and-forward untrusted relaying networks using cooperative jamming and zero-forcing cancelation

KAUST Repository

Park, Kihong; Alouini, Mohamed-Slim

2015-01-01

In this paper, we investigate secure transmission in untrusted amplify-and-forward half-duplex relaying networks with the help of cooperative jamming at the destination (CJD). Under the assumption of full channel state information (CSI

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Antonio Artuñedo

2017-04-01

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

A network to enhance cooperation for research and higher education on radiation protection and nuclear engineering

International Nuclear Information System (INIS)

Rodenas, J.; Gallardo, Sergio . E mail: sergalbe@iqn.upv.es

2008-01-01

The educational capacity of many Institutions of Higher Education in Nuclear Engineering decreased under the combined effect of a declining interest among students as well as from academic and political authorities. An increasing cooperation at the international level on educational efforts is necessary. The CHERNE network is an initiative mainly focussed on teaching and learning activities to develop a wide-scope open academic network to enhance cooperation, competence and equipment sharing between its partners. Typical activities organized within the network include workshops, intensive courses, seminars and conferences. The CHERNE network and its main objectives as well as the activities developed since its foundation are presented. Special attention is given to international intensive courses (SPERANSA, JUNCSS, ICARO, etc.) organized for students of the member institutions. The common feature of these courses is a strong practical part in specialized facilities, including in some cases access to large equipment like research reactors and accelerators. (author)

Empirical Analysis on Evolution and Small World Effect of Chinese Enterprise-Enterprise Patent Cooperation Network: From the Perspective of Open Innovation

Directory of Open Access Journals (Sweden)

Wei Li

2013-10-01

Full Text Available The patent cooperation network which enterprises join is a very important network platform for enterprises’ open innovation. However, very limited work has been done to empirically investigate the dynamic change process of the network in China. To address this issue, this paper analyzes dynamic change process of cooperation network of enterprises and the small-world effect of the biggest subgroup according to the data of 36731 items of cooperative patents between enterprises from 1985 to 2010 published by the State Intellectual Property Office of China. A conclusion can be drawn from the analysis results that the biggest subgroup has the characteristics of small-world effect, but the overall network structure also has some defects, which limit the development of open innovation. For the first time, suggestions on open innovation strategies are put forward to provide theoretical reference for both the government and enterprises.

Adaptive co-evolution of strategies and network leading to optimal cooperation level in spatial prisoner's dilemma game

International Nuclear Information System (INIS)

Han-Shuang, Chen; Zhong-Huai, Hou; Hou-Wen, Xin; Ji-Qian, Zhang

2010-01-01

We study evolutionary prisoner's dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategies either rewire the link between them with probability p or update their strategies with probability 1 – p depending on their payoffs. Numerical simulation shows that the final network is either split into some disconnected communities whose players share the same strategy within each community or forms a single connected network in which all nodes are in the same strategy. Interestingly, the density of cooperators in the final state can be maximised in an intermediate range of p via the competition between time scale of the network dynamics and that of the node dynamics. Finally, the mean-field analysis helps to understand the results of numerical simulation. Our results may provide some insight into understanding the emergence of cooperation in the real situation where the individuals' behaviour and their relationship adaptively co-evolve. (general)

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

Science.gov (United States)

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.

Science.gov (United States)

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.

Multilevel Evolutionary Algorithm that Optimizes the Structure of Scale-Free Networks for the Promotion of Cooperation in the Prisoner's Dilemma game.

Science.gov (United States)

Liu, Penghui; Liu, Jing

2017-06-28

Understanding the emergence of cooperation has long been a challenge across disciplines. Even if network reciprocity reflected the importance of population structure in promoting cooperation, it remains an open question how population structures can be optimized, thereby enhancing cooperation. In this paper, we attempt to apply the evolutionary algorithm (EA) to solve this highly complex problem. However, as it is hard to evaluate the fitness (cooperation level) of population structures, simply employing the canonical evolutionary algorithm (EA) may fail in optimization. Thus, we propose a new EA variant named mlEA-C PD -SFN to promote the cooperation level of scale-free networks (SFNs) in the Prisoner's Dilemma Game (PDG). Meanwhile, to verify the preceding conclusions may not be applied to this problem, we also provide the optimization results of the comparative experiment (EA cluster ), which optimizes the clustering coefficient of structures. Even if preceding research concluded that highly clustered scale-free networks enhance cooperation, we find EA cluster does not perform desirably, while mlEA-C PD -SFN performs efficiently in different optimization environments. We hope that mlEA-C PD -SFN may help promote the structure of species in nature and that more general properties that enhance cooperation can be learned from the output structures.

Technology transfer and knowledge management in cooperation networks: the Airzone case

International Nuclear Information System (INIS)

Benavides Velasco, C. A.; Quintana Garcia, C.

2007-01-01

This paper highlights the importance of cooperation networks between the public system of R and D and industry to promote technology transfer, knowledge management, and the consolidation and growth of new technology firms. Through the case of Air zone,his paper shows the significance of collaboration agreements between University and industry to enhance technology transfer and the success of entrepreneurial projects. (Author) 28 refs

A Low-Overhead Cooperative Retransmission Scheme for IR-UWB Networks

Directory of Open Access Journals (Sweden)

Ghasem Naddafzadeh Shirazi

2008-01-01

Full Text Available The UWB unique properties such as fine ranging and immunity to small scale fading are utilized in order to exploit the multiuser diversity in UWB networks. The optimal cooperation strategies in the absence of control packet overhead are analyzed in the proactive and reactive settings. It is shown that the proposed method achieves a considerable diversity gain while minimizing the overhead of control packet exchange that is required for coordination among the relays.

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

Science.gov (United States)

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

Science.gov (United States)

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

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

Wang Xianjia; Quan Ji; Liu Weibing

2012-01-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. (interdisciplinary physics and related areas of science and technology)

[Cooperative Cardiovascular Disease Research Network (RECAVA)].

Science.gov (United States)

García-Dorado, David; Castro-Beiras, Alfonso; Díez, Javier; Gabriel, Rafael; Gimeno-Blanes, Juan R; Ortiz de Landázuri, Manuel; Sánchez, Pedro L; Fernández-Avilés, Francisco

2008-01-01

Today, cardiovascular disease is the principal cause of death and hospitalization in Spain, and accounts for an annual healthcare budget of more than 4000 million euros. Consequently, early diagnosis, effective prevention, and the optimum treatment of cardiovascular disease present a significant social and healthcare challenge for the country. In this context, combining all available resources to increase the efficacy and healthcare benefits of scientific research is a priority. This rationale prompted the establishment of the Spanish Cooperative Cardiovascular Disease Research Network, or RECAVA (Red Temática de Investigación Cooperativa en Enfermedades Cardiovasculares), 5 years ago. Since its foundation, RECAVA's activities have focused on achieving four objectives: a) to facilitate contacts between basic, clinical and epidemiological researchers; b) to promote the shared use of advanced technological facilities; c) to apply research results to clinical practice, and d) to train a new generation of translational cardiovascular researchers in Spain. At present, RECAVA consists of 41 research groups and seven shared technological facilities. RECAVA's research strategy is based on a scientific design matrix centered on the most important cardiovascular processes. The level of RECAVA's research activity is reflected in the fact that 28 co-authored articles were published in international journals during the first six months of 2007, with each involving contributions from at least two groups in the network. Finally, RECAVA also participates in the work of the Spanish National Center for Cardiovascular Research, or CNIC (Centro Nacional de Investigación Cardiovascular), and some established Biomedical Research Network Centers, or CIBER (Centros de Investigación Biomédica en RED), with the aim of consolidating the development of a dynamic multidisciplinary research framework that is capable of meeting the growing challenge that cardiovascular disease will present

Throughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding

KAUST Repository

Hamza, Doha R.

2015-02-13

We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.

Throughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding

KAUST Repository

Hamza, Doha R.; Park, Kihong; Alouini, Mohamed-Slim; Aissa, Sonia

2015-01-01

We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.

Cooperative MIMO Communication at Wireless Sensor Network: An Error Correcting Code Approach

Science.gov (United States)

Islam, Mohammad Rakibul; Han, Young Shin

2011-01-01

Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error pb. It is observed that C-MIMO performs more efficiently when the targeted pb is smaller. Also the lower encoding rate for LDPC code offers better error characteristics. PMID:22163732

Cooperative MIMO communication at wireless sensor network: an error correcting code approach.

Science.gov (United States)

Islam, Mohammad Rakibul; Han, Young Shin

2011-01-01

Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error p(b). It is observed that C-MIMO performs more efficiently when the targeted p(b) is smaller. Also the lower encoding rate for LDPC code offers better error characteristics.

Performance analysis of best relay selection scheme for amplify-and-forward cooperative networks in identical Nakagami-m channels

KAUST Repository

Hussain, Syed Imtiaz

2010-06-01

In cooperative communication networks, the use of multiple relays between the source and the destination was proposed to increase the diversity gain. Since the source and all the relays must transmit on orthogonal channels, multiple relay cooperation is considered inefficient in terms of channel resources and bandwidth utilization. To overcome this problem, the concept of best relay selection was recently proposed. In this paper, we analyze the performance of the best relay selection scheme for a cooperative network with multiple relays operating in amplify-and-forward (AF) mode over identical Nakagami-m channels using exact source-relay-destination signal to noise ratio (SNR) expression. We derive accurate closed form expressions for various system parameters including probability density function (pdf) of end-to-end SNR, average output SNR, average probability of bit error and average channel capacity. T he analytical results are verified through extensive simulations. It is shown that the best relay selection scheme performs better than the regular all relay cooperation.

Coded Cooperation for Multiway Relaying in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhongwei Si

2015-06-01

Full Text Available Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

Brain Interaction during Cooperation: Evaluating Local Properties of Multiple-Brain Network.

Science.gov (United States)

Sciaraffa, Nicolina; Borghini, Gianluca; Aricò, Pietro; Di Flumeri, Gianluca; Colosimo, Alfredo; Bezerianos, Anastasios; Thakor, Nitish V; Babiloni, Fabio

2017-07-21

Subjects' interaction is the core of most human activities. This is the reason why a lack of coordination is often the cause of missing goals, more than individual failure. While there are different subjective and objective measures to assess the level of mental effort required by subjects while facing a situation that is getting harder, that is, mental workload, to define an objective measure based on how and if team members are interacting is not so straightforward. In this study, behavioral, subjective and synchronized electroencephalographic data were collected from couples involved in a cooperative task to describe the relationship between task difficulty and team coordination, in the sense of interaction aimed at cooperatively performing the assignment. Multiple-brain connectivity analysis provided information about the whole interacting system. The results showed that averaged local properties of a brain network were affected by task difficulty. In particular, strength changed significantly with task difficulty and clustering coefficients strongly correlated with the workload itself. In particular, a higher workload corresponded to lower clustering values over the central and parietal brain areas. Such results has been interpreted as less efficient organization of the network when the subjects' activities, due to high workload tendencies, were less coordinated.

Stereo-vision-based cooperative-vehicle positioning using OCC and neural networks

Science.gov (United States)

Ifthekhar, Md. Shareef; Saha, Nirzhar; Jang, Yeong Min

2015-10-01

Vehicle positioning has been subjected to extensive research regarding driving safety measures and assistance as well as autonomous navigation. The most common positioning technique used in automotive positioning is the global positioning system (GPS). However, GPS is not reliably accurate because of signal blockage caused by high-rise buildings. In addition, GPS is error prone when a vehicle is inside a tunnel. Moreover, GPS and other radio-frequency-based approaches cannot provide orientation information or the position of neighboring vehicles. In this study, we propose a cooperative-vehicle positioning (CVP) technique by using the newly developed optical camera communications (OCC). The OCC technique utilizes image sensors and cameras to receive and decode light-modulated information from light-emitting diodes (LEDs). A vehicle equipped with an OCC transceiver can receive positioning and other information such as speed, lane change, driver's condition, etc., through optical wireless links of neighboring vehicles. Thus, the target vehicle position that is too far away to establish an OCC link can be determined by a computer-vision-based technique combined with the cooperation of neighboring vehicles. In addition, we have devised a back-propagation (BP) neural-network learning method for positioning and range estimation for CVP. The proposed neural-network-based technique can estimate target vehicle position from only two image points of target vehicles using stereo vision. For this, we use rear LEDs on target vehicles as image points. We show from simulation results that our neural-network-based method achieves better accuracy than that of the computer-vision method.

Research and development cooperation project on environmental measurement using laser radar in fiscal 1994 (environmental network); Kankyo keisokuyo laser radar no kaihatsu ni kansuru kenkyu kyoryoku (kankyo network)

Energy Technology Data Exchange (ETDEWEB)

NONE

1995-03-01

Under the R and D of a laser radar for environmental measurement which are conducted in cooperation with Indonesia, the paper reported the R and D of the environmental network in fiscal 1994. Four field surveys were made, and the following were conducted: proposal of a technical system, adjustment of the Asian environmental information network with BPPT and LIPI which are organs on the Indonesian side, installation of/technical discussion on network equipment, etc. There is IPTEKNET as a plan of a nationwide network of the scientific technology information service in Indonesia. The analytical design phase of this system converged in 1992, and the predicted investment amount in the coming five years is expected to be 6.7 million US dollars. As the future Asian environmental information network work, planned are connection between BPPT and Tokyo CC and connection at BPPT between the Asian environmental information network and IPTEKNET. Network managers at sites are very skillful, and therefore, the thorough cooperative work is anticipated. 24 figs.

Cooperative Coding and Caching for Streaming Data in Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Liu Jiangchuan

2010-01-01

Full Text Available This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching ( scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.

Research cooperation in the development of laser radar for environmental measurements. Environmental network; Kankyo keisokuyo laser radar no kaihatsu ni kansuru kenkyu kyoryoku. Kankyo network

Energy Technology Data Exchange (ETDEWEB)

NONE

1997-03-01

Among the research cooperation in the development of laser radar for environmental measurements with Indonesia between FY 1993 and FY 1996, results of the research and development of the environmental network are summarized. For the environmental information network, the Tokyo NOC is linked as an Internet connection point in Japan with the Jakarta NOC using an international dedicated line with a capacity of 64 Kbps. The Tokyo NOC is linked with domestic environmental information researchers using Internet. Thus, data stored in the data processing system of laser radar can be exchanged, information in both countries can be exchanged using E-mail, and data can be accumulated. For the research cooperation with Indonesia, research of path control and information relay server, research of effective transmission of data on the network, and research of multimedia communication have been conducted. The multimedia communication, distributed processing, and extension of dedicated line network using PPTP have been also conducted. 39 figs., 4 tabs.

Open-source hardware and software and web application for gamma dose rate network operation

International Nuclear Information System (INIS)

Luff, R.; Zaehringer, M.; Harms, W.; Bleher, M.; Prommer, B.; Stoehlker, U.

2014-01-01

The German Federal Office for Radiation Protection operates a network of about 1800 gamma dose rate stations as a part of the national emergency preparedness plan. Each of the six network centres is capable of operating the network alone. Most of the used hardware and software have been developed in-house under open-source license. Short development cycles and close cooperation between developers and users ensure robustness, transparency and fast maintenance procedures, thus avoiding unnecessary complex solutions. This also reduces the overall costs of the network operation. An easy-to-expand web interface has been developed to make the complete system available to other interested network operators in order to increase cooperation between different countries. The interface is also regularly in use for education during scholarships of trainees supported, e.g. by the 'international Atomic Energy Agency' to operate a local area dose rate monitoring test network. (authors)

Inter-Organizational Knowledge Conversion and Innovative Capacity in Cooperative Networks

Directory of Open Access Journals (Sweden)

Patricia Trincade Caldas

2013-04-01

Full Text Available In the current business and management environments, organizations are challenged to search for new ways of working focused on findings and practical innovation. In this sense, knowledge management constitutes a tool to support the practices of innovation, which are facilitated by the existence of physical, virtual or mental spaces, called Ba's, where knowledge can be better used. The objective of this paper is to analyze the dynamics of inter-organizational knowledge conversion into existing Ba spaces in a cooperative network. The data analysis was performed from the triangulation of primary and secondary data and from the non-participant observation, within specific variables. The results point that the network displays an unfavorable configuration regarding the favorable characteristics to dynamics of knowledge conversion, which influences negatively its performance, especially the intensity and quality of information.

A localized cooperative wideband spectrum sensing for dynamic access of TV bands using RF sensor networks

KAUST Repository

Mirza, Mohammed

2011-07-01

In this paper we address and simulate a Radio Frequency (RF) sensor network for a cooperative spectrum sensing and localization scheme. The proposed method integrates a Wavelet based Multi-Resolution Spectrum Sensing (MRSS), an N-bit hard combination technique for cooperative decision making and a Received Signal Strength (RSS) based localization algorithm to detect the availability of frequency bands and the location of the usable base station. We develop an N-bit hard combination technique and compare its performance to a traditionally used 2-bit hard combination for cooperative sensing. The key idea is to design a novel RF sensor network based cooperative wideband spectrum sensing and localization scheme by using a wavelet based Multi-Resolution Spectrum Sensing (MRSS) and Received Signal Strength (RSS) Localization techniques which were originally proposed for cognitive radio applications. The performance evaluations are also done to show the different detection accuracies for varying parameters such as number of sensor nodes, Signal to Noise Ratios (SNR) and number of averaged Power Spectral Densities (PSD). The proposed scheme improves the problems of shadowing, fading and noise. In addition, the RSS based localization technique was shown to be an acceptable means of estimating the position of the available transmitter. © 2011 IEEE.

Expanded flux variability analysis on metabolic network of Escherichia coli

Institute of Scientific and Technical Information of China (English)

CHEN Tong; XIE ZhengWei; OUYANG Qi

2009-01-01

Flux balance analysis,based on the mass conservation law in a cellular organism,has been extensively employed to study the interplay between structures and functions of cellular metabolic networks.Consequently,the phenotypes of the metabolism can be well elucidated.In this paper,we introduce the Expanded Flux Variability Analysis (EFVA) to characterize the intrinsic nature of metabolic reactions,such as flexibility,modularity and essentiality,by exploring the trend of the range,the maximum and the minimum flux of reactions.We took the metabolic network of Escherichia coli as an example and analyzed the variability of reaction fluxes under different growth rate constraints.The average variability of all reactions decreases dramatically when the growth rate increases.Consider the noise effect on the metabolic system,we thus argue that the microorganism may practically grow under a suboptimal state.Besides,under the EFVA framework,the reactions are easily to be grouped into catabolic and anabolic groups.And the anabolic groups can be further assigned to specific biomass constitute.We also discovered the growth rate dependent essentiality of reactions.

Interlibrary cooperation: from ILL to IAIMS and beyond.

Science.gov (United States)

Riordan, M L; Perry, G J

1999-07-01

A recent solicitation over the MEDLIB-L e-mail discussion list revealed over thirty diverse examples of hospital library-based interlibrary cooperative initiatives currently underway. Many are familiar and have been featured in the professional literature. Most go unreported and unrecognized however, comprising invisible resource-sharing infrastructures that hospital librarians painstakingly piece together in order to provide their clients with expanded service options. This paper, drawing from the MEDLIB-L survey as well as descriptions in the published literature, provides a broad overview of such recent interlibrary cooperative efforts. Examples include interlibrary loan networks, collective purchasing initiatives, holder-of-record or union catalog access agreements, arrangements to provide e-mail and Internet access, and consortia to share electronic resources. Examples were chosen based on the initiatives' diversity of participants, and represent a wide range of locations across the United States. Such initiatives focus on local, statewide, or regional collaboration, and several involve partnerships between academic medical center libraries and regional hospital libraries. An early example of a hospital-based interlibrary cooperative IAIMS effort is described, pointing to future possibilities involving the Internet and regional hospital system intranets.

Cooperative Coding and Caching for Streaming Data in Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Dan Wang

2010-01-01

Full Text Available This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching (C3 scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.

Stochastic noncooperative and cooperative evolutionary game strategies of a population of biological networks under natural selection.

Science.gov (United States)

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.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks.

Science.gov (United States)

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.

Cluster Cooperation in Wireless-Powered Sensor Networks: Modeling and Performance Analysis.

Science.gov (United States)

Zhang, Chao; Zhang, Pengcheng; Zhang, Weizhan

2017-09-27

A wireless-powered sensor network (WPSN) consisting of one hybrid access point (HAP), a near cluster and the corresponding far cluster is investigated in this paper. These sensors are wireless-powered and they transmit information by consuming the harvested energy from signal ejected by the HAP. Sensors are able to harvest energy as well as store the harvested energy. We propose that if sensors in near cluster do not have their own information to transmit, acting as relays, they can help the sensors in a far cluster to forward information to the HAP in an amplify-and-forward (AF) manner. We use a finite Markov chain to model the dynamic variation process of the relay battery, and give a general analyzing model for WPSN with cluster cooperation. Though the model, we deduce the closed-form expression for the outage probability as the metric of this network. Finally, simulation results validate the start point of designing this paper and correctness of theoretical analysis and show how parameters have an effect on system performance. Moreover, it is also known that the outage probability of sensors in far cluster can be drastically reduced without sacrificing the performance of sensors in near cluster if the transmit power of HAP is fairly high. Furthermore, in the aspect of outage performance of far cluster, the proposed scheme significantly outperforms the direct transmission scheme without cooperation.

Evaluation of cooperation WPP and PV connected through the shared transformer to the network 22kV

Directory of Open Access Journals (Sweden)

Tomas Sumbera

2012-01-01

Full Text Available The article deals with evaluation the cooperation possibility of wind and solar power plants connected through the common transformator to the 22kV network. Cooperation evaluation is, based on measured data, for wind power plant about installed capacity 2MW and for solar power plant about installed capacity 1,1MWp. In the next part of this article there is the analysis of suitable localities for construction of „hybrid system (WPP+PV“ in the Czech Republic. The last part of the article deals with analysis of active power fluctuation of individuals electric sources compared with system WPP+PV and with evaluation the effects after system connection WPP+PV to the 22kV network.

Technological Cooperation Networks at Bio-Manguinhos: the Role of Information and Communication Technologies

Directory of Open Access Journals (Sweden)

Lázaro Pereira de Oliveira

2015-01-01

Full Text Available This article identifies and discusses the contribution of information and communication technologies (ICTs to the technological cooperation projects of Bio-Manguinhos, a pharmaceutical manufacturer that belongs to Osvaldo Cruz Foundation (FIOCRUZ, responsible for producing vaccines, reagents and biopharmaceuticals, with priority on meeting the needs of the Brazilian public health system. It is a case study with a qualitative approach for descriptive and explanatory purposes. The data were collected from 14 interviews conducted with managers of research and development (R&D projects with high relevance to the organization. The results allow concluding that the ICTs requiring greater interdependence between partners and two-way knowledge flows have not yet been used. They also show the importance of closer cooperation between the information technology (IT and R&D areas. A future positioning of Bio-Manguinhos as a technological center focused on discovery and sale of new active ingredients can favor the use of tools that promote greater integration between the partners of technology cooperation networks.

GCPSO in cooperation with graph theory to distribution network reconfiguration for energy saving

International Nuclear Information System (INIS)

Assadian, Mehdi; Farsangi, Malihe M.; Nezamabadi-pour, Hossein

2010-01-01

Network reconfiguration for loss reduction in distribution system is an important way to save energy. This paper investigates the ability of guaranteed convergence particle swarm optimization (GCPSO) and particle swarm optimization (PSO) in cooperation with graph theory for network reconfiguration to reduce the power loss and enhancement of voltage profile of distribution systems. Numerical results of three distribution systems are presented which illustrate the feasibility of the proposed method by GCPSO and PSO using the graph theory. To validate the obtained results, genetic algorithm (GA) using graph theory is also applied and is compared with the proposed GCPSO and PSO using graph theory.

A Localization Based Cooperative Routing Protocol for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-01-01

Full Text Available Localization is one of the major aspects in underwater wireless sensor networks (UWSNs. Therefore, it is important to know the accurate position of the sensor node in large scale applications like disaster prevention, tactical surveillance, and monitoring. Due to the inefficiency of the global positioning system (GPS in UWSN, it is very difficult to localize a node in underwater environment compared to terrestrial networks. To minimize the localization error and enhance the localization coverage of the network, two routing protocols are proposed; the first one is mobile autonomous underwater vehicle (MobiL-AUV and the second one is cooperative MobiL (CO-MobiL. In MobiL-AUV, AUVs are deployed and equipped with GPS and act as reference nodes. These reference nodes are used to localize all the nonlocalized ordinary sensor nodes in order to reduce the localization error and maximize the network coverage. CO-MobiL is presented in order to improve the network throughput by using the maximal ratio combining (MRC as diversity technique which combines both signals, received from the source and received from the relay at the destination. It uses amplify-and-forward (AF mechanism to improve the signal between the source and the destination. To support our claims, extensive simulations are performed.

A Cross-Layer Optimization Approach for Energy Efficient Wireless Sensor Networks: Coalition-Aided Data Aggregation, Cooperative Communication, and Energy Balancing

Directory of Open Access Journals (Sweden)

Qinghai Gao

2007-01-01

Full Text Available We take a cross-layer optimization approach to study energy efficient data transport in coalition-based wireless sensor networks, where neighboring nodes are organized into groups to form coalitions and sensor nodes within one coalition carry out cooperative communications. In particular, we investigate two network models: (1 many-to-one sensor networks where data from one coalition are transmitted to the sink directly, and (2 multihop sensor networks where data are transported by intermediate nodes to reach the sink. For the many-to-one network model, we propose three schemes for data transmission from a coalition to the sink. In scheme 1, one node in the coalition is selected randomly to transmit the data; in scheme 2, the node with the best channel condition in the coalition transmits the data; and in scheme 3, all the nodes in the coalition transmit in a cooperative manner. Next, we investigate energy balancing with cooperative data transport in multihop sensor networks. Built on the above coalition-aided data transmission schemes, the optimal coalition planning is then carried out in multihop networks, in the sense that unequal coalition sizes are applied to minimize the difference of energy consumption among sensor nodes. Numerical analysis reveals that energy efficiency can be improved significantly by the coalition-aided transmission schemes, and that energy balancing across the sensor nodes can be achieved with the proposed coalition structures.

German cooperation-network 'equity in health'-health promotion in settings.

Science.gov (United States)

Mielck, Andreas; Kilian, Holger; Lehmann, Frank; Richter-Kornweitz, Antje; Kaba-Schönstein, Lotte

2018-04-01

In 2003, the German Federal Centre for Health Education (BZgA) initiated the national Cooperation-Network (CN) 'Equity in Health'. The CN is constantly increasing in size and scope, supporting setting approaches aimed at reducing health inequalities. A detailed description of the CN has not yet been available in English. The CN comprises a total of 66 institutional cooperation partners. Information concerning the structure and activities can be found on a special website. Coordination Centres (CC) have been established in the 16 federal states, for the coordination of all state-specific activities. Funding for the CN and CC is provided by the BZgA, the German statutory sickness funds and by the state-specific ministries of health. These partners also support the continuous quality improvement, which is based on the good-practice criteria developed by the Advisory Committee of the CN. In 2011, the 'Municipal Partner Process (MPP)' has been launched, specifically supporting local partners and integrated life-course approaches focussing on children. In 2015, the focus has been widened to include all age-groups. In July 2015, a new national health law concerning health promotion and prevention has been ratified by the federal Parliament, with a focus on reducing health inequalities. Currently, the details of its implementation are discussed on a nationwide basis. The CN has long advocated for such a law, and today the CN is a well-accepted partner providing concepts, methods and a strong and long-standing network. The article closes with future challenges faced by the CN.

Multicell Cooperation for LTE-Advanced Heterogeneous Network Scenarios

DEFF Research Database (Denmark)

Soret, Beatriz; Wang, Hua; Rosa, Claudio

2013-01-01

In this article we present two promising practical use cases for simple multicell cooperation for LTE-Advanced heterogeneous network (HetNet) scenarios with macro and small cells. For co-channel deployment cases, we recommend the use of enhanced inter-cell interference coordination (e......ICIC) to mitigate cross-tier interference and ensure sufficient offload of users from macro to small cells. It is shown how the eICIC benefit is maximized by using a distributed inter-base station control framework for dynamic adjustment of essential parameters. Secondly, for scenarios where macro and small cells...... are deployed at different carriers an efficient use of the fragmented spectrum can be achieved by using collaborative inter-site carrier aggregation. In addition to distributed coordination/collaboration between base station nodes, the importance of explicit terminal assistance is highlighted. Comprehensive...

Patterns of cooperation: fairness and coordination in networks of interacting agents

Science.gov (United States)

Do, Anne-Ly; Rudolf, Lars; Gross, Thilo

2010-06-01

We study the self-assembly of a complex network of collaborations among self-interested agents. The agents can maintain different levels of cooperation with different partners. Further, they continuously, selectively and independently adapt the amount of resources allocated to each of their collaborations in order to maximize the obtained payoff. We show analytically that the system approaches a state in which the agents make identical investments, and links produce identical benefits. Despite this high degree of social coordination, some agents manage to secure privileged topological positions in the network, enabling them to extract high payoffs. Our analytical investigations provide a rationale for the emergence of unidirectional non-reciprocal collaborations and different responses to the withdrawal of a partner from an interaction that have been reported in the psychological literature.

Social imitation versus strategic choice, or consensus versus cooperation, in the networked Prisoner's Dilemma

Science.gov (United States)

Vilone, Daniele; Ramasco, José J.; Sánchez, Angel; Miguel, Maxi San

2014-08-01

The interplay of social and strategic motivations in human interactions is a largely unexplored topic in collective social phenomena. Whether individuals' decisions are taken in a purely strategic basis or due to social pressure without a rational background crucially influences the model outcome. Here we study a networked Prisoner's Dilemma in which decisions are made either based on the replication of the most successful neighbor's strategy (unconditional imitation) or by pure social imitation following an update rule inspired by the voter model. The main effects of the voter dynamics are an enhancement of the final consensus, i.e., asymptotic states are generally uniform, and a promotion of cooperation in certain regions of the parameter space as compared to the outcome of purely strategic updates. Thus, voter dynamics acts as an interface noise and has a similar effect as a pure random noise; furthermore, its influence is mostly independent of the network heterogeneity. When strategic decisions are made following other update rules such as the replicator or Moran processes, the dynamic mixed state found under unconditional imitation for some parameters disappears, but an increase of cooperation in certain parameter regions is still observed. Comparing our results with recent experiments on the Prisoner's Dilemma, we conclude that such a mixed dynamics may explain moody conditional cooperation among the agents.

Randomness in the network inhibits cooperation based on the bounded rational collective altruistic decision

International Nuclear Information System (INIS)

Ohdaira, Tetsushi

2014-01-01

Previous studies discussing cooperation employ the best decision that every player knows all information regarding the payoff matrix and selects the strategy of the highest payoff. Therefore, they do not discuss cooperation based on the altruistic decision with limited information (bounded rational altruistic decision). In addition, they do not cover the case where every player can submit his/her strategy several times in a match of the game. This paper is based on Ohdaira's reconsideration of the bounded rational altruistic decision, and also employs the framework of the prisoner's dilemma game (PDG) with sequential strategy. The distinction between this study and the Ohdaira's reconsideration is that the former covers the model of multiple groups, but the latter deals with the model of only two groups. Ohdaira's reconsideration shows that the bounded rational altruistic decision facilitates much more cooperation in the PDG with sequential strategy than Ohdaira and Terano's bounded rational second-best decision does. However, the detail of cooperation of multiple groups based on the bounded rational altruistic decision has not been resolved yet. This study, therefore, shows how randomness in the network composed of multiple groups affects the increase of the average frequency of mutual cooperation (cooperation between groups) based on the bounded rational altruistic decision of multiple groups. We also discuss the results of the model in comparison with related studies which employ the best decision. (paper)

Randomness in the network inhibits cooperation based on the bounded rational collective altruistic decision

Science.gov (United States)

Ohdaira, Tetsushi

2014-07-01

Previous studies discussing cooperation employ the best decision that every player knows all information regarding the payoff matrix and selects the strategy of the highest payoff. Therefore, they do not discuss cooperation based on the altruistic decision with limited information (bounded rational altruistic decision). In addition, they do not cover the case where every player can submit his/her strategy several times in a match of the game. This paper is based on Ohdaira's reconsideration of the bounded rational altruistic decision, and also employs the framework of the prisoner's dilemma game (PDG) with sequential strategy. The distinction between this study and the Ohdaira's reconsideration is that the former covers the model of multiple groups, but the latter deals with the model of only two groups. Ohdaira's reconsideration shows that the bounded rational altruistic decision facilitates much more cooperation in the PDG with sequential strategy than Ohdaira and Terano's bounded rational second-best decision does. However, the detail of cooperation of multiple groups based on the bounded rational altruistic decision has not been resolved yet. This study, therefore, shows how randomness in the network composed of multiple groups affects the increase of the average frequency of mutual cooperation (cooperation between groups) based on the bounded rational altruistic decision of multiple groups. We also discuss the results of the model in comparison with related studies which employ the best decision.

SMEs’ Organizational Performance: Comparative Study between Cooperated and Uncooperated Companies

Directory of Open Access Journals (Sweden)

Ana Karla de Lucena Justino Gomes

2017-12-01

Full Text Available Faced with the need for survival and competitiveness, here called micro and small enterprises (MPE, they seek to develop competitive differentials, such as the insertion of the company into a cooperation network. Several researches seek to identify the benefits of cooperative strategies, but few studies seek to compare the organizational performance of cooperating companies with that of uncooperated companies. Thus, the present study has as general objective to verify if the MPE, when inserted in cooperation networks, present organizational performance superior to those that are not inserted in that context. The present research is of the survey type and involves 67 companies inserted in cooperation networks and 154 companies that do not participate in cooperation networks. To achieve the objective, the organizational performance was analyzed based on the managers' perception regarding aspects associated to the following performance measures: customer satisfaction, employee satisfaction, company growth, company profitability and overall performance. The results indicate that the companies included in cooperation networks presented superior performance when compared to the companies not included in cooperation networks

Secure Cooperative Spectrum Sensing for the Cognitive Radio Network Using Nonuniform Reliability

Directory of Open Access Journals (Sweden)

Muhammad Usman

2014-01-01

Full Text Available Both reliable detection of the primary signal in a noisy and fading environment and nullifying the effect of unauthorized users are important tasks in cognitive radio networks. To address these issues, we consider a cooperative spectrum sensing approach where each user is assigned nonuniform reliability based on the sensing performance. Users with poor channel or faulty sensor are assigned low reliability. The nonuniform reliabilities serve as identification tags and are used to isolate users with malicious behavior. We consider a link layer attack similar to the Byzantine attack, which falsifies the spectrum sensing data. Three different strategies are presented in this paper to ignore unreliable and malicious users in the network. Considering only reliable users for global decision improves sensing time and decreases collisions in the control channel. The fusion center uses the degree of reliability as a weighting factor to determine the global decision in scheme I. Schemes II and III consider the unreliability of users, which makes the computations even simpler. The proposed schemes reduce the number of sensing reports and increase the inference accuracy. The advantages of our proposed schemes over conventional cooperative spectrum sensing and the Chair-Varshney optimum rule are demonstrated through simulations.

Coded Cooperation for Multiway Relaying in Wireless Sensor Networks †

Science.gov (United States)

Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

2015-01-01

Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels. PMID:26131675

Cooperative Localization for Mobile Networks

DEFF Research Database (Denmark)

Cakmak, Burak; Urup, Daniel Nygaard; Meyer, Florian

2016-01-01

We propose a hybrid message passing method for distributed cooperative localization and tracking of mobile agents. Belief propagation and mean field message passing are employed for, respectively, the motion-related and measurementrelated part of the factor graph. Using a Gaussian belief approxim......We propose a hybrid message passing method for distributed cooperative localization and tracking of mobile agents. Belief propagation and mean field message passing are employed for, respectively, the motion-related and measurementrelated part of the factor graph. Using a Gaussian belief...

A game theoretical approach for cooperative environmentally friendly cellular networks powered by the smart grid

KAUST Repository

Ghazzai, Hakim

2014-11-01

This paper investigates the collaboration between multiple mobile operators to optimize the energy efficiency of cellular networks, maximize their profits or achieve or tradeoff between both objectives. Mobile operators cooperate together by eliminating redundant base stations (BSs) using a low complexity algorithm that aims to maximize their objective functions subject to a quality of service constraint. The problem is modeled as a two-level Stackelberg game: a mobile operator level and a smart grid level. Indeed, in our framework, we assume that cellular networks are powered by multiple energy providers existing in the smart grid characterized by different pollutant levels in addition to renewable energy source deployed in BS sites. The objective is to find the best active BS combination and the optimal procurement decision needed to the network operation during collaboration by considering electricity real-time pricing. Our study includes the daily traffic variation in addition to the daily green energy availability. Our simulation results show a significant saving in terms of CO2 emissions compared to the non-collaboration case and that cooperative mobile operators exploiting renewables are more awarded than traditional operators. © 2014 IEEE.

Cooperation in wireless networks principles and applications : real egoistic behavior is to cooperate!

CERN Document Server

Fitzek, Frank HP

2006-01-01

Covers the underlying principles of cooperative techniques as well as several applications demonstrating the use of such techniques in practical systems. This book also summarizes the strength of cooperation for wireless communication systems, motivating the use of cooperative techniques.

Research and development cooperation project on environmental measurement using laser radar in fiscal 1995 (environmental network); Kankyo keisokuyo laser radar no kaihatsu ni kansuru kenkyu kyoryoku (kankyo network)

Energy Technology Data Exchange (ETDEWEB)

NONE

1996-03-01

As a part of the cooperative work with Indonesia of R and D of a laser radar for environmental measurement, the paper described the development of an environmental network. The field survey was conducted in April, July and December 1995 and in March 1996. For the investigational research, five meetings of the committee and four times of group work were held. The Asian environmental network was studied in terms of its arrangement, operation and management, and the overall network/path control design were being prepared. To make the persons concerned abroad and in Japan understood the APEC Osaka Conference held in November 1995, a homepage APEC `95 Kansai was opened using WWW (World Wide Web, a decentralized hyper media system which can dispatch information to the whole world by network using hyper text). Moreover, in connection with this, a homepage was opened of CICC (Center of the International Cooperation for Computerization, a center controlling the whole Asian environmental information network system where E-mail and data are exchangeable with Indonesia via Tokyo NOC (Network Operation Center)). 49 figs., 8 tabs.

Cooperative networks : The mobile tethering game

NARCIS (Netherlands)

Constantinescu, M.; Bouwman, H.; Djurica, M.; Durmus, Y.; Onur, E.; Reuver, M. de

2012-01-01

We propose an analysis of cooperation for data sharing and the behavioral aspects involved in the process of decision making. Starting with the tethering capabilities of recent devices we apply game theoretical principles and models, inquire what makes the cooperation work, and what are the

Cooperative relationships and competitiveness in supermarket sector

Directory of Open Access Journals (Sweden)

Andressa Centenaro

2017-02-01

Full Text Available Purpose – This article aims to investigate the influence of cooperative relations in the performance of companies in the supermarket sector, comparing the companies associated networks with companies not associated. Design/methodology/approach – The research method employed was a survey research with 31 companies. Findings – The results indicate that the cooperative relationships with suppliers have a positive impact on companies of performance, while the cooperative relationships with competitors and local institutions do not influence the performance. Moreover, it appears that there is no relationship between participation in a network of cooperation and achieving superior performance. However, companies linked to the network present better cooperative relationships with suppliers, which positively impacts the performance and therefore have competitive advantages over companies not associated to networks. Originality/value – The cooperative relationships with suppliers can provide benefits such as reducing logistics costs, improved product portfolio, better negotiating prices and terms, partnership for conducting marketing strategies among others, thus increasing the competitiveness of companies in the supermarket sector.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

Science.gov (United States)

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

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

Directory of Open Access Journals (Sweden)

Jong-Ho Lee

2017-05-01

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

A localized cooperative wideband spectrum sensing for dynamic access of TV bands using RF sensor networks

KAUST Repository

Mirza, Mohammed; Alouini, Mohamed-Slim

2011-01-01

In this paper we address and simulate a Radio Frequency (RF) sensor network for a cooperative spectrum sensing and localization scheme. The proposed method integrates a Wavelet based Multi-Resolution Spectrum Sensing (MRSS), an N-bit hard

An Energy-Efficient Scheme for Multirelay Cooperative Networks with Energy Harvesting

Directory of Open Access Journals (Sweden)

Dingcheng Yang

2016-01-01

Full Text Available This study investigates an energy-efficient scheme in multirelay cooperative networks with energy harvesting where multiple sessions need to communicate with each other via the relay node. A two-step optimal method is proposed which maximizes the system energy efficiency, while taking into account the receiver circuit energy consumption. Firstly, the optimal power allocation for relay nodes is determined to maximize the system throughput; this is based on directional water-filling algorithm. Secondly, using quantum particle swarm optimization (QPSO, a joint relay node selection and session grouping optimization is proposed. With this algorithm, sessions can be classified into multiple groups that are assisted by the specific relay node with the maximum energy efficiency. This approach leads to a better global optimization in searching ability and efficiency. Simulation results show that the proposed scheme can improve the energy efficiency effectively compared with direct transmission and opportunistic relay-selected cooperative transmission.

Threshold-Based Relay Selection for Detect-and-Forward Relaying in Cooperative Wireless Networks

Directory of Open Access Journals (Sweden)

Fan Yijia

2010-01-01

Full Text Available This paper studies two-hop cooperative demodulate-and-forward relaying using multiple relays in wireless networks. A threshold based relay selection scheme is considered, in which the reliable relays are determined by comparing source-relay SNR to a threshold, and one of the reliable relays is selected by the destination based on relay-destination SNR. The exact bit error rate of this scheme is derived, and a simple threshold function is proposed. It is shown that the network achieves full diversity order ( under the proposed threshold, where is the number of relays in the network. Unlike some other full diversity achieving protocols in the literature, the requirement that the instantaneous/average SNRs of the source-relay links be known at the destination is eliminated using the appropriate SNR threshold.

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

Science.gov (United States)

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…

Cluster Cooperation in Wireless-Powered Sensor Networks: Modeling and Performance Analysis

Directory of Open Access Journals (Sweden)

Chao Zhang

2017-09-01

Full Text Available A wireless-powered sensor network (WPSN consisting of one hybrid access point (HAP, a near cluster and the corresponding far cluster is investigated in this paper. These sensors are wireless-powered and they transmit information by consuming the harvested energy from signal ejected by the HAP. Sensors are able to harvest energy as well as store the harvested energy. We propose that if sensors in near cluster do not have their own information to transmit, acting as relays, they can help the sensors in a far cluster to forward information to the HAP in an amplify-and-forward (AF manner. We use a finite Markov chain to model the dynamic variation process of the relay battery, and give a general analyzing model for WPSN with cluster cooperation. Though the model, we deduce the closed-form expression for the outage probability as the metric of this network. Finally, simulation results validate the start point of designing this paper and correctness of theoretical analysis and show how parameters have an effect on system performance. Moreover, it is also known that the outage probability of sensors in far cluster can be drastically reduced without sacrificing the performance of sensors in near cluster if the transmit power of HAP is fairly high. Furthermore, in the aspect of outage performance of far cluster, the proposed scheme significantly outperforms the direct transmission scheme without cooperation.

Cooperation prevails when individuals adjust their social ties.

Directory of Open Access Journals (Sweden)

Francisco C Santos

2006-10-01

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

Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access

KAUST Repository

Zafar, Ammar; Alouini, Mohamed-Slim; Chen, Yunfei; Radaydeh, Redha M.

2012-01-01

Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.

Optimizing Cooperative Cognitive Radio Networks with Opportunistic Access

KAUST Repository

Zafar, Ammar

2012-09-16

Optimal resource allocation for cooperative cognitive radio networks with opportunistic access to the licensed spectrum is studied. Resource allocation is based on minimizing the symbol error rate at the receiver. Both the cases of all-participate relaying and selective relaying are considered. The objective function is derived and the constraints are detailed for both scenarios. It is then shown that the objective functions and the constraints are nonlinear and nonconvex functions of the parameters of interest, that is, source and relay powers, symbol time, and sensing time. Therefore, it is difficult to obtain closed-form solutions for the optimal resource allocation. The optimization problem is then solved using numerical techniques. Numerical results show that the all-participate system provides better performance than its selection counterpart, at the cost of greater resources. © 2012 Ammar Zafar et al.

Throughput, Energy and Overhead of Multicast Device-to-Device Communications with Network Coded Cooperation

DEFF Research Database (Denmark)

Hernandez, Nestor; Heide, Janus; Roetter, Daniel Enrique Lucani

2017-01-01

, this assumes that the throughput gains and energy savings in multicasting are much larger between devices than the base station to the receivers. However, current mobile networks suffer from many different issues varying the performance in data rates, which calls into question these assumptions. Therefore......, a first objective of this work is to assess the operating regions where employing cooperation results in higher throughput and/or energy savings. We consider multicast scenarios with network coded mechanisms employing Random Linear Network Coding (RLNC). However, although RLNC is good for low amount...... of transmissions in multicast, it has an inherent overhead from extreme high or low field related caveats. Thus, as a second objective, we review and propose the application of new network codes that posses low overhead for multicasting, by having a short representation and low dependence probability. We provide...

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

Science.gov (United States)

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.

Optimization of potential field method parameters through networks for swarm cooperative manipulation tasks

Directory of Open Access Journals (Sweden)

Rocco Furferi

2016-10-01

Full Text Available An interesting current research field related to autonomous robots is mobile manipulation performed by cooperating robots (in terrestrial, aerial and underwater environments. Focusing on the underwater scenario, cooperative manipulation of Intervention-Autonomous Underwater Vehicles (I-AUVs is a complex and difficult application compared with the terrestrial or aerial ones because of many technical issues, such as underwater localization and limited communication. A decentralized approach for cooperative mobile manipulation of I-AUVs based on Artificial Neural Networks (ANNs is proposed in this article. This strategy exploits the potential field method; a multi-layer control structure is developed to manage the coordination of the swarm, the guidance and navigation of I-AUVs and the manipulation task. In the article, this new strategy has been implemented in the simulation environment, simulating the transportation of an object. This object is moved along a desired trajectory in an unknown environment and it is transported by four underwater mobile robots, each one provided with a seven-degrees-of-freedom robotic arm. The simulation results are optimized thanks to the ANNs used for the potentials tuning.

“It All Started from Worms”: Korea-Japan Parasite Control Cooperation and Asian Network, 1960s - 1980s

Directory of Open Access Journals (Sweden)

Junho JUNG

2018-04-01

Full Text Available The Korea Association of Health Promotion and Japanese Organization for International Cooperation in Family Planning (JOICFP, and Taiwan’s Chinese Foundation of Health all originated from parasite control organizations. Currently these organizations hold no apparent relations to parasite control activities. However, many of the senior leaderships of these organizations including presidents, have parasitology as their background. Kunii Chojiro (the founder of Japan Association of Parasite Control (JAPC and JOICFP explained it as “it all started from worms.” In 1949, Kunii Chojiro established JAPC after personally experienced intestinal parasite infection. The JAPC people conducted mass examination and mass chemotherapy focusing on school children, which allowed them to have sustainable income. In 1965, the Korea Association of Parasite Eradication (KAPE requested JAPC to assist Korea’s parasite control activity. In 1968, when Korea-Japan cooperation for parasite control activity established, Japan’s operating procedures were directly absorbed by KAPE. With support from JAPC and official development aid through Overseas Technical Cooperation Agency in Japan (now Japan International Cooperation Agency, Korea successfully controlled parasite infection. Post-war and cold-war geopolitics had a significant impact on Korea-Japan cooperation. In 1960s the president of KAPE, Chong-Chin Lee and Kunii Chojiro were well known figures in population control network. They did understand the importance of population control, but did not agree with the approaches taken by western population control experts. From their point of view, it had to be self-initiated, economically self sustainable grass-root activities rather than top-down activities, as experienced in their parasite control in Japan and Korea. This lead to a new Asian model named “Integrated Program”. Together with their influence in population control network, Kunii and Lee manage to

Cooperative Learning within Educational Networks: Perspectives for Good Educational Governance in Modern Reading Education

Directory of Open Access Journals (Sweden)

Gudrun Marci-Boehncke

2017-10-01

Full Text Available German schools, universities, and libraries haven’t established a teaching and cooperation practice that uses the potential of a convergent and participatory culture (Jenkins 2006, 2009. Schools and libraries have to collaborate more closely using the digital networks and language of the students of today. Although official references, such as the report of the EU High-Level Group of Experts on Literacy (2012, postulate joint efforts with the objective of promoting reading and media education by different educational and non-educational institutions, at least in Germany this is currently still not a collaborative educational practice. One reason for this might be a missing link in local educational governance. Furthermore, the professional self-image of teachers and librarians, as well as the image of the cooperation partner, may limit effective public cooperation. This contribution starts (1 with an outline of the demands in the field of digital literacy and participatory culture, followed by (2 a discussion about the chances and potentials of partnerships between schools and public libraries, their specific interests, and potential. Finally, (3 problems and principles of good educational governance within those networks are identified and developed to excavate the potential, especially for academic teaching and students’ practice. The article is based on empirical data as well as participatory observation of the three-years teacher training and the seven years of on-the-job-training of librarians of public libraries (“Experten für das Lesen”.

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

Tirado-Soto, Magda Martina; Zamberlan, Fabio Luiz

2013-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Tirado-Soto, Magda Martina, E-mail: magda@pep.ufrj.br [Program of Production Engineering, School and Research in Engineering, Federal University of Rio de Janeiro (Brazil); Zamberlan, Fabio Luiz, E-mail: fabio@pep.ufrj.br [Program of Production Engineering, School and Research in Engineering, Federal University of Rio de Janeiro (Brazil)

2013-04-15

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

AWARE: Platform for Autonomous self-deploying and operation of Wireless sensor-actuator networks cooperating with unmanned AeRial vehiclEs

NARCIS (Netherlands)

Ollero, Anibal; Bernard, Markus; La Civita, Marco; van Hoesel, L.F.W.; Marron, Pedro J.; Lepley, Jason; de Andres, Eduardo

This paper presents the AWARE platform that seeks to enable the cooperation of autonomous aerial vehicles with ground wireless sensor-actuator networks comprising both static and mobile nodes carried by vehicles or people. Particularly, the paper presents the middleware, the wireless sensor network,

Network Analysis of Cooperation in Tourism Destinations

Directory of Open Access Journals (Sweden)

Gajdošík Tomáš

2015-12-01

Full Text Available Globalisation on the tourism market causes that the competition is not formed only between stakeholders in a destination, but more and more it is created among destinations. Therefore tourism stakeholders in a destination have to act together and cooperate. The cooperative behaviour of destination stakeholders is seen as a main prerequisite of applying the cooperative destination management, which influences the competitiveness of destination on tourism market.

Auction-Based Resource Allocation for Cooperative Video Transmission Protocols over Wireless Networks

Directory of Open Access Journals (Sweden)

Zhu Han

2009-01-01

Full Text Available Cooperative transmission has been proposed as a novel transmission strategy that takes advantage of broadcast nature of wireless networks, forms virtual MIMO system, and provides diversity gains. In this paper, wireless video transmission protocols are proposed, in which the spectrum resources are first allocated for the source side to broadcast video packets to the relay and destination, and then for the relay side to transmit side information generated from the received packets. The proposed protocols are optimized to minimize the end-to-end expected distortion via choosing bandwidth/power allocation, configuration of side information, subject to bandwidth and power constraints. For multiuser cases, most of current resource allocation approaches cannot be naturally extended and applied to the networks with relay nodes for video transmission. This paper extends the share auction approach into the cooperative video communication scenarios and provides a near-optimal solution for resource allocation. Experimental results have demonstrated that the proposed approach has significant advantage of up to 4 dB gain in single user case and 1.3 dB gain in multiuser case over the reference systems in terms of peak-to-signal-noise ratio. In addition, it reduces the formidable computational complexity of the optimal solution to linear complexity with performance degradation of less than 0.3 dB.

Energy efficient cooperation in underlay RFID cognitive networks for a water smart home.

Science.gov (United States)

Nasir, Adnan; Hussain, Syed Imtiaz; Soong, Boon-Hee; Qaraqe, Khalid

2014-09-30

Shrinking water resources all over the world and increasing costs of water consumption have prompted water users and distribution companies to come up with water conserving strategies. We have proposed an energy-efficient smart water monitoring application in [1], using low power RFIDs. In the home environment, there exist many primary interferences within a room, such as cell-phones, Bluetooth devices, TV signals, cordless phones and WiFi devices. In order to reduce the interference from our proposed RFID network for these primary devices, we have proposed a cooperating underlay RFID cognitive network for our smart application on water. These underlay RFIDs should strictly adhere to the interference thresholds to work in parallel with the primary wireless devices [2]. This work is an extension of our previous ventures proposed in [2,3], and we enhanced the previous efforts by introducing a new system model and RFIDs. Our proposed scheme is mutually energy efficient and maximizes the signal-to-noise ratio (SNR) for the RFID link, while keeping the interference levels for the primary network below a certain threshold. A closed form expression for the probability density function (pdf) of the SNR at the destination reader/writer and outage probability are derived. Analytical results are verified through simulations. It is also shown that in comparison to non-cognitive selective cooperation, this scheme performs better in the low SNR region for cognitive networks. Moreover, the hidden Markov model's (HMM) multi-level variant hierarchical hidden Markov model (HHMM) approach is used for pattern recognition and event detection for the data received for this system [4]. Using this model, a feedback and decision algorithm is also developed. This approach has been applied to simulated water pressure data from RFID motes, which were embedded in metallic water pipes.

Perceived Influence and Friendship as Antecedents of Cooperation in Top Management Teams: A Network Approach

Directory of Open Access Journals (Sweden)

Olaf N. Rank

2010-10-01

Full Text Available Using the relational dyad as unit of analysis this study examines the effects of perceived influence and friendship ties on the formation and maintenance of cooperative relationships between corporate top executives. Specifically, it is argued that perceived influence as well as friendship ties between any two managers will enhance the likelihood that these managers collaborate with each other. Additionally, a negative interaction effect between perceived influence and friendship on cooperation is proposed. The empirical analyses draw on network data that have been collected among all members of the top two organizational levels for the strategy-making process in two multinational firms headquartered in Germany. Applying logistic regression based on QAP the empirical results support our hypotheses on the direct effects between perceived influence, friendship ties, and cooperative relationships in both companies. In addition, we find at least partial support for our assumption that perceived influence and friendship interact negatively with respect to their effect on cooperation. Seemingly, perceived influence is partially substituted by managerial friendship ties.

Scientific cooperation of the "Universidad Distrital Francisco José de Caldas" between the years 2011 and 2015, a Network Social Analisys (NSA approach

Directory of Open Access Journals (Sweden)

Jesus David Romero Betancur

2016-12-01

Full Text Available Analysis of cooperation networks formed as a result of the co-authorship of scientific texts allows a different view of space in which research activity and relationships, formal and informal, made up of researchers and constitute social capital for them develops and the institution. Based on those recorded in the SciVal platform scientific texts, which include the participation of at least one author or co-author with affiliation with the University Francisco José de Caldas, the networks made up of institutional cooperation are identified in the authorship of these texts, identifying for these and the actors who compose, modularity and the degree of cooperation, obtaining as main result, the relationship of the institutions with which it has been more relevant cooperation during the period analyzed.

Fast Detection Method in Cooperative Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Zhengyi Li

2010-01-01

Full Text Available Cognitive Radio (CR technology improves the utilization of spectrum highly via opportunistic spectrum sharing, which requests fast detection as the spectrum utilization is dynamic. Taking into consideration the characteristic of wireless channels, we propose a fast detection scheme for a cooperative cognitive radio network, which consists of multiple CRs and a central control office. Specifically, each CR makes individual detection decision using the sequential probability ratio test combined with Neyman Pearson detection with respect to a specific observation window length. The proposed method upper bounds the detection delay. In addition, a weighted K out of N fusion rule is also proposed for the central control office to reach fast global decision based on the information collected from CRs, with more weights assigned for CRs with good channel conditions. Simulation results show that the proposed scheme can achieve fast detection while maintaining the detection accuracy.

Multipath TCP for user cooperation in wireless networks

CERN Document Server

Zhou, Dizhi

2014-01-01

This brief presents several enhancement modules to Multipath Transmission Control Protocol (MPTCP) in order to support stable and efficient multipath transmission with user cooperation in the Long Term Evolution (LTE) network. The text explains how these enhancements provide a stable aggregate throughput to the upper-layer applications; guarantee a steady goodput, which is the real application-layer perceived throughput; and ensure that the local traffic of the relays is not adversely affected when the relays are forwarding data for the destination. The performance of the proposed solutions is extensively evaluated using various scenarios. The simulation results demonstrate that the proposed modules can achieve a stable aggregate throughput and significantly improve the goodput by 1.5 times on average. The brief also shows that these extensions can well respect the local traffic of the relays and motivate the relay users to provide the relaying service.

Expanded activity of schools in Serbia: Legal framework and practical experiences

Directory of Open Access Journals (Sweden)

Ognjenović Kosovka Đ.

2012-09-01

Full Text Available Expanded activities of schools and activities of student cooperatives are important components of the educational process in schools, which are contributing to the improvement of the quality of education and better social inclusion of students. The main objective of this article is to focus on opportunities enabled by the legal framework that supports the realization of expanded activities and activities of student cooperatives in Serbian schools and to compare relevant experiences in Serbia with the practice in neighbouring countries and the old EU Member States. In particular, in this article it is examined to what extent the adoption of entrepreneurial competences through different entrepreneurship development programs contributes to the probability of implementation of additional activities in Serbian schools. For this purpose, the data of the Survey on practising, types and usefulness of expanded activities and activities of student cooperatives are used. This survey was conducted in 2010 at the samples of public primary and secondary schools that executed some sort of additional activities, as well as of schools that did not practice extended activities.

Strengthening the infrastructure for RI applications in cooperation with the IAEA

Energy Technology Data Exchange (ETDEWEB)

Park, Kyung Bae; Hong, Young Don; Kim, Seung Yun; Kim, Kyoung Pyo; Lee, Jeong Kong

2000-12-01

The future direction for nuclear cooperation should be implemented with the aim of enhancing the status of Korea within the international society as well as carrying out the established national nuclear policy goal. Strategies for implementing cooperation with the IAEA were described into four separate parts; 'strategies for strengthening cooperation in general areas', 'strategies for implementing IAEA technical cooperation programs', 'strategies for implementing IAEA CRP programs' and 'Strategies for effective participation in the area of radiation and RI application'. As for strategies for implementing IAEA technical cooperation programs, i) expanding domestic personnel's entering into the IAEA ii) establishment of a liaison office for support of IAEA technical cooperation iii) expanding domestic experts entering into member of consultation group for a director-general of the IAEA and more participation in the international meetings iv) cooperation with IAEA's Seibersdorf Laboratories. For the strengthening of IAEA technical cooperation, strategies for effective implementation of technical cooperation programs such as i) strengthening role of national TC liaison officer ii) strengthening application of Model Project concept iii) Implementing End-user oriented programs iv) Establishment of measure to increase the TC implementation rate v) hosting of fellowship, scientific visitors, support for expert mission, were presented. Strategies for expanding domestic participation in the IAEA technical cooperation programs were also described for producing the benefits from implementing the IAEA technical cooperation programs. As for strategies for implementing the IAEA CRP programs, i) measures for active participation in the IAEA CRP programs and ii) measures for gradual participation in the IAEA CRP programs were separately described. To maximize the utilization of HANARO, a multi-purpose research reactor, the on

Strengthening the infrastructure for RI applications in cooperation with the IAEA

International Nuclear Information System (INIS)

Park, Kyung Bae; Hong, Young Don; Kim, Seung Yun; Kim, Kyoung Pyo; Lee, Jeong Kong

2000-12-01

The future direction for nuclear cooperation should be implemented with the aim of enhancing the status of Korea within the international society as well as carrying out the established national nuclear policy goal. Strategies for implementing cooperation with the IAEA were described into four separate parts; 'strategies for strengthening cooperation in general areas', 'strategies for implementing IAEA technical cooperation programs', 'strategies for implementing IAEA CRP programs' and 'Strategies for effective participation in the area of radiation and RI application'. As for strategies for implementing IAEA technical cooperation programs, i) expanding domestic personnel's entering into the IAEA ii) establishment of a liaison office for support of IAEA technical cooperation iii) expanding domestic experts entering into member of consultation group for a director-general of the IAEA and more participation in the international meetings iv) cooperation with IAEA's Seibersdorf Laboratories. For the strengthening of IAEA technical cooperation, strategies for effective implementation of technical cooperation programs such as i) strengthening role of national TC liaison officer ii) strengthening application of Model Project concept iii) Implementing End-user oriented programs iv) Establishment of measure to increase the TC implementation rate v) hosting of fellowship, scientific visitors, support for expert mission, were presented. Strategies for expanding domestic participation in the IAEA technical cooperation programs were also described for producing the benefits from implementing the IAEA technical cooperation programs. As for strategies for implementing the IAEA CRP programs, i) measures for active participation in the IAEA CRP programs and ii) measures for gradual participation in the IAEA CRP programs were separately described. To maximize the utilization of HANARO, a multi-purpose research reactor, the on-going development and development project are actively

The CE3R Network: current status and future perspectives

Science.gov (United States)

Lenhardt, Wolfgang; Pesaresi, Damiano; Živčić, Mladen; Costa, Giovanni; Kuk, Kresimir; Bondár, István; Duni, Llambro; Spacek, Petr

2016-04-01

In order to improve the monitoring of seismic activities in the border regions and to enhance the collaboration between countries and seismological institutions in Central Europe, the Environment Agency of the Slovenian Republic (ARSO), the Italian National Institute for Oceanography and Experimental Geophysics (OGS), the University of Trieste (UniTS) and the Austrian Central Institute for Meteorology and Geodynamics (ZAMG) established in 2001 the "South Eastern Alps Transfrontier Seismological Network". In May 2014 ARSO, OGS, UniTS and ZAMG agreed to formalize the transfrontier network, to name it "Central and East European Earthquake Research Network", (CE3RN or CE3R Network) in order to locate it geographically since cross-border networks can be established in other areas of the world and to expand their cooperation, including institutions in other countries. The University of Zagreb (UniZG) joined CE3RN in October 2014. The Kövesligethy Radó Seismological Observatory (KRSZO) of the Hungarian Academy of Sciences joined CE3RN in October 2015. The Institute of Geosciences, Energy, Water and Environment (IGEWE) of the Polytechnic University of Tirana joined CE3RN in November 2015. The Institute of Physics of the Earth (IPE) of the Masaryk University in Brno joined CE3RN in November 2015. CE3RN Parties intend to formalize and possibly extend their ongoing cooperation in the field of seismological data acquisition, exchange and use for seismological and earthquake engineering and civil protection purposes. The purpose of this cooperation is to retain and expand the existing cross-border network, specify the rules of conduct in the network management, improvements, extensions and enlargements, enhance seismological research in the region, and support civil protection activities. Since the formal establishment of CE3RN, several common projects have been completed, like the SeismoSAT project for the seismic data center connection over satellite funded by the Interreg

Technology and Cooperation: The Behaviors of Networking.

Science.gov (United States)

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)

Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks

Directory of Open Access Journals (Sweden)

Alagan Anpalagan

2013-04-01

Full Text Available Due to the rapid increase in the usage and demand of wireless sensor networks (WSN, the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN. The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP, which is generally non-deterministic polynomial-time (NP-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.

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

Science.gov (United States)

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.

Cooperation in health: mapping collaborative networks on the web.

Science.gov (United States)

Lang, Pamela Barreto; Gouveia, Fábio Castro; Leta, Jacqueline

2013-01-01

To map and investigate the relationships established on the web between leading health-research institutions around the world. Sample selection was based on the World Health Organization (WHO) Collaborating Centres (CCs). Data on the 768 active CCs in 89 countries were retrieved from the WHO's database. The final sample consisted of 190 institutions devoted to health sciences in 42 countries. Data on each institution's website were retrieved using webometric techniques (interlinking), and an asymmetric matrix was generated for social network analysis. The results showed that American and European institutions, such as the Centers for Disease Control and Prevention (CDC), the National Institutes of Health (NIH) and the National Institute of Health and Medical Research (INSERM), are the most highly connected on the web and have a higher capacity to attract hyperlinks. The Karolinska Institute (KI-SE) in Sweden is well placed as an articulation point between several integrants of the network and the component's core but lacks general recognition on the web by hyperlinks. Regarding the north-south divide, Mexico and Brazil appear to be key southern players on the web. The results showed that the hyperlinks exchanged between northern and southern countries present an abysmal gap: 99.49% of the hyperlinks provided by the North are directed toward the North itself, in contrast to 0.51% that are directed toward the South. Regarding the South, its institutions are more connected to its northern partners, with 98.46% of its hyperlinks directed toward the North, and mainly toward the United States, compared with 1.54% toward southern neighbors. It is advisable to strengthen integration policies on the web and to increase web networking through hyperlink exchange. In this way, the web could actually reflect international cooperation in health and help to legitimize and enhance the visibility of the many existing south-south collaboration networks.

Cooperation in health: mapping collaborative networks on the web.

Directory of Open Access Journals (Sweden)

Pamela Barreto Lang

Full Text Available OBJECTIVE: To map and investigate the relationships established on the web between leading health-research institutions around the world. METHODS: Sample selection was based on the World Health Organization (WHO Collaborating Centres (CCs. Data on the 768 active CCs in 89 countries were retrieved from the WHO's database. The final sample consisted of 190 institutions devoted to health sciences in 42 countries. Data on each institution's website were retrieved using webometric techniques (interlinking, and an asymmetric matrix was generated for social network analysis. FINDINGS: The results showed that American and European institutions, such as the Centers for Disease Control and Prevention (CDC, the National Institutes of Health (NIH and the National Institute of Health and Medical Research (INSERM, are the most highly connected on the web and have a higher capacity to attract hyperlinks. The Karolinska Institute (KI-SE in Sweden is well placed as an articulation point between several integrants of the network and the component's core but lacks general recognition on the web by hyperlinks. Regarding the north-south divide, Mexico and Brazil appear to be key southern players on the web. The results showed that the hyperlinks exchanged between northern and southern countries present an abysmal gap: 99.49% of the hyperlinks provided by the North are directed toward the North itself, in contrast to 0.51% that are directed toward the South. Regarding the South, its institutions are more connected to its northern partners, with 98.46% of its hyperlinks directed toward the North, and mainly toward the United States, compared with 1.54% toward southern neighbors. CONCLUSION: It is advisable to strengthen integration policies on the web and to increase web networking through hyperlink exchange. In this way, the web could actually reflect international cooperation in health and help to legitimize and enhance the visibility of the many existing south

Environmental influences on cooperation in social dilemmas on networks

Science.gov (United States)

Xie, Yunya; Chang, Shuhua; Yan, Ming; Zhang, Zhipeng; Wang, Xinyu

2018-02-01

Environmental influence on cooperation is a classical topic that is widely applicable to social interactions. Here, we introduce a realistic model which depends on both the payoff and the strategy of the environment. As the strategy of the environment rather than the neighbor is imitated with a probability, the model takes more attention on the comprehensive influence of the nearby neighbors. The simulation results show that the cooperation level can be widely enhanced for the prisoner's dilemma game and the snowdrift game with this environment factor. In this environmental model, the mechanism of the survival of cooperators is deeply studied, and the corresponding results can be derived. Although the survival of cooperators also depends on the formation of the cooperator clusters, the enhancement of the cooperation level can be interpreted as the accumulation effect of the transformation of defection into cooperation. Interestingly, there exists a threshold of the initial fraction of the cooperators, and the cooperation increases significantly when this threshold is reached Moreover, the square cooperative cluster is stable, and robust against different levels of the noise parameter and temptation in the strategy adoption process. This work may shed light on the mechanism of cooperation in the real world.

The application of network teaching in applied optics teaching

Science.gov (United States)

Zhao, Huifu; Piao, Mingxu; Li, Lin; Liu, Dongmei

2017-08-01

Network technology has become a creative tool of changing human productivity, the rapid development of it has brought profound changes to our learning, working and life. Network technology has many advantages such as rich contents, various forms, convenient retrieval, timely communication and efficient combination of resources. Network information resources have become the new education resources, get more and more application in the education, has now become the teaching and learning tools. Network teaching enriches the teaching contents, changes teaching process from the traditional knowledge explanation into the new teaching process by establishing situation, independence and cooperation in the network technology platform. The teacher's role has shifted from teaching in classroom to how to guide students to learn better. Network environment only provides a good platform for the teaching, we can get a better teaching effect only by constantly improve the teaching content. Changchun university of science and technology introduced a BB teaching platform, on the platform, the whole optical classroom teaching and the classroom teaching can be improved. Teachers make assignments online, students learn independently offline or the group learned cooperatively, this expands the time and space of teaching. Teachers use hypertext form related knowledge of applied optics, rich cases and learning resources, set up the network interactive platform, homework submission system, message board, etc. The teaching platform simulated the learning interest of students and strengthens the interaction in the teaching.

Performance analysis of best relay selection scheme for amplify-and-forward cooperative networks in identical Nakagami-m channels

KAUST Repository

Hussain, Syed Imtiaz; Alouini, Mohamed-Slim; Hasna, Mazen Omar

2010-01-01

for a cooperative network with multiple relays operating in amplify-and-forward (AF) mode over identical Nakagami-m channels using exact source-relay-destination signal to noise ratio (SNR) expression. We derive accurate closed form expressions

Collective Dynamics in Physical and Social Networks

Science.gov (United States)

Isakov, Alexander

We study four systems where individual units come together to display a range of collective behavior. First, we consider a physical system of phase oscillators on a network that expands the Kuramoto model to include oscillator-network interactions and the presence of noise: using a Hebbian-like learning rule, oscillators that synchronize in turn strengthen their connections to each other. We find that the average degree of connectivity strongly affects rates of flipping between aligned and anti-aligned states, and that this result persists to the case of complex networks. Turning to a fully multi-player, multi-strategy evolutionary dynamics model of cooperating bacteria that change who they give resources to and take resources from, we find several regimes that give rise to high levels of collective structure in the resulting networks. In this setting, we also explore the conditions in which an intervention that affects cooperation itself (e.g. "seeding the network with defectors") can lead to wiping out an infection. We find a non-monotonic connection between the percent of disabled cooperation and cure rate, suggesting that in some regimes a limited perturbation can lead to total population collapse. At a larger scale, we study how the locomotor system recovers after amputation in fruit flies. Through experiment and a theoretical model of multi-legged motion controlled by neural oscillators, we find that proprioception plays a role in the ability of flies to control leg forces appropriately to recover from a large initial turning bias induced by the injury. Finally, at the human scale, we consider a social network in a traditional society in Africa to understand how social ties lead to group formation for collective action (stealth raids). We identify critical and distinct roles for both leadership (important for catalyzing a group) and friendship (important for final composition). We conclude with prospects for future work.

A Novel Wireless Power Transfer-Based Weighed Clustering Cooperative Spectrum Sensing Method for Cognitive Sensor Networks.

Science.gov (United States)

Liu, Xin

2015-10-30

In a cognitive sensor network (CSN), the wastage of sensing time and energy is a challenge to cooperative spectrum sensing, when the number of cooperative cognitive nodes (CNs) becomes very large. In this paper, a novel wireless power transfer (WPT)-based weighed clustering cooperative spectrum sensing model is proposed, which divides all the CNs into several clusters, and then selects the most favorable CNs as the cluster heads and allows the common CNs to transfer the received radio frequency (RF) energy of the primary node (PN) to the cluster heads, in order to supply the electrical energy needed for sensing and cooperation. A joint resource optimization is formulated to maximize the spectrum access probability of the CSN, through jointly allocating sensing time and clustering number. According to the resource optimization results, a clustering algorithm is proposed. The simulation results have shown that compared to the traditional model, the cluster heads of the proposed model can achieve more transmission power and there exists optimal sensing time and clustering number to maximize the spectrum access probability.

A Novel Wireless Power Transfer-Based Weighed Clustering Cooperative Spectrum Sensing Method for Cognitive Sensor Networks

Directory of Open Access Journals (Sweden)

Xin Liu

2015-10-01

Full Text Available In a cognitive sensor network (CSN, the wastage of sensing time and energy is a challenge to cooperative spectrum sensing, when the number of cooperative cognitive nodes (CNs becomes very large. In this paper, a novel wireless power transfer (WPT-based weighed clustering cooperative spectrum sensing model is proposed, which divides all the CNs into several clusters, and then selects the most favorable CNs as the cluster heads and allows the common CNs to transfer the received radio frequency (RF energy of the primary node (PN to the cluster heads, in order to supply the electrical energy needed for sensing and cooperation. A joint resource optimization is formulated to maximize the spectrum access probability of the CSN, through jointly allocating sensing time and clustering number. According to the resource optimization results, a clustering algorithm is proposed. The simulation results have shown that compared to the traditional model, the cluster heads of the proposed model can achieve more transmission power and there exists optimal sensing time and clustering number to maximize the spectrum access probability.

Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks

Science.gov (United States)

Liu, Ming; Xu, Yang; Mohammed, Abdul-Wahid

2016-01-01

Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent’s limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent’s cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent’s view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved. PMID:26727504

Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks.

Directory of Open Access Journals (Sweden)

Ming Liu

Full Text Available Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent's limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent's cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent's view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved.

Reputation Effects in Social Networks Do Not Promote Cooperation: An Experimental Test of the Raub & Weesie Model.

Science.gov (United States)

Corten, Rense; Rosenkranz, Stephanie; Buskens, Vincent; Cook, Karen S

2016-01-01

Despite the popularity of the notion that social cohesion in the form of dense social networks promotes cooperation in Prisoner's Dilemmas through reputation, very little experimental evidence for this claim exists. We address this issue by testing hypotheses from one of the few rigorous game-theoretic models on this topic, the Raub & Weesie model, in two incentivized lab experiments. In the experiments, 156 subjects played repeated two-person PDs in groups of six. In the "atomized interactions" condition, subjects were only informed about the outcomes of their own interactions, while in the "embedded" condition, subjects were informed about the outcomes of all interactions in their group, allowing for reputation effects. The design of the experiments followed the specification of the RW model as closely as possible. For those aspects of the model that had to be modified to allow practical implementation in an experiment, we present additional analyses that show that these modifications do not affect the predictions. Contrary to expectations, we do not find that cooperation is higher in the embedded condition than in the atomized interaction. Instead, our results are consistent with an interpretation of the RW model that includes random noise, or with learning models of cooperation in networks.

Fashion, Cooperation, and Social Interactions

Science.gov (United States)

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

Energy Efficient Cooperation in Underlay RFID Cognitive Networks for a Water Smart Home

Directory of Open Access Journals (Sweden)

Adnan Nasir

2014-09-01

Full Text Available Shrinking water  resources all over the world and increasing  costs of water consumption  have prompted  water users  and distribution companies  to come up with water conserving strategies. We have proposed an energy-efficient  smart water monitoring application in [1], using low power RFIDs. In the home environment,  there exist many primary interferences within a room, such as cell-phones,  Bluetooth  devices, TV signals, cordless phones and WiFi devices.  In order to reduce the interference  from our proposed RFID network for these primary  devices, we have proposed a cooperating  underlay  RFID cognitive network for our smart application on water.  These underlay  RFIDs should strictly adhere to the interference thresholds to work in parallel with the primary wireless devices [2].  This work is an extension of our previous  ventures proposed in [2,3], and we enhanced the previous efforts by introducing  a new system model and RFIDs.  Our proposed scheme is mutually energy efficient and maximizes the signal-to-noise ratio (SNR for the RFID link, while keeping the interference levels for the primary  network below a certain threshold. A closed form expression for the probability density function (pdf of the SNR at the destination reader/writer and outage probability are derived. Analytical results are verified through simulations. It is also shown that in comparison to non-cognitive selective cooperation,  this scheme performs  better in the low SNR region for cognitive networks. Moreover, the hidden Markov model’s (HMM multi-level variant hierarchical hidden Markov model (HHMM approach is used for pattern recognition and event detection for the data received for this system [4]. Using this model, a feedback and decision algorithm is also developed.  This approach has been applied  to simulated water pressure data from RFID motes, which were embedded in metallic water pipes.

DEMONSTRATION OF PACKAGING MATERIALS ALTERNATIVES TO EXPANDED POLYSTYRENE

Science.gov (United States)

This report represents the second demonstration of cleaner technologies to support the goals of the 33/50 Program under the EPA Cooperative Agreement No. CR-821848. The report presents assessment results of alternative packaging materials which could potentially replace expanded...

[A survey of Local Physicians and Psychotherapists on Cooperation in Regional Networks for Early Child Interventions in Saxony-Anhalt].

Science.gov (United States)

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.

Cooperation Survives and Cheating Pays in a Dynamic Network Structure with Unreliable Reputation

Science.gov (United States)

Antonioni, Alberto; Sánchez, Angel; Tomassini, Marco

2016-06-01

In a networked society like ours, reputation is an indispensable tool to guide decisions about social or economic interactions with individuals otherwise unknown. Usually, information about prospective counterparts is incomplete, often being limited to an average success rate. Uncertainty on reputation is further increased by fraud, which is increasingly becoming a cause of concern. To address these issues, we have designed an experiment based on the Prisoner’s Dilemma as a model for social interactions. Participants could spend money to have their observable cooperativeness increased. We find that the aggregate cooperation level is practically unchanged, i.e., global behavior does not seem to be affected by unreliable reputations. However, at the individual level we find two distinct types of behavior, one of reliable subjects and one of cheaters, where the latter artificially fake their reputation in almost every interaction. Cheaters end up being better off than honest individuals, who not only keep their true reputation but are also more cooperative. In practice, this results in honest subjects paying the costs of fraud as cheaters earn the same as in a truthful environment. These findings point to the importance of ensuring the truthfulness of reputation for a more equitable and fair society.

Partial Cooperative Equilibria: Existence and Characterization

Directory of Open Access Journals (Sweden)

Amandine Ghintran

2010-09-01

Full Text Available We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.

Delay efficient cooperation in public safety vehicular networks using LTE and IEEE 802.11p

KAUST Repository

Atat, Rachad

2012-01-01

Cooperative schemes for critical content distribution over vehicular networks are presented and analyzed. The first scheme is based on unicasting from the base station, whereas the second is based on threshold based multicasting. Long Term Evolution (LTE) is used for long range communications with the base station (BS) and 802.11p is considered for inter-vehicle collaboration on the short range. A high mobility environment with correlated shadowing is adopted. Both schemes are shown to outperform non-cooperative unicasting and multicasting, respectively, when the appropriate 802.11p power class is used. The first scheme achieves the best performance among the compared methods, and a practical approximation of that scheme is shown to be close to optimal performance. © 2012 IEEE.

South-South Cooperation. The Primafamed network as an example in creating a network between universities in Sub-Saharan Africa

DEFF Research Database (Denmark)

Flinkenflögel, Maaike; Kallestrup, Per

2013-01-01

of these efforts are equally necessary to provide innovation and documentation to sustain the continuous recruitment of political support, funding and human resources in this quest to construct adequate health services. Examples of already established collaborations within an existing network and the various...... in African universities synergies can be established and training programs can get stronger with good quality assurance. With South-South cooperation the partners share experiences and resources and therefore improve the development of the training. Research into the effects on health and civil society...

Wireless Power Transfer in Cooperative DF Relaying Networks with Log-Normal Fading

KAUST Repository

Rabie, Khaled M.; Adebisi, Bamidele; Alouini, Mohamed-Slim

2017-01-01

Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels which represents outdoor environments. Unlike these studies, in this paper we analyze the performance of wireless power transfer in two-hop decode-and- forward (DF) cooperative relaying systems in indoor channels characterized by log-normal fading. Three well-known EH protocols are considered in our evaluations: a) time switching relaying (TSR), b) power splitting relaying (PSR) and c) ideal relaying receiver (IRR). The performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions for the three systems under consideration. Results reveal that careful selection of the EH time and power splitting factors in the TSR- and PSR-based system are important to optimize performance. It is also presented that the optimized PSR system has near- ideal performance and that increasing the source transmit power and/or the energy harvester efficiency can further improve performance.

Wireless Power Transfer in Cooperative DF Relaying Networks with Log-Normal Fading

KAUST Repository

Rabie, Khaled M.

2017-02-07

Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels which represents outdoor environments. Unlike these studies, in this paper we analyze the performance of wireless power transfer in two-hop decode-and- forward (DF) cooperative relaying systems in indoor channels characterized by log-normal fading. Three well-known EH protocols are considered in our evaluations: a) time switching relaying (TSR), b) power splitting relaying (PSR) and c) ideal relaying receiver (IRR). The performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions for the three systems under consideration. Results reveal that careful selection of the EH time and power splitting factors in the TSR- and PSR-based system are important to optimize performance. It is also presented that the optimized PSR system has near- ideal performance and that increasing the source transmit power and/or the energy harvester efficiency can further improve performance.

Cooperative automated driving for various traffic scenarios : experimental validation in the GCDC 2016

NARCIS (Netherlands)

Dolk, Victor; Ouden, Jos Den; Steeghs, Sander; Devanesan, Jason Gideon; Badshah, Irfan; Sudhakaran, Adityen; Elferink, Koos; Chakraborty, Debayan

2018-01-01

Cooperative automated driving is a promising technology to improve road safety, fuel consumption, and traffic throughput without the need to expand the current infrastructure. To accelerate the developments in cooperative driving toward deployment in realistic traffic, the second grand cooperative

Relational Diversity Promotes Cooperation in Prisoner’s Dilemma Games

Science.gov (United States)

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

Transparency in Cooperative Online Education

Science.gov (United States)

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

Managing Co-operative Business Networks for Service Co-Creation in Rural Denmark

DEFF Research Database (Denmark)

Gretzinger, Susanne; Leick, Birgit

.8 % of Denmark´s total exports in 2013 (DAMVAD, 2014). While the production of windmills is concentrated on large companies, the assembly, maintenance and service of the windmill parks is dominated by SMEs. Many firms in the Danish wind energy or wind turbine industry are organized in cooperating networks...... ). In the future, the surplus per windmill is expected to only slightly rise compared to total energy output that will rise tremendously owing to an increase in the number of windmills per windmill farm (DAMVAD, 2014). Increasing the number of windmills per farm will increase the demand of service and maintenance...

Optimizing the Number of Cooperating Terminals for Energy Aware Task Computing in Wireless Networks

DEFF Research Database (Denmark)

Olsen, Anders Brødløs; Fitzek, Frank H. P.; Koch, Peter

2005-01-01

It is generally accepted that energy consumption is a significant design constraint for mobile handheld systems, therefore motivations for methods optimizing the energy consumption making better use of the restricted battery resources are evident. A novel concept of distributed task computing...... is previously proposed (D2VS), where the overall idea of selective distribution of tasks among terminals is made. In this paper the optimal number of terminals for cooperative task computing in a wireless network will be investigated. The paper presents an energy model for the proposed scheme. Energy...... consumption of the terminals with respect to their workload and the overhead of distributing tasks among terminals are taken into account. The paper shows, that the number of cooperating terminals is in general limited to a few, though alternating with respect to the various system parameters....

Development and Operation of International Nuclear Education/Training Program and HRD Cooperation Network

International Nuclear Information System (INIS)

Lee, E. J.; Min, B. J.; Han, K. W.

2006-12-01

The primary result of the project is the establishment of a concept of International Nuclear R and D Academy that integrates the on-going long term activity for international nuclear education/training and a new activity to establish an international cooperation network for nuclear human resources development. For this, the 2007 WNU Summer Institute was hosted with the establishment of an MOU and subsequent preparations. Also, ANENT was promoted through development of a cyber platform for the ANENT web-portal, hosting the third ANENT Coordination Committee meeting, etc. Then a cooperation with universities in Vietnam was launched resulting in preparation of an MOU for the cooperation. Finally, a relevant system framework was established and required procedures were drafted especially for providing students from developing countries with long term education/training programs (e.g. MS and Ph D. courses). The international nuclear education/training programs have offered 13 courses to 182 people from 43 countries. The overall performance of the courses was evaluated to be outstanding. In parallel, the establishment of an MOU for the cooperation of KOICA-IAEA-KAERI courses to ensure their stable and systematic operation. Also, an effort was made to participate in FNCA. Atopia Hall of the International Nuclear Training and Education Center (INTEC) hosted 477 events (corresponding to 18,521 participants) and Nuri Hall (guesthouse) accommodated 4,616 people in 2006. This shows a steady increase of the use rate since the opening of the center, along with a continuous improvement of the equipment

Development and Operation of International Nuclear Education/Training Program and HRD Cooperation Network

Energy Technology Data Exchange (ETDEWEB)

Lee, E J; Min, B J; Han, K W [and others

2006-12-15

The primary result of the project is the establishment of a concept of International Nuclear R and D Academy that integrates the on-going long term activity for international nuclear education/training and a new activity to establish an international cooperation network for nuclear human resources development. For this, the 2007 WNU Summer Institute was hosted with the establishment of an MOU and subsequent preparations. Also, ANENT was promoted through development of a cyber platform for the ANENT web-portal, hosting the third ANENT Coordination Committee meeting, etc. Then a cooperation with universities in Vietnam was launched resulting in preparation of an MOU for the cooperation. Finally, a relevant system framework was established and required procedures were drafted especially for providing students from developing countries with long term education/training programs (e.g. MS and Ph D. courses). The international nuclear education/training programs have offered 13 courses to 182 people from 43 countries. The overall performance of the courses was evaluated to be outstanding. In parallel, the establishment of an MOU for the cooperation of KOICA-IAEA-KAERI courses to ensure their stable and systematic operation. Also, an effort was made to participate in FNCA. Atopia Hall of the International Nuclear Training and Education Center (INTEC) hosted 477 events (corresponding to 18,521 participants) and Nuri Hall (guesthouse) accommodated 4,616 people in 2006. This shows a steady increase of the use rate since the opening of the center, along with a continuous improvement of the equipment.

The evolution of cooperation in spatial groups

International Nuclear Information System (INIS)

Zhang Jianlei; Zhang Chunyan; Chu Tianguang

2011-01-01

Research highlights: → We propose a model of evolutionary games in which individuals are organized into networked groups. → We show that the social dilemma can be resolved and high cooperation levels are attained. → Larger average group size would lead to lower cooperation level but higher average payoffs. → The results show that higher expectations can bring the system with larger average payoffs. - Abstract: Much of human cooperation remains an evolutionary riddle. There is evidence that individuals are often organized into groups in many social situations. Inspired by this observation, we propose a simple model of evolutionary public goods games in which individuals are organized into networked groups. Here, nodes in the network represent groups; the edges, connecting the nodes, refer to the interactions between the groups. Individuals establish public goods games with partners in the same group and migrate among neighboring groups depending on their payoffs and expectations. We show that the paradigmatic public goods social dilemma can be resolved and high cooperation levels are attained in structured groups, even in relatively harsh conditions for cooperation. Further, by means of numerical simulations and mean-field analysis, we arrive at the result: larger average group size and milder cooperation environment would lead to lower cooperation level but higher average payoffs of the entire population. Altogether, these results emphasize that our understanding of cooperation can be enhanced by investigations of how spatial groups of individuals affect the evolution dynamics, which might help in explaining the emergence and evolution of cooperation.

International Business : cooperation within networks

NARCIS (Netherlands)

Anne van Delft

2011-01-01

Internationalisation is the expansion of a firms operations to foreign markets and includes not only import and export but also foreign direct investments and international cooperation. Today’s globalising economy has resulted in a growing number of small and medium enterprises (SMEs) undertaking

[Clinical research activity of the French cancer cooperative network: Overview and perspectives].

Science.gov (United States)

Dubois, Claire; Morin, Franck; Moro-Sibilot, Denis; Langlais, Alexandra; Seitz, Jean-François; Girault, Cécile; Salles, Gilles; Haioun, Corinne; Deschaseaux, Pascal; Casassus, Philippe; Mathiot, Claire; Pujade-Lauraine, Éric; Votan, Bénédicte; Louvet, Christophe; Delpeut, Christine; Bardet, Étienne; Vintonenko, Nadejda; Hoang Xuan, Khê; Vo, Maryline; Michon, Jean; Milleron, Bernard

The French Cancer Plan 2014-2019 stresses the importance of strengthening collaboration between all stakeholders involved in the fight against cancer, including cancer cooperative groups and intergroups. This survey aimed to describe the basics characteristics and clinical research activity among the Cancer Cooperative Groups (Groupes coopérateurs en oncologie). The second objective was to identify facilitators and barriers to their research activity. A questionnaire was sent to all the clinicians involved in 2014 as investigators in a clinical trial sponsored by one of the ten members of the Cancer Cooperative Groups network. The questions were related to their profile, research activity and the infrastructure existing within their healthcare center to support clinical research and related compliance activities. In total, 366 investigators responded to our survey. The academic clinical trials sponsored by the Cancer Cooperative Groups represented an important part of the research activity of the investigators in France in 2014. These academic groups contributed to the opening of many research sites throughout all regions in France. Factors associated with a higher participation of investigators (more than 10 patients enrolled in a trial over a year) include the existing support of healthcare professionals (more than 2 clinical research associate (CRA) OR=11.16 [3.82-32.6] compared to none) and the practice of their research activity in a University Hospital Center (CHU) rather than a Hospital Center (CH) (OR=2.15 [1.20-3.83]). This study highlighted factors that can strengthen investigator clinical research activities and subsequently improve patient access to evidence-based new cancer therapies in France. Copyright © 2017 Société Française du Cancer. Published by Elsevier Masson SAS. All rights reserved.

[Research on collaborative innovation in traditional Chinese medicine of China based on patent cooperation network].

Science.gov (United States)

Li, Bei; Chen, Xiang-dong

2015-03-01

In the situation of global completion, collaborative innovation is becoming increasingly important because its advantage in risk avoiding and innovation efficiency. In order to explore the model of collaborative innovation and its evolution in traditional Chinese medicine of China, the cooperation in traditional Chinese medicine patents of China from 1985 to 2013 has been analyzed by using the method of scientometrics and social network analysis. It is proved that, though the number of grated cooperative patents has increased sharply during the last thirty years, the degree of cooperation innovation in traditional Chinese medicine of China is still not high. Moreover, in spite of the individual subject' s leading role in the past domestic collaborative innovation in traditional Chinese medicine of China, the institutions have been more and more powerful and achieved great improvement. At last, core institutions, represented by universities have played an important role in the collaborative innovation of domestic institutions, because they are key links between many institutions and promote the transferring and diffusion of knowledge.

Performance Analysis of Secondary Link with Cross-Layer Design and Cooperative Relay in Cognitive Radio Networks

KAUST Repository

Ma, Hao

2012-06-01

In this thesis, we investigate two different system infrastructures in underlay cognitive radio network, in which two popular techniques, cross-layer design and cooperative communication, are considered, respectively. In particular, we introduce the Aggressive Adaptive Modulation and Coding (A-AMC) into the cross-layer design and achieve the optimal boundary points in closed form to choose the AMC and A-AMC transmission modes by taking into account the Channel State Information (CSI) from the secondary transmitter to both the primary receiver and the secondary receiver. What’s more, for the cooperative communication design, we consider three different relay selection schemes: Partial Relay Selection, Opportunistic Relay Selection and Threshold Relay Selection. The Probability Density Functions (PDFs) of the Signal-to- Noise Ratio (SNR) in each hop for different selection schemes are provided, and then the exact closed-form expressions for the end-to-end packet loss rate in the secondary link considering the cooperation of the Decode-and-Forward (DF) relay for different relay selection schemes are derived.

States, Social Capital and Cooperation

DEFF Research Database (Denmark)

Anthony, Denise L.; Campbell, John L.

2011-01-01

This paper reflects on Elinor Ostrom’s classic book, Governing the Commons, and much work in sociology, political science and organization studies that has appeared since its publication. We do so in order to expand our understanding of the conditions under which cooperation occurs resulting...... in the production of collective goods. We explore two issues that were underdeveloped in her book that have subsequently received much attention. First, we discuss how states can facilitate cooperative behavior short of coercively imposing it on actors. Second, we discuss how social capital can facilitate...... or undermine cooperative behavior. In both cases we focus on the important mechanisms by which each one contributes to the development of cooperative behavior and collective goods. We conclude by extending our arguments to a brief analysis of one of the world’s newest and largest collective goods...

Analysis and Construction of Full-Diversity Joint Network-LDPC Codes for Cooperative Communications

Directory of Open Access Journals (Sweden)

Capirone Daniele

2010-01-01

Full Text Available Transmit diversity is necessary in harsh environments to reduce the required transmit power for achieving a given error performance at a certain transmission rate. In networks, cooperative communication is a well-known technique to yield transmit diversity and network coding can increase the spectral efficiency. These two techniques can be combined to achieve a double diversity order for a maximum coding rate on the Multiple-Access Relay Channel (MARC, where two sources share a common relay in their transmission to the destination. However, codes have to be carefully designed to obtain the intrinsic diversity offered by the MARC. This paper presents the principles to design a family of full-diversity LDPC codes with maximum rate. Simulation of the word error rate performance of the new proposed family of LDPC codes for the MARC confirms the full diversity.

Exploring Relay Cooperation for Secure and Reliable Transmission in Two-HopWireless Networks

Directory of Open Access Journals (Sweden)

Yulong Shen

2014-03-01

Full Text Available This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact result on the number of eavesdroppers one network can tolerate to ensure desired secrecy and reliability. We first study the scenario where path-loss is equal between all pairs of nodes and consider two transmission protocols there, one adopts an optimal but complex relay selection process with less load balance capacity while the other adopts a random but simple relay selection process with good load balance capacity. Theoretical analysis and numerical results are then provided to determine the maximum number of eavesdroppers one network can tolerate to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability. We further extend our study to the more general scenario where path-loss between each pair of nodes also depends on the distance between them, for which a new transmission protocol with both preferable relay selection and good load balance as well as the corresponding theoretical analysis and numerical results are presented.

Intrusion-Aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Young-Jae Song

2009-07-01

Full Text Available Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.

Cooperative Monitoring Center Occasional Paper/8: Cooperative Border Security for Jordan: Assessment and Options

Energy Technology Data Exchange (ETDEWEB)

Qojas, M.

1999-03-01

This document is an analysis of options for unilateral and cooperative action to improve the security of Jordan's borders. Sections describe the current political, economic, and social interactions along Jordan's borders. Next, the document discusses border security strategy for cooperation among neighboring countries and the adoption of confidence-building measures. A practical cooperative monitoring system would consist of hardware for early warning, command and control, communications, and transportation. Technical solutions can expand opportunities for the detection and identification of intruders. Sensors (such as seismic, break-wire, pressure-sensing, etc.) can warn border security forces of intrusion and contribute to the identification of the intrusion and help formulate the response. This document describes conceptual options for cooperation, offering three scenarios that relate to three hypothetical levels (low, medium, and high) of cooperation. Potential cooperative efforts under a low cooperation scenario could include information exchanges on military equipment and schedules to prevent misunderstandings and the establishment of protocols for handling emergency situations or unusual circumstances. Measures under a medium cooperation scenario could include establishing joint monitoring groups for better communications, with hot lines and scheduled meetings. The high cooperation scenario describes coordinated responses, joint border patrols, and sharing border intrusion information. Finally, the document lists recommendations for organizational, technical, and operational initiatives that could be applicable to the current situation.

Game Theoretic Analysis of Cooperative Message Forwarding in Opportunistic Mobile Networks.

Science.gov (United States)

Pal, Sujata; Saha, Barun Kumar; Misra, Sudip

2017-12-01

In cooperative communication, a set of players forming a coalition ensures communal behavior among themselves by helping one another in message forwarding. Opportunistic mobile networks (OMNs) require multihop communications for transferring messages from the source to the destination nodes. However, noncooperative nodes only forward their own messages to others, and drop others' messages upon receiving them. So, the message delivery overhead increases in OMN. For minimizing the overhead and maximizing the delivery rate, we propose two coalition-based cooperative schemes: 1) simple coalition formation (SCF) and 2) overlapping coalition formation (OCF) game. In SCF, we consider the presence of a central information center, whereas OCF is a fully distributed scheme. In SCF, coalitions are disjoint, whereas in OCF, a node may be the member of multiple coalitions at the same time. All nodes in a coalition help each other cooperatively by forwarding group messages to the intermediate or destination nodes. The goal of the nodes is to achieve high success rate in delivering messages. The proposed SCF scheme is cohesive, in which disjoint coalitions always combine to form grand coalition. In OCF, a node reaches a stable grand coalition when all the nodes of the OMN are members of overlapping coalition of the node. No node gains by deviating from the grand coalition in SCF and OCF. Simulation results based on synthetic mobility model and real-life traces show that the message delivery ratio of OMNs increase by up to 67%, as compared to the noncooperative scenario. Moreover, the message overhead ratio using the proposed coalition-based schemes reduces by up to about (1/3)rd of that of the noncooperative communication scheme.

Biham—Middleton—Levine model in consideration of cooperative willingness

International Nuclear Information System (INIS)

Pan Wei; Xue Yu; Zhao Rui; Lu Wei-Zhen

2014-01-01

In this paper, the Biham—Middleton—Levine (BML) model with consideration of cooperative willingness has been proposed to study the traffic flow in urban networks. An evolutionary game with a cooperative willingness profile is introduced to deal with conflicts between disturbing neighbors. Simulation results suggest that imitating cooperative willingness can ease the effect of premature seizure on traffic flow due to the introduction of evolutionary games. Phase diagrams with a strategy profile and cooperative willingness profile have been investigated in detail. Our findings also prove that by imitating the more successful, cooperative willingness instead of simply the more successful strategies, the evolution of cooperation is significantly promoted, hence improving the order of cooperation and relieving the pressure of traffic networks. (interdisciplinary physics and related areas of science and technology)

A Novel Two-Tier Cooperative Caching Mechanism for the Optimization of Multi-Attribute Periodic Queries in Wireless Sensor Networks

Science.gov (United States)

Zhou, ZhangBing; Zhao, Deng; Shu, Lei; Tsang, Kim-Fung

2015-01-01

Wireless sensor networks, serving as an important interface between physical environments and computational systems, have been used extensively for supporting domain applications, where multiple-attribute sensory data are queried from the network continuously and periodically. Usually, certain sensory data may not vary significantly within a certain time duration for certain applications. In this setting, sensory data gathered at a certain time slot can be used for answering concurrent queries and may be reused for answering the forthcoming queries when the variation of these data is within a certain threshold. To address this challenge, a popularity-based cooperative caching mechanism is proposed in this article, where the popularity of sensory data is calculated according to the queries issued in recent time slots. This popularity reflects the possibility that sensory data are interested in the forthcoming queries. Generally, sensory data with the highest popularity are cached at the sink node, while sensory data that may not be interested in the forthcoming queries are cached in the head nodes of divided grid cells. Leveraging these cooperatively cached sensory data, queries are answered through composing these two-tier cached data. Experimental evaluation shows that this approach can reduce the network communication cost significantly and increase the network capability. PMID:26131665

Cooperative decoding in femtocell networks: Performance-complexity tradeoff

KAUST Repository

Benkhelifa, Fatma

2012-06-01

Femtocells, which are low cost low power, stand alone cellular access points, are a potential solution to provide good indoor coverage with high data rate. However, the femtocell deployment may also increase the co-channel interference (CCI) by reducing the distance reuse of the spectrum. In this paper, we introduce methods to cancel out the interference among the femtocells while considering that macrocells operate orthogonally to the femtocells. The femtocells may also cooperate through joint detection of the received signal and improve the overall error performance at the expense of an increased computational complexity. In this paper, the performance-complexity tradeoff of cooperative detection is investigated for uplink transmissions. Numerical results show that the cooperative detection gain may reach 10 dB at a Bit-Error Rate (BER) of 10 -2 when compared to the case without cooperation. © 2012 IEEE.

Cooperative decoding in femtocell networks: Performance-complexity tradeoff

KAUST Repository

Benkhelifa, Fatma; Rezki, Zouheir; Alouini, Mohamed-Slim

2012-01-01

Femtocells, which are low cost low power, stand alone cellular access points, are a potential solution to provide good indoor coverage with high data rate. However, the femtocell deployment may also increase the co-channel interference (CCI) by reducing the distance reuse of the spectrum. In this paper, we introduce methods to cancel out the interference among the femtocells while considering that macrocells operate orthogonally to the femtocells. The femtocells may also cooperate through joint detection of the received signal and improve the overall error performance at the expense of an increased computational complexity. In this paper, the performance-complexity tradeoff of cooperative detection is investigated for uplink transmissions. Numerical results show that the cooperative detection gain may reach 10 dB at a Bit-Error Rate (BER) of 10 -2 when compared to the case without cooperation. © 2012 IEEE.

Event-triggered cooperative target tracking in wireless sensor networks

Directory of Open Access Journals (Sweden)

Lu Kelin

2016-10-01

Full Text Available Since the issues of low communication bandwidth supply and limited battery capacity are very crucial for wireless sensor networks, this paper focuses on the problem of event-triggered cooperative target tracking based on set-membership information filtering. We study some fundamental properties of the set-membership information filter with multiple sensor measurements. First, a sufficient condition is derived for the set-membership information filter, under which the boundedness of the outer ellipsoidal approximation set of the estimation means is guaranteed. Second, the equivalence property between the parallel and sequential versions of the set-membership information filter is presented. Finally, the results are applied to a 1D event-triggered target tracking scenario in which the negative information is exploited in the sense that the measurements that do not satisfy the triggering conditions are modelled as set-membership measurements. The tracking performance of the proposed method is validated with extensive Monte Carlo simulations.

Cooperating to learn teaching to cooperate: adviser processes for program implement CA/AC

Directory of Open Access Journals (Sweden)

José Ramón LAGO

2011-11-01

Full Text Available The aim of this paper is present some results of advise strategy to introduce cooperative learning from the «Cooperating to Learn/ Learning to Cooperate» CL/LC Programme. The first part situates the research project and the research objective focused on how introduction of CL/LC program through a process of advice facilitates permanent improvements to the inclusion of students. In the second we analyzed the phases and tasks of an adviser process for the introduction of cooperative learning and three stages to build on cooperative learning in school: the introduction, generalization and consolidation. The third part is the central part. We describe five process of adviser to implement cooperative learning which we can observe different degrees and modalities of collaboration between teachers and counselors and between teachers. Is possible the first step of a network centers to work cooperatively.

The Continuing Growth of Global Cooperation Networks in Research: A Conundrum for National Governments.

Directory of Open Access Journals (Sweden)

Caroline S Wagner

Full Text Available Global collaboration continues to grow as a share of all scientific cooperation, measured as coauthorships of peer-reviewed, published papers. The percent of all scientific papers that are internationally coauthored has more than doubled in 20 years, and they account for all the growth in output among the scientifically advanced countries. Emerging countries, particularly China, have increased their participation in global science, in part by doubling their spending on R&D; they are increasingly likely to appear as partners on internationally coauthored scientific papers. Given the growth of connections at the international level, it is helpful to examine the phenomenon as a communications network and to consider the network as a new organization on the world stage that adds to and complements national systems. When examined as interconnections across the globe over two decades, a global network has grown denser but not more clustered, meaning there are many more connections but they are not grouping into exclusive 'cliques'. This suggests that power relationships are not reproducing those of the political system. The network has features an open system, attracting productive scientists to participate in international projects. National governments could gain efficiencies and influence by developing policies and strategies designed to maximize network benefits-a model different from those designed for national systems.

Link prediction based on nonequilibrium cooperation effect

Science.gov (United States)

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.

Intelligent Cooperative MAC Protocol for Balancing Energy Consumption

Science.gov (United States)

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.

GWDC Expands High-End Market Share

Institute of Scientific and Technical Information of China (English)

无

2008-01-01

@@ It is a decision of great significance for GWDC to expand high-end market share in order to realize its transformation of development strategy and improve its development quality. As an important step of GWDC to explore high-end market, Oman PDO Project marks the first time that the Chinese petroleum engineering service team cooperates with the transnational petroleum corporations ranking first three in the world.

European Competence Network on Mastocytosis (ECNM): 10-year jubilee, update, and future perspectives.

Science.gov (United States)

Valent, Peter; Arock, Michel; Bonadonna, Patrizia; Brockow, Knut; Broesby-Olsen, Sigurd; Escribano, Luis; Gleixner, Karoline V; Grattan, Clive; Hadzijusufovic, Emir; Hägglund, Hans; Hermine, Olivier; Horny, Hans-Peter; Kluin-Nelemans, Hanneke C; Maurer, Marcus; Niedoszytko, Marek; Nedoszytko, Boguslaw; Nilsson, Gunnar; Oude-Elberink, Hanneke N G; Orfao, Alberto; Radia, Deepti; Reiter, Andreas; Siebenhaar, Frank; Sotlar, Karl; Sperr, Wolfgang R; Triggiani, Massimo; VanDoormaal, Jaap J; Várkonyi, Judit; Yavuz, Selim; Hartmann, Karin

2012-12-01

The European Competence Network on Mastocytosis (ECNM) was initiated in 2002 as a multidisciplinary and multinational cooperative approach to increase awareness and to improve diagnosis and therapy of mastocytosis. The network is composed of local centers, physicians, and scientists who have dedicated their work to patients with mastocytosis. A strategic goal of the ECNM is to provide the best available information about the disease to patients and physicians. During the past 10 years, the ECNM has expanded to various countries and contributed successfully to the development of markers, definitions, and standards in the field of mastocytosis. Members of the ECNM organized Annual Meetings in Europe and two Working Conferences on Mastocytosis in Vienna (in 2005 and 2010), and initiated and supported several preclinical and clinical trials. In all these activities, representatives of the ECNM cooperate closely with their US colleagues, with patient-organizations in Europe and in the USA, and with other scientific networks. The ECNM also launched a mastocytosis registry that has been activated in 2012. Using the central database of this registry, cooperative multicenter studies, which should include sufficient numbers of patients and robust evaluations, will be conducted. These studies will increase our knowledge about optimal management and therapy of patients with mastocytosis in the future.

Fairness-Aware Energy-Efficient Resource Allocation for AF Co-Operative OFDMA Networks

KAUST Repository

Bedeer, Ebrahim

2015-09-23

In this paper, we adopt an energy-efficiency (EE) metric, named worst-EE, that is suitable for EE fairness optimization in the uplink transmission of amplify-and-forward (AF) cooperative orthogonal frequency division multiple access (OFDMA) networks. More specifically, we assign subcarriers and allocate powers for mobile and relay stations in order to maximize the worst-EE, i.e., to maximize the EE of the mobile station (MS) with the lowest EE value, subject to MSs transmit power, relay station (RS) transmit power, and MSs quality-of-service (QoS) constraints. The formulated primal max-min optimization problem is nonconvex fractional mixed integer nonlinear program, i.e., NP-hard to solve. We provide a novel optimization framework that studies the structure of the primal problem and prove that the dual min-max optimization problem attains the same optimal solution of the primal problem. Additionally, we propose a modified Dinkelbach algorithm, named dual Dinkelbach, to achieve the optimal solution of the dual problem in a polynomial time complexity. We further exploit the structure of the obtained optimal solution and develop a low complexity suboptimal heuristic. Numerical results show the effectiveness of the proposed algorithm to improve the network performance in terms of fairness between MSs, worst-EE, and average network transmission rate when compared to traditional schemes that maximize the EE of the whole network. Presented results also show that the suboptimal heuristic balances the achieved performance and the computational complexity.

Fairness-Aware Energy-Efficient Resource Allocation for AF Co-Operative OFDMA Networks

KAUST Repository

Bedeer, Ebrahim; Alorainy, Abdulaziz; Hossain, Md. Jahangir; Amin, Osama; Alouini, Mohamed-Slim

2015-01-01

In this paper, we adopt an energy-efficiency (EE) metric, named worst-EE, that is suitable for EE fairness optimization in the uplink transmission of amplify-and-forward (AF) cooperative orthogonal frequency division multiple access (OFDMA) networks. More specifically, we assign subcarriers and allocate powers for mobile and relay stations in order to maximize the worst-EE, i.e., to maximize the EE of the mobile station (MS) with the lowest EE value, subject to MSs transmit power, relay station (RS) transmit power, and MSs quality-of-service (QoS) constraints. The formulated primal max-min optimization problem is nonconvex fractional mixed integer nonlinear program, i.e., NP-hard to solve. We provide a novel optimization framework that studies the structure of the primal problem and prove that the dual min-max optimization problem attains the same optimal solution of the primal problem. Additionally, we propose a modified Dinkelbach algorithm, named dual Dinkelbach, to achieve the optimal solution of the dual problem in a polynomial time complexity. We further exploit the structure of the obtained optimal solution and develop a low complexity suboptimal heuristic. Numerical results show the effectiveness of the proposed algorithm to improve the network performance in terms of fairness between MSs, worst-EE, and average network transmission rate when compared to traditional schemes that maximize the EE of the whole network. Presented results also show that the suboptimal heuristic balances the achieved performance and the computational complexity.

Transnational Research Co-operation: Opportunities and Challenges for transnational research co-operation

DEFF Research Database (Denmark)

of the NGOs have a lot of international experience (mainly in Denmark and Germany) as partners in different co-operation projects. Almost all the NGOs have recognized the important role of the scientific information in their activity. NGOs also feel the need for an easy access to required information...... for transnational co-operation like: an investigation/project concerning the driving forces behind urban development,or a co-operation in the field of wastewater reuse and minimization of wastewater loads and discharge, or a service page (internet) to search for potential partners. The governmental institutions...... in order to improve transnational cooperation are identified to be: • Search for national/international project partners • Access to existent co-operation projects or networks • Develop in common project proposals on themes requested by community groups • Exchange information/good operational practices...

Five Rules for the Evolution of Cooperation

Science.gov (United States)

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.