4,660 research outputs found
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in
the limit of a large number of nodes. A random connections model is assumed in
which the channel connections between the nodes are drawn independently from a
common distribution. Transmitting nodes are subject to an on-off strategy, and
receiving nodes employ conventional single-user decoding. The following results
are proven:
1) For a class of connection models with finite mean and variance, the
throughput scaling is upper-bounded by for single-hop schemes, and
for two-hop (and multihop) schemes.
2) The throughput scaling is achievable for a specific
connection model by a two-hop opportunistic relaying scheme, which employs
full, but only local channel state information (CSI) at the receivers, and
partial CSI at the transmitters.
3) By relaxing the constraints of finite mean and variance of the connection
model, linear throughput scaling is achievable with Pareto-type
fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information
Theor
Scaling Laws for Infrastructure Single and Multihop Wireless Networks in Wideband Regimes
With millimeter wave bands emerging as a strong candidate for 5G cellular
networks, next-generation systems may be in a unique position where spectrum is
plentiful. To assess the potential value of this spectrum, this paper derives
scaling laws on the per mobile downlink feasible rate with large bandwidth and
number of nodes, for both Infrastructure Single Hop (ISH) and Infrastructure
Multi-Hop (IMH) architectures. It is shown that, for both cases, there exist
\emph{critical bandwidth scalings} above which increasing the bandwidth no
longer increases the feasible rate per node. These critical thresholds coincide
exactly with the bandwidths where, for each architecture, the network
transitions from being degrees-of-freedom-limited to power-limited. For ISH,
this critical bandwidth threshold is lower than IMH when the number of users
per base station grows with network size. This result suggests that multi-hop
transmissions may be necessary to fully exploit large bandwidth degrees of
freedom in deployments with growing number of users per cell.Comment: 5 pages, 3 figure
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
- …