49,515 research outputs found
Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks
In this paper, we study the problem of cooperative interference management in
an OFDMA two-tier small cell network. In particular, we propose a novel
approach for allowing the small cells to cooperate, so as to optimize their
sum-rate, while cooperatively satisfying their maximum transmit power
constraints. Unlike existing work which assumes that only disjoint groups of
cooperative small cells can emerge, we formulate the small cells' cooperation
problem as a coalition formation game with overlapping coalitions. In this
game, each small cell base station can choose to participate in one or more
cooperative groups (or coalitions) simultaneously, so as to optimize the
tradeoff between the benefits and costs associated with cooperation. We study
the properties of the proposed overlapping coalition formation game and we show
that it exhibits negative externalities due to interference. Then, we propose a
novel decentralized algorithm that allows the small cell base stations to
interact and self-organize into a stable overlapping coalitional structure.
Simulation results show that the proposed algorithm results in a notable
performance advantage in terms of the total system sum-rate, relative to the
noncooperative case and the classical algorithms for coalitional games with
non-overlapping coalitions
Socially Trusted Collaborative Edge Computing in Ultra Dense Networks
Small cell base stations (SBSs) endowed with cloud-like computing
capabilities are considered as a key enabler of edge computing (EC), which
provides ultra-low latency and location-awareness for a variety of emerging
mobile applications and the Internet of Things. However, due to the limited
computation resources of an individual SBS, providing computation services of
high quality to its users faces significant challenges when it is overloaded
with an excessive amount of computation workload. In this paper, we propose
collaborative edge computing among SBSs by forming SBS coalitions to share
computation resources with each other, thereby accommodating more computation
workload in the edge system and reducing reliance on the remote cloud. A novel
SBS coalition formation algorithm is developed based on the coalitional game
theory to cope with various new challenges in small-cell-based edge systems,
including the co-provisioning of radio access and computing services,
cooperation incentives, and potential security risks. To address these
challenges, the proposed method (1) allows collaboration at both the user-SBS
association stage and the SBS peer offloading stage by exploiting the ultra
dense deployment of SBSs, (2) develops a payment-based incentive mechanism that
implements proportionally fair utility division to form stable SBS coalitions,
and (3) builds a social trust network for managing security risks among SBSs
due to collaboration. Systematic simulations in practical scenarios are carried
out to evaluate the efficacy and performance of the proposed method, which
shows that tremendous edge computing performance improvement can be achieved.Comment: arXiv admin note: text overlap with arXiv:1010.4501 by other author
Recommended from our members
Diffusion of shared goods in consumer coalitions. An agent-based model
This paper focuses on the process of coalition formation conditioning the common decision to adopt a shared good, which cannot be afforded by an average single consumer and whose use cannot be exhausted by any single consumer. An agent based model is developed to study the interplay between these two processes: coalition formation and diffusion of shared goods. Coalition formation is modelled in an evolutionary game theoretic setting, while adoption uses elements from both the Bass and the threshold models. Coalitions formation sets the conditions for adoption, while diffusion influences the consequent formation of coalitions. Results show that both coalitions and diffusion are subject to network effects and have an impact on the information flow though the population of consumers. Large coalitions are preferred over small ones since individual cost is lower, although it increases if higher quantities are purchased collectively. The paper concludes by connecting the model conceptualisation to the on-going discussion of diffusion of sustainable goods, discussing related policy implications
Improving the Scalability of a Prosumer Cooperative Game with K-Means Clustering
Among the various market structures under peer-to-peer energy sharing, one
model based on cooperative game theory provides clear incentives for prosumers
to collaboratively schedule their energy resources. The computational
complexity of this model, however, increases exponentially with the number of
participants. To address this issue, this paper proposes the application of
K-means clustering to the energy profiles following the grand coalition
optimization. The cooperative model is run with the "clustered players" to
compute their payoff allocations, which are then further distributed among the
prosumers within each cluster. Case studies show that the proposed method can
significantly improve the scalability of the cooperative scheme while
maintaining a high level of financial incentives for the prosumers.Comment: 6 pages, 4 figures, 2 tables. Accepted to the 13th IEEE PES PowerTech
Conference, 23-27 June 2019, Milano, Ital
Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication
Device-to-device (D2D) communication underlaying cellular networks allows
mobile devices such as smartphones and tablets to use the licensed spectrum
allocated to cellular services for direct peer-to-peer transmission. D2D
communication can use either one-hop transmission (i.e., in D2D direct
communication) or multi-hop cluster-based transmission (i.e., in D2D local area
networks). The D2D devices can compete or cooperate with each other to reuse
the radio resources in D2D networks. Therefore, resource allocation and access
for D2D communication can be treated as games. The theories behind these games
provide a variety of mathematical tools to effectively model and analyze the
individual or group behaviors of D2D users. In addition, game models can
provide distributed solutions to the resource allocation problems for D2D
communication. The aim of this article is to demonstrate the applications of
game-theoretic models to study the radio resource allocation issues in D2D
communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201
Controlled Matching Game for Resource Allocation and User Association in WLANs
In multi-rate IEEE 802.11 WLANs, the traditional user association based on
the strongest received signal and the well known anomaly of the MAC protocol
can lead to overloaded Access Points (APs), and poor or heterogeneous
performance. Our goal is to propose an alternative game-theoretic approach for
association. We model the joint resource allocation and user association as a
matching game with complementarities and peer effects consisting of selfish
players solely interested in their individual throughputs. Using recent
game-theoretic results we first show that various resource sharing protocols
actually fall in the scope of the set of stability-inducing resource allocation
schemes. The game makes an extensive use of the Nash bargaining and some of its
related properties that allow to control the incentives of the players. We show
that the proposed mechanism can greatly improve the efficiency of 802.11 with
heterogeneous nodes and reduce the negative impact of peer effects such as its
MAC anomaly. The mechanism can be implemented as a virtual connectivity
management layer to achieve efficient APs-user associations without
modification of the MAC layer
Market Efficiency and Coalition Structures
We consider a three-stage game in which symmetric firms decide whether to invest in a cost-reducing technology, then they have the possibility to merge (forming coalitions), and eventually, in the third stage, a Cournot oligopoly game is played by the resulting firms (coalitions). We show that, contrary to the existing literature, the monopoly market structure may fail to form even when the number of initial firms is just three. We then introduce a weighted sharing rule and show that a situation in which all firms acquire the cost-reducing asset cannot be sustained as a Subgame Perfect Equilibrium.
Hierarchical Cooperation for Operator-Controlled Device-to-Device Communications: A Layered Coalitional Game Approach
Device-to-Device (D2D) communications, which allow direct communication among
mobile devices, have been proposed as an enabler of local services in 3GPP
LTE-Advanced (LTE-A) cellular networks. This work investigates a hierarchical
LTE-A network framework consisting of multiple D2D operators at the upper layer
and a group of devices at the lower layer. We propose a cooperative model that
allows the operators to improve their utility in terms of revenue by sharing
their devices, and the devices to improve their payoff in terms of end-to-end
throughput by collaboratively performing multi-path routing. To help
understanding the interaction among operators and devices, we present a
game-theoretic framework to model the cooperation behavior, and further, we
propose a layered coalitional game (LCG) to address the decision making
problems among them. Specifically, the cooperation of operators is modeled as
an overlapping coalition formation game (CFG) in a partition form, in which
operators should form a stable coalitional structure. Moreover, the cooperation
of devices is modeled as a coalitional graphical game (CGG), in which devices
establish links among each other to form a stable network structure for
multi-path routing.We adopt the extended recursive core, and Nash network, as
the stability concept for the proposed CFG and CGG, respectively. Numerical
results demonstrate that the proposed LCG yields notable gains compared to both
the non-cooperative case and a LCG variant and achieves good convergence speed.Comment: IEEE Wireless Communications and Networking Conference 201
- âŠ