Access network synthesis game in next generation networks

Antoniou, Josephina; Koukoutsidis, Ioannis; Jaho, Eva; Pitsillides, Andreas; Stavrakakis, Ioannis

doi:10.1016/j.comnet.2009.06.006

Cited by 24 publications

(11 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As we have seen several works explore the formation of coalitions between service providers in order to share resources. In [53] the authors propose two cases for allocating the payoffs between the members of the coalitions. In the first case they propose the use of non-transferable payoffs meaning that the access network operators, members of the coalition, get a fixed payoff based on their resource contribution.…”

Section: Pricing and Billingmentioning

confidence: 99%

“…Some of the cooperative games in the literature explore the formation of coalitions between various networks' operators. In [53] the authors envision a unified environment where network operators would cooperate in order to combine and share their resources and provide global connectivity and transparency to the end-user. The individual access networks form a coalition and offer their available resources in return for some benefit, defined by a payoff function.…”

Section: Multi-operator and Multi-technologymentioning

confidence: 99%

“…Antoniou et al in [53] explore the formation of a coalition between individual access networks which is done based on the available resources and the payoffs' allocation method. The authors propose the use of two types of payoffs: transferable payoffs, where a network can transfer a certain amount from its own payoff to other members of the coalition, as long as its final payoff is greater than zero; and non-transferable payoffs which are the payoffs obtained for each member's resource contribution.…”

Section: Game Players: Network Vs Network 1) Network Vs Netwomentioning

confidence: 99%

“…Networks compete against each other in order to increase their individual revenue by employing different strategies, such as: offered prices [43] [44] [47], offered bandwidth [45], and service requests [46] [48] [49]. Most of the related works that explore the cooperation between networks look at the scenario in which a number of different access networks form coalitions [50] [51] [53] [54] in order to handle the service requests when a single access network cannot. In this scenario, the cooperation is built on the assumption that the wireless networks may cooperate either because their service demand overwhelms the network capacity or because they can reduce some of their cost by cooperation.…”

Section: A Cooperative or Non-cooperative Approachmentioning

confidence: 99%

See 3 more Smart Citations

Game Theory-Based Network Selection: Solutions and Challenges

Trestian

Ormond

Muntean

2012

IEEE Commun. Surv. Tutorials

212

114

View full text Add to dashboard Cite

In order to cater for the overwhelming growth in bandwidth demand from mobile Internet users operators have started to deploy different, overlapping radio access network technologies. One important challenge in such a heterogeneous wireless environment is to enable network selection mechanisms in order to keep the mobile users Always Best Connected (ABC) anywhere and anytime. Game theory techniques have been receiving growing attention in recent years as they can be adopted in order to model and understand competitive and cooperative scenarios between rational decision makers. This paper presents an overview of the network selection decision problem and challenges, a comprehensive classification of related game theoretic approaches and a discussion on the application of game theory to the network selection problem faced by the next generation of 4G wireless networks.

show abstract

Section: Pricing and Billingmentioning

confidence: 99%

Section: Multi-operator and Multi-technologymentioning

confidence: 99%

Section: Game Players: Network Vs Network 1) Network Vs Netwomentioning

confidence: 99%

Section: A Cooperative or Non-cooperative Approachmentioning

confidence: 99%

See 2 more Smart Citations

Game Theory-Based Network Selection: Solutions and Challenges

Trestian

Ormond

Muntean

2012

IEEE Commun. Surv. Tutorials

212

114

View full text Add to dashboard Cite

show abstract

“…In [29], the design of new coalition-based dynamics is investigated in the context of cognitive radio networks. In [30], a network synthesis game is studied, in which individual access networks with insufficient resources form coalitions in order to satisfy service demands. There, the Core [1] of the game is investigated for several payoff allocations among the players.…”

Section: B Previous Workmentioning

confidence: 99%

How good is bargained routing?

Blocq

Orda

2012

2012 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-In the context of networking, research has focused on non-cooperative games, where the selfish agents cannot reach a binding agreement on the way they would share the infrastructure. Many approaches have been proposed for mitigating the typically inefficient operating points. However, in a growing number of networking scenarios selfish agents are able to communicate and reach an agreement. Hence, the degradation of performance should be considered at an operating point of a cooperative game. Accordingly, our goal is to lay foundations for the application of cooperative game theory to fundamental problems in networking. We explain our choice of the Nash Bargaining Scheme (NBS) as the solution concept, and introduce the Price of Selfishness (PoS), which considers the degradation of performance at the worst NBS. We focus on the fundamental load balancing game of routing over parallel links. First, we consider agents with identical performance objectives. We show that, while the PoA here can be large, through bargaining, all agents, and the system, strictly improve their performance. Interestingly, in a two-agent system or when all agents have identical demands, we establish that they reach social optimality. We then consider agents with different performance objectives and demonstrate that the PoS and PoA can be unbounded, yet we explain why both measures are unsuitable. Accordingly, we introduce the Price of Heterogeneity (PoH), as an extension of the PoA. We establish an upper-bound on the PoH and indicate its further motivation for bargaining. Finally, we discuss network design guidelines that follow from our findings.

show abstract

A novel noncooperative game competing model using generalized simple additive weighting method to perform network selection in heterogeneous wireless networks

Salih

See

Ibrahim

et al. 2014

Int J Communication

View full text Add to dashboard Cite

SUMMARYNetwork selection mechanisms have a significant role in guaranteeing the QoS for users in a heterogeneous wireless networks environment. These mechanisms allow the selection of an optimal wireless network to satisfy the needs of users. Users are provided with the opportunity to select from multiple connectivity opportunities available all over various wireless networks. Furthermore, the network operators themselves can execute active selection strategies that facilitate proper decision making, in which user preferences are considered. This study proposes a new noncooperative competing game-theoretic model and strategy space based on user preference. This model can solve network selection problems and capture the inter-linkages of decisions taken by various networks. A generalized simple additive weighting method is incorporated into the framework of noncooperative game theory. In addition, the utility function is employed to assess the usefulness of the system. Simulation results and analysis illustrate the efficacy of the suggested model in attaining optimum network utility for heterogeneous wireless networks while optimizing user satisfaction.

show abstract

Access network synthesis game in next generation networks

Cited by 24 publications

References 3 publications

Game Theory-Based Network Selection: Solutions and Challenges

Game Theory-Based Network Selection: Solutions and Challenges

How good is bargained routing?

A novel noncooperative game competing model using generalized simple additive weighting method to perform network selection in heterogeneous wireless networks

Contact Info

Product

Resources

About