29,016 research outputs found
Exploiting Trust Degree for Multiple-Antenna User Cooperation
For a user cooperation system with multiple antennas, we consider a trust
degree based cooperation techniques to explore the influence of the
trustworthiness between users on the communication systems. For the system with
two communication pairs, when one communication pair achieves its quality of
service (QoS) requirement, they can help the transmission of the other
communication pair according to the trust degree, which quantifies the
trustworthiness between users in the cooperation. For given trust degree, we
investigate the user cooperation strategies, which include the power allocation
and precoder design for various antenna configurations. For SISO and MISO
cases, we provide the optimal power allocation and beamformer design that
maximize the expected achievable rates while guaranteeing the QoS requirement.
For a SIMO case, we resort to semidefinite relaxation (SDR) technique and block
coordinate update (BCU) method to solve the corresponding problem, and
guarantee the rank-one solutions at each step. For a MIMO case, as MIMO is the
generalization of MISO and SIMO, the similarities among their problem
structures inspire us to combine the methods from MISO and SIMO together to
efficiently tackle MIMO case. Simulation results show that the trust degree
information has a great effect on the performance of the user cooperation in
terms of the expected achievable rate, and the proposed user cooperation
strategies achieve high achievable rates for given trust degree.Comment: 15 pages,9 figures, to appear in IEEE Transactions on Wireless
communication
Interference Alignment Through User Cooperation for Two-cell MIMO Interfering Broadcast Channels
This paper focuses on two-cell multiple-input multiple-output (MIMO) Gaussian
interfering broadcast channels (MIMO-IFBC) with cooperating users on the
cell-boundary of each BS. It corresponds to a downlink scenario for cellular
networks with two base stations (BSs), and users equipped with Wi-Fi
interfaces enabling to cooperate among users on a peer-to-peer basis. In this
scenario, we propose a novel interference alignment (IA) technique exploiting
user cooperation. Our proposed algorithm obtains the achievable degrees of
freedom (DoF) of 2K when each BS and user have transmit antennas and
receive antennas, respectively. Furthermore, the algorithm requires only
a small amount of channel feedback information with the aid of the user
cooperation channels. The simulations demonstrate that not only are the
analytical results valid, but the achievable DoF of our proposed algorithm also
outperforms those of conventional techniques.Comment: This paper will appear in IEEE GLOBECOM 201
Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks
In this paper, we consider a cognitive radio network that consists of one
cognitive base station (CBS) and multiple cognitive users (CUs) in the presence
of multiple eavesdroppers, where CUs transmit their data packets to CBS under a
primary user's quality of service (QoS) constraint while the eavesdroppers
attempt to intercept the cognitive transmissions from CUs to CBS. We
investigate the physical-layer security against eavesdropping attacks in the
cognitive radio network and propose the user scheduling scheme to achieve
multiuser diversity for improving the security level of cognitive transmissions
with a primary QoS constraint. Specifically, a cognitive user (CU) that
satisfies the primary QoS requirement and maximizes the achievable secrecy rate
of cognitive transmissions is scheduled to transmit its data packet. For the
comparison purpose, we also examine the traditional multiuser scheduling and
the artificial noise schemes. We analyze the achievable secrecy rate and
intercept probability of the traditional and proposed multiuser scheduling
schemes as well as the artificial noise scheme in Rayleigh fading environments.
Numerical results show that given a primary QoS constraint, the proposed
multiuser scheduling scheme generally outperforms the traditional multiuser
scheduling and the artificial noise schemes in terms of the achievable secrecy
rate and intercept probability. In addition, we derive the diversity order of
the proposed multiuser scheduling scheme through an asymptotic intercept
probability analysis and prove that the full diversity is obtained by using the
proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201
Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks
Soaring capacity and coverage demands dictate that future cellular networks
need to soon migrate towards ultra-dense networks. However, network
densification comes with a host of challenges that include compromised energy
efficiency, complex interference management, cumbersome mobility management,
burdensome signaling overheads and higher backhaul costs. Interestingly, most
of the problems, that beleaguer network densification, stem from legacy
networks' one common feature i.e., tight coupling between the control and data
planes regardless of their degree of heterogeneity and cell density.
Consequently, in wake of 5G, control and data planes separation architecture
(SARC) has recently been conceived as a promising paradigm that has potential
to address most of aforementioned challenges. In this article, we review
various proposals that have been presented in literature so far to enable SARC.
More specifically, we analyze how and to what degree various SARC proposals
address the four main challenges in network densification namely: energy
efficiency, system level capacity maximization, interference management and
mobility management. We then focus on two salient features of future cellular
networks that have not yet been adapted in legacy networks at wide scale and
thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and
device-to-device (D2D) communications. After providing necessary background on
CoMP and D2D, we analyze how SARC can particularly act as a major enabler for
CoMP and D2D in context of 5G. This article thus serves as both a tutorial as
well as an up to date survey on SARC, CoMP and D2D. Most importantly, the
article provides an extensive outlook of challenges and opportunities that lie
at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201
Cost-Effective Cache Deployment in Mobile Heterogeneous Networks
This paper investigates one of the fundamental issues in cache-enabled
heterogeneous networks (HetNets): how many cache instances should be deployed
at different base stations, in order to provide guaranteed service in a
cost-effective manner. Specifically, we consider two-tier HetNets with
hierarchical caching, where the most popular files are cached at small cell
base stations (SBSs) while the less popular ones are cached at macro base
stations (MBSs). For a given network cache deployment budget, the cache sizes
for MBSs and SBSs are optimized to maximize network capacity while satisfying
the file transmission rate requirements. As cache sizes of MBSs and SBSs affect
the traffic load distribution, inter-tier traffic steering is also employed for
load balancing. Based on stochastic geometry analysis, the optimal cache sizes
for MBSs and SBSs are obtained, which are threshold-based with respect to cache
budget in the networks constrained by SBS backhauls. Simulation results are
provided to evaluate the proposed schemes and demonstrate the applications in
cost-effective network deployment
Throughput Maximization for Mobile Relaying Systems
This paper studies a novel mobile relaying technique, where relays of high
mobility are employed to assist the communications from source to destination.
By exploiting the predictable channel variations introduced by relay mobility,
we study the throughput maximization problem in a mobile relaying system via
dynamic rate and power allocations at the source and relay. An optimization
problem is formulated for a finite time horizon, subject to an
information-causality constraint, which results from the data buffering
employed at the relay. It is found that the optimal power allocations across
the different time slots follow a "stair-case" water filling (WF) structure,
with non-increasing and non-decreasing water levels at the source and relay,
respectively. For the special case where the relay moves unidirectionally from
source to destination, the optimal power allocations reduce to the conventional
WF with constant water levels. Numerical results show that with appropriate
trajectory design, mobile relaying is able to achieve tremendous throughput
gain over the conventional static relaying.Comment: submitted for possible conference publicatio
- …