523 research outputs found
Spatial Interference Cancelation for Mobile Ad Hoc Networks: Perfect CSI
Interference between nodes directly limits the capacity of mobile ad hoc
networks. This paper focuses on spatial interference cancelation with perfect
channel state information (CSI), and analyzes the corresponding network
capacity. Specifically, by using multiple antennas, zero-forcing beamforming is
applied at each receiver for canceling the strongest interferers. Given spatial
interference cancelation, the network transmission capacity is analyzed in this
paper, which is defined as the maximum transmitting node density under
constraints on outage and the signal-to-interference-noise ratio. Assuming the
Poisson distribution for the locations of network nodes and spatially i.i.d.
Rayleigh fading channels, mathematical tools from stochastic geometry are
applied for deriving scaling laws for transmission capacity. Specifically, for
small target outage probability, transmission capacity is proved to increase
following a power law, where the exponent is the inverse of the size of antenna
array or larger depending on the pass loss exponent. As shown by simulations,
spatial interference cancelation increases transmission capacity by an order of
magnitude or more even if only one extra antenna is added to each node.Comment: 6 pages; submitted to IEEE Globecom 200
Coexistence of RF-powered IoT and a Primary Wireless Network with Secrecy Guard Zones
This paper studies the secrecy performance of a wireless network (primary
network) overlaid with an ambient RF energy harvesting IoT network (secondary
network). The nodes in the secondary network are assumed to be solely powered
by ambient RF energy harvested from the transmissions of the primary network.
We assume that the secondary nodes can eavesdrop on the primary transmissions
due to which the primary network uses secrecy guard zones. The primary
transmitter goes silent if any secondary receiver is detected within its guard
zone. Using tools from stochastic geometry, we derive the probability of
successful connection of the primary network as well as the probability of
secure communication. Two conditions must be jointly satisfied in order to
ensure successful connection: (i) the SINR at the primary receiver is above a
predefined threshold, and (ii) the primary transmitter is not silent. In order
to ensure secure communication, the SINR value at each of the secondary nodes
should be less than a predefined threshold. Clearly, when more secondary nodes
are deployed, more primary transmitters will remain silent for a given guard
zone radius, thus impacting the amount of energy harvested by the secondary
network. Our results concretely show the existence of an optimal deployment
density for the secondary network that maximizes the density of nodes that are
able to harvest sufficient amount of energy. Furthermore, we show the
dependence of this optimal deployment density on the guard zone radius of the
primary network. In addition, we show that the optimal guard zone radius
selected by the primary network is a function of the deployment density of the
secondary network. This interesting coupling between the two networks is
studied using tools from game theory. Overall, this work is one of the few
concrete works that symbiotically merge tools from stochastic geometry and game
theory
A Novel Network NOMA Scheme for Downlink Coordinated Three-Point Systems
In this paper, we propose a network non-orthogonal multiple access (N-NOMA)
technique for the downlink coordinated multipoint (CoMP) communication scenario
of a cellular network, with randomly deployed users. In the considered N-NOMA
scheme, superposition coding (SC) is employed to serve cell-edge users as well
as users close to base stations (BSs) simultaneously, and distributed analog
beamforming by the BSs to meet the cell-edge user's quality of service (QoS)
requirements. The combination of SC and distributed analog beamforming
significantly complicates the expressions for the
signal-to-interference-plus-noise ratio (SINR) at the reveiver, which makes the
performance analysis particularly challenging. However, by using rational
approximations, insightful analytical results are obtained in order to
characterize the outage performance of the considered N-NOMA scheme. Computer
simulation results are provided to show the superior performance of the
proposed scheme as well as to demonstrate the accuracy of the analytical
results
Cooperative Secure Transmission by Exploiting Social Ties in Random Networks
Social awareness and social ties are becoming increasingly popular with
emerging mobile and handheld devices. Social trust degree describing the
strength of the social ties has drawn lots of research interests in many fields
in wireless communications, such as resource sharing, cooperative communication
and so on. In this paper, we propose a hybrid cooperative beamforming and
jamming scheme to secure communication based on the social trust degree under a
stochastic geometry framework. The friendly nodes are categorized into relays
and jammers according to their locations and social trust degrees with the
source node. We aim to analyze the involved connection outage probability (COP)
and secrecy outage probability (SOP) of the performance in the networks. To
achieve this target, we propose a double Gamma ratio (DGR) approach through
Gamma approximation. Based on this, the COP and SOP are tractably obtained in
closed-form. We further consider the SOP in the presence of Poisson Point
Process (PPP) distributed eavesdroppers and derive an upper bound. The
simulation results verify our theoretical findings, and validate that the
social trust degree has dramatic influences on the security performance in the
networks.Comment: 30 pages, 11 figures, to be published in IEEE Transactions on
Communication
- …