4,224 research outputs found
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
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
Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks
The problem of distributed rate maximization in multi-channel ALOHA networks
is considered. First, we study the problem of constrained distributed rate
maximization, where user rates are subject to total transmission probability
constraints. We propose a best-response algorithm, where each user updates its
strategy to increase its rate according to the channel state information and
the current channel utilization. We prove the convergence of the algorithm to a
Nash equilibrium in both homogeneous and heterogeneous networks using the
theory of potential games. The performance of the best-response dynamic is
analyzed and compared to a simple transmission scheme, where users transmit
over the channel with the highest collision-free utility. Then, we consider the
case where users are not restricted by transmission probability constraints.
Distributed rate maximization under uncertainty is considered to achieve both
efficiency and fairness among users. We propose a distributed scheme where
users adjust their transmission probability to maximize their rates according
to the current network state, while maintaining the desired load on the
channels. We show that our approach plays an important role in achieving the
Nash bargaining solution among users. Sequential and parallel algorithms are
proposed to achieve the target solution in a distributed manner. The
efficiencies of the algorithms are demonstrated through both theoretical and
simulation results.Comment: 34 pages, 6 figures, accepted for publication in the IEEE/ACM
Transactions on Networking, part of this work was presented at IEEE CAMSAP
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
Price-Based Resource Allocation for Spectrum-Sharing Femtocell Networks: A Stackelberg Game Approach
This paper investigates the price-based resource allocation strategies for
the uplink transmission of a spectrum-sharing femtocell network, in which a
central macrocell is underlaid with distributed femtocells, all operating over
the same frequency band as the macrocell. Assuming that the macrocell base
station (MBS) protects itself by pricing the interference from the femtocell
users, a Stackelberg game is formulated to study the joint utility maximization
of the macrocell and the femtocells subject to a maximum tolerable interference
power constraint at the MBS. Especially, two practical femtocell channel
models: sparsely deployed scenario for rural areas and densely deployed
scenario for urban areas, are investigated. For each scenario, two pricing
schemes: uniform pricing and non-uniform pricing, are proposed. Then, the
Stackelberg equilibriums for these proposed games are studied, and an effective
distributed interference price bargaining algorithm with guaranteed convergence
is proposed for the uniform-pricing case. Finally, numerical examples are
presented to verify the proposed studies. It is shown that the proposed
algorithms are effective in resource allocation and macrocell protection
requiring minimal network overhead for spectrum-sharing-based two-tier
femtocell networks.Comment: 27 pages, 7 figures, Submitted to JSA
- …