Strategyproof Mechanisms towards Dynamic Topology Formation in Autonomous Networks

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.

[1]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[2]  Christos H. Papadimitriou,et al.  Algorithms, Games, and the Internet , 2001, ICALP.

[3]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[4]  Vikram Srinivasan,et al.  Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[6]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  S. Fischer Selfish Routing , 2002 .

[9]  Tim Roughgarden,et al.  Selfish Routing , 2002 .

[10]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[11]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.