It has been well recognized that channel state information (CSI) feedback is of great importance for downlink transmissions of closed-loop wireless networks. However, the existing work typically researched the CSI feedback problem for each individual mobile station (MS), and thus, cannot efficiently model the interactions among self-interested mobile users in the network level. To this end, in this paper, we propose an alternative approach to investigate the CSI feedback-rate control problem in the analytical setting of a game theoretic framework, in which a multiple-antenna base station (BS) communicates with a number of co-channel MSs through linear precoder. Specifically, we first present a non-cooperative feedback-rate control game (NFC), in which each MS selects the feedback-rate to maximize its performance in a distributed way. To improve efficiency from a social optimum point of view, we then introduce pricing, called the non-cooperative feedback-rate control game with price (NFCP). The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback-rate. The existence of the Nash equilibrium of such games is investigated, and two types of feedback protocols (FDMA and CSMA) are studied. Simulation results show that by adjusting the pricing factor, the distributed NFCP game results in close optimal performance compared with that of the centralized scheme.

In this paper, we investigate joint relay and jammer selection in two-way cooperative networks, consisting of two sources, a number of intermediate nodes, and one eavesdropper, with the constraints of physical-layer security. Specifically, the proposed algorithms select two or three intermediate nodes to enhance security against the malicious eavesdropper. The first selected node operates in the conventional relay mode and assists the sources to deliver their data to the corresponding destinations using an amplify-and-forward protocol. The second and third nodes are used in different communication phases as jammers in order to create intentional interference upon the malicious eavesdropper. First, we find that in a topology where the intermediate nodes are randomly and sparsely distributed, the proposed schemes with cooperative jamming outperform the conventional nonjamming schemes within a certain transmitted power regime. We also find that, in the scenario where the intermediate nodes gather as a close cluster, the jamming schemes may be less effective than their nonjamming counterparts. Therefore, we introduce a hybrid scheme to switch between jamming and nonjamming modes. Simulation results validate our theoretical analysis and show that the hybrid switching scheme further improves the secrecy rate.

In this paper, we propose a relay selection amplify-and-forward (RS-AF) protocol in general bidirectional relay networks with two sources and N relays. In the proposed scheme, the two sources first simultaneously transmit to all the relays, and then, a single relay with a minimum sum symbol error rate (SER) will be selected to broadcast the received signals back to both sources. To facilitate the selection process, we propose a simple suboptimal min-max criterion for relay selection, where a single relay that minimizes the maximum SER of two source nodes will be selected. Simulation results show that the proposed min-max selection has almost the same performance as the optimal selection with lower complexity. We also present a simple asymptotic SER expression and make a comparison with the conventional all-participate AF relaying scheme. The analytical results are verified through simulations. To improve the system performance, optimal power allocation (OPA) between the sources and the relay is determined based on the asymptotic SER. Simulation results indicate that the proposed RS-AF scheme with OPA yields considerable performance improvement over an equal-power-allocation scheme, particularly with a large number of relay nodes.