2,836 research outputs found
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
Maximum Throughput of a Secondary User Cooperating with an Energy-Aware Primary User
This paper proposes a cooperation protocol between a secondary user (SU) and
a primary user (PU) which dedicates a free frequency subband for the SU if
cooperation results in energy saving. Time is slotted and users are equipped
with buffers. Under the proposed protocol, the PU releases portion of its
bandwidth for secondary transmission. Moreover, it assigns a portion of the
time slot duration for the SU to relay primary packets and achieve a higher
successful packet reception probability at the primary receiver. We assume that
the PU has three states: idle, forward, and retransmission states. At each of
these states, the SU accesses the channel with adaptive transmission
parameters. The PU cooperates with the SU if and only if the achievable average
number of transmitted primary packets per joule is higher than the number of
transmitted packets per joule when it operates alone. The numerical results
show the beneficial gains of the proposed cooperative cognitive protocol.Comment: Accepted WiOpt 201
Introducing Hierarchy in Energy Games
In this work we introduce hierarchy in wireless networks that can be modeled
by a decentralized multiple access channel and for which energy-efficiency is
the main performance index. In these networks users are free to choose their
power control strategy to selfishly maximize their energy-efficiency.
Specifically, we introduce hierarchy in two different ways: 1. Assuming
single-user decoding at the receiver, we investigate a Stackelberg formulation
of the game where one user is the leader whereas the other users are assumed to
be able to react to the leader's decisions; 2. Assuming neither leader nor
followers among the users, we introduce hierarchy by assuming successive
interference cancellation at the receiver. It is shown that introducing a
certain degree of hierarchy in non-cooperative power control games not only
improves the individual energy efficiency of all the users but can also be a
way of insuring the existence of a non-saturated equilibrium and reaching a
desired trade-off between the global network performance at the equilibrium and
the requested amount of signaling. In this respect, the way of measuring the
global performance of an energy-efficient network is shown to be a critical
issue.Comment: Accepted for publication in IEEE Trans. on Wireless Communication
Distributed power control over interference channels using ACK/NACK feedback
In this work, we consider a network composed of several single-antenna
transmitter-receiver pairs in which each pair aims at selfishly minimizing the
power required to achieve a given signal-to-interference-plus-noise ratio. This
is obtained modeling the transmitter-receiver pairs as rational agents that
engage in a non-cooperative game. Capitalizing on the well-known results on the
existence and structure of the generalized Nash equilibrium (GNE) point of the
underlying game, a low complexity, iterative and distributed algorithm is
derived to let each terminal reach the GNE using only a limited feedback in the
form of link-layer acknowledgement (ACK) or negative acknowledgement (NACK).
Numerical results are used to prove that the proposed solution is able to
achieve convergence in a scalable and adaptive manner under different operating
conditions.Comment: 5 pages, 6 figures, IEEE Global Communications Conference (GLOBECOM),
Austin, Texas, Dec. 201
Energy Efficiency in MIMO Underlay and Overlay Device-to-Device Communications and Cognitive Radio Systems
This paper addresses the problem of resource allocation for systems in which
a primary and a secondary link share the available spectrum by an underlay or
overlay approach. After observing that such a scenario models both cognitive
radio and D2D communications, we formulate the problem as the maximization of
the secondary energy efficiency subject to a minimum rate requirement for the
primary user. This leads to challenging non-convex, fractional problems. In the
underlay scenario, we obtain the global solution by means of a suitable
reformulation. In the overlay scenario, two algorithms are proposed. The first
one yields a resource allocation fulfilling the first-order optimality
conditions of the resource allocation problem, by solving a sequence of easier
fractional problems. The second one enjoys a weaker optimality claim, but an
even lower computational complexity. Numerical results demonstrate the merits
of the proposed algorithms both in terms of energy-efficient performance and
complexity, also showing that the two proposed algorithms for the overlay
scenario perform very similarly, despite the different complexity.Comment: to appear in IEEE Transactions on Signal Processin
Non-cooperative Feedback Rate Control Game for Channel State Information in Wireless Networks
It has been well recognized that channel state information (CSI) feedback is
of great importance for dowlink transmissions of closed-loop wireless networks.
However, the existing work typically researched the CSI feedback problem for
each individual mobile station (MS), and thus, cannot efficiently model the
interactions among self-interested mobile users in the network level. To this
end, in this paper, we propose an alternative approach to investigate the CSI
feedback rate control problem in the analytical setting of a game theoretic
framework, in which a multiple-antenna base station (BS) communicates with a
number of co-channel MSs through linear precoder. Specifically, we first
present a non-cooperative feedback-rate control game (NFC), in which each MS
selects the feedback rate to maximize its performance in a distributed way. To
improve efficiency from a social optimum point of view, we then introduce
pricing, called the non-cooperative feedback-rate control game with price
(NFCP). The game utility is defined as the performance gain by CSI feedback
minus the price as a linear function of the CSI feedback rate. The existence of
the Nash equilibrium of such games is investigated, and two types of feedback
protocols (FDMA and CSMA) are studied. Simulation results show that by
adjusting the pricing factor, the distributed NFCP game results in close
optimal performance compared with that of the centralized scheme.Comment: 26 pages, 10 figures; IEEE Journal on Selected Areas in
Communications, special issue on Game Theory in Wireless Communications, 201
- …