Dense femtocell networks power self‐optimization: an exact potential game approach

Wang, Xidong; Zheng, Wei; Wen, Xiangming; Li, Wei

doi:10.1002/dac.2788

Cited by 22 publications

(14 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The evolutionary game theory is concerned with the interactions of its players and assumes that survival of a strategy in a population depends on the benefits achieved by its adherents. In addition, it provides a set of tools to model interactions between self‐interested agents that aim to maximize their gains and often have conflicting interests.…”

Section: Related Workmentioning

confidence: 99%

“…Unlike the traditional evolutionary game theory that allows learning new strategies and possibly converging on a dominant strategy, we aim to study the welfare of Internet entities. Such welfare or usage analysis is often used in research and we will use it to address some key research questions of this paper, besides revealing the development of welfare in the Internet. The welfare analysis will motivate an Internet that can more suitably act as a baseline for studying choices presented by the decision theory and rational choice, i.e.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Cooperation and end‐to‐end in the Internet

Kantola

Kabir

Loiseau

2017

Int J Communication

View full text Add to dashboard Cite

Summary This paper analyzes the motivation and strategies for ensuring cooperative behavior among hosts and customer networks in the Internet and 5G networks. The hypothesis is that better cooperation among the benevolent entities could improve the overall Internet welfare, motivating the need for adoption of cooperative security. However, in state of the art, the prevalent security approach in the Internet is based on self‐help, while the adoption of cooperative methods is progressing slowly. At the same time, the ubiquitous reliance on 5G and mission critical nature of some of the new services, for example, ultrareliable (machine‐to‐machine) communication and Internet of things, requires that 5G will do its best to curb the malicious (noncooperative) behavior from becoming a cause of failure to the legitimate services. In this paper, we relate our analysis of the conditions for sustainable cooperation in the Internet with the famous end‐to‐end principle, and present the hypothesis that there is no end‐to‐end solution to the problem of ensuring cooperation among Internet hosts. Game theory allows studying the outcomes of interactions among the players with conflicting interests. We use it to study the hypothesis and show that introducing the reputation of Internet nodes and customer networks can lead to cooperation, which improves the overall Internet welfare and reduces the payoffs of malicious actors. We study the possible response of noncooperative users with advanced defection strategies and the resulting outcomes. We argue that 5G shall make significant progress towards uprooting the selfish behavior and malicious activities using cooperation and relate it with motivation for providing ubiquitous connectivity and ultrareliable services. The paper concludes by summarizing our earlier work on the application of the proposed methods of cooperation to 5G and the Internet; outlining how cooperation in security is not only desirable but also feasible.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Cooperation and end‐to‐end in the Internet

Kantola

Kabir

Loiseau

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The joint transmission power and bandwidth assignment problem for relay networks was discussed in [3]. Primary-secondary scenario [49] and heterogeneous network scenario [101], [181], [204] were also discussed.…”

Section: Multi-channel Systemsmentioning

confidence: 99%

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Yamamoto

2015

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY Potential games form a class of non-cooperative games where the convergent of unilateral improvement dynamics is guaranteed 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. key words: potential game, game theory, radio resource management, channel assignment, transmission power control IntroductionThe broadcast nature of wireless transmissions causes cochannel interference and channel contention, which can be viewed as interactions among transceivers. Interactions among multiple decision makers can be formulated and analyzed using a branch of applied mathematics called game theory [61], [131]. Game-theoretic approaches have been applied to a wide range of wireless communication technologies, including transmission power control for code division multiple access (CDMA) cellular systems [153] and cognitive radios [132]. For a summary of game-theoretic approaches to wireless networks, we refer the interested reader to [68] [189].In this paper, we focus on potential games [126], which form a class of strategic form games with the following desirable properties:• The existence of a Nash equilibrium in potential games is guaranteed in many practical situations [126] (Theorems 1 and 2 in this paper), but is not guaranteed for general strategic form games. Example 2 in Sect. 2. We provide an overview of problems in wireless networks that can be formulated in terms of potential games. We also clarify the relations among games, and provide simpler proofs of some known results. Problem-specific learning algorithms [92], [168] are beyond the scope of this paper.The remainder of this paper is organized as follows: In Sect. 2, 3, and 4, we introduce strategic form games, potential games, and learning algorithms, respectively. We then discuss various potential games in Sects. 5 to 18, as shown in Table 1. Finally, we provide a few concluding remarks in Sect. 19.The notation used here is shown in Table 2. Unless the context indicates otherwise, sets of strategies are denoted by calligraphic uppercase letters, e.g., A i , strategies are denoted by lowercase letters, e.g., a i ∈ A i , and tuples of strategies are denoted by boldface lowercase letters, e.g., a. Note that a i is a scalar variable when A i is a set of scalars or indices, a i is a vector variable when A i is a set of vectors, and a i is a set variable when A i is a collection of sets.We use R to denote the set of real numbers, R + to denote the set of nonnegative real numbers, R ++ to denote the set of positive real numbers, and C to denote the set of complex numbers. The cardinality of set A is denoted by |A|. The power set of A is denoted by 2 A . Finally, ½condition is the indicator function, which is one when condition is true and is zero otherwise.We treat many sy...

show abstract

“…It is expected that FAPs would be widely deployed in the near future. Although femtocells can offload traffic from the macro stations and are crucial for next generation mobile communications, special challenges exist because of the randomness of their locations [4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Analysis of accessing to the nearest and to the strongest base station in femtocell networks

Zhang

Liu

Shi

2014

Int J Communication

View full text Add to dashboard Cite

SUMMARYThe deployment of femtocells can effectively improve the capacity of cellular networks without significant increase in the network management costs. Femtocell base stations are usually installed by users, which poses unique challenges for future mobile communication standards. The randomness of the locations of femtocells brings us many difficulties to analyze and compare. In this paper, we explore the performance on two different access methods under Rayleigh fading channel: accessing to the nearest and accessing to the strongest femtocell base station. Two performance indexes are of most interest in this paper: how the different path loss exponents and femtocell densities affect the difference of performance between the two different access methods. In the first part of this paper, the distributions of received strength for both access methods are achieved, in which we elaborate the characteristics of received signal strength including the cumulative distribution and the median signal strength. In the second part, we explore the characteristic of SINR distribution, which can be interpreted as the probability of coverage. This paper provides detailed illustrations about how performance changes for these two different access methods under Rayleigh fading channel. All results are mathematically tractable.

show abstract

Dense femtocell networks power self‐optimization: an exact potential game approach

Cited by 22 publications

References 23 publications

Cooperation and end‐to‐end in the Internet

Cooperation and end‐to‐end in the Internet

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Analysis of accessing to the nearest and to the strongest base station in femtocell networks

Contact Info

Product

Resources

About