476 research outputs found
Cooperative Relaying in Wireless Networks under Spatially and Temporally Correlated Interference
We analyze the performance of an interference-limited, decode-and-forward,
cooperative relaying system that comprises a source, a destination, and
relays, placed arbitrarily on the plane and suffering from interference by a
set of interferers placed according to a spatial Poisson process. In each
transmission attempt, first the transmitter sends a packet; subsequently, a
single one of the relays that received the packet correctly, if such a relay
exists, retransmits it. We consider both selection combining and maximal ratio
combining at the destination, Rayleigh fading, and interferer mobility.
We derive expressions for the probability that a single transmission attempt
is successful, as well as for the distribution of the transmission attempts
until a packet is transmitted successfully. Results provide design guidelines
applicable to a wide range of systems. Overall, the temporal and spatial
characteristics of the interference play a significant role in shaping the
system performance. Maximal ratio combining is only helpful when relays are
close to the destination; in harsh environments, having many relays is
especially helpful, and relay placement is critical; the performance improves
when interferer mobility increases; and a tradeoff exists between energy
efficiency and throughput
On Modeling Heterogeneous Wireless Networks Using Non-Poisson Point Processes
Future wireless networks are required to support 1000 times higher data rate,
than the current LTE standard. In order to meet the ever increasing demand, it
is inevitable that, future wireless networks will have to develop seamless
interconnection between multiple technologies. A manifestation of this idea is
the collaboration among different types of network tiers such as macro and
small cells, leading to the so-called heterogeneous networks (HetNets).
Researchers have used stochastic geometry to analyze such networks and
understand their real potential. Unsurprisingly, it has been revealed that
interference has a detrimental effect on performance, especially if not modeled
properly. Interference can be correlated in space and/or time, which has been
overlooked in the past. For instance, it is normally assumed that the nodes are
located completely independent of each other and follow a homogeneous Poisson
point process (PPP), which is not necessarily true in real networks since the
node locations are spatially dependent. In addition, the interference
correlation created by correlated stochastic processes has mostly been ignored.
To this end, we take a different approach in modeling the interference where we
use non-PPP, as well as we study the impact of spatial and temporal correlation
on the performance of HetNets. To illustrate the impact of correlation on
performance, we consider three case studies from real-life scenarios.
Specifically, we use massive multiple-input multiple-output (MIMO) to
understand the impact of spatial correlation; we use the random medium access
protocol to examine the temporal correlation; and we use cooperative relay
networks to illustrate the spatial-temporal correlation. We present several
numerical examples through which we demonstrate the impact of various
correlation types on the performance of HetNets.Comment: Submitted to IEEE Communications Magazin
Packet Travel Times in Wireless Relay Chains under Spatially and Temporally Dependent Interference
We investigate the statistics of the number of time slots that it takes a
packet to travel through a chain of wireless relays. Derivations are performed
assuming an interference model for which interference possesses spatiotemporal
dependency properties. When using this model, results are harder to arrive at
analytically, but they are more realistic than the ones obtained in many
related works that are based on independent interference models.
First, we present a method for calculating the distribution of . As the
required computations are extensive, we also obtain simple expressions for the
expected value and variance . Finally, we
calculate the asymptotic limit of the average speed of the packet. Our
numerical results show that spatiotemporal dependence has a significant impact
on the statistics of the travel time . In particular, we show that, with
respect to the independent interference case, and
increase, whereas the packet speed decreases
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks
In this paper, we propose a novel single-group multicasting relay beamforming
scheme. We assume a source that transmits common messages via multiple
amplify-and-forward relays to multiple destinations. To increase the number of
degrees of freedom in the beamforming design, the relays process two received
signals jointly and transmit the Alamouti space-time block code over two
different beams. Furthermore, in contrast to the existing relay multicasting
scheme of the literature, we take into account the direct links from the source
to the destinations. We aim to maximize the lowest received quality-of-service
by choosing the proper relay weights and the ideal distribution of the power
resources in the network. To solve the corresponding optimization problem, we
propose an iterative algorithm which solves sequences of convex approximations
of the original non-convex optimization problem. Simulation results demonstrate
significant performance improvements of the proposed methods as compared with
the existing relay multicasting scheme of the literature and an algorithm based
on the popular semidefinite relaxation technique
- …