In wireless ad hoc sensor networks, cooperation of nodes provides sensors with a broader range of information, often leading to an improvement in network’s ability to meet its global objectives. However, increased communication caused by cooperation leads to a cost-quality tradeoff in the network operation. We model the cooperation based on the range of its information sharing. In h-cooperation...

It is well known that cooperation between users in a communication network can lead to significant performance gains. A common assumption in past works is that all the users are aware of the resources available for cooperation, and know exactly to what extent these resources can be used. In this work a family of models is suggested where the cooperation links may or may not be present. Coding s...

This paper presents, a spectrum sharing strategy in cooperative cognitive radio network (CCRN). A multi-phase cooperation architecture is explained and studied with cooperation partner selection and spectrum sharing among secondary users (SUs).The data of primary users (PUs) forwarded to the cooperation partners who are selected from SUs, and then acquire the spectrum access opportunities for t...

The paper proposes a XOR-based network coded cooperation protocol for the uplink transmission of relay assisted cellular networks and an algorithm for selection and assignment of the relay nodes. The performances of the cooperation protocol are expressed in terms of network decoder outage probability and Block Error Rate of the cooperating users. These performance indicators are analyzed theore...

Architectures consisting of multiple cache servers are a popular solution to deal with performance and network resource utilization issues related to the growth of the Web request. Cache cooperation is often carried out through purely hierarchical and flat schemes that suffer from scalability problems when the number of servers increases. We propose, implement and compare the performance of thr...

The open literature contains numerous studies of capacity bounds for an N-node wireless ad-hoc network but the number of cooperating nodes has generally been limited to two. In this paper, we present a simple time-share lower bound for such a network, but with two or more cooperating nodes. These results are then compared against our previous information theoretic upper bounds with hop-by-hop r...

In this study we analyze the effect of working memory capacity on the evolution of cooperation and show a case in which societies with strongly limited memory achieve higher levels of cooperation than societies with larger memory. Agents in our evolutionary model are arranged on a network and interact in a prisoner's dilemma with their neighbors. They learn from their own experience and that of...

This letter presents a variant of cloud radio access network (C-RAN) architecture, which we term partly wireless C-RAN (PW-CRAN). It is characterized by extra radio nodes connected through the existing remote radio heads (RRHs). Because of the newly connected nodes and the consequent additional delay, the operation of PW-CRAN requires different approaches compared to that of the typical C-RAN. ...

This paper investigates a new class of linear multi-agent network systems, in which nodes are coupled by dynamic edges in the sense that each edge has a dynamic system attached as well. The outputs of the edge dynamic systems form the external inputs of the node dynamic systems, which are termed “neighboring inputs” representing the coupling actions between nodes. The outputs of the node dynami...

forest management as one of the important source of production is crucial and critical. in taking over the forest resources as one of the most important of natural resources in the world, it is essential to consider local stakeholders to implement forest action plan for forest co-management. therefore, this study aims at achieving to proper management of forests based on evaluating the stakehol...