Sharif Digital Repository

This paper studies the energy-limited performance of multi-relay networks. Taking the properties of the power amplifiers (PAs) into account, we derive closed-form expressions for the optimal power allocation, the outage probability and the throughput in the cases with a sum consumed energy constraint. Moreover, we analyze the diversity and the multiplexing gains of the PA-aware systems. Finally, we investigate the performance of large-scale multi-relay networks and develop efficient multi-relay systems with low cooperation overhead. The numerical and the analytical results show that the inefficiency of the PAs affects the outage probability and the throughput of the multi-relay systems... 

In this paper, we propose a novel cognitive cooperative relaying scheme using multi-carrier transmission in which cognitive users assist primary users by relaying their information using Decode and Forward (DF) strategy. The best cognitive user is selected as a relay for a Primary User (PU). Outage probability of the PU is investigated. Our analyses show substantial improvements in the outage probability of the PU when using the proposed cooperative scheme compared to non-cooperative one. We also perform several simulations to corroborate our theoretical results  

We propose a novel cooperative transmission scheme called Convolutional Network-Coded Cooperation (CNCC) for a network including N sources, one M-antenna relay, and one common destination. The source-relay (S-R) channels are assumed to be Nakagami-m fading, while the source-destination (S-D) and the relay-destination (R-D) channels are considered Rayleigh fading. The CNCC scheme exploits the generator matrix of a good (N + M', N,v) systematic convolutional code, with the free distance of dfree designed over GF(2), as the network coding matrix which is run by the network's nodes, such that the systematic symbols are directly transmitted from the sources, and the parity symbols are sent by the... 

Background. Although the relationship between collective efficacy and group performance has been frequently investigated, a few studies have investigated the development of collective efficacy. Aim. This paper proposes some determinants of collective efficacy in small university groups. Group level hypotheses and research questions relating collective efficacy to collective cognition activities, task interdependence, self-efficacy for group work, and collective orientation were posited. Sample. The sample comprised 145 university students in 40 work-groups. Method. A two-phase longitudinal design was employed in the context of university student groups. All groups were required to perform... 

A pragmatic distributed algorithm (PDA) is proposed for supporting the ef-cient spectral access of multiple Primary Users (PUs) and Cognitive Users (CUs) in cooperative Cognitive Radio (CR) networks. The CUs may serve as relay nodes for relaying the signal received from the PUs to their destinations, while both the PUs' and the CUs' minimum rate requirements are satis-ed. The key idea of our PDA is that the PUs negotiate with the CUs concerning the speci-c amount of relaying and transmission time, whilst reducing the required transmission power or increasing the transmission rate of the PU. Our results show that the cooperative spectral access based on our PDA reaches an equilibrium, when it... 

We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interferencelimited communications considered in prior works, we propose active cooperative relaying-based schemes. We consider a network with nl legitimate nodes, ne eavesdroppers, and path loss exponent α ≥ 2. As long as n2e (log(ne))γ = o(nl ), for some positive γ , we show that one can obtain unbounded secure aggregate rate. This means zero-cost secure communication, given fixed total power constraint for the entire network. We achieve this result through: 1) the source using Wyner randomized encoder and a serial (multi-stage) block Markov scheme, to cooperate with the relays and 2) the... 

Cooperative relaying is utilized as an efficient method for data communication in wireless sensor networks and the Internet of Things. However, sometimes due to the necessity of multi-hop relaying in such communication networks, it is challenging to guarantee the secrecy of cooperative transmissions when the relays may themselves be eavesdroppers, i.e., we may face with the untrusted relaying scenario where the relays are both necessary helpers and potential adversary. To obviate this issue, a new cooperative jamming scheme is proposed in this paper, in which the data can be confidentially communicated from the source to the destination through multiple untrusted relays. In our proposed... 

