Advances in base- and mobile-station aided cooperative wireless communications : An overview

In recent years, there has been an upsurge of research interest in cooperative wireless communications in both academia and industry. This article presents a simple overview of the pivotal topics in both mobile station (MS)- and base station (BS)- assisted cooperation in the context of cellular radio systems. Owing to the ever-increasing amount of literature in this particular field, this article is by no means exhaustive, but is intended to serve as a roadmap by assembling a representative sample of recent results and to stimulate further research. The emphasis is initially on relay-base cooperation, relying on network coding, followed by the design of cross-layer cooperative protocols conceived for MS cooperation and the concept of coalition network element (CNE)-assisted BS cooperation. Then, a range of complexity and backhaul traffic reduction techniques that have been proposed for BS cooperation are reviewed. A more detailed discussion is provided in the context of MS cooperation concerning the pros and cons of dispensing with high-complexity, power-hungry channel estimation. Finally, generalized design guidelines, conceived for cooperative wireless communications, are presented.

BER Analysis of Space Shift Keying in Cooperative Multi-hop Multi-branch DF Relaying

Space shift keying (SSK) is an attractive modulation technique for multi-antenna communications. In SSK, only one among the available transmit antennas is activated during one channel use, and the index of the chosen transmit antenna conveys information. In this paper, we analyze the performance of SSK in multi-hop, multi-branch cooperative relaying systems. We consider the decode-and-forward relaying protocol, where a relay forwards the decoded symbol if it decodes the symbol correctly from the received signal. We derive closed-form expressions for the end-to-end bit error rate of SSK in this system. Analytical and simulation results match very well.

Modeling Time-Varying Aggregate Interference in Cognitive Radio Systems, and Application to Primary Exclusive Zone Design

Accurately characterizing the time-varying interference caused to the primary users is essential in ensuring a successful deployment of cognitive radios (CR). We show that the aggregate interference at the primary receiver (PU-Rx) from multiple, randomly located cognitive users (CUs) is well modeled as a shifted lognormal random process, which is more accurate than the lognormal and the Gaussian process models considered in the literature, even for a relatively dense deployment of CUs. It also compares favorably with the asymptotically exact stable and symmetric truncated stable distribution models, except at high CU densities. Our model accounts for the effect of imperfect spectrum sensing, which depends on path-loss, shadowing, and small-scale fading of the link from the primary transmitter to the CU; the interweave and underlay modes or CR operation, which determine the transmit powers of the CUs; and time-correlated shadowing and fading of the links from the CUs to the PU-Rx. It leads to expressions for the probability distribution function, level crossing rate, and average exceedance duration. The impact of cooperative spectrum sensing is also characterized. We validate the model by applying it to redesign the primary exclusive zone to account for the time-varying nature of interference.

Group behaviour in physical, chemical and biological systems

Groups exhibit properties that either are not perceived to exist, or perhaps cannot exist, at the individual level. Such `emergent' properties depend on how individuals interact, both among themselves and with their surroundings. The world of everyday objects consists of material entities. These are, ultimately, groups of elementary particles that organize themselves into atoms and molecules, occupy space, and so on. It turns out that an explanation of even the most commonplace features of this world requires relativistic quantum field theory and the fact that Planck's constant is discrete, not zero. Groups of molecules in solution, in particular polymers ('sols'), can form viscous clusters that behave like elastic solids ('gels'). Sol-gel transitions are examples of cooperative phenomena. Their occurrence is explained by modelling the statistics of inter-unit interactions: the likelihood of either state varies sharply as a critical parameter crosses a threshold value. Group behaviour among cells or organisms is often heritable and therefore can evolve. This permits an additional, typically biological, explanation for it in terms of reproductive advantage, whether of the individual or of the group. There is no general agreement on the appropriate explanatory framework for understanding group-level phenomena in biology.

Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles

We consider the problem of ``fair'' scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. We study the well-known family of parametric alpha-fair scheduling problems from a game-theoretic perspective in which some of the mobiles may be noncooperative. We first show that if the BS is unaware of the noncooperative behavior from the mobiles, the noncooperative mobiles become successful in snatching the resources from the other cooperative mobiles, resulting in unfair allocations. If the BS is aware of the noncooperative mobiles, a new game arises with BS as an additional player. It can then do better by neglecting the signals from the noncooperative mobiles. The BS, however, becomes successful in eliciting the truthful signals from the mobiles only when it uses additional information (signal statistics). This new policy along with the truthful signals from mobiles forms a Nash equilibrium (NE) that we call a Truth Revealing Equilibrium. Finally, we propose new iterative algorithms to implement fair scheduling policies that robustify the otherwise nonrobust (in presence of noncooperation) alpha-fair scheduling algorithms.

Secure Transmission in Cooperative Networks with Weak Eavesdroppers

In this letter, we propose a scheme to improve the secrecy rate of cooperative networks using Analog Network Coding (ANC). ANC mixes the signals in the air; the desired signal is then separated out, from the mixed signals, at the legitimate receiver using techniques like self interference subtraction and signal nulling, thereby achieving better secrecy rates. Assuming global channel state information, memoryless adversaries and the decode-and-forward strategy, we seek to maximize the average secrecy rate between the source and the destination, subject to an overall power budget. Then, exploiting the structure of the optimization problem, we compute its optimal solution. Finally, we use numerical evaluations to compare our scheme with the conventional approaches.