Distributed topology control in ad-hoc networks: a game theoretic perspective

Komali, Ramakant S.; MacKenzie, Allen B.

doi:10.1109/ccnc.2006.1593087

Cited by 47 publications

(40 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, requiring the structure of potential games enforces additional constraints on utility and learning design, but also deconstrains at a higher level by allowing modularization. Though this layered architecture was not explicitly used in prior work, the modularization provided by potential games underlies many successful examples of game-theoretic control [9,23,30,38]. The change in perspective provided by this architectural view is not simply superficial; it highlights that the utility and learning designs in these papers can be 'mixed and matched' while still obtaining the same performance.…”

Section: A Layered Architecturementioning

confidence: 99%

“…We focus on potential games because many recent applications of game-theoretic control have relied on potential games, e.g., [9,23,30,38]. A key reason that potential games are a powerful choice for the interface is that they are a highly studied class of games in the economics literature, e.g., [16,42,52,59,66] and so there is a large literature of results that can be used in the context of game-theoretic control for both utility and learning design.…”

Section: Layering Via Potential Gamesmentioning

confidence: 99%

See 1 more Smart Citation

An architectural view of game theoretic control

Gopalakrishnan

Marden

Wierman

2011

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

Resource allocation has long been a fundamental research problem across several disciplines. While traditional approaches to this problem were centralized, recent research has focussed on distributed solutions for resource allocation, for reasons of scalability, reliability and efficiency in many realworld applications. Game-theoretic control is a promising new approach for distributed resource allocation. In this thesis, we describe how game-theoretic control can be viewed as having an intrinsic layered architecture, which provides a modularization that simplifies the control design.We illustrate this architectural view by presenting details about one particular instantiation using potential games as an interface. This example serves to highlight the strengths and limitations of the proposed architecture while also illustrating the relationship between game-theoretic control and other existing approaches to distributed resource allocation. We also demonstrate the power of this approach by reformulating the power control problem in sensor networks as a game-theoretic control problem in the potential games instantiation of our framework. This allows us to relax several assumptions made by previous contributions, and consider more complex objective functions. vi Contents Acknowledgements ivAbstract v

show abstract

Section: A Layered Architecturementioning

confidence: 99%

Section: Layering Via Potential Gamesmentioning

confidence: 99%

An architectural view of game theoretic control

Gopalakrishnan

Marden

Wierman

2011

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

show abstract

“…The problem of designing communication topology has been studied in the area of sensor networks where the goal is to minimize the sensors' power consumption while maintaining the connectivity of the network, e.g. in [9].…”

Section: Introductionmentioning

confidence: 99%

Communication topology design for large-scale interconnected systems with time delay

Gusrialdi

Hirche

2011

Proceedings of the 2011 American Control Conference

View full text Add to dashboard Cite

Abstract-Communication networks provide a larger flexibility with respect to the control design of large-scale interconnected systems by allowing the information exchange between the local controllers of the subsystems. The use of communication networks comes, however, at the price of nonideal signal tranmission such as time delay which is a source of instability and deteriorates the control performance. This paper introduces an approach for the design of the communication topology for the distributed control of large-scale interconnected systems in order to optimize the whole system's performance in the presence of constant time delay. First, a decentralized control law that stabilizes the overall interconnected system is designed. Then the performance is improved by designing the distributed control law, i.e. allowing the controller of the subsystems to exchange information, by considering the time delay in the networks. As a novelty in this paper, the design of the communication topology between the controllers is also considered. The problem is formulated as a mixed-integer optimization problem. Furthermore, a method based on matrix perturbation theory is discussed to design the topology which also captures the relation between the time delay, controller gain and performance of the overall system. In addition, it is shown that the proposed strategy also guarantees the stability of the overall system under the permanent communication link failure. The results are validated through a numerical example.

show abstract

“…Non-cooperation game-Based topology control routing algorithm 1) TC [19]: In this algorithm, we assume each cluster head have the same initial transmission power and broadcast their remaining energy and ID message to the neighbor nodes. The neighbor nodes shall statistics received response message and calculates the average residual energy value after receiving the message.…”

Section: Non-cooperation Game-based Power Control Routing Algorithmentioning

confidence: 99%

Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks

Ren¹,

Peng²,

Lei³

et al. 2012

Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012)

View full text Add to dashboard Cite

Abstract-In wireless multi-hop networks, the quality of service provided by the system heavily depends on the cooperation between nodes. However, nodes are reluctant to cooperate with each other to save their limited resources. This tendency will put a limit on the application of the current wireless multi-hop networks. Therefore, game theory, which can analyze the strategic interactions among autonomous decision makers, becomes an ideal candidate to solve the above problem. In this paper, we first introduce the basic concept of game theory. Then, the game-theory-based routing algorithms for wireless multi-hop networks are investigated in detail and their characteristics are compared. Finally, we give the future research directions and concluding remarks.

show abstract

Distributed topology control in ad-hoc networks: a game theoretic perspective

Cited by 47 publications

References 16 publications

An architectural view of game theoretic control

An architectural view of game theoretic control

Communication topology design for large-scale interconnected systems with time delay

Game Theory-Based Routing Algorithms for Wireless Multi-hop Networks

Contact Info

Product

Resources

About