Securing communication against non-colluding passive eavesdroppers has been extensively studied. Colluding eavesdroppers were considered for interference-limited large networks. However, collusion was not investigated for large cooperative networks. This paper closes this gap: we study the improvement the eavesdroppers achieve due to collusion in terms of the information leakage rate in a large cooperative network. We consider a dense network with nl legitimate nodes, ne eavesdroppers, and path loss exponent α ≥ 2. We show that if ne (2+2/α) (log ne)γ = o(n l) holds, for some positive γ, then zero-cost secure communication is possible; i.e., ne colluding eavesdroppers can be tolerated. This... 

In this paper, we propose and study a context-aware leader selection algorithm within the concept of mobile clouds. We deploy a dedicated Cooperative Control Server (CCS) to assist and manage the process of leader selection more efficiently. The proposed algorithm collects data regarding instantaneous conditions of Mobile Terminals (MTs) and their radio environment; and then computes and assigns a rank to each MT. The ranks calculated based on a combination of different context-related parameters and corresponding weighting factors, allow selecting the leader. Furthermore, the energy efficiency and stability of the selected leaders is investigated for different parameter values through... 

In this paper we consider the content distribution to a set of mobile users interested in the same content. We use the concept of mobile clouds, which exploits cooperation between mobile terminals over the low-power short-range links. We propose, formulate and investigate the energy efficiency and delay of four realistic cooperative content delivery strategies. The derived results, through analysis of mathematical models and simulations, demonstrate around 65% to 95% energy saving gain in mobile cloud strategies compared to conventional multicasting. We also show that using mobile clouds, content distribution delay can be reduced for up to 85%  

Networks of dynamical nodes serve as generic models for real-world systems in many branches of science ranging from mathematics to physics, technology, sociology and biology. Collective behavior of agents interacting over complex networks is important in many applications. The cooperation between selfish individuals is one of the most interesting collective phenomena. In this paper we address the interplay between the motifs' cooperation properties and their abundance in a number of real-world networks including yeast proteinprotein interaction, human brain, protein structure, email communication, dolphins' social interaction, Zachary karate club and Net-science coauthorship networks. First,... 

In this paper, an extended large wireless network, with a single transmitter-receiver pair, under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the legitimate users only know their own Channel State Information (CSI), not the eavesdroppers CSI. Also, the network is analyzed by taking in to account the effects of both fading and path loss. Under these assumptions, a power efficient cooperative scheme, named stochastic virtual beamforming, is proposed. Applying this scheme, any desired pair of secure rate and outage level denoted by (Rs, ϵ) will be achievable... 

We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the network design and network routing problems by modeling both creation and usage costs. In general, the games are played on a host graph, where each node is a selfish independent agent (player) and each edge has a fixed link creation cost α. Together the agents create a network (a subgraph of the host graph) while selfishly minimizing the link creation costs plus the sum of the distances to all other players (usage cost). In this paper, we pursue two important facets of the network creation game. First, we study... 

In this paper, we study the problem of cooperative abnormality detection using mobile sensors in a fluidic medium, based on a molecular communication setup. The sensors are injected into the medium to search the environment for the abnormality. To reduce the effects of sensor imperfection, we propose a cooperative scheme where the sensors activate each other by releasing some molecules (i.e., markers), into the medium after they sense an abnormality. A number of fusion centers (FC) are placed at specific locations in the medium, which absorb all sensors arrived at their locations. By observing the states of the received sensors, each FC decides whether an abnormality exists in its... 

In this paper, we present two physical layer cooperative protocols for heterogeneous sensor networks. There is one cooperator near the transmitter and a second cooperator (as a relay) near the receiver. Although the focus is on heterogeneous sensor networks, the methods can be applied to homogeneous sensor networks as well. Analytical and simulation results show that, under an additive white Gaussian noise channel assumption for the links between the transmitter and its partner and between the receiver and its partner, the proposed protocols achieve a diversity order of three or four by using the amplify-and-forward cooperation strategy and maximal ratio combining in the receiver. In...