25,099 research outputs found
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
Unilateral Altruism in Network Routing Games with Atomic Players
We study a routing game in which one of the players unilaterally acts
altruistically by taking into consideration the latency cost of other players
as well as his own. By not playing selfishly, a player can not only improve the
other players' equilibrium utility but also improve his own equilibrium
utility. To quantify the effect, we define a metric called the Value of
Unilateral Altruism (VoU) to be the ratio of the equilibrium utility of the
altruistic user to the equilibrium utility he would have received in Nash
equilibrium if he were selfish. We show by example that the VoU, in a game with
nonlinear latency functions and atomic players, can be arbitrarily large. Since
the Nash equilibrium social welfare of this example is arbitrarily far from
social optimum, this example also has a Price of Anarchy (PoA) that is
unbounded. The example is driven by there being a small number of players since
the same example with non-atomic players yields a Nash equilibrium that is
fully efficient
An Efficient Requirement-Aware Attachment Policy for Future Millimeter Wave Vehicular Networks
The automotive industry is rapidly evolving towards connected and autonomous
vehicles, whose ever more stringent data traffic requirements might exceed the
capacity of traditional technologies for vehicular networks. In this scenario,
densely deploying millimeter wave (mmWave) base stations is a promising
approach to provide very high transmission speeds to the vehicles. However,
mmWave signals suffer from high path and penetration losses which might render
the communication unreliable and discontinuous. Coexistence between mmWave and
Long Term Evolution (LTE) communication systems has therefore been considered
to guarantee increased capacity and robustness through heterogeneous
networking. Following this rationale, we face the challenge of designing fair
and efficient attachment policies in heterogeneous vehicular networks.
Traditional methods based on received signal quality criteria lack
consideration of the vehicle's individual requirements and traffic demands, and
lead to suboptimal resource allocation across the network. In this paper we
propose a Quality-of-Service (QoS) aware attachment scheme which biases the
cell selection as a function of the vehicular service requirements, preventing
the overload of transmission links. Our simulations demonstrate that the
proposed strategy significantly improves the percentage of vehicles satisfying
application requirements and delivers efficient and fair association compared
to state-of-the-art schemes.Comment: 8 pages, 8 figures, 2 tables, accepted to the 30th IEEE Intelligent
Vehicles Symposiu
On Linear Congestion Games with Altruistic Social Context
We study the issues of existence and inefficiency of pure Nash equilibria in
linear congestion games with altruistic social context, in the spirit of the
model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a
framework, given a real matrix specifying a particular
social context, each player aims at optimizing a linear combination of the
payoffs of all the players in the game, where, for each player , the
multiplicative coefficient is given by the value . We give a broad
characterization of the social contexts for which pure Nash equilibria are
always guaranteed to exist and provide tight or almost tight bounds on their
prices of anarchy and stability. In some of the considered cases, our
achievements either improve or extend results previously known in the
literature
- …