Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Introduction to Algorithms
Selfish routing
Proceedings of the 9th annual international conference on Mobile computing and networking
A combinational perspective in stimulating cooperation in mobile ad hoc networks
Journal of Computer Science and Technology
Energy-efficient topology control in wireless ad hoc networks with selfish nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In autonomous networks, cooperations among nodes cannot be assumed, since each node is capable of making independent decisions based on their personal preferences. In particular, when a node needs the help of intermediate nodes to relay messages to other nodes, these intermediaries may be reluctant to contribute their network resource for the benefit of others. Ideally, the right amount of incentives should be provided to motivate cooperations among autonomous nodes so that a mutually beneficial network results. In this paper, we leverage the power of mechanism design in microeconomics to design a distributed incentive mechanism that motivates each node towards a more desirable network topology. Since network parameters and constraints change dynamically in reality, the desirable topology can vary over time. Our solution presented in this paper has successfully encompassed such a dynamic nature of the network topology. In addition, we have transformed our solution to an easy-to-implement distributed algorithm, that converges towards the globally optimal topology.