MIMO cooperative communication network design with relay selection and CSI feedback

In this paper, we investigate an amplify-and-forward (AF) multiple-input multiple-output - spatial division multiplexing (MIMO-SDM) cooperative wireless networks, where each network node is equipped with multiple antennas. In order to deal with the problems of signal combining at the destination and cooperative relay selection, we propose an improved minimum mean square error (MMSE) signal combining scheme for signal recovery at the destination. Additionally, we propose two distributed relay selection algorithms based on the minimum mean squared error (MSE) of the signal estimation for the cases where channel state information (CSI) from the source to the destination is available and unavailable at the candidate nodes. Simulation results demonstrate that the proposed combiner together with the proposed relay selection algorithms achieve higher diversity gain than previous approaches in both flat and frequency-selective fading channels.

On the Diversity-Multiplexing Tradefoff for Wireless Cooperative Multiple Access Systems

A spectrally efficient strategy is proposed for cooperative multiple access (CMA) channels in a centralized communication environment with $N$ users. By applying superposition coding, each user will transmit a mixture containing its own information as well as the other users', which means that each user shares parts of its power with the others. The use of superposition coding in cooperative networks was first proposed in , which will be generalized to a multiple-user scenario in this paper. Since the proposed CMA system can be seen as a precoded point-to-point multiple-antenna system, its performance can be best evaluated using the diversity-multiplexing tradeoff. By carefully categorizing the outage events, the diversity-multiplexing tradeoff can be obtained, which shows that the proposed cooperative strategy can achieve larger diversity/multiplexing gain than the compared transmission schemes at any diversity/multiplexing gain. Furthermore, it is demonstrated that the proposed strategy can achieve optimal tradeoff for multiplexing gains $0leq r leq 1$ whereas the compared cooperative scheme is only optimal for $0leq r leq ({1}/{N})$. As discussed in the paper, such superiority of the proposed CMA system is due to the fact that the relaying transmission does not consume extra channel use and, hence, the deteriorating effect of cooperative communication on the data rate is effectively limited.

Accounting Undergraduates’ Perceptions of Cooperative Learning as a Model for Enhancing their Interpersonal and Communication Skills to Interface Successfully with Professional Accountancy Education and Training

To interface effectively with professional accountancy training, accounting educationalists should ensure that they turn out graduates who possess the interpersonal and communication skills required of today's accountant. Attainment of these skills is promoted by group work. However, little empirical evidence exists to help academics make an informed choice about which form of group learning enhances interpersonal and communication skills. This paper addresses this deficiency by comparing perceptions of skills enhancement between accounting students who experienced traditional or simple group learning and those who undertook cooperative learning. The findings reveal that the cooperative learning cohort perceived their learning experience to be significantly more effective at enhancing interpersonal and communication skills than that of the simple group learning cohort. This study provides evidence that cooperative learning is a more effective model for delivering interpersonal and communication skills than simple group learning, thereby creating a more successful interface between academic accounting and professional accountancy training.

Optimal Power Allocation for Multiuser Secure Communication in Cooperative Relaying Networks

We consider a cooperative relaying network in which a source communicates with a group of users in the presence of one eavesdropper. We assume that there are no source-user links and the group of users receive only retransmitted signal from the relay. Whereas, the eavesdropper receives both the original and retransmitted signals. Under these assumptions, we exploit the user selection technique to enhance the secure performance. We first find the optimal power allocation strategy when the source has the full channel state information (CSI) of all links. We then evaluate the security level through: i) ergodic secrecy rate and ii) secrecy outage probability when having only the statistical knowledge of CSIs.

Spectrally efficient cooperative diversity protocol for uplink wireless transmission

A spectrally efficient cooperative protocol for uplink wireless transmission in a centralised communication system is proposed, where each of the N users play the relaying and source roles simultaneously by using superposition (SP) modulation. The probability density function of the mutual information between SP-modulated transmitted and received signals of the cooperative uplink channels is derived. Using the high-signal-to-noise ratio (SNR) approximation of this density function, the outage probability formula of the system as well as its easily computable tight upper and lower bounds are obtained and these formulas are evaluated numerically. Numerical results show that the proposed strategy can achieve around 3 dB performance gain over comparable schemes. Furthermore, the multiplexing and diversity tradeoff formula is derived to illustrate the optimal performance of the proposed protocol, which also confirms that the SP relaying transmission does not cause any loss of data rate. Moreover, performance characterisation in terms of ergodic and outage capacities are studied and numerical results show that the proposed scheme can achieve significantly larger outage capacity than direct transmission, which is similar to other cooperative schemes. The superiority of the proposed strategy is demonstrated by the fact that it can maintain almost the same ergodic capacity as the direct transmission, whereas the ergodic capacity of other cooperative schemes would be much worse.

Network formation under mutual consent and costly communication

We consider two different approaches to describe the formation of social networks under mutual consent and costly communication. First, we consider a network-based approach; in particular Jackson–Wolinsky’s concept of pairwise stability. Next, we discuss a non-cooperative game-theoretic approach, through a refinement of the Nash equilibria of Myerson’s consent game. This refinement, denoted as monadic stability, describes myopically forward looking behavior of the players. We show through an equivalence that the class of monadically stable networks is a strict subset of the class of pairwise stable networks that can be characterized fully by modifications of the properties defining pairwise stability.

Capacity and resource allocation of cooperative MIMO in ad hoc networks

Cooperative MIMO (Multiple Input–Multiple Output) allows multiple nodes share their antennas to emulate antenna arrays and transmit or receive cooperatively. It has the ability to increase the capacity for future wireless communication systems and it is particularly suited for ad hoc networks. In this study, based on the transmission procedure of a typical cooperative MIMO system, we first analyze the capacity of single-hop cooperative MIMO systems, and then we derive the optimal resource allocation strategy to maximize the end-to-end capacity in multi-hop cooperative MIMO systems. The study shows three implications. First, only when the intra-cluster channel is better than the inter-cluster channel, cooperative MIMO results in a capacity increment. Second, for a given scenario there is an optimal number of cooperative nodes. For instance, in our study an optimal deployment of three cooperative nodes achieve a capacity increment of 2 bps/Hz when compared with direct transmission. Third, an optimal resource allocation strategy plays a significant role in maximizing end-to-end capacity in multi-hop cooperative MIMO systems. Numerical results show that when optimal resource allocation is applied we achieve more than 20% end-to-end capacity increment in average when compared with an equal resource allocation strategy.

Outage performance of cognitive cooperative networks with relay selection over double-Rayleigh fading channels

This study considers a dual-hop cognitive inter-vehicular relay-assisted communication system where all
communication links are non-line of sight ones and their fading is modelled by the double Rayleigh fading distribution.
Road-side relays (or access points) implementing the decode-and-forward relaying protocol are employed and one of
them is selected according to a predetermined policy to enable communication between vehicles. The performance of
the considered cognitive cooperative system is investigated for Kth best partial and full relay selection (RS) as well as
for two distinct fading scenarios. In the first scenario, all channels are double Rayleigh distributed. In the second
scenario, only the secondary source to relay and relay to destination channels are considered to be subject to double
Rayleigh fading whereas, channels between the secondary transmitters and the primary user are modelled by the
Rayleigh distribution. Exact and approximate expressions for the outage probability performance for all considered RS
policies and fading scenarios are presented. In addition to the analytical results, complementary computer simulated
performance evaluation results have been obtained by means of Monte Carlo simulations. The perfect match between
these two sets of results has verified the accuracy of the proposed mathematical analysis.