1,194 research outputs found
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Joint Head Selection and Airtime Allocation for Data Dissemination in Mobile Social Networks
Mobile social networks (MSNs) enable people with similar interests to
interact without Internet access. By forming a temporary group, users can
disseminate their data to other interested users in proximity with short-range
communication technologies. However, due to user mobility, airtime available
for users in the same group to disseminate data is limited. In addition, for
practical consideration, a star network topology among users in the group is
expected. For the former, unfair airtime allocation among the users will
undermine their willingness to participate in MSNs. For the latter, a group
head is required to connect other users. These two problems have to be properly
addressed to enable real implementation and adoption of MSNs. To this aim, we
propose a Nash bargaining-based joint head selection and airtime allocation
scheme for data dissemination within the group. Specifically, the bargaining
game of joint head selection and airtime allocation is first formulated. Then,
Nash bargaining solution (NBS) based optimization problems are proposed for a
homogeneous case and a more general heterogeneous case. For both cases, the
existence of solution to the optimization problem is proved, which guarantees
Pareto optimality and proportional fairness. Next, an algorithm, allowing
distributed implementation, for join head selection and airtime allocation is
introduced. Finally, numerical results are presented to evaluate the
performance, validate intuitions and derive insights of the proposed scheme
Cooperative Precoding/Resource Allocation Games under Spectral Mask and Total Power Constraints
The use of orthogonal signaling schemes such as time-, frequency-, or
code-division multiplexing (T-, F-, CDM) in multi-user systems allows for
power-efficient simple receivers. It is shown in this paper that by using
orthogonal signaling on frequency selective fading channels, the cooperative
Nash bargaining (NB)-based precoding games for multi-user systems, which aim at
maximizing the information rates of all users, are simplified to the
corresponding cooperative resource allocation games. The latter provides
additional practically desired simplifications to transmitter design and
significantly reduces the overhead during user cooperation. The complexity of
the corresponding precoding/resource allocation games, however, depends on the
constraints imposed on the users. If only spectral mask constraints are
present, the corresponding cooperative NB problem can be formulated as a convex
optimization problem and solved efficiently in a distributed manner using dual
decomposition based algorithm. However, the NB problem is non-convex if total
power constraints are also imposed on the users. In this case, the complexity
associate with finding the NB solution is unacceptably high. Therefore, the
multi-user systems are categorized into bandwidth- and power-dominant based on
a bottleneck resource, and different manners of cooperation are developed for
each type of systems for the case of two-users. Such classification guarantees
that the solution obtained in each case is Pareto-optimal and actually can be
identical to the optimal solution, while the complexity is significantly
reduced. Simulation results demonstrate the efficiency of the proposed
cooperative precoding/resource allocation strategies and the reduced complexity
of the proposed algorithms.Comment: 33 pages, 8 figures, Submitted to the IEEE Trans. Signal Processing
in Oct. 200
Review on Radio Resource Allocation Optimization in LTE/LTE-Advanced using Game Theory
Recently, there has been a growing trend toward ap-plying game theory (GT) to various engineering fields in order to solve optimization problems with different competing entities/con-tributors/players. Researches in the fourth generation (4G) wireless network field also exploited this advanced theory to overcome long term evolution (LTE) challenges such as resource allocation, which is one of the most important research topics. In fact, an efficient de-sign of resource allocation schemes is the key to higher performance. However, the standard does not specify the optimization approach to execute the radio resource management and therefore it was left open for studies. This paper presents a survey of the existing game theory based solution for 4G-LTE radio resource allocation problem and its optimization
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
- …