The MP2P (mobile peer-to-peer) topology is limited by wireless bandwidth, battery energy, the unreliable and the move node, this paper proposes a selection strategy to improve safety and assets node which based on Reputation and Bayesian Game in MP2P network. The proposed method is including two steps. First, using the dynamic BGT (Bayesian Game Theory) to gain the reputation of resource node. Secondly, using the static Bayesian Game theory to connect the resource nodes, the strategy can efficiently reduce failure rate of the resource nodes and shorten the query delay, thereby greatly improving the resource downloading rate.
Millimeter wave (mmWave) communication is a promising technology for the fifth-generation (5G) wireless system. However, the large number of antennas used and the wide signal bandwidth in mmWave systems render the conventional multi-antenna techniques increasingly costly in terms of signal processing complexity, hardware implementation, and power consumption. In this article, we investigate cost-effective mmWave communications by first providing an overview of the main existing techniques that offer different trade-offs between performance and cost, and then focusing our discussion on a promising new technique based on the advanced lens antenna array. It is revealed that by exploiting the angle-dependent energy focusing property of lens arrays, together with the angular sparsity of the mmWave channels, mmWave lens-antenna system is able to achieve the capacity-optimal performance with very few radio-frequency (RF) chains and using the low-complexity single-carrier transmission, even for wide-band frequency-selective channels. Numerical results show that the lens-based system significantly outperforms the state-of-the-art designs for mmWave systems in both spectrum efficiency and energy efficiency.
In this paper, we propose a new multiple-input multiple-output (MIMO) communication system with movable antennas (MAs) to exploit more degrees of freedom (DoFs) in the spatial domain for enhancing the capacity. Different from conventional MIMO systems with fixed-position antennas (FPAs), the proposed system can flexibly change the positions of MAs, such that the MIMO channel between the transmit and receive antennas is reconfigured for achieving higher capacity. We aim to achieve the maximum capacity of MA-enabled point-to-point MIMO communication systems, by jointly optimizing the positions of the receive MAs and the covariance of the transmit signals. We develop an efficient alternating optimization algorithm to find a locally optimal solution by iteratively optimizing the transmit covariance matrix and the position of each MA with the other variables being fixed. Numerical results show that our proposed scheme substantially improves the MIMO capacity compared to traditional FPA systems.
In this paper, we study a cellular-enabled unmanned aerial vehicle (UAV) communication system consisting of one UAV and multiple ground base stations (GBSs). The UAV has a mission of flying from an initial location to a final location, during which it needs to maintain reliable wireless connection with the cellular network by associating with one of the GBSs at each time instant. We aim to minimize the UAV mission completion time by optimizing its trajectory, subject to a quality of connectivity constraint of the GBS-UAV link specified by a minimum received signal-to-noise ratio (SNR) target, which needs to be satisfied throughout the mission. This problem is non-convex and difficult to be optimally solved. We first propose an effective approach to check its feasibility based on graph connectivity verification. Then, by examining the GBS-UAV association sequence during the UAV mission, we obtain useful insights on the optimal UAV trajectory, based on which an efficient algorithm is proposed to find an approximate solution to the trajectory optimization problem by leveraging techniques in convex optimization and graph theory. Numerical results show that our proposed trajectory design achieves near-optimal performance.
Local caching is an effective scheme for leveraging the memory of the mobile terminal (MT) and short range communications to save the bandwidth usage and reduce the download delay in the cellular communication system. In particular, the MTs first cache in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity during peak hours. However, prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviors. In this paper, we practically categorize the MTs into different interest groups according to the MTs' preferences. Each group of MTs aims to increase the probability of successful file discovery from the neighboring MTs (from the same or different groups). Hence, we define the groups' utilities as the probability of successfully discovering the file in the neighboring MTs, which should be maximized by deciding the caching strategies of different groups. By modeling MTs' mobilities as homogeneous Poisson point processes, we analytically characterize MTs' utilities in the closed form. We first consider the fully cooperative case where a centralizer helps all groups to make caching decisions. We formulate the problem as a weighted-sum utility maximization problem, through which the maximum utility tradeoffs of different groups are characterized. Next, we study two benchmark cases under selfish caching, namely, partial and no cooperation, with and without inter-group file sharing, respectively. The optimal caching distributions for these two cases are derived. Finally, numerical examples are presented to compare the utilities under different cases and show the effectiveness of the fully cooperative local caching compared with the two benchmark cases.
This paper considers spectrum sharing for wireless communication between a cognitive radio (CR) link and a primary radio (PR) link. It is assumed that the CR protects the PR transmission by applying the so-called interference-temperature constraint, whereby the CR is allowed to transmit regardless of the PR's on/off status provided that the resultant interference power level at the PR receiver is kept below some predefined threshold. For the fading PR and CR channels, the interference-power constraint at the PR receiver is usually one of the following two types: One is to regulate the average interference power (AIP) over all the fading states, while the other is to limit the peak interference power (PIP) at each fading state. From the CR's perspective, given the same average and peak power threshold, the AIP constraint is more favorable than the PIP counterpart because of its more flexibility for dynamically allocating transmit powers over the fading states. On the contrary, from the perspective of protecting the PR, the more restrictive PIP constraint appears at a first glance to be a better option than the AIP. Some surprisingly, this paper shows that in terms of various forms of capacity limits achievable for the PR fading channel, e.g., the ergodic and outage capacities, the AIP constraint is also superior over the PIP. This result is based upon an interesting interference diversity phenomenon, i.e., randomized interference powers over the fading states in the AIP case are more advantageous over deterministic ones in the PIP case for minimizing the resultant PR capacity losses. Therefore, the AIP constraint results in larger fading channel capacities than the PIP for both the CR and PR transmissions.
Intelligent reflecting surface (IRS) is an emerging technology to enhance the spectral and energy efficiency of wireless communications cost-effectively. This letter considers a new multi-IRS aided wireless network where a cascaded line-of-sight (LoS) link is established between the base station (BS) and a remote user by leveraging the multi-hop signal reflection of selected IRSs. As compared to the conventional single-/double-hop IRS system, multi-hop IRS system provides more pronounced path diversity and cooperative passive beamforming gains, especially in the environment with dense obstacles. However, a more challenging joint active/passive beamforming and multi-hop beam routing problem also arises for maximizing the end-to-end channel gain. Furthermore, the number of IRS-associated channel coefficients increases drastically with the number of IRS hops. To tackle the above issues, in this letter we propose a new and efficient beam training based solution by considering the use of practical codebook-based BS/IRS active/passive beamforming without the need of explicit channel estimation. Instead of exhaustively or sequentially searching over all combinations of active and passive beam patterns for each beam route, a distributed beam training scheme is proposed to reduce the complexity, by exploiting the (nearly) time-invariant BS-IRS and inter-IRS channels and the cooperative training among the BS and IRSs' controllers. Simulation results show that our proposed design achieves the end-to-end channel gain close to that of the sequential beam search, but at a much lower training overhead and complexity.
Quadrature phase shift keying modulation(QPSK) plays a very important role in the satellite communication.Based on of analyzing the principle of QPSK modulation and demodulation,the BERs of three jamming modes used for QPSK are theoretically derived,and these three modes include the continuous noise jamming,single frequency modulation jamming and pointed single frequency modulation jamming.By analyzing the simulation results,the jamming effects of the three jamming modes are obtained,and the effectiveness of the jamming is proved.
This paper studies the transmit strategy for a secondary link or the so-called cognitive radio (CR) link under opportunistic spectrum sharing with an existing primary radio (PR) link. It is assumed that the CR transmitter is equipped with multi-antennas, whereby transmit precoding and power control can be jointly deployed to balance between avoiding interference at the PR terminals and optimizing performance of the CR link. This operation is named as cognitive beamforming (CB). Unlike prior study on CB that assumes perfect knowledge of the channels over which the CR transmitter interferes with the PR terminals, this paper proposes a practical CB scheme utilizing a new idea of effective interference channel (EIC), which can be efficiently estimated at the CR transmitter from its observed PR signals. Somehow surprisingly, this paper shows that the learning-based CB scheme with the EIC improves the CR channel capacity against the conventional scheme even with the exact CRto- PR channel knowledge, when the PR link is equipped with multi-antennas but only communicates over a subspace of the total available spatial dimensions. Moreover, this paper presents algorithms for the CR to estimate the EIC over a finite learning time. Due to channel estimation errors, the proposed CB scheme causes leakage interference at the PR terminals, which leads to an interesting learning-throughput tradeoff phenomenon for the CR, pertinent to its time allocation between channel learning and data transmission. This paper derives the optimal channel learning time to maximize the effective throughput of the CR link, subject to the CR transmit power constraint and the interference power constraints for the PR terminals.
Intelligent reflecting surface (IRS) has emerged as a promising technique to control wireless propagation wireless environment for improving the communication performance cost-effectively and extending the wireless signal coverage of access point (AP). In order to reduce the path-loss of the cascaded user-IRS-AP channels, the IRS-integrated AP architecture has been proposed to deploy the antenna array of the AP and the IRSs within the same antenna radome. To reduce the pilot overhead for estimating all IRS-involved channels, in this paper, we propose a novel codebook-based IRS reflection design for the IRS-integrated AP to enhance the coverage performance in a given area. In particular, the codebook consisting of a small number of codewords is designed offline by employing an efficient sector division strategy based on the azimuth angle. To ensure the performance of each sector, we optimize its corresponding codeword for IRS reflection pattern to maximize the sector-min-average-effective-channel-power (SMAECP) by applying the alternating optimization (AO) and semidefinite relaxation (SDR) methods. With the designed codebook, the AP performs the IRS reflection training by sequentially applying all codewords and selects the one achieving the best communication performance for data transmission. Numerical results show that our proposed codebook design can enhance the average channel power of the whole coverage area, as compared to the system without IRS. Moreover, the proposed codebook-based IRS reflection design is compared with several benchmark schemes, which achieves significant performance gain in both single-user and multi-user transmissions.
This letter proposes a novel unmanned aerial vehicle (UAV)-enabled mobile jamming scheme to improve the secrecy rate of ground wiretap channel. Specifically, a UAV is employed to transmit jamming signals to combat against eavesdropping. Such a mobile jamming scheme is particularly appealing since the UAV-enabled jammer can fly close to the eavesdropper and opportunistically jam it by leveraging the UAV's mobility. We aim to maximize the average secrecy rate by jointly optimizing the UAV's trajectory and jamming power over a given flight period. To make the problem more tractable, we drive a closed-form lower bound for the achievable secrecy rate, based on which the UAV's trajectory and transmit power are optimized alternately by an efficient iterative algorithm applying the block coordinate descent and successive convex optimization techniques. Simulation results demonstrate that the proposed joint design can significantly enhance the secrecy rate of the considered wiretap system as compared to benchmark schemes.
Intelligent reflecting surface (IRS) is a revolutionizing approach for achieving low-cost yet spectral and energy efficient wireless communications. By properly tuning its massive reflecting elements, IRS is able to construct favorable channels and thereby significantly improve the wireless communication performance in various setups. In this paper, we consider the general wireless network consisting of multiple base stations (BSs), users and IRSs, and investigate their joint association optimization in the downlink communication. Specifically, each IRS assists in the communication from its associated BS to user and in the meanwhile randomly scatters the signals from the other non-associated BSs. As such, the joint BS-IRS-user association is more involved as compared to the BS-user association in conventional wireless networks without IRS. To address this new problem, we first derive the average signal-to-interference-plus-noise ratio (SINR) of each user in closed-form and then formulate the joint association problem to maximize the users' utility in the downlink communication. Both the optimal and low-complexity suboptimal solutions are proposed for the formulated problem. Numerical results demonstrate significant performance gains of the proposed solutions over benchmark schemes.
The random beamforming (RBF) scheme, jointly applied with multi-user diversity based scheduling, is able to achieve virtually interference-free downlink transmissions with only partial channel state information (CSI) available at the transmitter. However, the impact of receive spatial diversity on the rate performance of RBF is not fully characterized yet even in a single-cell setup. In this paper, we study a multi-cell multiple-input multiple-output (MIMO) broadcast system with RBF applied at each base station (BS) and either the minimum-mean-square-error (MMSE), matched filter (MF), or antenna selection (AS) based spatial receiver employed at each mobile terminal. We investigate the effect of different spatial diversity receivers on the achievable sum-rate of multi-cell RBF systems subject to both the intra- and inter-cell interferences. We first derive closed-form expressions for the distributions of the receiver signal-to-interference-plus-noise ratio (SINR) with different spatial diversity techniques, based on which we compare their rate performances at finite signal-to-noise ratios (SNRs). We then investigate the asymptotically high-SNR regime and for a tractable analysis assume that the number of users in each cell scales in a certain order with the per-cell SNR as SNR goes to infinity. Under this setup, we characterize the degrees of freedom (DoF) region for multi-cell RBF systems with different types of spatial receivers, which consists of all the achievable DoF tuples for the individual sum-rate of all the cells. The DoF region analysis provides a succinct characterization of the interplays among the receive spatial diversity, multiuser diversity, spatial multiplexing gain, inter-/intra-cell interferences, and BSs' collaborative transmission.
