The full duplex (FD) technique, which allows the communication node to transmit and receive signals over the same frequency band simultaneously, has the potential to double the spectral efficiency in ...comparison with the traditional half duplex (HD) technique. However, self-interference, leaking from the FD node's transmission to its own reception, has the detrimental impact on the performance of FD communication. In this paper, we analyze and optimize the two-way FD relay system using amplify-and-forward protocol, when the multi-relay scenario is considered. The optimal relay selection scheme in maximizing the effective signal-to-interference and noise ratio is proposed, which significantly improves the system performance than a single relay network. Furthermore, to facilitate the comparisons with the traditional two-way HD relay, the analytical expressions of the two-way FD relay are derived in a closed form, including bit error rate (BER), ergodic capacity, and outage probability. Based on the analytical expressions, the optimal power allocation and the optimal choice of duplex mode, i.e., FD and HD, are obtained by minimizing the outage probability. Monte-Carlo simulations are fulfilled to verify the analytical expressions. The results reveal that the residual self-interference after interference suppression limits the performance of two-way FD relay: when the residual interference is small, the FD mode has lower BER/outage probability and higher ergodic capacity since it utilizes the resources effectively; otherwise, the HD mode achieves lower BER/outage probability and higher ergodic capacity since it can completely cancel the self-interference at the cost of lower resource utilization.
In this paper, we study an intelligent omni-surface (IOS)-assisted downlink communication system, where the link quality of a mobile user (MU) can be improved with a proper IOS phase shift design. ...Unlike the intelligent reflecting surface (IRS) in most existing works that only forwards the signals in a reflective way, the IOS is capable to forward the received signals to the MU in either a reflective or a transmissive manner, thereby enhancing the wireless coverage. We formulate an IOS phase shift optimization problem to maximize the downlink spectral efficiency (SE) of the MU. The optimal phase shift of the IOS is analysed, and a branch-and-bound based algorithm is proposed to design the IOS phase shift in a finite set. Simulation results show that the IOS-assisted system can extend the coverage significantly when compared to the IRS-assisted system with only reflective signals.
In this paper, we consider a dense vehicular communication network where each vehicle broadcasts its safety information to its neighborhood in each transmission period. Such applications require low ...latency and high reliability, and thus, we exploit non-orthogonal multiple access to reduce the access latency and to improve the packet reception probability. In the proposed two-fold scheme, the BS performs semi-persistent scheduling and allocates time-frequency resources in a nonorthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control. We formulate the centralized scheduling and resource allocation problem as equivalent to a multi-dimensional stable roommate matching problem, in which the users and time/frequency resources are considered as disjoint sets of objects to be matched with each other. We then develop a novel rotation matching algorithm, which converges to an L-rotation stable matching after a limited number of iterations. Simulation results show that the proposed scheme outperforms the traditional orthogonal multiple access scheme in terms of the access latency and reliability.
Device-to-device (D2D) communication has been recognized as a promising technique to offload the traffic for the evolved Node B (eNB). However, D2D transmission as an underlay causes severe ...interference to both the cellular and other D2D links, which imposes a great technical challenge to radio resource allocation. Conventional graph based resource allocation methods typically consider the interference between two user equipments (UEs), but they cannot model the interference from multiple UEs to completely characterize the interference. In this paper, we study channel allocation using hypergraph theory to coordinate the interference between D2D pairs and cellular UEs, where an arbitrary number of D2D pairs are allowed to share the uplink channels with the cellular UEs. Hypergraph coloring is used to model the cumulative interference from multiple D2D pairs, and thus, eliminate the mutual interference. Simulation results show that the system capacity is significantly improved using the proposed hypergraph method in comparison to the conventional graph based one.
With the increasing demand for vehicular data transmission, limited dedicated cellular spectrum becomes a bottleneck to satisfying the requirements of all cellular vehicle-to-everything (V2X) users. ...To address this issue, unlicensed spectrum is considered to serve as the complement to support cellular V2X users. In this paper, we study the coexistence problem of cellular V2X users and vehicular ad hoc network (VANET) users over the unlicensed spectrum. To facilitate the coexistence, we design an energy sensing-based spectrum sharing scheme, where cellular V2X users are able to access the unlicensed channels fairly while reducing the data transmission collisions between cellular V2X and VANET users. In order to maximize the number of active cellular V2X users, we formulate the scheduling and resource allocation problem as a two-sided many-to-many matching with peer effects. We then propose a dynamic vehicle-resource matching algorithm and present the analytical results on the convergence time and computational complexity. Simulation results show that the proposed algorithm outperforms existing approaches in terms of the performance of the cellular V2X system when the unlicensed spectrum is utilized.
In this paper, we perform transmit antenna selection to improve the energy efficiency of large scale multiple antenna systems. We derive a good approximation of the distribution of the mutual ...information in this antenna selection system. It shows that channel hardening phenomenon is still retained as full complexity with antenna selection. Then, we use this closed-form expression to assess the energy efficiency performance. Specifically, we evaluate the performance of the energy efficiency in two different cases: 1) the circuit power consumption is comparable to or even dominates the transmit power, and 2) the circuit power can be ignored due to relatively much higher transmit power. The theoretical analysis indicates that there exists an optimal number of selected antennas to maximize the energy efficiency in the first case, whereas in the second case, the energy efficiency is maximized when all the available antennas are used. Based on these conclusions, two simple but efficient antenna selection algorithms are proposed to obtain the maximum energy efficiency. All the analytical results are verified through computer simulations.
In this paper, we investigate the performance of multi-pair two-way relaying, in which multiple pairs of users exchange information within pair, with the help of a shared relay. Each user has a ...single antenna, and the relay is equipped with very large number of antennas. The relay adopts the amplify-and-forward protocol, and the beamforming matrixes of maximum-ratio combining/maximum ratio transmission and zero-forcing reception/zero-forcing transmission are both considered. Due to array gain of antenna array, the power of each user or the relay (or both) can be made inversely proportional to the number of relay antennas, without compromising the performance. Thus, three power-scaling schemes are studied. Furthermore, the asymptotic spectral and energy efficiencies of the system are obtained analytically, when the number of relay antennas approaches to infinity. The asymptotic results are beneficial to provide more insightful understandings for the fundamental limits of the very large antenna system, and verified by the Monte-Carlo simulations. The analytical and simulation results reveal that very large antenna arrays in such system can average the small-scale fading, eliminate the inter-pair interference, and reduce the total power consumption.
In this paper, we consider a two-way relay system where the two sources can only communicate through an untrusted intermediate relay and investigate the physical layer security issue in this two-way ...untrusted relay scenario. Specifically, we regard the intermediate relay as an eavesdropper from which the information transmitted by the sources needs to be kept confidential, despite the fact that its cooperation in relaying this information is essential. We first indicate that a nonzero secrecy rate is indeed achievable in this two-way untrusted relay system even without the help of external friendly jammers. As for the system with friendly jammers, after further analysis, we can obtain the secrecy rate of the sources can be effectively improved by utilizing proper jamming power from the friendly jammers. Then, we formulate a Stackelberg game between the sources and the friendly jammers as a power control scheme to achieve the optimized secrecy rate of the sources, in which the sources are treated as the sole buyer and the friendly jammers are the sellers. In addition, the optimal solutions of the jamming power and the asking prices are given, and a distributed updating algorithm to obtain the Stackelberg equilibrium is provided for the proposed game. Finally, the simulation results verify the properties and efficiency of the proposed Stackelberg-game-based scheme.
The current cloud-based Internet-of-Things (IoT) model has revealed great potential in offering storage and computing services to the IoT users. Fog computing, as an emerging paradigm to complement ...the cloud computing platform, has been proposed to extend the IoT role to the edge of the network. With fog computing, service providers can exchange the control signals with the users for specific task requirements, and offload users' delay-sensitive tasks directly to the widely distributed fog nodes at the network edge, and thus improving user experience. So far, most existing works have focused on either the radio or computational resource allocation in the fog computing. In this work, we investigate a joint radio and computational resource allocation problem to optimize the system performance and improve user satisfaction. Important factors, such as service delay, link quality, mandatory benefit, and so on, are taken into consideration. Instead of the conventional centralized optimization, we propose to use a matching game framework, in particular, student project allocation (SPA) game, to provide a distributed solution for the formulated joint resource allocation problem. The efficient SPA-(S,P) algorithm is implemented to find a stable result for the SPA problem. In addition, the instability caused by the external effect, i.e., the interindependence between matching players, is removed by the proposed user-oriented cooperation (UOC) strategy. The system performance is also further improved by adopting the UOC strategy.
In smart grid, residential consumers adopt different load scheduling methods to manage their power consumptions with specific objectives. The conventional load scheduling methods aim to maximize the ...consumption payoff or minimize the consumption cost. In this paper, we introduce a novel concept of cost efficiency-based residential load scheduling framework to improve the economical efficiency of the residential electricity consumption. The cost efficiency is defined as the ratio of consumer's total consumption benefit to its total electricity payment during a certain period. We develop a cost-efficient load scheduling algorithm for the demand-side's day-ahead bidding process and real-time pricing mechanism by using a fractional programing approach. Results show that the proposed scheduling algorithm can effectively reflect and affect user's consumption behavior and achieve the optimal cost-efficient energy consumption profile. For practical consideration, we also take into account the service fee and distributed energy resources (DERs) in our framework, and analyze their impacts on the cost efficiency. Simulation results confirm that the proposed algorithm significantly improves consumer's cost efficiency. It is shown that a higher service fee will decrease the cost efficiency, while the integration of DERs can effectively improve the cost efficiency.
PDF
