A game-theoretic approach to compute stable topologies in mobile ad hoc networks

DOI10.1093/LOGCOM/EXU021zbMATH Open1331.68022OpenAlexW2040097029MaRDI QIDQ5262478FDOQ5262478

Authors: Nils Bulling, Matei Popovici 

Publication date: 15 July 2015

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exu021

Recommendations

• A game theoretic approach for optimal network topologies in opportunistic networks
• Towards a game theoretic understanding of ad-hoc routing
• Double best response dynamics in topology formation game for ad hoc networks
• Game theory based construction efficient topology in wireless sensor networks
• Coalition Games and Resource Allocation in Ad-Hoc Networks
• Efficient graph topologies in network routing games

zbMATH Keywords

user constraintsgame theorystabilitynetwork structuremobile ad hoc networks

Mathematics Subject Classification ID

Applications of game theory (91A80) Network design and communication in computer systems (68M10)

Cited In (4)

• Towards a game theoretic understanding of ad-hoc routing
• Security modeling of an \textit{Ad hoc} network under the constraint of energy by an approach in two steps: clustering-evolutionary game
• A game theoretic approach for optimal network topologies in opportunistic networks
• Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm

This page was built for publication: A game-theoretic approach to compute stable topologies in mobile ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262478)